Search

In distributed system, concurrent accesses lead to lock contention which greatly increases response time. Cache can reduce response time, but cannot gain scalability. Currently, the common solution is to modify the caching algorithm itself, although the scalability can be improved, the hit ratio hurt. In this paper, we propose a system framework, called MLB-Wrapper, which resolves the scalability issue in distributed systems. The framework does not modify the cache algorithm itself. Therefore, it preserves high cache hit ratio about the replacement algorithms. Multi-levels distributed cache is used in MLB-Wrapper which adopts batching technique in every level to eliminate the lock contention. Furthermore, MLB-Wrapper is flexible because different replacement algorithms can be used in each level. We describe the main idea and the detailed implementation of MLB-Wrapper in this paper. Experiment results show that, in the intensive concurrent environment, MLB-Wrapper can not only reduce lock contention but also have higher scalability. [ABSTRACT FROM AUTHOR]

In this paper, a fragile watermarking algorithm for H.264/AVC compressed video using CAVLC mapping is proposed. By extensive analysis with several video sequences, we observed that not all code words appear in the bit stream. Watermark bits can be embedded by mapping used CAVLC code words to unused code words. During the embedding process, the eligible code words are first identified, and then the mapping rules between these code words and the watermark bits are established. The watermark information can be extracted directly from the encoded stream without resorting to the original video, and merely requires decoding the CAVLC code from bit stream rather than decoding the whole video. Experimental results show that the proposed watermarking scheme can effectively embed information with little bit rate increase and almost no quality degradation. [ABSTRACT FROM AUTHOR]

Data integration may have no meaning without data provenance. ETL is an important step of data integration. To trace the provenance of ETL process is significant for data integration. A method based on inverse functions is described in this paper. Firstly, the ETL process is divided into three layers; then we analyzed each layer and designed the inverse mechanism, and described the algorithms of provenance tracing based on this. At last, we take an instance to show the result. [ABSTRACT FROM AUTHOR]

With the rapid development of the cloud and data-intensive computing, many data center network are growing more large scale, and the number of servers is increasing at an exponential rate. As commodity-class PCs is used in the current DCN, failures caused by node failure, rack failures, link failures and routing failures become a very common phenomenon in the parallel processing of data blocks, tasks, and job scheduling. DCell is a novel network structure adapted to the DCN, which uses a recursively-defined structure to interconnect servers. Although DCell is fault tolerant, and addresses various failures, it has many questions. If the destination nodes are the failure, no matter what cannot route to them. The existing technology of DCell fail to guarantee durability and reliable for the data on the node. This paper proposes a novel idea that a replica is placed in the node of the layer by the fixed-point single-source shortest path, and there is at least one replica in each layer of the DCell. According to the proposed placement strategy of replicas, we suppose a mechanism to restore lost replica based on the neighboring nodes in the same path. Finally, we simulate and validate algorithm of placement and repair for replica. Experiments show that our algorithm has obvious effect to improve the reliability of data. [ABSTRACT FROM AUTHOR]

This paper suggests an Intelligent Control Algorithm for optimizing the charge and discharge of Secondary battery. With precision control of voltage and current levels in secondary batteries, high performance in battery life can be achieved and the problems of overcharging and over discharging in batteries can be avoided. By regulating the charge and discharge currents in a battery, voltage can be balanced. As the behavior of temperature and impedance of a battery is highly non-linear in nature, balancing current and voltage is very difficult. This paper proposes an Optimizing Intelligent Algorithm which can efficiently control the voltage and current levels by overcoming the problem of non-linear behavior of impedance in batteries. Results of the proposed algorithm from control circuit in an experiment are shown to provide efficient control of voltage and current levels in a battery increasing the battery life. [ABSTRACT FROM AUTHOR]

This paper deals with a path planning of space robot which includes a collision avoidance algorithm. For the future space robot operation, autonomous and self-contained path planning is mandatory to capture a target without the aid of ground station. Especially the collision avoidance with target itself must be always considered. Once the location, shape and grasp point of the target are identified, those will be expressed in the configuration space. And in this paper a potential method, Laplace potential function, is applied to obtain the path in the configuration space in order to avoid so-called deadlock phenomenon. Some improvement on the generation of the path has been observed by applying path smoothing method, which utilizes the spline function interpolation. This reduces the computational load and generates the smooth path of the space robot. The validity of this approach is shown by a few numerical simulations. [ABSTRACT FROM AUTHOR]

This paper presents a combined model approach of Fuzzy Logic and Genetic Algorithm applied for non-linear behavioral compensation of Silicon Controlled Rectifier (SCR), for its improved performance (optimal variable output voltage). The optimized parametric compensation of SCR will be done by amalgamated algorithm of Fuzzy Logic Control and Genetic Algorithm. It is a shift from existing practice of Fuzzy Logic based control /compensation, as reported in the literature. In this work, a Fuzzy Logic based optimal control system has been developed for input voltage regulation of SCR, which is further optimized by Genetic Algorithm. The input voltage regulation of SCR is needed to meet the varying load current demand in various industrial applications of the device. The proposed scheme as presented in this paper leads to the optimal regulation of input voltage for SCR. The results have shown a remarkable reduction in the error which was otherwise existing in the device and its application circuit. The accuracy level at the output of the SCR after the implementation of the proposed amalgamated algorithm is ranging between 99.0 to 99.5%. It also suits the nonlinearly varying load current requirement for a given industrial system employing SCR. [ABSTRACT FROM AUTHOR]

In this paper, we present an interesting filtering algorithm to perform accurate estimation in jump Markov nonlinear systems, in case of multi-target tracking. With this paper, we aim to contribute in solving the problem of model based body motion estimation by using data coming from visual sensors. The Interacting Multiple Model (IMM) algorithm is specially designed to track accurately targets whose state and/or measurement (assumed to be linear) models changes during motion transition. However, when these models are nonlinear, the IMM algorithm must be modified in order to guarantee an accurate track. In order to deal with this problem, the IMM algorithm was combined with the Unscented Kalman Filter (UKF) [6]. Even if the later algorithm proved its efficacy in nonlinear model case; it presents a serious drawback in case of non Gaussian noise. To deal with this problem we propose to substitute the UKF with the Particle Filter (PF). To overcome the problem of data association, we propose the use of the JPDA approach, [12]. To reduce the computational burden of the latter technique, we choose firstly the most likely feasible events by applying a Genetic Algorithm; finally the derived algorithm from the combination of the IMM-PF algorithm and the GA-JPDA approach is noted GA-JPDA-IMM-PF. [ABSTRACT FROM AUTHOR]

Automatic tracking of eyes is a challenging task, with numerous applications in biometrics, security, intelligent human--computer interfaces, and driver's drowsiness detection systems. Eye localization and extraction is, therefore, the first step in approaching such problems. In this paper, a novel approach for high speed iris detection is introduced. The paper proposes to detect iris based on arc separation and circle detection. The new algorithm is more accurate and flexible in addition to its high speed. The key feature of this approach is a new circle detection algorithm. The circle detection is done by something similar to curve fitting or solving an over determined system. [ABSTRACT FROM AUTHOR]

Speed sign detection is an important component of the driver assistant system, which is expected to enhance the safety of the next generation automotive vehicles. This paper outlines the application of Difference of Gaussian (DoG) filter for vision-based speed sign detection systems in difficult lightning conditions, such as nighttime. This paper describes how DoG filter can be used with the popular radial symmetry algorithm and shows that applying DoG filter significantly improves the algorithm's detection performance in such condition. Our experiments compare the performance of radial symmetry algorithm with and without using DoG filter. The paper also discusses methods to reduce computation requirement of filtering an image with the DoG. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a generally applicable algorithm model named Macro-to-Micro Model (M 2M) which is derived from human thinking pattern. The data structure for the nearest neighbor problem based on M 2M can be built in O(1) time. It can also be finished in O(1) time by parallel technology. Moreover, the insertion, deletion and query operation can be completed in constant time without the problem of breaking the balance of tree. And the most noteworthy is that this data structure and preprocessing operation can be shared with most M2M algorithm, so that we can hugely improve the efficiency of the multi-operation problem like image processing and pattern recognition. We mainly focus on the nearest neighbour (NN) searching algorithm in this paper. The M2M approach can achieve the optimal expected time complexity. And the comparative experiment between M 2M and kd-tree shows the great advantage of the former. [ABSTRACT FROM AUTHOR]

An automatic test system for logical properties represents universal quantified properties by Boolean functions. Such a function is evaluated for a large number of values: the test suite. Automatic test systems generate a test suite of the desired size, evaluate the predicate for the values in this test suite, and generate a verdict based on the test results. The automatic test system Gast uses a generic algorithm that generates test suites for arbitrary data types in a systematic way. Such a generic algorithm has as advantages that the generation of values of a new type can be derived automatically, instead of being hand coded. The systematic generation has as advantages that it allows proofs by exhaustive testing, and it is more efficient since test values are not duplicated. In this paper we present a new generic algorithm for the systematic generation of elements of data types that is much more elegant, efficient and flexible than the existing algorithm. We also show a variant that yields the elements in pseudorandom order. Both algorithms are very efficient and lazy; only the elements actually needed are generated. [ABSTRACT FROM AUTHOR]

In view of the traditional wavelet de-noising edge is easily destroyed, which causes the useful detail information of image drop-out problem, this article proposed one kind of algorithm that based on the wavelet transform image auto-adapted de-noising. Firstly, this algorithm carries on the piecemeal match to the image, constructs each similar block the data set; Secondly, it carries on the wavelet transform to it, and takes the noise variance iteration as the foundation; Finally, it makes auto-adapted de-noising processing separately with the soft and hard threshold function to the high or low frequency coefficient. The experimental result shows that after the improvement method applies in the image de-noising, can retain more detail information well, enhance the image peak signal-to-noise ratio (PSNR) and the visual effect has improved. [ABSTRACT FROM AUTHOR]

An automatic lips detection and tracking system based on watershed segmentation and H∞ approach is presented. For some of the lips detection systems, skin/non-skin detection is a prerequisite step to localise the face region and the lips region is then detected from the face region. In this paper, a direct lips detection technique using watershed segmentation without needing preliminary face localisation is proposed. The watershed algorithm segments the input image into regions. Consequently, the cubic spline interpolant lips colour modelling and symmetry detection are used to detect the lips region from the segmented regions. The position of the segmented lips is passed to the H∞ tracking system to predict the location of the lips in the succeeding video frame. The simulation results have revealed a good performance of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents a compression technique called the Tuned Degree-K Zerotree Wavelet (TDKZW) coding. The proposed algorithm uses a set-partitioning approach and the degree of zerotree tested is tuned at each encoding pass to achieve optimal compression performance. TDKZW coding is an embedded coding algorithm that provides a progressive transmission as well as lossless compression. Simulation results show that our proposed algorithm gives a better compression efficiency compared to many existing state-of-the-art lossless image compression algorithms. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive tuning wavelet neural control (ATWNC) is proposed. The proposed ATWNC system is composed of a wavelet neural controller and a smooth compensator. The wavelet neural control is utilized to approximate an ideal controller and the smooth compensator is used to remove the chattering phenomena of conventional sliding-mode control completely. In the ATWNC, the learning algorithm is derived based on the Lyapunov function, thus the closed-loop system's stability can be guaranteed. Then, the proposed ATWNC approach is applied to a second-order chaotic nonlinear system to investigate the effectiveness. Through the simulation results, the proposed ATWNC scheme can achieve favorable tracking performance and the convergence of the tracking error and control parameters can be accelerated by the developed PI adaptation learning algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a new kind of models defined as 1|rj, rt1 픈|∑Cj, which covers a wide range of models in a real-time system such as periodic, aperiodic and sporadic task models. We provide a semi-online algorithm AOPT for such a model with a reasonable assumption. In its worst-case analysis, we demonstrate that the lower bound of the competitive ratio by AOPT equals to 1:5387 while the upper bound is 1:57, which gives rise to a narrow gap of 0:0313. In addition, we generate and utilize a novel proving technique in the process of upper bound analysis, the essence of which is to transform an arbitrary instance to the one with a computable performance ratio. Through such process, we argue that the introduction of some future information will improve the performance of an algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a novel face detection algorithm which extracts a local image structure (LIS) feature and adopts a boosting approach to construct a cascaded face detector. Due to the locality of LIS, the extracted feature is not only robust to lighting variation but also is invariant to small degrees of rotation. With this robust property a multiple-template cascaded detection algorithm has been developed which can avoid rotating the image and also keep the ability to detect slanted faces. Because the multiple templates are constructed in the initialization stage, the proposed face detector can be executed rapidly. Experiments on the BioID face database have shown the efficiency of this method. [ABSTRACT FROM AUTHOR]

In this paper, a real-time method for foreground-background segmentation is proposed. This method extracts structure of background and models it in layered codebook. Layered codebook is a simple data structure containing two codebooks that is defined per pixel. The first layer is main codebook, other is cache codebook, and both contain some codewords relative to a pixel. Main codebook models the current background images and cache codebook is used to model new background images during input sequence. Initially main and cache codebooks are empty. Main codebook is constructed during train sequence. During input sequence, foreground-background is segmented and two-layered codebook is updated. Proposed algorithm can model moving backgrounds, multi backgrounds and illumination changes and this is efficient in both memory and computational complexity. [ABSTRACT FROM AUTHOR]

In recent years, the chip leakage power may be larger than the chip dynamic power because the semiconductor process technology progresses quickly. Therefore, leakage power reduction becomes an important issue for low power circuit designers. In this paper, we propose a heuristic cell replacement algorithm to reduce the leakage power of a logic design. The algorithm contains two procedures. The first one uses a conventional optimization approach and the second one uses a new optimization approach. In the first procedure, the algorithm uses high Vt, normal Vt, and low Vt cells to do cell replacement. In the second procedure, the algorithm employs hybrid threshold voltage standard cell libraries (HTVSCLs) to do cell replacement. The experimental results show that our technique can further reduce the leakage power up to 14.186% by using the second procedure after invoking the first procedure. [ABSTRACT FROM AUTHOR]

The focus of this paper is the problem of recursive estimation for uncertain multisensor linear discrete-time systems. We herein propose a new suboptimal filtering algorithm. The basis of the proposed algorithm is the fusion formula for an arbitrary number of local Kalman filters. The proposed suboptimal filter fuses each local Kalman filter by weighted sum with scalar weights. This filter can be implemented in real time because the scalar weights do not depend on current observations in distinction to the optimal adaptive filter. The examples given, demonstrate the effectiveness and high precision of proposed filter. [ABSTRACT FROM AUTHOR]

Crossbars are main components of communication switches used to construct interconnection networks. Scheduling algorithm controls contention in switch architecture. Several scheduling algorithms were proposed for input-queued crossbar switch architectures. This paper suggests a Dynamic Scheduling Algorithm (DSA). This algorithm changes the priority rotation dynamically based on two parameters: queue occupancy and quality of service of input and output. DSA efficiently utilizes the buffers and at the same time gives good service to the selected inputs and outputs. The simulation results show that DSA saves loss of the cells due to buffer overflow and thus increases the throughput by 2% to 4% compared to its counter part. DSA reduces the latency for prescribed Quality of Service class input output and increases the average latency. [ABSTRACT FROM AUTHOR]

This paper discusses the potential of Particle Swarm Optimisation (PSO) for inducing Bayesian Networks (BNs). Specifically, we detail two methods which adopt the search and score approach to BN learning. The two algorithms are similar in that they both use PSO as the search algorithm, and the K2 metric to score the resulting network. The difference lies in the way networks are constructed. The CONstruct And Repair (CONAR) algorithm generates structures, validates, and repairs if required, and the REstricted STructure (REST) algorithm, only permits valid structures to be developed. Initial experiments indicate that these approaches produce promising results when compared to other BN learning strategies. [ABSTRACT FROM AUTHOR]

Finding a matching with the maximum total weight is the well-known assignment problem of assigning people to jobs and maximize the profits. In this paper, we focus on finding the maximum-weighted matching in Halin graphs. First, we review the method of "shrinking fan". Second, we show how to use the method in finding the maximum-weighted matching in Halin graphs and then a linear algorithm is designed to solve this problem. Finally, it is shown that the algorithm can be easily extended to solve many relative problems. [ABSTRACT FROM AUTHOR]

The set partitioning in hierarchical trees (SPIHT) algorithm is an efficient method for lossy and lossless coding of natural image. This paper modified the original SPIHT algorithm, according to the characteristic that the wavelet coefficients of medical images are more centered on the low frequency than those of natural images. It is based on the idea of insignificant correlation of wavelet coefficient among the high frequency subbands respectively. In this scheme, the modified SPIHT proposes dictator to reduce the interband redundancy. Experimental results show that the proposed technique improves the quality of the reconstructed medical image in both PSNR and perceptual result when compare to JPEG2000 and original SPIHT at the same bit rate. [ABSTRACT FROM AUTHOR]

Face recognition is a biometric identification method which among the other methods such as, finger print identification, speech recognition, signature and hand written recognition has assigned a special place to itself. In principle, the biometric identification methods includes a wide range of sciences such as machine vision, image processing, pattern recognition neural networks and has various applications in film processing, control access networks and etc. There are several methods for recognition among which appearance based methods is one of them. One of the most important algorithms in appearance based methods is linear discriminant analysis (LDA) which is based on statistical pattern recognition. The great drawback for linear discriminant analysis is, although there are great differences in the images for a single person, because of luminous condition and head rotation, this algorithm only considers the average of the images. In this paper we introduce fractional multiple exemplar discriminant analysis (FMEDA) which is a variation of linear discriminant analysis algorithm and then we will compare it with the other well known algorithms in this field. [ABSTRACT FROM AUTHOR]

In this paper, we propose a robust approach to bowling game result indexing. A reliable attribute, i.e. the lane boundary, is detected first. Based on this attribute the rudimentary result frame can be detected. The spectral features of the audio frames of the candidates are employed to determine the exact result frame by applying the DistAl algorithm, a simple and fast constructive neural-network learning algorithm for pattern classification. The color information of the pin mark is then utilized to detect the preliminary bowling pin position. According to the pin arrangement rule and the proposed pin-mark curve the exact position for each pin can be decided. Hence, the bowling game result for each bowl can be indexed. Our experimental results show that the proposed approach is effective and robust. [ABSTRACT FROM AUTHOR]

Blocking effect is the major drawbacks in DCT-based codec at low bit-rate. This kind of degradation probably will affect the judgment of a final user. In this paper, a powerful post-processing filter is proposed in DCT frequency domain. The proposed algorithm uses a shift block within four adjacent DCT blocks to reduce computational complexity. By slightly modifying several DCT coefficients in the shift block, the artifacts that result from quantized and de-quantized process are alleviated. In our simulation results, our scheme can take best quality in both objective and subjective metrics. [ABSTRACT FROM AUTHOR]

To date, much work has been focused on localization in wireless sensor networks and lots of algorithms have been proposed. Most of these algorithms use the reference points to aid the location estimation of unknown nodes. References such as beacon nodes are those whose positions are previously configured or can be acquired via location sensing device, such as GPS. However, most of the previous localization algorithms assume all nodes of the network are cooperative to perform localization. If malicious beacons appear in a wireless sensor networks, none of these algorithms works well. In this paper, we focus on the malicious beacon detection for node localization and propose a simple scheme to approximately detect the malicious beacons and revoke them when localizing. Our scheme uses RSSI measurement information to compute the different RSS values of beacons and exclude the malicious ones. Simulation shows our scheme can effectively differentiate the malicious beacons and get a location accuracy very close to non-malicious beacon environment. [ABSTRACT FROM AUTHOR]

JoBS algorithm performs buffer management and scheduling tasks simultaneously and because of it's high performance, it is likely to be used in Next Generation Networks. Different methodologies have been used in JoBS to guarantee absolute and relative constraints for delay and loss. JoBS uses a simple proportional controller to provide relative delay constraint (RDC). In this paper, we have used PID and Fuzzy PID controllers to improve the JoBS algorithm. We performed some simulations on NS-2 simulator to show the performance of our proposed methods. The simulation results show that our proposed methods outperform ordinary JoBS. [ABSTRACT FROM AUTHOR]

In this paper, we propose a preamble structure and appropriate acquisition algorithms for the uplink cable modem. The proposed preamble consists of a serial concatenation of identical constant amplitude zero autocorrelation (CAZAC) sequences. The proposed preamble is used for the frame detection, coarse symbol timing and carrier frequency recovery for the uplink cable modem compliant to data-over-cable service interface specification (DOCSIS) 2.0. The performance of the synchronization algorithms exploiting the proposed preamble structure is evaluated with various computer simulations. [ABSTRACT FROM AUTHOR]

In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient routing protocol. Since the sensor nodes have limited available power, energy conservation is a critical issue in wireless sensor network for nodes and network life [1]. LEACH is very effective in enhancing nodes' lifetime from routing's aspect. In this paper we propose a novel routing algorithm, pseudo LEACH, which copes with limited transmission range of each node and brings in a pseudo cluster header to improve the energy efficiency of LEACH. The simulation results are shown at the end to verify the performance of our pseudo LEACH. [ABSTRACT FROM AUTHOR]

Paper designed to minimize the handoff latency in IEEE 802.11 wireless local area networks. Mobility management in wireless/mobile network is another major issue. The algorithms for low latency handoff with reduced data loss and signaling overhead needs to be developed. A novel pre-handoff initiation algorithm along with threshold points to reduce the handoff latency during inter and intra subnet handoff is proposed. In our approach the base station (BS) range is divided into two zones namely Z1- Good, Z2 -Average zone based on the signal strength as well as current location. Our pre handoff initiation algorithm is triggered when the mobile unit (MU) enters the threshold minimum (Thmin ) point; it receives the information about the candidate BS with QoS parameters. This reduces the layer 2 ( L2 ) latency and improves the performance of handoff process compared to the conventional blind handoff process. [ABSTRACT FROM AUTHOR]

Normal basis in finite fields has proved to be very useful for fast arithmetic computations. The elements in a normal basis are exactly the roots of a normal polynomial. Hence a normal polynomial is just another way of describing a normal basis. In this paper, we give some computational results of normal polynomial up to degree n = 19 according to the fast algorithm from Chang et al. [1]. [ABSTRACT FROM AUTHOR]

This paper presents the first hardware implementation of the Successive Over-Relaxation (SOR) method for the solution of a 2D Poisson equation. We use Handel-C, a high level language for the implementation of algorithms on hardware, to code and implement our design which we map onto high-performance Field Programmable Gate Arrays (FPGAs), such as, Virtex II Pro, Altera Stratix, and Spartan3L. We use the FPGA vendors' proprietary software to analyze the design implementation performance. Besides, we implement SOR using C++ and compare our timing results with the obtained C++ version results. Our findings prove that SOR in hardware outperforms SOR in software. [ABSTRACT FROM AUTHOR]

This paper presents a new algorithm to determine 1-extendable graphs. Let G = (V,E) be a graph with at least 4 vertices. If the graph G has a perfect matching and every edge of E(G) is contained in a perfect matching of G, then G is said to be 1-extendable. Our algorithm runs in O(¦V¦ ¦E¦) time in the worst case and its complexity is the same as the algorithm developed by Carvalho and Cheriyan [1]. But the procedure of our algorithm is much simpler than the latter one. Furthermore, an implementation is given in details. [ABSTRACT FROM AUTHOR]

Data mining requires access to large and complex data sets. Traditionally, these data set have been stored outside of a database system on exported from the database system before the data mining process begins. This paper discusses an implementation of the data mining algorithm Cobweb, called Cobweb/IDX, that demonstrates some of the benefits of implementing data mining using standard database tools. These benefits include transparent integration in the database environment, minimum user intervention and a user-friendly prediction process. [ABSTRACT FROM AUTHOR]

A feedrate override is a feedrate control signal that is applied to adjust the feedrate, providing the operators a convenient way to manipulate the feedrate during the running of NC code according to different situations either to increase the machining efficiency or the accuracy without revision of NC code and frequent stop/restart of a machining task during the trial running of a NC code. This paper studied response algorithms of feedrate override of S curve feedrate profile. According to diverse values of feedrate override, corresponding algorithms were adopted to adjust the programming feedrate. Through the establishment of a mathematical model of the AC servo system with a lead screw drive, the efficiency of the proposed response algorithms are experimentally verified. The presented algorithms have been applied in practical projects currently. [ABSTRACT FROM AUTHOR]

A comparison of six basic Ant Colony Optimization (ACO) in dynamic environment was studied in this paper. Dynamic Traveling Salesman Problem (TSP) will be used as a dynamic environment. A number of cities are swap over time to make the TSP environment dynamic. A pheromone equalization strategy was applied in all the six ACO to react to the change. Three sets of TSP are used in this experiment. The result will show which of the six basic ant algorithms work best in dynamic environment. [ABSTRACT FROM AUTHOR]

The aim of 3-Parents Differential Evolution (3PDE) is to reduce the parental requirement in the original Differential Evolution (DE). The effectiveness of 3PDE has been reported and is considered as a useful algorithm that performed better convergence to optimality. In general, 3PDE is considered as a useful contribution since it has successfully reduced the parental requirement in DE without significant reductions in absolute optimization performance by gaining better average performance as well as stability. The objective of this paper is to investigate whether certain parameters that are self-adapted in 3PDE can enhance its performance for function optimization. Here, we propose three new algorithms to compare against 3PDE for their performance, which included 3SACr, 3SAF, and 3SAFCr. Fifty run were conducted for each 20 well-known benchmark functions to test all proposed algorithms. The experimental results showed that 3SACr performed the best among the other algorithms in terms of its better average performance as well stability. [ABSTRACT FROM AUTHOR]

Nature has always been the source of inspiration in the search of better heuristic methods. The Ant Colony Optimization(ACO) is also one of these kind of inspirations from the nature. The Ant Colony System(ACS) algorithm used for the solution of TSP is based on ACO. Here in this paper a new algorithm named ISTAR Ant Colony System, which is based on the ACS is proposed. [ABSTRACT FROM AUTHOR]

In this paper, a new method for image noise cancellation by designing the templates of cellular neural network (CNN) is introduced. We propose a modified clonal selection algorithm (MCSA) which has an adaptive maturation strategy based on affinity and clone framework to search approximate optimal solution. By MCSA, we could optimize the templates of CNN for image noise cancelling. Finally, the MCSA-CNN method is compared with the Zeng stack smoother method in image noise cancellation, and we take Computed Tomography image for example. [ABSTRACT FROM AUTHOR]

This paper models the seaport system with the objective of determining the optimal storage strategy and container-handling schedule. It presents an iterative search algorithm that integrates a container-transfer model with a container-location model in a cyclic fashion to determine both optimal locations and corresponding handling schedule. A genetic algorithm (GA), a tabu search (TS) and a tabu search/genetic algorithm hybrid are used to solve the problem. The implementation of these models and algorithms are capable of handling the very large problems that arise in container terminal operations. Different resource levels are analysed and a comparison with current practise at an Australian port is done. [ABSTRACT FROM AUTHOR]

The monograph is devoted to the system analysis of approaches to the building of models of chemical-technological systems, on the basis of which a systematic concept of building of models and the issues of solving decision-making problems for managing the operating modes of technological objects is proposed. The problems of the development of mathematical models and the optimization of complex chemical-technological systems are investigated, using the example of technological objects of oil refining, in conditions of uncertainty caused by the lack of reliable quantitative information and the fuzziness of available information. The structure of the monograph consists of an introduction, the main part of four sections, a conclusion and a list of sources of information. In the main part of the work, the current state of the problems of mathematical modelling of technological objects of oil refining production is analyzed. Methods of mathematical modelling and decision-making in the management of technological objects according to environmental and economic criteria are chosen as the direction of research. Methods of building mathematical models of chemical-technological systems of oil refining in a fuzzy environment have been investigated and proposed, and models of the technological complex of the catalytic reforming unit have been developed. An approach to the creation of a package of models for system modelling of the technological complex of the catalytic reforming unit is described. An algorithm for the synthesis of models of a technological complex of oil refining based on fuzzy information is proposed. Expert assessments have been carried out to develop a mathematical description of the technological complex of the reforming unit, a method has been developed for carrying out expert procedures in a fuzzy environment. The formulations of decision-making problems for the control of the technological complex of the reforming unit are formulated and, based on the modification of various optimality principles, heuristic algorithms for their solution are developed. The properties of the developed algorithms for solving decision-making problems have been investigated and a method for their selection in solving specific production problems has been proposed. A mathematical formulation of the decision-making problem for optimizing the operating modes of the catalytic reforming unit in a fuzzy environment is obtained and the results of its solution based on the proposed fuzzy approach are presented. The structure is created and the main functional blocks of the computer decision support system based on the object models are described. The issues of software implementation of the developed models are considered and a description of the interface of the computer system for modelling the units of the reforming unit and decision support for optimizing their operation modes is given. [ABSTRACT FROM AUTHOR]

In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines, have improved until obtaining the actuals high rates of data transfering. The programs that nowadays try to take advantage of these new technologies cannot be written using the traditional techniques of programming, since most of the algorithms were designed for being executed in an only processor, in a nonconcurrent form instead of being executed concurrently in a set of processors working and communicating through a network. This paper aims to present the ongoing development of a new system for the reconfiguration of groupings of computers, taking into account these new technologies. [ABSTRACT FROM AUTHOR]

With the wide use of Email on the internet, it is urgent to resolve the severe problem of spam. Inspired by the biological immune system, it proposes an algorithm that can classify Spam without re-training. The result of experiments showed that the algorithm, compared with Bayesian algorithm, can improve recall rate and has a higher dynamic adaptability and stability. [ABSTRACT FROM AUTHOR]

This article take the boiler water temperature controller for research object and investigate the elevator control system based on taking the SCM a microcontroller as the core as a boiler controller, sensor technology, the basis for the system design to achieve the temperature and water level of the collection. AT89S52 microcontroller as the core of the system, combined with simulated intelligent PID control algorithm performance analysis, and hardware design, but also for the actual boiler research to meet the energy saving boiler control and safety requirements. [ABSTRACT FROM AUTHOR]

Polynomial factorization is one of the main chapters of Computer Algebra. Recently, significant progress was made on absolute factorization (i.e., over the complex field) of a multivariate polynomial with rational coefficients, with two families of algorithms proposing two different strategies of computation. One is represented by Gao’s algorithm and is explained in Lecture 2. The other is represented by the Galligo-Rupprecht-Chèze algorithm, presented in Lectures 4 and 5. The latter relies on an original use of the monodromy map attached to a generic projection of a plane curve on a line. It also involves zero-sums relations (introduced by Sasaki and his collaborators) with efficient semi-numerical computations to produce a certified exact result. [ABSTRACT FROM AUTHOR]

Chapter 7 develops simple and efficient redundancy methods for optimizing the reliability of large systems represented at the top level by a series structure. Apportionment is introduced as an approximate method and a newly developed, bounded enumeration approach yields an exact solution with modest computation. Greedy and dynamic programming approaches are compared. [ABSTRACT FROM PUBLISHER]

Chapter 3 presents real-time scheduling and schedulability analysis, covering topics in computation time prediction, uniprocessor scheduling, scheduling preemptable and independent tasks, fixed-priority schedulers, rate-monotonic and deadline-monotonic algorithms, dynamic-priority schedulers, earliest-deadline-first (EDF) algorithm, least-laxity-first (LL) algorithm, scheduling nonpreemptable sporadic tasks, nonpreemptable tasks with precedence constraints, periodic tasks with precedence constraints, communicating periodic tasks, Deterministic Rendezvous Model, periodic tasks with critical sections, Kernelized Monitor Model, multiprocessor scheduling, schedule representations, Scheduling Game Board, sufficient conditions for conflict-free task sets, scheduling periodic tasks on a multiprocessor, PERTS, PerfoRMAx, TimeWiz, and real-time operating systems (RTOSs). [ABSTRACT FROM PUBLISHER]