ppxscal/embedding_network huggingface dataset:
Development of an Effective Remote Interactive Laboratory for Online Internetworking Education
Authors: Shyamala C. Sivakumar, William Robertson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The Faculty of Engineering at Dalhousie University, Halifax, Canada has been offering a Master's degree program in Internetworking since 1997. The program also provides comprehensive "hands-on" laboratory experience in configuring, maintaining, troubleshooting and simulating networks. The university intends to increase its student base through online education retaining the same quality of interactions as the onsite program. In the online context, the design and the implementation of an effective remote interactive laboratory (RIL)environment is highly challenging on account of the special hardware, simulation and computing needs of the Internetworking courses. This paper focuses on translating the onsite laboratory elements into the online RIL environment by allowing students at geographically remote sites to access and interact with internetworking devices located at Halifax. The RIL isdevised using de-facto networking standards, free software and commercial Internet browser. Real-time interaction and information transfer with the Halifax site are achieved independent of the technology available to the remote student. The RIL design and delivery mechanism are tailored to i) provide a constructivist pedagogical approach ii) model a collaborative learning environment for group interaction iii) match the characteristics of the delivery media to specific learning processes (media-synchronicity theory) including the provision of unambiguous feedback and guidance iv) assign appropriate instructional roles and v) determine desirable student competency outcomes; all in a remote learning context. A 4-tier role architectureconsisting of faculty, facilitators at both local and remote sites and students, has been determined appropriate and adapted to maintain academic integrity and offer the same quality of interaction as the onsite program.
Scan-Based BIST Diagnosis Using an Embedded Processor
Authors: Kedarnath J. Balakrishnan, Nur A. Touba
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

For system-on-chip designs that contain an embedded processor, this paper present a software based diagnosis scheme that can make use of the processor to aid in diagnosis in ascan-based built-in self-test (BIST) environment. The diagnosis scheme can be used to determine both the scan cells that capture errors as well as the failing test vectors during aBIST session thereby allowing a faster and more precise diagnosis. The BIST session needs to be run only once for diagnosis. The scheme is based on pseudo-random linear compaction of the output response bits. The proposed scheme uses word based linear operations that can be implemented very fast and efficiently on the embedded processor. Experimental results indicate that the proposed scheme is very powerful in identifying the failing test vectors and performs better than previous methods both in terms of the suspect set size and the accuracy of diagnosis.
Involutions of Connected Binary Matroids
Authors: Joseph E. Bonin
Venue: Combinatorics, Probability and Computing (2000)

We prove that if an involution &phi; is an automorphism of a connected binary matroid M then there is a hyperplane of M that is invariant under &phi;. We also consider extensions of this result for higher connectivity.
Computing Acoustic Waves in an Inhomogeneous Medium of the Plane by a Coupling of Spectral and Finite Elements
Authors: Salim Meddahi, Antonio Márquez, Virginia Selgas
Venue: SIAM Journal on Numerical Analysis (2003)

In this paper we analyze a Galerkin procedure, based on a combination of finite and spectral elements, for approximating a time-harmonic acoustic wave scattered by a bounded inhomogeneity. The finite element method used to approximate the near field in the region of inhomogeneity is coupled with a nonlocal boundary condition, which consists in a linear integral equation. This integral equation is discretized by a spectral Galerkin approximation method.We provide error estimates for the Galerkin method, propose fully discrete schemes based on elementary quadrature formulas, and show that the perturbation due to this numerical integration gives rise to a quasi-optimal rate of convergence. We also suggest a method for implementing the algorithm using the preconditioned GMRES method and provide some numerical results.
Insights from the aphasia project: designing technology for and with people who have aphasia
Authors: Joanna McGrenere, Rhian Davies, Leah Findlater, Peter Graf, Maria Klawe, Karyn Moffatt, Barbara Purves, Sarah Yang
Venue: Proceedings of the 2003 conference on Universal usability (2003)

This paper explores a number of HCI research issues in the context of the Aphasia Project, a recently established project on the design of assistive technology for aphasic individuals. Key issues include the problems of achieving effective design and evaluation for a user population with an extremely high degree of variance, and user-centered design for a user population with significant communication impairments. We describe the Aphasia Project and our initial approaches to dealing with these issues. Similar issues arise in many areas of assistive technology, so we expect our paper to be of general interest to the research community.
Interface design issues in the MEDIALOG&trade; project
Authors: Claude Chapdelaine, Raymond Descout, Pierre Billon
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Traditionally, ergonomic activities were mainly aimed at producing human factors evaluation for existing systems or prototypes. Nowadays, more and more ergonomists are involved at the design level. In MEDIALOG&trade; [1] prototype, our approach was to elaborate different scenarios covering all the functionality needed to undertake a consultation of multimedia documents. Later, groups of users will test the usability of the assumptions designed.This paper describes how the scenario approach helped us to outline characteristics of the interaction between the user and the service, and how these characteristics were translated into design requirements for the document production system. This approach allowed us not only to provide a common understanding of the service for the development team, but also to propose a "MEDIALOG Look and Feel" implemented on top of the Windows&trade; environment.Our goal is to develop a better user-centered design approach for non-existing application and to experiment these approaches in the context of multimedia.
VLSI: placement based on routing and timing information
Authors: J. Garbers, B. Korte, H. J. Prömel, E. Schwietzke, A. Steger
Venue: Proceedings of the conference on European design automation (1990)

In this paper we propose a hierarchical placement procedure incorporating more and more detailed routing and timing information at increasing levels of the hierarchy. This procedure is based on the well-known min-cut method. A global routing and a timing analysis are computed after every cut and are used to guide the subsequent cell partitioning.
An Information System Architectural Framework for Enterprise Application Integration
Authors: André Vasconcelos, Miguel Mira da Silva, António Fernandes, José Tribolet
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Information system (IS) architectures have not paid enough attention to integration in the past because integration was not important to build ISs from scratch. However, with the variety and number of ISs in medium/large organizations increasing, including ERP systems, the need for integration is bigger than ever. Furthermore, most organizations now want to integrate their ISs with those belonging to other organizations. In this paper we propose an extension to our previous proposals for representing IS architectures in order to properly support a large variety of integration scenarios between IS, including intra and inter organizations. In particular we support manual and automatic, synchronous and asynchronous integration. We also present an example to illustrate the proposal with real world IS integration needs.
A Fairer Multiple Access Protocol for Multi-hop Wireless Networks: Hybrid Asynchronous Time Division Multiple Access Protocol (HATDMA)
Authors: Jun He, Hung Keng Pung
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper, we investigate fairness properties ofMAC protocols in multi-hop ad-hoc networks that haveidentical ranges of communication, interference andcarrier sensing. We propose a new MAC protocol - hybridasynchronous time division multiple access (HATDMA).The proposed protocol contains two schemes: SI-RIhybrid scheme and ATDMA scheme. The hybrid schemeemploys both sender-initiated (SI) and receiver-initiated(RI) collision avoidance mechanisms and adaptivelychooses one of them to use based on the observedperformance. The ATDMA scheme requires a flow justgetting a successful transmission to suspend the nexttransmission for a period of time that is derived from thetraffic load observed around the flow. Comprehensivesimulations show that HATDMA can yield high aggregatethroughput and at the same time achieve very goodfairness.
Strategic and Operational Benefits of Electronic Integration in B2B Procurement Processes
Authors: Tridas Mukhopadhyay, Sunder Kekre
Venue: Management Science (2002)

Our goal is to assess the strategic and operational benefits of electronic integration for industrial procurement. We conduct a field study with an industrial supplier and examine the drivers of performance of the procurement process. Our research quantifies both the operational and strategic impacts of electronic integration in a B2B procurement environment for a supplier. Additionally, we show that the customer also obtains substantial benefits from efficient procurement transaction processing. We isolate the performance impact of technology choice and ordering processes on both the trading partners. A significant finding is that the supplier derives large strategic benefits when the customer initiates the system and the supplier enhances the system's capabilities. With respect to operational benefits, we find that when suppliers have advanced electronic linkages, the order-processing system significantly increases benefits to both parties.
Iannis Xenakis: a composer's perspective
Authors: David Worrall
Venue: Organised Sound (2001)

Although music uses sound as its medium of conveyance, music is not just sound. Although musical structures rely on the acoustics of sound-generating devices (instruments) and conveyances (concert halls, loudspeakers) and on the way the body senses the sound waves generated and transformed by these (psychoacoustics), theories of musical composition can work both with and against these principles. Music is involved in sonic discourse, sonic rhetoric, if you will, and history shows us that because of this it is a sociocultural phenomenon which reflects the times in which it is composed.
Temporal event clustering for digital photo collections
Authors: Matthew Cooper, Jonathan Foote, Andreas Girgensohn, Lynn Wilcox
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present similarity-based methods to cluster digital photos by time and image content. The approach is general, unsupervised, and makes minimal assumptions regarding the structure or statistics of the photo collection. We present results for the algorithm based solely on temporal similarity, and jointly on temporal and content-based similarity. We also describe a supervised algorithm based on learning vector quantization. Finally, we include experimental results for the proposed algorithms and several competing approaches on two test collections.
Imperfections in Random Tournaments
Authors: A. D. Barbour, Anant P. Godbole, Jinghua Qian
Venue: Combinatorics, Probability and Computing (1997)

A tournament T on a set V of n players is an orientation of the edges of the complete graph Kn on V; T will be called a random tournament if the directions of these edges are determined by a sequence {Yj&ratio;j = 1, &hellip;, (n2)} of independent coin flips. If (y, x) is an edge in a (random) tournament, we say that y beats x. A set A &sub; V, &#x007C;A&#x007C; = k, is said to be beaten if there exists a player y &notin; A such that y beats x for each x &isin; A. If such a y does not exist, we say that A is unbeaten. A (random) tournament on V is said to have property Sk if each k-element subset of V is beaten. In this paper, we use the Stein&ndash;Chen method to show that the probability distribution of the number W0 of unbeaten k-subsets of V can be well-approximated by that of a Poisson random variable with the same mean; an improved condition for the existence of tournaments with property Sk is derived as a corollary. A multivariate version of this result is proved next: with Wj representing the number of k-subsets that are beaten by precisely j external vertices, j = 0, 1, &hellip;, b, it is shown that the joint distribution of (W0, W1, &hellip;, Wb) can be approximated by a multidimensional Poisson vector with independent components, provided that b is not too large.
High level test generation using data flow descriptions
Authors: Kaushik Roy, Jacob A. Abraham
Venue: Proceedings of the conference on European design automation (1990)

To significantly expedite the test generation process for sequential VLSI circuits, the hierarchy in the circuit descriptions should be exploited. Conventional test generators can provide tests for relatively small modules, which are typically embedded in large circuits. This paper considers test generation for complex VLSI circuits composed of many interconnected modules. In contrast to the previous approaches, we use high level primitives and data flow descriptions to perform hierarchical test generation. Data flow descriptions provide the set of valid control signals to be activated for a particular data path to be active. Sequential propagation and justification of signals is carried out recursively. Results are presented based on an implementation of the algorithm in LISP on a Texas Instruments Explorer.
Prospects and challenges for multi-relational data mining
Authors: Pedro Domingos
Venue: ACM SIGKDD Explorations Newsletter (2003)

This short paper argues that multi-relational data mining has a key role to play in the growth of KDD, and briefly surveys some of the main drivers, research problems, and opportunities in this emerging field.
GS3: scalable self-configuration and self-healing in wireless sensor networks
Authors: Hongwei Zhang, Anish Arora
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We present GS3, a distributed algorithm for scalable self-configuration and self-healing in multi-hop wireless sensor networks. The algorithm enables network nodes in a 2D plane to configure themselves into a cellular hexagonal structure where cells have tightly bounded geographic radius and the overlap between neighboring cells is low. The structure is self-healing under various perturbations, such as node joins, leaves, deaths, movements, and state corruptions. For instance, the structure slides as a whole if nodes in many cells die at the same rate. Moreover, its configuration and healing are scalable in three respects: first, local knowledge enables each node to maintain only limited information with respect to a constant number of nearby nodes; second, local self-healing guarantees that all perturbations are contained within a tightly bounded region with respect to the perturbed area and dealt with in the time taken to diffuse a message across the region; third, only local coordination is needed in both configuration and self-healing.
Engineering signal processing in cells: Towards molecular concentration band detection
Authors: Subhayu Basu, David Karig, Ron Weiss
Venue: Natural Computing: an international journal (2003)

We seek to couple protein-ligand interactions with synthetic gene networks in order to equip cells with the ability to process internal and environmental information in novel ways. In this paper, we propose and analyze a new genetic signal processing circuit that can be configured to detect various chemical concentration ranges of ligand molecules. These molecules freely diffuse from the environment into the cell. The circuit detects acyl-homoserine lactone ligand molecules, determines if the molecular concentration falls within two prespecified thresholds, and reports the outcome with a fluorescent protein. In the analysis of the circuit and the description of preliminary experimental results, we demonstrate how to adjust the concentration band thresholds by altering the kinetic properties of specific genetic elements, such as ribosome binding site efficiencies or dna-binding protein affinities to their operators.
An all-scale anelastic model for geophysical flows: dynamic grid deformation
Authors: Joseph M. Prusa, Piotr K. Smolarkiewicz
Venue: Journal of Computational Physics (2003)

We have developed an adaptive grid-refinement approach for simulating geophysical flows on scales from micro to planetary. Our model is nonoscillatory forward-in-time (NFT), nonhydrostatic, and anelastic. The major focus in this effort to date has been the design of a generalized mathematical framework for the implementation of deformable coordinates and its efficient numerical coding in a generic Eulerian/semi-Lagrangian NFT format. The key prerequisite of the adaptive grid is a time-dependent coordinate transformation, implemented rigorously throughout the governing equations of the model. The transformation enables mesh refinement indirectly via dynamic change of the metric coefficients, while retaining advantages of Cartesian mesh calculations (speed, low memory requirements, and accuracy) conducted fully in the computational domain. Diverse test results presented in this paper - simulations of a traveling stratospheric inertio-gravity-wave packet (with numerically advected dense-mesh region) and an idealized climate of the Earth (with analytically prescribed adaptive transformations) - demonstrate the potential and the efficacy of the new deformable grid model for tracing targeted flow features and dynamically adjusting to prescribed undulations of model boundaries.
A library for visualizing combinatorial structures
Authors: Marc A. Najork, Marc H. Brown
Venue: Proceedings of the conference on Visualization '94 (1994)

This paper describes ANIM3D, a 3D animation library targeted at visualizing combinatorial structures. In particular, we are interested in algorithm animation. Constructing a new view for an algorithm typically takes dozens of design iterations, and can be very time-consuming. Our library eases the programmer's burden by providing high-level constructs for performing animations, and by offering an interpretive environment that eliminates the need for recompilations. This paper also illustrates ANIM3D's expressiveness by developing a 3D animation of Dijkstra's shortest-path algorithm in just 70 lines of code.
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
Authors: Zihui Ge, Ping Ji, Jim Kurose, Don Towsley
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscribers based on a matching of subscribers interest in the published content provided ¿ a process we refer to as "matchmaking". Once an interest match has been made, content forwarding state can be installed at intermediate nodes (e.g., active routers, application-level relay nodes) on the path between a content provider and an interested subscriber. In dynamic pub/sub applications, where published content and subscriber interest change frequently, the signaling overhead needed to perform matchmaking can be a significant overhead. We first formalize the matchmaking process as an optimization problem, with the goal of minimizing the amount of matchmaking signaling messages. We consider this problem for both shared and per-source multicast data (content) distribution topologies. We characterize the fundamental complexity of the problem, and then describe several efficient solution approaches. The insights gained through our analysis are then embodied in a novel Active Matchmaker Signaling Protocol (AMSP). AMSP dynamically adapts to applications' changing publication and subscription requests through a link-marking approach. We simulate AMSP and two existing broadcast-based approaches for conducting matchmaking, and findthat AMSP significantly reduces signaling overhead.
Adding reality to team projects: e-business consulting for small business entities
Authors: Sharon W. Tabor
Venue: Current issues in IT education (2003)

While hiring companies consistently emphasize the importance of communication and team skills for new IT graduates, students consistently emphasize their dislike for academic team projects. In an effort to make the team project a more interesting and valuable experience, an upper-division e-commerce course at Boise State University includes the development of prototype sites for actual businesses. In addition to concepts, strategies, and technical tools, students learn transferable consulting skills and improve necessary team skills. These skills groups are applied to real-world business problems, resulting in successful team experiences for the students and expanded horizons for the participating businesses. Part of the success is attributable to well-defined expectations, team-building exercises, and a structured client engagement process that serves the needs of the businesses as well as the student teams.
Recognizing movements from the ground reaction force
Authors: Robert Headon, Rupert Curwen
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

This paper presents a novel approach to movement recognition, using the vertical component of a person's Ground Reaction Force (GRF). Typical primitive movements such as taking a step, jumping, drop-landing, sitting down, rising to stand and crouching are decomposed and recognized in terms of the GRF signal observed by a weight sensitive floor. Previous works focused on vision processing for movement recognition. This work provides a new sensor modality for a larger research effort, that of sentient computing, which is concerned with giving computers awareness of their environment and inhabitants.