ppxscal/embedding_network huggingface dataset:
Demand-driven structural testing with dynamic instrumentation
Authors: Jonathan Misurda, James A. Clause, Juliya L. Reed, Bruce R. Childers, Mary Lou Soffa
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Producing reliable and robust software has become one of the most important software development concerns in recent years. Testing is a process by which software quality can be assured through the collection of information. While testing can improve software reliability, current tools typically are inflexible and have high over-heads, making it challenging to test large software projects. In this paper, we describe a new scalable and flexible framework for testing programs with a novel demand-driven approach based on execution paths to implement test coverage. This technique uses dynamic instrumentation on the binary code that can be inserted and removed on-the-fly to keep performance and memory overheads low. We describe and evaluate implementations of the framework for branch, node and defuse testing of Java programs. Experimental results for branch testing show that our approach has, on average, a 1.6 speed up over static instrumentation and also uses less memory.
Sketching the Future of the SmartMesh Wide Area Haptic Feedback Device by Introducing the Controlling Concept for such a Deformable Multi-loop Mechanism
Authors: Andrea Mazzone, Andreas Kunz
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Lately, we have been proposing a novel concept for a wide area haptic feedback device. It is based on a deformable mechanical structure capable of morphing its shape in order to imitate a desired object. Due to the physical presence of the resulting shape, the latter can intuitively be touched and explored with the whole hand. The prototype has been called SmartMesh [1]. After a short review of the SmartMesh mechanism, this paper focuses on the controllability issue of such a multi-degree of freedom structure and introduces the concept and the implementation of the control algorithm responsible for providing the required parameters for the actuation of the mechanical structure. The results emphasize the amazing deformation capability and expressiveness of a future haptic feedback enabled user interface device based on the SmartMesh concept.
Self-healing web service compositions
Authors: Sam Guinea
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Web browsing today: the impact of changing contexts on user activity
Authors: Kirstie Hawkey, Kori Inkpen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Although web browsing behaviour was studied in detail in the mid-to-late 1990s, few recent results have been reported. The nature of web browsing has changed significantly since these early studies, both in the profile of the typical web user and in the context of their browsing (e.g. location, connection speed, web browser features). This paper reports on per-session and per-browser window usage, such as the number of pages visited and the speed of browsing. Some of our findings differ from previously published results that continue to motivate research in this area. Our research indicates that changes in user behaviour, such as the magnitude of web browsing activity, may place restrictions on web-browser related applications.
Design automation in creativity development
Authors: Akira Ishikawa, Hiroshi Mieno, Kazuo Sakamoto
Venue: ACM SIGDA Newsletter (1979)

Although the development of creativity and related issues have been studied for ages, we have as yet to reach a gratifying plateau, due partially to a slow progress in cerebral physiology and partially, on the part of studies on creativity process itself.
Distributed data-centric application development using multiple mobile devices
Authors: Masayuki Iwai, Hideyuki Tokuda
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Components on embedded devices, such as networked appliances and sensors, are rapidly spreading. However, it is getting more difficult for users to keep track of all of the distributed components. Wireless connections among embedded introduces further confusion. To enable users to develop and manage distributed applications in such an environment, we have developed a middleware named uBlocks. uBlocks helps construction of data-centric applications on distributed components through multiple kinds of mobile devices from multiple users. uBlocks is based on a concurrent scheme named Independent Modeling Scheme. This technique models the component relationship to be monitor and modified it simultaneously through multi-modal/multiple user interfaces. In this paper, we describe the design and implementation of uBlocks and evaluate the system's performance.
Didactical and technological issues during the development process of e-learning courses
Authors: Georgi Tuparov, Daniela Dureva-Tuparova, Juliana Peneva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper focuses on some problems concerning didactical and technological issues during the design process of e-learning courses. A didactical model that comprises all the entities of an e-learning course has been developed. This model represents the educational activities, the interactions between learners and instructors, basic characteristics of educational objects, educational resources etc. The underlying technologies being applicable to the implementation of e-learning courses have also been summarized.
Instructional strategies for a graduate level information security management course
Authors: Sunil Hazari
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

This paper presents instructional strategies used in a graduate level information security management course to provide value-added learning to students. New technologies are making it possible to add interactivity to course materials. A graduate level course relies primarily on discussions and case study evaluations of security related topics. Using a theoretical framework of information security, development of instructional activities in the course built around the framework are presented. Details about discussions, case studies, online component using web based learning, and experiential learning are also mentioned. Student evaluations of the course are then presented to give educators an idea of how interactive course components can benefit students in graduate information security courses.
Hexagonal storage scheme for interleaved frame buffers and textures
Authors: Yosuke Bando, Takahiro Saito, Masahiro Fujita
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

This paper presents a storage scheme which statically assigns pixel/texel coordinates to multiple memory banks in order to minimize frame buffer and texture memory access load imbalance. In this scheme, the pixels stored in a particular memory bank are placed at the center and the vertices of hexagons packed in the frame buffer By making these hexagons close to regular so that the pixel placement is uniform and isotropic, frame buffer and texture memory accesses are evenly distributed over the memory banks. The analysis of memory access patterns in rendering typical 3D graphics scenes shows that the hexagonal storage scheme can reduce rendering performance degradation due to bank conflicts by an average of 10% compared to the traditional rectangular storage scheme.
A Fast Fuzzy-Based (",")-Fair Rate Allocation Algorithm
Authors: P. Goudarzi, F. Sheikholeslam
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Providing fairness is one of the most important requirements of a rate assignment strategy. Many fairness criteria have been proposed by different researchers. A fuzzy-based rate allocation strategy is proposed which can provide a wide range of fairness criteria (such as proportional, minimum potential delay, and max min) in the network. The algorithm is superior to conventional algorithms in convergence speed. Stability analysis is performed using suitable Lyapunov functions. In this algorithm, users can adjust their gain parameters in the rate allocation algorithm, using a fuzzy controller based on some information that is received from network. The stability of the algorithm is also investigated in the presence of propagation delays. As simulation results show, the proposed rate allocation method, while maintaining stability, outperforms the conventional ones in the rate of convergence.
On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves
Authors: Florian Hess, Igor E. Shparlinski
Venue: Designs, Codes and Cryptography (2005)

We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.
A low cost, multithreaded processing-in-memory system
Authors: Jay B. Brockman, Shyamkumar Thoziyoor, Shannon K. Kuntz, Peter M. Kogge
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

This paper discusses die cost vs. performance tradeoffs for a PIM system that could serve as the memory system of a host processor. For an increase of less than twice the cost of a commodity DRAM part, it is possible to realize a performance speedup of nearly a factor of 4 on irregular applications. This cost efficiency derives from developing a custom multithreaded processor architecture and implementation style that is well-suited for embedding in a memory. Specifically, it takes advantage of the low latency and high row bandwidth to both simplify processor design --- reducing area --- as well as to improve processing throughput. To support our claims of cost and performance, we have used simulation, analysis of existing chips, and also designed and fully implemented a prototype chip, PIM Lite.
Randomized Trees for Real-Time Keypoint Recognition
Authors: Vincent Lepetit, Pascal Lagger, Pascal Fua
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of such a point. We used a K-mean plus Nearest Neighbor classifier to validate our approach, mostly because it was simple to implement. It has proved effective but still too slow for real-time use. In this paper, we advocate instead the use of randomized trees as the classification technique. It is both fast enough for real-time performance and more robust. It also gives us a principled way not only to match keypoints but to select during a training phase those that are the most recognizable ones. This results in a real-time system able to detect and position in 3D planar, non-planar, and even deformable objects. It is robust to illuminations changes, scale changes and occlusions.
Backgammon program beats world champ
Authors: Hans Berliner
Venue: Issue 69 (January 1980) (1980)

On July 15,1979 in Monte Carlo world history was made as a computer program for the first time beat a recognized world champion at his own game. BKG 9.8, authored by Hans Berliner of the Computer Science Department, Carnegie-Mellon University, Pittsburgh, 15213, beat Luigi Villa, the newly crowned Backgammon World Champion in a seven point match 7-1. It should be noted that during the match both opponents palyed well; however, Villa played clearly better. However, as an examination of the game records below will confirm, on this occasion BKG 9.8 was the beneficiary of the element of luck in the game of backgammon, and this accounts for the lop-sided score.
Enhancing Availability of Grid Computational Services to Ubiquitous Computing Applications
Authors: Nirmalya Roy, Sajal K. Das, Kalyan Basu, Mohan Kumar
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The Grid is an integrated infrastructure that can play the dual roles of a coordinated resource consumer as well as a donator in distributed computing environments. In a mobile grid environment, the Grid acts as a resource hungry consumer whereas in ubiquitous computing environments, it has the inherent potential to provide services to applications. The enormous growth in the use of mobile and embedded devices in ubiquitous computing environment and their interaction with human beings produces a huge amount of data that needs to be processed swiftly anytime anywhere. However, most devices used in ubiquitous environments have limited resources in terms of CPU, storage, battery power and communication bandwidth. In such ubiquitous computing platforms, there is a need to transfer application services to computational resources. In this paper, we investigate the use of the Grid as a candidate for provisioning computational services to applications in ubiquitous computing environments. In particular, we present a competitive model that describes the possible interaction between the competing resources in the Grid Infrastructure as service providers and ubiquitous applications as subscribers. The competition takes place in terms of quality of service (QoS) offered by different Grid Service Providers. The ubiquitous users' resource demands depend not only on the QoS parameters (e.g., response time and loss probability in our context) offered by that service provider but also upon those of its competitors. We develop a stochastic equilibrium model for QoS assurance. Based upon those QoS parameters, we propose two types of demand models whose distribution functions are closely correlated with service level QoS parameters. We proceed to present the equilibrium behavior of our model facing global competition under stochastic demand and estimation of guaranteed QoS assurance level satisfying the requirement of ubiquitous application efficiently. Simulation results show that our proposed framework maximizes the provider's expected revenue at the optimal point of different QoS parameters.
Review of "IPv6 Network Programming by Jun-ichiro itojun Hagino," Digital Press, 2004, $49.95, ISBN: 1555583180
Authors: A. Mariën
Venue: Queue (2005)

Addison-Wesley Professional, 2004, $49.99 ISBN: 0321224094 I have been teaching an advanced course on design methodologies for more than a decade, and its content has evolved to keep up with changes in the application domains, implementation technologies, and advancements in design methods. Until I read this book, however, I did not realize that, as designers of software solutions, we need to have a good understanding of how to actually build privacy functionalities into the solutions we develop and deliver. Therefore, just as implementing security in software solutions is now viewed as a responsibility of software architects, I feel that privacy will be the next new responsibility of designers of software solutions. The question arises: What do we need to know to fulfill this new responsibility? This book provides an answer to this question. Specifically, it suggests that software designers need to know about privacy legislation, understand privacy-enhancing technologies, and possess the expertise to build privacy-aware applications.
Mitigating Denial of Service Attacks with Password Puzzles
Authors: Miao Ma
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The client puzzles have been proposed as an important mechanism in defending against distributed denial-ofservice (DDoS) attacks. In this paper we propose a new IP layer client puzzles scheme, password puzzles (PP). In this scheme a puzzle issuer, on the behalf of a receiver, responds to requests with puzzles that a sender must solve before sending in any packet to a receiver. We design two new puzzle types, hash-chain-reversal puzzles and multiple-hash-chains-reversal puzzles, with which a sender is expected to reverse one (multiple) hash chain(s) and send in packets with valid passwords (i.e., solutions of puzzles) to the receiver. Our design achieves three main properties. First, the PP scheme is able to generate puzzles with different difficulties flexibly for various clients. Second, a puzzle issuer is able to generate puzzles at a per-flow and per-packet basis. Third, the PP scheme is able to converge to be a "non-puzzle" protocol.
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Authors: Waleed Alsalih, Selim Akl, Hossam Hassanein
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, handheld devices and cell phones, as well as the recent advances in wireless communication technologies are the principal motivators of this research area. However, battery energy limitation is the main challenge towards enabling persistent mobile computing. Several hardware based techniques have been proposed; this has led to more energy-efficient systems. Nevertheless, the problem still remains and there is a consensus that software based techniques have the potential to reduce energy demand and contribute to solve the problem. In this paper, we look into the problem of distributing computational tasks amongst a set of mobile computing devices in a Mobile wireless Ad hoc NETwork (MANET) in such a way that conserves energy and improves performance. In such a distributed environment, the assignment of computational tasks to different devices and the order of their execution play a vital role in energy conservation and performance improvement. The main contributions of this paper are formulating a novel energy-aware scheduling problem and proposing a heuristic algorithm to solve it. Our scheduling algorithm schedules a set of computational tasks, which may have dependencies and communication, into a set of heterogeneous processors in such a way that minimizes both the total consumed energy and the makespan (i.e., the time by which all tasks complete their execution). Experiments show that significant improvement can be achieved by using our scheduler.
Collaborative joins in a pervasive computing environment
Authors: Filip Perich, Anupam Joshi, Yelena Yesha, Tim Finin
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

We present a collaborative query processing protocol based on the principles of Contract Nets. The protocol is designed for pervasive computing environments where, in addition to operating on limited computing and battery resources, mobile devices cannot always rely on being able to access the wired infrastructure. Devices, therefore, need to collaborate with each other in order to obtain data otherwise inaccessible due to the nature of the environment. Furthermore, by intelligently using answers cached by peers, devices can reduce their computation cost. We show the effectiveness of our approach by evaluating performance of devices querying for data while moving in a citylike environment.
Parallel bandwidth characteristics calculations for thin avalanche photodiodes on a SGI Origin 2000 supercomputer: Performances
Authors: Yi Pan, Constantinos S. Ierotheou, Majeed M. Hayat
Venue: Concurrency and Computation: Practice Experience (2004)

An important factor for high-speed optical communication is the availability of ultrafast and low-noise photodetectors. Among the semiconductor photodetectors that are commonly used in today's long-haul and metro-area fiber-optic systems, avalanche photodiodes (APDs) are often preferred over p-i-n photodiodes due to their internal gain, which significantly improves the receiver sensitivity and alleviates the need for optical pre-amplification. Unfortunately, the random nature of the very process of carrier impact ionization, which generates the gain, is inherently noisy and results in fluctuations not only in the gain but also in the time response. Recently, a theory characterizing the autocorrelation function of APDs has been developed by us which incorporates the dead-space effect, an effect that is very significant in thin, high-performance APDs. The research extends the time-domain analysis of the dead-space multiplication model to compute the autocorrelation function of the APD impulse response. However, the computation requires a large amount of memory space and is very time consuming. In this research, we describe our experiences in parallelizing the code in MPI and OpenMP using CAPTools. Several array partitioning schemes and scheduling policies are implemented and tested. Our results show that the code is scalable up to 64 processors on a SGI Origin 2000 machine and has small average errors. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Robust Color-Based Tracking
Authors: Feng Liu, Qingshan Liu, Hanqing Lu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Color as a distinct feature is widely used for object representation and tracking. However, color-based tracking is often influenced by clutter background and illumination variation. This paper presents a robust color-based tracking method, in which robust color feature is extracted for constructing observation model under the modified Particle Filter tracking framework. The object is represented by its dominant color, and the weighted histogram with spatial information of the dominant color is used to optimize object models. In the Particle Filter framework, an extended iterated likelihood weighting scheme is employed to utilize more valuable particles. The experimental results show it is a real-time robust tracker, and it can obtain more than 30fps with 2.4 G CPU and 512 M RAM.
Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration
Authors: Jose Duato, Olav Lysne, Ruoming Pang Timothy M. Pinkston
Venue: IEEE Transactions on Parallel and Distributed Systems (2005)

This paper develops theoretical support useful for determining deadlock properties of dynamic network reconfiguration techniques and also serves as a basis for the development of design methodologies useful for deriving deadlock-free reconfiguration techniques. It is applicable to interconnection networks typically used in multiprocessor servers, network-based computing clusters, and distributed storage systems, and also has potential application to system-on-chip networks. This theory builds on basic principles established by previous theories while pioneering new concepts fundamental to the case of dynamic network reconfiguration.