15819383
Watermark design pattern for intellectual property protection in electronic commerce applications
We propose watermark design patterns to model the characteristics of digital watermarks in electronic commerce applications. A watermark design pattern preserves the properties of a digital watermark in a binary tree representation. Applying the survey results and characteristics of existing watermarking techniques, watermark design patterns for four media (data-video, image, audio, and text), are derived and expressed as WDP/sub video/, WDP/sub image/, WDP/sub audio/ and WDP/sub text/ respectively. Our results show that watermarks for video and audio data have to be invisible and robust, and watermarks for text data has to be invisible and fragile, while watermark for image has to be either visible and fragile, or invisible and robust for electronic commerce applications. The watermark design pattern is further used to relate electronic commerce applications and digital watermarking techniques. This facilitates electronic commerce application developers to select adequate digital watermarking techniques and off-the-shelf systems for their development.
46320705
Intelligent Internet searching engine based on hybrid simulated annealing
The World Wide Web (WWW) based Internet services have become a major channel for information delivery. For the same reason, information overload also has become a serious problem to the users of such services. It has been estimated that the amount of information stored on the Internet doubled every 18 months. The speed of increase of home pages can be even faster, some people estimated that it doubled every six months. Therefore, a scalable approach to support Internet searching is critical to the success of Internet services and other current or future National Information Infrastructure (NII) applications. We discuss using a modified version of simulated annealing algorithm to develop an intelligent personal spider (agent), which is based on automatic textual analysis of the Internet documents and hybrid simulated annealing.
10473585
Metadata design for Chinese medicine digital library using XML
The development of Chinese medicine has been growing rapidly and is beginning to draw significant attention globally. In Hong Kong in particular, the government has targeted Chinese medicine as one of its major future developments. A system for registering Chinese medical practitioners is being set up and a Chinese medicine port for medical manufacturing and research is being investigated. Although it has drawn significant attention, information about Chinese medicine is not yet widely available on the Internet, and searching for such information is extremely difficult. In this paper, we present an XML metadata design for Chinese medicine. The system encompasses a register server, information servers, a search engine and client programs that have been developed to browse and search the XML documents that are available in distributed Chinese medicine digital libraries.
818365
Effects of luminance quantization error on color image processing
A common approach to color image processing is to apply monochrome techniques to the quantized intensity component. However, the quantization error in the intermediate intensity image propagates to the final processed image. This can lead to significant distortion, depending on the input RGB values and on the particular image processing function being applied. A theoretical analysis of the worst-case quantization error is presented. Experimental results with histogram equalization demonstrate how the histogram resolution affects the performance.
45865876
Graph theoretic characterization and reliability of the generalized Boolean n-cube network
In this paper, a general class of Boolean n-cube structures is investigated. The interconnection is based on a mixed radix number system which results in a variety of generalized Boolean n-cube structures for a given number of processors N = x·2y, where x and y are positive integers. A number of interesting properties of the network are revealed. By a constructive method, the node connectivity of this network is found. Finally, we show that the graph is super-λ and is an optimal reliable structure for interconnection networks.
23496769
Image Enhancement for Segmentation by Self-Induced Autoregressive Filtering
A filter induced by the autoregressive pattern from an image is used to enhance the image itself. The enhanced image usually reveals the wave pattern and nonstationary structures more clearly than the original. Unlike the Fourier analysis, local structures in the image are still retained. The merits have been demonstrated on simulated data and synthetic-aperture radar (SAR) ocean imagery. >
16872458
Decision tree construction for data mining on grid computing environments
In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.
36980746
Decision tree construction for data mining on grid computing
Decision tree is one of the frequently used methods in data mining for searching prediction information. Due to its characteristics which are suitable for parallelism, it has been widely adopted in high performance field and developed into various parallel decision tree algorithms to deal with huge data and complex computation. Following the development of other technology fields, grid computing is regarded as the extension of PC cluster and therefore it future research development is highly valued. This new wave of Internet application is the 3rd generation of Internet applications following the traditional Internet and Web application. We have presented a grid-based decision tree architecture, and hope it can be applied on both parallel and sequential algorithms for the decision tree applications. Also, based on the scope and model of data mining applied in grid environment as well as user equivalent perspective, grid roles can be categorized into three types. We are hoping that through these definitions, software developers can define clear system processes and differentiate the application scope for software applications. To fulfil our architecture, we first apply an existing parallel decision tree algorithm-SPRINT algorithm in the grid environment. The performance and differences in many other areas are compared using different sizes of dataset. The experimental results are used for future reference and further development.
9114568
A high-performance computational resource broker for grid computing environments
Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. As grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, as well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user's needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user's credentials. The resource broker runs on top of the Globus toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the grid.