ppxscal/embedding_network huggingface dataset:
An empirical study of regression test application frequency: Research Articles
Authors: Jung-Min Kim, Adam Porter, Gregg Rothermel
Venue: Software Testing, Verification Reliability (2005)

Regression testing is an expensive process used to revalidate modified software. Regression test selection (RTS) techniques reduce the cost of regression testing by selecting a subset of a test suite. Many RTS techniques have been proposed, and studies have shown that they produce savings; other studies have shown that their cost-effectiveness varies with characteristics of the workloads to which they are applied. It seems plausible, however, that another factor that impacts RTS techniques involves the process by which they are applied. In particular, issues such as the frequency with which regression testing is performed affect the techniques. Thus, in earlier work an experiment was conducted to assess the effects of test application frequency on the cost-effectiveness of RTS techniques. The results exposed tradeoffs to consider when using these techniques over a series of releases. This work, however, was limited in external validity; in particular, the programs studied were relatively small. Thus, the previous experiment has been replicated on a large, multi-version program. This second experiment confirms the findings of the first. In particular, the cost of using safe RTS techniques was strongly and negatively affected by testing interval. Conversely, the effectiveness of minimization RTS techniques was strongly and positively affected. Copyright &copy; 2005 John Wiley & Sons, Ltd.
New beginnings, continued success
Authors: Kwang-Ting (Tim) Cheng
Venue: IEEE Design Test (2006)

In his first EIC message as D&T's new editor in chief, Tim Cheng notes that D&T has developed strong relationships with key electronic-design and test communities over the past several years. Such partnerships help to broaden the readership and further strengthen D&T's position as the leading magazine for the professional design, test, and design automation communities.
A Fast Full Search Equivalent Encoding Algorithm for Image Vector Quantization Based on the WHT and a LUT
Authors: Chul-hyung Ryu, Sung-woong Ra
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

The application of vector quantization has been constrained to a great deal since its encoding process is very heavy. This paper presents a fast encoding algorithm called the double feature-ordered partial codebook search (DFPS) algorithm for image vector quantization. The DFPS algorithm uses the Walsh-Hadamardtransform (WHT) for energy compaction and a look-up table (LUT) for fast reference. The simulation results show that with elaborate preprocessing and memory cost within a feasible level, the proposed DFPS algorithm is faster than other existing search algorithms. Compared with the exhaustive full search (EFS) algorithm, the DFPS algorithm reduces the computational complexity by 97.0% to 97.8% for a codebook size of 256 while maintaining the same encoding quality as that of the EFS algorithm.
Wire-bonding process development for low-k materials
Authors: Jonathan Tan, Zhao Wei Zhong, Hong Meng Ho
Venue: Microelectronic Engineering (2005)

A 60-@mm bond-pad-pitch wire-bonding process was developed using test dies with a SiO"2 dielectric layer under aluminium pads, and was then fine-tuned for a low-k device using three types of gold wires with different mechanical properties. Bulk material hardness of the wires were characterised using a wire-bonding machine, the force applied and diameters of squashed free-air balls. It was found that stiffer wires needed higher ultrasonic-generator (USG) power than a softer wire to deform the ball after impact and achieve equivalent ball size and ball shear responses. Longer bond time was also needed for the low-k material than the SiO"2 material, to overcome the energy loss due to the compliance of the low-k material. Pad damage on the low-k device was proportional to bulk material hardness. The soft 4N (99.99% purity) wire required lower USG power to achieve the bonding specification, and was the most suitable wire to be used in wire bonding of the low-k device.
The TM3270 Media-Processor
Authors: Jan-Willem van de Waerdt, Stamatis Vassiliadis, Sanjeev Das, Sebastian Mirolo, Chris Yen, Bill Zhong, Carlos Basto, Jean-Paul van Itegem, Dinesh Amirtharaj, Kulbhushan Kalra, Pedro Rodriguez, Hans van Antwerpen
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

We present the TM3270 media-processor, the latest TriMedia VLIW processor, tuned to address the performance demands of standard definition video processing, combined with embedded processor requirements for the consumer market. We discuss the architecture, implementation, and its first realization in a 90 nm process technology. The processor incorporates instruction set architectural (ISA) extensions and a load/store unit optimized for the video-processing domain. The ISA extensions improve the performance on video processing kernels. The data cache policies and prefetching techniques allow for efficient access to multimedia data. Finally, power consumption and performance data are presented.
Wikis in teaching and assessment: the M/Cyclopedia project
Authors: Axel Bruns, Sal Humphreys
Venue: Proceedings of the 2005 international symposium on Wikis (2005)

In a knowledge-based, networked economy, students leaving university need to have attained skills in collaborative and creative project-based work and to have developed critical, reflective practices. This paper outlines how a wiki can been used as part of social constructivist pedagogical practice which aims to develop advanced ICT literacies in university students. The paper describes the implementation of a wiki-based project as part of a subject in New Media Technologies at Queensland University of Technology. We discuss the strengths and challenges involved in using networked, collaborative learning strategies in institutional environments that still operate in traditional paradigms.
A Component Optimization Design Method based on Variation Point Decomposition
Authors: Wang Zhongjie, Xu Xiaofei, Zhan Dechen
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Traditional component design methods pay much attention to component's usefulness, while usually ignore the optimization on component's usability, such as reuse cost and reuse efficiency. During the whole lifecycle of component reuse, it is necessary for component to be continuously re-designed so as to reduce reuse cost under the guarantee of high reusability. In this paper, a featurebased component model is firstly introduced, with emphasis on reuse mechanism based on variation point. By analysis of constituents of component reuse cost, the optimization goal, i.e., increasing the proportion of fixed part of a component, is put forward. Then a component optimization method based on variation point decomposition is presented, i.e., decomposing every feature item of a variable feature into a set of sub-items and picking up those common sub-items as much as possible to extend fixed part of the component. Finally the effectiveness of this method is proved theoretically and practically.
Service Delivery in Context Aware Environments: Lookup and Access Control Issues
Authors: Maria Riaz, Saad Liaquat Kiani, Sungyoung Lee, Sang-Man Han, Young-Koo Lee
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Large-scale distributed systems, such as ubiquitous computing environments, require a service delivery mechanism in order to keep track of the vast set of services offered and make them available to interested clients. The amount of services and clients, their context, and loose coupling between them makes service delivery in ubiquitous environments different from other systems. This paper presents a solution to overcome these issues by utilizing the underlying ontology and semantics for service lookup. Access control over context data is also considered by specifying dynamic policies at the system and service level.
Review of "The Linux enterprise cluster by Karl Kopper", No Starch Press, 2005, $49.95 ISBN: 1593270364
Authors: G. K. Jenkins
Venue: Queue (2005)

Karl Kopper, No Starch Press, 2005, $49.95 ISBN: 1593270364 Have you ever wanted to build a highly available cluster? This book shows you how to do it, using commodity hardware and free software. Author Karl Kopper has worked with distributed computing environments on a number of platforms; he uses the cluster he successfully deployed at a food distribution company as the basis for the examples in the book.
Computational upscaled modeling of heterogeneous porous media flow utilizing finite volume method
Authors: Victor Eralingga Ginting
Venue:  (2004)

In this dissertation we develop and analyze numerical method to solve general elliptic boundary value problems with many scales. The numerical method presented is intended to capture the small scales effect on the large scale solution without resolving the small scale details, which is done through the construction of a multiscale map. The multiscale method is more effective when the coarse element size is larger than the small scale length. To guarantee a numerical conservation, a finite volume element method is used to construct the global problem. Analysis of the multiscale method is separately done for cases of linear and nonlinear coefficients. For linear coefficients, the multiscale finite volume element method is viewed as a perturbation of multiscale finite element method. The analysis uses substantially the existing finite element results and techniques. The multiscale method for nonlinear coefficients will be analyzed in the finite element sense. A class of correctors corresponding to the multiscale method will be discussed. In turn, the analysis will rely on approximation properties of this correctors. Several numerical experiments verifying the theoretical results will be given. Finally we will present several applications of the multiscale method in the flow in porous media. Problems that we will consider are multiphase immiscible flow, multicomponent miscible flow, and soil infiltration in saturated/unsaturated flow.
Special Numerical Series with Integer Terms
Authors: A. I. Ivaneshkin
Venue: Cybernetics and Systems Analysis (2005)

Special integer-valued number series are introduced and analyzed. Explicit functional dependences that uniquely determine the value of their arbitrary element are presented.
Developing Reusable Portals for Scripted Scientific Codes
Authors: Brett Beeson, Ashley Wright
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

A new portal for running scientific numerical codes on the Grid is presented. Particular emphasis is placed on portlet reusable and portability. We find that the JSR-168 standard is adequate for creating portable single portlets. For portals consisting on many portlets we present a simple, portable communication system. For Grid-based portlets, coupling to a specific portlet container or service architecture is difficult to avoid. Strategies for avoiding such coupling, and future directions in shared portlet development are outlined.
Towards a Technology and Architecture Hybrid?
Authors: Thomas Sterling
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

The challenges to extending the delivered computing capabilities of semiconductor technology through Moore?s Law, while manageable in the short term, may prove difficult or possibly impractical in the long term. Even now, the complex interplay of power and performance is resulting in significant changes in previous trends. Clock rates of commodity microprocessors are flattening even as multi-core chips are emerging as the norm for next generation systems. While conventional wisdom has dictated an assumption of continued adherence to the pure CMOS tradition of the last decade and more, the supercomputing community must consider the possibility of alternative technologies, at least in combination with more conventional devices. More than just changing or augmenting the technology base, new architecture structures and programming models may need to be considered and multiple levels to exploit the potential of such advances. This panel addresses these issues with a focus on one possible alternative technology: superconductor devices. Rapid Single Flux Quantum (RSFQ) logic exhibits operational properties in terms of performance and power that now positions it as a potential future leader among alternative digital technologies to augment semiconductor components in hybrid systems. But it is also challenged by lack of maturity and commercial market as well as its reliance on extreme operational temperature regimes. This panel brings together leaders in the fields of technology and computer architecture to consider the possible strategies and potential viability of superconductor based supercomputing.
CS++
Authors: T. H. Merrett
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Secondary storage adds the dimension of latency to memory organization. Programming structures, which seamlessly fuse secondary- and primary-memory data processing, are at a higher level than is conventional, and so simpler: data structures are based on bulk processing; programming language abstracts over looping. New abstractions give new ways of thinking and break old habits of programming. We illustrate these changes by integrating a number of areas hitherto thought separate and needing separate programming paradigms.
Performance of Multilayered Video Encoding and Delivery over Lossy Channels Using a Joint Source-Channel Coding Approach
Authors: Yong Pei, James W. Modestino
Venue: Wireless Personal Communications: An International Journal (2006)

In this paper, the performance of selected error-control schemes based on forward error-control (FEC) coding for H.263+ video transmission over an additive white Gaussian noise (AWGN) channel is studied. Joint source and channel coding (JSCC) techniques that employ single-layer and 2-layer H.263+ coding in conjunction with unequal error protection (UEP) to combat channel errors are quantitatively compared. Results indicate that with appropriate joint source and channel coding, tailored to the respective layers, FEC-based error control in combination with 2-layer video coding techniques can lead to more acceptable quality for wireless video delivery in the presence of channel impairments.
Characterization of ultra-thin SiO2 by capacitance-voltage and charge pumping measurements
Authors: L. Militaru, A. Poncet, C. Leroux
Venue: Microelectronic Engineering (2005)

In this paper, we present results on electrical measurements of ultra thin SiO"2 layers (from 3.5nm down to 1.7nm), used as gate dielectric in metal-oxide-semiconductors (MOS) devices. Capacitance-voltage (C-V) measurements and simulations on MOS capacitors have been used for extracting the electrical oxide thickness. The SiO"2/Si interface and oxide quality have been analyzed by charge pumping (CP) measurements. The mean interface traps density is measured by 2-level CP, and the energy distribution within the semiconductor bandgap of these traps are investigated by 3-level charge pumping measurements. A comparison of the energy distribution of the SiO"2/Si interface traps is made using classical and quantum simulations to extract the surface potential as a function of the gate signal. When the gate oxide thickness
Impact of Instruction Re-Ordering on the Correctness of Shared-Memory Programs
Authors: Lisa Higham, Jalal Kawash
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Sequential consistency is an intuitive consistency model that simplifies reasoning about concurrent multiprocessor programs. Most implementations of high-performance multiprocessors, however, utilize mechanisms that allow instructions to execute out of order, resulting in consistency models that are weaker than sequential consistency and further complicating the job of programmers. This paper investigates all possible combinations of re-ordering of read and write instructions and their effects on the correctness of programs that are designed for sequential consistency. It shows that with certain combinations of re-orderings, any program that accesses shared memory through only reads and writes and that is correct assuming sequential consistency, can be transformed to a new program that does not use any explicit synchronization, and that remains correct in spite of the instruction re-ordering. With other combinations of re-ordering, such transformations do not exist, and even solutions to the mutual exclusion problem are impossible without resorting to explicit synchronization.
Tools and Products
Venue: IEEE Computer Graphics and Applications (2005)

In this issue, Tools and Products features information about Point Grey Research's Ladybug2, ADS Tech's Instant TV for Notebooks, NEC Display Solutions' SpectraView, Konica Minolta's Vivid 9i, Silicon Graphics' Prism family, Luxology's modo 201, Sensable Technologies' ClayTools v.1.0, SoftImages's XSI 5.0, and Npower Software's PowerNurbs 1.0.
Dynamic Work.ow in a Grid Enabled Problem Solving Environment
Authors: Zhiming Zhao, Adam Belloum, Hakan Yakali, Peter Sloot, Bob Hertzberger
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In a Problem Solving Environment (PSE), a scientific workflow management system (SWMS) provides a meta environment for managing activities and data in scientific experiments, for prototyping experimental computing systems and for orchestrating the runtime system behaviour. A Grid infrastructure makes data and computing intensive experiments feasible in PSEs but also requires the management of workflow to support dynamics of the flow execution. A dynamic SWMS includes a human user in the runtime loop of a flow execution, and allows an engine to flexibly orchestrate a workflow according to the human decision and the runtime states of the environment. In this paper, we present our research in an ongoing project: Virtual Laboratory for e-Science (VL-e). An agent based solution is proposed to enhance an existing Grid enabled Problem Solving Environment framework called VLAM-G. The intelligence for problem solving strategies and for workflow orchestration is encapsulated as knowledge in two types of agents: study managers and scenario conductors.
Multi-Robot Avoidance Based on Co-Evolution Computation
Authors: HuaQing Min, XiJing Zheng, YanSheng Lu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The main attack strategy in an intense robotic soccer match is for an Attack Robot (AR) to avoid the competing side's threat and to avoid the most threatening defensive robot of the opponent to reach the objective and to effectively initiate an attack with the help of the Cooperation Robot (CR). This paper defines an attacking model and a cooperative model and their algorithms. Two Co-evolution computation (CEC) populations of robot are also designed: one is denoted as AR subset, the other CR subset. Based on this definition, the paper proposes a new Multiple Robots Avoidance Based On CEC method (or MRACEC for short). A theoretical analysis indicates that the MRACEC method has better robustness and optimizing ability.
Quantitative evaluation of unlinkable ID matching schemes
Authors: Yasunobu Nohara, Sozo Inoue, Kensuke Baba, Hiroto Yasuura
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID.The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices.In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.
Fully Decentralized DHT based Approach to Grid Service Discovery using Overlay Networks
Authors: Qi Xia, Ruijun Yang, Weinong Wang, De Yang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Distributed Hash table (DHT) is widely used in Peerto- peer networks for its scalability, adaptability, and faulttolerance in large and dynamic environments. In this paper, we study on the application of DHT for Grid service discovery. Grid service is represented by multiple (attribute, value) pairs. The virtual organization (VO) is also selforganized into a 2-dimensional network overlays - one for attributes, and the other for values - as nodes join and publish services in the VO. Service discovery in a VO is firstly directed to the attribute overlay to find the nodes with the discovered attributes, then to the value overlay until the nodes which have the same (attribute, value) are reached. Gateway servers are deployed on the border to interconnect different VO's. The service discovery request can be redirected to other VO's in case that there is no provider in the requester's own VO. Our approach is highly efficient, scalable and quick responsive.
Fast Dump Restore (FDR)
Authors: John Mazzone, Larry Stout
Venue: ACM SIGSIM Simulation Digest (1983)

FAST DUMP RESTORE (FDR) is a program product developed and marketed by INNOVATION DATA PROCESSING since May, 1972 and which is currently installed in 2,600 sites in the USA and CANADA and in over 1000 sites overseas. Based on FDR's acceptance by the D. P. community it would be accurate to say that FDR is the standard dump/restore utility most OS, VS and MVS data centers.
We Need Assurance!
Authors: Brian Snow
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

When will we be secure? Nobody knows for surebut it cannot happen before commercial security products and services possess not only enough functionality to satisfy customers' stated needs, but also sufficient assurance of quality, reliability, safety, and appropriateness for use. Such assurances are lacking in most of today's commercial security products and services. I discuss paths to better assurance in Operating Systems, Applications, and Hardware through better development environments, requirements definition, systems engineering, quality certification, and legal/regulatory constraints. I also give some examples.