A flextensional transducer and its algorithmic method of resonant frequency

A flextensional transducer with an Omega shape and its algorithmic method of the resonant frequency and the shape functions are suggested. The Omega transducer is separated into four parts treated respectively as a thin shell of revolution and the theories of thin shells of revolution and piezoelectricity are used to obtain the energy functional of each part so that the sum of the energy functionals of the four parts is the energy functional of the whole Omega transducer. By substituting the shape functions with undetermined coefi3cients and the geo- metrical boundary conditions into the energy functional of the Omega transducer, the resonant frequency of the Omega transducer is firstly determined with the Rayleigh-Ritz method. With the gotten resonant frequency, the constant coefficients of the shape functions are following solved through the Rayleigh-Ritz partial differential equations and the geometrical boundary condition equations. The solving method of the resonant frequency and the shape functions is also extended to the cymbal transducer. Such an analytical method is verified to be feasible by the results of the finite element analysis and experiments. The research indicates that （1） The radial vibration of the piezoelectric ceramic is in phase with the longitudinal vibration of the top of metal cap, and it cut down the reversed phase component in the sound field. The Omega transducer can be a low frequency transducer. （2） The determination method of the resonant frequency and the shape functions give a solution to the optimum designs of the Omega transducer and the cymbal transducer. （3） The determination method of the resonant fi＇equency and the shape functions can also be used in other flextensional transducers or other structures which are composed of thin shells of revolution, so it is universal.

Seismic fluid identification using a nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo method

Elastic impedance inversion with high efficiency and high stability has become one of the main directions of seismic pre-stack inversion. The nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo （MCMC） method is proposed in this paper, combining conventional MCMC method based on global optimization with a preconditioned conjugate gradient （PCG） algorithm based on local optimization, so this method does not depend strongly on the initial model. It converges to the global optimum quickly and efficiently on the condition that effi- ciency and stability of inversion are both taken into consid- eration at the same time. The test data verify the feasibility and robustness of the method, and based on this method, we extract the effective pore-fluid bulk modulus, which is applied to reservoir fluid identification and detection, and consequently, a better result has been achieved.

Dislocation parameters of Gonghe earthquake jointly inferred by using genetic algorithms and least squares method

The Second Crustal Deformation Monitoring Center, China Seismological Bureau, has detected a marked uplift associated with the Gonghe Ms=7.0 earthquake on April 26, 1990, Qinghai Province. From the observed vertical deformations and using a rectangular uniform slip model in a homogeneous elastic half space, we first employ genetic algorithms (GA) to infer the approximate global optimal solution, and further use least squares method to get more accurate global optimal solution by taking the approximate solution of GA as the initial parameters of least squares. The inversion results show that the causative fault of Gonghe Ms=7.0 earthquake is a right-lateral reverse fault with strike NW60°, dip SW and dip angle 37°, the coseismic fracture length, width and slip are 37 km, 6 km and 2.7 m respectively. Combination of GA and least squares algorithms is an effective joint inversion method, which could not only escape from local optimum of least squares, but also solve the slow convergence problem of GA after reaching adjacency of global optimal solution.

A DISTRIBUTED LATTICE BOLTZMANN METHOD

In this paper, an overlapping lattice Boltzmann model is introduced and its domain decomposition method, a distributed lattice Boltzmann method is presented. Parallel effectiveness of some programs based on the distributed lattice Boltzmann method are analyzed.

Distributed MPC for Reconfigurable Architecture Systems via Alternating Direction Method of Multipliers

This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merely modifying the couplings between different subsystems.To equip live systems with a quick response ability when modifying network topology,while keeping a satisfactory dynamic performance,a novel reconfiguration control scheme based on the alternating direction method of multipliers(ADMM)is presented.In this scheme,the local controllers directly influenced by the structure realignment are redesigned in the reconfiguration control.Meanwhile,by employing the powerful ADMM algorithm,the iterative formulas for solving the reconfigured optimization problem are obtained,which significantly accelerate the computation speed and ensure a timely output of the reconfigured optimal control response.Ultimately,the presented reconfiguration scheme is applied to the level control of a benchmark four-tank plant to illustrate its effectiveness and main characteristics.

A Fast Algorithm for Phase Grating Preparation by Real Space Method

Making use of this expression to calculate the phase grating in high resolution image simulation can greatly reduce the calculating time. In this paper, the derivation of the expression is introduced, and then the computer routine is explained in details. Finally the potential projection map of Mg44Rh7 along [001] direction is shown as an illustration. All operations are carried out in real space, so we call the calculation method as the real space method.

ROBUST ACOUSTIC SOURCE LOCALIZATION FOR DIGITAL HEARING AIDS IN NOISE AND REVERBERANT ENVIRONMENT

A new method in digital hearing aids to adaptively localize the speech source in noise and reverberant environment is proposed. Based on the room reverberant model and the multichannel adaptive eigenvalue decomposition （MCAED） algorithm, the proposed method can iteratively estimate impulse response coefficients between the speech source and microphones by the adaptive subgradient projection method. Then, it acquires the time delays of microphone pairs, and calculates the source position by the geometric method. Compared with the traditional normal least mean square （NLMS） algorithm, the adaptive subgradient projection method achieves faster and more accurate convergence in a low signal-to-noise ratio （SNR） environment. Simulations for glasses digital hearing aids with four-component square array demonstrate the robust performance of the proposed method.

A Gridless-Finite Volume Hybrid Algorithm for Euler Equations

A fast hybrid algorithm based on gridless method coupled with finite volume method （FVM） is developed for the solution to Euler equations. Compared with pure gridless method, the efficiency of the hybrid algorithm is improved to the level of finite volume method for most parts of the flow filed arc covered with grid cells. Moreover, the hybrid method is flexible to deal with the configurations as clouds of points are used to cover the region adjacent to the bodies. Mirror satellites and mirror grid cells arc introduced to the interface to accomplish data communication between the different parts of the flow field. The Euler Equations arc spatially discretized with finite volume method and gridless method in mesh and clouds of points respectively, and an explicit four-stage Runge-Kutta scheme is utilized to reach the steady-state solution. Internal flows in channels and external flows over airfoils arc investigated with hybrid method, and the solutions arc comparad to those using pure finite volume method and pure gridless method. Numerical examples show that the hybrid algorithm captures the shock waves accurately, and it is as efficient as fmite volume method.

Coordinate scheduling approach for EDS observation tasks and data transmission jobs

Electromagnetic detection satellite（EDS） is a type of Earth observation satellite（EOS）. Satellites observation and data down-link scheduling plays a significant role in improving the efficiency of satellite observation systems. However, the current works mainly focus on the scheduling of imaging satellites, little work focuses on the scheduling of EDSes for its specific requirements.And current works mainly schedule satellite resources and data down-link resources separately, not considering them in a globally optimal perspective. The EDSes and data down-link resources are scheduled in an integrated process and the scheduling result is searched globally. Considering the specific constraints of EDS, a coordinate scheduling model for EDS observation tasks and data transmission jobs is established and an algorithm based on the genetic algorithm is proposed. Furthermore, the convergence of our algorithm is proved. To deal with some specific constraints, a solution repairing algorithm of polynomial computing time is designed. Finally, some experiments are conducted to validate the correctness and practicability of our scheduling algorithms.

Construction of a 3D meso-structure and analysis of mechanical properties for deposit body medium

For deposit body medium, the internal structural properties may be the controlling factors for the strength of the material and the mechanical response. Based on the results of soil-rock meso-statistics using digital imaging, a simulated annealing algorithm is adopted to expand the meso-structural features of deposit bodies in 3D. The construction of the 3D meso-structure of a deposit body is achieved, and then the particle flow analysis program PFC3 D is used to simulate the mechanical properties of the deposit body. It is shown that with a combination of the simulated annealing algorithm and the statistical feature functions, the randomness and heterogeneity of the rock distribution in the 3D inner structure of deposit body medium can be realized, and the reconstructed structural features of the deposit medium can match the features of the digital images well. The spatial utilizations and the compacting effects of the body-centered cubic, hexagonal close and face-centered packing models are high, so these structures can be applied in the simulations of the deposit structures. However, the shear features of the deposit medium vary depending on the different model constructive modes. Rocks, which are the backbone of the deposit, are the factors that determine the shear strength and deformation modulus of the deposit body. The modeling method proposed is useful for the construction of 3D meso-scope models from 2D meso-scope statistics and can be used for studying the mechanical properties of mixed media, such as deposit bodies.

Discrete differential evolution algorithm for integer linear bilevel programming problems

A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.

New Model for Synthesis of Symmetrical Thinned Linear Arrays

In symmetrical thinned linear arrays design, the positions of thinned array elements are very important for optimal performance in terms of its minimum peak side lobe level （Msli）. For the synthesis of thinned arrays with a given thinning rate, it would have almost the same Msll solution between taking only segmental aperture nearby both ends of the aperture into account and taking all the aperture into account. In this paper, the element distribution characteristic over the aperture of many optimum thinned arrays is studied, then the aperture release model is founded by the least square method to synthesize the thinned arrays. This model is vital for the computing burden alleviation and the efficiency optimization, and would hardly bring any degradation of the obtained array performance.

FARMER:A novel approach to file access correlation mining and evaluation reference model

File semantic has proven effective in optimizing large scale distributed file system.As a consequence of the elaborate and rich I/O interfaces between upper layer applications and file systems,file system can provide useful and insightful information about semantic.Hence,file semantic mining has become an increasingly important practice in both engineering and research community.Unfortunately,it is a challenge to exploit file semantic knowledge because a variety of factors coulda ffect this information exploration process.Even worse,the challenges are exacerbated due to the intricate interdependency between these factors,and make it difficult to fully exploit the potentially important correlation among various semantic knowledges.This article proposes a file access correlation miming and evaluation reference（FARMER） model,where file is treated as a multivariate vector space,and each item within the vector corresponds a separate factor of the given file.The selection of factor depends on the application,examples of factors are file path,creator and executing program.If one particular factor occurs in both files,its value is non-zero.It is clear that the extent of inter-file relationships can be measured based on the likeness of their factor values in the semantic vectors.Benefit from this model,FARMER represents files as structured vectors of identifiers,and basic vector operations can be leveraged to quantify file correlation between two file vectors.FARMER model leverages linear regression model to estimate the strength of the relationship between file correlation and a set of influencing factors so that the ＂bad knowledge＂ can be filtered out.To demonstrate the ability of new FARMER model,FARMER is incorporated into a real large-scale object-based storage system as a case study to dynamically infer file correlations.In addition FARMER-enabled optimize service for metadata prefetching algorithm and object data layout algorithm is implemented.Experimental results show that is FARMER-enabled prefetching algorithm is shown to reduce the metadata operations latency by approximately 30%-40% when compared to a state-of-the-art metadata prefetching algorithm and a commonly used replacement policy.

High Efficiency Crypto-Watermarking System Based on Clifford-Multiwavelet for 3D Meshes Security

Since 3D mesh security has become intellectual property,3D watermarking algorithms have continued to appear to secure 3D meshes shared by remote users and saved in distant multimedia databases.The novelty of our approach is that it uses a new Clifford-multiwavelet transform to insert copyright data in a multiresolution domain,allowing us to greatly expand the size of the watermark.After that,our method does two rounds of insertion,each applying a different type of Clifford-wavelet transform.Before being placed into the Clifford-multiwavelet coefficients,the watermark,which is a mixture of the mesh description,source mesh signature(produced using SHA512),and a logo encrypted using the RSA(Ronald Shamir Adleman)technique,is encoded using Turbo-code.Using the Least Significant Bit method steps,data embedding involves modulation and insertion processes.Finally,the watermarked mesh is reconstructed using the inverse Cliffordmultiwavelet transform.Due to the utilization of a hybrid insertion domain,our technique has demonstrated a very high insertion rate while retaining mesh quality.The mesh is watermarked,and the extracted data is acquired in real-time.Our approach is also resistant to the most common types of attacks.Our findings reveal that the current approach improves on previous efforts.

An implicit upwind parabolized Navier-Stokes code for chemically nonequilibrium flows

The previously developed single-sweep parabolized Navier-Stokes （SSPNS） space marching code for ideal gas flows has been extended to compute chemically nonequilibrium flows. In the code, the strongly coupled set of gas dynamics, species conservation, and turbulence equations is integrated with the implicit lower-upper symmetric GaussSeidel （LU-SGS） method in the streamwise direction in a space marching manner. The AUSMPW＋ scheme is used to calculate the inviscid fluxes in the crossflow direction, while the conventional central scheme for the viscous fluxes. The k-g two-equation turbulence model is used. The revised SSPNS code is validated by computing the Burrows-Kurkov non-premixed H2/air supersonic combustion flows, premixed H2/air hypersonic combustion flows in a three-dimensional duct with a 15° compression ramp, as well as the hypersonic laminar chemically nonequilibrium air flows around two 10° half-angle cones. The results of these calculations are in good agreement with those of experiments, NASA UPS or Prabhu＇s PNS codes. It can be concluded that the SSPNS code is highly efficient for steady supersonic/ hypersonic chemically reaction flows when there is no large streamwise separation.

Predicting the CME arrival time based on the recommendation algorithm

CME is one of the important events in the sun-earth system as it can induce geomagnetic disturbance and an associated space environment effect.It is of special significance to predict whether CME will reach the Earth and when it will arrive.In this paper,we firstly built a new multiple association list for 215 different events with 18 characteristics including CME features,eruption region coordinates and solar wind parameters.Based on the CME list,we designed a novel model based on the principle of the recommendation algorithm to predict the arrival time of CMEs.According to the two commonly used calculation methods in the recommendation system,cosine distance and Euclidean distance,a controlled trial was carried out respectively.Every feature has been found to have its own appropriate weight.The error analysis indicates the result using the Euclidean distance similarity is much better than that using cosine distance similarity.The mean absolute error and root mean square error of test data in the Euclidean distance are 11.78 and 13.77 h,close to the average level of other CME models issued in the CME scoreboard,which verifies the effectiveness of the recommendation algorithm.This work gives a new endeavor using the recommendation algorithm,and is expected to induce other applications in space weather prediction.

Proximal point algorithm for a new class of fuzzy set-valued variational inclusions with (H,η)-monotone mappings

We introduced a new class of fuzzy set-valued variational inclusions with (H,η)-monotone mappings. Using the resolvent operator method in Hilbert spaces, we suggested a new proximal point algorithm for finding approximate solutions, which strongly converge to the exact solution of a fuzzy set-valued variational inclusion with (H,η)-monotone. The results improved and generalized the general quasi-variational inclusions with fuzzy set-valued mappings proposed by Jin and Tian Jin MM, Perturbed proximal point algorithm for general quasi-variational inclusions with fuzzy set-valued mappings, OR Transactions, 2005, 9(3): 31-38, (In Chinese); Tian YX, Generalized nonlinear implicit quasi-variational inclusions with fuzzy mappings, Computers & Mathematics with Applications, 2001, 42: 101-108.

APPLICATION OF INTEGRATION ALGORITHEMS FOR ELASTO-PLASTICITY CONSTITUTIVE MODEL FOR ANISOTROPIC SHEET MATERIALS

Two algorithms of computing stress increment by using the elasto-plasticity constitutive model are firstly formulated, which are the Euler integration method and the radial return method. Hill＇48 anisotropic yield criterion is used. The Euler integration method can not obtain more accurate computation of the stress increment as the radial return method unless enough subintervals are taken,by which the Euler integration method will take excessive computing time. Without docreasing any accuracy, the radial return method can save much time. Finally, a square cup deep drawing from NUMISHEET＇93 benchmarks is simulated with a self-developed code SheetForrn in order to investigate the accuracy and efficiency of the radial return method.

Best compromising crashworthiness design of automotive S-rail using TOPSIS and modified NSGAⅡ

In order to reduce both the weight of vehicles and the damage of occupants in a crash event simultaneously, it is necessary to perform a multi-objective optimal design of the automotive energy absorbing components. Modified non-dominated sorting genetic algorithm II(NSGA II) was used for multi-objective optimization of automotive S-rail considering absorbed energy(E), peak crushing force(Fmax) and mass of the structure(W) as three conflicting objective functions. In the multi-objective optimization problem(MOP), E and Fmax are defined by polynomial models extracted using the software GEvo M based on train and test data obtained from numerical simulation of quasi-static crushing of the S-rail using ABAQUS. Finally, the nearest to ideal point(NIP)method and technique for ordering preferences by similarity to ideal solution(TOPSIS) method are used to find the some trade-off optimum design points from all non-dominated optimum design points represented by the Pareto fronts. Results represent that the optimum design point obtained from TOPSIS method exhibits better trade-off in comparison with that of optimum design point obtained from NIP method.

A Unified Approach for Developing EfficientAlgorithmic Programs

A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special attention is paid to algorithm manipulation rather than program calculus. An algorithm is exactly a set of mathematical formulae. It is easier for formal derivation and proof. After getting efficient and correct algorithm, a trivial transformation is used to get a final program. The approach covers several known algorithm design techniques, e.g. dynamic programming, greedy, divide-and-conquer and enumeration, etc. The techniques of partition and recurrence are not new. Partition is a general approach for dealing with complicated objects and is typically used in divide-and-conquer approach. Recurrence is used in algorithm analysis, in developing loop invariants and dynamic programming approach. The main contribution is combining two techniques used in typical algorithm development into a unified and systematic approach to develop general efficient algorithmic programs and presenting a new representation of algorithm that is easier for understanding and demonstrating the correctness and ingenuity of algorithmic programs.