The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a high accuracy Computing Reduction Algorithm Based on Data Reuse. Hassian-Based Predictor-Corrector integration approach uses the current points and external interpolation to predict the location and energy of the next point based on Hessian update scheme. We tested the new approach on CO2 and H2O simulations with an approximated potential energy approximated solution method and...
In a versatile, flexible robotic assembly system, robots need to reorient parts from the initial orientations to another ones appropriate for assembly tasks. Previously, we have proposed a motion strategy of a parallel gripper to reorient a part allowing release motion in its unstable orientation on a flat workbench. Toward motion planning for reorientation tasks by this strategy, it is necessary...
The Protein Structure Prediction (PSP) problem is concerned about the prediction of the native structure of a protein from its amino acid sequence. PSP is a challenging and computationally open problem. Therefore, several researches and methodologies have been developed for it. This paper presents the application of protpred-GROMACS, an evolutionary framework for PSP, in structural and energetic contexts...
A self-consistent calculation is able to perform a dynamic depletion (or accumulation) width of the semiconductor substrate near the interface of the gate/insulators/substrate (GIS) structure of a MOSFET device. After investigating our programs, we discovered that the recursive algorithms of a self-consistent calculation belonged to a nondeterministic polynomial time (NP) problem.
An impulse-momentum approach is proposed for swing-up control of the acrobot. The algorithm is based on increasing the total energy of the system using impulsive inputs. After increasing the energy of the system, rest-to-rest maneuvers are employed to regulate the system energy to the desired level that corresponds to the upright configuration of the acrobot. The proposed algorithm is implemented...
The techniques of path finding and its optimization are widely applied in the fields of game development, intelligent navigation, GIS and so on. We have pointed out the deficiency of A* algorithm by analyzing the algorithm based on heuristic search and combining with the field of game development. By the skill of flood filling and the potential field to pre-treatment analysis the map, with searching...
The traditional training method of synergetic neural network is to calculate prototype vector first, then adjoint vector is figured out from prototype vector according to certain rules, the whole course is slowly. The studying of potential energy function dynamics process can train prototype vector and adjoint vector meanwhile. The optimization approach is introduced to synergetic dynamics evolution...
We consider a scenario where a sophisticated jammer jams an area in which a single-channel random-access-based wireless sensor network operates. The jammer controls the probability of jamming and the transmission range in order to cause maximal damage to the network in terms of corrupted communication links. The jammer action ceases when it is detected by the network (namely by a monitoring node),...
Protein folding problem is one of the central problems in the cross-discipline field involving biology, computational physics and computer science. In this paper, based on the heuristic physical model, a three-dimensional AB mode-based protein folding problem is converted from a nonlinear constraint-satisfied problem to an unconstrained optimization problem, which can be solved by the gradient method...
Focusing on the special need of nano-engineering, an improved neighbor list algorithm for the ultra-large scale molecular dynamics (MD) simulation is proposed. The new algorithm is attempting to fully combine the advantages of both Verlet table and cell-linked list algorithms to accelerate the speed of neighbor list construction and update. In order to meet the requirement of nano-engineering that...
We study the circular packing problem (CPP) which consists of packing a set of circles of known radii into a larger containing circle without overlapping. The objective is to determine the smallest radius of the containing circle and the coordinates of the center of every packed circle. To solve CPP, we propose a heuristic simulated annealing (HSA) algorithm that incorporates heuristic neighborhood...
The classical Load Balancing Problem (LBP) is to map tasks to processors so as to minimize the maximum load. Solving the LBP successfully would lead to better utilization of resources and better performance. The LBP has been proven to be NP-hard, thus generating the exact solutions in a tractable amount of time becomes infeasible when the problems become large.We present a new nature-inspired approximation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.