ppxscal/embedding_network huggingface dataset:
Forecasting Association Rules Using Existing Data Sets
Authors: Sam Y. Sung, Zhao Li, Chew L. Tan, Peter A. Ng
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

An important issue that needs to be addressed when using data mining tools is the validity of the rules outside of the data set from which they are generated. Rules are typically derived from the patterns in a particular data set. When a new situation occurs, the change in the set of rules obtained from the new data set could be significant. In this paper, we provide a novel model for understanding how the differences between two situations affect the changes of the rules, based on the concept of fine partitioned groups that we call caucuses. Using this model, we provide a simple technique called Combination Data Set, to get a good estimate of the set of rules for a new situation. Our approach works independently of the core mining process and it can be easily implemented with all variations of rule mining techniques. Through experiments with real-life and synthetic data sets, we show the effectiveness of our technique in finding the correct set of rules under different situations.
Anomalies as Precursors of Field Failures
Authors: Sebastian Elbaum, Satya Kanduri, Anneliese Amschler Andrews
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Reproducing and learning from failures in deployed softwareis costly and difficult. Those activities can be facilitated,however, if the circumstances leading to a failure areproperly captured. In this work, we empirically investigatehow various anomaly detection schemes can serve to identifythe conditions that precede failures in deployed software.Our results expose the tradeoffs between differentdetection algorithms applied to several types of events undervarying levels of in-house testing.
Poster abstract: density, accuracy, delay and lifetime tradeoffs in wireless sensor networks&mdash;a multidimensional design perspective
Authors: Sachin Adlakha, Saurabh Ganeriwal, Curt Schurgers, Mani B. Srivastava
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

With the growing interest in wireless sensor networks, techniques for their systematic analysis design and optimization are essential. Despite numerous research efforts in optimizing hardware, algorithms and protocols for these networks, it remains largely unexplored how these innovations can be all tied together to design a sensor network for a specific practical application. We propose a methodology that starts from four independent quality of service (QoS) parameters and allows the user to completely and unambiguously describe the desired performance, without having to deal with the details of individual devices or protocols. By making appropriate choices in terms of device capabilities and run-time techniques, a design can be positioned in this four-dimensional QoS space. Furthermore, we describe a technique to explore the associated tradeoffs at design time, using both analytical expressions and simulations. To illustrate the benefits of our approach, a design example is worked out, which shows a five fold improvement in network operational lifetime by adapting the event reporting delay.
Information fusion for multidocument summarization: paraphrasing and generation
Authors: Kathleen R. Mckeown
Venue:  (2003)

The number and variety of online news sources makes it difficult for people to track the news concerning even a single event. Redundancy causes such tracking to be extremely time-consuming: multiple news feeds on the same event tend to contain similar information. A summary of such news feeds can present important information in one short text, dramatically reducing reading time. The focus of this thesis is information fusion, a technique which, given multiple documents, identifies redundant information and synthesizes a coherent summary. This technique is embodied in MultiGen, a system that I have designed, implemented and evaluated over the course of my Ph.D. Unlike previous work in the area, MultiGen is a domain-independent system: it generates news summaries on a variety of topics in any domain. Another contribution to the state of the art is that the system generates the summary by reusing and altering phrases from the input articles, creating a more fluent and cohesive text. This is in contrast with other existing systems, which simply extract sentences from input articles and concatenate them together, leading to fluency problems. Currently MultiGen operates as part of Columbia's Newsblaster system. Everyday, Newsblaster downloads all news articles from a variety of sources, clusters articles by topic, and generates a cohesive, readable automatic summary of each document cluster. One key challenge in multidocument summarization is eliminating redundant information in the produced summaries. Articles about the same event often contain descriptions of the same fact using different wording. To address this issue, we need a method to identify paraphrases&mdash;fragments of text that convey similar meaning even if they are not identical in wording. Automatic identification of paraphrases was not addressed in previous research, although it is necessary for many applications, including question-answering, information extraction and natural language generation. This thesis presents unsupervised learning techniques to identify paraphrases given a corpus of multiple parallel texts. This type of corpus provides many instances of paraphrasing, because these texts preserve the meaning of the original source, but may use different words to convey the meaning. Both the data and the method are departures from past approaches to corpus based techniques. Our evaluation experiments show that the algorithm extracts paraphrases with high accuracy and significantly outperforms a state of the art algorithm developed for related tasks in machine translation.
Information and Meaning: Use-Based Models in Arrays of Neural Nets
Authors: Patrick Grim, Paul St. Denis, Trina Kokalis
Venue: Minds and Machines (2004)

The goal of philosophy of information is to understand what information is, how it operates, and how to put it to work. But unlike &lsquo;information&rsquo; in the technical sense of information theory, what we are interested in is meaningful information. To understand the nature and dynamics of information in this sense we have to understand meaning. What we offer here are simple computational models that show emergence of meaning and information transfer in randomized arrays of neural nets. These we take to be formal instantiations of a tradition of theories of meaning as use. What they offer, we propose, is a glimpse into the origin and dynamics of at least simple forms of meaning and information transfer as properties inherent in behavioral coordination across a community.
An Adaptive, Intelligent Control System for Slag Foaming
Authors: Eric L. Wilson, Charles L. Karr, James P. Bennett
Venue: Applied Intelligence (2004)

Slag foaming is a steel-making process that has been shown to improve the efficiency of electric arc furnace plants. Unfortunately, slag foaming is a highly dynamic process that is difficult to control. This paper describes the development of an adaptive, intelligent control system for effectively manipulating the slag foaming process. The level-2 intelligent control system developed is based on three techniques from the field of computational intelligence (CI): (1) fuzzy logic, (2) genetic algorithms, and (3) neural networks. Results indicate that the computer software architecture presented in this paper is suitable for effectively manipulating complex engineering systems characterized by relatively slow process dynamics like those of a slag foaming operation.
Stable evaluation of Jacobian matrices on highly refined finite element meshes
Authors: Arnd Meyer
Venue: Computing (2003)

In the adaptive finite element method, the solution of a p.d.e, is approximated by finer and finer meshes, which are controlled from error estimators. So, starting from a given coarse mesh, some elements are subdivided a couple of times. We investigate the question of avoiding instabilities which limit this process from the fact that nodal coordinates of one element coincide in more and more leading digits. To overcome this problem we demonstrate a simple mechanism for red subdivision of triangles (and hanging nodes) and a more sophisticated technique for general quadrilaterals.
Algorithms with polynomial interpretation termination proof
Authors: G. Bonfante, A. Cichon, J.-Y. Marion, H. Touzet
Venue: Journal of Functional Programming (2001)

We study the effect of polynomial interpretation termination proofs of deterministic (resp. non-deterministic) algorithms defined by con uent (resp. non-con uent) rewrite systems over data structures which include strings, lists and trees, and we classify them according to the interpretations of the constructors. This leads to the definition of six function classes which turn out to be exactly the deterministic (resp. non-deterministic) polynomial time, linear exponential time and linear doubly exponential time computable functions when the class is based on con uent (resp. non-con uent) rewrite systems. We also obtain a characterisation of the linear space computable functions. Finally, we demonstrate that functions with exponential interpretation termination proofs are super-elementary.
Ghost/Spook: user interface and process management in the PACE framework
Authors: Pedro Reis dos Santos, Helena Sarmento, Luís Vidigal
Venue: Proceedings of the conference on European design automation (1990)

PACE is an open system designed around a message-based communication protocol (Spook) and includes user interface (Ghost) and database management systems.Spook offers new and powerful mechanisms to implement different message-based protocol vocabularies in a vendorindependent way for interprocess communication and file storage.Ghost is a window system independent message-based server that uses Spook. It offers a full graphics editing process rather than an input-parsing utility.
Implementation of a Collaborative Web-Based Simulation Modeling Environment
Authors: Yung-Hsin Wang, Yu-Chuang Liao
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

In view of the fact that communication and interaction are major factors to the success of a simulation project, this paper presents an integrated architecture with group communication and model design which is implemented to form a collaborative Web-based DEVS (Discrete Event System Specification) simulation environment over the Internet. Our system shows a paradigm-shifting activity to differ from the so-called one-person-alone Web-based simulation. During the entire modeling process the system will utilize an XML document and present itscorresponding DEVS digraph-model applet and model code frame so that users in different places could view the same model and exchange their opinions and comments at the same time thus producing better result. This paper also demonstrates our implementation with a modeling example to illustrate how group interaction is to facilitate and improve the Web-based model design.
Efficient Implementations of Mobile Video Computations on Domain-Specific Reconfigurable Arrays
Authors: Sami Khawam, Sajid Baloch, Arjun Pai, Imran Ahmed, Nizamettin Aydin, Tughrul Arslan, Fred Westall
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Mobile video processing as defined in standards like MPEG-4 and H.263 contains a number of time-consuming computations that cannot be efficiently executed on current hardware architectures. The authors recently introduced a reconfigurable SoC platform that permits a low-power, high-throughput and flexible implementation of the motion estimation and DCT algorithms. The computations are done using domain-specific reconfigurable arrays that have demonstrated up to 75% reduction in power consumption when compared to generic FPGA architecture, which makes them suitable for portable devices. This paper presents and compares different configurations of the arrays to efficiently implementing DCT and motion estimation algorithms. A number of algorithms are mapped into the various reconfigurable fabrics demonstrating the flexibility of the new reconfigurable SoC architecture and its ability tosupport a number of implementations having different performance characteristics
Weakly consistent transactions in ROSS
Authors: Barry Brachman, Gerald Neufeld
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

This paper describes the design of the weak consistency scheme used in ROSS, the EAN object store. ROSS supports nested atomic transactions on distributed and replicated objects. The weak consistency method falls into the family of optimistic protocols. After a partitioning, execution of transactions proceeds normally. If write-write conflicts are detected when partitions later merge, transactions may be rolled back to ensure consistency. One-copy serializability is not provided. This approach is particularly well suited to a common class of database applications where there is limited interdependency between objects. A distributed name service is one such application.
Theoretical relationships between potential operands and basic measurable properties of algorithm structure
Authors: S. K. Bandyopadhyay
Venue: ACM SIGPLAN Notices (1981)

The properties relating to the area of Algorithm Dynamics or Software Physics have been found to be governed by some basic equations expressed in terms of measurable software parameters of implemented algorithm. These properties, though still in the exploratory stage of development, show an acceptable coefficient of correlation in large number of computer programs when observed values of software parameters are concerned with their respective experimental values. The study describes a new set of relationships found to be functionally dependent on input/output parameters of the algorithm structure. The relationships are investigated in various computer programmes for making comparative study of calculated and observed values of the software parameters. An objective assessment of the properties is carried out in both pure and impure varsions of a trivial algorithm.
Refusal Testing for MIOTS with Nonlockable Output Channels
Authors: Zhongjie Li, Jianping Wu, Xia Yin
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

This paper extends the refusal testing for multi input-output transition systems (MIOTS) to make it also applicable to test those implementations with nonlockable output channels. Starting with the MIOTS refusal testing theory, we distinguish two types of output channels: lockable and nonlockable, and develop a more general multi input-output refusal testing relation. A test generation algorithm is proposed to derive a complete test suite from a specification.
MAI-suppression with fractional T-equalizer for CDMA
Authors: Klaus Knoche, Jäurgen Rinas, Karl-Dirk Kammeyer
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Wideband CDMA systems with orthogonal spreading codes suffer severely due to the loss of orthogonality by multipath propagation. This yields Multiple Access Interference (MAI) which gravely reduces the performance of classical systems with Rake-receivers.In our approach we attempt to restore orthogonality again by using a fractional T-equalizer. The results are compared with a system using the tapped delay line equalizer that works in chip duration and the classical solution for wideband CDMA systems, the Rake-receiver.
Random sampling and approximation of MAX-CSPs
Authors: Noga Alon, W. Fernandez de la Vega, Ravi Kannan, Marek Karpinski
Venue: Journal of Computer and System Sciences (2003)

In a maximum-r-constraint satisfaction problem with variables {x1, x2, ... ,xn}, we are given Boolean functions f1, f2, ..., fm each involving r of the n variables and are to find the maximum number of these functions that can be made true by a truth assignment to the variables. We show that for r fixed, there is an integer q ∈ O(log(1/ε)/ε4) such that if we choose q variables (uniformly) at random, the answer to the subproblem induced on the chosen variables is, with high probability, within an additive error of εqr of qr/nr times the answer to the original n-variable problem. The previous best result for the case of r = 2 (which includes many graph problems) was that there is an algorithm which given the induced sub-problem on q = O(1/ε5) variables, can find an approximation to the answer to the whole problem within additive error εn2. For r≥3, the conference version of this paper (in: Proceedings of the 34th ACM STOC, ACM, New York, 2002, pp. 232-239) and independently Andersson and Engebretsen give the first results with sample complexity q dependent only polynomially upon 1/ε. Their algorithm has a sample complexity q of O(1/ε7). They (as also the earlier papers) however do not directly prove any relation between the answer to the sub-problem and the whole problem as we do here. Our method also differs from other results in that it is linear algebraic, rather than combinatorial in nature.
System-Level Performance Analysis in SystemC
Authors: H. Posadas, F. Herrera, P. Sánchez, E. Villar, F. Blasco
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

As both the ITRS and the Medea+ DA Roadmaps have highlighted, early performance estimation is an essential step in any SoC design methodology [1-2]. This paper presents a C++ library for timing estimation at system level. The library is based on a general and systematic methodology that takes as input the original SystemC source code without anymodification and provides the estimation parameters by simply including the library within a usual simulation. As a consequence, the same models of computation used during system design are preserved and all simulation conditions are maintained. The method exploits the advantages of dynamic analysis, that is, easy management of unpredictable data-dependentconditions and computational efficiency compared with other alternatives (ISS or RT simulation, without the need for SW generation and compilation and HW synthesis). Results obtained on several examples show the accuracy of the method. In addition to the fundamental parameters needed for system-level design exploration, the proposed methodology allows the designer to include capture points at any place in the code. The user can process the corresponding captured events for unrestricted timing constraint verification.
Temporal knowledge discovery in diabetus mellitus and collagen diseases
Authors: Shusaku Tsumoto
Venue: ACM SIGBIO Newsletter (1998)

One of the important problems of knowledge discovery in medicine is that clinical databases include the large amounts of temporal information. This project aims at extracting temporal knowledge from clinical databases on diabetus mellitus and collagen diseases by using rule induction methods and hidden Markov models. Experimental results show that knowledge which medical experts implicity use for medical expert reasoning are extracted from clinical databases. There are plans for the analysis to be extended to other analysis methods and databases.
Self-correction mechanism for path integration in a modular navigation system on the basis of an egocentric spatial map
Authors: Regina Mudra, Rodney J. Douglas
Venue: Neural Networks (2003)

Classical Computer Science approaches to navigation by autonomous robots continue to make good progress. However, we have only a limited understanding of how navigation is implemented in the neural networks of animals, which still perform very much better in navigational tasks than robots. In this paper we explore the implementation of neural network based navagation in a simple robot. We use a modular navigation system that contains separate representations of visual input and the path integration process. These representations are combined to influence the behavior of a robot. Both representations are encoded within recurrent neuronal networks. The outputs of the representations are vectors of polar values that encode the location of the nearest object, or of a specific place in the environment. The robot manoeuvres in relation to these attended locations, in the context of its egocentric spatial map. During ego-motion towards a goal, the network representation of the goal moves in a counter-movement due to applied motor feedback. The robot's position is continuously compared against its visual input, and mismatches between the visually perceived goal position and its spatial representation are corrected.
About some application of risk analysis and evaluation
Authors: Imed El Fray
Venue: Artificial intelligence and security in computing systems (2003)

Electronic data exchange in wide-world networks have become the necessity for the companie's competition on the market. This data exchange expose the safety of the computer system on different threats, including pirates and hackers activity, viruses, information revealance and modification. In the presence of those threats every company which want to exist on the market should introduce consistent security policy and risk management mechanisms within the company to guarantee information accessibility, confidentiality and integrity. The introduction of consistent and consequent policy results in requirement of essential financial expenses and adequate methods of the risk management. The most of existing risk management methods are similar and derived from the ISO/IEC 17799 standard, ITSEC criteria and the Orange Book. This paper is focused on risk evaluation based on some model enterprise (E-Bisiness system) and in accordance with known and accepted risk management methods
On Things to Happen During a TCP Handover
Authors: Wolfgang Hansmann, Matthias Frank
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper gives a survey on the impact of handover betweenheterogenous links to the performance of TCP andelaborates on the effects TCP is challenged at the momentof a handover. Moreover, we propose several approachesto improve the performance of TCP in these situations andpresent an evaluation of these approaches by means of simulation.
What *is* information security?
Authors: Gene Spafford
Venue: ACM SIGCSE Bulletin (2004)

Recent events have increasingly focused public attention on issues of information privacy, computer and network security, cybercrime and cyber terrorism. Yet despite all of this attention, there is some confusion about what is actually encompassed by those terms. There are some obvious components, such as cryptography and access control. However, the list of undisputed topics is not long or well-developed, and many questions arise as to whether a typical computer science department can offer all of the topics involved. That there are only a few universities that teach a comprehensive curriculum in these topics serves to illustrate the imprecise nature of the field. Many professionals have taken to describing it as "information security" or "information assurance" to distinguish that the focus is not on computers and networks, but on the information they hold and process.This talk will present a more comprehensive view of the area than simply within the confines of CS/CE. The speaker has been teaching information security for nearly 20 years and has developed a view that spans many traditional disciplines. The talk will present some of the reasons for that breadth of view, illustrated with examples taken from the recent CRA Grand Challenges Conference on Information Security. One conclusion from this talk is that getting good information security education widely implemented may not be simple, given current constraints and traditions within academia.