ppxscal/embedding_network huggingface dataset:
TreadMarks: distributed shared memory on standard workstations and operating systems
Authors: Pete Keleher, Alan L. Cox, Sandhya Dwarkadas, Willy Zwaenepoel
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation-5000/240's that are connected by a 100-Mbps switch-based ATM LAN and a 10-Mbps Ethernet. Our objective is to determine the efficiency of a user-level DSM implementation on commercially available workstations and operating systems. We achieved good speedups on the 8-processor ATM network for Jacobi (7.4), TSP (7.2), Quicksort (6.3), and ILINK (5.7). For a slightly modified version of Water from the SPLASH benchmark suite, we achieved only moderate speedups (4.0) due to the high communication and synchronization rate. Speedups decline on the 10-Mbps Ethernet (5.5 for Jacobi, 6.5 for TSP, 4.2 for Quicksort, 5.1 for ILINK, and 2.1 for Water), reflecting the bandwidth limitations of the Ethernet. These results support the contention that, with suitable networking technology, DSM is a viable technique for parallel computation on clusters of workstations. To achieve these speedups, TreadMarks goes to great lengths to reduce the amount of communication performed to maintain memory consistency. It uses a lazy implementation of release consistency, and it allows multiple concurrent writers to modify a page, reducing the impact of false sharing. Great care was taken to minimize communication overhead. In particular, on the ATM network, we used a standard low-level protocol, AAL3/4, bypassing the TCP/IP protocol stack. Unix communication overhead, however, remains the main obstacle in the way of better performance for programs like Water. Compared to the Unix communication overhead, memory management cost (both kernel and user level) is small and wire time is negligible. This research was supported in part by the National Science Foundation under Grants CCR-9116343, CCR-9211004, CDA-9222911, and CDA-9310073, by the Texas Advanced Technology Program under Grant 003604014, and by a NASA Graduate Fellowship.
FSA SiP Market and Patent Analysis Report
Authors: FSA SiP subcommittee
Venue: IEEE Design Test (2007)

SoC technology has historically brought challenges to engineers, from design to final test. So, industry has been searching for solutions that can implement SoCs with relatively less difficulty. In the packaging industry, system-in-package (SiP) technology is a potential solution for reducing or eliminating SoC bottlenecks. SiP technology integrates various functional dies with different process technologies onto one substrate. Moreover, SiP technology lets customers freely select different packaging methodologies and substrate materials according to different product requirements. Considering the huge potential cost of SoC development, SiP is an alternative that can shrink component size and increase system operating speed. Many smaller-scale manufacturers in Taiwan that are unable to invest in advanced packaging process equipment, for example, can still leverage traditional packaging resources and technologies acquired in the past to further drive SiP technology research and development, and they can penetrate higher-margin SiP module design areas through SiP technology development. This FSA report (a shorter version of an earlier report released by FSA in September 2006) provides an in-depth introduction and analysis on SiP technology by discussing SiP market perspectives and related SiP patent issues.
Communication Optimizations Used in the Paradigm Compiler for Distributed-Memory Multicomputers
Authors: Daniel J. Palermo, Ernesto Su, John A. Chandy, Prithviraj Banerjee
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

The PARADIGM (PARAllelizing compiler for DIstributed-memory General-purpose Multicomputers) project at the University of Illinois provides a fully automated means to parallelize programs, written in a serial programming model, for execution on distributed-memory multicomputers. To provide efficient execution, PARADIGM automatically performs various optimizations to reduce the overhead and idle time caused by interprocessor communication. Optimizations studied in this paper include message coalescing, message vectorization, message aggregation, and coarse gram pipelining. To separate the optimization algorithms from machine-specific details, parameterized models are used to estimate communication and computation costs for a given machine. The models are also used in coarse gram pipelining to automatically select a task granularity that balances the available parallelism with the costs of communication. To determine the applicability of the optimizations on different machines, we analyzed their performance on an Intel iPSC/860, an Intel iPSC/2, and a Thinking Machines CM-5.
Introductory physics: an attempt to change attitudes
Authors: E. W. Thomas
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only given. We discuss attempts to change the attitude of students towards an electricity and magnetism class taken by engineering majors in the required Introductory Physics sequence. Class size is large (150 to 200 students) leading to little personal interaction. Testing has, in the past, been based on multiple choice problems which may be graded efficiently. We have demonstrated that students do not solve these from the physics but rather develop strategies for selection of answers based on memorized rules and formulae. The two popular texts at this level encourage memorization by listing formulae to be remembered and by supplying training questions which are easily related to the formula lists rather than to the text. The overall student attitude is that they should approach the course by memorizing operational formulae. Performance is poor with up to 30% failing to attain a satisfactory grade. We have been attempting to change the student attitude towards the course and to improve performance.
An integrated computer architecture experience
Authors: E. W. Johnson
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper presents a collaborative effort to combine a computer architecture lecture course with a computer topics laboratory. This integrated course provided the students with an opportunity to apply VHDL modeling to semester-long projects that illustrated many of the points learned in the lecture course. It also gave the students an opportunity to see the same material from two different perspectives, and increased teamwork skills of both the students and the faculty members involved.
Status and issues in international accreditation of computer science and engineering programs
Authors: W. K. King
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only given. Thirty-nine professionals representing 19 countries attended an International Workshop on Computer Science and Engineering Accreditation in Salt Lake City, Utah, November 10-11 1996. Some of the findings and conclusions of the workshop are: program accreditation is recognized as an effective mechanism for assisting in quality assurance of academic programs, and enhancing the opportunities for international interchange; there is significant international interest in the expansion and coordination of accreditation of academic programs in computer science and engineering; there is a significant need to exchange information regarding all aspects of the accreditation process; and a "Salt Lake City Accord", for international mutual recognition of accreditation of computer science and engineering should be a long-term objective of all attending the workshop. Since the Workshop, a number of events appears to confirm those findings. The status of computer science and engineering accreditation world wide is reported and, in view of the developments, the ways and means to achieve the "Salt Lake City Accord" are discussed.
Development and Realization of a Street Driving Simulator for Virtual Tour
Authors: Lianxing Jia, Shigang Han, Lin Wang, Hua Liu
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

The paper describes the creation of a street driving simulator for virtual tour. The simulator uses real-time interactive virtual environment technology to immerse visitors in a 3D reconstruction of some main streets of Wuhan. Visitors can sit in and operate the simulator to tour fifty kilometer long streets of the city modeled in high-resolution 3D graphics. In this project supported by City Planning Exhibition Hall of Wuhan a car driving simulator is integrated for visitors virtual tour. This paper presents the challenges associated with realistic replication of driving with special emphasis on street tour simulation. The development and realization of the new simulator and its subsystems are detailed. Equipment, 3-D database, simulation program, and interfacing elements of the simulator are presented.
Distributed text retrieval from overlapping collections
Authors: Milad Shokouhi, Justin Zobel, Yaniv Bernstein
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

In standard text retrieval systems, the documents are gathered and indexed on a single server. In distributed information retrieval (DIR), the documents are held in multiple collections; answers to queries are produced by selecting the collections to query and then merging results from these collections. However, in most prior research in the area, collections are assumed to be disjoint. In this paper, we investigate the effectiveness of different combinations of server selection and result merging algorithms in the presence of duplicates. We also test our hash-based method for efficiently detecting duplicates and near-duplicates in the lists of documents returned by collections. Our results, based on two different designs of test data, indicate that some DIR methods are more likely to return duplicate documents, and show that removing such redundant documents can have a significant impact on the final search effectiveness.
On Heuristic Time Hierarchies
Authors: Konstantin Pervyshev
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristic algorithms in such syntactic classes as NP and co-NP, and also in semantic classes AM and MA. Further, we present an alternative approach to proving time hierarchies for heuristic algorithms in BPP. This leads to a simpler proof than the one known before.
Web Service Middleware - An Infrastructure For Near Future Real Life Web Service Ecosystems
Authors: Jan Schulz-Hofen
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Free trade and the use of Web services from all over the world and across organizational borders have been an omnipresent vision since the idea of Web services arose in the late nineties. Both WS-* specifications and implementations have matured over the years. However, until now we do not perceive large-scale Web service ecosystems, in which Web services are advertised, bargained, invoked and finally charged and paid for. We believe that introducing a middleware as supporting infrastructure for Web service ecosystems promises to pave the way towards providing a wealth of available Web services to service consumers while allowing service providers to generate revenues from service delivery.
Evaluation of Human Performance with Kinematic and Haptic Errors
Authors: Tomonori Yamamoto, Allison M. Okamura
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In teleoperation systems, link °exion results in kine- matic errors, such that the position mapping between the master motion and slave motion is not correct. For haptic feedback teleoperators, this also causes errors in the direction of force feedback to the operator. This study examines human ability to compensate for rota- tional kinematic/haptic errors, where the mapping be- tween master and slave kinematics and haptics has an error of 5 degrees. Using a 2-degree-of-freedom hap- tic system, with a virtual environment representing the slave robot and environment, subjects performed ob- ject tracing tasks on either a square or a circle with various combinations of correct and incorrect kinemat- ics, and correct, incorrect, and absent haptic feedback. A point-to-point targeting task was performed between each tracing task to minimize the possibility of after- e®ects. The results showed no signi¯cance for using di®erent object shapes for the tracing task or for hav- ing haptic feedback in the targeting task. Incorrect hap- tic feedback proved to be comparable to having correct haptic feedback under our experimental conditions.
Designing for Software's Social Complexity
Authors: Jose Luiz Fiadeiro
Venue: Computer (2007)

As the "software crisis" persists, we must rethink our strategy for handling complexity. A decade ago, complexity wasphysiological; now, it is intrinsically social. Designers need methods and techniques that address the difference.
Execution patterns in object-oriented visualization
Authors: Wim De Pauw, David Lorenz, John Vlissides, Mark Wegman
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

Execution patterns are a new metaphor for visualizing execution traces of object-oriented programs. We present an execution pattern view that lets a programmer visualize and explore a program's execution at varied levels of abstraction. The view employs visual, navigational, and analytical techniques that accommodate lengthy, real-world traces. By classifying repetitive behavior automatically into high-order execution patterns, we drastically reduce the inform ation a programmer must assimilate, with little loss of in sight.
Success Factors in Mobile Viral Marketing: A Multi-Case Study Approach
Authors: Key Pousttchi, Dietmar G. Wiedemann
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

A prior study showed that mobile viral marketing is an important issue of mobile marketing. Using a multicase study research approach, we introduce a typology of four standard types of mobile viral marketing and extract eight success factors for this new form of marketing. As a final step, we structure the relationship between both, showing success factors' significance in different standard types and deriving a success factor framework. We conclude with a consideration of research implications.
Using CONDENSATION Tracking to Recover Stroke Order of Chinese Calligraphic Handwritings with CCM
Authors: WU Ying-fei, Zhuang Yue-ting, PAN Yun-he, WU Fei
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Stroke order is an intrinsic writing feature which is missing in off-line handwriting. Recovering stroke order from off-line handwriting is an important task by which the visualization of writing process is possible. Chinese Calligraphic handwriting is some different with western handwriting. Traditional method with assumption of the minimization of curvature between two adjacent line segments is not applicable for Chinese Calligraphic handwriting. We propose a new framework named Chinese Calligraphic Model (CCM). With this framework CONDENSATION algorithm - conditional density propagation over time is performed to find the best matching model in model database with the input pattern to recover stroke order. Experiments results show our method is a promising way to recover stroke order from Chinese Calligraphic handwriting based on CCM by CONDENSATION tracking.
Performance evaluation of the Cray X1 distributed shared memory architecture
Authors: D. K. Panda, J. S. Vetter, P. H. Worley
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

The Cray X1 supercomputer is a distributed shared memory vector multiprocessor, scalable to 4096 processors and up to 65 terabytes of memory. The X1's hierarchical design uses the basic building block of the multi-streaming processor (MSP), which is capable of 12.8 GF/s for 64-bit operations. The distributed shared memory (DSM) of the X1 presents a 64-bit global address space that is directly addressable from every MSP with an interconnect bandwidth per computation rate of one byte per floating point operation. Our results show that this high bandwidth and low latency for remote memory accesses translates into improved application performance on important applications, such as an Eulerian gyrokinetic-Maxwell solver. Furthermore, this architecture naturally supports programming models like the Cray shmem API, Unified Parallel C (UPC), and coarray FORTRAN (CAF), and it is imperative to select the appropriate models to exploit these features as our benchmarks demonstrate.
Ranked directional morphological filtering of impulse noise in images
Authors: Jinsung Oh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper, we present a hybrid rank-order/morphological filtering algorithm for removal of impulse noise. It consists of an impulse noise detector and a weighted rank-order morphological filter. For salt (pepper) noise suppression, a generalized directional opening (closing) filter is selectively used. The detection of impulse noise is easily done using the difference between the signal and its opening and closing. Simulations show that this new filter performs better than other nonlinear filters in preserving desired image features while effectively reducing impulse noise.
Milk or wine: does software security improve with age?
Authors: Andy Ozment, Stuart E. Schechter
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

We examine the code base of the OpenBSD operating system to determine whether its security is increasing over time. We measure the rate at which new code has been introduced and the rate at which vulnerabilities have been reported over the last 7.5 years and fifteen versions. We learn that 61% of the lines of code in today's OpenBSD are foundational: they were introduced prior to the release of the initial version we studied and have not been altered since. We also learn that 62% of reported vulnerabilities were present when the study began and can also be considered to be foundational. We find strong statistical evidence of a decrease in the rate at which foundational vulnerabilities are being reported. However, this decrease is anything but brisk: foundational vulnerabilities have a median lifetime of at least 2.6 years. Finally, we examined the density of vulnerabilities in the code that was altered/introduced in each version. The densities ranged from 0 to 0.033 vulnerabilities reported per thousand lines of code. These densities will increase as more vulnerabilities are reported.
Interference Multispectral Image Compression with Adaptive Distortion Control in Fourier Domain
Authors: Jing Ma, Chengke Wu, Dong Chen, Jie Guo
Venue: Proceedings of the 2007 Data Compression Conference (2007)

The interferential spectrometer is considered as the next generation of imaging spectrometers in aerial remote sensing. The customary multispectral images compression methods only consider the quality of reconstructed images in spatial domain without concerning the effect in Fourier domain where the application of spectrum is often used, such as substance classification and recognition. Our method WRDO-SPIHT (Weighted Rate-Distortion Optimization for SPIHT) is proposed based on the relationship between the distortion in Fourier domain and compression in spatial domain.
Robust time delay estimation using lower-order statistics
Authors: Xinyu Ma
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

New methods for time delay and frequency delay estimation are introduced based on the theory of alpha-stable distributions. It is shown that these methods are robust for both Gaussian and non-Gaussian impulsive noise environments. Their improved performance is clearly demonstrated with both computer generated data and actual radar clutter data.
Virtual Object Manipulation Using Physical Blocks
Authors: Satoshi Yonemoto, Takahiro Yotsumoto, Rin-ichiro Taniguchi
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this paper, we present a virtual object manipulation tool that can directly control virtual objects using physical objects. Physical objects can be recognized by vision based sensing. Basic manipulations using physical objects are translating, rotating, scaling and replacing with a virtual object. Those manipulations are performed by handling an object, a block. In addition to this, complicated manipulations can be realized by handling two objects with both hands. We have implemented a prototype system and assessed the effectiveness of the system by experimentally comparing it with general modeling tool. The results suggest that our object manipulation system can provide a more effective means of handling than operations in general modeling tool.
Using Grids for Exploiting Data Abundance in Science
Authors: Domenico Talia
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Digital data volumes are growing exponentially both in all sciences. To handle this abundance in data availability, scientists must embody data analysis techniques in their scientific practices and solving environments to get the benefits coming from knowledge that can be extracted from large data sources.
Enabling the European Patient Summary through Triplespaces
Authors: Reto Krummenacher, Elena Simperl, Lyndon J. B. Nixon, Dario Cerizza, Emanuele Della Valle
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

One of the main items on the eHealth agenda of the European Community is the design and promotion of electronic patient summaries as an instrument to facilitate the pervasive delivery of healthcare, thus ensuring the right to patient mobility and increasing the productivity and quality of health service delivery. From a technical point of view this objective requires middleware technology which is able to cope with the stringent interoperability, multi-lingualism, security and privacy requirements arising in eHealth settings. In this paper we present triplespace computing, a coordination middleware for the Semantic Web and demonstrate its relevance to the realization of the European patient summary infrastructure.