ppxscal/embedding_network huggingface dataset:
Independence and upper irredundance in claw-free graphs
Authors: Odile Favaron
Venue: Discrete Applied Mathematics (2003)

It is known that the independence number of a connected claw-free graph G of order n is at most (n + 1)/2. We improve this result by showing that this bound still holds for the upper irredundance number IR(G). We characterize the connected claw-free graphs for which IR(G) = (n + 1)/2 and give some properties of those graphs for which IR(G)= n/2 if n is even or IR(G) = (n - 1)/2 if n is odd.
Attribute-based filtering for embedded systems
Authors: Carlos Mitidieri, Jörg Kaiser
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Filters are essential components of a publisher/subscriber communication systems. They provide the necessary selectivity enforcing that a subscriber only is notified about the events for which it actually has subscribed. The paper deals with the problem of establishing a filtering mechanism suitable for distributed systems in which the nodes have memory and performance constraints and the interconnection network has a limited bandwidth, e.g. as in systems composed from smart sensors and actuators. Thus the trade-off between expressiveness on the one side and efficiency and predictability on the other side has to be balanced adequately for coping with the resource constraints. The paper proposes attribute-based filtering which allows to filter on the structural properties of events. The notion of super conformance establishes a relation between these structural properties. Attribute-based filtering constitutes a variant of type-based filtering but reflects a more component-oriented view which is beneficial when dealing with smart sensor or actuators components.
Public health surveillance using association rules
Authors: Warren T. Jones
Venue: ACM SIGBIO Newsletter (1998)

A multidisciplinary group is carrying out knowledge discovery research with researchers from computer science, pathology and biostatistics in collaboration with the Medical Informatics Section of the Department of Medicine. The current focus is on healthcare applications, more specifically on surveillance problems. A tool called Hawkeye (renamed Data Mining Surveillance System - DMSS) has been developed which searches temporally organized medical data, builds associations and applies interestingness heuristics for the identification of trends of interest to medical domain experts. The research also involves the study of collaborative interpretation of the identified patterns and trends.
Local XML functional dependencies
Authors: Jixue Liu, Millist Vincent, Chengfei Liu
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Keys and functional dependencies play a fundamental role in relational databases where they are used in integrity enforcement and in database design. Similarly, these constraints will play a fundamental role in XML and recently keys and functional dependencies in XML have been defined. In this paper we extend the previous definition of functional dependencies in XML to local functional dependencies in XML. Local functional dependencies (LFDs) are functional dependencies which hold only in a certain part of an XML document and not in the whole document. We also define, and prove correct, axioms for reasoning about the implication of LFDs in XML. Finally, we examine the relationship between LFDs and keys and show that the recently introduced concept of a relative key is a special case of a LFD.
Perceived reality and media entertainment
Authors: Michael A. Shapiro
Venue: Proceedings of the second international conference on Entertainment computing (2003)

Most media entertainment is in the form of narrative. It is important to understand user perceptions of narrative reality in entertainment design. While physical reality is an important element of perceived reality, starting in middle childhood perceptions of reality are increasingly associated with more abstract, conceptual, and even hypothetical aspects or reality. This paper reports on a program of research examining mental processes in making perceived reality judgments while viewing media. Typicality, pacing, and attributions about the causes of character behavior influence perceived reality. In addition, users make different perceived reality judgments about self and others. These findings are applied to the design of entertainment media.
An Analysis of the Home PNA Collision Resolution Mechanism
Authors: Shantanu Kangude, John Copeland, Matthew Sherman
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper, we present an analysis of the collisionresolution mechanism in the Home Phone-lineNetworking Alliance (Home PNA) 2.0 MAC protocol. Webegin with a brief description of the collision resolution(CR) mechanism, bringing out the differences with respectto other CR mechanisms. We show that the mechanismcan be modeled as a recursive one, with each CR cycleconsisting of smaller CR cycles. This recursive model isthen used to relate CR cycle periods with differentvariables in collision resolution. These relations form thebasis of a numerical method to find the mean of CR cycleperiods, as functions of initial collision multiplicity, thenumber of CR slots, and the priority class of traffic. Thus,having characterized the CR mechanism, we discuss howto operate it optimally, given the network conditions. Weshow that the choice of three slots for CR, as in thestandard, is sub-optimal in many cases. We conclude witha proposal for a dynamic CR mechanism, in which thenumber of CR slots can be varied dynamically. Withoutgoing into the implementation details, we discuss how theanalysis results can be used in this new mechanism.
Extension to UML using stereotypes
Authors: Daniel Riesco, Paola Martellotto, German Montejano
Venue: UML and the unified process (2003)

The objective of this chapter is to first present the basic extension mechanisms proposed by UML. We then propose an extension to facilitate the modeling of specific applications. UML provides three extension mechanisms to allow the modelers to make some common extensions without having to modify the language of modeling underlying "Tag Values, " "Restrictions," and "Stereotypes." There are several adaptations of UML, which occasionally exceed the extension mechanisms of UML. In this chapter, we present our proposal of "Evolutionary Stereotypes." We also present a tool that incorporates evolutionary stereotypes within two modules: the model checker and the dynamic semantics. A case study about time restrictions in a real-time system is shown. The reason for this proposal is that UML provides mechanisms for doing extensions; but, UML does not assure incorporation of new elements to the meta-model with dynamic semantics.
Collaborative Intrusion Detection System (CIDS): A Framework for Accurate and Efficient IDS
Authors: Yu-Sung Wu, Bingrui Foo, Yongguo Mei, Saurabh Bagchi
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

In this paper, we present the design and implementation ofa Collaborative Intrusion Detection System (CIDS) foraccurate and efficient intrusion detection in a distributedsystem. CIDS employs multiple specialized detectors at thedifferent layers - network, kernel and application - and amanager based framework for aggregating the alarms fromthe different detectors to provide a combined alarm for anintrusion. The premise is that a carefully designed andconfigured CIDS can increase the accuracy of detectioncompared to individual detectors, without a substantialdegradation in performance. In order to validate the premise,we present the design and implementation of a CIDS whichemploys Snort, Libsafe, and a new kernel level IDS calledSysmon. The manager has a graph-based and a Bayesiannetwork based aggregation method for combining the alarmsto finally come up with a decision about the intrusion. Thesystem is evaluated using a web-based electronic store frontapplication and under three different classes of attacks -buffer overflow, flooding and script-based attacks. The resultsshow performance degradations compared to no detection of3.9% and 6.3% under normal workload and a buffer overflowattack respectively. The experiments to evaluate the accuracyof the system show that the normal workload generates falsealarms for Snort and the elementary detectors produce missedalarms. CIDS does not flag the false alarm and reduces theincidence of missed alarms to 1 of the 7 cases. CIDS can alsobe used to measure the propagation time of an intrusion whichis useful in choosing an appropriate response strategy.
Protecting Distributed Software Upgrades that Involve Message-Passing Interface Changes
Authors: Ann T. Tai, Kam S. Tso, William H. Sanders
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

We present in this paper an extension of the message-drivenconfidence-driven framework that we developed foronboard guarded software upgrading. The purpose of thiswork is to provide the framework with the capability of protectingdistributed software upgrades that involve message-passinginterface changes. To achieve this goal, we proposean approach to clustering the components involved insoftware upgrades and those involved in message-passinginterface changes, such that from outside the cluster allthose components can be perceived collectively as one virtuallow-confidence component. Moreover, we develop aconfidence-driven mechanism that enables combined useof sender- and receiver-side message logging for efficient,fine-grained error containment and recovery. The paperprovides a detailed algorithm description.
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Authors: Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Venue: Journal of Algorithms (2003)

We propose a new solution for the fully dynamic single source shortest paths problem in a directed graph G = (N, A) with arbitrary arc weights, that works for any digraph and has optimal space requirements and query time. If a negative-length cycle is introduced in the subgraph of G reachable from the source during an update operation, then it is detected by the algorithm. Zero-length cycles are explicitly handled. We evaluate the cost of the update operations as a function of a structural property of G and of the number of the output updates. We show that, if G has a k-bounded accounting function (as in the case of digraphs with genus, arboricity, degree, treewidth or page number bounded by k), then the update procedures require O (min{m, kċnA}ċlogn) worst case time for weight-decrease operations, and O(min{mċlogn, kċ (nA + nB) ċ logn + n}) worst case time for weight-increase operations. Here, n = |N|, m = |A|, nA is the number of nodes affected by the input update, that is the nodes changing either the distance or the parent in the shortest paths tree, and nB is the number of nonaffected nodes considered by the algorithm that also belong to zero-length cycles. If zero-length cycles are not allowed, then nB is zero and the bound for weight-increase operations is O(min{mċlogn, kċnA - logn + n}). Similar amortized bounds hold if we perform also insertions and deletions of arcs.
Prediction of interconnect adjacency distribution: derivation, validation, and applications
Authors: Payman Zarkesh-Ha, Ken Doniger, William Loh, Peter Bendix
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

An analytical interconnect adjacency distribution model for random logic interconnect networks based on the Bernoulli probability distribution is derived. By definition, interconnect adjacency is the fractional length of an interconnect for which there is a neighboring interconnect at minimum spacing. Some possible applications of the interconnect adjacency distribution are statistical cross-talk analysis, interconnect yield prediction, and statistical interconnect reference circuit for more realistic capacitance estimation.The model uses only simple and readily available system parameters well known to designers. These are the wire-length distribution and the average channel utilization. Comparison to product data shows good agreement with the model.
Situation-Aware Personalized Information Retrieval for Mobile Internet
Authors: Stephen S. Yau, Huan Liu, Dazhi Huang, Yisheng Yao
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Recent rapid advances in Internet-based informationsystems and handheld devices make it possible for usersto retrieve information anytime and anywhere. Existinginformation retrieval (IR) techniques usually require theusers to spend much effort to continuously refine theirqueries to obtain the results they want. Since eachrefinement is an interaction between a user andinformation systems, the larger the number of interactionsis, the more communication overhead and energyconsumption are introduced. Due to the severe resourceconstraints of handheld devices, it is necessary to have anIR technique that can efficiently retrieve information forthe user with only one or two interactions. In this paper,an efficient IR technique for mobile Internet bycombining situation-based adaptation and profile-basedpersonalization is presented.
Synthesis of multi-level logic with one symbolic input
Authors: Frank Buijs, Thomas Lengauer
Venue: Proceedings of the conference on European design automation (1991)

This paper presents algorithms that perform multi-level logic synthesis on logic with one symbolic input. This method contrasts to existing approaches that encode a symbolic input before logic synthesis. These approaches determine the encoding based on heuristic estimates. Our algorithms, which perform logic synthesis directly on the logic with the symbolic input, enable us to encode the symbolic input after logic synthesis. Since we determine the encoding based on the result of the multi-level logic synthesis, instead of heuristic estimates, we obtain better encoding and hence smaller logic. Experiments on a number of benchmarks show improvements up to 49%.
The convergence of AOP and active databases: towards reactive middleware
Authors: Mariano Cilia, Michael Haupt, Mira Mezini, Alejandro Buchmann
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Reactive behavior is rapidly becoming a key feature of modern software systems in such diverse areas as ubiquitous computing, autonomic systems, and event-based supply chain management. In this paper we analyze the convergence of techniques from aspect oriented programming, active databases and asynchronous notification systems to form reactive middleware. We identify the common core of abstractions and explain both commonalities and differences to start a dialogue across community boundaries. We present existing options for implementation of reactive software and analyze their run-time semantics. We do not advocate a particular approach but concentrate on identifying how the various disciplines can benefit from each other. We believe that AOP can solve the impedance mismatch found in reactive systems that are implemented through inherently static languages, while AOP can benefit from the active database community's experience with event detection/composition and fault tolerance in large scale systems. The result could be a solid foundation for the realization of reactive middleware services.
Method manipulation in an object-oriented processor
Authors: Mok Pak Lun, Richard Li, Anthony Fong
Venue: ACM SIGARCH Computer Architecture News (2003)

In Object-Oriented Programming (OOP), programmers divide the software applications into small objects, each of which is responsible for performing part of the work. The communications between different objects are through method invocation. Method manipulation is taking a big role in an OOP system. The performance of method invocation would greatly affect the performance of an OOP system. To speed up method communication, an object-oriented computer architecture is proposed at hardware level. High Level Instruction Set Computer (HISC) is one of the OOP architectures proposed. It applies hardware readable data structures to provide mapping of OOP features directly from architectural level. One of the architectural designs that use the concept of HISC is jHISC v3, which is currently under development. It targets to support Java at architecture level.In this paper, we will discuss the method manipulation procedures in jHISC v3 system. By defining the hardware readable data structures for method context, we will see how jHISC v3 processor can use such information to provide a secure method manipulation mechanism for OOP.
Knowledge discovery in perioperative databases
Authors: Russ Waitman
Venue: ACM SIGBIO Newsletter (1998)

Knowledge Discovery in Perioperative Databases: Hypothesis Testing, Decision Support, and Care Pathway Assessment. Previously merged C4.5 with expert guided inductive learning. Currently researching the use of BRUTE force induction to discover relationships in perioperative data. Will be analyzing physiological data from patients in the operating room as well as information contained in a perioperative database.
CALDEA: A Data Quality Model Based on Maturity Levels
Authors: Ismael Caballero, Mario Piattini
Venue: Proceedings of the Third International Conference on Quality Software (2003)

In these days, most organizations have realised, atlast, so important as their software is their data, becauseit can be considered as an important asset present in° allbusiness organizational processes. Our aim is to optimisethe Data Management Process (DMP) in order to assuredata quality. For this, we have just drawn a frameworkbased on maturity levels -as CMMI's ones- with specificand generic data quality goals, which are achieved byexecuting the corresponding activities.
MultiGen: an integrated multiple-objective solution system
Authors: S. K. Mirrazavi, D. F. Jones, M. Tamiz
Venue: Decision Support Systems (2003)

This paper presents an overview of a global multiple-objective system capable of rigourously handling a wide variety of multiple-objective and goal programming (GP) models. The system has two efficient solution engines that complement one another. These are an intelligent conventional optimisation system and a genetically driven heuristic search-based solver. The development of a linear and nonlinear sparse storage system capable of handling additional multiple-objective factors such as priority levels, goals, objectives, and upper and lower bounds is described. An appropriate input/output style for multiple-objective programmes is given. The resulting package provides an efficient and user-friendly environment for the interactive solution and analysis of a wide variety of multiple-objective programming (MOP) models.
On the Model of OoS Multicast Routing Problems in Active Networks
Authors: Zhenwei Yu, Yun Pan, Licheng Wang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we propose the concept of order of services (OoS) and construct the programming model of OoS multicast routing in active networks. We also give methods toassure services and to compute the violation degree of OoS. Then, based on an improved prüfer encoding method, we design a novel genetic algorithm for the new model. Thecomplexities of encoding and decoding of our algorithm do not exceed O(n2). A great number of numerical experiments suggest that our algorithm is feasible and efficient.
Mac OS X Unwired
Authors: Tom Negrino, Dori Smith
Venue:  (2003)

Mac OS X Unwired is a one-stop wireless information source for technically savvy Mac users. If you're considering wireless as an alternative to cable and DSL, or using wireless to network computers in your home, office, or on the road, this book will show you the full-spectrum view of wireless capabilities of Mac OS X, and how to get the most out of them.
If you know b-splines well, you also nnow NURBS!
Authors: John Fisher, John Lowther, Ching-Kuang Shene
Venue: ACM SIGCSE Bulletin (2004)

This paper presents our attempt in designing intuitive and interesting materials for teaching NURBS in an undergraduate course with the help of our tool DesignMentor. This approach does not require tedious mathematics and is based on learning-by-doing and visualization. Our approach was classroom tested and used world-wide in the last seven years.
Nonmonotonic inconsistency
Authors: Charles B. Cross
Venue: Artificial Intelligence (2003)

Nonmonotonic consequence is the subject of a vast literature, but the idea of a nonmonotonic counterpart of logical inconsistency--the idea of a defeasible property representing internal conflict of an inductive or evidential nature--has been entirely neglected. After considering and dismissing two possible analyses relating nonmonotonic consequence and a nonmonotonic counterpart of logical inconsistency, this paper offers a set of postulates for nonmonotonic inconsistency, an analysis of nonmonotonic inconsistency in terms of nonmonotonic consequence, and a series of results showing that nonmonotonic inconsistency conforms to these postulates given the analysis of nonmonotonic inconsistency presented here and certain postulates for nonmonotonic consequence.The results presented here establish the interest of certain previously undiscussed postulates of nonmonotonic consequence. These results also show that nonmonotonicity, which has never seemed useful in the formulation of general principles governing nonmonotonic reasoning, is relevant to the positive characterization of nonmonotonic inference after all.
Authentication and access delegation with user-released certificates
Authors: Lavinia Egidi, Maurizio Melato
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We propose an authentication and access delegation system based on an unconventional use of X.509 certificates. It allows users to connect from any untrusted machine and to define dynamically a group of trusted co-workers. It is low cost, doesn't need unusual software nor hardware on the client's side, and offers a good degree of security without requiring that the user be too careful. The underlying idea is to enable users to release their own certificates with very short life span (or usable just once) to authenticate themselves to the server.
An empirically based system for processing definite descriptions
Authors: Renata Vieira, Massimo Poesio
Venue: Computational Linguistics (2000)

We present an implemented system for processing definite descriptions in arbitrary domains. The design of the system is based on the results of a corpus analysis previously reported, which highlighted the prevalence of discourse-new descriptions in newspaper corpora. The annotated corpus was used to extensively evaluate the proposed techniques for matching definite descriptions with their antecedents, discourse segmentation, recognizing discourse-new descriptions, and suggesting anchors for bridging descriptions.
Adaptive color quantization based on perceptive edge protection
Authors: Xuelong Li, Tianqiang Yuan, Nenghai Yu, Yuan Yuan
Venue: Pattern Recognition Letters (2003)

A novel adaptive color quantization algorithm is presented based on perceptive information carried by image edges. A few colors can be selected automatically to protect the semantic regions and represent the original image. Experimental results show that the proposed methods perform well in term of perception and speed.