Immune-based algorithms for dynamic optimization

The main problem with biologically inspired algorithms (like evolutionary algorithms or particle swarm optimization) when applied to dynamic optimization is to force their readiness for continuous search for new optima occurring in changing locations. Immune-based algorithm, being an instance of an algorithm that adapt by innovation seem to be a perfect candidate for continuous exploration of a search space. In this paper we describe various implementations of the immune principles and we compare these instantiations on complex environments.     

Using cross-layer metrics to improve the performance of end-to-end handover mechanisms

Network centric handover solutions for all IP wireless networks usually require modifications to network infrastructure which can stifle any potential rollout. This has led researchers to begin looking at alternative approaches. Endpoint centric handover solutions do not require network infrastructure modification, thereby alleviating a large barrier to deployment. Current endpoint centric solutions capable of meeting the delay requirements of Voice over Internet Protocol (VoIP) fail to consider the Quality of Service (QoS) that will be achieved after handoff. The main contribution of this paper is to demonstrate that QoS aware handover mechanisms which do not require network support are possible. This work proposes a Stream Control Transmission Protocol (SCTP) based handover solution for VoIP called Endpoint Centric Handover (ECHO). ECHO incorporates cross-layer metrics and the ITU-T E-Model for voice quality assessment to accurately estimate the QoS of candidate handover networks, thus facilitating a more intelligent handoff decision. An experimental testbed was developed to analyse the performance of the ECHO scheme. Results are presented showing both the accuracy of ECHO at estimating the QoS and that the addition of the QoS capabilities significantly improves the handover decisions that are made.     

<Emphasis Type="Italic">New-Age</Emphasis>: A Negative Bias Temperature Instability-Estimation Framework for Microarchitectural Components

Degradation of device parameters over the lifetime of a system is emerging as a significant threat to system reliability. Among the aging mechanisms, wearout resulting from Negative Bias Temperature Instability (NBTI) is of particular concern in deep submicron technology generations. While there has been significant effort at the device and circuit level to model and characterize the impact of NBTI, the analysis of NBTI’s impact at the architectural level is still at its infancy. To facilitate architectural level aging analysis, a tool capable of evaluating NBTI vulnerabilities early in the design cycle has been developed that evaluates timing degradation due to NBTI. The tool includes workload-based temperature and performance degradation analysis across a variety of technologies and operating conditions, revealing a complex interplay between factors influencing NBTI timing degradation.     

Betriebsinformatik und Wirtschaftsinformatik als notwendige anwendungsbezogene Ergänzung einer allgemeinen Informatik – Vorschläge zur Verbesserung der akademischen Ausbildung auf dem Gebiet der automatisierten Datenverarbeitung in der Bundesrepublik Deutschland

Zusammenfassung  Nachdruck eines Aufsatzes aus elektronische datenverarbeitung 11(11)1969:544–548. This article is also available in English via and : Grochla E (2008) Corporate Information Systems Engineering and Business and Information Systems Engineering as a Necessary Application-Oriented Extension of General Computer Science – Proposals for Enhancing Academic Education in the Field of Automated Data Processing in the Federal Republic of Germany. Bus Inf Syst Eng. doi .

---

     

An AP structure with Finslerian Flavor: Path equations

The Bazanski approach to deriving paths is applied to Finsler geometry. The approach is generalized and applied to a new developed geometry called “Absolute parallelism with Finslerian Flavor” (FAP). A set of path equations is derived for the FAP. It is a horizontal (h) set. A striking feature in this set is that the coefficient of the torsion term jumps by a step of one-half from one equation to the other. It is tempting to believe that the h-set admits some quantum features. Comparisons with the corresponding sets in other geometries are given. Conditions for reducing the set of path equations obtained to well-known path equations in some geometries are summarized in a schematic diagram.     

Internet-Based Control of Industrial Automation Systems

This paper presents a new method for Internet-based control of linear automation systems by combining the predictive control and the variable sampling period strategies. In this way, event driven sensors are implemented and the sensors are triggered to sample the outputs of the plant, when new control input signals are received by the actuators. Therefore, at each sampling instant, total control loop delay will be equal to the sampling period which is unknown. In order to deal with Internet effects, associated with a range of pre-specified time delays, appropriate zero-order hold discrete-time models of the Internet-based plant are calculated off-line, and based on them, some stabilizing control signals are constructed on-line. This control signals are then packed in the control-side packet, transmitted back to the plant-side and received by a time delay compensator module. According to the actually occurred time delay in the loop, this module selects a single entry of the received control vector for each actuator, and applies them to the plant, through zero-order hold elements. Simultaneously, the sensors are triggered to measure the new plant data, the plant-side packet is assembled and transmitted to the control-side. The above procedure is then repeated from start. A less conservative switched quadratic Lyapunov is used here for stabilizing controller design. Simulation studies on well-known benchmark problems demonstrate the effectiveness of the proposed method.     

A Minimal Closed-form Solution for the Perspective Three Orthogonal Angles (P3oA) Problem: Application To Visual Odometry

We provide a simple closed-form solution to the Perspective three orthogonal angles (P3oA) problem: given the projection of three orthogonal lines in a calibrated camera, find their 3D directions. Upon this solution, an algorithm for the estimation of the camera relative rotation between two frames is proposed. The key idea is to detect triplets of orthogonal lines in a hypothesize-and-test framework and use all of them to compute the camera rotation in a robust way. This approach is suitable for human-made environments where numerous groups of orthogonal lines exist. We evaluate the numerical stability of the P3oA solution and the estimation of the relative rotation with synthetic and real data, comparing our results to other state-of-the-art approaches.     

Iterative Constrained Minimization for Vectorial TV Image Deblurring

In this paper, we consider the problem of restoring blurred noisy vectorial images where the blurring model involves contributions from the different image channels (cross-channel blur). The proposed method restores the images by solving a sequence of quadratic constrained minimization problems where the constraint is automatically adapted to improve the quality of the restored images. In the present case, the constraint is the Total Variation extended to vectorial images, and the objective function is the \(\ell _2\) norm of the residual. After proving the convergence of the iterative method, we report the results obtained on a wide set of test images, showing that this approach is efficient for recovering nearly optimal results.     

Infinitesimal perturbation analysis of a single-stage fluid queue with loss feedback and non-responsive competing traffic

In this paper we perform Infinitesimal Perturbation Analysis (IPA) for a single-stage stochastic fluid queue that is shared between two competing sources, one that employs additive loss-feedback congestion control and the other that employs no congestion-control (i.e., it is unresponsive). This scenario is applicable within the realm of computer communication networks particularly at bottleneck router queues where multiple and diverse flows compete for bandwidth. We optimize the tradeoff between total loss volume and queue workload (a measure for queueing delay). Although a sound knowledge of the system’s dynamics is required to derive the IPA gradient estimators, no knowledge of the underlying probability distributions governing the system is required. What results are fairly simple counting processes, whose values can be computed directly from an ongoing live stream of traffic.