ppxscal/embedding_network huggingface dataset:
Automated laboratory artifact production
Authors: James Heliotis
Venue: Journal of Computing Sciences in Colleges (2004)

Well-designed laboratory experiments in computer science take experience and hard work. Unfortunately, deploying these labs is also a lot of work. Web pages or hard copies of instructions must be set up, grading guidelines and scoring sheets need to be created, etc. Later, if the lab changes or is redeployed in another course, many of these artifacts must be individually edited. This paper presents one approach to simplifying laboratory artifact production. The approach is based on the idea that all files, configurations, scripts, etc. should be generated from a small set of non-redundant documents that can easily be modified.
A jamming-based MAC protocol to improve the performance of wireless multihop ad-hoc networks: Research Articles
Authors: Shiang-Rung Ye, You-Chiun Wang, Yu-Chee Tseng
Venue: Wireless Communications Mobile Computing (2004)

One critical issue in multihop ad-hoc networks is the medium access control (MAC). The IEEE 802.11 MAC protocol is originally designed for fully connected, one-hop ad-hoc networks but not for multihop ad-hoc networks. In addition to the well known hidden-terminal problem, we found that IEEE 802.11 also suffers from an erroneous reservation problem which occurs when RTS-CTS exchange fails but the channel is incorrectly reserved. In this paper, we propose a jamming-based MAC (JMAC) protocol that is not only free from both the hidden-terminal and the erroneous reservation problems but also allows more concurrent transmission&#x002F;receipt activities for stations within each other's transmission range. The idea behind the JMAC is to separate source stations' traffic from destination stations' traffic into different channels (i.e. dividing the shared medium into two channels), and explicitly signal the channel status by jamming the channels. Simulation results show that although the channel division incurs some cost, the advantages of being free from the erroneous reservation and the hidden-terminal problems, and the benefits of more concurrent transmissions will compensate the cost and provide higher channel utilization when data frame size is median or large. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Improving heuristic function of cost-based abduction system using real-time heuristic search
Authors: Makoto Koshino, Tadashi Okamine, Haruhiko Kimura, Sadaki Hirose
Venue: Systems and Computers in Japan (2004)

Cost-based abduction, which can find a best explanation for a given observation by assuming some hypothesis, is an important framework of inference because it is applied to diagnosis, design, planning, natural language understanding, and so on. However, slow reasoning speed is a crucial drawback. In order to overcome this problem, previous work achieved an efficient system, and a search control technique of A&ast; search was introduced into cost-based abduction. However, the system has the problem that space complexity is very large because it has to store all of the many nodes. In this paper, we introduced real-time heuristic search by which the user can set up look-ahead depth and store only the best node. We also introduced a new heuristic function in order to inference successfully and speed up inconsistency processing. We examined the validity of our proposed method with a diagnostic problem of a logic circuit. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 89&ndash;97, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10254
Development and Evaluation of a Slicing-Based C++ Debugger
Authors: Winai Wichaipanitch, M. H. Samadzadeh, Songsri Tangsripairoj
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The main objective of this work was to develop a debugging tool for C++ programs called C++Debug that uses program slicing and dicing techniques. The incremental development started by including simple statements first and then adding pointers, structures, functions, and classes. In order for C++Debug to be more powerful, dynamic slicing rather than static slicing was chosen. The work included new algorithms that handle Class, Function, and Pointer in C++. In this paper, the overall architecture of C++Debug is presented and an overview of the algorithms devised for the debugger is discussed. The limitations of the tool are also listed and the results of a small-scale evaluation of the debugger is reported.
University Consortium for Industrial Numerical Analysis (UCINA)
Authors: S. McKee
Venue: ACM SIGNUM Newsletter (1981)

The University Consortium for Industrial Numerical Analysis (UCINA) was formed on the 1st October 1979 with Dr. Sean McKee as the Project Coordinator. UCINA represents a collaborative effort by numerical analysts and interested applied mathematicians of the Universities of Bath, Brunel, Oxford, Reading and Imperial College, with strong support from the Division of Numerical Analysis and Computing Sciences at the National Physical Laboratory, to help with the solution of practical problems in industry and relevant research laboratories and to stimulate new and relevant research in numerical analysis in the Universities. Funding is from the Science and Engineering Research Council (SERC) for three years in the first instance. Dr. McKee has a part-time secretary, a direct line (Oxford 513035) to and from the outside world and travel and secretarial expenses.
Efficient detection of discrepancies in multiple file copies
Authors: Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
Venue: Distributed Computing (1998)

For data consistency in distributed information systems, it is often necessary to compare remotely located copies of a file. We develop several protocols for the efficient detection of differing pages in a replicated file in different communication and failure models. The first set of protocols assumes a restricted but practical communication model. In this case, the minimum amount of communication necessary to identify any given number of differing pages is determined and a technique to attain this minimum is presented. For the more general communication model and for more refined failure models, we show that more efficient protocols can be derived. Our approach is based on the theory of Galois fields.
A new method for transferring CAN messages using wireless ATM
Authors: Ismail Erturk
Venue: Journal of Network and Computer Applications (2005)

Considering widespread use of controller area network (CAN) FieldBus communication systems in process control environments it is usually required to interconnect them. Remote CAN nodes in industrial applications, automation systems and military applications may need communicating with each other or a central management unit for several purposes such as exchanging time-critical information. Along with the wireless communication revolution, networking without wires will play a leading role in the industry affecting customers' strategies and implementation plans. Interconnection of remote CAN nodes in industrial real-time applications using wireless asynchronous transfer mode (WATM) will provide significant benefits to global system integration and control. This paper presents a new method describing fixed wireless CAN networking exploiting WATM as an over the air protocol. CAN over WATM mapping issues using encapsulation technique are explained. The performance analysis of the proposed scheme is presented through computer simulation results provided by OPNET Modeler. The results show that benefiting also from the ATM's QoS control mechanisms, different kind of CAN messages carrying various data source traffics are delivered within 100 ms arrival time deadline as required by the SAE benchmark.
HapticWalker---a novel haptic foot device
Authors: Henning Schmidt, Stefan Hesse, Rolf Bernhardt, Jörg Krüger
Venue: ACM Transactions on Applied Perception (TAP) (2005)

This paper presents a new haptic locomotion interface, which comprises two programmable foot platforms with permanent foot machine contact. It is designed as a scalable and modular system with unit-by-unit extensibility offering up to six plus one degrees of freedom (DOF) per foot. The basic setup comprises three DOF per foot in the sagittal plane.The machine is based on a rigid hybrid parallel-serial robot kinematics structure. It is equipped with electrical direct drive motors, enabling highly dynamic footplate motions. For contact force measurement, six DOF force/torque sensors are mounted under each foot platform. The system was developed for major application in gait rehabilitation, hence great importance was attached to the incorporation of maximum passive and active security measures for machine users and medical operating personnel.The simulator is able to perform walking trajectories with speeds of up to 5 km/h and 120 steps/min. The system is able to simulate not only slow and &ldquo;smooth&rdquo; trajectories like walking on an even floor, up/down staircases, but also foot motions like walking on rough ground or even stumbling or sliding, which require high system dynamics.The machine is controlled by a self-developed full-featured robot control whose soft and hardware is based on up-to-date industrial standards and interfaces. The robot control software is based on RTLinux and runs on an industrial PC. The real-time motion generator includes a newly developed Fourier-based algorithm for the interpolation of natural cyclic walking trajectories. For the implementation of asynchronous events (e.g., sliding, stumbling), the controller comprises especially developed algorithms for automatic motion override adaptation. Different modes of haptic behavior needed for gait rehabilitation, ranging from full foot support during swing phase to completely passive behavior, are currently under development.Intuitive and safe machine operation by nontechnical personnel such as clinicians and physiotherapists is achieved via a separate Windows-based graphical user interface software comprising different window areas for machine programming and operation, real-time off-line simulation and online data visualization in two and three dimensions has been developed as well.A working prototype of the system has been built and tested successfully, including all soft and hardware components. Although the machine has been designed and built for major application in gait rehabilitation, its range of applicability is not limited to this area. It could be integrated into any setup requiring a highly dynamic haptic foot interface and permanent foot machine contact if needed.
A clustering method for news articles retrieval system
Authors: Hiroyuki Toda, Ryoji Kataoka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Organizing the results of a search facilitates the user in overviewing the information returned. We regard the clustering task as the tasks of making labels for a list of items and we focus on news articles and propose a clustering method that uses named entity extraction.
Force Feedback Interface for Cell Injection
Authors: Anand Pillarisetti, Waqas Anjum, Jaydev P. Desai, Gary Friedman, Ari D. Brooks
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Manual pronuclei injection and intracytoplasmic sperm injection (ICSI) requires long training and has low success rates primarily due to poor control over the injection force. Consequently, there is a need for quantification of forces during biological cell injection and for an automated cell injection system, which can provide force feedback to the operator improving the success rate of the injection task. We have developed a force feedback interface, which has the capability of measuring forces in the range of µN-mN and provide a haptic display of the cell injection forces. The force sensor has been integrated with the biomanipulation system to detect forces in real time. Experiments were performed on two different varieties of egg cells to demonstrate the success in measuring forces in the range in µN-mN. Our experimental results indicate the cell puncturing forces were consistent and the operator was able to feel the cell injection forces.
Preliminary Modeling of Air Breakdown with the ICEPIC Code
Authors: A. E. Schulz, A. D. Greenwood, K. L. Cartwright, P. J. Mardahl, R. E. Peterkin,  Jr., N. Bruner, T. Genon1, T. P. Hughes, D. Welch
Venue: Proceedings of the 2004 Users Group Conference (2004)

Interest in air breakdown phenomena has recently been re-kindled with the advent of advanced virtual prototyping of radio frequency (RF) sources for use in high power microwave (HPM) weapons technology. Air breakdown phenomena are of interest because the formation of a plasma layer at the aperture of an RF source decreases the transmitted power to the target, and in some cases can cause significant reflection of RF radiation. Understanding the mechanisms behind the formation of such plasma layers will aid in the development of maximally effective sources. This paper begins with some of the basic theory behind air breakdown, and describes two independent approaches to modeling the formation of plasmas, the dielectric fluid model and the Particle in Cell (PIC) approach. Finally we present the results of preliminary studies in numerical modeling and simulation of breakdown.
Low Cost BIST for Static and Dynamic Testing of ADCs
Authors: Maria Gloria Flores, Marcelo Negreiros, Luigi Carro, Altamiro A. Susin, Felipe R. Clayton, Cristiano Benevento
Venue: Journal of Electronic Testing: Theory and Applications (2005)

This paper presents a low cost test method for the static and dynamic characterization of analog-to-digital converters. The method is suitable for implementation in a SoC environment, as a built-in self test (BIST) solution. In the proposed approach, noise is used as the test signal. Theory of operation and practical results demonstrating the effectiveness of the method for INL, DNL, THD and SINAD characterization are presented. The BIST surface overhead caused by the noise generator is only 7.4% of the ADC total area. The reduced number of data samples required allows a reduction of about 7.5× in test time, in comparison to the histogram method.
Behind the curtain: lessons learned from a Wizard of Oz field experiment
Authors: Kevin F. White, Wayne G. Lutters
Venue: ACM SIGGROUP Bulletin (2003)

Large scale, organization-wide groupware systems are high risk development efforts. Requirements gathering and early evaluation are constrained by the need for the system to attain a critical mass of users and content. One approach to mitigate this risk is to employ Wizard of Oz style system simulations during the requirements gathering phase. While this method has historically been used to test quasi-functional system prototypes, we have found it to be a useful method for assessing organizational feasibility. After introducing this adaptation of the Wizard of Oz method, our approach is grounded with a case study in which it is was successfully used as a proof-of-concept requirements gathering exercise for an expertise recommender and organizational memory system project. Transferable lessons learned are distilled and discussed.
On the use of anycast in DNS
Authors: Sandeep Sarat, Vasileios Pappas, Andreas Terzis
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

We present the initial results from our evaluation study on the performance implications of anycast in DNS, using four anycast servers deployed at top-level DNS zones. Our results show that 15% to 55% of the queries sent to an anycast group, are answered by the topologically closest server and at least 10% of the queries experience an additional delay in the order of 100ms. While increased availability is one of the supposed advantages of anycast, we found that outages can last up to multiple minutes, mainly due to slow BGP convergence. On the other hand, the number of outages observed was fairly small, suggesting that anycast provides a generally stable service.
Is computer science science?
Authors: Peter J. Denning
Venue: Communications of the ACM (2005)

Computer science meets every criterion for being a science, but it has a self-inflicted credibility problem.
ProbSeq&mdash;a fragmentation model for interpretation of electrospray tandem mass spectrometry data: Conference Papers
Authors: John Skilling, Richard Denny, Keith Richardson, Phillip Young, Thérèse McKenna, Iain Campuzano, Mark Ritchie
Venue: Comparative and Functional Genomics (2004)

We describe a probabilistic peptide fragmentation model for use in protein databank searching and de novo sequencing of electrospray tandem mass spectrometry data. A probabilistic framework for tuning of the model using a range of well-characterized samples are introduced. We present preliminary results of our tuning efforts. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Testing the effectiveness of a secure classroom intranet
Authors: Nicholas Karlson
Venue: Journal of Computing Sciences in Colleges (2004)

A classroom intranet fosters student collaboration and community. In addition, an always-available intranet helps students remain actively involved with group work while outside of class. This paper discusses an example of a classroom intranet technology along with its associated underpinnings. A statistical analysis of data from an experiment designed to test the technology's effectiveness concludes the paper.
Named entity recognition: a maximum entropy approach using global information
Authors: Hai Leong Chieu, Hwee Tou Ng
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper presents a maximum entropy-based named entity recognizer (NER). It differs from previous machine learning-based NERs in that it uses information from the whole document to classify each word, with just one classifier. Previous work that involves the gathering of information from the whole document often uses a secondary classifier, which corrects the mistakes of a primary sentence-based classifier. In this paper, we show that the maximum entropy framework is able to make use of global information directly, and achieves performance that is comparable to the best previous machine learning-based NERs on MUC-6 and MUC-7 test data.
Work coordination, workflow, and workarounds in a medical context
Authors: Marina Kobayashi, Susan R. Fussell, Yan Xiao, F. Jacob Seagull
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper we report an ethnographic study of workarounds-informal temporary practices for handling exceptions to normal workflow-in a hospital environment. Workarounds are a common technique for dealing with the inherent uncertainty of dynamic work environments. Workarounds can help coordinate work, especially under conditions of high time pressure, but they may result in information or work protocols that are unstable, unavailable, or unreliable. We investigated workarounds and their effects through observation and interviews in a major teaching medical center. Our results suggest 4 key features of workarounds that technologies might help address: (a) workarounds differ as a function of people's role; (b) workarounds draw on tacit knowledge of others' abilities and willingness to help; (c) workarounds can have a cascading effect, causing other workarounds down the line; (d) workarounds often rely on principles of fairness and who owes whom a favor. We provide recommendations for designing systems to better support workarounds in dynamic environments.
Specification and verification of data-driven web services
Authors: Alin Deutsch, Liying Sui, Victor Vianu
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

We study data-driven Web services provided by Web sites interacting with users or applications. The Web site can access an underlying database, as well as state information updated as the interaction progresses, and receives user input. The structure and contents of Web pages, as well as the actions to be taken, are determined dynamically by querying the underlying database as well as the state and inputs. The properties to be verified concern the sequences of events (inputs, states, and actions) resulting from the interaction, and are expressed in linear or branching-time temporal logics. The results establish under what conditions automatic verification of such properties is possible and provide the complexity of verification. This brings into play a mix of techniques from logic and automatic verification.
Privacy Protection of Enterprise Information through Inference Analysis
Authors: Ramaswamy Chandramouli
Venue: Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (2005)

Ensuring that Disclosure of Information to outside entities is in conformance with the enterprise privacy policies is of utmost concern for all enterprises dealing with consumer information. The existing protection measures proposed for meeting this goal are inadequate. In this paper we present an approach in which the privacy label taxonomy is developed to classify information types in an enterprise by their privacy labels. Inference Analysis is performed on the information types using a Disjunctive Logic Programming technique to detect violations of privacy labeling semantics in various information types. The analysis also provides the technique to deal with such violations so as to achieve a violation-free privacy labeling scheme.
Parallel object-oriented framework optimization: Research Articles
Authors: Daniel J. Quinlan, Markus Schordan, Brian Miller, Markus Kowarschik
Venue: Concurrency and Computation: Practice Experience (2004)

Sophisticated parallel languages are difficult to develop; most parallel distributed memory scientific applications are developed using a serial language, expressing parallelism through third party libraries (e.g. MPI). As a result, frameworks and libraries are often used to encapsulate significant complexities. We define a novel approach to optimize the use of libraries within applications. The resulting tool, named ROSE, leverages the additional semantics provided by library-defined abstractions enabling library specific optimization of application codes. It is a common perception that performance is inversely proportional to the level of abstraction. Our work shows that this is not the case if the additional semantics can be leveraged. We show how ROSE can be used to leverage the semantics within the compile-time optimization. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The role of caching and context-awareness in P2P service discovery
Authors: Christos Doulkeridis, Vassilis Zafeiris, Michalis Vazirgiannis
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Mobile terminals (cellular phones, PDAs, palmtops etc.) emerge as a new class of small-scale, ad-hoc service providers that share data and functionality via mobile web services' calls. In mobile service discovery, it is often the case that implicit contextual information such as the location of the requestor, time the query was submitted, capabilities of the involved devices have a significant impact on query evaluation and the quality of the results. On the other hand, lack of scalability and the well-known single point of failure problem call for distribution of service directories into several peers. In this paper, we present an approach for context-aware service discovery where service directories reside in a P2P architecture. We explore the role and benefits of context-awareness and caching query results in the service discovery process. We conduct extensive experiments coming up with guidelines for service directory design in a P2P context.