We describe a new method for estimating the positions of double bonds in mixtures of linear olefins longer than octene. The method requires about a gram of olefin and a 5-10 min reaction catalyzed by a homogeneous met...
详细信息
We describe a new method for estimating the positions of double bonds in mixtures of linear olefins longer than octene. The method requires about a gram of olefin and a 5-10 min reaction catalyzed by a homogeneous metathesis catalyst. The carbon number distribution of the product mixture, as determined by gas chromatography, depends upon the distribution of double-bond isomers in the starting mixture. We describe a computer algorithm for using the final carbon number distribution to determine the locations of double bonds in the starting mixture. Examples are based on tetradecenes, hexadecenes, and octadecenes.
The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in wh...
详细信息
The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common single machine with learning effect. The aim is to minimize the total weighted completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent. We propose a branch-and-bound approach with several useful dominance properties and an effective lower bound for searching the optimal solution and three simulated-annealing algorithms for the near-optimal solutions. The computational results show that the proposed algorithms perform effectively and efficiently.
This paper proposes a novel method to solve the problem of train communication network design. Firstly, we put forward a general description of such problem. Then, taking advantage of the bilevel programming theory, w...
详细信息
This paper proposes a novel method to solve the problem of train communication network design. Firstly, we put forward a general description of such problem. Then, taking advantage of the bilevel programming theory, we created the cost-reliability-delay model (CRD model) that consisted of two parts: the physical topology part aimed at obtaining the networks with the maximum reliability under constrained cost, while the logical topology part focused on the communication paths yielding minimum delay based on the physical topology delivered from upper level. We also suggested a method to solve the CRD model, which combined the genetic algorithm and the Floyd-Warshall algorithm. Finally, we used a practical example to verify the accuracy and the effectiveness of the CRD model and further applied the novel method on a train with six carriages.
作者：
Deshpande, R.Kumar, B.Jain, S. B.RITM
Dept Elect & Commun Engn Bangalore 560064 Karnataka India BPIT
Dept Elect & Commun Engn New Delhi 110089 India IGIT
Dept Elect & Commun Engn Delhi 110006 India
Design of finite impulse response (FIR) notch filters (NFs) with highly narrow rejection bandwidth (RBW) is suggested. RBW is the distance between 3 dB points on the response. Reduction in the RBW is achieved progress...
详细信息
Design of finite impulse response (FIR) notch filters (NFs) with highly narrow rejection bandwidth (RBW) is suggested. RBW is the distance between 3 dB points on the response. Reduction in the RBW is achieved progressively in three stages. In the first stage, an FIR NF is designed from a second order infinite impulse response (IIR) prototype filter. For a given length L of the NF, the authors choose maximum permissible value of 'r' (the pole length of IIR prototype filter) to achieve very narrow RBW of the FIR filter. In the next stage, by using an amplitude change function (ACF): H(z)(2 - H(z)), the designed filter is sharpened. Consequently, the RBW of the resulting NF is reduced to almost half of the earlier value. This reduction of bandwidth makes the resulting NF of length 2L. In the next stage, RBW can be further reduced by the repeated sharpening of the filter by the same ACF.
Based on a unified analysis of both pure and slotted ALOHA systems, a new control algorithm for ALOHA systems is proposed. A feature of great practical importance is the algorithm's automatic adjustment to changes...
详细信息
Based on a unified analysis of both pure and slotted ALOHA systems, a new control algorithm for ALOHA systems is proposed. A feature of great practical importance is the algorithm's automatic adjustment to changes in average traffic intensity or the (finite or infinite) number of active stations in the system. In addition, the algorithm has a low-complexity implementation. computer simulations, concentrating on the use for two-way data communication in a cable television network, have demonstrated that the practical performance of the algorithm closely approximates the theoretical optimum, even under extremely heavy traffic load conditions. Furthermore, dynamic performance simulations have shown that the algorithm assures swift recovery from overload situations.
Intelligent video surveillance network has many practical applications such as human tracking, vehicle tracking, and event detection. In this paper, an active multicamera network framework is designed for human detect...
详细信息
Intelligent video surveillance network has many practical applications such as human tracking, vehicle tracking, and event detection. In this paper, an active multicamera network framework is designed for human detection and tracking by optimizing the cameras collaborating control. A multicamera collaborating control algorithm is proposed based on Bayes network to minimize the number of PTZ cameras with control and optimize the cameras' field of view. Hybrid human local feature transform selected by AdaBoost algorithm is adopted to improve the tracking precision. Experimental results on real world environment indicate the effectiveness and efficiency of proposed framework and algorithm.
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for both searching and updating. This natura...
详细信息
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for both searching and updating. This natural question dates back to the heap of Williams and Floyd in the sixties and relates to the fundamental issue whether additional space besides those for the keys gives more computational power in dictionaries and how data ordering helps. Implicit data structures were introduced in the eighties with this goal, providing the best bound of O(log(2) n) time. until a recent result showing O(log(2) n/log log n) time. In this paper we describe the flat implicit tree, which is the first data structure obtaining O(log n) time for search and (amortized) update using an array of n cells.
Optimization techniques have been applied to structural health monitoring and damage detection of civil infrastructures for two decades. The standard particle swarm optimization (PSO) is easy to fall into the local op...
详细信息
Optimization techniques have been applied to structural health monitoring and damage detection of civil infrastructures for two decades. The standard particle swarm optimization (PSO) is easy to fall into the local optimum and such deficiency also exists in the multiparticle swarm coevolution optimization (MPSCO). This paper presents an improved MPSCO algorithm (IMPSCO) firstly and then integrates it with Newmark's algorithm to localize and quantify the structural damage by using the damage threshold proposed. To validate the proposed method, a numerical simulation and an experimental study of a seven-story steel frame were employed finally, and a comparison was made between the proposed method and the genetic algorithm (GA). The results show threefold: (1) the proposed method not only is capable of localization and quantification of damage, but also has good noise-tolerance;(2) the damage location can be accurately detected using the damage threshold proposed in this paper;and (3) compared with the GA, the IMPSCO algorithm is more efficient and accurate for damage detection problems in general. This implies that the proposed method is applicable and effective in the community of damage detection and structural health monitoring.
We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using ...
详细信息
We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed in n steps if n sensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.
High mass-resolving power has been shown to be useful for studying the conformational dynamics of proteins by hydrogen/deuterium (H/D) exchange. A computer algorithm was developed that automatically identifies peptide...
详细信息
High mass-resolving power has been shown to be useful for studying the conformational dynamics of proteins by hydrogen/deuterium (H/D) exchange. A computer algorithm was developed that automatically identifies peptides and their extent of deuterium incorporation from H/D exchange mass spectra of enzymatic digests or fragment ions produced by collisionally induced dissociation (CID) or electron capture dissociation (ECD). The computer algorithm compares measured and calculated isotopic distributions and uses a fast calculation of isotopic distributions using the fast Fourier transform (FFT). The algorithm facilitates rapid and automated analysis of H/D exchange mass spectra suitable for high-throughput approaches to the study of peptide and protein structures. The algorithm also makes the identification independent on comparisons with undeuterated control samples. The applicability of the algorithm was demonstrated on simulated isotopic distributions as well as on experimental data, such as Fourier transform ion cyclotron resonance (FTICR) mass spectra of myoglobin peptic digests, and CID and ECD spectra of substance P. (C) 2001 American Society for Mass Spectrometry.
暂无评论