ppxscal/embedding_network huggingface dataset:
Hardware system of the earth simulator
Authors: Shinichi Habata, Kazuhiko Umezawa, Mitsuo Yokokawa, Shigemune Kitawaki
Venue: Parallel Computing (2004)

The Earth Simulator (ES), developed under the Japanese government's initiative "Earth Simulator project", is a highly parallel vector supercomputer system. In this paper, an overview of ES, its architectural features, hardware technology and the result of performance evaluation are described.In May 2002, the ES was acknowledged to be the most powerful computer in the world: 35.86 teraflop/s for the LINPACK HPC benchmark and 26.58 teraflop/s for an atmospheric general circulation code (AFES). Such a remarkable performance may be attributed to the following three architectural features; vector processor, shared-memory and high-bandwidth non-blocking interconnection crossbar network.The ES consists of 640 processor nodes (PN) and an interconnection network (IN), which are housed in 320 PN cabinets and 65 IN cabinets. The ES is installed in a specially designed building, 65m long, 50m wide and 17m high. In order to accomplish this advanced system, many kinds of hardware technologies have been developed, such as a high-density and high-frequency LSI, a high-frequency signal transmission, a high-density packaging, and a high-efficiency cooling and power supply system with low noise so as to reduce whole volume of the ES and total power consumption.For highly parallel processing, a special synchronization means connecting all nodes, Global Barrier Counter (GBC), has been introduced.
Reducing Energy Consumption of Disk Storage Using Power-Aware Cache Management
Authors: Qingbo Zhu, Francis M. David, Christo F. Devaraj, Zhenmin Li, Yuanyuan Zhou, Pei Cao
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Reducing energy consumption is an important issue for data centers. Among the various components of a data center, storage is one of the biggest consumers of energy. Previous studies have shown that the average idle period for a server disk in a data center is very small compared to the time taken to spin down and spin up. This significantly limits the effectiveness of disk power management schemes. This paper proposes several power-aware storage cache management algorithms that provide more opportunities for the underlying disk power management schemes to save energy. More specifically, we present an off-line power-aware greedy algorithm that is more energy-efficient than Beladyýs off-line algorithm (which minimizes cache misses only). We also propose an online power-aware cache replacement algorithm. Our trace-driven simulations show that, compared to LRU, our algorithm saves 16% more disk energy and provides 50% better average response time for OLTP I/O workloads. We have also investigated the effects of four storage cache write policies on disk energy consumption.
Internet diffusion in Chinese companies
Authors: Xunhua Guo, Guoqing Chen
Venue: Communications of the ACM (2005)

The Internet is increasingly indispensable to national economies worldwide. Here, we focus on the Internet diffusion process in Chinese businesses and its link to the general growth of IT spending throughout the Chinese economy. Our results are based on our 10-year investigation of IT adoption in Chinese companies and industry-specific patterns of Internet diffusion and related IT spending growth. IT applications in China were introduced relatively late in Internet evolution compared to those in the developed countries, forcing business managers to contend with a lack of experience, know-how, and infrastructure. This late start has also meant that Chinese companies are able to choose from relatively more advanced technologies, learn from the experience of others, and be less bothered by the problems associated with legacy systems. In addition, because China generally uses IT differently from other countries, it is worth investigating the process through which Chinese companies adopt new technology, as well as any patterns that have emerged within it, so as to better understand how IT affects the overall Chinese economy.
StoryGrid: a tangible interface for student expression
Authors: Tom Moher, Ben Watson, Janet Kim, Claudia Hindo, Louis Gomez, Stephen Fransen, Tim McEneany
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

StoryGrid is a classroom-based design and presentation system for interactive multimedia posters. Employing the technology base first used in Eden's PitABoard, StoryGrid allows groups of learners to manipulate projected multimedia objects on a horizontal board using a small collection of shared physical tokens. In this paper, we present the ongoing design history of StoryGrid in the context of its introduction within an urban high school literature class. Interface modifications based on student and teacher feedback led on changes in token semantics and media importing methods. We describe how StoryGrid features enriched students' interpretations of literature, with particular emphasis in two areas: (1) attention to audience, and (2) reflection of multiple perspectives.
A Monocular Collision Warning System
Authors: Felix Woelk, Stefan Gehrig, Reinhard Koch
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

A system for the detection of independently moving objects by a moving observer by means of investigating optical flow fields is presented. The usability of the algorithm is shown by a collision detection application. Since the measurement of optical flow is a computationally expensive operation, it is necessary to restrict the number of flow measurements. The first part of the paper describes the usage of a particle filter for the determination of positions where optical flow is calculated. This approach results in a fixed number of optical flow calculations leading to a robust real time detection of independently moving objects on standard consumer PCs. The detection method for independent motion relies on knowledge about the camera motion. Even though inertial sensors provide information about the camera motion, the sensor data does not always satisfy the requirements of the proposed detection method. The second part of this paper therefore deals with the enhancement of the camera motion using image information. The third part of this work specifies the final decision module of the algorithm. It derives a decision (whether to issue a warning or not) from the sparse detection information.
Randomized and quantum algorithms yield a speed-up for initial-value problems
Authors: Bolesław Kacewicz
Venue: Journal of Complexity (2004)

Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration and approximation problems, for which a speed-up is shown in many important cases by quantum computers with respect to deterministic and randomized algorithms on a classical computer. In this paper, we deal with the randomized and quantum complexity of initial-value problems. For this nonlinear problem, we show that both randomized and quantum algorithms yield a speed-up over deterministic algorithms. Upper bounds on the complexity in the randomized and quantum settings are shown by constructing algorithms with a suitable cost, where the construction is based on integral information. Lower bounds result from the respective bounds for the integration problem.
Performance evaluation of demodulation with diversity: a combinatorial approach II: bijective methods
Authors: D. Krob, E. A. Vassilieva
Venue: Discrete Applied Mathematics (2005)

This paper is devoted to the presentation of a combinatorial approach for analyzing the performance of a generic family of demodulation methods used in mobile telecommunications. We show that a fundamental formula in this context is in fact highly connected with a slight modification of a very classical bijection of Knuth between pairs of Young tableaux of conjugate shapes and {0, 1}-matrices. These considerations allowed us to obtain the first explicit expressions for several important specializations of the performance evaluation formula that we studied.
An Experimental Comparison of a Hierarchical Range Image Segmentation Algorithm
Authors: Gustavo Osorio, Pierre Boulanger, Flavio Prieto
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper describe a new algorithm to segment range images into continuous regions represented by Bézier polynomials. The main problem in many segmentation algorithms is thatit is hard to accurately detect at the same time large continuous regions and their boundary location. In this paper, a Bayesian framework is used to determine through a region growing process large continuous regions. Following this process, an exact description of the boundary of each region is computed from the mutual intersection of the extracted parametric polynomials followed by a closure and approximation of this new boundary using a gradient vector flow algorithm. This algorithm is capable of segmenting not only polyhedral objects but also sculptured surfaces by creating a network of closed trimmed Bézier surfaces that are compatible with most CAD systems. Experimental results show that significant improvement of region boundary localization and closure can be achieved. In this paper, a systematic comparison of our algorithm to the most well known algorithms in the literature is presented to highlight its performance.
Randomized algorithms
Authors: Yana Kortsarts, Jeffrey Rufinus
Venue: Journal of Computing Sciences in Colleges (2005)

This tutorial will illustrate the power of randomization in algorithms. The history of algorithms begins with deterministic algorithms. Deterministic algorithms are more natural, are usually easier to analyze, and are usually easier to understand by students. The question is: why insert randomization into something as organized as algorithms? At the end of the seventies computer scientists came to realize of several important advantages of randomized algorithms. These algorithms can be much simpler as well as provably faster. An even more substantial issue is that of foiling an adversary. While it is easy to design bad instances for a deterministic algorithm by choosing its worst input, typically a randomized algorithm has the same or roughly the same expected running time over all inputs. In some cases the only known polynomial algorithm is a randomized one. For some problems in parallel algorithms it is possible to prove the existence of an exponential gap between the best deterministic and the best randomized algorithm.
Classification of EMG Signals Using PCA and FFT
Authors: Nihal Fatma Güler, Sabri Koçer
Venue: Journal of Medical Systems (2005)

In this study, the fast Fourier transform (FFT) analysis was applied to EMG signals recorded from ulnar nerves of 59 patients to interpret data. The data of the patients were diagnosed by the neurologists as 19 patients were normal, 20 patients had neuropathy and 20 patients had myopathy. The amount of FFT coefficients had been reduced by using principal components analysis (PCA). This would facilitate calculation and storage of EMG data. PCA coefficients were applied to multilayer perceptron (MLP) and support vector machine (SVM) and both classified systems of performance values were computed. Consequently, the results show that SVM has high anticipation level in the diagnosis of neuromuscular disorders. It is proved that its test performance is high compared with MLP.
LiPaR: A light-weight parallel router for FPGA-based networks-on-chip
Authors: Balasubramanian Sethuraman, Prasun Bhattacharya, Jawad Khan, Ranga Vemuri
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Present day technology for ASICs supports Networks-on-Chip designs which can have 100 million gates on a single chip. The latest FPGAs can support only about 10 million gates to accomodate all logic and the associated routing. In order to implement a competitive NoC architecture in FP-GAs, the area occupied by the network should be kept to a minimum. This ensures that the maximum area can be utilized by the logic while maintaining the performance of the router network. Reducing area also reduces the power consumption. In this paper, we implement a parallel router which can support five simultaneous routing requests at the same time with an area overhead of only 352 Xilinx Virtex-II Pro FPGA slices (2. 57% of XC2VP30). We introduce optimizations in XY routing and decoding logic thereby gaining in area and performance. The header overhead is 8 bits per packet and the packet size can vary between 16 and 128 bits. We also implement a 3 x 3 mesh network with a total area overhead of 28% leaving 72% of the area available for the logic in a Virtex-II Pro XC2VP30 device. We characterize the router and several mesh networks for power and performance parameters.
What happens after Python in CS1?
Authors: Joseph D. Oldham
Venue: Journal of Computing Sciences in Colleges (2005)

In 2000 -- 2001 Centre College began using Python as the first language in a breadth first CS1 taken by both majors and non-majors. Shannon described that course our choice of Python for that course in [5]. At this point all matriculating students in our program used Python as a first language in that CS1 course. In general we are happy with the choice, and we have the experience to say why. We can also point out some issues that have arisen as a result of the choice.
Placement of modules with irregular shapes in layout design
Authors: R. H. J. M. Otten, A. A. Szepieniec
Venue: ACM SIGDA Newsletter (1979)

In this paper a fast algorithm for placing modules is presented. It gradually transforms a graph structure into a highly packed placement. The positioning of the modules is such that subsequent wiring procedures can be kept simple and total interconnection length can be relatively small. Restrictions on the shapes of the concerned modules are much weaker than those imposed by algorithms with for the rest comparable potency. In an example the algorithm is applied to bipolar integrated circuits with one wiring layer.
Single-authored publications in the sciences at Israeli universities
Authors: Miriam Farber
Venue: Journal of Information Science (2005)

This Brief Communication examines the extent of publications written by a single author in different disciplines in Israeli universities. In the natural sciences the share of single-authored articles in the total amount of publications varies slightly between the different fields of science. A significant difference was found while comparing natural sciences as a whole with mathematics and a major one when compared with the social sciences and humanities. The conclusion is that the more theoretical is the research and the greater the share of the initial idea in the finished article, the higher the probability that a single person will publish it.
Book review: Metaphor & Knowledge Representation By Eileen Cornell Way (Kluwer, 1991) and Analogy for Automated Reasoning By Stephen Owen (Academic Press, 1990)
Venue: ACM SIGART Bulletin (1992)

In investigations of natural language the abiding assumption has been that language is largely literal and that phenomena like metaphor and analogy are epiphenomenal aberrations, decorative gimcracks to amuse us. In recent years, a well-spring of research in philosophy and linguistics has argued that this view is not wholly true (see e.g., Lakoff amp; Johnson, 1980); arguing that language is fundamentally metaphorical or analogical. Eileen Way stands very much in this tradition and provides us with a very comprehensive and interesting review of its philosophical roots. She is also one of the first to try to carry such views on metaphor through to a computational implementation. As the title of the book suggests, her focus is mainly on metaphor rather than analogy but she does refer to some of the recent research on analogy (mainly with a view to arguing that it is something that metaphor is not).
Accelerating Statistical Texture Analysis with an FPGA-DSP Hybrid Architecture
Authors: F. Ibarra Pico, S. Cuenca Asensi, V. Corcoles
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

Nowadays, most image processing systems are implemented using either MMX-optimized software libraries or, when time requirements are limited, expensive high performance DSP-based boards. In this paper we present a texture analysis co-processor concept that permits the efficient hardware implementation of statistical feature extraction, and hardware-software codesign to achieve high-performance low-cost solutions. We propose a hybrid architecture based on FPGA chips, for massive data processing, and digital signal processor (DSP) for floating-point computations. In our preliminary trials with test images, we achieved sufficient performance improvements to handle a wide range of real-time applications.
Multiple License Plate Detection for Complex Background
Authors: Ching-Tang Hsieh, Yu-Shan Juan, Kuo-Ming Hung
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper presents a wavelet transform based method for extracting license plates from cluttered images. The proposed system consists of three major stages. First, wavelet transform based method is used for extracting important contrast features as guides to search for desired license plates. Then, finding a reference line in HL subimage plays an important role to locate the desired license plate region roughly. According to the reference line we can decrease the searching region of license plate and speed up the execution time. The last stage of the method to locate the license plate accurately by license plate adjustment. More importantly, the proposed detection method can locate multiple plates with different orientations in one image. Since the feature extracted robust to complex backgrounds, the proposed method works well in extracting differently illuminated and oriented license plates. The average accuracy of detection is 92.4%.
Approximation algorithm for weighted weak vertex cover
Authors: Yong Zhang, Hong Zhu
Venue: Journal of Computer Science and Technology (2004)

The problem of efficiently monitoring the network flow is regarded as the problem to find out the minimum weighted weak vertex cover set for a given graph G = (V, E). In this paper, we give an approximation algorithm to solve it, which has the approximation ratio In d + 1, where d is the maximum degree of the vertex in graph G, and improve the previous work.
Approximation in rough native spaces by shifts of smooth kernels on spheres
Authors: J. Levesley, X. Sun
Venue: Journal of Approximation Theory (2005)

Within the conventional framework of a native space structure, a smooth kernel generates a small native space, and "radial basis functions" stemming from the smooth kernel are intended to approximate only functions from this small native space. Therefore their approximation power is quite limited. Recently, Narcowich et al. (J. Approx. Theory 114 (2002) 70), and Narcowich and Ward (SIAM J. Math. Anal., to appear), respectively, have studied two approaches that have led to the empowerment of smooth radial basis functions in a larger native space. In the approach of [NW], the radial basis function interpolates the target function at some scattered (prescribed) points. In both approaches, approximation power of the smooth radial basis functions is achieved by utilizing spherical polynomials of a (possibly) large degree to form an intermediate approximation between the radial basis approximation and the target function. In this paper, we take a new approach. We embed the smooth radial basis functions in a larger native space generated by a less smooth kernel, and use them to approximate functions from the larger native space. Among other results, we characterize the best approximant with respect to the metric of the larger native space to be the radial basis function that interpolates the target function on a set of finite scattered points after the action of a certain multiplier operator. We also establish the error bounds between the best approximant and the target function.
An Update Protocol for XML Documents in Distributed and Cooperative Systems
Authors: Yunhua Koglin, Giovanni Mella, Elisa Bertino, Elena Ferrari
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Securing data is becoming a crucial need for most internet-based applications. Whereas the problem of data confidentiality has been widely investigated, the problem of how to ensure that data, when moving among different parties, are modified only according to the stated policies has been so far not deeply investigated. In this paper, we propose an approach supporting parallel and distributed secure updates to XML documents. The approach, based on the use of a security region-object parallel flow (S-RPF) graph protocol, is particularly suited for all environments requiring cooperative updates to XML documents. It allows different users to simultaneously update different portions of the same document, according to the specified access control policies. Additionally, it supports a decentralized management of update operations in that a subject can exercise its privileges and verify the correctness of the operations performed so far on the document without interacting, in most of the cases, with the document server.
Interdependent components of web accessibility
Authors: Wendy A. Chisholm, Shawn Lawton Henry
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Increasingly, the Web is providing unprecedented access to information and interaction for people with disabilities. However, the Web will not be equally accessible, allowing people with disabilities to access and contribute to the Web, until:&bull; Authoring tools and development environments (including content managements systems such as blogging applications) produce accessible Web content and have accessible interfaces;&bull; Browsers, multimedia players and assistive technologies provide a completely usable and accessible experience;Content is designed to be accessible.Web accessibility relies on tools that are designed to work together and support the needs of the people who use them. This paper describes how Web accessibility depends on several components working together. It demonstrates the relationship between the World Wide Web Consortium (W3C) Web Accessibility Initiative (WAI) guidelines: Web Content Accessibility Guidelines (WCAG), Authoring Tool Accessibility Guidelines (ATAG), and User Agent Accessibility Guidelines (UAAG).
Enhancing NIC Performance for MPI using Processing-in-Memory
Authors: Arun Rodrigues, Richard Murphy, Ron Brightwell, Keith D. Underwood
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

Processing-in-Memory (PIM) technology encompasses a range of research leveraging a tight coupling of memory and processing. The most unique features of the technology are extremely wide paths to memory, extremely low memory latency, and wide functional units. Many PIM researchers are also exploring extremely fine-grained multi-threading capabilities. This paper explores a mechanism for leveraging these features of PIM technology to enhance commodity architectures in a seemingly mundane way: accelerating MPI. Modern network interfaces leverage simple processors to offload portions of the MPI semantics. particularly the management of posted receive and unexpected message queues. Without adding cost or increasing clock frequency, using PIMs in the network interface can enhance performance. The results are a significant decrease in latency and increase in small message bandwidth, particularly when long queues are present.