Based on the well-known Leverrier algorithm, a simple explicit solution to right factofization of a linear system is established. This solution is expressed by the controllability matrix of the given system and a symmetric operator matrix. Applications of this solution to a type of generalized Sylvester matrix equations and the problem of parametric eigenstructure assignment by state feedback a...

SCADA systems represent a challenging scenario where the management of critical alarms is crucial. Their response to these alarms should be efficient and fast in order to mitigate or contain undesired effects. This work presents a mechanism, the Adaptive Assignment Manager (AAM), that will aid to react to incidences in a more efficient way by dynamically assigning alarms to the most suitable hu...

We present a scheme for the semiautomatic creation of 3D models through velocity-controlled surface deformations. Our surface representation consists of oriented points with volatile inter-neighboring point linkage. The surface is resampled in order to maintain an even distribution of points. Points created during resampling inherit their characteristics from their progenitors. Our surface repr...

The ordered weighted averaging (OWA) operator is one of the most used techniques in operator’s aggregation procedure. This paper proposes a new assignment algorithm by using OWA and different extensions it Branch-and-bound algorithm. process based on use average distance (OWAD) induced OWAD (IOWAD). We present as with (BBAOWAD) IOWAD (BBAIOWAD). main advantage this approach that we can obtain m...

Advanced traffic management based on the Dynamic Resource Assignment allows a broadband satellite system such as EuroSkyWay (ESW) to dynamically assign the resources of connections. The mechanisms of the dynamic assignment exploit variations of Burstiness exhibited by real time and non real time Variable Bit Rate traffic sources to perform an optimised resource redistribution. The efficiency of...

we consider the transitive linear maps on the operator algebra $b(x)$for a separable banach space $x$. we show if a bounded linear map is norm transitive on $b(x)$,then it must be hypercyclic with strong operator topology. also we provide a sot-transitivelinear map without being hypercyclic in the strong operator topology.

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

Automatic test data generation usually concerns identifying input values that cause a selected path to execute. If a given path involves pointers, then input values may be represented in terms of 2-dimensional dynamic data structures such as lists or trees. When testing is conducted for programs in the presence of pointers, it is very important to identify a shape of the input data structure de...

Whenever an array element is accessed, Java virtual machines execute a compare instruction to ensure that the index value is within the valid bounds. This reduces the execution speed of Java programs. Array bounds check elimination identifies situations in which such checks are redundant and can be removed. We present an array bounds check elimination algorithm for the Java HotSpot VM based on ...

In this paper, we describe an approach for solving the quadratic assignment problem (QAP) that is based on genetic algorithms (GA). It will be shown that a standard canonical GA (SGA), which involves genetic operators of selection, reproduction, crossover, and mutation, tends to fall short of the desired performance expected of a search algorithm. The performance deteriorates significantly as t...