ppxscal/embedding_network huggingface dataset:
A big-stepped probability approach for discovering default rules
Authors: Salem Benferhat, Didier Dubois, Sylvain Lagrue, Henri Prade
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

This paper deals with the extraction of default rules from a database of examples. The proposed approach is based on a special kind of probability distributions, called "big-stepped probabilities", which are known to provide a semantics for non-monotonic reasoning. The rules which are learnt are genuine default rules, which could be used (under some conditions) in a non-monotonic reasoning system and can be encoded in possibilistic logic.
Process control and communication
Authors: A. J. Bernstein, G. D. Detlefsen, R. H. Kerr
Venue: Proceedings of the second symposium on Operating systems principles (1969)

The paper contains a description of the structure of processes and the interprocess communication facility implemented within a general purpose operating system. Processes within the system operate asynchronously. The communication facility allows a process to signal another process, to send information to it, to cause it to be suspended or to cause it to be terminated.
Synthesis-driven Exploration of Pipelined Embedded Processors
Authors: Prabhat Mishra, Arun Kejariwal, Nikil Dutt
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Recent advances on language based software toolkit generationenables performance driven exploration of embeddedsystems by exploiting the application behavior. Thereis a need for an automatic generation of hardware to determinethe required silicon area, clock frequency, and powerconsumption of the candidate architectures. In this paper,we present a language based exploration frameworkthat automatically generates synthesizable RTL models forpipelined processors. Our framework allows varied micro-architecturalmodifications, such as, addition of pipelinestages, pipeline paths, opcodes and new functional units. Thegenerated RTL is synthesized to determine the area, power,and clock frequency of the modified architectures. Our explorationresults demonstrate the power of reuse in composingheterogeneous architectures using functional abstractionprimitives allowing for a reduction in the time for specificationand exploration by at least an order of magnitude.
Covers of Eulerian graphs
Authors: Genghua Fan
Venue: Journal of Combinatorial Theory Series B (2003)

It is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n-1/2⌋ circuits such that each edge is covered an odd number of times. This settles a conjecture made by Chung in 1980.
On Buffering Schemes for Long Multi-Layer Nets
Authors: Vani Prasad, Madhav P. Desai
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We consider the problem of minimizing the delay insignal transmission over point-to-point connections acrossmultiple metal layers in a VLSI circuit. We present an exactsolution for the two layer case. This exact solution, however,is irregular and dependent on the length of the net.We look for approximate solutions which are not only regularbut are independent of the length of the net. We showthat two of these approximate solutions yield delays thatare within a constant of the optimal solution. We have seenthat our results hold true even for the three-layer case. Weconjecture that our models can be inductively extended formulti-layer nets as well.
Feature detection from vector quantities in a numerically simulated hypersonic flow field in combination with experimental flow visualization
Authors: Hans-Georg Pagendarm, Birgit Walter
Venue: Proceedings of the conference on Visualization '94 (1994)

In computational fluid dynamics visualization is a frequently used tool for data evaluation, understanding of flow characteristics, and qualitative comparison to flow visualizations originating from experiments. Building on an existing visualization software system, that allows for a careful selection of state-of-the-art visualization techniques and some extensions, it became possible to present various features of the data in a single image. The visualizations show vortex position and rotation as well as skin-friction lines, experimental oil-flow traces, and shock-wave positions. By adding experimental flow visualization, a comparison between numerical simulation and wind-tunnel flow becomes possible up to a high level of detail. Since some of the underlying algorithms are not yet described in detail in the visualization literature, some experiences gained from the implementation are illustrated.
Viewpoint-based shape recovery from multiple views
Authors: Ali Akgunduz, Dan Zetu, Pat Banerjee
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This paper describes an algorithm for surface reconstruction from a set of scattered three-dimensional points extracted from an image sequence. In this process, additional information (such as location of the viewpoints and the points visible from a particular viewpoint) is available and can be exploited for accurately recovering the shape of the objects portrayed in the images. Initially, the set of points is subjected to a Delaunay triangulation that fills the convex hull of the set of points with disjoint tetrahedra. The key idea of the shape recovery algorithm is to eliminate triangles that obstruct the visibility of points from certain viewpoints, whose locations are known from the image acquisition process. The major contribution of this paper is that we have been able to design an algorithm for surface reconstruction that handles a wide variety of shapes, as opposed to currently existing techniques.
Virtual organization: duality of human identities in consciousness and entity
Authors: Jinyoul Lee, Bandula Jayatilaka
Venue: Managing IT in government business & communities (2003)

This chapter discloses the social aspects of a virtual organization and identifies the role of human actors in a virtual organization (consciousness). This consciousness exists in the perceptual world that we create beyond the limits of time and space. However, its counterparts exist in various forms (entities) in the real world. To bridge the gaps between the consciousnesses and the entities, there exist dual identities of human interveners in both virtual and real worlds. This research provides the meaning of virtual organization, and proceeds to explain the relationship between the consciousnesses (virtual organizations) and entities (real organizations) with human intervention (human players) using structuration theory. This study uses a theory-building process to understand human activities in virtual organizations. The theory proposed in this study reflects the epistemological positions of virtual organization research.
Studying program correctness by constructing contracts
Authors: Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D. Ganetzky, Christina M. Olson, Joshua D. Wilson
Venue: ACM SIGCSE Bulletin (2003)

Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it as unnecessary and even irrelevant. The concept of contracts, on the other hand, is generally taught as an integral part of the programming process. As such, most introductory CS students have little difficulty understanding the need to establish contracts via preconditions and postconditions. In order to improve teaching program correctness concepts, we implemented ProVIDE, an enhanced integrated development environment (IDE) for Java [7]. Pro VIDE supports a modified version of the "design by contract" methodology [13] that assists its student programmers in contract construction. Rather than asking for both a precondition and postcondition for each of his/her methods, ProVIDE asks the student to simply supply a postcondition. ProVIDE then helps the student construct the appropriate precondition by leading him/her through an axiomatic proof of the correctness of the method. Thus, the proof of correctness of the method is a side-effect of the student's need to construct an appropriate precondition.
Finding sharper distinctions for conditions of transitivity of the majority method
Authors: Sylvain Durand
Venue: Discrete Applied Mathematics (2003)

This paper compares some conditions of transitivity for the majority method. We use the concept of polydiversity: instead of counting the number of different possible preference rankings allowed in a profile, we compare the number of different profiles satisfying a condition. Thus, we can evaluate the compared restrictiveness of Black's condition and single-peakedness, and for three alternatives, we show that the two preceding conditions are three times more restrictive than Ward's condition. The polydiversity equations also show how fast the probability that a random profile satisfies these conditions approaches zero.
Local Averaging of Ensembles of LVQ-Based Nearest Neighbor Classifiers
Authors: Sergio Bermejo, Joan Cabestany
Venue: Applied Intelligence (2004)

Ensemble learning is a well-established method for improving the generalization performance of learning machines. The idea is to combine a number of learning systems that have been trained in the same task. However, since all the members of the ensemble are operating at the same time, large amounts of memory and long execution times are needed, limiting its practical application. This paper presents a new method (called local averaging) in the context of nearest neighbor (NN) classifiers that generates a classifier from the ensemble with the same complexity as the individual members. Once a collection of prototypes is generated from different learning sessions using a Kohonen's LVQ algorithm, a single set of prototypes is computed by applying a cluster algorithm (such as K-means) to this collection. Local averaging can be viewed either as a technique to reduce the variance of the prototypes or as the result of averaging a series of particular bootstrap replicates. Experimental results using several classification problems confirm the utility of the method and show that local averaging can compute a single classifier that achieves a similar (or even better) accuracy than ensembles generated with voting.
Collaborative virtual environments for supporting learning communities: an experience of use
Authors: Ekaterina Prasolova-Førland, Monica Divitini
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In this paper we present the experiences of usage of Viras, a collaborative virtual environment for social awareness support in educational settings. Collaborative Virtual environments (CVE) have lately been used for learning in different contexts, and offer promising possibilities for supporting social awareness. In our study, we look at how students evaluate CVE in educational settings and investigate the importance of different factors on social awareness.
Precision machine design assistant: A constraint-based tool for the design and evaluation of precision machine tool concepts
Authors: Bradley S. Homann, Anna C. Thornton
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Precision machines are necessary to manufacture parts and subassemblies that require tight tolerances. During the design of precision machines, like any design, it is critical that the best concept is chosen in the early stages of the design process because 80% of the final cost and quality of a product are designed in at this phase. In addition, changes and optimization late in the design process have limited impact on cost and quality. Typically, during the design of precision machines, engineers and skilled machinists develop several machine concepts and down select based on heuristics and past design experience rather than quantitative measures. This paper describes a computation tool, Precision Machine Design Assistant (PMDA), which automates basic machine error simulation and concept evaluation. The tool uses a combination of machine error motion modelling and constraint-based design methods. By combining these methods in a computational environment, multiple machine concepts may be rapidly modeled, analyzed, and compared. The goal of the program is to assist the designer in the selection of a superior concept for detail design. The PMDA methods and implementation are demonstrated in an example.
CS++: content is not enough
Authors: Roger Boyle, Martyn Clark
Venue: ACM SIGCSE Bulletin (2004)

University education in computer science requires that students learn something of the nature of the discipline. We argue that, in addition to content knowledge, two of the many things the educated computer scientist might know about are the computer science pantheon and the metaphorical structure of the discipline's technical language.
Maximum marking problems
Authors: Richard S. Bird
Venue: Journal of Functional Programming (2001)

Here are two puzzles for you to solve. First, consider the binary tree in figure 1. Take a pencil (I am assuming that this is your personal copy of JFP!) and mark some of the nodes in such a way that the sum of the values of marked nodes is as large as possible. The catch is that you cannot mark all the nodes: if you mark a node, then you are not allowed to mark its parent. Equivalently, no two marked nodes can be contiguous in the tree.The second puzzle is similar though both the datatype and constraint are different. Consider the rose tree of figure 2 (a rose tree is a tree with arbitrary branching structure). Mark some of the nodes so that all marked nodes are now contiguous in the tree. For example, if you mark the root value 4 and the leaf value 1, then you must also mark the values 5 and &minus;3 along the path from 4 to 1. Again the idea is to maximise the sum of the marked nodes. Of course, if all values were nonnegative, the best solution would be to mark all nodes. But they aren't and the maximum sum is obtained only by a judicious choice of marking. Answers to both puzzles are given at the end of the paper.The Maximum Marking Problem (MMP) is the problem of marking the entries of some given data structure in such a way that a given constraint is satisfied and the sum of the values associated with marked entries is as large as possible. By the end of this pearl, you will be convinced that there is a linear-time solution for both the puzzles described above.
Heterogeneous Redundancy for Fault and Defect Tolerance with Complexity Independent Area Overhead
Authors: Vinu Vijay Kumar, John Lach
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

The continuous increase in digital system complexity is raising the area cost of redundancy-based fault and defect tolerance. This paper introduces a technique for heterogeneous redundancy in control path and datapath circuitry that provides high reliability with area overhead that is independent of system complexity. Small amounts of circuit-specificreconfigurable logic are finely integrated with fixed-logic circuitry to provide fine-grained heterogeneous fault and defect tolerance. Results reveal that the technique is effective for avariety of circuits, providing high reliability with a constant magnitude area overhead that isindependent of system complexity.
Information Dynamics and Discourse in a Distributed Professional Community
Authors: Andrew Cox, Anne Morris
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Professional associations could use virtual communities to reinvent their relationships with theirmembers. One promising building block would be to revitalise Special Interest Groups as loose knit Internet based communities. These would be what has been called "networks of practice" or "communities of interest". Although recognised phenomena, these terms are little more than labels, however. Far more has been written about the rich, close knit relations of communities of practice. This paper argues that as a model the community of practice concept is useful in defining dimensions by which such looser knit groups can be studied. To this end, community of practice theory is reviewed. The paper then presents a case study of an informal community among web developers. It uses genre analysis to identify a dominant discourse which constitutes the list's local culture or repertoire. The genres in use are very efficient means of exchanging information, offering broad learning opportunities. They also construct a member identity. They exclude social and political issues, constructing "theproblem" of the web as technical. The "network" has a sense of community, yet it does not have the level of engagement of a community of practice because of the lack of task interdependence, the limits of the technology in use and the size of membership. This has some advantages such as giving it a longer life, requiring less commitment from members andcoordinators and making it scale to numbers in a professional association. Professional associations could build up from such networks of practice, just as corporations have sought to cultivate spontaneous informal groups, to manage knowledge.
Landmark Matching via Large Deformation Diffeomorphisms on the Sphere
Authors: Joan Glaunès, Marc Vaillant, Michael I. Miller
Venue: Journal of Mathematical Imaging and Vision (2004)

This paper presents a methodology and algorithm for generating diffeomorphisms of the sphere onto itself, given the displacements of a finite set of template landmarks. Deformation maps are constructed by integration of velocity fields that minimize a quadratic smoothness energy under the specified landmark constraints. We present additional formulations of this problem which incorporate a given error variance in the positions of the landmarks. Finally, some experimental results are presented. This work has application in brain mapping, where surface data is typically mapped to the sphere as a common coordinate system.
Model-based compression in wireless ad hoc networks
Authors: Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes determines network topology. As opposed to encoding individual node locations, at each node our approach groups the remaining nodes in the network into regions. All shortest paths to nodes in a specific region are routed via the same neighboring node. In this paper, we propose an algorithm for dividing a network field into distinct regions to minimize routing table size while guaranteeing shortest path routes. We show that this problem is NP-hard, propose a heuristic to find efficient solutions, and empirically demonstrate the resulting system performance from the perspective of compression ratio and scalability. In our experiments, routing tables compressed using this technique, require 88.9% to 97.9% less storage than uncompressed tables.In order to achieve energy efficient routing, we propose an augmentation to the original routing mechanism that enables load balancing flexibility along with guaranteed shortest path routing at the expense of larger routing tables. Preliminary experiments estimate 10% lifetime extension of network nodes with a tradeoff of an increase in the size of routing tables. Finally, we propose a compression technique that aims at representing trajectories in a sensing network in a compact manner. This approach relies on trajectory prediction using three weighted Markov models, a local, regional and global one, all of them with context-length equal to one. Finally, we discuss a range of possible applications that rely on the developed prediction and routing models.
Automating Power System Fault Diagnosis through Multi-Agent System Technology
Authors: S. D. J. McArthur, E. M. Davidson, J. A. Hossack, J. R. McDonald
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Fault diagnosis within electrical power systems is a time consuming and complex task. SCADA systems, digital fault recorders, travelling wave fault locators and other monitoring devices are drawn upon to inform the engineers of incidents, problems and faults. Extensive research by the authors has led to the conclusion that there are two issues which must beovercome. Firstly, the data capture and analysis activity is unmanageable in terms of time. Secondly, the data volume leads to engineers being overloaded with data to interpret.This paper describes how multi-agent system technology, combined with intelligent systems, can be used to automate the fault diagnosis activity. Within the multi-agent system, knowledge-based and model-based reasoning are employed to automatically interpret SCADA system data and fault records. These techniques and the design of the multi-agent systemarchitecture that integrates them are described. Consequently, the use of Engineering Assistant agents as a means of providing engineers with decision support, in terms of timely and summarised diagnostic information tailored to meet their personal requirements, is discussed.
Great principles in computing curricula
Authors: Peter J. Denning
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The nearly three dozen core technologies of computing sit in a simple framework defined by great principles and by computing practices. The great principles are of two kinds, mechanics and design. Computing mechanics comprises computation, communication, coordination, recollection, and automation. Design principles address concerns for complexity, resilience, performance, evolvability, and security. Practices comprise programming, systems, modeling, innovating, and applying. This framework opens many new possibilities for teaching computer science, including new approaches to programming. The new CS curriculum at the Naval Postgraduate School is based on the framework presented here.
Information Systems in Healthcare: Mind the Gap
Authors: C. J. Fitch
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Integration of systems is a complex task, beset by a number of difficulties. One of these may be the incorrect translation of user requirements into system requirements. This process of translation is often imperfect due to communication ambiguities; frequently, there exists a "knowledge gap" between the various professions involved.This paper discusses what can be done to aid understanding between the various groups involved in the commissioning, design and use of telemedicine systems and so bridge this knowledge gap. In addition, it considers the technical issues that need considering, regardless of the information system concerned or its application area.The paper also discusses a taxonomy of the various telemedicine systems, which is used to assess the degree to which certain issues apply to the different telemedicine implementations, since not all issues apply in equal measure to all telemedicine solutions.