ppxscal/embedding_network huggingface dataset:
Unmanaged Internet Protocol: taming the edge network management crisis
Authors: Bryan Ford
Venue: ACM SIGCOMM Computer Communication Review (2004)

Though appropriate for core Internet infrastructure, the Internet Protocol is unsuited to routing within and between emerging ad-hoc edge networks due to its dependence on hierarchical, administratively assigned addresses. Existing ad-hoc routing protocols address the management problem but do not scale to Internet-wide networks. The promise of ubiquitous network computing cannot be fulfilled until we develop an Unmanaged Internet Protocol (UIP), a scalable routing protocol that manages itself automatically. UIP must route within and between constantly changing edge networks potentially containing millions or billions of nodes, and must still function within edge networks disconnected from the main Internet, all without imposing the administrative burden of hierarchical address assignment. Such a protocol appears challenging but feasible. We propose an architecture based on self-certifying, cryptographic node identifies and a routing algorithm adapted from distributed hash tables.
Lyndon factorization of the Prouhet words
Authors: Patrice Séébold
Venue: Theoretical Computer Science (2003)

Prouhet words are a natural generalization, over alphabets with more than two letters, of the well known binary Thue-Morse word.We give a unique factorization of these words in a sequence of decreasing Lyndon words, then generalizing such a decomposition given by Ido and Melançon for the Thue-Morse word.
Agents handling annotation distribution in a corporate semantic web
Authors: Fabien Gandon
Venue: Web Intelligence and Agent Systems (2003)

This article describes a multi-agent software architecture to manage a corporate memory in the form of a corporate semantic Web. It summarizes the design rationale and the final architecture of the CoMMA system. It then presents and discusses an approach to manage distributed annotations, focusing on two problems: the allocation of newly posted annotations and the allocation of the tasks involved in distributed query-solving.
Challenges in teaching capstone courses
Authors: Liz Adams, Mats Daniels, Annegret Goold, Orit Hazzan, Kathy Lynch, Ian Newman
Venue: ACM SIGCSE Bulletin (2003)

Many of us run capstone project courses and do so in different ways. The members of this panel come from different countries, belong to different types of institutions, teach in different computing disciplines and the capstone projects they run also vary considerably. Yet, there is a strong sense of consensus about what a capstone project is and how valuable it is as a learning experience for students.The panel discussion will serve as an inspiration to develop new, and change old capstone project courses. The main aim is to discuss why, or why not, different approaches work in a capstone project. What are the learning objectives behind the approach? What are the problems? What are the benefits? How is assessment managed? What resources, tools and techniques are used to administer and manage the projects?Concrete examples of how capstone projects are run at the six institutions represented by the panellists will be given, and issues such as framework, methodologies, project examples and technologies used in the process of producing projects will be addressed.
An Analysis of Backward Simulation Data-Refinement for Partial Relation Semantics
Authors: Moshe Deutsch, Martin C. Henson
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

This paper investigates data-refinement by backwardsimulation for specifications whose semantics is given bypartial relations. The standard model-theoretic approach isbased on totalisation and lifting. The paper examines thismodel, exploring and isolating the precise roles played bylifting and totalisation in the standard account by introducinga simpler, normative theory of backward simulationdata-refinement (SB-refinement) which captures refinementdirectly in the language and in terms of the natural propertiesof preconditions and postconditions. This theory is usedin conjunction with four other model-theoretic approachesto determine the extent to which the standard approach iscanonical, and the extent to which it is arbitrary.
Solving Hierarchical Constraints over Finite Domains with Local Search
Authors: Martin Henz, Roland H. C. Yap, Yun Fong Lim, Seet Chong Lua, J. Paul Walser, Xiao Ping Shi
Venue: Annals of Mathematics and Artificial Intelligence (2004)

Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints.The motivation for this work arose from solving large airport gate allocation problems. We show how gate allocation problems can be formulated as HCPs using typical gate allocation constraints. Using the gate allocation benchmarks, we investigate how constraint heirarchy selection strategies and the problem formulation using two models: a 0&ndash;1 linear constraint hierarchy model and a nonlinear finite domain constraint hierarchy model.
Technology trust in B2B electronic commerce: conceptual foundations
Authors: Paul A. Pavlou, Pauline Ratnasingam
Venue: Business strategies for information technology management (2003)

A comprehensive conceptulization of trust in B2B electronic commerce should include trust in the infrastructure and the underlying control and support mechanisms. We refer to this new target of trust as "technology trust, " which is described as the subjective belief by which an organization assesses that the underlying technology infrastructure and support mechanisms are capable of supporting inter-organizational communications, transactions, and collaborations. We describe technology trust as a higher-order construct comprising of transaction (a) confidentiality, (b) integrity, (c) authentication, (d) non-repudiation, (e) access control (f) availability, and (g) best business practices. We conceptualize technology trust drawing upon the notion of institutional trust, and particularly the dimension of situational normality. We describe how bi-lateral (dyadic) and third-party institutionalized technology-related practices can institute situational normality in B2B electronic commerce. This chapter contributes to the understanding of the conceptual foundations of technology trust by bridging the gap between technological solutions from an institutional trust perspective (technology trust), interorganizational trust, and value creation in B2B electronic commerce. We conclude by discussing the study's theoretical and managerial implications toward instituting and making use of technology trust.
Fuzzy Partial State Feedback Control of Discrete Nonlinear Systems with Unknown Time-Delay
Authors: Hyunseok Shin, Chulwan Choi, Euntai Kim, Mignon Park
Venue: Fuzzy Optimization and Decision Making (2004)

A new discrete-time fuzzy partial state feedback control method for the nonlinear systems with unknown time-delay is proposed. Ma et al. proposed the design method of the fuzzy controller based on the fuzzy observer and Cao and Frank extend this result to be applicable to the case of the nonlinear systems with the time-delay. However, the time-delay is likely to be unknown in practical. In this paper, the sufficient condition for the asymptotic stability is derived with the assumption that the time-delay is unknown by applying Lyapunov&ndash;Krasovskii theorem and this condition is converted into the LMI problem.
Optimal segmentation points for programs
Authors: Brian W. Kernighan
Venue: Proceedings of the second symposium on Operating systems principles (1969)

A program may be modeled as a directed graph on n " nodes, " where the nodes are instructions, or data items, or contiguous groups of these. This paper discusses the problem of partitioning such sets of nodes into pages to minimize the number of transitions between pages during execution of the program.The node's are assumed to have a given ordering which may not be changed. We require that nodes on any page must be contiguous, so the only degree of freedom is in selecting "break points" between the pages.We show that if the expected number of transitions between each node of the program graph and its successors is known, then there is an algorithm for selecting the optima break points. The algorithm requires an execution time which grows linearly with the number of nodes in almost all cases.
Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination
Authors: Jianliang Xu, Qinglong Hu, Wang-Chien Lee, Dik Lun Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Data caching at mobile clients is an important technique for improving the performance of wireless data dissemination systems. However, variable data sizes, data updates, limited client resources, and frequent client disconnections make cache management a challenge. In this paper, we propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced before a cached item is used. Min-SAUD considers several factors that affect cache performance, namely, access probability, update frequency, data size, retrieval delay, and cache validation cost. This paper employs stretch as the major performance metric since it accounts for the data service time and, thus, is fair when items have different sizes. We prove that Min-SAUD achieves optimal stretch under some standard assumptions. Moreover, a series of simulation experiments have been conducted to thoroughly evaluate the performance of Min-SAUD under various system configurations. The simulation results show that, in most cases, the Min-SAUD replacement policy substantially outperforms two existing policies, namely, LRU and SAIU.
Evaluation of a Bottom-up Action Research Approach in a Centralised Setting: HISP in Cuba
Authors: Johan Sæb, Ola Titlestad
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

There has been a high rate of failure in the implementation of information systems in developing countries. Participative approaches have received a lot of attention as a way to ensure more appropriate systems with a greater rate of success. The authors of this paper spent 4 months working on designing and implementing a health information system as part ofthe Health Information System Program (HISP) in the Cuban Ministry of Health using this type of approach. This paper describes the experiences there. The HISP has proven to be a relatively successful information system in India and in several African countries, aiming at empowering local health management and improving information use at the local level. Theprimary contribution to the current literature on participative approaches is the lessons learned in trying to use this approach in a highly centralized setting. General implications for system development and collaboration in Cuba are also discussed.
Conceptual modeling of XML schemas
Authors: Bernadette Farias Lósio, Ana Carolina Salgado, Luciano do Rêgo GalvĐo
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

XML has become the standard format for representing structured and semi-structured data on the Web. To describe the structure and content of XML data, several XML schema languages have been proposed. Although being very useful for validating XML documents, an XML schema is not suitable for tasks requiring knowledge about the semantics of the represented data. For such tasks it is better to use a conceptual schema. This paper presents an extension of the Entity Relationship (ER) model, called X-Entity, for conceptual modeling of XML schemas. We also present the process of converting a schema, defined in the XML Schema language, to an X-Entity schema. The conversion process is based on a set of rules that consider element declarations and type definitions and generates the corresponding conceptual elements. Such representation provides a cleaner description for XML schemas by focusing only on semantically relevant concepts. The X Entity model has been used in the context of a Web data integration system with the goal of providing a concise and semantic description for local schemas defined in XML Schema.
Improved Symoblic Simulation by Dynamic Funtional Space Partitioning
Authors: Tao Feng, Li-C. Wang, Kwang-Ting Cheng, Andy C-C. Lin
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we provide a flexible and automatic method to partition the functional space for efficient symbolic simulation. We utilize a 2-tuple list representation as the basis for partitioning the functional space. The partitioning is carried out dynamically during the symbolic simulation based on the sizes of OBDDs. We develop heuristics for choosing the optimal partitioning points. These heuristics intend to balance the tradeoff between the time and space complexity. We demonstrate the effectiveness of our new symbolic simulation approach through experiments based on a floating point adder and a memory management unit.
Adding objects to the traditional ACM programming contest
Authors: Steven K. Andrianoff, Dalton R. Hunkins, David B. Levine
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Programming contests have a long established role as co-curricular activities. But as programming methodology has changed, the programming contest problems have not reflected these changes. In this paper, we describe a way to modernize the traditional ACM-style contest while preserving the problem solving aspects. We do so by introducing a new type of problem that requires that solutions interact with pre-defined classes. We discuss the effects of this change on a contest conducted for high school students.
A quantitative risk assessment model for the management of software projects
Authors: Dan Shoemaker
Venue: Practicing software engineering in the 21st century (2003)

This chapter presents a comprehensive quantitative management model for information technology (IT). It is assessment based and can be easily implemented without imposing an unacceptable organizational-change solution. It supplies detailed information about the functioning of processes, which will allow managers to both effectively oversee operations, as well as assess their prospective and ongoing risks of execution.
Volatility models of currency futures in developed and emerging markets
Authors: John M. Sequeira, Pang Chia Chiat, Michael McAleer
Venue: Mathematics and Computers in Simulation (2004)

This paper examines volatility models of currency futures contracts for three developed markets and two emerging markets. For each contract, standard models of the Unbiased Expectations Hypothesis (UEH) and Cost-of-Carry hypothesis (COC) are extended to derive volatility models corresponding to each of the two standard approaches. Each volatility model is formulated as a system of individual equations for the conditional variances of futures returns, spot returns and the domestic risk-free interest rate. The empirical results suggest that the conditional volatility of futures returns for emerging markets is significant in explaining the conditional volatility of returns in the underlying spot market. For developed markets, however, the conditional volatility of the spot returns is significant in explaining the conditional volatility of futures returns. Moreover, it is found that the domestic risk-free interest rate has little impact on the conditional variances of the futures, spot and domestic risk-free interest rates.
An error model of circular curve features in GIS
Authors: Xiaohua Tong, Wenzhong Shi, Dajie Liu
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

In this paper, a new error model to describe circular curve features in GIS is presented. In the model, the error of a circular curve feature can be described by two methods. In the first method, the error is described by the root mean square error in the normal direction of the circular curve. In the second method, the error is indicated by the maximum distance between the curve feature and the error ellipse. The two methods are tested through case studies, and the results are analyzed.
Changes in input resistance of pacemaker cells provide safety factors for automaticity in human and rabbit sinoatrial node: high performance computational modeling study
Authors: Christopher Stephen Ochmen
Venue:  (2003)

The sinoatrial node is a region of cardiac tissue which triggers rhythmic beating of the heart. This tissue must fire in a concerted and organized pattern to result in proper contraction of the cardiac muscle. This firing results from the ability of some of the cells in the sinoatrial node to rhythmically pace on their own. These pacemaker cells must be able to excite nonpacing cells and each other to their firing threshold to achieve the desired conduction patterns. A computational modeling platform was created to investigate the role of pacemaker and nonpacing cells in the sinoatrial node of rabbit and human based on physiologically realistic models of the individual cells found in the sinoatrial node. Model sinoatrial node tissues were constructed using randomly distributed models of 1000 pacemaker and atrial cells with resistive coupling junctions between abutting cells. These models required approximately 1&ndash;4 hours to run using 10 processors in a Linux cluster environment. Results from this modeling study show that: (1) novel safety factors for maintaining automaticity in pacing tissue include changes in input resistance during upstroke, repolarization, and diastolic depolarization; (2) though repolarization is fundamentally different in human and rabbit atrium, changes in input resistance of pacing cells provide the same safety factors for automaticity; and, (3) bifurcation analysis demonstrated that both human and rabbit models require greater gap junction conductance and/or a higher pacemaker/atrial cell ratio for normal conduction.**This dissertation is multimedia (contains text and other applications not available in printed format). The CD requires the following system requirements: Adobe Acrobat; Windows MediaPlayer or RealPlayer; Microsoft Office.
Early and accurate analysis of SoCs: oxymoron or real?
Authors: Reinaldo A. Bergamaschi
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

This presentation discusses the major problems in doing early estimation of various design metrics in systems-on-chip (SoC) design, and explains why early and accurate are usually contradictory terms. It then describes a tool for early estimation and analysis of SoCs which is capable of quickly evaluating cross-domain effects between component selection, architectural decisions, floorplanning, wiring estimation and die size prediction.
The effectiveness of computer-assisted instruction in statistics education: a meta-analysis
Authors: Yung-Chen Hsu
Venue:  (2003)

The purpose of this study was to investigate the effectiveness of computer-assisted instruction (CAI) in statistics education at the college level in the United States. This study employed meta-analysis to integrate the findings from 25 primary studies which met a specific set of criteria. The primary studies were selected from journal articles, ERIC documents, and dissertations. Results of the meta-analysis produced an overall effect size estimate of 0.43, indicating a small to medium positive effect of applying CAI in teaching college-level introductory statistics on students' achievement. Several study characteristics were examined for the association with the effect magnitude. These characteristics included the publication year, the publication source, the educational level of participants, the mode of the CAI program, the type of CAI program, the level of interactivity of the CAI program, the instructional role of the CAI program, and the sample size. The results of the analogous analysis of variance showed that different modes of CAI programs produced significantly different effects on students' achievement in learning statistics. Expert systems and drill-and-practice programs were the most effective modes and were followed by multimedia, tutorials, and simulations. Computational statistical packages and web-based programs were the least effective modes. The teacher-made CAI programs were significantly more effective than the commercially-developed CAI programs. The effectiveness of CAI program in teaching statistics did not differ significantly according to the study characteristics of the publication year, the publication source, the educational level of participants, the level of interactivity of CAI program, the instructional role of CAI program, and the sample size.
Detecting and Locating Faults in VLSI Implementations of the Advanced Encryption Standard
Authors: Guido Bertoni, Luca Breveglieri, Israel Koren, Paolo Maistri, Vincenzo Piuri
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Concurrent fault detection for hardware implementations of the Advanced Encryption Standard (AES) may provide protection against random faults, and against an attacker who may maliciously inject faults in order to find the encryption secret key. We have recently developed such a scheme which is based on the parity code. In this paper we prove that the parity-based code detects all odd-order faults and allows the location of the most single transient and permanent faults.
A Note on Counting Very Different Sequences
Authors: Emanuela Fachini, János Körner
Venue: Combinatorics, Probability and Computing (2001)

We strengthen the Cohen&ndash;K&ouml;rner&ndash;Simonyi upper bound on counting &lsquo;very different sequences&rsquo;.
Supporting real-time visualization with the HDoV tree
Authors: Lidan Shou, Zhiyong Huang, Kian-Lee Tan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We propose the Hierarchical Degree-of-Visibility (HDoV) tree to support real-time visualization of large VEs. Each node in an HDoV tree represents a spatial region in the scene, and contains a precomputed Degree-of-Visibility value. In run-time, the DoV values can be used to update rapidly the DoV of each node when the viewing region changes. Each node is also associated with the LODs of the object(s). We propose two techniques to traverse the HDoV tree for real-time visualization. We also propose a method to compute the degree of visibility. We report experimental results of a prototype implementation that show the effectiveness of the proposed techniques.