ppxscal/embedding_network huggingface dataset:
The Snaptic Paddle: A Modular Haptic Device
Authors: Christopher E. Wong, Allison M. Okamura
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The Haptic Paddle was developed previously as an inexpensive haptic device for educational use, and has been applied to course topics such as dynamic systems and introductory controls. However, it has only a single degree of freedom, limiting it to very simple modeling and simulation exercises. Through modifications to the original Haptic Paddle design, a "Snaptic Paddle" has been created that allows two modular one-degree-of-freedom devices to be connected to form a single two-degree-of-freedom device that operates like a traditional joystick. The devices can also be used separately, creating a flexible, economical haptic interface for educational applications. The device successfully provides force feedback interaction, as will be shown in a demonstration at the World Haptics Conference.
Mining directed social network from message board
Authors: Naohiro Matsumura, David E. Goldberg, Xavier Llorà
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In the paper, we present an approach to mining a directed social network from a message board on the Internet where vertices denote individuals and directed links denote the flow of influence. The influence is measured based on propagating terms among individuals via messages. The distance with respect to contextual similarity between individuals is acquired since the influence indicates the degree of their shared interest represented as terms.
A Model of Organizational Integration, Implementation Effort, and Performance
Authors: Henri Barki, Alain Pinsonneault
Venue: Organization Science (2005)

The notion of integration is central to the understanding of organizations in general as well as of contemporary phenomena such as e-commerce, virtual organizations, virtual teams, and enterprise resource planning (ERP) implementation. Yet, the concept of integration is ill-defined in the literature, and the impact of achieving high levels of integration is not well understood. The present paper addresses these issues. Drawing on the literature of several fields, this paper proposes the concept oforganizational integration (OI), which is defined as the extent to which distinct and interdependent organizational components constitute a unified whole. Six types of OI are identified: two intraorganizational OI (internal-operational, internal-functional) and four interorganizational OI (external-operational-forward, external-operational-backward, external-operational-lateral, and external-functional). This paper then presents a model and develops 14 propositions to predict (1) the effort needed to implement different types of OI, (2) the impact different types of OI will have on organizational performance, and (3) how six factors (interdependence, barriers to OI, mechanisms for achieving OI, environmental turbulence, complexity reduction mechanisms, and organizational configurations) influence the relationship between OI types, implementation effort, and organizational performance. The OI framework and model are then used to develop 14 propositions for ERP implementation research and to explain the findings of recent research on integration.
Hierarchical Encryption in WDM Optical Network Links
Authors: Stamatios V. Kartalopoulos
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In telecommunication networks and in computer grid networks, a significant ongoing research is in a technology known as Wavelength Division Multiplexing (WDM), which is capable to transport more than 1 Tbps aggregate traffic over a single fiber. However, when massive amounts of information are transported, as in optical networks, there are three issues that stand, cost-efficient ultra-high bandwidth delivery, security of information and data, and security of the network and of the transporting link layer. In optical networks, each fiber link consists of segments, each several kilometers long. Since a single WDM channel carries traffic, there are opportunities for sophisticated eavesdroppers to tap the fiber, copy a channel, isolate a specific payload and attempt to decrypt it if the encryption key is known or it is breakable with a fast computer. Therefore, end-to-end data security should not only rely on the client's encryption method but also on securing the transmission method on the optical link. In this paper, we present a WDM link security methodology that encrypts multiple channels and with multiple keys to render channel monitoring by eavesdroppers virtually impossible. Although our paper present the applicability of the method on a point-to-point topology, it is applicable to a multilink and edge-to-edge network path.
'User experience' design a new form of design practice takes shape
Authors: Ian McClelland
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper outlines my professional background and interests in the 'user-experience' field. I summarise my current relevant responsibilities related to my employment as a specialist in 'user experience' design and my SIGCHI activities. I also summarise some observations on the emergence of 'user experience' as a focus for the professional practice of interactive system design and observations on some directions for the future.
Genetic design of discrete dynamical basis networks that approximate data sequences and functions
Authors: Kent L. Jones, Thomas N. Wild, David L. Olmsted
Venue: International Journal of Systems Science (2004)

This paper extends research in the area of biologically inspired, discrete dynamical basis networks (DDBNs). While similar to locally recurrent globally feedforward (LRGF) networks (Tsoi and Back 1994), DDBNs operate at a lower level of abstraction and were inspired by research in the areas of Control Systems, Artificial Intelligence, and Neurobiology. As described previously, DDBNs can approximate data sequences and consist of networks of simple, bounded mathematical operators (Jones and Olmsted 2003). This paper examines the characteristics of genetically designed DDBNs and compares them with tree-based genetic programs (TBGPs), biological neural networks, and backpropagation neural networks (NNs). Experimental evidence indicates that DDBNs are capable of computing simple logic functions in addition to approximating data sequences.
Effects of on-chip inductance on power distribution grid
Authors: Atsushi Muramatsu, Masanori Hashimoto, Hidetoshi Onodera
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

With increase of clock frequency, on-chip wire inductance starts to play an important role in power/ground distribution analysis, although it has not been considered so far. We perform a case study work that evaluates relation between decoupling capacitance position and noise suppression effect, and we reveal that placing decoupling capacitance close to current load is necessary for noise reduction. We experimentally show that impact of on-chip inductance becomes small when on-chip decoupling capacitance is well placed according to local power consumption. We also examine influences of grid pitch, wire area, and spacing between paired power and ground wires on power supply noise. Minification of grid pitch is more efficient than increase in wire area, and small spacing reduces power noise as we expected.
Attractor Spaces as Modules: A Semi-Eliminative Reduction of Symbolic AI to Dynamic Systems Theory
Authors: Teed Rockwell
Venue: Minds and Machines (2005)

I propose a semi-eliminative reduction of Fodor's concept of module to the concept of attractor basin which is used in Cognitive Dynamic Systems Theory (DST). I show how attractor basins perform the same explanatory function as modules in several DST based research program. Attractor basins in some organic dynamic systems have even been able to perform cognitive functions which are equivalent to the If/Then/Else loop in the computer language LISP. I suggest directions for future research programs which could find similar equivalencies between organic dynamic systems and other cognitive functions. This type of research could help us discover how (and/or if) it is possible to use Dynamic Systems Theory to more accurately model the cognitive functions that are now being modeled by subroutines in Symbolic AI computer models. If such a reduction of subroutines to basins of attraction is possible, it could free AI from the limitations that prompted Fodor to say that it was impossible to model certain higher level cognitive functions.
Baud-rate channel equalization in nanometer technologies
Authors: Eric Y. Chou, Jamie C. Huang, Maggie S. Huang, Mark C. Hsieh, Andrew Y. Hsu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

Chip design technology has been accelerating the advances of the communication technology in the past decades because a chip with larger computing capacity can support a communication system of higher transmission bandwidth. Since the communication transceivers are now in the multigiga bits/second range, the computing bandwidth requirement for a transceiver has grown into several hundreds of giga-FLOPs second range. To support such big computing tasks on a chip, nanometer technology and pure baud-rate computing without pipelining and oversampling overheads will be much more important. Meanwhile, baud-rate computing does not require extra-digital control for the digital-signal processing functions. This can greatly reduce the power consumption and chip area of a VLSI system. Yet, there are several design issues, such as the output signal-to-noise ratio, algorithmic mapping for computing model, and the critical path for the datapath design of the VLSI computing function, which need to be resolved under small silicon area requirements A novel baud-rate channel equalization architecture based on training coefficient relaxation techniques is presented in this paper to resolve these issues in nanotechnology such as 130- and 90-nm technologies. This design paradigm clearly demonstrates its advantage to enable multiport transceiver system-on-a-chip designs in nanometer technology. Trends for the baud-rate computing in smaller geometry are also explained.
Linear widths of a multivariate function space equipped with a Gaussian measure
Authors: Chen Guanggui, Fang Gensun
Venue: Journal of Approximation Theory (2005)

We determine the asymptotic values on the linear probabilistic (N,δ)-widths and linear p-average N-widths of the space of multivariate functions with bounded mixed derivative MW2r(Td), r = (r1 ..... rd), 1/2 <r1=...=rv<rv+1≤ ... ≤rd equipped with a Gaussian measure µ in Lq (Td). That is, the following asymptotic equivalences hold: (1) If 1<q≤2, then λN,δ(MW2r(Td),µ, Lq(Td)) = (N-1 lnv-1N)r1+(ρ-1)/2(ln(v-1)/2N) × √1+(1/N)ln(1/δ). (2) If 1 < q < ∞ then λN(a)(MW2r(Td),µ, Lq(Td)) = (N-1 lnv-1N)r1+(ρ-1/2)(ln(v-1)/2N). Here 0 < λ ≤ 1/2, and ρ > 1 depends only on the eigenvalues of the correlation operator of the measure µ (see (4)).If the dimension d ≥ 2, then the asymptotic exact order of probabilistic linear widths of MWr2(Td with the Gaussian measure µ in the Lq(Td) space for the cases q = 1, 2 < q ≤ ∞ and the average linear widths λN(a) (MWr2(Td), µ, Lq(Td)) for the case q = 1 and q = ∞ are still open.
An Indexing Method for Answering Queries on Moving Objects
Authors: Khaled Elbassioni, Amr Elmasry, Ibrahim Kamel
Venue: Distributed and Parallel Databases (2005)

We consider the problem of indexing a set of objects moving in d-dimensional spaces along linear trajectories. A simple external-memory indexing scheme is proposed to efficiently answer general range queries. The following are examples of the queries that can be answered by the proposed method: report all moving objects that will (i) pass between two given points within a specified time interval; (ii) become within a given distance from some or all of a given set of other moving objects. Our scheme is based on mapping the objects to a dual space, where queries about moving objects are transformed into polyhedral queries concerning their speeds and initial locations. We then present a simple method for answering such polyhedral queries, based on partitioning the space into disjoint regions and using a B+-tree to index the points in each region. By appropriately selecting the boundaries of each region, we guarantee an average search time that matches a known lower bound for the problem. Specifically, for a fixed d, if the coordinates of a given set of N points are statistically independent, the proposed technique answers polyhedral queries, on the average, in O((N/B)1¿1/d¿(log B N)1/d+K/B) I/O's using O(N/B) space, where B is the block size, and K is the number of reported points. Our approach is novel in that, while it provides a theoretical upper bound on the average query time, it avoids the use of complicated data structures, making it an effective candidate for practical applications. The proposed index is also dynamic in the sense that it allows object insertion and deletion in an amortized update cost of log B(N) I/O's. Experimental results are presented to show the superiority of the proposed index over other methods based on R-trees.
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
Authors: Wahid Chrabakh, Rich Wolski
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous resources. The GridSAT parallel algorithm uses intelligent backtracking, distributed and carefully scheduled sharing of learned clauses, and clause reduction. Our implementation focuses on dynamic resource acquisition and release to optimize application execution. We show how the large number of computational resources that are available from a Grid can be managed effectively for the application by an automatic scheduler and effective implementation. GridSAT execution speed is compared against the best sequential solver as rated by the SAT2002 competition using a wide variety of problem instances. The results show that GridSAT delivers speed-up for all but one of the test problem instances that are of significant size. In addition, we describe how GridSAT has solved previously unsolved satisfiability problems and the domain science contribution these results make.
A New Shuffle Convolution for Multiple Zeta Values
Authors: Ae Ja Yee
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

Recently, interest in shuffle algebra has been renewed due to their connections with multiple zeta values. In this paper, we prove a new shuffle convolution that implies a reduction formula for the multiple zeta value z({5,1}n).
Asymptotic Controllability and Robust Asymptotic Stabilizability
Authors: Christophe Prieur
Venue: SIAM Journal on Control and Optimization (2005)

This paper deals with asymptotically controllable systems for which there exists no smooth stabilizing state feedback. To investigate the robustness asymptotic stabilization property, a new class of hybrid feedbacks (with a continuous component and a discrete one) is introduced: the hybrid patchy feedbacks. The notion of solutions is a generalization of $\pi$-solutions and Euler solutions. It is proved that the origin of all globally asymptotically controllable systems can be globally asymptotically stabilized via a hybrid feedback with robustness with respect to measurement noise, actuator errors, and external disturbances.
Checking spelling in source code
Authors: Elliott Hughes
Venue: ACM SIGPLAN Notices (2004)

Word processors have long been able to check spelling as a special pass over the whole document, but the feature really came into its own with "check as you type". So useful is this feature (and so well within the capabilities of modern computers) that we now find it in other text-handling applications such as mailers and web browsers. Mac OS offers it on all text components for no extra programming effort. Programs that don't check what you're typing as you type it are becoming increasingly annoying and the surprising number of programs that won't check your spelling at all are even worse.Despite this, the editors and other tools used by programmers are least likely to offer spelling checking. This article looks at why this is, and describes the addition of spelling checking to a programmer's editor.
BCS-MPI: A New Approach in the System Software Design for Large-Scale Parallel Computers
Authors: Juan Fernandez, Eitan Frachtenberg, Fabrizio Petrini
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for large-scale parallel machines. The emphasis of BCS-MPI is on the global coordination of a large number of communicating processes rather than on the traditional optimization of the point-to-point performance. BCS-MPI delays the inter-processor communication in order to schedule globally the communication pattern and it is designed on top of a minimal set of collective communication primitives. In this paper we describe a prototype implementation of BCS-MPI and its communication protocols. Several experimental results, executed on a set of scientific applications, show that BCS-MPI can compete with a production-level MPI implementation, but is much simpler to implement, debug and model.
A Fully Parallel and Scalable Implementation of a Hopfield Neural Network on the SHARC-NET Supercomputer
Authors: Edward R. Sykes, Aleksandar Mirkovic
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Artificial neural networks (ANN) are an established area of artificial intelligence (AI) and computer science. ANNs have been used in a number of ways for research and industrial projects. However, despite ANN research spanning many years, the typical implementation is a single threaded programming model. This paper presents a fully parallel implementation of a Hopfield Neural Network using a supercomputer. The goal of this project is to develop a core learning unit capable of enormous range of scaling ability over a large number of nodes in a supercomputer. Furthermore, we integrate techniques that minimize the dependencies on any particular topology thus making it easier to port to other supercomputing environments. Ideally, other SHARC-net users will extend these ideas and conduct research using the tools developed in this project. This paper provides an outline of the issues associated with the development of this artificial neural network on SHARC-net, the benefits of such work, the difficulties encountered and future directions.
Adapting physical carrier sensing to maximize spatial reuse in 802.11 mesh networks: Research Articles
Authors: Jing Zhu, Xingang Guo, L. Lily Yang, W. Steven Conner, Sumit Roy, Mousumi M. Hazra
Venue: Wireless Communications Mobile Computing (2004)

Spatial reuse in a mesh network can allow multiple communications to proceed simultaneously, hence proportionally improve the overall network throughput. To maximize spatial reuse, the MAC protocol must enable simultaneous transmitters to maintain the minimal separation distance that is sufficient to avoid interference. This paper demonstrates that physical carrier sensing enhanced with a tunable sensing threshold is effective at avoiding interference in 802.11 mesh networks without requiring the use of virtual carrier sensing. We present an analytical model for deriving the optimal sensing threshold given network topology, reception power and data rate. A distributed adaptive scheme is also presented to dynamically adjust the physical carrier sensing threshold based on periodic estimation of channel conditions in the network. Simulation results are shown for large-scale 802.11b and 802.11a networks to validate both the analytical model and the adaptation scheme. It is demonstrated that the enhanced physical carrier sensing mechanism effectively improves network throughput by maximizing the potential of spatial reuse. With dynamically tuned physical carrier sensing, the end to end throughput approaches 90&percnt; of the predicted theoretical upper-bound assuming a perfect MAC protocol, for a regular chain topology of 90 nodes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
DISC: Dynamic Interleaved Segment Caching for Interactive Streaming
Authors: Lei Guo, Songqing Chen, Zhen Xiao, Xiaodong Zhang
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Streaming media objects have become widely used on the Internet, and the demand of interactive requests to these objects has increased dramatically. Typical interactive requests include fast forward and direct jumps. Unfortunately, most of existing streaming proxies are designed for sequential accesses, and only a few solutions have been proposed to maintain additional data structures in the proxy to support some interactive operations (such as fast forward) other than jumps, which are among the most common interactive requests from the clients. Focusing on interactive accesses, in this paper we present an analysis of streaming media workload collected from thousands of broadband users hosted by a major ISP. Our analysis shows that jump accesses (48%) and pauses (51%) are the dominant client interactive requests and that jump accesses often suffer serious delays due to slow buffering through the network. To support jump accesses effectively, we further propose a novel caching algorithm ¿ DISC (Dynamic Interleaved Segment Caching), which trades cache performance for response time to client interactive requests. In this algorithm, segments of a media object are cached dynamically according to client access patterns. DISC can support direct jumps efficiently while ensuring timely prefetching of uncached segments for sequential accesses. Trace-driven simulations demonstrate that DISC outperforms other caching schemes significantly for interactive requests with only a small degradation in cache performance.
On the asymptotic behaviour of some new gradient methods
Authors: Yu-Hong Dai, Roger Fletcher
Venue: Mathematical Programming: Series A and B (2005)

The Barzilai-Borwein (BB) gradient method, and some other new gradient methods have shown themselves to be competitive with conjugate gradient methods for solving large dimension nonlinear unconstrained optimization problems. Little is known about the asymptotic behaviour, even when applied to n&#x2212;dimensional quadratic functions, except in the case that n=2. We show in the quadratic case how it is possible to compute this asymptotic behaviour, and observe that as n increases there is a transition from superlinear to linear convergence at some value of n&#x2265;4, depending on the method. By neglecting certain terms in the recurrence relations we define simplified versions of the methods, which are able to predict this transition. The simplified methods also predict that for larger values of n, the eigencomponents of the gradient vectors converge in modulus to a common value, which is a similar to a property observed to hold in the real methods. Some unusual and interesting recurrence relations are analysed in the course of the study.