A synthetic approach to effectively support 3D computer graphics (3DCG) authoring is proposed. Interactive Evolutionary Computation (IEC) has been applied for the 3D authoring domain and proven to be useful for easily...
详细信息
ISBN:
(纸本)0780385667
A synthetic approach to effectively support 3D computer graphics (3DCG) authoring is proposed. Interactive Evolutionary Computation (IEC) has been applied for the 3D authoring domain and proven to be useful for easily generating aesthetic 3DCG contents even for the novices. The previous systems, however, only focus on a specific subtask out of a whole 3DCG production process. All dominant tasks in the 3DCG production such as geometric modeling, rendering, animation, and 3D data management are covered in our approach. The proposed method reorganizes a monolithic IEC system into a combination of front-end IEC explorer and back-end graphics engines. Because it works on the Internet, some critical applications such as digital prototyping and e-learning come within the range.
With the increasing capability of MR imaging and Computational Fluid Dynamics (CFD) techniques, a significant amount of data related to the haemodynamics of the cardiovascular systems are being generated. Direct visua...
详细信息
Recursive partitioned architectures in the spatial domain and block-based discrete transform domain algorithms are developed to retrieve information from digital image data. In the former case, the data is represented...
详细信息
ISBN:
(纸本)0819454966
Recursive partitioned architectures in the spatial domain and block-based discrete transform domain algorithms are developed to retrieve information from digital image data. In the former case, the data is represented in forms which facilitate efficient optimization of the objective criterion. In the latter case, discrete, real, and circular Fourier transforms of the data blocks are filtered by coefficients chosen in the discrete frequency domain. This has led to improvements in the feature detection and localization process. In this paper, recursive and iterative approaches are applied to achieve the restoration of digital images from linearly degraded samples. In addition, block-based algorithms are employed to segment images.
Let S be a set of n points in 2. Given an integer 1 &le k &le n, we wish to find a maximally separated subset I ⊆ S of size k;this is a subset for which the minimum among the (k/2) pairwise distances between i...
详细信息
Let S be a set of n points in 2. Given an integer 1 &le k &le n, we wish to find a maximally separated subset I ⊆ S of size k;this is a subset for which the minimum among the (k/2) pairwise distances between its points is as large as possible. The decision problem associated with this problem is to determine whether there exists I ⊆ S, |I| = k, so that all (k/2) pairwise distances in I are at least 2, say. This problem can also be formulated in terms of disk-intersection graphs: Let D be the set of unit disks centered at the points of S. The disk-intersection graph G of D connects pairs of disks by an edge if they have nonempty intersection. I is then the set of centers of disks that form an independent set in the graph G. This problem is known to be NP-Complete if k is part of the input. In this paper we first present a linear-time approximation algorithm for any constant k. Next we give O(n4/3polylog(n)) exact algorithms for the cases k = 3 and k = 4. We also present a simpler nO(√k))-time algorithm (as compared with the recent algorithm in [5]) for arbitrary values of k.
Research on the plume flow has developed rapidly in recent decades, but most of researches focus on the application of subsurface flow on land. Only few reports mentioned about the pollution dispersion in the sea due ...
详细信息
Considering a nonsingular mapping S : [0, 1] --> [0, 1] and the corresponding Frobenius-Perron operator, let P : L-1 (0, 1) --> L-1 (0, 1). In this paper we present the theoretic efficiency analysis of the two p...
详细信息
ISBN:
(纸本)1932415262
Considering a nonsingular mapping S : [0, 1] --> [0, 1] and the corresponding Frobenius-Perron operator, let P : L-1 (0, 1) --> L-1 (0, 1). In this paper we present the theoretic efficiency analysis of the two parallel algorithms to implement Ulam's method for the computation of a fixed density of P. The results are applied to the first-order digital phase locked loop (DPLL). Numerical results are presented and efficiency comparison of the two parallel algorithms is included.
With the tremendous increase in connectivity and accessibility to the Internet, information security has become a serious global issue. Denial of Service (DoS), one of the attacks evolved in recent years, has devastat...
详细信息
ISBN:
(纸本)0780384032
With the tremendous increase in connectivity and accessibility to the Internet, information security has become a serious global issue. Denial of Service (DoS), one of the attacks evolved in recent years, has devastating effect to the commercial activities. We propose a hybrid intrusion detection system (HIDS) which incorporates the benefits of both rule-based and SVM techniques. In brief, the SVM is used to select important features and generate rules, while the rule-based system is then applied to detect the DoS attacks. The rule set generated by the HIDS is more accurate and compact. Experimental results show that the HIDS has a better performance than the rule-based system with rules extracted only from human experts.
The longest common subsequence problem has been applied to network instruction detection system, Bioinformatics and E-commerce, etc. This paper proposes an extended longest common subsequence problem called (K,1)-LCS ...
详细信息
ISBN:
(纸本)0780384032
The longest common subsequence problem has been applied to network instruction detection system, Bioinformatics and E-commerce, etc. This paper proposes an extended longest common subsequence problem called (K,1)-LCS problem, designs a parallel algorithm to solve (K,1)-LCS problem on SMP machine by the divide and conquer strategy and the tournament tree, and then presents a parallel algorithm for solving (K,1)-LCS problem on SMP clusters by applying the k-selection technique based on mesh-connected network. The theoretical analysis and experiments on Dawning-2000 parallel computer show that the parallel algorithm obtains a linear speedup and has a very good scalability.
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in many areas has been impeded, due to th...
详细信息
ISBN:
(纸本)1577352017
Artificial Neural Networks (ANNs) have proved both a popular and powerful technique for pattern recognition tasks in a number of problem domains. However, the adoption of ANNs in many areas has been impeded, due to their inability to explain how they came to their conclusion, or show in a readily comprehendible form the knowledge they have obtained. This paper presents an algorithm that addresses these problems. The algorithm achieves this by extracting a Decision Tree, a graphical and easily understood symbolic representation of a decision process, from a trained ANN. The algorithm does not make assumptions about the ANN's architecture or training algorithm;therefore, it can be applied to any type of ANN. The algorithm is empirically compared with Quinlan's C4.5 (a common Decision Tree induction algorithm) using standard benchmark datasets. For most of the datasets used in the evaluation, the new algorithm is shown to extract Decision Trees that have a higher predictive accuracy than those induced using C4.5 directly.
Fault tolerance is essential to the development of reliable mobile agent system in order to guarantee continuous execution of mobile agents. For this purpose, some previous works have proposed fault tolerant protocols...
详细信息
ISBN:
(纸本)0769520510
Fault tolerance is essential to the development of reliable mobile agent system in order to guarantee continuous execution of mobile agents. For this purpose, some previous works have proposed fault tolerant protocols for mobile agent execution based on stage construction. However when previous protocols are applied to a multi-region mobile agent computing environment, the overhead of stage works such as monitoring, election, voting and agreement is increased. In this paper we propose a region-based stage construction (RBSC) protocol for fault tolerant execution of mobile agents in a multi-region mobile agent computing environment. The RBSC protocol uses new concepts of quasi-participant and substage in order to put together some places located in different regions within a stage in the same region. Therefore, the RBSC protocol decreases the overhead of stage works. Consequently, the RBSC protocol decreases the total execution time of mobile agents.
暂无评论