Related Research Articles
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path or a Hamiltonian cycle exists in a given graph. Both problems are NP-complete.
In cryptography, a private information retrieval (PIR) protocol is a protocol that allows a user to retrieve an item from a server in possession of a database without revealing which item is retrieved. PIR is a weaker version of 1-out-of-n oblivious transfer, where it is also required that the user should not get information about other database items.
The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use one-way functions: mathematical operations that are fast to compute, but hard to reverse. For example, they enable encrypting a message, but reversing the encryption is difficult. If solving the DHP were easy, these systems would be easily broken.
Distributed key generation (DKG) is a cryptographic process in which multiple parties contribute to the calculation of a shared public and private key set. Unlike most public key encryption models, distributed key generation does not rely on Trusted Third Parties. Instead, the participation of a threshold of honest parties determines whether a key pair can be computed successfully. Distributed key generation prevents single parties from having access to a private key. The involvement of many parties requires Distributed key generation to ensure secrecy in the presence of malicious contributions to the key calculation.
In topological graph theory, an embedding of a graph on a surface is a representation of on in which points of are associated with vertices and simple arcs are associated with edges in such a way that:
In computational mathematics, a matrix-free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not store the coefficient matrix explicitly, but accesses the matrix by evaluating matrix-vector products. Such methods can be preferable when the matrix is so big that storing and manipulating it would cost a lot of memory and computing time, even with the use of methods for sparse matrices. Many iterative methods allow for a matrix-free implementation, including:
Kyambogo University (KYU) is a public university in Uganda. It is one of the eight public universities and degree-awarding institutions in the country with the motto, "Knowledge and Skills for Service."
A program structure tree (PST) is a hierarchical diagram that displays the nesting relationship of single-entry single-exit (SESE) fragments/regions, showing the organization of a computer program. Nodes in this tree represent SESE regions of the program, while edges represent nesting regions. The PST is defined for all control flow graphs.
Lis is a scalable parallel software library for solving discretized linear equations and eigenvalue problems that mainly arise in the numerical solution of partial differential equations by using iterative methods. Although it is designed for parallel computers, the library can be used without being conscious of parallel processing.
In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called simple if it does not have any repeated vertices; the length of a path may either be measured by its number of edges, or by the sum of the weights of its edges. In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete. This means that the decision problem cannot be solved in polynomial time for arbitrary graphs unless P = NP. Stronger hardness results are also known showing that it is difficult to approximate. However, it has a linear time solution for directed acyclic graphs, which has important applications in finding the critical path in scheduling problems.
Linked timestamping is a type of trusted timestamping where issued time-stamps are related to each other.
Roland Carl Backhouse is a British computer scientist and mathematician. As of 2020, he is Emeritus Professor of Computing Science at the University of Nottingham.
The Parallel High Performance Preconditioners (hypre) is a library of routines for scalable (parallel) solution of linear systems. The built-in BLOPEX package in addition allows solving eigenvalue problems. The main strength of Hypre is availability of high performance parallel multigrid preconditioners for both structured and unstructured grid problems.
Extended static checking (ESC) is a collective name in computer science for a range of techniques for statically checking the correctness of various program constraints. ESC can be thought of as an extended form of type checking. As with type checking, ESC is performed automatically at compile time. This distinguishes it from more general approaches to the formal verification of software, which typically rely on human-generated proofs. Furthermore, it promotes practicality over soundness, in that it aims to dramatically reduce the number of false positives at the cost of introducing some false negatives. ESC can identify a range of errors that are currently outside the scope of a type checker, including division by zero, array out of bounds, integer overflow and null dereferences.
Ofer Dekel is a computer science researcher in the Machine Learning Department of Microsoft Research. He obtained his PhD in Computer Science from the Hebrew University of Jerusalem and is an affiliate faculty at the Computer Science & Engineering department at the University of Washington.
In non-parametric statistics, the Theil–Sen estimator is a method for robustly fitting a line to sample points in the plane by choosing the median of the slopes of all lines through pairs of points. It has also been called Sen's slope estimator, slope selection, the single median method, the Kendall robust line-fit method, and the Kendall–Theil robust line. It is named after Henri Theil and Pranab K. Sen, who published papers on this method in 1950 and 1968 respectively, and after Maurice Kendall because of its relation to the Kendall tau rank correlation coefficient.
Eriabu Lugujjo is an electrical engineer, academic and academic administrator. He is the current vice chancellor of Ndejje University, a private Christian university, which was licensed by the Uganda National Council for Higher Education, in 1992. He was appointed to that position in July 2012.
Professor Robert Ikoja-Odongo, also Robert Ikoja Odongo or simply Robert Ikoja, is a Ugandan academic and academic administrator. He is the current Vice Chancellor of Soroti University, a public University in Uganda.
Ruth Doreen Mutebe is a Ugandan accountant, businesswoman, and corporate executive, who serves as the Head of Internal Audit at Umeme Limited, the largest distributor of electric power in Uganda.
Aminah Zawedde, is a Ugandan computer scientist. academic and public administrator, who serves as the permanent secretary of the Uganda Ministry of ICT and National Guidance since 15 July 2021. Before that Zawedde was a lecturer and researcher in the School of Computing and Informatics Technology at Makerere University, the oldest and largest public university in Uganda.
References
- ↑ Businge, Conan (7 September 2012). "Barya Starts Own University". New Vision (Kampala). Retrieved 9 February 2015.
- ↑ Kiyaga, Abdu (7 September 2012). "Baryamureeba Starts Own University". Daily Monitor (Kampala). Retrieved 9 February 2015.
- 1 2 3 UTAMU (November 2013). "Detailed Curriculum Vitae of Professor Venansius Baryamureeba" (PDF). Uganda Technology and Management University (UTAMU). Retrieved 9 February 2015.
- ↑ Kajoba, Nicholas (12 July 2009). "My First Job: Venansius Baryamureeba". New Vision (Kampala). Retrieved 9 February 2015.
- ↑ The Observer (Uganda) via AllAfrica.com (27 March 2013). "Uganda: Makerere Lecturers Defect To Baryamureeba's UTAMU" . Retrieved 9 February 2015.
- ↑ "The Enhanced Digital Investigation Process Model". DFRWS. Retrieved 26 January 2023.
- ↑ Wakabi-Waiswa, Peter P.; Baryamureeba, Venansius; Sarukesi, Karunakaran (2011). "Optimized Association Rule Mining with genetic algorithms". 2011 Seventh International Conference on Natural Computation. Vol. 2. pp. 1116–1120. doi:10.1109/ICNC.2011.6022183. ISBN 978-1-4244-9950-2. S2CID 38955107.
- ↑ Baryamureeba, Venansius; Steihaug, Trond (2006). "On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming". In Lirkov, Ivan; Margenov, Svetozar; Waśniewski, Jerzy (eds.). Large-Scale Scientific Computing. Lecture Notes in Computer Science. Vol. 3743. Berlin, Heidelberg: Springer. pp. 629–637. doi:10.1007/11666806_72. ISBN 978-3-540-31995-5.
- ↑ Baryamureeba, Venansius (2002). "Solution of large-scale weighted least-squares problems". Numerical Linear Algebra with Applications. 9 (2): 93–106. doi:10.1002/nla.232. ISSN 1070-5325. S2CID 18869972.
- ↑ Baryamureeba, Venansius (1 December 2001). "The Impact of Equal Weighting of Low- and High-Confidence Observations on Robust Linear Regression Computations". BIT Numerical Mathematics. 41 (5): 847–855. doi:10.1023/A:1021912522498. ISSN 1572-9125. S2CID 118054436.
- ↑ Baryamureeba, Venansius; Steihaug, Trond; Zhang⋆, Yin (1999). "Application of a Class of Preconditioners to Large Scale Linear Programming Problems". In Amestoy, Patrick; Berger, Philippe; Daydé, Michel; Ruiz, Daniel; Duff, Iain; Frayssé, Valérie; Giraud, Luc (eds.). Euro-Par'99 Parallel Processing. Lecture Notes in Computer Science. Vol. 1685. Berlin, Heidelberg: Springer. pp. 1044–1048. doi: 10.1007/3-540-48311-X_146 . ISBN 978-3-540-48311-3.
- ↑ Baryamureeba, Venansius (2004). "Solution of Robust Linear Regression Problems by Krylov Subspace Methods". In Lirkov, Ivan; Margenov, Svetozar; Waśniewski, Jerzy; Yalamov, Plamen (eds.). Large-Scale Scientific Computing. Lecture Notes in Computer Science. Vol. 2907. Berlin, Heidelberg: Springer. pp. 67–75. doi:10.1007/978-3-540-24588-9_6. ISBN 978-3-540-24588-9.
