Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage and exposure paths for the se...
详细信息
Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage and exposure paths for the sensor networks. This paper presents a fully localized algorithm to solve the worst coverage problem first introduced by Meguerdichian et al. The nodes of the sensor network cooperate to construct the worst coverage path only by the one-hop neighbor's information, thus avoiding the massive communication and conserving the energy. The correctness of the proposed algorithm is proved formally under the sensing diminishing model. Moreover, this algorithm can be easily extended to solve the minimal exposure problem with local information as well.
This paper proposes an interpolatory ternary subdivision for triangular meshes that produces C2 continuous limit surfaces for regular meshes while achieve C1 continuity with bounded curvature at extraordinary vertices...
详细信息
Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local info...
详细信息
Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local information in the generated texture. Thus structural error can't assure to be avoided for structural textures. To accelerate texture synthesis process and to avoid structural mismatch in the output picture, we present in this paper a structural pattern analysis (SPA) algorithm and a texture synthesis method using the algorithm. The pattern analysis tool also quantizes the texture randomness in macro scope view. It can be used in other applications such as automatic texture classification and quality evaluation of synthesized texture. We illustrate our result with some examples
Moving object segmentation in the compressed domain plays an important role in many real-time applications, e.g. video indexing, video surveillance, etc. H.264/AVC is the up-to-date video coding standard, which employ...
详细信息
ISBN:
(纸本)300018726X
Moving object segmentation in the compressed domain plays an important role in many real-time applications, e.g. video indexing, video surveillance, etc. H.264/AVC is the up-to-date video coding standard, which employs several new coding tools and provides a different video format. In this paper, a robust spatio-temporal segmentation approach to extract moving objects in the compressed domain for H.264 video stream is proposed. Coarse moving objects are firstly extracted from the motion vector field through the MRF classification process. Spatial segmentation is based on the HT coefficient, which is used to refine the object boundary of temporal segmentation results. Fusion of spatio-temporal segmentation is based on region projection based labeling technique. Further edge refinement is performed to smooth the object boundaries. The performance of the proposed approach is illustrated by simulation carried on several test sequences. Experimental results show that the proposed approach can provide the visually similar results as by using spatial domain process with much less computational complexity.
Integral-controller particle swarm optimization (ICPSO), influenced by inertia weight w and coefficient ψ is a new swarm technology by adding accelerator information. Based on stability analysis, the convergence cond...
详细信息
ISBN:
(纸本)9781424404759
Integral-controller particle swarm optimization (ICPSO), influenced by inertia weight w and coefficient ψ is a new swarm technology by adding accelerator information. Based on stability analysis, the convergence conditions imply the negative selection principles of inertia weight w, and the relationship between w and ψ. To improve the computational efficiency, an adaptive strategy for tuning the parameters of ICPSO is described using a new statistical variable reflecting computational efficiency index-average accelerator information. The optimization computing of some examples is made to show that the ICPSO has better global search capacity and rapid convergence speed.
The standard particle swarm optimization (PSO) may prematurely converge on suboptimal solution partly because of the insufficiency information utilization of the velocity. The time cost by velocity is longer than posi...
详细信息
ISBN:
(纸本)1424404754;9781424404759
The standard particle swarm optimization (PSO) may prematurely converge on suboptimal solution partly because of the insufficiency information utilization of the velocity. The time cost by velocity is longer than position of each particle of the swarm, though the velocity, limited by the constant Vmax, onfy provides the positional displacement To avoid premature convergence, a new modified PSO, predicted PSO, is proposed owning two different swarms in which the velocity without limitation, considered as a predictor, is used to explore the search space besides providing the displacement while the position considered as a corrector. The algorithm gives some balance between global and local search capability. The optimization computing of some examples is made to show the new algorithm has better global search capacity and rapid convergence rate.
This paper proposes an interpolatory ternary subdivision for triangular meshes that produces C 2 continuous limit surfaces for regular meshes while achieve C 1 continuity with bounded curvature at extraordinary vert...
详细信息
This paper proposes an interpolatory ternary subdivision for triangular meshes that produces C 2 continuous limit surfaces for regular meshes while achieve C 1 continuity with bounded curvature at extraordinary vertices. Prior to this paper, there is no practical interpolatory subdivision scheme which exhibits C 2 continuous for triangular meshes. This subdivision scheme splits each triangle into nine by inserting two E-vertices onto each edge and a F-vertex onto each face. The regular mask is derived from interpolatory ternary subdivision curves and the irregular masks are established based on Fourier transformation. Finally, we demonstrate the visual quality of surfaces refined by our new ternary subdivision scheme with several examples
Java memory model (JMM) is an important topic in Java language and Java virtual machine (JVM) design. But the memory model in Java specification can't guarantee the safely running of Java multithread code. It need...
详细信息
Java memory model (JMM) is an important topic in Java language and Java virtual machine (JVM) design. But the memory model in Java specification can't guarantee the safely running of Java multithread code. It needs memory coherence, which imposes constraints that prohibit JVM implementation optimization. To fix the problem of Java memory model in Java specification, a new Java memory model, L-JMM, is proposed, which is based on location consistency. This model extends the location consistency to adapt the features of Java technology. It also defines the rule of Java multithread memory operation, including ordinary variable rule, volatile variable rule, final variable rule and synchronization rule. It is proved that this memory model has the same property as location consistency. It can guarantee the correctness for Java multithread code. It can also improve the performance of Java virtual machine. Finally, the simulation of this memory model in the simulator MMS verifies that the new model boasts a better performance than the Java specification memory model does.
A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can gu...
详细信息
A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can guard the ballot's producing, encrypting, transmitting, decrypting and final tallying in spite of the adversaries's attack, so the scheme guarantees robustness. In this paper, the verifiability of the voters' qualification and talliers' identification will be solved by a dynamic multi-secret sharing scheme without invoking more zero knowledge proof to maintain privacy, universal verifiability, and anonymity of ballots. It holds more communication efficiency and more security than the proposed schemes in early time.
Widely adopted for their scalability and flexibility, modern microservice systems present unique failure diagnosis challenges due to their independent deployment and dynamic interactions. This complexity can lead to c...
详细信息
Widely adopted for their scalability and flexibility, modern microservice systems present unique failure diagnosis challenges due to their independent deployment and dynamic interactions. This complexity can lead to cascading failures that negatively impact operational efficiency and user experience. Recognizing the critical role of fault diagnosis in improving the stability and reliability of microservice systems, researchers have conducted extensive studies and achieved a number of significant results. This survey provides an exhaustive review of 98 scientific papers from 2003 to the present, including a thorough examination and elucidation of the fundamental concepts, system architecture, and problem statement. It also includes a qualitative analysis of the dimensions, providing an in-depth discussion of current best practices and future directions, aiming to further its development and application. In addition, this survey compiles publicly available datasets, toolkits, and evaluation metrics to facilitate the selection and validation of techniques for practitioners.
暂无评论