Granular computing (GrC) can be considered as a common name of theories, methodologies, techniques, and tools that make use of granules, i.e. groups, classes, or clusters of a universe, in the process of problems solv...
详细信息
ISBN:
(纸本)088986375X
Granular computing (GrC) can be considered as a common name of theories, methodologies, techniques, and tools that make use of granules, i.e. groups, classes, or clusters of a universe, in the process of problems solving. Basic ideas of crisp information granulation have appeared in related fields, such as interval analysis, rough set theory, Dempster-Shafer theory of belief functions, cluster analysis, decision-making, machine learning, databases, and many others. Granular computing is likely to play an important role in the evolution of fuzzy logic and its applications. This paper introduces a new technique for granulation, related with the digital images processing and understanding, based on main ideas of computing with Words (CW) approach. Future applications of this technique of image granulation and processing are outlined.
Breaking news often contains timely definitions and descriptions of current terms, organizations and personalities. We utilize such web sources to construct definitions for such terms. Previous work has identified def...
详细信息
ISBN:
(纸本)158113844X
Breaking news often contains timely definitions and descriptions of current terms, organizations and personalities. We utilize such web sources to construct definitions for such terms. Previous work has identified definitions using hand-crafted rules or supervised learning that constructs rigid, hard text patterns. In contrast, we demonstrate a new approach that uses flexible, soft matching patterns to characterize definition sentences. Our soft patterns are able to effectively accommodate the diversity of definition sentence structure exhibited in news. We use pseudo-relevance feedback to automatically label sentences for use in soft pattern generation. The application of our unsupervised method significantly improves baseline systems on both the standardized TREC corpus as well as crawled online news articles by 27% and 30%, respectively, in terms of F measure. When applied to a state-of-art definition generation system recently fielded in the TREC 2003 definitional question answering task, it improves the performance by 14%.
This paper deals with neural networks of 8-neighbor for image restoration which are used for gray images. Generally, since comparatively long operation time is needed when a neural network is applied to a certain prob...
详细信息
Application-specific instruction set extensions are an effective way of improving the performance of processors. Critical computation subgraphs can be accelerated by collapsing them into new instructions that are exec...
详细信息
ISBN:
(纸本)0769521266
Application-specific instruction set extensions are an effective way of improving the performance of processors. Critical computation subgraphs can be accelerated by collapsing them into new instructions that are executed on specialized function units. Collapsing the subgraphs simultaneously reduces the length of computation as well as the number of intermediate results stored in the register file. The main problem with this approach is that a new processor must be generated for each application domain. While new instructions can be designed automatically, there is a substantial amount of engineering cost incurred to verify and to implement the final custom processor. In this work, we propose a strategy to transparent customization of the core computation capabilities of the processor without changing its instruction set. A configurable array of function units is added to the baseline processor that enables the acceleration of a wide range of dataflow subgraphs. To exploit the array, the microarchitecture performs subgraph identification at run-time, replacing them with new microcode instructions to configure and utilize the array. We compare the effectiveness of replacing subgraphs in the fill unit of a trace cache versus using a translation table during decode, and evaluate the tradeoffs between static and dynamic identification of subgraphs for instruction set customization.
The three-dimensional (3D) finite-difference time-domain (FDTD) method is applied to acoustics analysis in this paper. The disadvantages of its method are large memory requirement and long calculation time. We develop...
详细信息
The three-dimensional (3D) finite-difference time-domain (FDTD) method is applied to acoustics analysis in this paper. The disadvantages of its method are large memory requirement and long calculation time. We developed the 3D-FDTD method using parallel computing with the Message-Passing Interface (MPI) in the personal computer (PC) cluster because it could shorten the calculation time and could treat larger memory. In this paper, basic algorithm of the proposed method is described. The acoustic fields of point sources and the real aerial sensor are calculated for verifying the validity of the method.
Allocating software components while meeting multiple platform resource constraints is crucial for model-based design of large embedded real-time software and automatic design model transformation. In this paper, we p...
详细信息
ISBN:
(纸本)0769521487
Allocating software components while meeting multiple platform resource constraints is crucial for model-based design of large embedded real-time software and automatic design model transformation. In this paper, we propose a new method for component allocation using an informed branch-and-bound and forward checking mechanism subject to a combination of resource constraints. We have implemented this method in the Automatic Integration of Reusable Embedded Software (AIRES) toolkit - which has been developed under the DARPA MoBIES Program - and applied it to an automotive electronic throttle control (ETC) system. Our evaluation based on randomly-generated design models has shown that the proposed method scales well for large and complex embedded real-time software.
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 fi...
详细信息
ISBN:
(纸本)0769520731
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. In this paper, 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 fulfill 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 will be used for future reference and further development.
AλgoVista is a web-based search engine that assists programmers to find algorithms and implementations that solve specific problems. The search engine is not keyword based but rather requires users to provide (input ...
详细信息
ISBN:
(纸本)1581137982
AλgoVista is a web-based search engine that assists programmers to find algorithms and implementations that solve specific problems. The search engine is not keyword based but rather requires users to provide (input ⇒ output) samples that describe the behavior of their needed algorithm. The system is easy to use. To search for a particular algorithm or classify a combinatorial structure a user simply draws the query in a drawing pane on a web browser. The result of the search is a list of links to web resources describing or providing implementations of the algorithm. AλgoVista has many interesting applications in an educational setting. The search engine can help research students classify obscure problems and locate algorithms that would otherwise be hard to find in textbooks. Students can also add calls in their own programs to AλgoVista's database of executable problem specifications in order to dynamically check the correctness of their programs. Finally, instructors can use AλgoVista to set novel assignments in algorithms and data structures classes. This paper briefly describes AλgoVista and reports on its use in two algorithms and theory classes, one at the undergraduate and one at the graduate level.
Exstatic is a generic static checker developed by the author to address many of the practical problems in program development. Static checking provides a valuable means for automating time consuming checks not only co...
详细信息
ISBN:
(纸本)1581138091
Exstatic is a generic static checker developed by the author to address many of the practical problems in program development. Static checking provides a valuable means for automating time consuming checks not only concerned with program correctness (writing the right program), but also to do with style (writing the program right). Previous static checkers have been closely coupled with compilation systems, and therefore tend to be applicable to the code itself and not to all of the textual information (such as makefiles, comments, documentation sources) surrounding the code. The generic nature of Exstatic allows it to overcome these boundaries, and indeed it can be applied to any medium for which there is a formally definable syntax and (to an extent) semantics. Exstatic can therefore be used to increase the productivity and quality of documentation of programs, checking for such things as adherence to house style, consistency with the program being documented and self consistency. This paper describes the design and use of Exstatic, with particular reference to its use in documentation systems.
We report on a new and improved version of high-order entropy-compressed su x arrays, which has theoretical performance guarantees similar to those in our earlier work, yet represents an improvement in practice. Our e...
详细信息
We report on a new and improved version of high-order entropy-compressed su x arrays, which has theoretical performance guarantees similar to those in our earlier work, yet represents an improvement in practice. Our experiments indicate that the resulting text index offers state-of-the-art compression. In particular, we require roughly 20% of the original text size - without requiring a separate instance of the text - and support fast and powerful searches. To our knowledge, this is the best known method in terms of space for fast searching.
暂无评论