ppxscal/embedding_network huggingface dataset:
First-Order Logical Neural Networks
Authors: Thanupol Lerdlamnaochai, Boonserm Kijsirikul
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Inductive Logic Programming (ILP) is a well known machine learning technique in learning concepts from relational data. Nevertheless, ILP systems are not robust enough to noisy or unseen data in real world domains. Furthermore, in multi-class problems, if the example is not matched with any learned rules, it cannot be classified. This paper presents a novel hybrid learning method to alleviate this restriction by enabling Neural Networks to handle first-order logic programs directly. The proposed method, called First-Order Logical Neural Network (FOLNN), is based on feedforward neural networks and integrates inductive learning from examples and background knowledge. We also propose a method for determining the appropriate variable substitution in FOLNN learning by using Multiple-Instance Learning (MIL). In the experiments, the proposed method has been evaluated on two first-order learning problems, i.e., the Finite Element Mesh Design and Mutagenesis and compared with the state-of-the-art, the PROGOL system. The experimental results show that the proposed method performs better than PROGOL.
A service-oriented middleware for building context-aware services
Authors: Tao Gu, Hung Keng Pung, Da Qing Zhang
Venue: Journal of Network and Computer Applications (2005)

The advancement of wireless networks and mobile computing necessitates more advanced applications and services to be built with context-awareness enabled and adaptability to their changing contexts. Today, building context-aware services is a complex task due to the lack of an adequate infrastructure support in pervasive computing environments. In this article, we propose a Service-Oriented Context-Aware Middleware (SOCAM) architecture for the building and rapid prototyping of context-aware services. It provides efficient support for acquiring, discovering, interpreting and accessing various contexts to build context-aware services. We also propose a formal context model based on ontology using Web Ontology Language to address issues including semantic representation, context reasoning, context classification and dependency. We describe our context model and the middleware architecture, and present a performance study for our prototype in a smart home environment.
On the complexity of optimal K-anonymity
Authors: Adam Meyerson, Ryan Williams
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We prove that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to delete from the relation. We also present a polynomial time algorithm for optimal k-anonymity that achieves an approximation ratio independent of the size of the database, when k is constant. In particular, it is a O(k log k)-approximation where the constant in the big-O is no more than 4, However, the runtime of the algorithm is exponential in k. A slightly more clever algorithm removes this condition, but is a O(k log m)-approximation, where m is the degree of the relation. We believe this algorithm could potentially be quite fast in practice.
Identification of Nonlinear Passive Devices for Haptic Simulations
Authors: Mark B. Colton, John M. Hollerbach
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes a method for identifying models of a class of nonlinear passive devices, such as switches, knobs, an buttons. A general nonlinear impedance model is presented, which accounts for dynamics that change with both position and direction. Exponentially-weighted least-squares is used to fit the nonlinear model to experimental data from a specially designed physical 1-DOF test device with inherent nonlinearities. The data are obtained using an instrumented linear probe.
Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction
Authors: Takayuki Suyama, Makoto Yokoo
Venue: Autonomous Agents and Multi-Agent Systems (2005)

In this paper, we investigate a model of a combinatorial, procurement multi-attribute auction, in which each sales item is defined by several attributes called quality, the buyer is the auctioneer (e.g., a government), and the sellers are the bidders. Furthermore, there exist multiple items and both buyer and sellers can have arbitrary (e.g., substitutable/complementary) preferences on a bundle of items. Our goal is to develop a protocol that is strategy-proof for sellers. We first present a VickreyClarkeGroves (VCG)-type protocol. As in a standard combinatorial auction, a VCG-type protocol is not false-name-proof, i.e., it is vulnerable against manipulations using multiple identifiers. Next, we show that any strategy-proof protocol in this model can be represented as a framework called Price-Oriented Rationing-Free (PORF) protocol, in which for each bidder, for each bundle of items, and for each quality, the payment for the bidder is determined independently of his own declaration, and the bidder can obtain a bundle that maximizes his utility independently of the allocations of other bidders. We develop a false-name-proof protocol in this model.
Explicit Combinatorial Structures for Cooperative Distributed Algorithms
Authors: Dariusz Kowalski, Peter M. Musial, Alexander A. Shvartsman
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Cooperation in distributed settings often involves activities that must be performed at least once by the participating processors. When processor failures or delays occur, it becomes unavoidable that some tasks are done redundantly. To make efficient use of the available processors, several distributed algorithms schedule the activities of the processors in terms of permutations of tasks that need to be performed at least once. This paper presents the first explicit practical deterministic construction of sets of permutations with certain combinatorial properties that immediately make practical several deterministic distributed algorithms. These algorithms solve a variety of problems, for example, cooperation in shared-memory and message-passing settings, and the gossip problem. Prior to this work, the most efficient algorithms for some of these problems were primarily of theoretical interest ¿ they relied on permutations that are known to exist, but very expensive to construct, with the cost of construction being at least exponential in the size of the permutations. In this paper, the explicitly constructed permutations are ultimately used directly to produce practical instances of several classes ofefficient deterministic algorithms. Most importantly, for all of these algorithms, the schedule construction cost is reduced from exponential to polynomial, at the expense of slight detuning, at most polylogarithmic, of the efficiency of these algorithms.
Methodological Approaches to Comparing Pedagogical Innovations Using Technology
Authors: Nancy Law, Angela Chow, Allan H. Yuen
Venue: Education and Information Technologies (2005)

The study of educational innovations has become increasingly important in education research as many countries around the world have embarked on education reforms that aim to change both the goals and practices in education. There is also a general expectation that such innovations can be leveraged or supported by the use of information and communication technology (ICT) in the learning and teaching process. However, comparative studies of innovations are relatively rare. SITES M2, as an international comparative study of innovative pedagogical practices involving 28 participating systems, thus faced important methodological challenges the solution of which was no less an innovation in itself. This paper examines the methods of analysis used and the kind of research findings that resulted from the work of three research teams that had conducted comparisons of the case studies of innovation collected, including the work of the SITES M2 International Coordinating Centre (ICC). Even though all three studies attempted to examine similarities and differences across multiple case studies, the analysis conducted by the ICC looked for characterizations of the innovations while the other two studies developed meaningful ways to compare the cases in terms of "levels of innovation" across a number of dimensions. In discussing the methodological differences across these studies, this paper pays special attention to how one could compare different innovations in terms of their levels or extents of innovation and what such comparisons may contribute to our learning from technology-supported education innovations.
Formal analysis of modern security protocols
Authors: Alec Yasinsac, Justin Childs
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Analyzing security protocols is notoriously difficult. In this paper, we show how a novel tool for analyzing classical cryptographic protocols can be used to model and analyze complex Internet security protocol families. CPAL-ES allows the representation of the interaction between two sub-protocols. Within a protocol such as Transport Layer Security (TLS) these are selected from a collection of sub-protocols utilized by a principal. Modeling subversion related to sub-protocol interactions is an important part of formally understanding attacks upon protocol suites. The CPAL environment contains sufficient functionality to verify the feasibility of these attacks.We also define and classify the characteristics that add complexity to modern security protocol and some impacts this complexity has on security protocol analysis. Finally, we discuss the modifications that were necessary in our formal method tool to answer this complexity and show how the tool illuminates flaws in the TLS protocol.
Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks
Authors: Donggang Liu, Peng Ning, Wenliang Du
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Sensorsý locations play a critical role in many sensor network applications. A number of techniques have been proposed recently to discover the locations of regular sensors based on a few special nodes called beacon nodes, which are assumed to know their locations (e.g., through GPS receivers or manual configuration). However, none of these techniques can work properly when there are malicious attacks, especially when some of the beacon nodes are compromised. This paper introduces a suite of techniques to detect and remove compromised beacon nodes that supply misleading location information to the regular sensors, aiming at providing secure location discovery services in wireless sensor networks. These techniques start with a simple but effective method to detect malicious beacon signals. To identify malicious beacon nodes and avoid false detection, this paper also presents several techniques to detect replayed beacon signals. This paper then proposes a method to reason about the suspiciousness of each beacon node at the base station based on the detection results collected from beacon nodes, and then revoke malicious beacon nodes accordingly. Finally, this paper provides detailed analysis and simulation to evaluate the proposed techniques. The results show that our techniques are practical and effective in detecting malicious beacon nodes.
Accelerating Scientific Applications with the SRC-6 Reconfigurable Computer: Methodologies and Analysis
Authors: Melissa C. Smith, Jeffery S. Vetter, Xuejun Liang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Reconfigurable computing offers the promise of performing computations in hardware to increase performance and efficiency while retaining much of the flexibility of a software solution. Recently, the capacities of reconfigurable computing devices, like field programmable gate arrays, have risen to levels that make it possible to execute 64b floating-point operations. SRC Computers has designed the SRC-6 MAPstation to blend the benefits of commodity processors with the benefits of reconfigurable computing. In this paper, we describe our effort to accelerate the performance of several scientific applications on the SRC-6. We describe our methodology, analysis, and results. Our early evaluation demonstrates that the SRC-6 provides a unique software stack that is applicable to many scientific solutions and our experiments reveal the performance benefits of the system.
Policy Driven Mobile Agents for Ubiquitous Medical Diagnosis Assistant System
Authors: Ying Zou, Robert S. H. Istepanian, Steve C. Bain
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

Ubiquity has been a key element to modern medical diagnosis system to improve medical service's efficiency and convenience on both medical personals and patients sides. Mobile agents and SIP technology make this anticipation possible. This paper proposes an approach to a ubiquitous medical diagnosis assistant system based on SIP, mobile agents and policy driven technology. First we describe mobile agent and SIP technology, and how they can integrate together at diagnosis assistant system. Second, we present a conceptual model for this medical diagnosis assistant system. Finally, a typical application scenario on diabetes management is described.
Domain portability in speech-to-speech translation
Authors: Alon Lavie, Lori Levin, Tanja Schultz, Chad Langley, Benjamin Han, Alicia Tribble, Donna Gates, Dorcas Wallace, Kay Peterson
Venue: Proceedings of the first international conference on Human language technology research (2001)

Speech-to-speech translation has made significant advances over the past decade, with several high-visibility projects (C-STAR, Verb-mobil, the Spoken Language Translator, and others) significantly advancing the state-of-the-art. While speech recognition can currently effectively deal with very large vocabularies and is fairly speaker independent, speech translation is currently still effective only in limited, albeit large, domains. The issue of domain portability is thus of significant importance, with several current research efforts designed to develop speech-translation systems that can be ported to new domains with significantly less time and effort than is currently possible.
Model analysis of coronary hemodynamics incorporating autoregulation
Authors: Mitsuyasu Kagiyama, Hiroyuki Michinishi, Hiroto Kagotani, Takuji Okamoto, Yasuo Ogasawara, Fumihiko Kajiya
Venue: Systems and Computers in Japan (2004)

This paper models the autoregulation function for the coronary circulation and analyzes the pulsatile coronary hemodynamics. The autoregulation function acts to maintain a constant average blood flow in the arterioles, as determined by the oxygen consumption in the heart muscle, even if the average coronary arterial pressure changes. The regulation is realized by partially controlling the vessel characteristics which correspond to the vessel tonus. In this study, the function is incorporated into the existing three-layered coronary hemodynamics model. Then, the arteriole hemodynamics is analyzed by simulation for the case of the normal coronary arterial pressure waveform and for the case of systolic hypertension. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 21&ndash;31, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10709
Per Connection Performance Analysis of a Frame-Based TDMA/CDMA MAC Protocol Containing both Reservation and Contention Slots
Authors: Ying-Ju Chen, Jin-Fu Chang
Venue: Queueing Systems: Theory and Applications (2005)

A mixture of reservation plus contention data slots is now widely implemented in TDMA/ CDMA systems to make a system flexible enough to suit various kinds of packets but preserve the good nature of frame-based protocols. We conducted performance analysis for an arbitrary connection in such a system under the assumption of MMPP (Markov-modulated Poisson process) arrivals. Accessible slot locations of this connection in a frame are made general. Success probability in accessing a contention slot is also made general. We have obtained the system size distribution which can be used to evaluate the performance of various frame-based MAC protocols. The MMPP arrival pattern can be generalized to the BMAP (batch Markovian arrival process) family to further accommodate a broader set of traffic sources.
DIP: a double-interval-based dynamic voltage scaling scheme for dynamic priority-based task scheduling systems
Authors: Sookyoung Kim, Thomas L. Martin
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

The goal of dynamic voltage scaling (DVS) is to reduce CPU energy consumption without degrading applications' quality-of-service (QoS). In general-purpose systems, in which a variety of tasks are scheduled by a traditional dynamic priority-based task scheduler, existing DVS schemes tend to degrade the QoS by causing urgent tasks having low priorities to starve because these schemes ignore the behavior of dynamic priority-based task schedulers. In this paper, we propose the 'double-interval-based DVS scheme for priority-based task scheduling systems (DIP)', which better manages time-sensitive tasks' QoS by bridging the gap between CPU speed scheduling and dynamic priority-based task scheduling. We describe how DIP determines an appropriate CPU speed for a group of coexisting tasks considering tasks' priorities, using an improved interval-based algorithm so that the CPU-time requirements of the low priority time-sensitive tasks in the group can be satisfied. Another novel feature of DIP is that it separates QoS-control from throughput-control via two different interval-based algorithms, which allows more energy savings when throughput is not a primary concern. Trace-based simulations show that, depending upon target systems' primary concern, DIP generally provides better energy savings at comparable QoS or better QoS at comparable energy savings, respectively, compared to existing DVS schemes.
Second international workshop on software engineering for high performance computing system applications
Authors: Philip M. Johnson
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming
Authors: Mohammad Ghoniem, Hadrien Cambazard, Jean-Daniel Fekete, Narendra Jussien
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

In this paper, we describe the use of visualization tools in the context of constraint programming. Specifically, we focus on the visualization of dynamic graphs using adjacency matrices, and show that visualization tools can provide valuable insights into the behavior of constraint-based solvers. This contributes to better understanding solver dynamics for teaching purposes, and can enhance the analysis and the optimization of constraint-based programs in connection with known and difficult research problems.
Modeling network growth with directional attachment and communities
Authors: Masahiro Kimura, Kazumi Saito, Naonori Ueda
Venue: Systems and Computers in Japan (2004)

Aiming to construct a more precise probabilistic model for the short-term growth process of real-world growing networks such as the Web, we propose a new network growth model and its learning algorithm. Unlike the conventional network growth models, we incorporate directional attachment and community structure for this purpose. We first show that the proposed model also exhibits a degree distribution with a power-law tail. In experiments using real Web data, we demonstrate that prediction of the dynamics of a given growing network can be improved by incorporating directional attachment and community structure. In experiments using synthetic data, we also demonstrate that prediction performance can definitely be improved by incorporating community structure. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 1&ndash;11, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10706
Online local learning algorithms for linear discriminant analysis
Authors: G. K. Demir, K. Ozmehmet
Venue: Pattern Recognition Letters (2005)

Online local learning algorithms for a laterally-connected single-layer neural network for performing linear discriminant analysis have been proposed. A convergence proof is provided for the algorithm based on Hebbian learning. The algorithms are simulated and applied to the face recognition problem.
Linux on a small satellite
Authors: Christopher Huffine
Venue: Linux Journal (2005)

If you need to get a satellite launched in a year, think standard parts, creative reuse and shell scripts.
An Approach to Dynamic Fingerprint Image Enhancement
Authors: Wei Liu, Pu-liu Yan, De-ling Xia, Cong Zhou
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

A new algorithm of fingerprint enhancement is presented. Gabor filter and oriented filter are used to enhance the fingerprint images in two steps. First a dynamic 2-D Gabor filter is used to separate the conglutinated ridgelines, and then a well-defined oriented filter is used to joint the ruptured ridgelines and clean up the valleys. The new method is not sensitive to the offset and the rotation of fingerprint image, and easy to realize. The experiments show good performance.
Axiomatic computational model
Authors: Conrad Mueller
Venue: ACM SIGPLAN Notices (2005)

A new model of computation is explored based on axiomatic logic. The significant difference from other models is how reasoning about variables is expressed. The computation is described only by defining variables in terms of other variables. The benefit is the simplicity of the semantics of the axiomatic logic. The model is described in the form of a tutorial using a simple language to illustrate how a program can be expressed in this model.
Measuring the evolution of transport protocols in the internet
Authors: Alberto Medina, Mark Allman, Sally Floyd
Venue: ACM SIGCOMM Computer Communication Review (2005)

In this paper we explore the evolution of both the Internet's most heavily used transport protocol, TCP, and the current network environment with respect to how the network's evolution ultimately impacts end-to-end protocols. The traditional end-to-end assumptions about the Internet are increasingly challenged by the introduction of intermediary network elements (middleboxes) that intentionally or unintentionally prevent or alter the behavior of end-to-end communications. This paper provides measurement results showing the impact of the current network environment on a number of traditional and proposed protocol mechanisms (e.g., Path MTU Discovery, Explicit Congestion Notification, etc.). In addition, we investigate the prevalence and correctness of implementations using proposed TCP algorithmic and protocol changes (e.g., selective acknowledgment-based loss recovery, congestion window growth based on byte counting, etc.). We present results of measurements taken using an active measurement framework to study web servers and a passive measurement survey of clients accessing information from our web server. We analyze our results to gain further understanding of the differences between the behavior of the Internet in theory versus the behavior we observed through measurements. In addition, these measurements can be used to guide the definition of more realistic Internet modeling scenarios. Finally, we present several lessons that will benefit others taking Internet measurements.