ppxscal/embedding_network huggingface dataset:
A Graph-Based Approach to Power-Constrained SOC Test Scheduling
Authors: Chih-Pin Su, Cheng-Wen Wu
Venue: Journal of Electronic Testing: Theory and Applications (2004)

The test scheduling problem is one of the major issues in the test integration of system-on-chip (SOC), and a test schedule is usually influenced by the test access mechanism (TAM). In this paper we propose a graph-based approach to power-constrained test scheduling, with TAM assignment and test conflicts also considered. By mapping a test schedule to a subgraph of the test compatibility graph, an interval graph recognition method can be used to determine the order of the core tests. We then present a heuristic algorithm that can effectively assign TAM wires to the cores, given the test order. With the help of the tabu search method and the test compatibility graph, the proposed algorithm allows rapid exploration of the solution space. Experimental results for the ITC02 benchmarks show that short test length is achieved within reasonable computation time.
Designed for unanticipated use: common artefacts as design principle for CSCW applications
Authors: Samuli Pekkola
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Common artefacts have been identified as fundamental characteristics for framing activities in workplaces. Mike Robinson's article 'Design for unanticipated use...' conceptualised and defined the dimensions of common artefacts as consisting of predictability, peripheral awareness, implicit communication, double level language and overview. These dimensions have often been used in explaining unexpected uses of different applications and systems. In this paper, experiences from common artefacts as CSCW application design principles, indicating that unanticipated uses are expected and further supported, are discussed. Two distinct cases, a physical room and a software application, are presented, and some examples of the realisation of different dimensions are elaborated. It is concluded that the support for common artefacts can be designed, to a certain extent, and that such support can make applications more suitable for unanticipated uses.
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs
Authors: Ruilian Zhao, Michael R. Lyu, Yinghua Min
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Partition testing is a well-known software testingtechnique. This paper shows that partition testingstrategies are relatively ineffective in detecting faultsrelated to small shifts in input domain boundary. Wepresent an innovative software testing approach based oninput domain analysis of specifications and programs, andpropose the principle and procedure of boundary test caseselection in functional domain and operational domain.The differences of the two domains are examined byanalyzing the set of their boundary test cases. Toautomatically determine the operational domain of aprogram, the ADSOD system is prototyped. The systemsupports not only the determination of input domain ofinteger and real data types, but also non-numeric datatypes such as characters and enumerated types. Itconsists of several modules in finding illegal values ofinput variables with respect to specific expressions. Weapply the new testing approach to some example studies.A preliminary evaluation on fault detection effectivenessand code coverage illustrates that the approach is highlyeffective in detecting faults due to small shifts in the inputdomain boundary, and is more economical in test casegeneration than the partition testing strategies.
How people use orientation on tables: comprehension, coordination and communication
Authors: Russell Kruger, Sheelagh Carpendale, Stacey D. Scott, Saul Greenberg
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In order to support co-located collaboration, many researchers are now investigating how to effectively augment tabletops with electronic displays. As far back as 1988, orientation was recognized as a significant human factor issue that must be addressed by electronic tabletop designers. As with traditional tables, when people stand at different positions around a horizontal display they will be viewing the contents from different angles. One common solution to this problem is to have the software reorient objects so that any given individual can view them 'right way up.' Yet is this the best approach? If not, how do people actually use orientation on tables? To answer these questions, we conducted an observational study of collaborative activity on a traditional table. Our results show that the strategy of reorienting objects to a person's view is overly simplistic: while important, it is an incomplete view of how people exploit their ability to reorient objects. Orientation proves critical in how individuals comprehend information, how collaborators coordinate their actions, and how they mediate communication. The coordinating role of orientation is evident in how people establish personal and group spaces, and how they signal ownership of objects. In terms of communication, orientation is useful in initiating communicative exchanges and in continuing to speak to individuals about particular objects and work patterns as collaboration progresses. The three roles of orientation have significant implications for the design of tabletop software and the assessment of existing tabletop systems.
Empirical Bayesian data mining for discovering patterns in post-marketing drug safety
Authors: David M. Fram, June S. Almenoff, William DuMouchel
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Because of practical limits in characterizing the safety profiles of therapeutic products prior to marketing, manufacturers and regulatory agencies perform post-marketing surveillance based on the collection of adverse reaction reports ("pharmacovigilance").The resulting databases, while rich in real-world information, are notoriously difficult to analyze using traditional techniques. Each report may involve multiple medicines, symptoms, and demographic factors, and there is no easily linked information on drug exposure in the reporting population. KDD techniques, such as association finding, are well-matched to the problem, but are difficult for medical staff to apply and interpret.To deploy KDD effectively for pharmacovigilance, Lincoln Technologies and GlaxoSmithKline collaborated to create a webbased safety data mining web environment. The analytical core is a high-performance implementation of the MGPS (Multi-Item Gamma Poisson Shrinker) algorithm described previously by DuMouchel and Pregibon, with several significant extensions and enhancements. The environment offers an interface for specifying data mining runs, a batch execution facility, tabular and graphical methods for exploring associations, and drilldown to case details. Substantial work was involved in preparing the raw adverse event data for mining, including harmonization of drug names and removal of duplicate reports.The environment can be used to explore both drug-event and multi-way associations (interactions, syndromes). It has been used to study age/gender effects, to predict the safety profiles of proposed combination drugs, and to separate contributions of individual drugs to safety problems in polytherapy situations.
Computation of the probability of initial substring generation by stochastic context-free grammars
Authors: Frederick Jelinek, John D. Lafferty
Venue: Computational Linguistics (1991)

Speech recognition language models are based on probabilities P(Wk+1 = v | w1w2,...,wk) that the next word Wk+1 will be any particular word v of the vocabulary, given that the word sequence w1,w2,...,wk is hypothesized to have been uttered in the past. If probabilistic context-free grammars are to be used as the basis of the language model, it will be necessary to compute the probability that successive application of the grammar rewrite rules (beginning with the sentence start symbol s) produces a word string whose initial substring is an arbitrary sequence w1,w2,...,wk+1. In this paper we describe a new algorithm that achieves the required computation in at most a constant times k3-steps.
Parallel Mining of Maximal Frequent Itemsets from Databases
Authors: Soon M. Chung, Congnan Luo
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new parallel algorithm is named Parallel Max-Miner (PMM), and it is a parallel version of the sequential Max-Miner algorithm [3]. Most of existing mining algorithms discover the frequent k-itemsets on the kth pass over the databases, and then generate the candidate (k + 1)-itemsets for the next pass. Compared to those level-wise algorithms, PMM looks ahead at each pass and prunes more candidate itemsets by checking the frequences of their supersets. We implemented PMM on a cluster of workstations, and evaluated its performance for various cases. PMM demonstrated better performance than other sequential and parallel algorithms, and its performance is quite scalable, even when there are large maximal frequent itemsets (i.e., long patterns) in databases.
A summer master's degree program in computer education
Authors: Peter Moulton, David Moursund
Venue: ACM SIGCUE Outlook (1975)

The Computer Science Department has developed a summer master's degree program in Computer Science Education directed toward teachers in grades 7-14. In a first section this report describes the goals, design criteria and constraints which influenced the development of the program. A second section describes the resultant program and summarizes some of the experiences gained from the program over the past two years.
Process configuration: Combining the principles of product configuration and process planning
Authors: Karsten Schierholt
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Product configuration is the process of generating a product variant from a previously defined product family model and additional product specifications for this variant. The process of finding and sequencing the relevant operations for manufacturing this product is called process planning. This article combines the two principles in a new concept of process configuration that solves the process planning task using product configuration methods. The second section develops characteristics for two process configuration concepts, the interactive process configuration and the automation-based process configuration. Following an overview of the implementation of a process configuration system, the results of a case study in the aluminum rolling industry are presented. The main benefits of the process configuration concept are observed in a reduced knowledge-maintenance effort and in increased problem-solving speed.
Walking the Talk Building Quality into the Software Quality Management Tool
Authors: Girish V. Seshagiri, S. Priya
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The market for products whose objective is toimprove software project management andsoftware quality management is expected to belarge and growing.In this paper, we present data from a softwareproject whose mission is to build a commercialenterprise software project and qualitymanagement tool.The data we present include: planned andactual schedule, earned value, size, productivity,and defect removal by phase.We present process quality index and percentdefect free modules as useful measures to predictpost development defects in the product.We conclude that vendors of software projectand quality management tools must walk the talkby utilizing disciplined techniques for managingthe project and building quality into theirproducts with known quality methods.The Team Software ProcessSM is a provenframework for both software projectmanagement and software quality management.
A for alternatives
Authors: Susanne Bødker
Venue: Scandinavian Journal of Information Systems (2003)

This paper presents some thoughts about the role of participatory design, now and in the future, based on the Beck (2002). My main proposal is that research-based participatory design is needed to question technology and propose alternatives.
On the structure and stability number of P5- and co-chair-free graphs
Authors: Andreas Brandstädt, Raffaele Mosca
Venue: Discrete Applied Mathematics (2003)

We give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5-and co-chair-free graphs without recognizing whether the (arbitrary) input graph is P5- and co-chair-free. This algorithm is based on the fact that prime P5- and co-chair-free graphs containing 2K2 are matched co-bipartite graphs and thus have very simple structure, and for 2K2-free graphs, there is a polynomial time algorithm for the MWS problem due to a result of Farber saying that 2K2-free graphs contain at most O(n2) maximal stable sets. A similar argument can be used for (P5,co-P)-free graphs; their prime graphs are 2K2-free. Moreover, we give a complete classification of (P5,co-chair,H)-free graphs with respect to their clique width when H is a one-vertex P4 extension; this extends the characterization of (P5,P'5,co-chair)-free graphs called semi-P4-sparse by Fouquet and Giakoumakis. For H being a house, P, bull or gem, the class of (P5,co-chair,H)-free graphs has bounded clique width and very simple structure whereas for the other four cases, namely H being a co-gem, chair, co-P or C5, the class has unbounded clique width due to a result of Makowsky and Rotics. Bounded clique width implies linear time algorithms for all algorithmic problems expressible in LinEMSOL--a variant of Monadic Second Order Logic including the MWS Problem.
Bowen virtual theater
Authors: Matthew Lewis
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

A web-based virtual theater was created to provide students learning introductory theatrical concepts with a more engaging means of exploring the possibilities of set design, lighting, prop placement, and actor blocking. Web delivery without plug-ins allows a very large number of students to access the site with minimal support requirements. The system can be used as an experimentation lab, a design tool, and an in-class instructional system for illustrating concepts.
Global value numbering using random interpretation
Authors: Sumit Gulwani, George C. Necula
Venue: ACM SIGPLAN Notices (2004)

We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are treated as uninterpreted functions. We are not aware of any complete polynomial-time deterministic algorithm for the same problem. The algorithm does not require symbolic manipulations and hence is simpler to implement than the deterministic symbolic algorithms. The price for these benefits is that there is a probability that the algorithm can report a false equality. We prove that this probability can be made arbitrarily small by controlling various parameters of the algorithm.Our algorithm is based on the idea of random interpretation, which relies on executing a program on a number of random inputs and discovering relationships from the computed values. The computations are done by giving random linear interpretations to the operators in the program. Both branches of a conditional are executed. At join points, the program states are combined using a random affine combination. We discuss ways in which this algorithm can be made more precise by using more accurate interpretations for the linear arithmetic operators and other language constructs.
A Structural Approach to Assessing Innovation: Construct Development of Innovation Locus, Type, and Characteristics
Authors: Hubert Gatignon, Michael L. Tushman, Wendy Smith, Philip Anderson
Venue: Management Science (2002)

We take a structural approach to assessing innovation. We develop a comprehensive set of measures to assess an innovation's locus, type, and characteristics. We find that the concepts of competence destroying and competence enhancing are composed of two distinct constructs that, although correlated, separately characterize an innovation: new competence acquisition and competence enhancement/destruction. We develop scales to measure these constructs and show that new competence acquisition and competence enhancing/destroying are different from other innovation characteristics including core/peripheral and incremental/radical, as well as architectural and generational innovation types. We show that innovations can be evaluated distinctively on these various dimensions with generally small correlations between them. We estimate the impact these different innovation characteristics and types have on time to introduction and perceived commercial success. Our results indicate the importance of taking a structural approach to describing innovations and to the differential importance of innovation locus, type, and characteristics on innovation outcomes. Our results also raise intriguing questions regarding the locus of competence acquisition (internal vs. external) and both innovation outcomes.
Communicated knowledge in electronically enabled business interactions
Authors: Violina Ratcheva
Venue: Knowledge management: current issues and challenges (2003)

Virtual teams have been increasingly cited as an efficient and flexible novel form of organisational arrangements affected by the emergence of the electronic business space. The purpose of forming such teams is a new knowledge creation'. The paper argues that unraveling the mystery of knowledge creation processes in virtual partnerships requires an in-depth understanding of the complex interaction processes involved in forming computer-mediated business relationships. The focus, therefore, is on the process of collective 'knowing', defined as the team's actions and interactions embedded in unique social activities in virtual teams, rather than on knowledge being a pre-given resource possessed by the team members. The paper presents the preliminary results of a qualitative research study on seven virtual partnerships and proposes an initial conceptual framework of the knowledge creative process taking place in virtual business relationships.
On the Maximum Cut of Line Graphs
Authors: Shuji Shiraishi
Venue: Combinatorics, Probability and Computing (1998)

For an undirected graph G=(V, E), let &sigma;(L(G)) be the size of the maximum cut of the line graph L(G). Let dv denote the degree of the vertex v in G. Then we have the following results.(a) If G=(V, E) is Eulerian, then***** Insert equation here *****(b) If G is not Eulerian, then***** Insert equation here *****
Spatial Simulation Model for Infectious Viral Diseases with Focus on SARS and the Common Flu
Authors: Christoph Aschwanden
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This paper will focus on simulating the infectious process on a computer. To simulate how an infectious viral disease spreads not only shows how people get sick, it can also be a powerful tool in disease prevention. You can test actions such as to isolate people that get sick and analyze if the disease spread can be circumscribed or stopped. Special focus will be given to SARS and the Common Flu.
A multistep characteristic finite difference method for a class of nerve conduction equations
Authors: Zhiyue Zhang, Hong Wei
Venue: Neural, Parallel Scientific Computations (2003)

The multistep characteristic difference scheme is given for the periodic initial boundary problem of a class of two-dimensional generalized nerve conduction equation. Based on biquadratic interpolations, using the general transformation and the theory and technique of priori estimates, optimal order error estimates in l2 is obtained and improved accuracy on the temporal direction to O((Δt)2). Numerical experiment implies that this scheme has higher accuracy and efficiency.
IA-32 Execution Layer: a two-phase dynamic translator designed to support IA-32 applications on Itanium®-based systems
Authors: Leonid Baraz, Tevi Devor, Orna Etzion, Shalom Goldenberg, Alex Skaletsky, Yun Wang, Yigel Zemach
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

IA-32 Execution Layer (IA-32 EL) is a newtechnology that executes IA-32 applications onIntel® Itanium® processor family systems.Currently, support for IA-32 applications onItanium-based platforms is achieved usinghardware circuitry on the Itanium processors.This capability will be enhanced with IA-32EL-software that will ship with Itanium-basedoperating systems and will convert IA-32instructions into Itanium instructions viadynamic translation.In this paper, we describeaspects of the IA-32 Execution Layertechnology, including the general two-phasetranslation architecture and the usage of asingle translator for multiple operatingsystems.The paper provides details of someof the technical challenges such as preciseexception, emulation of FP, MMXTM, and Intel®Streaming SIMD Extension instructions, andmisalignment handling.Finally, the paperpresents some performance results.
Teaching growth of functions using equivalence classes: an alternative to big O notation
Authors: Constantine Roussos
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Understanding growth of functions using the standard big O definition and notation is a challenge for many undergraduate students. This paper <ol>presents an approach to teaching growth of functions that utilizes equivalence classes and partial ordering, identifies those mathematical concepts students should comprehend in order to understand the principles underlying growth of functions, demonstrates pedagogical inadequacies in existing order of complexity notation and definitions and gives a rationale for restricting functions under consideration to positive-valued, monotonic increasing.</ol
New interpolatory quadrature formulae with Gegenbauer abscissae
Authors: Sotirios E. Notaris
Venue: Journal of Computational and Applied Mathematics (2003)

We study interpolatory quadrature formulae, relative to the Legendre weight function on [-1, 1], having as nodes the zeros of the nth degree Gegenbauer polynomial plus one of the points 1 or -1. In particular, we establish the convergence or nonconvergence for continuous and Riemann integrable functions on [-1, 1], we determine the precise degree of exactness, we obtain asymptotically optimal error bounds, and we examine the definiteness or nondefiniteness of these formulae. In addition, we try, numerically, to investigate the question of positivity of all quadrature weights and to fill a gap regarding the definiteness or nondefiniteness property. The paper concludes by comparing the results derived here for the quadrature formulae in question with those that have been previously obtained for the corresponding open and closed interpolatory formulae with Gegenbauer abscissae.