This paper provides a simple approach for solving a semidefinite program, SDP. As is common with many other approaches, we apply a primal-dual method that uses the perturbed optimality equations for SDP, Fμ(X, y, Z) = 0, where X, Z are n × n symmetric matrices and y ∈ Rm. However, as in Kruk et al [19], we look at this as an overdetermined system of nonlinear (bilinear) equations on vectors X, ...

We present three simple and efficient protocol constructions to solve Yao’s Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit evaluations (subtraction and XOR) and a single decryption. The second construction uses an untrusted th...

We present a new genetic algorithm for playing the game of Mastermind. The algorithm requires low running times and results in a low expected number of guesses. Its performance is comparable to that of other meta-heuristics for the standard setting with four positions and six colors, while it outperforms the existing algorithms when more colors and positions are examined. The central idea under...

Scalarization approaches to purposely generating epsilon-efficient solutions of multiobjective programs are investigated and a generic procedure for computing these solutions is proposed and illustrated with an example. Real-life decision making situations in which the solutions are of significance are described.

The goal of our research is to provide scalable and efficient solutions for RDF knowledge management. There is significant research concerning schemata and tools for RDF storage and efficient querying. There is also significant research into ontology design, representation, extraction and alignment, and into representing uncertainty in ontologies. However, there are not efficient and scalable s...