Shortest path algorithms: A computational study with the C programming language

The main purpose of this study is to evaluate the computational efficiency of algorithms for calculating shortest paths when they are correctly coded by using the C programming language. The eight algorithms that we selected for this experiment are the most efficient, either measured in terms of worst-case bounds or marked as such from previous computational studies; they include the redistributive heap algorithm. We suggest computer implementations that use the full power of C. In particular, the network representation and the various data structures used to keep the scan eligible list may be managed by using only additions and no multiplications, while it is not possible with FORTRAN. These capabilities, unique to C, yield several interesting conclusions: one may expect to speed up a shortest path algorithm by a factor of 20%; in some cases, this factor may reach 30%. Interestingly, the level of programming difficulty required to achieve these benefits is not greater than that required by implementations using arrays.     

Identification by parameter bounds in adaptive control

Approximate solutions are suggested for receding horizon dual control to guarantee acceptable control performance of a plant with large a priori parameter uncertainties under poor excitation by the output reference and to satisfy the requirement of very fast adaptation using knowledge available on sensor and performance in industrial applications of adaptive control. the aim of the paper is to present several levels of interaction between on-line identification and control performance using parameter bounds. an interesting theorem shows that parameter bounding is a necessary part of the solution of the dual control problem. Starting from the complete separation of identification and control, various approximations are presented at different levels of optimality. Finally, the exact solution of the dual control problem is found for static gain adaptation, which implicitly involves a parameter-bounding identification procedure.     

Lower and upper bounds for the two-echelon capacitated location-routing problem

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times.     

Reactive Oxygen Species and Long Non-Coding RNAs,an Unexpected Crossroad in Cancer Cells

Long non-coding RNAs (lncRNA) have recently been identified as key regulators of oxidative stress in several malignancies. The level of reactive oxygen species (ROS) must be constantly regulated to maintain cancer cell proliferation and chemoresistance and to prevent apoptosis. This review will discuss how lncRNAs alter the ROS level in cancer cells. We will first describe the role of lncRNAs in the nuclear factor like 2 (Nrf-2) coordinated antioxidant response of cancer cells. Secondly, we show how lncRNAs can promote the Warburg effect in cancer cells, thus shifting the cancer cell’s “building blocks” towards molecules important in oxidative stress regulation. Lastly, we explain the role that lncRNAs play in ROS-induced cancer cell apoptosis and proliferation.     

Well-founded and stationary models of logic programs

We investigate the class ofstationary or partial stable models of normal logic programs. This important class of models includes all (total)stable models, and, moreover, thewell-founded model is always its smallest member. Stationary models have several natural fixed-point definitions and can be equivalently obtained as expansions or extensions of suitable autoepistemic or default theories. By taking a particular subclass of this class of models one can obtain different semantics of logic programs, including the stable semantics and the well-founded semantics. Stationary models can be also naturally extended to the class of all disjunctive logic programs. These features of stationary models designate them as an important class of models with applications reaching far beyond the realm of logic programming.Partially supported by the National Science Foundation grant #IRI-9313061.     

A study on helical surface generated by the primary peripheral surfaces of ring tool

Often in the engineering practice, cutting tools bounded by primary peripheral surfaces of revolution are used because of their effectiveness. Among these, ring and tangential tools can be used for the generation of constant pitch cylindrical helical surfaces. In this paper, we present an algorithm for the profiling of these types of tools. The algorithm is based on the topological representation of the tool’s primary peripheral surface. The main goal is to devise a methodology for the profiling of tools whose surfaces are reciprocally enveloping with cylindrical helical surfaces. We present a numerical example for the numerical determination of the axial section form for this type of tools. The application method for this algorithm was developed in the CATIA graphical design environment within which the procedure is developed as a vertical application. In addition, we present a solution for the shape correction of the tool’s axial cross-section by considering the existence of singular points on the profile of the helical surface to be generated where multiple normals to the surface exist.     

Adaptive harmonic control

This paper presents adaptive feedback control at individual harmonics for cancellation of periodic disturbances. It is shown that the original idea, that has been around for a long time, can be developed much further to produce robust and highly adaptable controllers. Frequency selective feedback harmonic cancellation (FHC) is presented. Simulations illustrate the effectiveness of the method.     

Worst-case dual control: Basic results

This paper considers the worst-case-dual control problem and discusses its basic properties. The Bellman equation is derived and some simple cases are analysed. Unmodelled dynamics bounded in l ₁norm is accounted for. The case of infinite horizon cost function is considered for a special case. Finally simulations show the practical potential of these type of results.