Search

This paper proposes a novel texture based method for visualization of electromagnetic fields. According to the characteristics of electric eddy current fields, a scalar potential is constructed to express the field on the surfaces. Then the potential is used in deducing an extension form of the Sinusoidalfunction Modulated Potential (SMP) image of general surface eddy current fields. The SMP Image can display the distribution of both the direction and amplitude of the field. The paper also presents a new algorithm based on hardware accelerated texture mapping. The algorithm could render the SMP image in real time and can be further used in dynamic visualization of time-varying electromagnetic field. The rendered dynamic images can reflect the variation of the field with space and time simultaneously. The only requirements for the method are that the vector field is distributed on surface and that its divergent is free, which makes the method suitable for visualization of general divergent-free vector field distributed on surface. [ABSTRACT FROM AUTHOR]

This paper studies how the built-in natural weakness in the image processing algorithm or system can be searched and found with the evolutionary algorithms. In this paper, we show how the genetic algorithm finds the weakness in the Bayer's dispersed dot dithering method. We also take a closer look at the method and identify why this weakness is relatively easy to find with synthetic images. Moreover, we discuss the importance of comprehensive testing before the results with some image processing methods are reliable. [ABSTRACT FROM AUTHOR]

An algorithm for alternate pattern fill on arbitrary line segments, circular arcs and elliptical arcs is proposed in this paper. The algorithm creates an external loop which is a minimal loop that contains a given point. And then, all loops that delimit the nested regions for the alternate pattern fill inside the external loop are built. The loop detection is based on a new method for searching the leftmost edges. It requires only values of positions, tangent vectors, curvature radii, and the first derivatives of curvature radii at intersection points and areas of circles and ellipses. After all necessary loops are built, the given pattern is filled in the nested loops inside the external loop. Filling the given pattern in this paper is simplified into filling line segment patterns on some parallel lines. [ABSTRACT FROM AUTHOR]

This paper presents a method to reduce features less contributing to the classification of user preferred news groups among several news groups by the use of fuzzy inference and coefficient of determination. To this end, we extract a number of representative keywords from example documents through fuzzy inference. From the observation of training patterns, we found that lots of keywords in training patterns are empty. Thus, a new method to train neural network through reduction of unnecessary dimensions by the statistical coefficient of determination is proposed in this paper. Experimental results show that the proposed method is superior to the method using lots of input attributes in terms of within-cluster variance and its standard deviation. [ABSTRACT FROM AUTHOR]

In this paper, we compare a well-known semantic spacemodel, Latent Semantic Analysis (LSA) with another model, Hyperspace Analogue to Language (HAL) which is widely used in different area, especially in automatic query refinement. We conduct this comparative analysis to prove our hypothesis that with respect to ability of extracting the lexical information from a corpus of text, LSA is quite similar to HAL. We regard HAL and LSA as black boxes. Through a Pearson's correlation analysis to the outputs of these two black boxes, we conclude that LSA highly co-relates with HAL and thus there is a justification that LSA and HAL can potentially play a similar role in the area of facilitating automatic query refinement. This paper evaluates LSA in a new application area and contributes an effective way to compare different semantic space models. Keywords: Correlation Analysis, Hyperspace Analogue to Language, Latent Semantic Indexing, Automatic Query Refinement. [ABSTRACT FROM AUTHOR]

This paper proposes an approach to data integration and migration from a collection of heterogeneous and independent data sources into a data warehouse schema. Current methodology assumes that the data is loaded into data warehouse using queries in order to extract data from multiple data sources. Extracting data from various data sources requires the establishment of generic data integration methodologies. Sometimes, various data anomalies arise when using complex queries across multiple data sources. A data warehouse can be abstractly seen as a set of materialized views. Selecting views for materialization in a data warehouse is one of the most important decisions making tasks in its design. However, there are few facilities in data integration systems that consider these important issues. In this paper, we propose the approach of introducing staging table's schema that can be utilized to load required data from source tables into corresponding staging tables. Staging tables will be assumed to be temporary tables and each staging table will be empty before loading new data and using simple non-join queries to load data. We then focus on an approach to load data into data warehouse materialized views through staging tables including maintenance of materialized views. Keywords: Data Integration, Data Migration, Staging Tables, Global Schema, and Relational Schema. [ABSTRACT FROM AUTHOR]

Computational Grids, coupling geographically distributed resources, have emerged as a next generation computing platform for solving large-scale problems in scientific arena. Monitoring these Grid computing resources, which not only helps end-users monitor the status of Grid resources, but also provides quick and comprehensive information for resource scheduling and management, becomes extremely important for efficiently using Grid Computing resource. This paper presents architecture and implementation of a Grid Monitoring System based on Globus Toolkit. The Grid Monitoring System presented in this paper is flexible, extensible and, most important, secure. The architecture and implementation presented in this paper has important practical value for the monitoring of China Education and Research Grid. [ABSTRACT FROM AUTHOR]

In this paper, we propose an approach for the real-time performance analysis of distributed programs, called Eidolon. The approach is based on the capacity of communication links. In Eidolon, some algorithms are designed to find all the transmission paths of each data file needed while the program executes, count the transmission time for each the transmission path, then get the minimum and the maximum transmission time by analyzing all the transmission paths of each data file, and at last, calculate the fastest and the slowest response time of distributed programs. A case study is given at the end of this paper to justify the validity of this approach. [ABSTRACT FROM AUTHOR]

In this paper a networked control system (NCS) design problem is discussed where a single digital controller and multiple plants interconnected by a common computer network with transfer time delays. The network-induced delays are assumed to be unknown constant in this paper, and a measuring method for delays in TCP/IP network is proposed to compensate the performance degradation due to the delay effect. An NCS is designed with LQR algorithm and applied to an inverted pendulum accounting for the multiple time delays as a benchmark plant to check its performance under time delays induced by the network. [ABSTRACT FROM AUTHOR]

We propose a novel multicast communications model using a RingNet hierarchy, called the RingNet model, which is a combination of logical trees and logical rings for multicast communications. The RingNet hierarchy consists of four tiers: Border Router Tier (BRT), Access Gateway Tier (AGT), Access Proxy Tier (APT), and Mobile Host Tier (MHT). Within the hierarchy, the upper two tiers are dynamically organized into logical rings with network entities. In this paper, based on the RingNet model, local group concept is proposed. For simple illustration, we choose each AG in AGT as the controller of each local group. Each local group has its own independent local group key. The member's join or leave in a local group only affects the local group, which makes multicast communications potentially scalable to very large groups. In this paper, we propose a novel key management scheme for secure multicast with the RingNet model. [ABSTRACT FROM AUTHOR]