The goal of the project is to examine a polynomial-time probabilistic algorithm to compute the minimum distance of an arbitrary, non-binary, linear error-correcting code. Only the binary case was done in A. Foster’s honors project [F]. For the non-binary case a new function was needed in the GAP kernel. This function was added by Steve Linton of St. Andrews, Scotland, one of GAP’s kernel mainta...

Knowing the authors of a binary program has significant application to forensics of malicious software (malware), software supply chain risk management, and software plagiarism detection. Existing techniques assume that a binary is written by a single author, which does not hold true in real world because most modern software, including malware, often contains code from multiple authors. In thi...

The paper introduces an operation on a binary tree, called binary tree roll, or roll of a binary tree. Two versions of the binary tree roll, counterclockwise and clockwise, are presented. The operations are mathematically defined and graphically presented. It is explained how the binary tree roll actually coincides with the process of turning the entire tree 90 degrees counterclockwise or clock...

In wide area measurement systems, PMUs are the main component measuring real time synchronized data from different buses. Installation of PMUs at all buses is a primary way to provide full observability of the power network. However, it is not practical in real networks due to the relatively expensive cost of PMUs and other technical limitations. Optimal PMU Placement (OPP) is an optimization p...

Binary search trees are one of the oldest and most common dictionary data structures. The most common implementation of a binary tree uses two pointers in each node to point to the children. This representation however suffers from significant multiplicative overhead for storage of data. Each datum incurs an overhead of two pointers. In common programming languages, where each node is represent...

Component contract, as an interface specification, is a good idea for improving software quality. This paper describes the technique of dynamically attaching behavioral contracts a posteriori to binary component with no explicit contracts discipline, and presents a model based on the Common Language Infrastructure (CLI) to organize component contracts in the form of metadata and to perform effi...

We consider the queueing maximal covering location-allocation problem QM-CLAP with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the subproblems, as well as the entire model...

A discontinuity exists between modeling languages and object-oriented programming languages. This discontinuity is a consequence of ambiguous notions in modeling languages and lack of corresponding notions in objectoriented programming languages. It hinders the transition between a software design and its implementation, and vice versa. Thus, it hampers the implementation and the maintenance pr...

Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques, which is based on Mathematical Programming with Equilibrium Constraints (MPECs). We first reformulate the binary program as an equivalent augmented biconvex optimization problem with a bilinear equality cons...

A new method for data hiding in binary images based on block pattern coding and dynamic programming with distortionminimizing capabilities is proposed. Up to three message data bits can be embedded into each 2 × 2 block in an input image by changing the block’s pixel pattern into another, which represents the value of the message data bits as a code according to a block pattern encoding table. ...