This article describes a method for modeling the propagation of cracks on any 3D surface. Taking a previous cellular automata model as basis, this method allows any type of cracks on any type of triangulated 3D object...
详细信息
This article describes a method for modeling the propagation of cracks on any 3D surface. Taking a previous cellular automata model as basis, this method allows any type of cracks on any type of triangulated 3D object. Our model's main advantage is that it proposes a semi-physical solution, making it at the same time user controllable and easily extensible. After summarizing works in the literature, we make a brief and simple description of what physically are cracks and how they are generated. Based on this idea, we detail our model of crack propagation. We first introduce the general development of cracks. We then propose our original model of spectrum stress. This is followed by the description of the mutual interaction between cracks and stresses. Finally, a set of graphical examples, with their respective parameters, concludes this paper.
When certain types of digitate leaves are folded up along their main veins as in leaf buds, their margins of leaves are found to form a simple curve or a few lines. From the viewpoint that the venation and the folding...
详细信息
When certain types of digitate leaves are folded up along their main veins as in leaf buds, their margins of leaves are found to form a simple curve or a few lines. From the viewpoint that the venation and the folding leaf buds would be closely related each other, we will propose a origami modeling method. By use of this method it is shown that complex digitate shapes such as Acer, Cacalia yatabei and Humulus lupulus would be well produced. We will apply this method to get grass stems and twigs of trees and then generate their CG images. We will see that the poetic beauty of wild plants is well produced by our method. To show this fact we will generate CG images of flower arrangement with plants obtained by our method.
Wireless networking technologies and mobile cellular communication systems are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services...
详细信息
Wireless networking technologies and mobile cellular communication systems are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services, higher capacity, mobility management, and wireless multimedia are all parts of the potpourri. The evolution of new systems and improved designs will always depend on the ability to predict system performance using analytical or simulation methods. To date, mathematical analysis has brought some insight into the design of such systems, but analytical methods are often not general or detailed enough for evaluation and comparison of various proposed mobile and/or wireless systems and their services. distributedsimulation techniques have been investigated in a number of studies to decrease the execution times of PCS simulations. We study the load balancing problem for PCS wireless simulation systems, and focus upon static strategies in order to reduce the synchronization overhead of SWiMNet, a parallel PCS simulation testbed developed at UNT.
The introduction of Java in the mid nineties has revolutionised and revitalised interest in the construction of "supercomputers" from "off the shelf" components. Much of the research spawned by the...
详细信息
The introduction of Java in the mid nineties has revolutionised and revitalised interest in the construction of "supercomputers" from "off the shelf" components. Much of the research spawned by the introduction of Java is in the area of metacomputing, where projects that utilise the distributed capabilities of the World Wide Web are becoming more frequent. WebCom is one such system that implements a framework to harness these distributed resources. Although WebCom supports different models of computation, by incorporating them as distinct modular components, an implicitly parallel graph-based model is used. Visual programming tools for simulation steering are employed allowing the creation, submission and dynamic manipulation of programs.
We mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on paralleldistributed memory computers since these methods are comp...
详细信息
We mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on paralleldistributed memory computers since these methods are competitive with standard pointwise methods on serial machines, but are significantly faster on parallel computers. We propose an improved version of the quasi-minimal residual (IQMR) method by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems (IVP) arising at each linearization step. For the Lanczos process stability is obtained by a coupled two-term procedure that generates Lanczos vectors scaled to unit length. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time. Therefore, the cost of global communication can be significantly reduced. Experimental results carried out on a Parsytec GC regarding a comparison with other accelerated approaches such as convolution SOR and waveform GMRES techniques on the waveform relaxation algorithm and pointwise methods are also described.
Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of ...
详细信息
Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of parallel applications on distributed systems has been hampered by the high communication overhead. To reduce the communication overhead and the completion time of a parallel application, we propose a key message model for parallel computing on network of workstations (NOWs). In the key message model, all messages generated in a key message path are prioritized. A key message path in a task graph is defined as the path that is optimized by the key message algorithm. All messages generated in a key message path are prioritized. Besides, the key message algorithm automatically finds the key message paths. In this paper, we first describe the algorithm that identifies the key messages to be prioritized in a parallel application, then analyze the cost of the algorithm, and finally evaluate the performance of the algorithm in a simulation. Our preliminary analysis of the algorithm shows improvement over the system which does not use prioritization scheme.
Introduces algorithms which can produce both optimal and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function ...
详细信息
Introduces algorithms which can produce both optimal and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function which defines this probability under a given task assignment is derived. To find optimal and suboptimal task assignments efficiently, a reliable matching and scheduling problem is converted into a state-space search problem in which the cost function derived is used to guide the search. The A* algorithm for finding optimal task assignments and the A*/sub m/ and hill-climbing algorithms for finding suboptimal task assignments are presented. simulation results are provided to confirm the performance of the proposed algorithms.
Data distribution management (DDM) is one of the services defined by the DoD High Level Architecture. DDM is necessary to provide efficient, scalable mechanisms for distributing state updates and interaction informati...
详细信息
Data distribution management (DDM) is one of the services defined by the DoD High Level Architecture. DDM is necessary to provide efficient, scalable mechanisms for distributing state updates and interaction information in large scale distributedsimulations. We describe data distribution management mechanisms (also known as filtering) used for real time training simulations. We propose a new DDM approach to multicast group allocation, which we refer to as a dynamic grid-based allocation. Our scheme is based on a combination of a fixed grid-based method, known for its low overhead and ease of implementation, and a sender-based strategy, which uses fewer multicast groups than the fixed grid-based method. We describe our DDM algorithm, its implementation, and report on the performance results that we have obtained using the RTI-Kit framework. These results include the outcome of experiments comparing our approach to the fixed grid-based method, and they show that our scheme is scalable and significantly reduces the message overhead of previous grid-based allocation schemes.
暂无评论