scholarly journals Collaborative Design and Manufacture: Information Structures for Team Formation and Coordination

2021 ◽  
pp. 93-104
Author(s):  
Iain Duncan Stalker ◽  
Nikolai Kazantsev
Keyword(s):  
Collaborative Design ◽  
Team Formation ◽  
Information Structures ◽  
Tree Traversal ◽  
Structure Tree ◽  
Tree Data ◽  
Tree Data Structure ◽  
Traditional Approaches ◽  
Design And Manufacture ◽  
Manufacturing Environments

AbstractOur interest here lies in supporting important, but routine and time-consuming activities that underpin success in highly distributed, collaborative design and manufacturing environments; and how information structuring can facilitate this. To that end, we present a simple, yet powerful approach to team formation, partner selection, scheduling and communication that employs a different approach to the task of matching candidates to opportunities or partners to requirements (matchmaking): traditionally, this is approached using either an idea of ‘nearness’ or ‘best fit’ (metric-based paradigms); or by finding a subtree within a tree (data structure) (tree traversal). Instead, we prefer concept lattices to establish notions of ‘inclusion’ or ‘membership’: essentially, a topological paradigm. While our approach is substantive, it can be used alongside traditional approaches and in this way one could harness the strengths of multiple paradigms.

scholarly journals A Breadth-First, Ordered Parallel Tree Traversal

2019 ◽  
Author(s):  
Joshua Haley ◽  
Benjamin Shaia ◽  
Joshua Subrahmanyam ◽  
Ebin Scaria
Keyword(s):  
Graph Algorithm ◽  
Breadth First Search ◽  
Science Field ◽  
The Past ◽  
Distinct Structure ◽  
Tree Traversal ◽  
Tree Data ◽  
Tree Data Structure ◽  
Work Done ◽  
Tree Traversals

There has been a shift towards parallel computing in the computer science field over the past years, which has spurred interest in investigating the parallelization of classic sequential algorithms. Much research has been vested in graphs, particularly the application of breadth-first search. However, a subset of graphs, the tree data structure, has common use in various applications, yet focus tends to remain on graphs. A possible reason is that an effective graph algorithm could easily be applied to a tree, but a tree has a more distinct structure. Therefore, developing algorithms to exploit the specific design of a tree may improve efficiency over the application of a graph algorithm. We present concurrent breadth first tree traversal algorithm for M-ary trees, where M is an upper bound to the number of child nodes that a given node may have. The algorithm was developed in Java for portability and differs from other approaches in that it shall provide a meaningful ordering of nodes, which is absent in breadth first graph traversals. The approach provides relative fairness in the work done by each thread to aid scalability and eliminates the use of transactional memory, which appears in other concurrent tree traversals that do provide ordering. However, the use of rollback in these methods introduces a higher level of non-determinism to the computation, which we attempt to avoid for a better analysis of the algorithm.

Logical Structure for User Friendly dynamic Web Page Visualization for Small Screen Terminals Promoting E-Business

2020 ◽  
Vol 14 ◽  
Author(s):  
Shefali Singhal ◽  
Poonam Tanwar
Keyword(s):  
Logical Structure ◽  
Vital Role ◽  
Web Pages ◽  
Main Concern ◽  
Web Page ◽  
Large Screen ◽  
Tree Data ◽  
Tree Data Structure ◽  
User Friendly ◽  
Small Screen

Abstract:: Now-a-days when everything is going digitalized, internet and web plays a vital role in everyone’s life. When one has to ask something or has any online task to perform, one has to use internet to access relevant web-pages throughout. These web-pages are mainly designed for large screen terminals. But due to mobility, handy and economic reasons most of the persons are using small screen terminals (SST) like mobile phone, palmtop, pagers, tablet computers and many more. Reading a web page which is actually designed for large screen terminal on a small screen is time consuming and cumbersome task because there are many irrelevant content parts which are to be scrolled or there are advertisements, etc. Here main concern is e-business users. To overcome such issues the source code of a web page is organized in tree data-structure. In this paper we are arranging each and every main heading as a root node and all the content of this heading as a child node of the logical structure. Using this structure, we regenerate a web-page automatically according to SST size. Background:: DOM and VIPS algorithms are the main background techniques which are supporting the current research. Objective:: To restructure a web page in a more user friendly and content presenting format. Method Backtracking:: Method Backtracking: Results:: web page heading queue generation. Conclusion:: Concept of logical structure supports every SST.

TABU PROGRAMMING: A NEW PROBLEM SOLVER THROUGH ADAPTIVE MEMORY PROGRAMMING OVER TREE DATA STRUCTURES

2011 ◽  
Vol 10 (02) ◽  
pp. 373-406 ◽  
Author(s):  
ABDEL-RAHMAN HEDAR ◽  
EMAD MABROUK ◽  
MASAO FUKUSHIMA
Keyword(s):  
Search Algorithm ◽  
Benchmark Problems ◽  
Problem Solver ◽  
Learning Tools ◽  
Mutation Operators ◽  
Tree Data ◽  
Tree Data Structure ◽  
Comprehensive Framework ◽  
Rate Of Success ◽  
Crossover And Mutation

Since the first appearance of the Genetic Programming (GP) algorithm, extensive theoretical and application studies on it have been conducted. Nowadays, the GP algorithm is considered one of the most important tools in Artificial Intelligence (AI). Nevertheless, several questions have been raised about the complexity of the GP algorithm and the disruption effect of the crossover and mutation operators. In this paper, the Tabu Programming (TP) algorithm is proposed to employ the search strategy of the classical Tabu Search algorithm with the tree data structure. Moreover, the TP algorithm exploits a set of local search procedures over a tree space in order to mitigate the drawbacks of the crossover and mutation operators. Extensive numerical experiments are performed to study the performance of the proposed algorithm for a set of benchmark problems. The results of those experiments show that the TP algorithm compares favorably to recent versions of the GP algorithm in terms of computational efforts and the rate of success. Finally, we present a comprehensive framework called Meta-Heuristics Programming (MHP) as general machine learning tools.

A Scalable Algorithm for Constructing Frequent Pattern Tree

2014 ◽  
Vol 10 (1) ◽  
pp. 42-56 ◽  
Author(s):  
Zailani Abdullah ◽  
Tutut Herawan ◽  
A. Noraziah ◽  
Mustafa Mat Deris
Keyword(s):  
Data Structure ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Scalable Algorithm ◽  
Tree Construction ◽  
Frequent Pattern Tree ◽  
Support Threshold ◽  
Benchmark Datasets ◽  
Tree Data ◽  
Tree Data Structure

Frequent Pattern Tree (FP-Tree) is a compact data structure of representing frequent itemsets. The construction of FP-Tree is very important prior to frequent patterns mining. However, there have been too limited efforts specifically focused on constructing FP-Tree data structure beyond from its original database. In typical FP-Tree construction, besides the prior knowledge on support threshold, it also requires two database scans; first to build and sort the frequent patterns and second to build its prefix paths. Thus, twice database scanning is a key and major limitation in completing the construction of FP-Tree. Therefore, this paper suggests scalable Trie Transformation Technique Algorithm (T3A) to convert our predefined tree data structure, Disorder Support Trie Itemset (DOSTrieIT) into FP-Tree. Experiment results through two UCI benchmark datasets show that the proposed T3A generates FP-Tree up to 3 magnitudes faster than that the benchmarked FP-Growth.

scholarly journals Pengenalan Motif Karawo Menggunakan Ekstraksi Fitur SIFT Dan Approximate Nearest Neighbor

2019 ◽  
Author(s):  
Syahrial
Keyword(s):  
Nearest Neighbor ◽  
Feature Matching ◽  
Recognition Accuracy ◽  
Sift Algorithm ◽  
Approximate Nearest Neighbor ◽  
Single Pattern ◽  
Tree Data ◽  
Threshold Testing ◽  
Root Word ◽  
Tree Data Structure

An art culture from Gorontalo became iconic handcraft is kerawang or karawo. The word “karawo” came from root word of “mokarawo” which means slicing or making holes. It’s created with precision, carefulness, and patience in work using handmade masterpiece. Pattern of karawo itself held four kinds which is flora, fauna, geometric, and nature. From those kinds born vary pattern which come difficult to identify both its names and its kind. Karawo patterns can be form as a single pattern or a pattern that it parts came from several or many pattern combined. Those patterns had its own characteristic from shape and scale perspective. Identifying single pattern on combined pattern are particularly a problem because it’s combined involve scaling and rotation. This research is recognizing single pattern on combined pattern using feature extraction SIFT algorithm which is capable extract feature that invariant from scale and rotation. Feature matching using approximate nearest neighbor (aNN) for similarity of features labor best bin first strategy on kd-tree data structure. Those methods can be a reference to recognize single pattern on combined pattern using from range 5 to 20 match features as a threshold. Testing result indicated recognition accuracy is good which range form 76.36% to 85.45% on recognize the kind of karawo pattern and 76.36% on its name.

scholarly journals Efficient n-to-n Collision Detection for Space Debris using 4D AABB Trees

10.29007/5pl1 ◽  
2019 ◽  
Author(s):  
Stanley Bak ◽  
Kerianne Hobbs
Keyword(s):  
Collision Detection ◽  
Space Debris ◽  
Dynamics Simulation ◽  
Video Gaming ◽  
Time Dimension ◽  
Detection Algorithms ◽  
Space Objects ◽  
Tree Data ◽  
Tree Data Structure ◽  
Three Space

Collision detection algorithms are used in aerospace, swarm robotics, automotive, video gaming, dynamics simulation and other domains. As many applications of collision detection run online, timing requirements are imposed on the algorithm runtime: algorithms must, at a minimum, keep up with the passage of time. Even offline reachability computation can be slowed down by the process of safety checking when n is large and the specification is n-to-n collision avoidance. In practice, this places a limit on the number of objects, n, that can be concurrently tracked or verified. In this paper, we present an improved method for efficient object tracking and collision detection, based on a modified version of the axis-aligned bounding-box (AABB) tree data structure. We consider 4D AABB Trees, where a time dimension is added to the usual three space dimensions, in order to enable per-object time steps when checking for collisions in space-time. We evaluate the approach on a space debris collision benchmark, demonstrating efficient checking beyond the full catalog of n = 16848 space objects made public by the U.S. Strategic Command on www.space-track.org.

Sign in / Sign up

Export Citation Format

Share Document