scholarly journals Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm

2020 ◽  
Vol 256 ◽  
pp. 107414
Author(s):  
Stefan Schnabel ◽  
Wolfhard Janke
2012 ◽  
Vol 47 (1) ◽  
pp. 123-136 ◽  
Author(s):  
Parthasarathy Madhusudan ◽  
Xiaokang Qiu ◽  
Andrei Stefanescu
Keyword(s):  

2011 ◽  
Vol 73 (4) ◽  
pp. 111-126 ◽  
Author(s):  
Anton Bardera ◽  
Imma Boada ◽  
Miquel Feixas ◽  
Jaume Rigau ◽  
Mateu Sbert

1986 ◽  
Vol 18 (1) ◽  
pp. 67-72 ◽  
Author(s):  
G. Scott Owen
Keyword(s):  

1999 ◽  
Vol 10 (01) ◽  
pp. 1-17 ◽  
Author(s):  
SEONGHUN CHO ◽  
SARTAJ SAHNI

We show that the leftist tree data structure may be adapted to obtain data structures that permit the double-ended priority queue operations Insert, DeleteMin, DeleteMax, and Merge to be done in O( log n) time where n is the size of the resulting queue. The operations FindMin and FindMax can be done in O(1) time. Experimental results are also presented.


Author(s):  
Kai Samelin ◽  
Henrich C. Pöhls ◽  
Arne Bilzhause ◽  
Joachim Posegga ◽  
Hermann de Meer
Keyword(s):  

2011 ◽  
Vol 48-49 ◽  
pp. 767-772 ◽  
Author(s):  
Rui Hang Shi ◽  
Lei Luo ◽  
Zhen Qiang Yao

In this paper, a method of automatic NC code programming is studied. The data structure used to store graph information is the base of automatic programming system. By utilizing the object-oriented tree data structure proposed in the paper, the disadvantages of the method caused by using simple data structures can be overcome. In processing information, the judgment of topological relationship between two outlines is very important. The Loop Extremum Method is easy, convenient and with no limitations. The system adds plenty of technological parameters, provides multiple machining patterns. In the end, an example is given to test and verify the system`s functions.


Sign in / Sign up

Export Citation Format

Share Document