Most genome rearrangements (e.g., reversals and translocations) can be represented as 2breaks that break a genome at 2 points and glue the resulting fragments in a new order. Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While multi-break rearrangements were studied in depth for k = 2 breaks, the k-break distance problem for arb...

the problem of creation and subsequent propagation of bore has been examined and studied by a number of investigators who they were interested in unsteady flow problems for which sudden changes in either flow or depth or both occur. in this paper, the shock conditions and the method of characteristics for predicting the downstream flooding produced by a dam failure. in the dam-break problem whe...

Simulation of free surface flow and sudden wave profile are recognized as the most challenging problem in computational hydraulics. Several Eulerian/Lagrangian approaches and models can be implemented for simulating such phenomena in which the smoothed particle hydrodynamics method (SPH) is categorized as a proper candidate. The incompressible SPH (ISPH) method hires a precise incompressible hy...

introduction the aim of this study was toinvestigate the sterilization potential of atmospheric pressure plasma jet (appj) and interactions of this technology with double-stranded dna using the polymerase chain reaction (pcr) and single-strand conformation polymorphism (sscp) techniques. materials and methods the plasma jet was produced through a high voltage sinusoidal power supplyusing a mixt...

In this paper we regard a break scheduling problem originating in the area of supervision personnel. This complex task requires the assignment of several breaks per shift, satisfying various constraints reflecting labour rules, staffing requirements and ergonomic criteria. To solve this problem we propose a memetic algorithm combining a genetic algorithm and a local search procedure. We evaluat...

This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without place constraints are considered. The algorithm uses Benders cuts to obtain feasible homeaway pattern sets in few iterations and this approach leads to significant reductions in computation time for hard instances. Fu...

New results in cryptanalysis are constantly being presented in the academic community, and this process poses no problems. Paradoxically, the discovery of a method that would allow breaking for example an RSA key in the same time as it takes to encrypt a message with it, would have serious and disturbing impacts on sectors such as finance and defence, and would in fact be impossible to publish ...