ppxscal/embedding_network huggingface dataset:
Interaction design for literature-based discovery
Authors: Meredith M. Skeels, Kiera Henning, Meliha Yetisgen Yildiz, Wanda Pratt
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Rapid growth in the scientific literature makes it increasingly difficult for scientists to keep abreast of findings outside their own narrowing fields of expertise. To help biomedical researchers address this problem, LitLinker uses literature-based discovery to find new connections between biomedical terms that could lead to new directions in research. In this paper, we discuss the design of an interface that supports researchers' interactive exploration of the identified connections. Because the interface suggests many possible new connections, researchers must be able to understand how connections are established and to evaluate those connections based on their own expertise. Based on the results of our user study, we have further tailored the interface to support the work processes of biomedical researchers. LitLinker's interaction design promotes user-comprehension of the complex relationships among connected terms and allows for dialogue with researchers on the use of literature in scientific discovery.
A new revolute robot manipulator adapting the closed-chain mechanism
Authors: Hyeung-Sik Choi, Jungmin Oh
Venue: Journal of Robotic Systems (2005)

Conventional robot manipulators actuated by motors with conventional speed reducers such as the harmonic drive or RV have weakness in the load capacity since the speed reducers are not stiff enough. To overcome this, we propose a four-bar-link actuator driven by the ball screw, which has a high stiffness and high torque transmission ability, and propose a new type of four degree-of-freedom revolute robot manipulator adapting the proposed actuators. The base joint of the robot is actuated by the motor with the conventional speed reducer, and the other joints are actuated by the proposed actuators. The kinematics and dynamics of the robot are analyzed in the joint coordinate and in the Cartesian coordinate. For the performance tests of the robot, a four degree-of-freedom revolute robot was built. Through the performance tests, the results of superior load capacity and positioning accuracy are presented. &copy; 2005 Wiley Periodicals, Inc.
Perceptibility of Haptic Digital Watermarking of Virtual Textures
Authors: Domenico Prattichizzo, Mauro Barni, Hong Z. Tan, Seungmoon Choi
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Digital watermarking refers to the process of embedding a digital code into an image, video, printed document or audio media. The code should not interfere with the normal use of the media but can be recovered later. With the growing interest in haptic interactions for training and museum displays, it is only a matter of time that haptic digital media become available on the internet. For example, one will soon be able to feel the shape of Michaelangeloýs David or Japanýs Big Buddha by downloading a file that can be "played" on a force-feedback device. The haptic file may contain surface texture data in addition to topography so that David feels like marble and Big Buddha wood. In the meanwhile, the need for haptic digital watermarking will arise for protecting haptic media contents. This paper introduces for the first time the idea of haptic watermarking and shows one way to embed a watermark into a host surface texture signal. We also demonstrate the imperceptibility of the texture watermark in a psychophysical experiment.
Surviving IT project cancellations
Authors: Charalambos L. Iacovou, Albert S. Dexter
Venue: Communications of the ACM (2005)

In a Forbes cover story, an investment banker expressed a preference for hiring former athletes, not because they are competitive, but "because they recycle so quickly after things go wrong" [12]. Their ability to quickly get past a failure, analyze what went wrong, and correctly adapt future performance is what sets them apart from other employees. While the ability to overcome adversity is a recognized skill of effective business professionals, its role has been neglected in the realm of IT project failures. This is unfortunate because failure is common: about 15% of all IT projects are canceled before completion [10], some with disastrous effects [1].
A 6th-order 75 dB-DR 10.7 MHz 3.3 V CMOS bandpass &Sigma;&Delta; modulator sampled at 37.05 MHz: Research Articles
Authors: Paolo Cusinato, Fabrizio Stefani, Andrea Baschirotto
Venue: International Journal of Circuit Theory and Applications (2004)

This paper describes the design and the implementation of a 6th-order bandpass &Sigma;&Delta; modulator to be used for IF digitizing at 10.7 MHz of a broadcasting FM radio signal. The modulator is sampled at 37.05 MHz. This sampling frequency value allows to optimize both modulator and overall receiver channel performance. The modulator has been implemented in a standard double-poly 0.35 &micro;m CMOS technology using switched capacitor (SC) technique and consumes 116 mW from a single 3.3 V power supply. The modulator features 75 dB dynamic range and 66 dB peak-SNR within a 200 kHz bandwidth (FM bandwidth). Third-order intermodulation products are suppressed by &ndash;78dBc. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Moving from a plan driven culture to agile development
Authors: Michael Hirsch
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Plan driven cultures are characterized by a strong belief in the plannability and predictability of software development projects. The SEI-CMM, software process improvement initiatives, and software metrics programs are some of the hallmarks of this school of thought. The more recent trend towards agile development places the emphasis on constantly adapting to a project's changing goals rather than on detailed upfront planning. The majority of reports from pracitioners of agile development are positive and confirm the advantages of this approach. However, moving from a plan driven culture to agile development is not easy. Making the transition requires changes to many established practices and may even touch core values held by stakeholders. Areas affected are requirements and change management, user involvement, willingness to take on responsibility, contract management, and the ability to live with many uncertainties. This talk looks at what it takes to make the transition and presents lessons learned from organizations and projects which have successfully completed the switch to agile development.
Remote Visualization by Browsing Image Based Databases with Logistical Networking
Authors: Jin Ding, Jian Huang, Micah Beck, Shaotao Liu, Terry Moore, Stephen Soltesz
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

The need to provide remote visualization of large datasets with adequate levels of quality and interactively has become a major impediment to distributed collaboration in Computational Science.Although Image Based Rendering (IBR) techniques based on plenoptic functions have some important advantages over other approaches to this problem, they suffer from an inability to deal with issues of network latency and server load, due to the large size of the IBR databases they generate.Consequently, IBR techniques have been left largely unexplored for this purppose.In this paper we describe strategies for addressing these obstacles using Logistical Networking (LoN), which is a new and highly scalable approach to deploying storage as a shared communication resource.Leveraging LoN technology and infrastructure, we developed a remote visualization system based on concepts of light field rendering, an IBR method using a 4-D plenoptic function.Our system extends existing work on light fields by employing a modified method of parameterization and data organization that supports more efficient prefetching, caching and loss-less compression. Using this approach, we have been able to interactively browse multi-gigabyte, high-resolution light field databases across the wide area network at 30 frames per second.
An Optimization Framework for Radio Resource Management Based on Utility vs. Price Tradeoff in WCDMA Systems
Authors: Leonardo Badia, Cristiano Saturni, Lorenzo Brunetta, Michele Zorzi
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

In this paper we investigate Radio Resource Management strategies for multimedia networks driven by economic aspects such as usersý utility and service pricing. To this end, we discuss a framework in which the impact of both QoS and pricing is accounted for in the usersý acceptance rate of the service. The model is general enough to be adapted to different situations and optimization goals. Thus, we discuss possible objectives for the network management under the constraints of meeting Quality of Service requirements, by satisfying at the same time technical conditions of feasibility. We employ utility functions, in order to account for the additional characteristic represented by the traffic elasticity, and consider the effect of price to have a realistic characterization of economic quantities. The resulting optimization problem is then discussed and analyzed, to derive general insight and identify possibilities for enhancement.
Approximate Implementations of Pure Random Search in the Presence of Noise
Authors: David L. Alexander, David W. Bulger, James M. Calvin, H. Edwin. Romeijn, Ryan L. Sherriff
Venue: Journal of Global Optimization (2005)

We discuss the noisy optimisation problem, in which function evaluations are subject to random noise. Adaptation of pure random search to noisy optimisation by repeated sampling is considered. We introduce and exploit an improving bias condition on noise-affected pure random search algorithms. Two such algorithms are considered; we show that one requires infinite expected work to proceed, while the other is practical.
Towards an index of opportunity: understanding changes in mental workload during task execution
Authors: Shamsi T. Iqbal, Piotr D. Adamczyk, Xianjun Sam Zheng, Brian P. Bailey
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

To contribute to systems that reason about human attention, our work empirically demonstrates how a user's mental workload changes during task execution. We conducted a study where users performed interactive, hierarchical tasks while mental workload was measured through the use of pupil size. Results show that (i) different types of subtasks impose different mental workload, (ii) workload decreases at subtask boundaries, (iii) workload decreases more at boundaries higher in a task model and less at boundaries lower in the model, (iv) workload changes among subtask boundaries within the same level of a task model, and (v) effective understanding of why changes in workload occur requires that the measure be tightly coupled to a validated task model. From the results, we show how to map mental workload onto a computational Index of Opportunity that systems can use to better reason about human attention.
Evaluating failure time probabilities for a Markovian wear process
Authors: Jeffrey P. Kharoufeh, Jeffrey A. Sipe
Venue: Computers and Operations Research (2005)

We present simplified analytical results for the numerical evaluation of failure time probabilities for a single-unit system whose cumulative wear over time depends on its external environment. The failure time distribution is derived as a one-dimensional Laplace-Stieltjes transform with respect to the temporal variable using a direct solution approach and by inverting an existing two-dimensional result with respect to the spatial failure threshold variable. Two numerical examples demonstrate that accurate cumulative probability values can be obtained in a straightforward manner using standard computing environments.
A Parallel Algorithm for Correlating Event Streams
Authors: Daniel M. Zimmerman, K. Mani Chandy
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper describes a parallel algorithm for correlating or "fusing" streams of data from sensors and other sources of information. The algorithm is useful for applications where composite conditions over multiple data streams must be detected rapidly, such as intrusion detection or crisis management. The implementation of this algorithm on a multithreaded system and the performance of this implementation are also briefly described.
Supporting software composition at the programming language level
Authors: Peter H. Fröhlich, Andreas Gal, Michael Franz
Venue: Science of Computer Programming (2005)

We are in the midst of a paradigm shift toward component-oriented software development, and significant progress has been made in understanding and harnessing this new paradigm. Oddly enough, however, the new paradigm does not currently extend to the level at which components themselves are constructed. While we have composition architectures and languages that describe how systems are put together out of atomic program parts, the parts themselves are still constructed on the basis of a previous paradigm: object-oriented programming. We argue that this mismatch impedes the progress of compositional software design: many of the assumptions that underlie object-oriented languages simply do not apply in the open and dynamic contexts of component software environments. What, then, would a programming language that supported component-oriented programming at the smallest granularity look like? Lagoona, our project to develop such a language, tries to answer this question. This paper motivates the key concepts behind Lagoona and briefly describes their realization (using Lagoona itself as the implementation language) in the context of Microsoft's NET environment.
Complexity of event structure in IE scenarios
Authors: Silja Huttunen, Roman Yangarber, Ralph Grishman
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper presents new Information Extraction scenarios which are linguistically and structurally more challenging than the traditional MUC scenarios. Traditional views on event structure and template design are not adequate for the more complex scenarios.The focus of this paper is to show the complexity of the scenarios, and propose a way to recover the structure of the event. First we identify two structural factors that contribute to the complexity of scenarios: the scattering of events in text, and inclusion relationships between events. These factors cause difficulty in representing the facts in an unambiguous way. Then we propose a modular, hierarchical representation where the information is split in atomic units represented by templates, and where the inclusion relationships between the units are indicated by links. Lastly, we discuss how we may recover this representation from text, with the help of linguistic cues linking the events.
Using model checking to debug device firmware
Authors: Sanjeev Kumar, Kai Li
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult to debug using traditional debugging techniques. The problem is further compounded by the lack of debugging support on the devices. This is a serious problem because the device firmware is trusted by the operating system.Model checkers are designed to systematically verify properties of concurrent systems. Therefore, model checking is a promising approach to debugging device firmware. However, model checking involves an exponential search. Consequently, the models have to be small to allow effective model checking.This paper describes the abstraction techniques used by the ESP compiler to extract abstract models from device firmware written in ESP. The abstract models are small because they discard some of the details in the firmware that is irrelevant to the particular property being verified. The programmer is required to specify the abstractions to be performed. The ESP compiler uses the abstraction specification to extract models conservatively. Therefore, every bug in the original program will be present in the extracted model.This paper also presents our experience with using Spin model checker to develop and debug VMMC firmware for the Myrinet network interfaces. An earlier version of the ESP compiler yielded models that were too large to check for system-wide properties like absence of deadlocks. The new version of the compiler generated abstract models that were used to identify several subtle bugs in the firmware. So far, we have not encountered any bugs that were not caught by Spin.
Design of a Singularity Free Architecture for Cable Driven Haptic Interfaces
Authors: Emmanuel Brau, Florian Gosselin, Jean Paul Lallemand
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Cable robots or wire driven robots possess many advantages that make them very well suited to be used as haptic interfaces. They exhibit very low inertia and very low friction because of their very light mechanical structure. The use of cables, however, leads to an under-constrained system which shows complex properties. The main drawback is the difficulty to estimate the useful workspace, and the maximum tension in the cables, as the relation between the maximum force at the tip of the interface and the maximum tension in the cables can not be easily established. In this paper we present a method to calculate these tensions in a given workspace and to estimate what we have called "the tension capable workspace" for a 4 cables 3 d.o.f (degree of freedom) haptic interface. We then use this method to design a new singularity free architecture and compare it to more "classical" architectures in terms of workspace and maximum tension.
Theoretical Consideration of Adaptive Fault Tolerance Architecture for Open Distributed Object-Oriented Computing
Authors: Rodrigo Lanka, Kentaro Oda, Takaichi Yoshida
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In Distributed object-oriented computing, a complex set of requirements has to be consideredfor maintaining the required level of reliability of objects to give higher level of performance. We propose a mechanism to analyze the complexity of these underlying environments and design a dynamically reconfigurable architecture according to the changes of the underlying environment. The replication should have a suitable architecture for the adaptable fault tolerance so that it can handle the different situations of the underlying system before the fault occurs. The system can provide the required level of reliability by measuring the reliability of the underlying environment and then either adjusting the replication degree or migrating the object appropriately. It is also possible to improve the reliability with shifting to a suitable replication protocol adaptively. However, there should be a mechanism to overcome the problems when "replication protocol transition period" exists. This will also find a client- server group communication protocol that communicates with objects under both different environmental conditions and different replication protocols.
The Collaborative Information Portal and NASA's Mars Rover Mission
Authors: Ronald Mak, Joan Walton
Venue: IEEE Internet Computing (2005)

NASA Ames Research Center and the California Institute of Technology's Jet Propulsion Laboratory jointly developed the Collaborative Information Portal, which provided enterprise software for NASA's Mars exploration rover mission. Mission managers, engineers, scientists, and researchers used this Internet application to view current staffing and event schedules, download data and image files generated by the rovers, receive broadcast messages, and get accurate times in various Mars and Earth time zones. This article describes the software's features, architecture, and implementation, and conveys the lessons learned from its deployment.
How to Deduce a Proper Eigenvalue Cluster from a Proper Singular Value Cluster in the Nonnormal Case
Authors: Stefano Serra-Capizzano, Daniele Bertaccini, Gene H. Golub
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

We consider a generic sequence of matrices (the nonnormal case is of interest) showing a proper cluster at zero in the sense of the singular values. By a direct use of the notion of majorizations, we show that the uniform spectral boundedness is sufficient for the proper clustering at zero of the eigenvalues: if the assumption of boundedness is removed, then we can construct sequences of matrices with a proper singular value clustering and having all the eigenvalues of an arbitrarily big modulus. Applications to the preconditioning theory are discussed.
Hermite Spectral Methods with a Time-Dependent Scaling for Parabolic Equations in Unbounded Domains
Authors: Heping Ma, Weiwei Sun, Tao Tang
Venue: SIAM Journal on Numerical Analysis (2005)

Hermite spectral methods are investigated for linear diffusion equations and nonlinear convection-diffusion equations in unbounded domains. When the solution domain is unbounded, the diffusion operator no longer has a compact resolvent, which makes the Hermite spectral methods unstable. To overcome this difficulty, a time-dependent scaling factor is employed in the Hermite expansions, which yields a positive bilinear form. As a consequence, stability and spectral convergence can be established for this approach. The present method plays a similar role in the stability of the {similarity transformation} technique proposed by Funaro and Kavian [Math. Comp., 57 (1991), pp. 597--619]. However, since coordinate transformations are not required, the present approach is more efficient and is easier to implement. In fact, with the time-dependent scaling the resulting discretization system is of the same form as that associated with the classical (straightforward but unstable) Hermite spectral method. Numerical experiments are carried out to support the theoretical stability and convergence results.
Measuring the Performance of Schedulability Tests
Authors: Enrico Bini, Giorgio C. Buttazzo
Venue: Real-Time Systems (2005)

The high computational complexity required for performing an exact schedulability analysis of fixed priority systems has led the research community to investigate new feasibility tests which are less complex than exact tests, but still provide a reasonable performance in terms of acceptance ratio. The performance of a test is typically evaluated by generating a huge number of synthetic task sets and then computing the fraction of those that pass the test with respect to the total number of feasible ones. The resulting ratio, however, depends on the metrics used for evaluating the performance and on the method for generating random task parameters. In particular, an important factor that affects the overall result of the simulation is the probability density function of the random variables used to generate the task set parameters. In this paper we discuss and compare three different metrics that can be used for evaluating the performance of schedulability tests. Then, we investigate how the random generation procedure can bias the simulation results of some specific scheduling algorithm. Finally, we present an efficient method for generating task sets with uniform distribution in a given space, and show how some intuitive solutions typically used for task set generation can bias the simulation results.