ppxscal/embedding_network huggingface dataset:
Q-Concept-Learning: Generalization with Concept Lattice Representation in Reinforcement Learning
Authors: Marc Ricordeau
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

One of the very interesting properties of Reinforcement Learning algorithms is that they allow learning without prior knowledge of the environment. However, when the agents use algorithms that enable a generalization of the learning, they are unable to explain their choices. Neural networks are good examples of this problem. After a reminder about the basis of Reinforcement Learning, the Lattice Concept will be introduced. Then, Q-Concept-Learning, a Reinforcement Learning algorithm that enables a generalization of the learning, the use of structured languages as well as an explanation of the agent's choices will be presented.
Beyond files: programming with multiple source views
Authors: Philip J. Quitslund
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Modern IDEs like Eclipse promote a file-centric view of programs that makes juxtaposing disjoint pieces of code cumbersome. Yet juxtaposition is crucial to common tasks like refactoring. In this paper we introduce MView, a plugin for Eclipse that broadens the notion of an editable document to embrace collections of code fragments enabling easy juxtapositions.
Intrinsic complexity of learning geometrical concepts from positive data
Authors: Sanjay Jain, Efim Kinber
Venue: Journal of Computer and System Sciences (2003)

Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy learning such geometrical concepts can be viewed as a sequence of primitive basic strategies. Thus, the length of such a sequence together with the complexities of the primitive strategies used can be regarded as the complexity of learning the concepts in question. We obtained the best possible lower and upper bounds on learning open semi-hulls, as well as matching upper and lower bounds on the complexity of learning intersections of such areas. Surprisingly, upper bounds in both cases turn out to be much lower than those provided by natural learning strategies. Another surprising result is that learning intersections of open semi-hulls turns out to be easier than learning open semi-hulls themselves.
Evaluating UML using a generic quality framework
Authors: John Krogstie
Venue: UML and the unified process (2003)

Many researchers have evaluated different parts of UMLTM and have come up with suggestions for improvements to different parts of the language. This chapter looks at UML (version 1.4) as a whole, and contains an overview evaluation of UML and how it is described in the OMGTM standard. The evaluation is done using a general framework for understanding quality of models and modeling languages in the information systems field. The evaluation is based on both practical experiences and more theoretical evaluations of UML. Based on the evaluation, we conclude that although being an improvement over it is predecessors, UML still has many limitations and deficiencies, both related to the expressiveness and comprehensibility of the language. Although work is well underway for the next version of UML (version 2.0), not all of the important problems seem to be addressed in the upcoming new version of the language.
Integrated coverage and connectivity configuration in wireless sensor networks
Authors: Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs from existing connectivity or coverage maintenance protocols in several key ways: 1) We present a Coverage Configuration Protocol (CCP) that can provide different degrees of coverage requested by applications. This flexibility allows the network to self-configure for a wide range of applications and (possibly dynamic) environments. 2) We provide a geometric analysis of the relationship between coverage and connectivity. This analysis yields key insights for treating coverage and connectivity in a unified framework: this is in sharp contrast to several existing approaches that address the two problems in isolation. 3) Finally, we integrate CCP with SPAN to provide both coverage and connectivity guarantees. We demonstrate the capability of our protocols to provide guaranteed coverage and connectivity configurations, through both geometric analysis and extensive simulations.
A modal logic for mobile agents
Authors: Rocco De Nicola, Michele Loreti
Venue: ACM Transactions on Computational Logic (TOCL) (2004)

Klaim is an experimental programming language that supports a programming paradigm where both processes and data can be moved across different computing environments. The language relies on the use of explicit localities. This paper presents a temporal logic for specifying properties of Klaim programs. The logic is inspired by Hennessy-Milner Logic (HML) and the &mu;-calculus, but has novel features that permit dealing with state properties and impact of actions and movements over the different sites. The logic is equipped with a complete proof system that enables one to prove properties of mobile systems.
Time to work together: temporality, collaboration, and information seeking
Authors: Madhusudhana Chenna Reddy
Venue:  (2003)

Traditional models of information seeking focus on the individual information seeker; they de-emphasize understandings of collaboration and the broader context of work into which information-seeking activities are incorporated. Thus, although information seeking is viewed as an important aspect of collaborative work activities, we have very little empirical knowledge of how individuals actually collaborate to find needed information. I have been investigating collaborative information seeking in the context of hospital care; a hospital is an almost paradigmatic example of an information-rich environment and a natural site for investigation. Using qualitative research techniques, I have conducted a field study of the work practices of nurses, pharmacists, and physicians in a surgical intensive care unit. Through this study, an alternative characterization of collaborative information seeking has emerged; one that shifts the focus away from viewing information seeking in terms of purely &ldquo;questions and answers&rdquo;. In the information-rich environment of the surgical intensive care unit, the challenge is not only to find missing information, but also to ensure that information is available when it is needed&mdash;an activity that is carried out with an orientation towards the temporal organization of work. When we examine &ldquo;information work&rdquo; from this perspective, understanding the temporal features of the work and how people orient to and use these features in the course of their daily work is essential. In this dissertation, I introduce and describe three analytical concepts&mdash;temporal trajectories, temporal rhythms, and temporal horizons&mdash;that provide insight into people's work and information seeking behavior; this temporal orientation emphasizes that most acts of information seeking are components of temporal sequences. Therefore, collaborative information seeking is part of a process of ensuring the smooth flow of information and preventing information breakdown; information needs can be answered without questions being asked because a smooth, regular, and repeated flow ensures that needed information is available in the environment. This research lays the conceptual groundwork for a better understanding of the role that temporality plays in how people produce, seek, and manage information in their daily work. It also points to ways that temporality can be incorporated into the design of collaborative technologies.
Intelligent Agent Based Framework for Warehouse Control
Authors: Byung-In Kim, Sunderesh S. Heragu, Robert J. Graves, Art St. Onge
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

In this paper, we present an intelligent agent based framework for scheduling and control of an automated warehouse. Order trays and gantry robots (picking devices) are modeled as intelligent agents that behave in a cooperative manner so as to achieve personal and system wide goals. The model has been applied to a real world warehouse using actual data. The system is capable of significantly shortening picking cycle time without compromising on system efficiency. It also produces significantly fewer picking errors compared to a hierarchical model used by the company.
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
Authors: Dakai Zhu, Daniel Mossé, Rami Melhem
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

The Pfair algorithms are optimal for independent periodicreal-time tasks executing on a multiple-resource system,however, they incur a high scheduling overhead bymaking scheduling decisions in every time unit to enforceproportional progress for each task. In this paper, we willpropose a novel scheduling algorithm, boundary fair (),which makes scheduling decisions and enforces fairness totasks only at period boundaries. The BF algorithm is alsooptimal in the sense that it achieves 100% system utilization.Moreover, by making scheduling decisions at periodboundaries, BF effectively reduces the number of schedulingpoints. Theoretically, the BF algorithm has the samecomplexity as that of the Pfair algorithms. But, in practice,it could reduce the number of scheduling points dramatically(e.g., upto 75% in our experiments) and thus reducethe overall scheduling overhead, which is especially importantfor on-line scheduling.
From Polyvariant flow information to intersection and union types
Authors: Jens Palsberg, Christina Pavlopoulou
Venue: Journal of Functional Programming (2001)

Many polyvariant program analyses have been studied in the 1990s, including k-CFA, polymorphic splitting, and the cartesian product algorithm. The idea of polyvariance is to analyze functions more than once and thereby obtain better precision for each call site. In this paper we present an equivalence theorem which relates a co-inductively-defined family of polyvariant flow analyses and a standard type system. The proof embodies a way of understanding polyvariant flow information in terms of union and intersection types, and, conversely, a way of understanding union and intersection types in terms of polyvariant flow information. We use the theorem as basis for a new flow-type system in the spirit of the &lambda;CIL-calculus of Wells, Dimock, Muller and Turbak, in which types are annotated with flow information. A flow-type system is useful as an interface between a flow-analysis algorithm and a program optimizer. Derived systematically via our equivalence theorem, our flow-type system should be a good interface to the family of polyvariant analyses that we study.
Comparison of Effectiveness of Current Ratio and Delta-IDDQ Tests
Authors: Sagar S. Sabade, D. M. H. Walker
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

IDDQ test is a valuable test method for semiconductormanufacturers. However, its effectiveness is reducedfor deep sub-micron technology chips due to risingbackground leakage. Current two test methods thatpromise to extend the life of IDDQ test are Current Ratioand Delta-IDDQ. Although several studies have beenreported on these methods, their effectiveness indetecting defects has not been contrasted. In this work,we compare these two methods using industrial testdata.
Simplicity = efficiency = readability a simple infix to prefix algorithm
Authors: Cohen Shimon
Venue: ACM SIGPLAN Notices (1981)

The following is not the expected breakthrough in the methodology of computer programming. It is just a small contribution to this troubled topic. It proposes an improved (simple) version for infix expression evaluation. The main idea behind this algorithm is it's simplicity which surprisingly leads to a (very) flexible, efficient, readable, small (I dare say pure) program.The simple purpose of this small paper is to promote the ideal of small and simple programs. 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
Nestmod: the NetMod - NEST interface
Authors: Utpal Amin, David W. Bachmann, Kerman Deboo, Toby J. Teorey
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

NESTMOD is a combined analytical modeling and simulation tool, based on the existing tools NetMod and NEST. It provides both transient and steady-state response statistics from models of interconnected local area networks that can execute at any level of detail desired. This gives users the potential to model both networks of extremely large scope (hundreds of thousands of nodes), and to look at great detail for any combination of the ISO layers. This paper describes the interface implementation, and presents an example to illustrate the potential power of the tool.
Enabling principles of concurrency and simultaneity in concurrent engineering
Authors: Biren Prasad
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

The paper describes a set of seven fundamental principles for achieving &ldquo;best concurrency and simultaneity.&rdquo; The concurrent approach is gaining worldwide attention at this moment. The paralleling of life-cycle activities and process restructuring are being deemed necessary by more and more industries. An automobile product development process example is used in this paper to illustrate many aspects of these seven principles. The principles help the concurrent teams, first, to define how to decompose the product, process and work activities and then, how to arrange these decomposed activities so that &ldquo;best concurrency and simultaneity&rdquo; can be achieved.
An Entropy Masking Model for Multimedia Content Watermarking
Authors: Seong-Whan Kim, Shan Suthaharan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Inserting maximal allowable transparent watermark, which in turn is extremely hard to attack with common image processing operations, is important aspect of watermark design. We present a new watermark design tool for digital images and digital videos that are based on human visual system (HVS) characteristics. In this tool, basic mechanisms of inhibitory andexcitatory behaviour of HVS cells are used to determine image dependent upper bound values on watermark insertion. This allows us to insert maximal allowable transparent watermark, which in turn is extremely hard to attack with common image processing, Motion Picture Experts Group (MPEG) compression. As the number of image details (e.g. edges) increases in an image, the HVS decreases its sensitivity to the image details. Similarly, the HVS decreases its sensitivity to the object motions as the number of motion increases in a video signal. We model this decreased sensitivity to the image details and object motions as an entropy masking. Entropy masking model can be efficiently used to increase the robustness of image and video watermarks. We have shown that our entropy-masking model provides watermark scheme with increased transparency and henceforth increased robustness.
Data quality through knowledge engineering
Authors: Tamraparni Dasu, Gregg T. Vesonder, Jon R. Wright
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Traditionally, data quality programs have acted as a preprocessing stage to make data suitable for a data mining or analysis operation. Recently, data quality concepts have been applied to databases that support business operations such as provisioning and billing. Incorporating business rules that drive operations and their associated data processes is critically important to the success of such projects. However, there are many practical complications. For example, documentation on business rules is often meager. Rules change frequently. Domain knowledge is often fragmented across experts, and those experts do not always agree. Typically, rules have to be gathered from subject matter experts iteratively, and are discovered out of logical or procedural sequence, like a jigsaw puzzle. Our approach is to impement business rules as constraints on data in a classical expert system formalism sometimes called production rules. Our system works by allowing good data to pass through a system of constraints unchecked. Bad data violate constraints and are flagged, and then fed back after correction. Constraints are added incrementally as better understanding of the business rules is gained. We include a real-life case study.
A Probabilistic Extension to Ontology Language OWL
Authors: Zhongli Ding, Yun Peng
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

To support uncertain ontology representation and ontology reasoning and mapping, we propose to incorporate Bayesian networks (BN), a widely used graphic model for knowledge representation under uncertainty and OWL, the de facto industry standard ontology language recommended by W3C. First, OWL is augmented to allow additional probabilistic markups, so probabilities can be attached with individual concepts and properties in an OWL ontology. Secondly, a set of translation rules is de.ned to convert this probabilistically annotated OWLontology into the directed acyclic graph (DAG) of a BN. Finally, the BN is completed by constructing conditional probability tables (CPT) for each node in the DAG. Our probabilistic extension to OWL is consistent with OWL semantics, and the translated BN is associated with a joint probability distribution over the application domain. General Bayesian network inference procedures (e.g., belief propagation or junction tree) can be used to compute P(C\e): the degree of the overlap or inclusion between a concept C and a concept represented by a description e. We also provide a similarity measure that can be used to find the most similar concept that a given description belongs to.
Do gaming and locus of control influence learning performance, effort, and attitudes of students in a computer-based lesson?
Authors: Paul Michael Lanouette
Venue:  (2003)

This study examined the influences of using the instructional strategy of gaming and locus of control on the learner performance, learner effort, and attitude toward learning with a computer-based lesson. It was hypothesized that college-level participants (n = 123) that use the instructional strategy of gaming would have better performance scores, put forth more effort and have a more positive attitude toward learning than learners in the non-gaming treatment. It was also hypothesized that participants with high internal locus of control would have better learning performance, put forth more effort and have a more positive attitude toward learning than those with high external locus of control. Finally, it was hypothesized that there would be an interaction between the instructional strategy of gaming and locus of control with respect to learner performance. Results of the study found that learners using the instructional strategy of gaming did have higher performance scores and put forth more effort than learners who were in the non gaming treatment group. Results also found that learners with internal locus of control had a more positive attitude toward learning than learners with external locus of control. Finally, the results found that learners with external locus of control put forth more effort than learners with internal locus of control. This result was contrary to the initial hypothesis that was based on a review of the literature. Because of this result, further research is necessary.
Component-based DSL development
Authors: Thomas Cleenewerck
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Domain specific languages (DSLs) have proven to be a very adequate mechanism to encapsulate and hide the complex implementation details of component-based software development. Since evolution lies at the heart of any software system the DSLs that were built around them must evolve as well. In this paper we identify important issues that cause a DSL implementation to be very rigid in which all phases are tightly coupled and highly dependent upon one another. To increase the poor evolvability of current day DSL development environments a new development environment Keyword based programming (KBP) is proposed where DSLs are built by using a language specification to compose and glue loosely coupled and independent language components (called keywords).
Wet etching studies of silicon nitride thin films deposited by electron cyclotron resonance (ECR) plasma enhanced chemical vapor deposition
Authors: K. B. Sundaram, R. E. Sah, H. Baumann, K. Balachandran, R. M. Todi
Venue: Microelectronic Engineering (2003)

Silicon nitride films of various compositions have been deposited on silicon substrate by electron cyclotron resonance plasma-enhanced chemical vapor deposition (ECR-PECVD) technique from mixtures of Ar, N2 and SiH4 as precursors. Film composition and refractive index as a function of deposition parameters like gas flow ratio and pressure were studied. Wet etching studies were conducted using diluted phosphoric acid and buffered oxide etch (BOE) solutions of various concentrations. The etching studies using phosphoric acid were conducted in the temperature range of 70-90 °C. For BOE the temperature range was 25-55 °C. The etch rate with BOE solution is much higher than with phosphoric acid. The results indicate that the mechanism of etching with phosphoric acid is different from that with BOE solution.