This paper introduces an efficient and simple algorithm for constructing Multiple Reference (MR) octrees on a GPU in application to Photon Mapping and Irradiance Caching techniques. Although MR-octrees are hierarchica...
详细信息
This paper introduces an efficient and simple algorithm for constructing Multiple Reference (MR) octrees on a GPU in application to Photon Mapping and Irradiance Caching techniques. Although MR-octrees are hierarchical structures, we successfully ignore their hierarchical nature and present an approach with plain construction, compact data layout and stack-less traversal. Our algorithm uses only 2 parallel primitives (parallel append and parallel sort) and can be expressed in several lines of pseudo-code.
In this paper we present an image-based algorithm for surface reconstruction of moving garment from multiple calibrated video cameras. Using a color-coded cloth texture, we reliably match circular features between dif...
详细信息
In this paper we present an image-based algorithm for surface reconstruction of moving garment from multiple calibrated video cameras. Using a color-coded cloth texture, we reliably match circular features between different camera views. As surface model we use air a priori known triangle mesh. By identifying the mesh vertices with texture elements we obtain a consistent parameterization of the surface over time without further processing. Missing data points resulting from self-shadowing are plausibly interpolated by minimizing a thin-plate functional. The deforming geometry can be used for different graphics applications, e.g. for realistic retexturing. We show results for real garments demonstrating the accuracy of the recovered flexible shape.
Tunnels, drifts, drives, and other types of underground excavation are very common in mining as well as in the construction of roads, railways, dams, and other civil engineering projects. Planning is essential to the ...
详细信息
Tunnels, drifts, drives, and other types of underground excavation are very common in mining as well as in the construction of roads, railways, dams, and other civil engineering projects. Planning is essential to the success of tunnel excavation, and construction time is one of the most important factors to be taken into account. This paper proposes a simulation algorithm based on a stochastic numerical method, the Markov chain Monte Carlo method, that can provide the best estimate of the opening excavation times for the classic method of drilling and blasting. Taking account of technical considerations that affect the tunnel excavation cycle, the simulation is developed through a computational algorithm. Using the Markov chain Monte Carlo method, the unit operations involved in the underground excavation cycle are identified and assigned probability distributions that, with random number input, make it possible to simulate the total excavation time. The results obtained with this method are compared with a real case of tunneling excavation. By incorporating variability in the planning, it is possible to determine with greater certainty the ranges over which the execution times of the unit operations fluctuate. In addition, the financial risks associated with planning errors can be reduced and the exploitation of resources maximized.
Web Service Composition (WSC) problems can be considered as a service matching problem, which means that the output parameters of a Web service can be used as inputs of another one. However, when a very large number o...
详细信息
Web Service Composition (WSC) problems can be considered as a service matching problem, which means that the output parameters of a Web service can be used as inputs of another one. However, when a very large number of Web services are deployed in the environment, the service composition has become sophisticated and complicated process. In this study, we proposed a novel cost-effective Web service composition mechanism. It utilizes planning graph based on backward search algorithm to find multiple feasible solutions and recommends a best composition solution according to the lowest service cost. In other words, the proposed approach is a goal-driven mechanism, which can recommend the approximate solutions, but it consumes fewer amounts of Web services and less nested levels of composite service. Finally, we implement a simulation platform to validate the proposed cost-effective planning graph mechanism in large-scale Web services environment. The simulation results show that our proposed algorithm based on the backward planning graph has reduced by 94% service cost in three different environments of service composition that is compared with other existing service composition approaches which are based on a forward planning graph.
In this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Grobner bases is studied. One of the results of this study is the observation t...
详细信息
In this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Grobner bases is studied. One of the results of this study is the observation that the role of the criteria in computations in Boolean rings is much less than that in computations in an ordinary ring of polynomials over the field of integers. Another conclusion of this study is that the efficiency of the second and/or third criteria is higher than that of the two others.
Dynamic channel allocation can reduce the probability of blocking of cellular telephone networks. However, more is needed to achieve optimal performance. This paper aims at estimating the minimal blocking probability ...
详细信息
Dynamic channel allocation can reduce the probability of blocking of cellular telephone networks. However, more is needed to achieve optimal performance. This paper aims at estimating the minimal blocking probability for some simple cellular networks. Its contribution is three-fold: some dynamic channel allocation strategies are analyzed, the optimal performance (obtained by dynamic allocation and flow control) of some very simple networks is computed, simple bounds on optimal performance are presented. These results lead to a better understanding of cellular networks and can serve to evaluate new control algorithms.
With the improvement of performance in the ultra-precision manufacturing engineering, the requirements for vibration isolation have become more stringent. In order to obtain a wider effective bandwidth and a higher pe...
详细信息
With the improvement of performance in the ultra-precision manufacturing engineering, the requirements for vibration isolation have become more stringent. In order to obtain a wider effective bandwidth and a higher performance of a multi-DOFs active vibration isolation system (AVIS), active hybrid control (AHC) technology is applied in this paper. AHC technology comprises a feedback active control (FBAC) technology and a feedforward active control (FFAC) technology. Absolute velocity feedback is employed to establish a sky-hook damping technology in FBAC technology. Velocity feedforward of base platform is adopted to build a lead-lag phase compensation (LLPC) technology in FFAC technology. Further, a coordinate vector conversion from unit level to system level is mentioned to describe the dynamic characteristic of the six DOFs AVIS applied in the ultra-precision field. And with the assistance of the transformed coordinate vector, the dynamic model of system level is built. Based on the establishment of the dynamic model and the research of AHC, an experimental platformwhich constitutes three vibration isolators and a real-time active control system is set up. The experimental results indicate that the amplitude of the resonant peak is further reduced significantly, compared to the general feedback control. And simultaneously active effective bandwidth is extended. AHC technology with sky-hook damping algorithm and LLPC control algorithm is verified to be more effective.
A multi-scale framework is proposed for more realistic molecular dynamics simulations in continuum solvent models by coupling a molecular mechanics treatment of solute with a fluid mechanics treatment of solvent. This...
详细信息
A multi-scale framework is proposed for more realistic molecular dynamics simulations in continuum solvent models by coupling a molecular mechanics treatment of solute with a fluid mechanics treatment of solvent. This article reports our initial efforts to formulate the physical concepts necessary for coupling the two mechanics and develop a 3D numerical algorithm to simulate the solvent fluid via the Navier-Stokes equation. The numerical algorithm was validated with multiple test cases. The validation shows that the algorithm is effective and stable, with observed accuracy consistent with our design.
The interval temporal logic (ITL) model checking (MC) technique enhances the power of intrusion detection systems (IDSs) to detect concurrent attacks due to the strong expressive power of ITL. However, an ITL formula ...
详细信息
The interval temporal logic (ITL) model checking (MC) technique enhances the power of intrusion detection systems (IDSs) to detect concurrent attacks due to the strong expressive power of ITL. However, an ITL formula suffers from difficulty in the description of the time constraints between different actions in the same attack. To address this problem, we formalize a novel real-time interval temporal logic-real-time attack signature logic (RASL). Based on such a new logic, we put forward a RASL model checking algorithm. Furthermore, we use RASL formulas to describe attack signatures and employ discrete timed automata to create an audit log. As a result, RASL model checking algorithm can be used to automatically verify whether the automata satisfy the formulas, that is, whether the audit log coincides with the attack signatures. The simulation experiments show that the new approach effectively enhances the detection power of the MC-based intrusion detection methods for a number of telnet attacks, p-trace attacks, and the other sixteen types of attacks. And these experiments indicate that the new algorithm can find several types of real-time attacks, whereas the existing MC-based intrusion detection approaches cannot do that.
Orthogonal frequency division multiplexing (OFDM) has been widely adopted in radar and communication systems. High sensitivity to carrier frequency offset (CFO) is one of the major drawbacks of OFDM. CFO estimation fo...
详细信息
Orthogonal frequency division multiplexing (OFDM) has been widely adopted in radar and communication systems. High sensitivity to carrier frequency offset (CFO) is one of the major drawbacks of OFDM. CFO estimation for OFDM systems had been extensively studied and various algorithms had been proposed. however, the established algorithms may be compromised by the adoption of direct-conversion architecture and multi-mode low noise amplifier in the OFDM receiver, which introduces time-varying direct current offset (TV-DUO) into the system. In our previous study, we developed an eigen-decomposition based estimation algorithm, which is robust to TV-DCO but suffers from performance degradation under low to medium signal-to-noise ratio and requires high computation efforts. To address those issues, we in this paper propose a novel blind CFO estimation algorithm. By making use of the second order differential filtering and subspace method, the proposed algorithm achieves great performance improvement with reduced complexity. The performance of the proposed algorithm is demonstrated by simulations. (C) 2013 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
暂无评论