To solve the problems such as unreal effects, incomplete details in the rain scene, an algorithm to simulate water surface after rain hitting by combining Meatball with mass-spring water surface was presented. First, ...
详细信息
To solve the problems such as unreal effects, incomplete details in the rain scene, an algorithm to simulate water surface after rain hitting by combining Meatball with mass-spring water surface was presented. First, the raindrops model was estabished with particle system combining textures, and the water surface model was established with the mass-spring model. Secondly, the algorithm animated half globular bubbles after rain hitting with Meatball. Thirdly, water splash was simulated by means of the particle system and a gradual thinning and syncretizing technique. Finally, with the help of Cg language, the reflection and the refraction effect on the water surface, globular bubbles and water splash were simulated. The experiment shows that this approach can be used to simulate rain scenes efficiently and realistically.
State keylaboratory for GeoMechanics and Deep Underground Engineering, Deep-Lab for short, has been committed to the study of rock burst. Deep-Lab accumulated a large number of rock-burst data. With the deepening of ...
详细信息
With the prompt evolution of Internet, network identity management is getting more and more basilica. Personal network electronic identity associated in reality has been the significant and urgent task when online lif...
详细信息
At Crypto'07, Goyal introduced the notion of accountable authority identity-based encryption (A-IBE) in order to mitigate the inherent key escrow problem in identity-based encryption, and proposed two concrete con...
详细信息
As traditional "Connectivity" concept from the Internet ignores the possibility of opportunistic contacts in DTNs, this paper brings time dimension into consideration, proposes Spatial-Temporal Path, Spatial...
详细信息
The existing methods of policy refinement in computernetwork defense (CND) can only support the refinement of access control policy, but not the policies of protection, detection, response, and recovery. To solve thi...
详细信息
A secure communication mechanism is necessary in the applications of Wireless Multimedia Sensor networks (WMSNs), which is more vulnerable to security attacks due to the presence of multimedia data. Additionally, give...
详细信息
A secure communication mechanism is necessary in the applications of Wireless Multimedia Sensor networks (WMSNs), which is more vulnerable to security attacks due to the presence of multimedia data. Additionally, given the limited technological resources (in term of energy, computation, bandwidth, and storage) of sensor nodes, security and privacy policies have to be combined with energy-aware algorithms and distributed processing of multimedia contents in WMSNs. To solve these problems in this paper, an energy efficient distributed steganography scheme, which combines steganography technique with the concept of distributed computing, is proposed for secure communication in WMSNs. The simulation results show that the proposed method can achieve considerable energy efficiency while assuring the communication security simultaneously.
Possibilistic Description Logics (DLs) extend description logics with possibilistic semantics to reason with inconsistent and uncertain knowledge. In possibilistic DLs, a crucial reasoning task is to compute the incon...
详细信息
Possibilistic Description Logics (DLs) extend description logics with possibilistic semantics to reason with inconsistent and uncertain knowledge. In possibilistic DLs, a crucial reasoning task is to compute the inconsistency degree of a possibilistic DL knowledge base. In this work, we first point out a shortcoming of a previous tableaux algorithm for possibilistic DL ALC and propose a new tableaux algorithm. We then propose a tableaux algorithm for computing the inconsistency degree of a knowledge base in possibilistic DL ALCI(R + ), which extends possibilistic DL ALC with inverse roles and transitive roles. A blocking condition is proposed to ensure the termination of the algorithm. Although the tableaux algorithm for possibilistic DL ALCI(R + ) is easy to understand and to implement, it may need exponential space in the worst case. Therefore, we give another tableaux algorithm to improve it and show that the complexity of this algorithm is PSpace-complete. This shows that the flexibility in representing uncertain information is handled without extra computational costs.
In the railway network, the fact that signal amplitude suffers loss resulted from signal traversing through the carriage which named by carriage pass loss, highly influences the reliability of the wireless communicati...
详细信息
ISBN:
(纸本)9781849197267
In the railway network, the fact that signal amplitude suffers loss resulted from signal traversing through the carriage which named by carriage pass loss, highly influences the reliability of the wireless communication system. In this paper, we propose an optimal relay selective cooperation (ORSC) scheme without the acknowledgment from the destination as if it succeeds in decoding or not. The main purpose of this paper is to evaluate the performance of ORSC transmission schemes. Specifically, the closed-form outage probabilities for ORSC transmission scheme are derived. By comparing obtained outage probability of ORSC with the non-cooperation transmission scheme, we find the ORSC transmission has better performance, better reliability and significantly eliminates the impact of the carriage passing loss.
During the past decade, stream data mining has been attracting widespread attentions of the experts and the researchers all over the world and a large number of interesting research results have been achieved. Among t...
详细信息
ISBN:
(纸本)9781849196536
During the past decade, stream data mining has been attracting widespread attentions of the experts and the researchers all over the world and a large number of interesting research results have been achieved. Among them, frequent itemset mining is one of main research branches of stream data mining with a fundamental and significant position. In order to further advance and develop the research of frequent itemset mining, this paper summarizes its main challenges and corresponding algorithm features. Based on them, current related results are divided into two categories: data-based algorithms and task-based algorithms. According to its taxonomy, the related methods belonging to the different categories and sub-categories are comprehensively introduced for better understanding. Finally, a brief conclusion is given.
暂无评论