Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 37 for “"tree network"”.
-
Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.
… for five different problems of a rooted tree having n nodes. In the first algorithm, every node has a value; the root calculates the sum of those values, and sends it to all the nodes in the network. In the second algorithm, the root computes the value of mean of values of all the nodes, …
-
Measurement and Application of Household Activity Spaces: A Comparison of Representations
… density estimation, and (c) minimum spanning tree network. These measures are applied to a sample of one-day travel behavior from the 2012 Oʻahu Household Travel Survey. The relationship between the estimated measures and various household characteristics, such as sociodemographic information …
-
Self-stabilizing distributed algorithms for acyclic graphs
A self-stabilizing distributed system is a network of processors, which when started from an arbitrary and possibly illegal state, always returns to a legal state in a finite number of steps. Two self-stabilizing protocols for distributed systems are presented in this thesis. The first protocol …
-
Distributed algorithms for file sorting and shortest path finding.
… stored in a distributed and asynchronous network. An optimal communication complexity O(n log$\sb2$d) is obtained under the assumption that extra memory is available at each site in an almost balanced binary tree network, where n is the file size and d is the number of nodes in the …
-
Understanding the centralized-decentralized electrification paradigm
… first of these develops a novel minimum spanning tree network algorithm to approximate the shortest-length network that connects a given fraction of total system population. This algorithm is used to identify high priority locations for decentralized electrification in 150 countries. The second …
-
Games, Economies and Fair Allocations
… resource sharing problems. First, we study a tree-network problem in which the players can earn some revenue. We propose the nucleolus as a solution-rule and we provide an polynomial time algorithm to compute it. Furthermore, a characterization of the nucleolus as a solution-rule for trees …
-
Αλγόριθμοι σχεδίασης δικτύων τοπολογίας δέντρου με ποικίλους περιορισμούς χωρητικότητας
Designing centralized networks often involves finding minimum cost spanning trees. One of the well-known problems that have been examined extensively in the literature is the Capacitated Minimum Spanning Tree (CMST) problem. In the CMST problem we are given a set of terminal nodes producing …
-
The Modeling, Analysis and Control of Resilient Manufacturing Enterprises
… resource, demand, etc. Each node within the network is represented as a dynamic model with associated costs of production and inventory. This mathematical model is the foundation of quantitative analysis and control. With this model, an optimal control problem is formulated, by which the …
-
Numerical analysis for blood distribution in complete flow cross-section microvascular networks
… experimental data obtained from 50 $\mu$m serial trees with two bifurcations. The variable dispersion model gave the best description of experimental data. The symmetric recovery lengths are computed to compare to branch segment lengths measured in vivo. The comparison shows that for 25 $\mu$m or …
-
The application of optimal transputer architecture to concurrent processing in the implementation of vision processing algorithms
… processing applications. Large transputer networks can be used for computationally<br/>intensive applications.<br/><br/>This work has investigated the use of transputers for performing image processing algorithms of all three levels of complexity. Techniques were devised and implemented for …
-
Applying tree knapsack approaches to general network design : a case study
… decision problems that fall into the category of network flow problems: numerous examples of applications can be found in areas such as telecommunications, logistics, distributions, engineering, computer science and so on. One of the most popular and valuable tools to solve network flow problems …
-
Performance effects of node mapping on the IBM BlueGene/L machine
… nodes connected with three application-level networks -- a high-performance point-to-point 3D torus network, a global combining/broadcast tree network for collective operations, and a global interrupt/barrier network for extremely fast global barriers. The BG/L control system allows the user …
-
Coupled Natural Gas and Electric Power Systems
… are currently transforming natural gas networks. The intermittent operation of gas-fired plants to balance wind generation introduces spatiotemporal fluctuations of increasing gas demand. At the heart of modeling, monitoring, and control of gas networks is a set of nonlinear equations …
-
Face Anti-Spoofing : Detection, Generalization, and Visualization
… unknown spoof attacks and propose a novel Deep Tree Network (DTN) to well represent the unknown spoof attacks. In the visualization stage, we find “spoof trace, the subtle image pattern in spoof faces (e.g., color distortion, 3D mask edge, and Moire pattern), is effective to explain why a spoof …
-
Congestion Driven Clock Tree Routing with Via Minimization
… of vias are usually ignored in most of the clock tree algorithms. These Constraints could make an abstract clock tree difficult to route in practice and cause important manufacturability and reliability challenges. Therefore the final clock tree layout specifications can be seriously deviated from …
-
Self-stabilizing sorting algorithms
… memory. Depending on the connectivity of the network, each machine gets a partial view of the global state. Transient failures in one area of the network may go unnoticed in other areas and may cause the system to go to an illegal global state. However, if the system were self-stabilizing, it …
-
Hamiltonian line graphs and claw -free graphs
… engineering, we studied the inverse problems on networks at the end of the dissertation and showed that the conductivities in a tree network can be uniquely determined by measurements at the boundary of the voltages generated by imposed currents.
-
Efficient coding schemes for file sharing networks
Peer-to-peer networks are commonly constituted by a large number of normal personal computers that are connected via Internet. They do not rely on centralized infrastructure, like servers for instance, to coordinate and to enable network-wide search, and furthermore each participant, called peer, …
-
Problems in Service Operations with Heterogeneous Customers
… locating facilities of two types at nodes of a tree network, where each facility incurs a fixed cost. Customers may need just one type of service, or both types. It is required to minimize the sum of the total transportation and fixed costs. For the problem with a single facility of each type, …
Page 1 of 2