ppxscal/embedding_network huggingface dataset:
Knowledge engineering for real time intelligent control
Authors: Elena R. Messina, James S. Albus, Craig I. Schlenoff, John Evans
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

The key to real-time intelligent control lies in the knowledge models that the system contains. We argue that there needs to be a more rigorous approach to engineering the knowledge within intelligent controllers. Three main classes of knowledge are identified: parametric, geometric/iconic, and symbolic. Each of these classes provides unique perspectives and advantages for the planning of behaviors by the intelligent system. Examples of each from demonstration systems are presented.
An Alliance-Based Anti-spam Approach
Authors: Yu-Fen Chiu, Chia-Mei Chen, Bingchiang Jeng, Hsiao-Chung Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The growing problem of spam mails has generated a need for reliable anti-spam filters. Much work has been done to improve specific algorithms for the task of detecting spam, but less work hs been report on leveraging multiple algorithms in spam mails analysis. We presents an alliance-based approach to classify, discovery and exchange interesting information on spam mails. The spam filter is built based on the mixture of rough set theory , genetic algorithm and XCS classifier system. The filtering results of spam mails by alliance-based approach are evaluated with several metrics, the performance is great. Two main conclusions can be drawn from this paper: (1).The rules exchanged from other mail servers indeed help the spam filter blocking more spam mails than before. (2).A combination of several algorithms improves accuracy and reduces false positives for the problem of spam detection.
Active Selection of Training Examples for Meta-Learning
Authors: Ricardo B. C. Prudencio, Teresa B. Ludermir
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Meta-Learning has been used to relate the performance of algorithms and the features of the problems being tackled. The knowledge in Meta-Learning is acquired from a set of meta-examples which are generated from the empirical evaluation of the algorithms on problems in the past. In this work, Active Learning is used to reduce the number of meta-examples needed for Meta-Learning. The motivation is to select only the most relevant problems for metaexample generation, and consequently to reduce the number of empirical evaluations of the candidate algorithms. Experiments were performed in two different case studies, yielding promissing results.
Measuring the Psychological Complexity of Software Maintenance Tasks with the Halstead and McCabe Metrics
Authors: B. Curtis
Venue: IEEE Transactions on Software Engineering (1979)

Three software complexity measures (Halstead's E, McCabe's u(G), and the length as measured by number of statements) were compared to programmer performance on two software maintenance tasks. In an experiment on understanding, length and u(G) correlated with the percent of statements correctly recalled. In an experiment on modification, most significant correlations were obtained with metrics computed on modified rather than unmodified code. All three metrics correlated with both the accuracy of the modification and the time to completion. Relationships in both experiments occurred primarily in unstructured rather than structured code, and in code with no comments. The metrics were also most predictive of performance for less experienced programmers. Thus, these metrics appear to assess psychological complexity primarily where programming practices do not provide assistance in understanding the code.
An Approach of Structural Design for Multi-resolution Wavelet Network Based on TBIC Rule
Authors: Huizhong Yang, Hao Zhong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Based on Testing Bayesian Information Criterion (TBIC), an approach was presented to solve the indeterminacy of structure existing in multi-resolution wavelet network. A method considering both scale and precision of the networks was proposed, which can also result in an optimal network structure under the TBIC rule. Simulation results illustrate that the multi-resolution wavelet network has reasonable scale and good testing performance when the method was applied. Compared with Bayesian Information Criterion (BIC), the TBIC rule can reflect accurately the trend of precision along with the structure.
A Web-based Adaptive Learning Environment for Music Appreciation in Primary School
Authors: Kuan-Cheng Lin
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

A web-based adaptive learning environment developed to remedy music appreciation for primary school students is presented in this paper. The learning environment employs an online pretest to evaluate students'performance in basic theory. Then, the evaluated results are utilized to adaptively guide the students to fitted curriculum. Furthermore, the learning environment provides multimedia curriculum to remedy the students learning in music education.
Automatic Text Summarization Based on Lexical Chains and Structural Features
Authors: Lei Yu, Jia Ma, Fuji Ren, Shingo Kuroiwa
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The rapid growth of the Internet has resulted in enormous amounts of information that has become more difficult to access efficiently. The primary goal of this research is to create an efficient tool that is able to summarize large documents automatically. We propose concept chains to link semantically-related concepts based on Hownet knowledge database to improve the performance of Text Summarization and suit Chinese text. Lexical chains is a technique for identifying semantically-related terms in text. The resulting concept chains are then used to identify candidate sentences useful for extraction. Moreover, the other method based on structural features which can makes the summary of the text have more general content and more balance is also proposed. The final experimental results proved the effectiveness of our methods.
Web Services Semantic Searching enhanced by Case Reasoning
Authors: Ling Wang, Jinli Cao
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Web services integrate various business application systems to provide worldwide platform to serve customers directly over the Internet. As the increasing number of business applications joining into the integration, the service activities are involving more and more complex situations. The enormous workload and the complex business processes involved by a request cannot be dealt with the simple request-answer model. It is highly desirable that Web services system can support vast clients' requests efficiently, effectively and promptly. This paper provides a searching mechanism to serve clients intelligently. It utilizes an efficient matchmaker to discover clients' requests by reusing past experiences. The matchmaker is enhanced by an automated discovery algorithm. It uses not only OWL-S for identifying different matching levels by related domain ontologies but also is enhanced with reuse mechanism of case-based reasoning (CBR) with a formula for similarity. The proposed matchmaker takes advantages of semantics and CBR techniques to improve the efficiency and effectiveness of Web services searching.
Adaptive Load-Balancing for Force-Decomposition Based 3-Body Molecular Dynamics Simulations in A Heterogeneous Distributed Environment with Variable Number of Processors
Authors: J. V. Sumanth, David R. Swanson, Hong Jiang
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Molecular Dynamics (MD), a computationally intensive problem, is used by researchers in various fields. The computational parallelism inherent in this application can be exploited in parallel and distributed environments. However, in heterogeneous distributed environments such as the Grid, the available resources, namely the network and computational power, are continually changing with respect to every available node. To optimally utilize these dynamic resources, a scheduler should be able to continually adapt to the changes and suitably vary the number of interactions scheduled to each node. We propose one such scheduling algorithm in this paper. MD simulations based on the spatial-decomposition (for short-range potentials) technique assuming heterogeneous compute power and homogeneous links exist in the literature. To the best of our knowledge, this paper is the first to perform a block-level decomposition of the force-matrix for three-body potentials in a distributed environment with heterogeneous compute power with heterogeneous network links while exploiting the symmetries that exist in a three-body force matrix. Our previous work [24] targeted MD simulations using the Atom- Decomposition Method (Slice level decomposition of the force-matrix) in a heterogeneous environment. The proposed scheduling algorithm builds and continually updates a model of the distributed system, which it then uses to make decisions about how to optimally redistribute the load in the system at every time step of the MD simulation. The scheduling algorithm can additionally handle dynamic changes in the number of nodes available for computation at runtime. We implement our algorithmand evaluate its effectiveness by measuring the idle fraction which is a measure of the idle time experienced by all compute clients at every time-step. This idle fraction is a load-balance optimality measure that indicates how close the load balancing is to the theoretical optimal of 0%. We find that under most typical conditions, it is roughly 6%. We also determine potential enhancements to improve the idle fraction further.
Agent-Based Passive Autoconfiguration for Large Scale MANETs
Authors: Longjiang Li, Yunze Cai, Xiaoming Xu, Yonggang Li
Venue: Wireless Personal Communications: An International Journal (2007)

The autoconfiguration algorithm of the mobile node addresses is important in the practical usage of most mobile ad hoc networks (MANETs). The passive Duplicate Address Detection (PDAD) protocols can detect address conflicts in a passive manner and thus have very low protocol overhead. However, the blindly random assignment algorithm used in PDAD leads to a high initial conflict probability. In this paper, we propose a novel concept of address agent, based on which arises a novel autoconfiguration approach, to obtain the least address conflict probability. Most features of PDAD are inherited, e.g., address conflicts are still detected in a passive manner based on anomalies in routing protocol traffic. Analysis and simulation show that our algorithm outperforms existing methods.
Testing for Faults in Wiring Networks
Authors: W. H. Kautz
Venue: IEEE Transactions on Computers (1974)

An algorithm is derived for multiprobe testing for shorts, opens, and wiring errors in any multiterminal wiring network, such as a printed circuit board, wiring harness, multiconductor cable, or backplane wiring board. For behavioral testing the minimum number of tests required, always achievable, is equal to p - 1 + [log2q], where p is the number of terminals in the largest interconnec
A new fuzzy genetic algorithm for the dynamic bi-objective cell formation problem considering passive and active strategies
Authors: Menouar Boulif, Karim Atif
Venue: International Journal of Approximate Reasoning (2008)

This paper deals with manufacturing cell formation considering the dynamic behavior of the production system. First, we discuss the importance of taking into account the dynamic aspect of the problem that has been poorly studied in the related literature. We argue that by considering a multi-periodic planning horizon, we can tackle the problem according to two strategies: passive and active. The first strategy consists of maintaining the same composition of machines during the overall planning horizon, while the second allows performing a different composition for each period. We present a graph theory model for the problem. For the passive cell formation problem (PCFP), we prove that it amounts to a cell formation problem in a static system. In order to solve the active cell formation problem (ACFP), we propose a Shortest Path heuristic (SP) and a Genetic Algorithm (GA) based method. When the decision maker wants to choose the most adequate strategy for its environment, we state that the decision problem between active and passive strategies can be solved by solving ACFP. However, the complexity of ACFP justifies the need to control the presented solving approaches. In this situation, we propose a new fuzzy logic enhancement to the GA. The results, using this enhancement, are better than those obtained using the SP method or the GA alone.
Writing Portable Applications that Dynamically Bind at Run Time to Reconfigurable Hardware
Authors: Nicholas Moore, Albert Conti, Miriam Leeser, Laurie Smith King
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Powerful multicomputer platforms that combine FP- GAs and programmable processors promise tremen- dous performance benefits for applications that take advantage of these rapidly emerging architectures. Portable applications are desirable because they can be easily adapted to take advantage of different re- configurable computing platforms. Traditional prac- tices, however, intertwine application code with hard- ware specific code such that porting entails a signifi- cant rewrite of the application and reuse is difficult. Vforce, based on the VSIPL++ standard, is an exten- sible framework we created that allows the same appli- cation code to run on different reconfigurable comput- ing platforms. Vforce offers application-level porta- bility, framework-level extensibility to new hardware, and system-level run time resource management. In particular, Vforce supports very late binding of the application to a specific hardware platform such that binding does not occur until run time. This paper de- scribes Vforce with a focus on late run time binding to a specific hardware platform. Results using Vforce to implement an FFT and a time domain adaptive beam- former are presented.
MOS Scaling
Authors: J. Hayes
Venue: Computer (1980)

Basic MOS feature dimensions may fall to the 0.5µm level by the mid-1980's. Such scaling will create new challenges related to registration accuracy, dimensional control, and defect density. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Mechanism for Improving Web Server Performance Using Fuzzy Concept
Authors: Bumjoo Park, Kiejin Park, Dongmin Shin, Sungsoo Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper presents a mechanism to improve Web server performance with fuzzy-based techniques. A load balancing mechanism based on the fuzzy control technique is developed in such a way that ambiguous situations caused by workload estimation of cluster- based Web servers, client request rates, and dynamic request rates can be represented in an effective way. Extensive experiments show that the fuzzy-based performance isolation technique improves the performance of Web servers in terms of the 95- percentile response times. Keywords: Differentiated services, Fuzzy control technique, Performance isolation.
On allocation of resources during testing phase of a modular software
Authors: P. K. Kapur, A. K. Bardhan, V. S. S. Yadavalli
Venue: International Journal of Systems Science (2007)

To provide reliable software, it is tested over a wide range of testing environment. In the process, testing resources such as time, testing personnel etc. are used. These resources are not infinitely large and therefore need to be used judiciously. In this article, we discuss the testing resource allocation problem among modules to maximize the total fault removal from software consisting of several independent components (modules). For the resulting optimization problem, we define marginal testing effort function (MTEF), where the testing resource consumption is represented in terms of fault removal. The three MTEFs proposed in this article account for both exponential and S-shaped growth curves, which are commonly used in software reliability analysis. Results are illustrated numerically using different data sets.
Automatic inference of cross-modal nonverbal interactions in multiparty conversations: "who responds to whom, when, and how?" from gaze, head gestures, and utterances
Authors: Kazuhiro Otsuka, Hiroshi Sawada, Junji Yamato
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

A novel probabilistic framework is proposed for analyzing cross-modal nonverbal interactions in multiparty face-to-face conversations. The goal is to determine "who responds to whom, when, and how" from multimodal cues including gaze, head gestures, and utterances. We formulate this problem as the probabilistic inference of the causal relationship among participants' behaviors involving head gestures and utterances. To solve this problem, this paper proposes a hierarchical probabilistic model; the structures of interactions are probabilistically determined from high-level conversation regimes (such as monologue or dialogue) and gaze directions. Based on the model, the interaction structures, gaze, and conversation regimes, are simultaneously inferred from observed head motion and utterances, using a Markov chain Monte Carlo method. The head gestures, including nodding, shaking and tilt, are recognized with a novel Wavelet-based technique from magnetic sensor signals. The utterances are detected using data captured by lapel microphones. Experiments on four-person conversations confirm the effectiveness of the framework in discovering interactions such as question-and-answer and addressing behavior followed by back-channel responses.
A fast unified optimal route query evaluation algorithm
Authors: Edward P. F. Chan, Jie Zhang
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectively, a large network is partitioned into a collection of fragments, and distances of some optimal routes in the network are pre-computed. Under such a setting, we find a unified algorithm that can evaluate classes of optimal route queries. The classes that can be processed efficiently are called constraint preserving (CP) which include, among others, shortest path, forbidden edges, forbidden nodes and α-autonomy optimal route query classes. We prove the correctness of the unified algorithm. We then turn our attention to the optimization of the proposed algorithm. Several pruning and optimization techniques are derived that minimize the search time and I/O accesses. We show empirically that these techniques are effective. The proposed optimal route query evaluation algorithm, with all these techniques incorporated, is compared with a main-memory and a disk-based brute-force CP algorithms. We show experimentally that the proposed unified algorithm outperforms the brute-force algorithms, both in term of CPU time and I/O cost, by a wide margin.
Segmentation of Text and Graphics from Document Images
Authors: S. Chowdhury, S. Mandal, A. Das, B. Chanda
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Text, graphics and half-tones are the major constituents of any document page. While half-tone can be characterised by its inherent intensity variation, text and graphics share common characteristics except difference in spatial distri- bution. The success of document image analysis systems depends on the proper segmentation of text and graphics as text is further subdivided into other classes such as heading, table and math-zones. Segmentation of graphics is essential for better OCR performance and vectorization in computer vision applications. Graphics segmentation from text is par- ticularly difficult in the context of graphics made of small components (dashed or dotted lines etc.) which have many features similar to texts. Here we propose a robust tech- nique for segmenting all sorts of graphics and texts in any orientation from document pages.
Conditional Capabilities
Authors: K. Ekanadham
Venue: IEEE Transactions on Software Engineering (1979)

Protection in capability-based operating systems is comsidered. The concept of a conditional capability, which is a generalization of a conventional capability, is proposed. The conditional capability can only be exercised when certain conditions relating to the context of its use are satisfied. It is shown that such capabilities form a basis upon which features such as domains of protection, revocation, and type extension can be built. The implementation of these features can be isolated into sepuate modules thus leaving the basic protection module uncluttered and simplifying the overall structure of the system.
A knowledge-based search engine powered by wikipedia
Authors: David N. Milne, Ian H. Witten, David M. Nichols
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper describes Koru, a new search interface that offers effective domain-independent knowledge-based information retrieval. Koru exhibits an understanding of the topics of both queries and documents. This allows it to (a) expand queries automatically and (b) help guide the user as they evolve their queries interactively. Its understanding is mined from the vast investment of manual effort and judgment that is Wikipedia. We show how this open, constantly evolving encyclopedia can yield inexpensive knowledge structures that are specifically tailored to expose the topics, terminology and semantics of individual document collections. We conducted a detailed user study with 12 participants and 10 topics from the 2005 TREC HARD track, and found that Koru and its underlying knowledge base offers significant advantages over traditional keyword search. It was capable of lending assistance to almost every query issued to it; making their entry more efficient, improving the relevance of the documents they return, and narrowing the gap between expert and novice seekers.
Cooperative scans: dynamic bandwidth sharing in a DBMS
Authors: Marcin Zukowski, Sándor Héman, Niels Nes, Peter Boncz
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling policies do not fully exploit data-sharing opportunities and therefore result in poor disk bandwidth utilization. We propose the Cooperative Scans framework that enhances performance in such scenarios by improving data-sharing between concurrent scans. It performs dynamic scheduling of queries and their data requests, taking into account the current system situation. We first present results on top of an NSM/PAX storage layout, showing that it achieves significant performance improvements over traditional policies in terms of both the number of I/Os and overall execution time, as well as latency of individual queries. We provide benchmarks with varying system parameters, data sizes and query loads to confirm the improvement occurs in a wide range of scenarios. Then we extend our proposal to a more complicated DSM scenario, discussing numerous problems related to the two-dimensional nature of disk scheduling in column stores.