Relevant bibliographies by topics / Linked list / Journal articles
To see the other types of publications on this topic, follow the link: Linked list.

Journal articles on the topic 'Linked list'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Linked list.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Shimomura, T., and S. Isoda. "Linked-list visualization for debugging." IEEE Software 8, no. 3 (May 1991): 44–51. http://dx.doi.org/10.1109/52.88943.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

PENG, Yan-Tsung, Fan-Chieh CHENG, Shanq-Jang RUAN, and Chang-Hong LIN. "Hash-Based Linked-List Histogram Construction." IEICE Transactions on Information and Systems E96.D, no. 5 (2013): 1204–5. http://dx.doi.org/10.1587/transinf.e96.d.1204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Devi, K. Renuka. "Analysis of Arraylist and Linked list." International Journal of Computer Sciences and Engineering 7, no. 5 (May 31, 2019): 1566–70. http://dx.doi.org/10.26438/ijcse/v7i5.15661570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rolfe, Timothy J. "Classroom exercise demonstrating linked list operations." ACM SIGCSE Bulletin 38, no. 4 (December 2006): 83–84. http://dx.doi.org/10.1145/1189136.1189177.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Han, Yijie, Hemasree Koganti, and Nikita Goyal. "Sort Integers into a Linked List." Computer and Information Science 13, no. 1 (January 14, 2020): 51. http://dx.doi.org/10.5539/cis.v13n1p51.

Full text
Abstract:
We show that n integers in {0, 1, …, m-1} can be sorted into a linked list in constant time using nlogm processors on the Priority CRCW PRAM model, and they can be sorted into a linked list in O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model.
APA, Harvard, Vancouver, ISO, and other styles
6

Rakesh, Sarvesh. "Speeding Up Search in Singly Linked List." International Journal of Computer Applications 182, no. 18 (September 18, 2018): 19–24. http://dx.doi.org/10.5120/ijca2018917892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Levy, E. "The linked list class of Modula-3." ACM SIGPLAN Notices 23, no. 8 (August 1988): 93–102. http://dx.doi.org/10.1145/47907.47915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Khosraviyani, Firooz. "Using binary search on a linked list." ACM SIGCSE Bulletin 22, no. 3 (August 1990): 7–10. http://dx.doi.org/10.1145/101085.101088.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Meissner, Loren P. "Fortran 90 & 95 linked list operations." ACM SIGPLAN Fortran Forum 16, no. 2 (August 1997): 18–22. http://dx.doi.org/10.1145/270891.270892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Han, Yijie. "Parallel algorithms for computing linked list prefix." Journal of Parallel and Distributed Computing 6, no. 3 (June 1989): 537–57. http://dx.doi.org/10.1016/0743-7315(89)90005-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Blevins, Jason R. "A generic linked list implementation in Fortran 95." ACM SIGPLAN Fortran Forum 28, no. 3 (December 4, 2009): 2–7. http://dx.doi.org/10.1145/1667140.1667141.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Hardiyana, B., L. Fadilah, and D. Effendi. "Application of Linked List Algorithm Based on Multimedia." IOP Conference Series: Materials Science and Engineering 879 (August 7, 2020): 012087. http://dx.doi.org/10.1088/1757-899x/879/1/012087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Shene, Ching-Kuang. "A comparative study of linked list sorting algorithms." 3C ON-LINE 3, no. 2 (April 1996): 4–9. http://dx.doi.org/10.1145/225890.225893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Zhang, Lin, and Jian Li Zhang. "Association Rules Mining Algorithm Based on Linked List." Applied Mechanics and Materials 380-384 (August 2013): 1649–51. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1649.

Full text
Abstract:
The paper gave a new association rules mining algorithm based on linked list at the traditional association rules mining algorithm which based on frequent item sets and always ignore the exception rules. The algorithm first scanned the database once and generated the association rules including frequent association rules and exception rules by uses the logical and set theory operations. After example analysis, the algorithm not only with high accuracy and low cost, but also can provide some reference data for exception knowledge mining by generate exception rules.
APA, Harvard, Vancouver, ISO, and other styles
15

Kuehn, B. M. "Growing List of Infections Linked to TNF Blockers." JAMA: The Journal of the American Medical Association 306, no. 13 (October 4, 2011): 1430. http://dx.doi.org/10.1001/jama.2011.1387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Gao, Yong Ping, and Jun Zhang. "Design and Implementation of Multiple Linked Lists Sharing the same Memory." Advanced Materials Research 706-708 (June 2013): 1936–40. http://dx.doi.org/10.4028/www.scientific.net/amr.706-708.1936.

Full text
Abstract:
In some languages, because there is no pointer data type, so the single linked list is described by the use of the array. When there are multiple nodes of the same type list, these lists can share the same static linked list of memory, so it can mutually adjust the remaining places to reduce the overflow space. To solve practical problems, this paper is designed from the static linked list sharing the same storage space, the constructor, inserting operations, deleting operations, and it puts up forward a suggestion of its specific implementation and analyzes time complexity of algorithms and its significances.
APA, Harvard, Vancouver, ISO, and other styles
17

Jia, Lianhui, Yang Zhang, and Guijuan Li. "A fast algorithm to compute shadow areas for Kirchhoff approximation-based underwater acoustic scattering simulation." MATEC Web of Conferences 283 (2019): 03005. http://dx.doi.org/10.1051/matecconf/201928303005.

Full text
Abstract:
Kirchhoff approximation method is a fast underwater acoustic scattering numerical method which adaptive to engineering application. Shadow areas calculation is one of the most important factors for computational efficiency. In this paper, several existing shadow domain calculation methods for underwater acoustic numerical simulation based on Kirchhoff approximation are introduced. On this basis, a fast sheltering method based on the linked-list search algorithm is proposed. Linked-list search algorithm uses element geometric center to express the element space position and projects the geometric center on incident wave plane along the incident sound ray. And linked-list relationship of elements is established by dividing background mesh cell on the screen. The algorithm achieves fast calculation by using linked-list relationship and optimizing the calculation path. Linked-list search algorithm and all-pair search algorithm are compared and analyzed by an example of numerical simulation. The computational efficiency of the fast shadow domain algorithm is verified by comparing the results of the two algorithms. And the suggestions for further improving the computational efficiency of the algorithm are proposed.
APA, Harvard, Vancouver, ISO, and other styles
18

Yang, Jason C., Justin Hensley, Holger Grün, and Nicolas Thibieroz. "Real-Time Concurrent Linked List Construction on the GPU." Computer Graphics Forum 29, no. 4 (August 26, 2010): 1297–304. http://dx.doi.org/10.1111/j.1467-8659.2010.01725.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Ng, D. T. H., and B. J. Oommen. "A Short Note on Doubly-Linked List Reorganizing Heuristics." Computer Journal 35, no. 5 (October 1, 1992): 533–35. http://dx.doi.org/10.1093/comjnl/35.5.533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Klotz, Jerome. "A linked list for the wilcoxon signed rank test." Journal of Nonparametric Statistics 9, no. 1 (January 1998): 87–93. http://dx.doi.org/10.1080/10485259808832736.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Al-Rashed, Rwan F., Atheer S. Al-Mutiri, Wadha M. Al-Marrai, Badriayh G. Al-Mutiri, Hanan F. Al-Qahtani, Jehan A. Al-Buainain, Hanaa F. Morse, and Enas E. El-Sharawy. "EVALUATING THE REVERSING DATA STRUCTURE ALGORITHM OF LINKED LIST." Indian Journal of Computer Science and Engineering 11, no. 1 (February 29, 2020): 57–65. http://dx.doi.org/10.21817/indjcse/2020/v11i1/201101070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Khan, Muhammad Sajid, Andrew Ware, Usman Habib, Muhammad Junaid Khalid, and Nisar Bahoo. "Skeleton Based Human Action Recognition Using Doubly Linked List." International Journal of Computer Trends and Technology 70, no. 2 (February 25, 2022): 18–21. http://dx.doi.org/10.14445/22312803/ijctt-v70i2p103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Aksu, Mustafa, and Ali Karcı. "Pyramid Search: Skip Ring Data Structure-Based New Searching Algorithm." Journal of Circuits, Systems and Computers 27, no. 14 (August 23, 2018): 1850218. http://dx.doi.org/10.1142/s0218126618502183.

Full text
Abstract:
Our new algorithm and data structure, pyramid search (PS) and skip ring, were created with the help of circular linked list and skip list algorithms and data structures. In circular linked list, operations were performed on a single circular list. Our new data structure consists of circular linked lists formed in layers which were linked in a pyramid way. Time complexity of searching, insertion and deletion algorithms equal to [Formula: see text] (lg[Formula: see text]) in an [Formula: see text]-element skip ring data structure. Therefore, skip ring data structure is employed more effectively ([Formula: see text](lg[Formula: see text])) in circumstances where circular linked lists ([Formula: see text]) are used. The priority is determined based on the searching frequency in PS which was developed in this study. Thus, the time complexity of searching is almost [Formula: see text](1) for [Formula: see text] records data set. In this paper, the applications of searching algorithms like linear search (LS), binary search (BS) and PS were realized and the obtained results were compared. The obtained results demonstrated that the PS algorithm is superior to the BS algorithm.
APA, Harvard, Vancouver, ISO, and other styles
24

Shukla, Ajay Narayan, Vishal Bharti, and Madan L. Garag. "A Linked List-Based Exact Algorithm for Graph Coloring Problem." Revue d'Intelligence Artificielle 33, no. 3 (October 10, 2019): 189–95. http://dx.doi.org/10.18280/ria.330304.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

ZHAO, Zhen, Jun-wei YAN, Min LIU, and Gang LIU. "A genetic algorithm based on double linear-linked-list encoding." Journal of Computer Applications 29, no. 2 (April 7, 2009): 554–57. http://dx.doi.org/10.3724/sp.j.1087.2009.00554.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Khosraviyani, Firooz, Mohammad H. Moadab, and Douglas F. Hale. "Time distribution analysis for binary search of a linked list." ACM SIGCSE Bulletin 23, no. 4 (November 1991): 7–12. http://dx.doi.org/10.1145/122697.122698.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Mattson, William, and Betsy M. Rice. "Near-neighbor calculations using a modified cell-linked list method." Computer Physics Communications 119, no. 2-3 (June 1999): 135–48. http://dx.doi.org/10.1016/s0010-4655(98)00203-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Sulzmann, Martin, Edmund S. L. Lam, and Simon Marlow. "Comparing the performance of concurrent linked-list implementations in Haskell." ACM SIGPLAN Notices 44, no. 5 (May 6, 2009): 11–20. http://dx.doi.org/10.1145/1629635.1629643.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Kaiser, J. "Cancers Join List of Illnesses Linked to 9/11 Attacks." Science 337, no. 6101 (September 20, 2012): 1447. http://dx.doi.org/10.1126/science.337.6101.1447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Rakesh, Mohanty, and Singh Kumar Rakesh. "New Results on Competitive Analysis of Move To Middle(MTM) List Update Algorithm using Doubly Linked List." Procedia Computer Science 125 (2018): 762–69. http://dx.doi.org/10.1016/j.procs.2017.12.098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Pant, Yogesh. "A Novel Approach to Minimize DFA State Machines Using Linked List." International Journal of Scientific Research in Computer Science and Engineering 6, no. 4 (August 31, 2018): 41–45. http://dx.doi.org/10.26438/ijsrcse/v6i4.4145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Zhao, Ming, and Qian Kemao. "Quality-guided phase unwrapping implementation: an improved indexed interwoven linked list." Applied Optics 53, no. 16 (May 27, 2014): 3492. http://dx.doi.org/10.1364/ao.53.003492.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Sher, David B. "A simple implementation of a queue with a circularly linked list." ACM SIGCSE Bulletin 36, no. 3 (September 2004): 274. http://dx.doi.org/10.1145/1026487.1008112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Yamamura, Shuji, Tadafumi Kadota, Hiroaki Hirata, Haruo Niimi, and Kiyoshi Shibayama. "Evaluation of a data preload mechanism for a linked list structure." Systems and Computers in Japan 33, no. 3 (February 15, 2002): 21–30. http://dx.doi.org/10.1002/scj.1110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Han, Y. "An optimal linked list prefix algorithm on a local memory computer." IEEE Transactions on Computers 40, no. 10 (1991): 1149–53. http://dx.doi.org/10.1109/12.93747.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

WEI, ZHENG, and JOSEPH JAJA. "OPTIMIZATION OF LINKED LIST PREFIX COMPUTATIONS ON MULTITHREADED GPUS USING CUDA." Parallel Processing Letters 22, no. 04 (December 2012): 1250012. http://dx.doi.org/10.1142/s0129626412500120.

Full text
Abstract:
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on the multithreaded GPUs Tesla C1060, Tesla C2050, and GTX480 using CUDA. Prefix computations on linked structures involve in general highly irregular fine grain memory accesses that are typical of many computations on linked lists, trees, and graphs. While the current generation of GPUs provides substantial computational power and extremely high bandwidth memory accesses, they may appear at first to be primarily geared toward streamed, highly data parallel computations. In this paper, we introduce an optimized multithreaded GPU algorithm for prefix computations through a randomization process that reduces the problem to a large number of fine-grain computations. We map these fine-grain computations onto multithreaded GPUs in such a way that the processing cost per element is shown to be close to the best possible. Our experimental results show scalability for list sizes ranging from 1M nodes to 256M nodes, and significantly improve on the recently published parallel implementations of list ranking, including implementations on the Cell Processor, the MTA-8, and the NVIDIA GT200 and Fermi series. They also compare favorably to the performance of the best known CUDA algorithm for the scan operation on the Tesla C1060 and GTX480.
APA, Harvard, Vancouver, ISO, and other styles
37

Mikhav, Volodymyr, Yelyzaveta Meleshko, and Serhii Shymko. "Methods and Data Structures for Implementing a Database of Social Networks' Recommendation Systems." Central Ukrainian Scientific Bulletin. Technical Sciences, no. 4(35) (2021): 8–16. http://dx.doi.org/10.32515/2664-262x.2021.4(35).8-16.

Full text
Abstract:
The goal of this work is to research and program implementation of methods and data structures for building a database of a recommendation system in order to compare the efficiency of their use in terms of time and memory costs. The presence of a large number of different methods of database implementation necessitates a comparative analysis and selection of the optimal method and data structure for storing information in recommendation systems. A research on various data structures that can be used to create a recommendation system database, in particular, the linked list, unrolled linked list, hash table, B-tree, B+-tree, and binary decision diagram were examined was conducted. A series of experiments on a software simulation model of a recommendation system with a different number of agents, items and sessions was also carried out. The following research results were obtained. According to the results of the experiments, the unrolled linked list showed the best time and memory effectiveness. The B+-tree structure showed results close to a hash table. The access time to an individual element is stable in both cases, but the B+-tree has certain advantages – the elements are kept sorted, and when resizing, there is no need to expand the memory area. The worst results were shown by the data structure of the binary decision diagram, both in terms of time consumption and memory consumption. Profiling showed that 75% of the test run time for the option with an unrolled list was taken by generating random data for software simulation of agents and items of the recommendation system, therefore, the data warehouse itself has high performance indicators. Profiling of the variant with an inverted list showed that access to random blocks takes longer due to the inability to cache them, therefore, under real load conditions, the time for inserting new data will be longer, and the relative efficiency of using the inverted list will increase. For the most efficient use of memory, the block size of the linked list should be adapted so that the blocks are as full as possible. Small blocks reduce memory waste, but increase the time to traverse all the elements of the list and increase memory overhead.
APA, Harvard, Vancouver, ISO, and other styles
38

Liu, Zhi, Rui Li, Hong Huang, Yi Cheng, and Xiaoping Yu. "The Method of Data Access for Nuclear Instrument Based on Linked List." Journal of Computer and Communications 04, no. 07 (2016): 1–6. http://dx.doi.org/10.4236/jcc.2016.47001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Atta, Nuku, and Dominic Asamoah. "Implementing Lock Free Data Structure for Shared-Memory Systems using Linked List." International Journal of Computer Applications 178, no. 4 (November 15, 2017): 9–14. http://dx.doi.org/10.5120/ijca2017915806.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Cai, Ruihuan, Lei Xu, Jinyang Zheng, and Yongzhi Zhao. "Modified cell-linked list method using dynamic mesh for discrete element method." Powder Technology 340 (December 2018): 321–30. http://dx.doi.org/10.1016/j.powtec.2018.09.034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

AKLEMAN, ERGUN, and JIANER CHEN. "GUARANTEEING THE 2-MANIFOLD PROPERTY FOR MESHES WITH DOUBLY LINKED FACE LIST." International Journal of Shape Modeling 05, no. 02 (December 1999): 159–77. http://dx.doi.org/10.1142/s0218654399000150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Sulzmann, Martin, Edmund S. L. Lam, and Simon Marlow. "Comparing the performance of concurrent linked-list implementations in Haskell (abstract only)." ACM SIGPLAN Notices 44, no. 5 (May 6, 2009): 9. http://dx.doi.org/10.1145/1629635.1629640.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Li, Wan-Qing, Tang Ying, Wan Jian, and Dong-Jin Yu. "Comparison research on the neighbor list algorithms: Verlet table and linked-cell." Computer Physics Communications 181, no. 10 (October 2010): 1682–86. http://dx.doi.org/10.1016/j.cpc.2010.06.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Shrivastava, Akash. "Graph and its Computer Application with C++ Using Linked Lists." Advanced Materials Research 667 (March 2013): 186–92. http://dx.doi.org/10.4028/www.scientific.net/amr.667.186.

Full text
Abstract:
An effort is made to develop a computer programme using C++ to explain the working of a adjacency linked-list representation of a directed graph or digraph and explain the allocation of data using C++. The program uses the concept of arranging a graph in the form of a linked list for the computer to understand the graphical form representation of any data. The graph algorithms are a significant field of interest within computer science. Typical higher level operations associated with graphs are; finding a path between two nodes, like depth-first search and breadth-first search and finding the shortest path from one node to another, like Dijkstra's algorithm. A solution to finding the shortest path from each node to every other node also exists in the form of the Floyd-Warshall algorithm. A directed graph can be seen as a flow network, where each edge has a capacity and each edge receives a flow. The Ford-Fulkerson algorithm is used to find out the maximum flow from a source to a sink in a graph. Conversion of a graph into a computer storable digital data is useful for nanodevices.
APA, Harvard, Vancouver, ISO, and other styles
45

DAS, SAJAL K., and RANETTE H. HALVERSON. "SIMPLE DETERMINISTIC AND RANDOMIZED ALGORITHMS FOR LINKED LIST RANKING ON THE EREW PRAM MODEL." Parallel Processing Letters 04, no. 01n02 (June 1994): 15–27. http://dx.doi.org/10.1142/s012962649400003x.

Full text
Abstract:
An asynchronous, CRCW PRAM (or APRAM) algorithm for linked list ranking, proposed by Martel and Subramonian, performs EO (n log log n) expected work employing [Formula: see text] processors. Motivated by their unique approach, this paper proposes two EREW list ranking algorithms – one deterministic and the other randomized. The deterministic algorithm performs in [Formula: see text] time using p processors, where n≥p log p. Thus, for p= O (n/ log n), it requires O ( log n log log n) time and O (n log log n) work. Although not work-optimal, this algorithm is very simple compared to the known work-optimal (deterministic) EREW algorithms for list ranking and has the added advantage of small constant factors in the time and space requirements. The randomized algorithm follows the same line of approach, but uses randomization in one step to decrease the time complexity, thus improving on the time complexity of the original algorithm. It requires [Formula: see text] expected time, and hence it is an EO ( log n) expected time, work-optimal algorithm employing p= O (n/ log n) processors. Furthermore, the randomized algorithm uses less space than the deterministic algorithm.
APA, Harvard, Vancouver, ISO, and other styles
46

NAKANO, KOJI. "TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION." International Journal of Foundations of Computer Science 15, no. 01 (February 2004): 73–88. http://dx.doi.org/10.1142/s0129054104002315.

Full text
Abstract:
A Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by n processing units referred to as stations. The stations can communicate by broadcasting/receiving a data packet to one of k distinct communication channels. We assume that the stations run on batteries and expend power while broadcasting/receiving a data packet. Thus, the most important measure to evaluate algorithms on the BCM is the number of awake time slots, in which a station is broadcasting/receiving a data packet. The main contribution of this paper is to present time and energy optimal list ranking algorithms on the BCM. We first show that the rank of every node in an n-node linked list can be determined in O(n) time slots with no station being awake for more than O(1) time slots on the single-channel n-station BCM with no collision detection. We then extend this algorithm to run on the k-channel BCM. For any small fixed ∊>0, our list ranking algorithm runs in [Formula: see text] time slots with no station being awake for more than O(1) time slots, provided that k≤n1-∊. Clearly, [Formula: see text] time is necessary to solve the list ranking problem for an n-node linked list on the k-channel BCM. Therefore, our list ranking algorithm on the k-channel BCM is time and energy optimal.
APA, Harvard, Vancouver, ISO, and other styles
47

Acevedo-Avila, Ricardo, Miguel Gonzalez-Mendoza, and Andres Garcia-Garcia. "A Linked List-Based Algorithm for Blob Detection on Embedded Vision-Based Sensors." Sensors 16, no. 6 (May 28, 2016): 782. http://dx.doi.org/10.3390/s16060782.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Li, Guo Chang. "Research on Roll Bending Forming Dynamic Linked List Model and Intelligence Deformation Analysis." Applied Mechanics and Materials 215-216 (November 2012): 857–60. http://dx.doi.org/10.4028/www.scientific.net/amm.215-216.857.

Full text
Abstract:
Aiming at the actual cold bending forming rolling process, in order to make more accurate analyses to stress and strain, the paper mentioned dynamic link model of rolling process, and based on the spline finite method , using the model to study the deformation analysis method of node and link in actual roll forming process, giving the holey stress and strain mathematics description type of link structure node, and on this basis intelligent node structure is given. Set up corresponding Agent for each node or link, establish knowledge rules for each Agent, realize a new method making use of link model to analysis cold bending forming. Provide the theoretical foundation of establishing a new complex profile groove design algorithm.
APA, Harvard, Vancouver, ISO, and other styles
49

Shi, Wenkui, Jianqiang Chen, Yanming Shen, and Yi Jiang. "SPH Method with Space-Based Variable Smoothing Length and Its Applications to Free Surface Flow." International Journal of Computational Methods 16, no. 02 (November 29, 2018): 1846002. http://dx.doi.org/10.1142/s0219876218460027.

Full text
Abstract:
In order to improve the computational efficiency and spatial resolution of smoothed particle hydrodynamics (SPH) method, a SPH method with space-based variable smoothing length has been developed. In addition, since linked-list search algorithm cannot handle the variable smoothing length problems, an improved linked-list search algorithm and a balanced alternating digital tree (B-ADT) search algorithm have been proposed. The performance of the two improved search algorithms has been evaluated in detail. These methods have been used to simulate two cases of water entry impact and two cases of gas–liquid two-phase flow. The results show that, by using space-based variable smoothing length algorithm, computational cost can be greatly reduced and the numerical accuracy is maintained.
APA, Harvard, Vancouver, ISO, and other styles
50

Mohamed Nuh, Abdifatah. "Information on dysregulation of microRNA in placenta linked to preeclampsia." Bioinformation 17, no. 1 (January 31, 2021): 240–48. http://dx.doi.org/10.6026/97320630017240.

Full text
Abstract:
MicroRNAs are single-stranded, non-coding RNA molecules, regulate gene expression at the post-transcriptional level. They are expressed in the human body and have a significant impact on the different processes of pathological illness. A developing placenta undergoes a series of stages after successful fertilization, such as cell division, migration, adhesion, apoptosis, and angiogenesis. MicroRNAs dysregulation in placenta has been linked to pregnancy-related complications such as preeclampsia. Therefore, it is of interest to document known information (list of microRNA) on this issue in the development of biological tools for diagnosis, treatment and prevention of the disease.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Linked list' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography