ppxscal/embedding_network huggingface dataset:
Improved Test Generation Algorithms for Pair-Wise Testing
Authors: Soumen Maity, Amiya Nayak
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Software testing is expensive and time consuming. Given the different input parameters with multiple possible values for each parameter, performing exhaustive testing which tests all possible combinations is practically impossible. Generating an optimal test set which will effectively test the software system is therefore desired. Pair-wise testing is known for its effectiveness in different types of software testing. Pair-wise testing requires that for a given numbers of input parameters to the system, each possible combination of values for any pair of parameters be covered by at least one test case. Pair-wise testing is known for its effectiveness in different types of software testing. The problem of generating a minimum size test set for pair-wise testing is NP-complete. This paper presents new techniques for reducing the number of test cases for pair-wise testing. The paper shows an algorithm to generate test cases for 2-valued parameters and how orthogonal arrays and ordered designs may be used for deriving test cases for parameters with more than two values. Moreover, using mixed-level or asymmetric orthogonal array as tool, we present test set generation strategy for parameters with different number of values. A comparison of empirical results with previous test generation strategies "AETG" and "IPO" shows that the number of test cases generated with the proposed methodology is never higher and in some cases significantly lower than using AETG or IPO.
Why an algorithmic documentation language
Authors: Robert Faulkner
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1983)

System designers have tried multiple techniques for documenting what a program does, from "Self Documenting" languages to Flow Charts. The difficulty is that "Self Documenting" languages aren't and flow charts are difficult to maintain, plus neither generally follows the way in which programs are really designed. An Algorithmic Documentation Language is a design tool which becomes part of the system documentation. It combines defined control structures with English language statements.This paper describes the development of the Algorithmic Documentation Language, ALDOC. It also gives a short definition of the language statements and control structures.
Fragmentation-Efficient Node Allocation Algorithm in 2D Mesh-Connected Systems
Authors: Kyung-Hee Seo
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Efficient utilization of processing resources in a multicomputer system depends on the fast allocation algorithms that minimize system fragmentation. A small number of jobs with large submesh allocation requirements may significantly increase external fragmentation and the queuing delay of the rest of jobs. Under such circumstances, the proposed strategy further tries to allocate L-shaped submeshes instead of signaling the allocation failure. A simple and effective algorithm to find the allocatable L-shaped submeshes is proposed, that is shown to reduce the average turnaround time by minimizing the queuing delay, even though jobs are scheduled in an FCFS to preserve fairness. The extensive simulations show that the strategy performs more efficiently in terms of the task turnaround time and the system utilization.
Interruptible iterators
Authors: Jed Liu, Aaron Kimball, Andrew C. Myers
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

This paper introduces interruptible iterators, a language feature that makes expressive iteration abstractions much easier to implement. Iteration abstractions are valuable for software design, as shown by their frequent use in well-designed data structure libraries such as the Java Collections Framework. While Java iterators support iteration abstraction well from the standpoint of client code, they are awkward to implement correctly and efficiently, especially if the iterator needs to support imperative update of the underlying collection, such as removing the current element. Some languages, such as CLU and C# 2.0, support iteration through a limited coroutine mechanism, but these mechanisms do not support imperative updates. Interruptible iterators are more powerful coroutines in which the loop body is able to interrupt the iterator with requests to perform updates. Interrupts are similar to exceptions, but propagate differently and have resumption semantics. Interruptible iterators have been implemented as part of the JMatch programming language, an extended version of Java. A JMatch reimplementation of the Java Collections Framework shows that implementations can be made substantially shorter and simpler; performance results show that this language mechanism can also be implemented efficiently.
Point defects in HfO2 high K gate oxide
Authors: K. Xiong, J. Robertson
Venue: Microelectronic Engineering (2005)

This paper presents calculations of the energy levels of the oxygen vacancy and oxygen interstitial defects in HfO2 using methods not needing a band gap correction. The levels are aligned to those of the Si channel using the known band offsets. The oxygen vacancy gives energy levels in the upper gap of HfO2 and just above the Si gap. The vacancy is identified as the main electrically active trap in HfO2. The oxygen interstitial gives levels just above the oxide valence band.
A Behavioral Approach to Time-Varying Linear Systems. Part 1: General Theory
Authors: Achim Ilchmann, Volker Mehrmann
Venue: SIAM Journal on Control and Optimization (2005)

We develop a behavioral approach to linear, time-varying, differential-algebraic systems. The analysis is "almost everywhere" in the sense that the statements hold on $\mathbb{R} \setminus \mathbb{T}$, where $\mathbb{T}$ is a discrete set. Controllability, observability, and autonomy are introduced and related to the behavior of the system. Classical results on the behavior of time-invariant systems are studied in the context of time-varying systems.
A Data Mining-based Framework for GridWorkflow Management
Authors: A. Congiusta, D. Talia, G. Greco, A. Guzzo, G. Manco, L. Pontieri, D. Sacca
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

In this paper we investigate on the exploitation of data mining techniques to analyze data coming from the enactment of workflow-based processes in a service-oriented Grid infrastructure. The extracted knowledge allows users to better comprehend the behavior of the enacted processes, and can be profitably exploited to provide advanced support to several phases in the life-cycle of workflow processes, including (re-)design, matchmaking, scheduling and performance monitoring. To this purpose, we focus on recent data mining techniques specifically aimed at enabling re- fined analyzes of workflow executions. Moreover, we introduce a comprehensive system architecture that supports the management of Grid workflows by fully taking advantage of such mining techniques.
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Authors: Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott Mahlke
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware synthesis system where the schedule is used to determine various components of the hardware, including datapath, storage, and interconnect, the goals of a scheduler change drastically. In addition to achieving the traditional goals, the scheduler must proactively make decisions to ensure efficient hardware is produced. This paper proposes two exact solutions for cost sensitive modulo scheduling, one based on an integer linear programming formulation and another based on branch-and-bound search. To achieve reasonable compilation times, decomposition techniques to break down the complex scheduling problem into phase ordered sub-problems are proposed. The decomposition techniques work either by partitioning the dataflow graph into smaller subgraphs and optimally scheduling the subgraphs, or by splitting the scheduling problem into two phases, time slot and resource assignment. The effectiveness of cost sensitive modulo scheduling in minimizing the costs of function units, register structures, and interconnection wires are evaluated within a fully automatic synthesis system for loop accelerators. The cost sensitive modulo scheduler increases the efficiency of the resulting hardware significantly compared to both traditional cost unaware and greedy cost aware modulo schedulers.
Bayesian hierarchical clustering
Authors: Katherine A. Heller, Zoubin Ghahramani
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages over traditional distance-based agglomerative clustering algorithms. (1) It defines a probabilistic model of the data which can be used to compute the predictive distribution of a test point and the probability of it belonging to any of the existing clusters in the tree. (2) It uses a model-based criterion to decide on merging clusters rather than an ad-hoc distance metric. (3) Bayesian hypothesis testing is used to decide which merges are advantageous and to output the recommended depth of the tree. (4) The algorithm can be interpreted as a novel fast bottom-up approximate inference method for a Dirichlet process (i.e. countably infinite) mixture model (DPM). It provides a new lower bound on the marginal likelihood of a DPM by summing over exponentially many clusterings of the data in polynomial time. We describe procedures for learning the model hyperpa-rameters, computing the predictive distribution, and extensions to the algorithm. Experimental results on synthetic and real-world data sets demonstrate useful properties of the algorithm.
Supporting Personalization with Actively Promoting Sales of Service
Authors: Jie Yuan, Gengfeng Wu, Maogou Chen, Xiangzhong Huang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Personalization is an important determinant of perceived service quality and of user satisfaction. The personalized service needs the service provider's initiative. Actively Promoting Sales of Service (APSS) is a useful ability to support the service initiative. In this paper, the personalization is extended and integrated into distributed service system, in which the service information center can enhance the service provider's initiative. This paper explains the APSS, and brings up a framework of the APSS, which mainly includes describing the information of service and served object, mining out potential served objects, obtaining served object trust degrees and trends, ascertaining the promotion object, and deducing the mode of promotion message.
Integrating M-technology into Web-based ESL Vocabulary Learning for Working Adult Learners
Authors: Yanjie Song, Robert Fox
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

The paper reports on a small pilot study that explores the role of mobile technology (m-technology) in English as second language (ESL) vocabulary learning for working adult learners. In this study, through the use of Short Message Service (SMS), mtechnology was integrated into web-based vocabulary learning for working adult learners. This pilot study examined learner experiences of m-technology used in the workplace in Hong Kong. Ten learners were involved in the study. Both quantitative and qualitative methods were adopted through assessments using an online test system and an open-ended questionnaire sent by email to collect data. The research findings show significant improvements in the learner performance and in their attitudes towards using mtechnology in their learning.
Information assurance in manets and wireless sensor networks
Authors: Radha Poovendran
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

Manets and sensor networks are two classes of the wireless ad hoc networks with resource constraints. Manets typically consist of devices that have high capabilities, mobile and operate in coalitions. Sensor networks are typically deployed in specific geographical regions for monitoring and sensing. Both these wireless networks are characterized by their ad hoc nature that lack pre deployed infrastructure for computing and communication. Resource constraints, medium pathloss, and signal interference limit the communication range between any tow nodes, leading to the need for a multihop communication network. Such a network must be collaboratively formed and supported by the resource constraint nodes. For meaningful service provision, such a network must be able to provide confidentiality, integrity, and entity verification among participating nodes. In this talk, we will focus on such networks and discuss the challenges ahead that require fresh approaches in trust establishment and secure network service operations. We will take secure location services, probabilistic pre key deployment strategies, and group mobility scenarios of VANETs as examples to demonstrate the challenges in trust establishment and providing privacy.
Chameleon: application level power management with performance isolation
Authors: Xiaotao Liu, Prashant Shenoy, Mark Corner
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we present Chameleon---an application-level power management approach for reducing energy consumption in mobile processors. Our approach exports the entire responsibility of power management decisions to the application level. We propose an operating system interface that can be used by applications to achieve energy savings. We consider three classes of applications---soft real-time, interactive and batch---and design user-level power management strategies for representative applications such as a movie player, a word processor, a web browser, and a batch compiler. We also design a user level power manager based on GraceOS using Chameleon. We implement our approach in the Linux kernel running on a Sony Transmeta laptop. Our experiments show that, compared to the traditional system-wide CPU voltage scaling approaches, Chameleon can achieve up to 32-50% energy savings while delivering comparable or better performance to applications. Further, Chameleon imposes small overheads and is very effective at scheduling concurrent applications with diverse energy needs.
Capturing the Layout of Electronic Documents for Reuse in Variable Data Printing
Authors: Hui Chao, Xiaofan Lin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Personalized mailing in direct marketing campaign often requires sending out a unique piece of mail to each recipient while keeping the same look and feel across all the mail pieces in one campaign. In this paper we describe a method that captures the layout of an existing page by identifying different logical blocks, extracting the style features of each logical block on the page, analyzing and extracting the layout relationships and constraints among different logical blocks. The captured layout can then be reused in automated composition of new documents.
Minimizing the number of test configurations for FPGAs
Authors: E. Chmelar
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

FPGA test cost can be greatly reduced by minimizing the number of test configurations. A test technique is presented for FPGAs with multiplexer-based routing architectures in which multiple logical paths through each multiplexer is enabled instead of only one path. It is shown that for Xilinx Virtex-II and Spartan-3 FPGAs only 8 test configurations are required to achieve 100% stuck-at, PIP stuck-on, and PIP stuck-off fault coverage.
Making programmers pro-grammar
Authors: Frank B. Rowlett,  Jr.
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

The most distasteful job that can be given a programmer is requiring him to document his program. When he finally completes the documentation, it usually is unsatisfactory. Why? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Model-Driven Approach to RFID Application Programming and Infrastructure Management
Authors: Han Chen, Paul B. Chou, Sastry Duri, Jeffery G. Elliott, Johnathan M. Reason, Danny C. Wong
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper describes a model-driven methodology to provide a systematic means of programming RFID applications and managing a distributed RFID infrastructure. The centerpiece of the approach is a model that captures the device infrastructure, business operation structure, and their relationship. Building on the model, a management system can be designed to support various management tasks effectively, such as the enrollment, provisioning, and monitoring of devices. Similarly an application framework can be created for solution developers to create distributed RFID applications. Applications can be written against a business operation model and deployed on an evolving device infrastructure. A prototype shows that the approach facilitates the management and programming of an RFID infrastructure.
Applying the RFID technology for field force solution
Authors: Petri Vuorinen
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

The RFID technology has been applied for a long time in different areas: In logistics to identify the goods in transit, in security business for creating the check points for guarding tours.However RFID technology has merely been applied in such way that the content of the RFID tag has been read with the dedicated reader device that has no real time connectivity to the back end systems where the data of the RFID TAGs is collected to. Or there has not been possibility to combine the mobile phone's functionalities with the RFID reader (integrated device) that would also have an intuitive User Interface based on simple 'Touch' [4].This paper introduces, as an example, the reporting and communication tool called Field Force Solution. It is intended for people working in the field and who are by nature mobile and blue collar.It uniquely combines the use of RFID technology with tags and readers, client - server middleware software, mobile phone and real time communication.
Modeling and Reasoning about Uncertainty in Context-Aware Systems
Authors: Binh An Truong, Young-Koo Lee, Sung-Young Lee
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Uncertainty always exists as an unavoidable factor when developing context-aware applications for pervasive computing environments [1][2][3][4]. In this paper, we propose a unified context model to support representation and reasoning about uncertain context. Our unified context model extends the existing, de-facto ontology-based context models with probabilistic models to support probabilistic reasoning. Especially, our context model can be easily integrated with existing ontology-based context-aware systems. Given the unified context model, unified context ontology can be built and used as frameworks in developing context aware applications. Besides, our recipe of supporting the probabilistic reasoning is flexible and adaptive to the highly variable features of pervasive computing environments.
Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values
Authors: Hung-Leng Chen, Kun-Ta Chuang, Ming-Syan Chen
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have their labels. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the categorical domain. In this paper, a mechanism named MAximal Resemblance Data Labeling (abbreviated as MARDL) is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel categorical clustering representative, namely, Node Importance Representative(abbreviated as NIR), which represents clusters by the importance of attribute values. MARDL has two advantages: (1) MARDL exhibits high execution efficiency; (2) after each unlabeled data is allocated into the proper cluster, MARDL preserves clustering characteristics, i.e., high intra-cluster similarity and low inter-cluster similarity. MARDL is empirically validated via real and synthetic data sets, and is shown to be not only more efficient than prior methods but also attaining results of better quality.
QoS Provision for IPv6 Traffic Using Dynamic Packet State
Authors: Guozhen Tan, Hengwei Yao, Yi Liu, Ningning Han
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

With the emergence of various multimedia applications, the best-effort service provided by today's Internet has been not sufficient. To support QoS, Flow Label field is provided in IPv6 packet header, which can be used to specify the QoS requirements. Dynamic packet state [9] is a key technology that aims providing services as powerful and flexible as ones implemented by a stateful network using a stateless architecture. Combining these two features, this paper proposes some QoS provision mechanism for IPv6 traffic flows in a stateless architecture that has high scalability. Simulations are also run to evaluate the performance of the proposed algorithm.
Managing Requirements in a Co-evolution Context
Authors: Anne Etien, Camille Salinesi
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Complex artefacts, such as Information Systems (IS), have multiple aspects and components: business processes, databases, architecture, or software. It is generally agreed that all these should be kept consistent over time. One major issue to preserve consistency is when required evolutions affect multiple aspects or components of the system at the same time. As each evolution requirement can have an impact onto several projects, teams, engineering domains, viewpoints, or system components, the question of "is the consistency link preserved by this requirement?" has to be continuously raised. This paper presents: (i) a framework that defines challenges for RE caused by co-evolution and (ii) an approach to solve some of these RE-related coevolution challenges. The framework was developed based on our experience in three IS evolution projects: ERP installation, baselining of an IS across subsidiaries, and business process improvement driven IS evolution. Each challenge identified in the framework is discussed with respect to our experience with practice and state of the art methods. Our approach was developed for the business process improvement driven IS evolution project, then generalised for the IS baselining project. The approach is presented, and then illustrated with the case of the latter project.