With the continuous improvement of modern CAE technology, structural reanalysis algorithm has gradually come into people’s vision and developed rapidly. The structure introduced in this paper is an accelerated calculation method. core idea to avoid complete analytical calculations after modification, reduce scale, save time, improve efficiency simulation effectively on premise meeting requireme...

Embedded hardware design is important in real world applications, but with the increase of the hardware scale the traditional methods can not design them well. Cultural Algorithms are a class of computational models derived from observing the cultural evolution process in nature. Aiming at the disadvantages of basic Cultural Algorithms like being trapped easily into a local optimum, this paper ...

Solving challenging problems with non-separable, multi-funnel, multi-property, asymmetrical characteristics are the targets of recent studies in continuous optimisation. In this thesis, I proposed a local search-hybrid optimisation framework with a view to solving some problems belonging to the mentioned class. I tried to achieve this goal by following three approaches. Firstly, to utilise the ...

This work in progress report envisions a library for multivariate polynomials developed jointly by experts from computer theorem proving (CTP) and computer algebra (CA). The urgency of verified algorithms has been recognised in the field of CA, but the cultural gap to CTP is considerable; CA users expect high usability and efficiency. This work collects the needs of CA experts and reports on th...

in this paper we proposed a cellular automaton based local algorithm to solve the autonomously sensor gathering problem in mobile wireless sensor networks (mwsn). in this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. the sensors decide to move only based on their local information. cellular automaton (ca) as dynamical sy...

This paper describes Acorn, a sentence planner and surface realizer for dialogue systems. Improvements to previous stochastic word-forest based approaches are described, countering recent criticism of this class of algorithms for their slow speed. An evaluation of the approach with semantic input shows runtimes of a fraction of a second and presents results that suggest it is also portable acro...