58 resultados para enterprise grid computing
Resumo:
A quadtree-based adaptive Cartesian grid generator and flow solver were developed. The grid adaptation based on pressure or density gradient was performed and a gridless method based on the least-square fashion was used to treat the wall surface boundary condition, which is generally difficult to be handled for the common Cartesian grid. First, to validate the technique of grid adaptation, the benchmarks over a forward-facing step and double Mach reflection were computed. Second, the flows over the NACA 0012 airfoil and a two-element airfoil were calculated to validate the developed gridless method. The computational results indicate the developed method is reasonable for complex flows.
Resumo:
A numerical 2D method for simulation of two-phase flows including phase change under microgravity conditions is presented in this paper, with a level set method being coupled with the moving mesh method in the double-staggered grid systems. When the grid lines bend very much in a curvilinear grid, great errors may be generated by using the collocated grid or the staggered grid. So the double-staggered grid was adopted in this paper. The level set method is used to track the liquid-vapor interface. The numerical analysis is fulfilled by solving the Navier-Stokes equations using the SIMPLER method, and the surface tension force is modeled by a continuum surface force approximation. A comparison of the numerical results obtained with different numerical strategies shows that the double-staggered grid moving-mesh method presented in this paper is more accurate than that used previously in the collocated grid system. Based on the method presented in this paper, the condensation of a single bubble in the cold water under different level of gravity is simulated. The results show that the condensation process under the normal gravity condition is different from the condensation process under microgravity conditions. The whole condensation time is much longer under the normal gravity than under the microgravity conditions.
Resumo:
Negabinary is a component of the positional number system. A complete set of negabinary arithmetic operations are presented, including the basic addition/subtraction logic, the two-step carry-free addition/subtraction algorithm based on negabinary signed-digit (NSD) representation, parallel multiplication, and the fast conversion from NSD to the normal negabinary in the carry-look-ahead mode. All the arithmetic operations can be performed with binary logic. By programming the binary reference bits, addition and subtraction can be realized in parallel with the same binary logic functions. This offers a technique to perform space-variant arithmetic-logic functions with space-invariant instructions. Multiplication can be performed in the tree structure and it is simpler than the modified signed-digit (MSD) counterpart. The parallelism of the algorithms is very suitable for optical implementation. Correspondingly, a general-purpose optical logic system using an electron trapping device is suggested. Various complex logic functions can be performed by programming the illumination of the data arrays without additional temporal latency of the intermediate results. The system can be compact. These properties make the proposed negabinary arithmetic-logic system a strong candidate for future applications in digital optical computing with the development of smart pixel arrays. (C) 1999 Society of Photo-Optical Instrumentation Engineers. [S0091-3286(99)00803-X].
Resumo:
High dimensional biomimetic informatics (HDBI) is a novel theory of informatics developed in recent years. Its primary object of research is points in high dimensional Euclidean space, and its exploratory and resolving procedures are based on simple geometric computations. However, the mathematical descriptions and computing of geometric objects are inconvenient because of the characters of geometry. With the increase of the dimension and the multiformity of geometric objects, these descriptions are more complicated and prolix especially in high dimensional space. In this paper, we give some definitions and mathematical symbols, and discuss some symbolic computing methods in high dimensional space systematically from the viewpoint of HDBI. With these methods, some multi-variables problems in high dimensional space can be solved easily. Three detailed algorithms are presented as examples to show the efficiency of our symbolic computing methods: the algorithm for judging the center of a circle given three points on this circle, the algorithm for judging whether two points are on the same side of a hyperplane, and the algorithm for judging whether a point is in a simplex constructed by points in high dimensional space. Two experiments in blurred image restoration and uneven lighting image correction are presented for all these algorithms to show their good behaviors.
Resumo:
We investigate the development of cross-hatch grid surface morphology in growing mismatched layers and its effect on ordering growth of quantum dots (QDs). For a 60degrees dislocation (MD), the effective part in strain relaxation is the part with the Burgers vector parallel to the film/substrate interface within its b(edge) component; so the surface stress over a MD is asymmetric. When the strained layer is relatively thin, the surface morphology is cross-hatch grid with asymmetric ridges and valleys. When the strained layer is relatively thick, the ridges become nearly symmetrical, and the dislocations and the ridges inclined-aligned. In the following growth of InAs, QDs prefer to nucleate on top of the ridges. By selecting ultra-thin In0.15Ga0.85As layer (50nm) and controlling the QDs layer at just formed QDs, we obtained ordered InAs QDs. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
The two-dimensional grid patterns on Si(001) in nanometer scale have been fabricated by holographic lithography and reactive ion etching, which can be used as a substrate for positioning Ge islands during self-assembled epitaxy to obtain an ordered Ge quantum dots matrix. By changing the configuration of the holographic lithography and the etching rate and time, we can control the grid period, the shape of the pattern cell, and the orientation of those shapes, respectively. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
Quantum computing is a quickly growing research field. This article introduces the basic concepts of quantum computing, recent developments in quantum searching, and decoherence in a possible quantum dot realization.
Resumo:
The Double Synapse Weighted Neuron (DSWN) is a kind of general-purpose neuron model, which with the ability of configuring Hyper-sausage neuron (HSN). After introducing the design method of hardware DSWN synapse, this paper proposed a DSWN-based specific purpose neural computing device-CASSANN-IIspr. As its application, a rigid body recognition system was developed on CASSANN-IIspr, which achieved better performance than RIBF-SVMs system.
Resumo:
Web services can be seen as a newly emerging research area for Service-oriented Computing and their implementation in Service-oriented Architectures. Web services are self-contained, self-describing modular applications or components providing services. Web services may be dynamically aggregated, composed, and enacted as Web services Workflows. This requires frameworks and interaction protocols for their co-ordination and transaction support. In a Service-oriented Computing setting, transactions are more complex, involve multiple parties (roles), span many organizations, and may be long-running, consisting of a highly decentralized service partner and performed by autonomous entities. A Service-oriented Transaction Model has to provide comprehensive support for long-running propositions including negotiations, conversations, commitments, contracts, tracking, payments, and exception handling. Current transaction models and mechanisms including their protocols and primitives do not sufficiently cater for quality-aware and long running transactions comprising loosely-coupled (federated) service partners and resources. Web services transactions require co-ordination behavior provided by a traditional transaction mechanism to control the operations and outcome of an application. Furthermore, Web services transactions require the capability to handle the co-ordination of processing outcomes or results from multiple services in a more flexible manner. This requires more relaxed forms of transactions—those that do not strictly have to abide by the ACID properties—such as loosely-coupled collaboration and workflows. Furthermore, there is a need to group Web services into applications that require some form of correlation, but do not necessarily require transactional behavior. The purpose of this paper is to provide a state-of-the-art review and overview of some proposed standards surrounding Web services composition, co-ordination, and transaction. In particular the Business Process Execution Language for Web services (BPEL4WS), its co-ordination, and transaction frameworks (WS-Co-ordination and WS-Transaction) are discussed.