ppxscal/embedding_network huggingface dataset:
A self-moderating peer-to-peer file system
Authors: A. H. Esfahanian, M. Mutka
Venue:  (2003)

Peer-to-peer systems have received much recent attention, starting with file sharing systems such as Napster and Gnutella, and developing into true file systems such as PAST and CFS. They demonstrate many benefits over central storage systems including fault tolerance and load balancing as well as using idle resources to provide service to others. A breakthrough in more recent peer-to-peer file systems was the advancement of lookup systems from centralized or broadcast-based search to directed search in which the number of queries is logarithmic in the number of nodes in the system. Most of the issues necessary to allow these systems to scale to internet-wide levels have been addressed: efficient lookups, file security, throughput performance, fault tolerance and reliability. However, one issue that has not been resolved in a true peer-to-peer manner is that of resource allocation. Early file sharing systems are notorious for their problems with free-riders, that is, users who consume but do not contribute resources. These systems have not provided any incentive for users to contribute other than by appealing to their sense of altruism. Later approaches involve central authorities, as in the case of PAST, with per-publisher quotas or, as in the case of CFS, simple per-internet address quotas. While these quota systems partially address denial-of-service attacks, they are still vulnerable to a user consuming far more than their &ldquo;fair&rdquo; share of resources. It is clearly desirable to develop a self-regulating peer-to-peer quota system that does not rely on any centralized trust or authority, yet still ensures a rigorous standard of fairness within the system.
A study of parameter tuning for term frequency normalization
Authors: Ben HE, Iadh Ounis
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Most current term frequency normalization approaches for information retrieval involve the use of parameters. The tuning of these parameters has an important impact on the overall performance of the information retrieval system. Indeed, a small variation in the involved parameter(s) could lead to an important variation in the precision/recall values. Most current tuning approaches are dependent on the document collections. As a consequence, the effective parameter value cannot be obtained for a given new collection without extensive training data. In this paper, we propose a novel and robust method for the tuning of term frequency normalization parameter(s), by measuring the normalization effect on the within document frequency of the query terms. As an illustration, we apply our method on Amati \& Van Rijsbergen's so-called normalization 2. The experiments for the ad-hoc TREC-6,7,8 tasks and TREC-8,9,10 Web tracks show that the new method is independent of the collections and able to provide reliable and good performance.
An Entropy Approach to the Hard-Core Model on Bipartite Graphs
Authors: Jeff Kahn
Venue: Combinatorics, Probability and Computing (2001)

We use entropy ideas to study hard-core distributions on the independent sets of a finite, regular bipartite graph, specifically distributions according to which each independent set I is chosen with probability proportional to &lambda;&#x2223;I&#x2223; for some fixed &lambda; > 0. Among the results obtained are rather precise bounds on occupation probabilities; a &lsquo;phase transition&rsquo; statement for Hamming cubes; and an exact upper bound on the number of independent sets in an n-regular bipartite graph on a given number of vertices.
Conceptual design and analysis by sketching
Authors: H. Lipson, M. Shpitalni
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The ability of a CAD system to perceive a three-dimensional model depicted in a single freehand sketch presents the practical possibility of bringing numerous established analysis tools into the early stages of design to institute conceptual analysis. In this article we hypothesize that the key to enabling systems to reason and communicate about conceptual design is the language of sketching. We explore this approach, outline the basic algorithms required, and provide several examples of an implemented system.
Two-Connected Networks with Rings of Bounded Cardinality
Authors: B. Fortz, M. Labbé
Venue: Computational Optimization and Applications (2004)

We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb&eacute; and Maffioli (Operations Research, vol. 48, no. 6, pp. 866&ndash;877, 2000).In this paper, we compute a lower bound on the number of edges in a feasible solution, we show that the problem is strongly NP-complete for any fixed K, and we derive a new class of facet defining inequalities. Numerical results obtained with a branch-and-cut algorithm using these inequalities show their effectiveness for solving the problem.
Numerical scheme approximating solution and parameters in a beam equation
Authors: Robert R. Ferdinand
Venue: Journal of Computational and Applied Mathematics (2003)

We present a mathematical model which describes vibration in a metallic beam about its equilibrium position. This model takes the form of a nonlinear second-order (in time) and fourth-order (in space) partial differential equation with boundary and initial conditions. A finite-element Galerkin approximation scheme is used to estimate model solution. Infinite-dimensional model parameters are then estimated numerically using an inverse method procedure which involves the minimization of a least-squares cost functional. Numerical results are presented and future work to be done is discussed.
Some definitions, protocols and proofs about secure authentication
Authors: Charles Rackoff
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

We illustrate the "computational complexity" approach towards defining the goals of security protocols, and proving protocols meet those goals.
Webspace Surfing Patterns and Their Impact on Web Prefetching
Authors: Javed I. Khan, Qingping Tao
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The paper presents an interesting study that how theuser surfing behavior with respect to the organizationof a Web space affects the performance of a prefetchenabled proxy. We have conducted experiments basedon a novel hyperspace aware prefetch proxy and havestudied the prefetch performance on tree and completegraph. The study assesses the system's responsivenessas well as the background loads for various userinteraction duration, surfing and prefetch sequences.The results show that awareness about the Web spaceand surfing sequence can greatly help in improvingprefetch performance. Schemes such as these alsoconversely may enable professional content developersto create prefetch friendly collection for increased siteresponsiveness.
No-hole L(2,1)-colorings
Authors: Peter C. Fishburn, Fred S. Roberts
Venue: Discrete Applied Mathematics (2003)

An L(2,1)-coloring of a graph G is a coloring of G's vertices with integers in {0,1,...,k} so that adjacent vertices' colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2,1)-coloring as a coloring. The span λ(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is λ(G), and the hole index ρ(G) of G is the minimum number of colors in {0, 1,...,λ(G)} not used in a span coloring. We say that G is full-colorable if ρ(G) = 0. More generally, a coloring of G is a no-hole coloring if it uses all colors between 0 and its maximum color. Both colorings and no-hole colorings were motivated by channel assignment problems. We define the no-hole span µ(G) of G as ∞ if G has no no-hole coloring; otherwise µ(G) is the minimum k for which G has a no-hole coloring using colors in {0, 1,....,k}.Let n denote the number of vertices of G, and let Δ be the maximum degree of vertices of G. Prior work shows that all non-star trees with Δ ≥ 3 are full-colorable, all graphs G with n=λ(G)+ 1 are full-colorable, µ(G) ≤ λ(G)+ ρ(G) if G is not full-colorable and n ≥ λ(G) + 2, and G has a no-hole coloring if and only if n ≥ λ(G) + 1. We prove two extremal results for colorings. First, for every m ≥ 1 there is a G with ρ(G) = m and µ(G)=λ(G) + m. Second, for every m ≥ 2 there is a connected G with λ(G) = 2m, n = λ(G) + 2 and ρ(G) = m.
DFuse: a framework for distributed data fusion
Authors: Rajnish Kumar, Matthew Wolenetz, Bikash Agarwalla, JunSuk Shin, Phillip Hutto, Arnab Paul, Umakishore Ramachandran
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Simple in-network data aggregation (or fusion) techniques for sensor networks have been the focus of several recent research efforts, but they are insufficient to support advanced fusion applications. We extend these techniques to future sensor networks and ask two related questions: (a) what is the appropriate set of data fusion techniques, and (b) how do we dynamically assign aggregation roles to the nodes of a sensor network. We have developed an architectural framework, DFuse, for answering these two questions. It consists of a data fusion API and a distributed algorithm for energy-aware role assignment. The fusion API enables an application to be specified as a coarse-grained dataflow graph, and eases application development and deployment. The role assignment algorithm maps the graph onto the network, and optimally adapts the mapping at run-time using role migration. Experiments on an iPAQ farm show that, the fusion API has low-overhead, and the role assignment algorithm with role migration significantly increases the network lifetime compared to any static assignment.
Using departmental surveys to assess computing culture: quantifying gender differences in the classroom
Authors: Lisa Meeden, Tia Newhall, Doug Blank, Deepak Kumar
Venue: ACM SIGCSE Bulletin (2003)

Male and female students often hold different views of the culture within the same computer science department. These differences may, in part, account for why women are underrepresented in computer science. We found that surveying students about their views of our departments' environments was an important first step in evaluating the cultures of our own departments, in determining what issues needed to be addressed, and in determining how to address them. Our survey results revealed some problems in our classroom and lab environments, and showed that there are gender differences in students' perceptions of our departments. We describe a set of changes that were implemented in response to our findings. These solutions are specifically designed to address problems that we discovered through our student survey, but they are not all original to us. The contribution of our work is in demonstrating how surveying is critical to identifying and understanding problems in our departments. We argue that a process of continually surveying students is vital to the maintenance and evolution of a healthy computer science program.
A Framework for Executing Parallel Simulation Using RTI
Authors: Zijing Yuan, Wentong Cai, Malcolm Yoke Hean Low
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

The Grid enables large-scale resource sharing and makes it viable for running large-scale parallel and distributed simulations. The High Level Architecture (HLA) paradigm provides a software platform and interoperability interface for simulation components to utilize these hardware resources. However, neither the Grid nor the HLA provides mechanism for resourcemanagement for parallel and distributed simulations. It is also noticed that substantial effort is required for writing program that conforms to the Runtime Infrastructure (RTI) requirements because of its complexity. In this paper, we introduce a framework for designing and executing parallel simulation using the RTI. The framework is also designed to assist load balancing and checkpointing. With the code library from our framework, the modeler is able to complete the design of a parallel simulation that runs on RTI by specifying the simulation configuration and the handling detail of each event. Our framework incorporates automaticcode generation. It also uses Data Distribution Management to route simulation events (interactions) to achieve efficient use of network bandwidth.
Ian Fredericks in interview: ideas of an Australian spatial synthesis and mixed media innovator
Authors: Andrew D. Lyons
Venue: Organised Sound (2001)

Ian Fredericks played a prominent role in the development of Australian electronic music and mixed media composition from the mid 1970s until 2001. His work in establishing both the SEUSS electronic music studio at Sydney University and the subsequent founding of the computer music and audio-visual composition and performance group watt with Martin Wesley-Smith in 1976, paved the way for the generations of artists that have since explored this field. The author presents lightly edited excerpts from the last interview with Ian Fredericks before his passing on 15 March 2001.
Attack Signature Matching and Discovery in Systems Employing Heterogeneous IDS
Authors: Nathan Carey, George Mohay, Andrew Clark
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Over the past decade, Intrusion Detection Systems(IDS) have improved steadily in the efficiency andeffectiveness with which they detect intrusive activity. Thisis particularly true with signature-based IDS due toprogress with intrusion analysis and intrusion signaturespecification. At the same time system complexity, overallnumbers of bugs and security vulnerabilities have been onthe increase. This has led to the recognition that in orderto operate over the entire attack space, multipleheterogeneous IDS must be used, which need tointeroperate with one another, and possibly also withother components of system security. This paper describesour research into developing algorithms for attacksignature matching for detecting multi-stage attacksmanifested by alerts from heterogeneous IDS. It describesalso the testing and preliminary results of that research,and the administrator interface used to analyze the alertsproduced by the tests and the results of signaturematching.
Novel Ethernet Based Optical Local Area Networks for Computer Interconnection
Authors: Igor Radovanovic, Wim van Etten, Robert O. Taniman, Ronny Kleinkiskamp
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper we present new optical local area networksfor fiber-to-the-desk application. Presented networksare expected to bring a solution for having opticalfibers all the way to computers. To bring the overallimplementation costs down we have based our networkson short-wavelength optical components, multimode opticalfibers, multimode polymer-based integrated-opticdevices and widely used Fast Ethernet protocol. A newPhysical Layer Device that can be attached to the existingnetwork interface card has been developed andimplemented such that computers can exchange datausing our new networks.
Low Power Combinational Circuit Synthesis targeting Multiplexer based FPGAs
Authors: D. Satyanarayana, Santanu Chattopadhyay, Jakki Sasidhar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Low power circuits are emerging as an important application domain, and synthesis for low poweris demanding attention.Technology decompositionschemes often ignore the fact that certain circuit elementscan be mapped more efficiently by treating themseparately during decomposition.Multiplexers are onesuch category of circuit elements.Mapping them usingmultiplexers in technology libraries has many advantages.The aim of this work is to exploit the potentialof the multiplexers and decompose a combinationalcircuit targeting a reduction in the power consumptionby the circuit.A technology mapping of thisdecomposed circuit onto the Actel's FPGA architecture,further reducing the power consumption, is alsopresented.The experimental results show on an averageof over 55% reduction in power consumption overthe SIS approach.
An aggregation-based method for the exact analysis of a class of GI/G/1-type processes
Authors: Alma Riska, Evgenia Smirni, Gianfranco Ciardo
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

We present an aggregation-based algorithm for the exact analysis of Markov chains with GI/G/1-type pattern in their repetitive structure, i.e., chains that exhibit both M/G/1-type and GI/M/1-type patterns and cannot be solved with existing techniques. Markov chains with a GI/G/1 pattern result when modeling open systems with faults/repairs that accept jobs from multiple exogenous sources. Our method provides exact computation of the steady state probabilities, and allows computation of performance measures of interest including the system queue length or any of its higher moments, the exact probability of system failures and repairs, and consequently a host of performability measures. Our algorithm also applies to systems that are purely of the M/G/1-type or the GI/M/1-type, or their intersection, i.e., quasi-birth-death processes.
Educative Distributed Virtual Environments For Children
Authors: Jean-Pierre Gerval, Dorin-Mircea Popovici, Jacques Tisseau
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This paper presents a distributed virtual realityenvironment for children. This virtual environmentsupports cooperation among members of a dispersedteam engaged in a concurrent context. The virtualenvironment maintains a shared information spacedescribed in a standard Virtual Reality ModelingLanguage (VRML) format. Users are allowed to interactand to give decisions using cooperative mechanisms. Auser-friendly interface enables teachers to create theirown stories that fit with children pedagogicalrequirements and generates new virtual environmentsaccording to teacher's specifications. The implementationis based on DeepMatrix as environment server, VRMLand Java as languages and Cortona VRML plug-in fromParallelGraphics. It is actually running on the Internet:http://www.enib.fr/eve
WebFrame: a Multi-Phase Reconfigurable Middleware Platform
Authors: Fan Guochuang, Chen An, Zhang Wenbo, Huang Tao
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Web application servers (WASs) are middleware platforms for deployment and execution of component-based web applications. To cater for an increasingly diverse range of QoS demands, WAS must be capable of adaptation during execution to modify itself and to respond to changing conditions in its external environment. To accommodate such changes, WAS should provide both deployment-time configurability and run-time reconfigurability. Unfortunately, most of the mainstream web application servers adopt a monolithic architecture and "black box" philosophy to their design, and fail to properly address such requirements. In our point of view, adaptation and reconfigurability of WASs should be available at any time of the whole lifecycle. In this paper, a middleware architecture (WebFrame) that supports multi-phase adaptation using computational reflection, microkernel, and component techniques is proposed for web application servers. The architecture is structured into five layers. Both deployment-time configuration and run-time reconfiguration at multiple layers is supported in this architecture. The key insight to this work is the MService Reconfiguration design pattern, which provides dynamic adaptation at run time by swapping in/out the optional middleware components. The comparative evaluation of the performance impact of reflection and multi-phase reconfigurability on systems are given.
Techniques for visualizing website usage patterns with an adaptive neural network
Authors: Victor Perotti
Venue: Computing information technology: the human side (2003)

At any given Website, the flow of users' visitations represents a valuable source of information for Web professionals. However, the identification and interpretation of Web usage patterns is not necessarily an easy task. The sheer volume and complexity of the browsing patterns captured in the Website server logs makes understanding users a difficult, time-consuming task. The present chapter explores the use of an adaptive neural network to visualize the Website usage patterns. This visual representation supports the identification of clusters of Web pages that are frequently visited together by users. A Website designer can see, at a glance, the primary groups of Web pages that visitors browse. Further, the site structure can be readily compared to the usage clusters to measure how well the links at the Website support the actual use of the site.
Case study: volume rendering of pool fire data
Authors: H. E. Rushmeier, A. Hamins, M. Y. Choi
Venue: Proceedings of the conference on Visualization '94 (1994)

We describe how techniques from computer graphics are used to visualize pool fire data and computer radiative effects from pool fires. The basic tools are ray casting and accurate line integration using the RADCAL program. Example images in the visible and infrared band are shown which give qualitative insights about the fire data. Examples are given of irradiation calculations and novel methods to visualize the results of irradiation calculations.
The psychology of information modeling
Authors: Keng Siau
Venue: Advanced topics in database research vol. 1 (2003)

Information modeling is the cornerstone of information systems analysis and design. Information models, the products of information modeling, not only provide the abstractions required to facilitate communication between the analysts and end-users, but they also provide a formal basis for developing tools and techniques used in information systems development. The process of designing, constructing, and adapting information modeling methods for information systems development is known as method engineering. Despite the pivotal role of modeling methods in successful information systems development, most modeling methods are designed based on common sense and intuition of the method designers with little or no theoretical foundation or empirical evidence. Systematic scientific approach is missing! This chapter proposes the use of cognitive psychology as a reference discipline for information modeling and method engineering. Theories in cognitive psychology are reviewed in this chapter and their application to information modeling and method engineering is discussed.
GHz counting rate NbN single-photon detector for IR diagnostics of VLSI CMOS circuits
Authors: Alexander Korneev, A. Lipatov, O. Okunev, Galina Chulkova, K. Smirnov, Gregory Gol'tsman, J. Zhang, W. Slysz, A. Verevkin, Roman Sobolewski
Venue: Microelectronic Engineering (2003)

We present a new, simple to manufacture superconducting single-photon detector operational in the range from ultraviolet to mid-infrared radiation wavelengths. The detector combines GHz counting rate, high quantum efficiency and very low level of dark (false) counts. At 1.3-1.5 µm wavelength range our detector exhibits a quantum efficiency of 5-10%. The detector photoresponse voltage pulse duration was measured to be about 150 ps with jitter of 35 ps and both of them were limited mostly by our measurement equipment. In terms of quantum efficiency, dark counts level, speed of operation the detector surpasses all semiconductor counterparts and was successfully applied for CMOS integrated circuits diagnostics.