THE NONLINEAR STABILITY OF PLANE PARALLEL SHEAR FLOWS WITH RESPECT TO TILTED PERTURBATIONS

The nonlinear stability of plane parallel shear flows with respect to tilted perturbations is studied by energy methods.Tilted perturbation refers to the fact that perturbations form an angleθ∈(0,π/2)with the direction of the basic flows.By defining an energy functional,it is proven that plane parallel shear flows are unconditionally nonlinearly exponentially stable for tilted streamwise perturbation when the Reynolds number is below a certain critical value and the boundary conditions are either rigid or stress-free.In the case of stress-free boundaries,by taking advantage of the poloidal-toroidal decomposition of a solenoidal field to define energy functionals,it can be even shown that plane parallel shear flows are unconditionally nonlinearly exponentially stable for all Reynolds numbers,where the tilted perturbation can be either spanwise or streamwise.

Application of a Parallel Adaptive Cuckoo Search Algorithm in the Rectangle Layout Problem

The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization.

Prime Box Parallel Search Algorithm: Searching Dynamic Dictionary in O(lg m) Time

Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size.

Research of 6-DOF Serial-Parallel Mechanism Platform for Stability Training of Legged-Walking Robot

The concept of legged-robot stability training with a training platform is proposed and a serial-parallel mechanism platform with 6 degrees of freedom is designed for this target. The designed platform is composed of 4-DOF parallel mechanism with spherical joints and prismatic pairs,and 2-DOF serial mechanism with prismatic pairs. With this design,the platform has advantages of low platform countertop,big workspace,high carrying capacity and high stiffness. On the basis of DOF analysis and computation of space mechanism,weight supporting auxiliary mechanism and raceways-balls supporting mechanism are designed,so as to improve the stiffness of designed large platform and payload capacity of servo motors. And then the whole structure design work of the platform is done. Meanwhile,this paper derives the analytical solutions of forward kinematics, inverse kinematics and inverse dynamics. The error analysis model of position and orientation is established. And then the simulation is done in ADAMS to ensure the correctness and feasibility of this design.

ON THE STABILITY OF DISTORTED LAMINAR FLOW(Ⅱ)——THE LINEAR STABILITY ANALYSIS OF DISTORTED PARALLEL SHEAR FLOW

Based on the hydrodynamic stability theory of distorted laminar flow and the kind of distortion profiles on the mean velocity in parallel shear flow given in paper [1], this paper investigates the linear stability behaviour of parallel shear flow, presents unstable results of plane Couette flow and pipe Poiseuille flow to two-dimensional or axisymmetric disturbances for the first time, and obtains neutral curves of these two motions under certain definition.

ON THE STABILITY OF DISTORTED LAMINAR FLOW(Ⅲ)—THE NONLINEAR STABILITY ANALYSIS OF DISTORTED PARALLEL SHEAR FLOW

Based on the hydrodynamic stability theory of distorted laminar flow and the kind of distortion profiles on the mean velocity in parallel shear flow given in paper [1], this paper investigates the nonlinear stability behaviour of parallel shear flow, carries on stability calculation taking account of the perturbations of background turbulence noise under certain assumption, and obtains some results in accordance qualitatively with those of experiment for plane Poiseuille flow and pipe Poiseuille flow.

Topology Search of 3-DOF Translational Parallel Manipulators with Three Identical Limbs for Leg Mechanisms

Three-degree of freedom（3-DOF） translational parallel manipulators（TPMs） have been widely studied both in industry and academia in the past decades. However, most architectures of 3-DOF TPMs are created mainly on designers＇ intuition, empirical knowledge, or associative reasoning and the topology synthesis researches of 3-DOF TPMs are still limited. In order to find out the atlas of designs for 3-DOF TPMs, a topology search is presented for enumeration of 3-DOF TPMs whose limbs can be modeled as 5-DOF serial chains. The proposed topology search of 3-DOF TPMs is aimed to overcome the sensitivities of the design solution of a 3-DOF TPM for a LARM leg mechanism in a biped robot. The topology search, which is based on the concept of generation and specialization in graph theory, is reported as a step-by-step procedure with desired specifications, principle and rules of generalization, design requirements and constraints, and algorithm of number synthesis. In order to obtain new feasible designs for a chosen example and to limit the search domain under general considerations, one topological generalized kinematic chain is chosen to be specialized. An atlas of new feasible designs is obtained and analyzed for a specific solution as leg mechanisms. The proposed methodology provides a topology search for 3-DOF TPMs for leg mechanisms, but it can be also expanded for other applications and tasks.

Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems

A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.

Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm.

Performance Characterization of Parallel Game-tree Search Application Crafty

Game-tree search plays an important role in the field of Artificial Intelligence （AI）. In this paper, we characterize one parallel game-tree search workload in chess： the latest version of Crafty, a state of art program, on two Intel Xeon shared-memory multiprocessor systems. Our analysis shows that Crafty is latency-sensitive and the hash-table and dynamic tree splitting used in Crafty cause large scalability penalties. They consume 35%-50% of the running time on the 4-way system. Furthermore, Crafty is not bandwidth-limited.

A Multiple-Neighborhood-Based Parallel Composite Local Search Algorithm for Timetable Problem

This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.

Perturbation Methods of Stability Analysis for Parallel Real-Time Digital Simulation Models

In this paper, the stability analysis for parallel real-time digital simulation models is discussed. The coupling coefficient perturbation method and the simulation stepsize perturbation method are established. For two classes of systems of test equations, we construct the parallel simulation models and prove that they have the stability behaviour which is similar to the original continuous systems.

A multi-objective gravitational search algorithm based approach of power system stability enhancement with UPFC

On the basis of the theoretical analysis of a single-machine infinite-bus (SMIB),using the modified linearized Phillips-Heffron model installed with unified power flow controller (UPFC),the potential of the UPFC supplementary controller to enhance the dynamic stability of a power system is evaluated by measuring the electromechanical controllability through singular value decomposition (SVD) analysis.This controller is tuned to simultaneously shift the undamped electromechanical modes to a prescribed zone in the s-plane.The problem of robust UPFC based damping controller is formulated as an optimization problem according to the eigenvalue-based multi-objective function comprising the damping factor,and the damping ratio of the undamped electromechanical modes to be solved using gravitational search algorithm (GSA) that has a strong ability to find the most optimistic results.The different loading conditions are simulated on a SMIB system and the rotor speed deviation,internal voltage deviation,DC voltage deviation and electrical power deviation responses are studied with the effect of this flexible AC transmission systems (FACTS) controller.The results reveal that the tuned GSA based UPFC controller using the proposed multi-objective function has an excellent capability in damping power system with low frequency oscillations and greatly enhances the dynamic stability of the power systems.

Using Feedforward Net for Direct Sequence Parallel Search Acquisition

A feedforward net that quickly determines the maximum of a set of real values and its application in direct sequence parallel search acquisition (DSPSA) are described. The net is very suitable for a VLSI implementation due to its primary feedforward structure.

Parallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function

In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner programming problems, describe relations between results for every pair of successive evaluations of function f in parallel. Properties of optimal search strategies are derived from these equations. The worst-case complexity analysis shows that, if the maximizer is located on a priori unknown interval (n-1], then it can be detected after cp(n)=「2log「p/2」+1(n+1)」-1 parallel evaluations of f(x), where p is the number of processors.

Asymptotic Stability of Gaver’s Parallel System Attended by a Cold Standby Unit and a Repairman with Multiple Vacations

We investigate Gaver’s parallel system attended by a cold standby unit and a repairman with multiple vacations. By analysing the spectral distribution of the system operator and taking into account the irreducibility of the semigroup generated by the system operator we prove that the dynamic solution converges strongly to the steady state solution. Thus we obtain asymptotic stability of the dynamic solution of the system.

Parallel Multiple Tabu Search for Multiobjective Urban Transit Scheduling Problem

Urban Transit Scheduling Problem (UTSP) is concerned with determining reliable transit schedules for buses and drivers by considering the preferences of both passengers and operators based on the demand and the set of transit routes. This paper considered a UTSP which consisted of frequency setting, timetabling, and simultaneous bus and driver scheduling. A mixed integer multiobjective model was constructed to optimize the frequency of the routes by minimizing the number of buses, passenger’s waiting times and overcrowding. The model was further extended by incorporating timeslots in determining the frequencies during peak and off-peak hours throughout the time period. The timetabling problem studied two different scenarios which reflected the preferences of passengers and operators to assign the bus departure times at the first and last stop of a route. A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. Computational experiments were conducted on the well-known Mandl’s and Mumford’s benchmark networks to assess the effectiveness of the proposed algorithm. Competitive results are reported based on the performance metrics, as compared to other algorithms from the literature.

A Parallel String Searching Algorithm for Information Filtering

Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.

Asymptotic Stability of a Series-Parallel Repairable System Consisting of Three-Unit with Multiple Vacations of a Repairman

We study a series-parallel repairable system consisting of three units with multiple vacations of a repairman. We first show that all points on the imaginary axis except zero belong to the resolvent set of the operator and zero is an eigenvalue of the operator, and then we prove that the semigroup generated by the operator is irreducible. By combining these results with our previous result we deduce that the dynamic solution of the system converges strongly to its steady-state solution. Thus we obtain asymptotic stability of the dynamic solution of the system.