A HEVC Video Steganalysis Method Using the Optimality of Motion Vector Prediction

Among steganalysis techniques,detection against MV(motion vector)domain-based video steganography in the HEVC(High Efficiency Video Coding)standard remains a challenging issue.For the purpose of improving the detection performance,this paper proposes a steganalysis method that can perfectly detectMV-based steganography in HEVC.Firstly,we define the local optimality of MVP(Motion Vector Prediction)based on the technology of AMVP(Advanced Motion Vector Prediction).Secondly,we analyze that in HEVC video,message embedding either usingMVP index orMVD(Motion Vector Difference)may destroy the above optimality of MVP.And then,we define the optimal rate of MVP as a steganalysis feature.Finally,we conduct steganalysis detection experiments on two general datasets for three popular steganographymethods and compare the performance with four state-ofthe-art steganalysis methods.The experimental results demonstrate the effectiveness of the proposed feature set.Furthermore,our method stands out for its practical applicability,requiring no model training and exhibiting low computational complexity,making it a viable solution for real-world scenarios.

DISTRIBUTED OPTIMAL LOCAL DOUBLE LOOP NETWORK

A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.

Local Optimization and Adversarial Consideration: Agent Skills in Everest Simulation Team

Skilled individual agents are firm basis of a strong soccer team. The skills available to Everest 2002 (agents) include kicking, dribbling, forwarding, ball interception and tackling. These intermediate sub goals are implemented by a combination of local optimization which hopes to determine the optimal primitive action from a local perspective and adversarial consideration which takes into account opponents and limitations imposed by simulation environment. Everest 2002 RoboCup simulation teams, building on 11 skilled agents and an on-line coach, won the 2nd place in RoboCup 2002 simulation league.

Developing high-efficiency base editors by combining optimized synergistic core components with new types of nuclear localization signal peptide

The clustered regularly interspaced short palindromic repeats(CRISPR)–CRISPR-associated protein(Cas) system has been widely used for genome editing. In this system, the cytosine base editor(CBE) and adenine base editor(ABE) allow generating precise and irreversible base mutations in a programmable manner and have been used in many different types of cells and organisms. However, their applications are limited by low editing efficiency at certain genomic target sites or at specific target cytosine(C) or adenine(A) residues. Using a strategy of combining optimized synergistic core components, we developed a new multiplex super-assembled ABE(sABE) in rice that showed higher base-editing efficiency than previously developed ABEs. We also designed a new type of nuclear localization signal(NLS) comprising a FLAG epitope tag with four copies of a codon-optimized NLS(F4NLS^(r2)) to generate another ABE named F4NLS-sABE. This new NLS increased editing efficiency or edited additional A at several target sites. A new multiplex super-assembled CBE(sCBE) and F4NLS^(r2) involved F4NLS-sCBE were also created using the same strategy. F4NLS-sCBE was proven to be much more efficient than sCBE in rice. These optimized base editors will serve as powerful genome-editing tools for basic research or molecular breeding in rice and will provide a reference for the development of superior editing tools for other plants or animals.

Learning Bayesian network structure with immune algorithm

Finding out reasonable structures from bulky data is one of the difficulties in modeling of Bayesian network （BN）, which is also necessary in promoting the application of BN. This pa- per proposes an immune algorithm based method （BN-IA） for the learning of the BN structure with the idea of vaccination. Further- more, the methods on how to extract the effective vaccines from local optimal structure and root nodes are also described in details. Finally, the simulation studies are implemented with the helicopter convertor BN model and the car start BN model. The comparison results show that the proposed vaccines and the BN-IA can learn the BN structure effectively and efficiently.

Two-Phase Genetic Algorithm Applied in the Optimization of Multi-Modal Function

This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions, usually we can obtain all the global optimal solutions.

Real-time Locally Optimal Schedule for Electric Vehicle Load via Diversity-maximization NSGA-II

As distributed energy storage equipments, electric vehicles (EVs) have great potential for applications in power systems. Meanwhile, reasonable optimization of the charging time of EVs can reduce the users’ expense. Thus, the schedule of the EV load requires multi-objective optimization. A diversity-maximization non-dominated sorting genetic algorithm (DM-NSGA)-II is developed to perform multi-objective optimization by considering the power load profile, the users’charging cost, and battery degradation. Furthermore, a real-time locally optimal schedule is adopted by utilizing a flexible time scale. The case study illustrates that the proposed DM-NSGA-II can prevent being trapped in a relatively limited region so as to diversify the optimal results and provide trade-off solutions to decision makers. The simulation analysis shows that the variable time scale can continuously involve the present EVs in the real-time optimization rather than rely on the forecasting data. The schedule of the EV load is more practical without the loss of accuracy.

Pinion Tooth Surface Generation Strategy of Spiral Bevel Gears

Aviation spiral bevel gears are often generated by spiral generated modified（SGM） roll method.In this style,pinion tooth surface modified generation strategy has an important influence on the meshing and contact performances.For the optimal contact pattern and transmission error function,local synthesis is applied to obtain the machine-tool settings of pinion.For digitized machine,four tooth surface generation styles of pinion are proposed.For every style,tooth contact analysis（TCA） is applied to obtain contact pattern and transmission error function.For the difference between TCA transmission error function and design objective curve,the degree of symmetry and agreement are defined and the corresponding sub-objective functions are established.Linear weighted combination method is applied to get an equivalent objective function to evaluate the shape of transmission error function.The computer programs for the process above are developed to analyze the meshing performances of the four pinion tooth surface generation styles for a pair of aviation spiral bevel gears with 38/43 teeth numbers.The four analytical results are compared with each other and show that the incomplete modified roll is optimal for this gear pair.This study is an expansion to generation strategy of spiral bevel gears,and offers new alternatives to computer numerical control（CNC） manufacture of spiral bevel gears.

OPTIMAL INTERIOR AND LOCAL ERROR ESTIMATES OF A RECOVERED GRADIENT OF LINEAR ELEMENTS ON NONUNIFORM TRIANGULATIONS

We examine a simple averaging formula for the gradieni of linear finite elemelitsin Rd whose interpolation order in the Lq-norm is O(h2) for d < 2q and nonuniformtriangulations. For elliptic problems in R2 we derive an interior superconvergencefor the averaged gradient over quasiuniform triangulations. Local error estimatesup to a regular part of the boundary and the effect of numerical integration arealso investigated.

Disequilibrium Analysis of Money Market in China

By the disequilibrium economic theory,this paper first investigates the disequilibrium mathematical economic model of the money market in China.Then,we study the disequilibrium transition of Chinese money market from 1954 to 1993 using a non parametric local fitting technique.Without assuming explicit functional forms,the method of locally weighted maximum likelihood is applied to estimate and test the variations in demand and supply during the period between 1954 to 1993.Furthermore,the disequilibrium state and mechanism of Chinese money market are inspected and the direction,the strength and the fluctuation of the disequilibrium are discussed respectively.Finally the policy suggestions are given about adjusting effectively money demand and supply under the condition of co existing of plan and market economy.In this paper,a brief review on the disequilibrium researches on money market in foreign countries is also given.

Optimal two-impulse space interception with multiple constraints

We consider optimal two-impulse space interception problems with multiple constraints.The multiple constraints are imposed on the terminal position of a space interceptor,impulse and impact instants,and the component-wise magnitudes of velocity impulses.These optimization problems are formulated as multi-point boundary value problems and solved by the calculus of variations.Slackness variable methods are used to convert all inequality constraints into equality constraints so that the Lagrange multiplier method can be used.A new dynamic slackness variable method is presented.As a result,an indirect optimization method is developed.Subsequently,our method is used to solve the two-impulse space interception problems of free-flight ballistic missiles.A number of conclusions for local optimal solutions have been drawn based on highly accurate numerical solutions.Specifically,by numerical examples,we show that when time and velocity impulse constraints are imposed,optimal two-impulse solutions may occur;if two-impulse instants are free,then a two-impulse space interception problem with velocity impulse constraints may degenerate to a one-impulse case.

Whole-process design and experimental validation of landing gear lower drag stay with global/local linked driven optimization strategy

Landing gear lower drag stay is a key component which connects fuselage and landing gear and directly effects the safety and performance of aircraft takeoff and landing. To effectively design the lower drag stay and reduce the weight of landing gear, Global/local Linked Driven Optimization Strategy(GLDOS) was developed to conduct the overall process design of lower drag stay in respect of optimization thought. The whole-process optimization involves two stages of structural conceptual design and detailed design. In the structural conceptual design, the landing gear lower drag stay was globally topologically optimized by adopting multiple starting points algorithm. In the detailed design, the local size and shape of landing gear lower drag stay were globally optimized by the gradient optimization strategy. The GLDOS method adopts different optimization strategies for different optimization stages to acquire the optimum design effect. Through the experimental validation, the weight of the optimized lower dray stay with the developed GLDOS is reduced by 16.79% while keeping enough strength and stiffness, which satisfies the requirements of engineering design under the typical loading conditions. The proposed GLDOS is validated to be accurate and efficient in optimization scheme and design cycles. The efforts of this paper provide a whole-process optimization approach regarding different optimization technologies in different design phases, which is significant in reducing structural weight and enhance design tp wid 1 precision for complex structures in aircrafts.

PARBLO:Page-Allocation-Based DRAM Row Buffer Locality Optimization

DRAM row buffer conflicts can increase memory access latency significantly. This paper presents a new pageallocation-based optimization that works seamlessly together with some existing hardware and software optimizations to eliminate significantly more row buffer conflicts. Validation in simulation using a set of selected scientific and engineering benchmarks against a few representative memory controller optimizations shows that our method can reduce row buffer miss rates by up to 76% （with an average of 37.4%）. This reduction in row buffer miss rates will be translated into performance speedups by up to 15% （with an average of 5%）.

Mesh simplification algorithm based on edge curvature metrics and local optimization

Aiming at the problem that the mesh simplification algorithm loses the geometric features of the model in large-scale simplification,an improved half-edge collapse mesh simplification algorithm is proposed.The concept of approximate measurement of edge curvature is introduced,and the edge curvature is added to the error measure,so that the order of half-edge collapse of the mesh is changed,and the simplified details of the mesh model can be preserved accurately.At the same time,by analyzing the quality of simplified triangular mesh,optimizing triangular mesh locally,reducing the amount of narrow triangles,the quality of the simplified model is improved.The proposed algorithm was tested on Cow model,Car model and Bunny model,and compared with another three algorithms,one of them is a classical mesh simplification algorithm based on edge collapse,the other is an improved algorithm of the classical one.The experimental results show that the improved algorithm can better retain the detail features of the original model at the same reduction ratio,and has reasonable mesh allocation,fast execution speed and small error.

Optimized Local Trigonometric Bases with Nonuniform Partitions

The authors provide optimized local trigonometric bases with nonuniform partitions which efficiently compress trigonometric functions. Numerical examples demonstrate that in many cases the proposed bases provide better compression than the optimized bases with uniform partitions obtained by Matviyenko.

Novel Model Using Kernel Function and Local Intensity Information for Noise Image Segmentation

It remains a challenging task to segment images that are distorted by noise and intensity inhomogeneity.To overcome these problems, in this paper, we present a novel region-based active contour model based on local intensity information and a kernel metric. By introducing intensity information about the local region, the proposed model can accurately segment images with intensity inhomogeneity. To enhance the model＇s robustness to noise and outliers, we introduce a kernel metric as its objective functional. To more accurately detect boundaries, we apply convex optimization to this new model, which uses a weighted total-variation norm given by an edge indicator function. Lastly, we use the split Bregman iteration method to obtain the numerical solution. We conducted an extensive series of experiments on both synthetic and real images to evaluate our proposed method, and the results demonstrate significant improvements in terms of efficiency and accuracy, compared with the performance of currently popular methods.

An Efficient Algorithm for Mobile Localization in Sensor Networks

Node localization is a fundamental problem in wireless sensor network.There are many existing algorithms to estimate the locations of the nodes.However,most of the methods did not consider the presence of obstacles.In practice,obstacles will lead to blockage and reflection of communication signals between sensor nodes.Therefore,the presence of obstacles will greatly affect the localization result.In this paper,we implement an obstacle-handling algorithm based on the localization tool developed by MIT,The experimental result shows that the enhanced algorithm can reduce the average distance error by up to 46 %,compared to the original algorithm.

The Application of ODE Method in Constrained Optimization

in this paper,a new method to solve the general constrained optimization problem is proposed,theproblem of finding the local optimal points of the nonlinear programming problem with equality and inequality constraints is considered by solving the ODE d.e.Ordinary oprential Equation)with aPPropriatenumerical procedure.Moreover,the rate of conveyance to optimal points is quadratic.Some numerical resultis given to show the efficiency of the method proposed in this poper.

Longitudinal parameter identification of a small unmanned aerial vehicle based on modified particle swarm optimization

Abstract This paper describes a longitudinal parameter identification procedure for a small unmanned aerial vehicle （UAV） through modified particle swam optimization （PSO）. The proce- dure is demonstrated using a small UAV equipped with only an micro-electro-mechanical systems （MEMS） inertial mea,mring element and a global positioning system （GPS） receiver to provide test information. A small UAV longitudinal parameter mathematical model is derived and the modified method is proposed based on PSO with selective particle regeneration （SRPSO）. Once modified PSO is applied to the mathematical model, the simulation results show that the mathematical model is correct, and aerodynamic parameters and coefficients of the propeller can be identified accurately. Results are compared with those of PSO and SRPSO and the comparison shows that the proposed method is more robust and faster than the other methods for the longitudinal parameter identification of the small UAV. Some parameter identification results are affected slightly by noise, but the identification results are very good overall. Eventually, experimental validation is employed to test the proposed method, which demonstrates the usefulness of this method.

Curvature-aware simplification for point-sampled geometry

We propose a novel curvature-aware simplification technique for point-sampled geometry based on the locally optimal projection(LOP) operator.Our algorithm includes two new developments.First,a weight term related to surface variation at each point is introduced to the classic LOP operator.It produces output points with a spatially adaptive distribution.Second,for speeding up the convergence of our method,an initialization process is proposed based on geometry-aware stochastic sampling.Owing to the initialization,the relaxation process achieves a faster convergence rate than those initialized by uniform sampling.Our simplification method possesses a number of distinguishing features.In particular,it provides resilience to noise and outliers,and an intuitively controllable distribution of simplification.Finally,we show the results of our approach with publicly available point cloud data,and compare the results with those obtained using previous methods.Our method outperforms these methods on raw scanned data.