The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite dimensional prob...

It is common in many countries that engineers having an academic degree in Civil Engineering are appointed responsible for different tasks related to Bridge Engineering. However, there are serious questions about whether formal university courses in civil engineering could cover the needs of a bridge engineer to fulfill his or her job successfully. Regarding the recent significant advances in t...

In 2007, Riverside County, California, after identifying a gap between the substance abuse prevention and treatment services it offered to individuals, developed the Individual Prevention Services (IPS) program to fill that gap. Over the past two years, the IPS program has provided individualized prevention services on a one-on-one basis at all seven of the county's substance abuse treatment cl...

Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debugging techniques such as conditional and data breakpoints help to find error causes in simple cases, they fail to effectively bridge the cause-effect gap in many situations. Dynamic query-based debuggers offer programm...

The main aim of this research is to propose a new Two-Level Adaptive Branch Prediction scheme, based on additional correlation information. Conventional two-level adaptive branch prediction exploits the correlation between the outcome of a branch and the path followed through a program to reach the branch. Typically the program path is identified by recording whether each branch on the path is ...

Stratiied Datalog with integer (gap)-order (or Datalog :;<z) is considered. A Datalog :;<z-program is said to be safe ii its bottom-up processing terminates on all valid inputs. We prove that safe Datalog :;<z-programs do not have eeective syntax in the sense that there is no recursively enumerable set S of safe Datalog :;<z-programs such that every safe Datalog :;<z-program is equivalent to a ...

In this paper we give a GAP program for computing the Szeged and the PI indices of any graph. Also we compute the Szeged and PI indices of VC(5)C(7) [ p,q] and HC(5)C(7) [ p,q] nanotubes by this program.

In this paper, we propose a chance-constrained mathematical program for fixed broadband wireless networks under unreliable channel conditions. The model is reformulated as integer linear program and valid inequalities are derived for the corresponding polytope. Computational results show that by an exact separation approach the optimality gap is closed by 42 % on average.

We designed a simple but sensitive program, IntraCompare, for identifying internal repeats in families of homologous proteins. The protein sequences are aligned (Clustal X), the regions to be compared are selected, and all potential repeat sequences are compared with all others. The output provides comparison scores (GAP program) expressed in standard deviations.