ppxscal/embedding_network huggingface dataset:
Pilchard &#151 A Reconfigurable Computing Platform with Memory Slot Interface
Authors: P. H. W. Leong, M. P. Leong, O. Y. H. Cheung, T. Tung, C. M. Kwok, M. Y. Wong, K. H. Lee
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

A reconfigurable computing development environment called Pilchard, employing a field programmable gate array (FPGA) which plugs into a standardpersonal computer's (PC) 133 MHz synchronous dynamic RAM Dual In-line Memory Modules (DIMMs) slot is presented. Compared with a traditional PCI interfacedreconfigurable computing board, the DIMM interface offers higher bandwidth, a simpler interface and lower latency. A comparison of the transfer rate of the Pilchard board compared with a standard PC132 reconfigurable computing board is presented as well as an implementation of the data encryption standard (DES). Together, the board and interface generator provide an easy to use, low cost and high performance platform for reconfigurable computing.
Using MEMS-Based Storage to Boost Disk Performance
Authors: Feng Wang, Bo Hong, Scott A. Brandt, Darrell D. E. Long
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Non-volatile storage technologies such as flash memory, Magnetic RAM (MRAM), and MEMS-based storage are emerging as serious alternatives to disk drives. Among these, MEMS storage is predicted to be the least expensive and highest density, and at about 1 ms access times still considerably faster than hard disk drives. Like the other emerging non-volatile storage technologies, it will be highly suitable for small mobile devices but will, at least initially, be too expensive to replace hard drives entirely. Its non-volatility, dense storage, and high performance still makes it an ideal candidate for the secondary storage subsystem. We examine the use of MEMS storage in the storage hierarchy and show that using a technique called MEMS Caching Disk, we can achieve 30-49% of the pure MEMS storage performance by using only a small amount (3% of the disk capacity) of MEMS storage in conjunction with a standard hard drive. The resulting system is ideally suited for commercial packaging with a small MEMS device included as part of a standard disk controller or paired with a disk.
Designing the world as your palette
Authors: Kimiko Ryokai, Stefan Marti, Hiroshi Ishii
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

"The World as your Palette" is our ongoing effort to design and develop tools to allow artists to create visual art projects with elements (specifically, the color, texture, and moving patterns) extracted directly from their personal objects and their immediate environment. Our tool called "I/O Brush" looks like a regular physical paintbrush, but contains a video camera, lights, and touch sensors. Outside of the drawing canvas, the brush can pick up colors, textures, and movements of a brushed surface. On the canvas, artists can draw with the special "ink" they just picked up from their immediate environment. We describe the evolution and development of our system, from kindergarten classrooms to an art museum, as well as the reactions of our users to the growing expressive capabilities of our brush, as an iterative design process.
A Low-Cost Realization of an Adaptable Protocol Processing Unit
Authors: Maik Boden, Alex Gleich, Steffen Rulke, Ulrich Nageldinger
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper concerns the realization of an adaptable Protocol Processing Unit (PPU) targeting reconfigurable SoCs in mobile communication applications. The PPU is based on our design technique for dense-coded programmable Finite State Machines. This approach reduces programming costs by combining memory-based function generators with reconfigurable logic. Furthermore, we added custom modules that implement application-specific logic and arithmetic operations to achieve proper results.
Magic cubes for social and physical family entertainment
Authors: ZhiYing Zhou, Adrian David Cheok, Yu Li, Hirokazu Kato
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Physical and social interactions are constrained,and natural interactions are lost in most of present digital family entertainment systems [5]. Magic Cubes strive for bringing the computer storytelling, doll 's house,and board game back into reality so that the children can interact socially and physically as what we did in the old days. Magic Cubes are novel augmented reality systems that explore to use cubes to interact with three dimensional virtual fantasy world. Magic Cubes encourage discussion, idea exchange, collaboration, social and physical interactions among families.
Calling while driving: effects of providing remote traffic context
Authors: Mike Schneider, Sara Kiesler
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Cell phone conversations distract drivers. This research explores the possibility of reducing distracting by providing callers with remote information about the driver's traffic. We asked whether providing such contextual information would change the caller's conversation such that drivers would be less distracted. In Experiment 1 we examined this question in a low-fidelity driving simulator; in Experiment 2 we examined this question in a higher fidelity simulator. In both experiments, remote callers and passengers were distracting. Providing traffic information to the remote caller significantly reduced crashes in the low fidelity tests and significantly reduced passing in the high fidelity tests, compared with the control conditions. We consider the implications for development of remote displays or signals to promote driving safety.
Scheduling Processor Voltage and Frequency in Server and Cluster Systems
Authors: Ramakrishna Kotla, Soraya Ghiasi, Tom Keller, Freeman Rawson
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

Modern server farm and cluster sites consume large quantities of energy both to power and cool the machines in the site. At the same time, less power supply redundancy is offered and power companies and government officials are requesting power consumption be reduced during certain time periods. These trends lead to the requirement of responding to rapid reductions in the maximum power the site may consume. Each possible solution must respond to the new power budget before a cascading failure occurs. Available techniques include powering down some nodes or slowing all nodes in a system uniformly. This work instead examines the feasibility of slowing nodes non-uniformly in response to their performance demands. This approach provides an opportunity to reduce the performance loss caused by a reduction in the power budget. This paper uses the execution characteristics of the work currently running on each processor of the system or cluster to predict the performance of the work at the available frequency settings. The scheduling mechanism selects the lowest frequency for the processor that provides essentially all of the available performance of the work. It ensures that the frequency fits within the available global power budget and, if not, reduces it so that it does. The paper demonstrates the approach using a simple, synthetic benchmark and then validates it using additional, real-world applications.
A space-based end-to-end prototype geographic information network for lunar and planetary exploration and emergency response (2002 and 2003 field experiments)
Authors: Richard A. Beck, Robert K. Vincent, Doyle W. Watts, Marc A. Seibert, David P. Pleva, Michael A. Cauley, Calvin T. Ramos, Theresa M. Scott, Dean W. Harter, Mary Vickerman, David Irmies, Al Tucholski, Brian Frantz, Glenn Lindamood, Isaac Lopez, Greg Follen, Thaddeus Kollar, Jay Horowitz, Robert Griffin, Raymond Gilstrap, Marjory Johnson, Kenneth Freeman, Celeste Banaag, Joseph Kosmo, Amy Ross, Kevin Groneman, Jeffrey Graham, Kim Shillcutt, Robert Hirsh, Nathan Howard, Dean B. Eppler
Venue: Computer Networks and ISDN Systems (2005)

Communications and imaging experiments conducted in the Arizona desert during July of 2002 with the National Aeronautics and Space Administration (NASA) and the United States Geological Survey (USGS) helped to identify a fundamental suite of scientific instruments focused on surface composition and temperature determination for the calibration and validation of NASA and USGS spaceborne and airborne sensors and to integrate them with a hybrid mobile wireless and satellite network for lunar and planetary exploration and emergency response. The 2002 experiment focused on the exchange of remotely sensed and ground truth geographic information between analysts and field scientists. That experiment revealed several modifications that would enhance the performance and effectiveness of geographic information networks (GIN) for lunar and planetary exploration and emergency response. Phase 2 experiments conducted during June 2003 at the USGS Earth Resources and Observation Systems (EROS) Data Center's geologic imaging test site near Dinosaur National Monument in the NE Utah desert incorporated several of the lessons learned from the 2002 experiment and successfully added five major new components: (1) near-real-time hyperspectral and multispectral satellite image acquisition, (2) remotely controlled and coordinated mobile real-time ground sensor measurements during the imaging satellite overpass, (3) long-delay optimized Transmission Control Protocol/Internet Protocol TCP/IP protocols to improve network performance over geosynchronous communications satellite circuits, (4) distributed, multinode parallel computing on NASA's Internet Power GRID (IPG), and (5) near-real-time validation of satellite imagery as part of a successful test of the NASA-USGS National Emergency Mapping Information System.
A performance study of job management systems: Research Articles
Authors: Tarek El-Ghazawi, Kris Gaj, Nikitas Alexandridis, Frederic Vroman, Nguyen Nguyen, Jacek R. Radzikowski, Preeyapong Samipagdi, Suboh A. Suboh
Venue: Concurrency and Computation: Practice Experience (2004)

Job Management Systems (JMSs) efficiently schedule and monitor jobs in parallel and distributed computing environments. Therefore, they are critical for improving the utilization of expensive resources in high-performance computing systems and centers, and an important component of Grid software infrastructure. With many JMSs available commercially and in the public domain, it is difficult to choose an optimum JMS for a given computing environment. In this paper, we present the results of the first empirical study of JMSs reported in the literature. Four commonly used systems, LSF, PBS Pro, Sun Grid Engine&#x002F;CODINE, and Condor were considered. The study has revealed important strengths and weaknesses of these JMSs under different operational conditions. For example, LSF was shown to exhibit excellent throughput for a wide range of job types and submission rates. Alternatively, CODINE appeared to outperform other systems in terms of the average turn-around time for small jobs, and PBS appeared to excel in terms of turn-around time for relatively larger jobs. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Detection and Explanation of Anomalous Activities: Representing Activities as Bags of Event n-Grams
Authors: Raffay Hamid, Amos Johnson, Samir Batta, Aaron Bobick, Charles Isbell, Graham Coleman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a novel representation and method for detecting and explaining anomalous activities in a video stream. Drawing from natural language processing, we introduce a representation of activities as bags of event n-grams, where we analyze the global structural information of activities using their local event statistics. We demonstrate how maximal cliques in an undirected edge-weighted graph of activities, can be used in an unsupervised manner, to discover regular sub-classes of an activity class. Based on these discovered sub-classes, we formulate a definition of anomalous activities and present a way to detect them. Finally, we characterize each discovered sub-class in terms of its "most representative member," and present an information-theoretic method to explain the detected anomalies in a human-interpretable form.
A tolerance rough set approach to clustering web search results
Authors: Chi Lang Ngo, Hung Son Nguyen
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Two most popular approaches to facilitate searching for information on the web are represented by web search engine and web directories. Although the performance of search engines is improving every day, searching on the web can be a tedious and time-consuming task due to the huge size and highly dynamic nature of the web. Moreover, the user's "intention behind the search" is not clearly expressed which results in too general, short queries. Results returned by search engine can count from hundreds to hundreds of thousands of documents. One approach to manage the large number of results is clustering. Search results clustering can be defined as a process of automatical grouping search results into to thematic groups. However, in contrast to traditional document clustering, clustering of search results are done on-the-fly (per user query request) and locally on a limited set of results return from the search engine. Clustering of search results can help user navigate through large set of documents more efficiently. By providing concise, accurate description of clusters, it lets user localizes interesting document faster.In this paper, we proposed an approach to search results clustering based on Tolerance Rough Set following the work on document clustering [4,3]. Tolerance classes are used to approximate concepts existed in documents. The application of Tolerance Rough Set model in document clustering was proposed as a way to enrich document and cluster representation with the hope of increasing clustering performance.
Asynchronous Complete Distributed Garbage Collection
Authors: Luis Veiga, Paulo Ferreira
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Most Distributed Garbage Collection (DGC) algorithms are not complete as they fail to reclaim distributed cycles of garbage. Those that achieve such a level of completeness are very costly as they require either some kind of synchronization or consensus between processes. Others use mechanisms such as backtracking, global counters, a central server, distributed tracing phases, and/or impose additional load and restrictions on local garbage collection. All these approaches hinder scalability and/or performance significantly. We propose a solution to this problem, i.e., we describe a DGC algorithm capable of reclaiming distributed cycles of garbage asynchronously and efficiently. Our algorithm does not require any particular coordination between processes and it tolerates message loss. We have implemented the algorithm both on Rotor (a free source version of Microsoft .Net) and on OBIWAN (a platform supporting mobile agents, object replication and remote invocation); we observed that applications are not disrupted.
Exact minimum-width transistor placement without dual constraint for CMOS cells
Authors: Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper proposes flat and hierarchical approaches for generating a minimum-width transistor placement of CMOS cells in presence of non-dual P and N type transistors. Our approaches are the first exact method which can be applied to CMOS cells with any types of structure. We formulate the transistor placement problem into Boolean Satisfiability (SAT) problem considering the P and N type transistors individually. The experimental results show that our flat approach generates smaller width placement for 29 out of 103 dual cells than that of the conventional method, and the width of only 3 out of 147 cells solved by our hierarchical approach are larger than that of the flat approach. Using the hierarchical approach, 81% of 340 cells in an industrial standard-cell library of 90 nm technology are solved within one hour for each cell, whereas 32% using the conventional exact method.
Average error rate of NCFSK with multi-branch post-detection switched diversity: Research Articles
Authors: Hong-Chuan Yang, Mohamed-Slim Alouini, Marvin K. Simon
Venue: Wireless Communications Mobile Computing (2004)

We investigate the performance of non-coherent frequency shift keying (NCFSK) with multi-branch post-detection switched diversity systems. After an appropriate statistical description of the square-law detector output, we derive generic formulas for the symbol&#x002F;bit error probability of NCFSK for both switch and stay combining (SSC) and switch and examine combining (SEC) schemes. We show that while the SSC scheme does not benefit from more than two diversity paths when the paths are identically distributed, the error performance of SEC improves as the number of antenna paths increases. We consider two detection schemes for NCFSK, one for M-ary FSK and another limited to only BFSK. We show that the second scheme leads to lower error probability performance when both are used to detect binary signals. The mathematical formalism is illustrated with a number of selected numerical examples. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Natural language processing at Columbia University
Authors: Michael Lebowitz
Venue: Issue 79 (January 1982) (1982)

Natural language research at Columbia is being carried out in the Department of Computer Science primarily by Professor Michael Lebowitz along with several graduate students. Several other faculty members are involved in other areas of AI, including Professors Kender and Stolfo.
Stabilizing feedbacks for imperfectly known, singularly perturbed nonlinear systems with discrete and distributed delays
Authors: Y. Y. Lin-Chen, D. P. Goodall
Venue: International Journal of Systems Science (2004)

A class of nonlinear memoryless controllers is synthesized to guarantee global uniform ultimate boundedness, with respect to some known set, for a class of imperfectly known singularly perturbed nonlinear systems, with discrete and distributed delays, provided that the singular perturbation parameter is small enough. Each feedback controller is designed using information based mainly on a nonlinear, affine in the control, 'reduced-order' system. The uncertainty, which may be time, state, delayed state and/or input dependent, is modelled by additive nonlinear perturbations influencing a known nominal, singularly perturbed time-delay system of the retarded type. A 'matched' uncertainty structural condition for the reduced-order system is not presumed in this paper.
StingRayCave: ray-based volume rendering for virtual reality
Authors: Peter Firth
Venue: Journal of Computing Sciences in Colleges (2005)

Volume datasets play a crucial role in our quest for discovery in medicine, geophysics, science and engineering. More specifically, they are being used in applications such as medical diagnosis, surgical planning, sonar systems, non-destructive testing, and seismic interpretation, to name a few. However, understanding the structure of a volumetric dataset can be difficult. Therefore rendering techniques that support 3D and immersive displays are becoming increasingly important because immersive environments allow the user a better chance to explore the dataset than on 2D displays.
Improving human haptic performance in normal and impaired human populations through unattended activation-based learning
Authors: Hubert R. Dinse, Tobias Kalisch, Patrick Ragert, Burkhard Pleger, Peter Schwenkreis, Martin Tegenthoff
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Human haptic performance is not fixed, but subject to major alterations through learning processes. We describe a new stimulation protocol that allows to improve haptic performance in humans in a highly systemic way through unattended activation-based learning. The so-called coactivation protocol is based upon temporal constraints of Hebbian learning where simultaneity plays a key role for the induction of plastic changes. We provide an overview about the potential of coactivation by summarizing recent findings showing that coactivation alters a broad range of basic as well as cognitively demanding types of haptic performance in parallel to cortical reorganization in somatosensory cortex. For example, coactivation applied to the tip of the index finger, or to all fingers of the dominant hand improves tactile acuity, but also haptic object recognition, and speeds up multiple-choice reaction times. Because such changes persist between 24 h and 1 week without further intervention, we interpret the underlying processes as a particular form of perceptual learning. We describe results where coactivation has been utilized for therapeutical purposes in impaired human populations, we outline new developments to optimize and extend unattended activation-based learning protocols, and we sketch the next steps necessary to apply the concept of unattended activation-based learning on a regular and reliable basis as a therapeutical tool in order to selectively interfere with impaired haptic performance.
Reducing Power and Latency in 2-D Mesh NoCs Using Globally Pseudochronous Locally Synchronous Clocking
Authors: Erland Nilsson, Johnny Oberg
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

One of the main problems when designing large ASICs today is to distribute a low power synchronous clock over the whole chip and a lot of remedies to this problem has been proposed over the years. For Networks-on-Chip (NoC), where computational Resources are organised in a 2-D mesh connected together through Switches in an on-chip interconnection network, another possibility exists: Globally Pseudochronous Locally Synchronous clock distribution. In this paper, we present a clocking scheme for NoCs that we call Globally Pseudochronous Locally Synchronous, in which we distribute a clock with a constant phase difference between the switches. As a consequence of the phase difference, some paths along the NoC switch network become faster than the others. We call these paths Data Motorways. By adapting the switching policy in the switches to prefer data to use the motorways, we show that the latency within the network is reduced with up to 40% compared to a synchronous reference case. The phase difference between the resources also makes the circuit more tolerant to clock skew. It also distributes the current peaks more evenly across the clock period, which lead to a reduction in peak power, which in turn further reduces the clock skew and the jitter in the clock network.