ppxscal/embedding_network huggingface dataset:
Design for verification testability
Authors: Andrzej Krasniewski
Venue: Proceedings of the conference on European design automation (1990)

A procedure for designing combinational circuits suitable for built-in verification testing is presented. Unlike the traditional approach, where the design of a test pattern generator follows the functional logic synthesis, in our method the built-in self-test synthesis tightly interacts with the functional logic design. The experimental results indicate that a significant reduction in testing time at a negligible area/performance penalty can be obtained in the circuits designed using the proposed verification testing oriented logic synthesis procedure.
A new clustering approach and its application to BBL placement
Authors: M. Y. Yu, X. L. Hong, Y. E. Lien, Z. Z. Ma, J. G. Bo, W. J. Zhuang
Venue: Proceedings of the conference on European design automation (1990)

A new approach for clustering applied to Building Block placement is presented. Unlike traditional approaches, which only consider local factors such as connectivity and shape matching of blocks in a cluster, our approach (called the GAC method) not only considers connectivity and shape matching of clustering, but also takes a more important factor, global analyses, into account. Furthermore, in this paper we have proposed a new shape matching and a propagating method to compute the connectivity of clusters. The new method makes connectivity computation more precisely. This clustering algorithm has been implemented in Fortran 77 on Micro VAX II. The experimental placement results are much better than BEAR and Timber WolfMC, the latter of which adopts the simulated annealing approach, and the GAC method has a much better run time.
Profiling Driven Computation Reuse: An Embedded Software Synthesis Technique for Energy and Performance Optimization
Authors: Weidong Wang, Anand Raghunathan, Niraj K. Jha
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

It has been observed that even highly optimized software programsperform "redundant" computations during their execution,due to the nature (statistics) of the values assumed by input orinternal program variables. For embedded software running onbattery-powered systems, such computations can be viewed asunnecessary energy overheads, and hence represent opportunitiesfor improvement in energy efficiency. We present a systematicmethodology to identify and eliminate redundancies in the computationsperformed by embedded software programs, by exploitingopportunities that dynamically arise for computation reuse.We report the results of experiments on two different embeddedsystems - a detailed simulation model of a Fujitsu SPARClitebased embedded system, and actual current measurements on aCompaq iPAQ PDA. Our results demonstrate that the proposedtechnique can reduce energy by up to 46.9% (average of 21.2%and 13.9% for the SPARClite based system and the iPAQ, respectively)while simultaneously improving performance by upto 45.8% (average of 20.7% and 16.8% for the SPARClite basedsystem and the iPAQ, respectively), compared to well-optimizedprograms that do not employ such a technique.
Use of Statechart Diagrams for Modeling of Hypertext
Authors: E. A. Gorshkova, B. A. Novikov
Venue: Programming and Computing Software (2004)

The extension of UML that was suggested earlier by the authors of this paper and designed for describing user interfaces of web applications makes it possible to use means of one type for the design and development of all application components at all levels. In this paper, the central part of this UML extension&mdash;the navigation diagrams used for the specification of visible system behavior&mdash;is described in detail.
Fuzzy group decision-making for facility location selection
Authors: Cengiz Kahraman, Da Ruan, Ibrahim Doǧan
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

The selection of a facility location among alternative locations is a multicriteria decision-making problem including both quantitative and qualitative criteria. The conventional approaches to facility location problem tend to be less effective in dealing with the imprecise or vagueness nature of the linguistic assessment. Under many situations, the values of the qualitative criteria are often imprecisely defined for the decision-makers. The aim of the paper is to solve facility location problems using different solution approaches of fuzzy multi-attribute group decision-making. The paper includes four different fuzzy multi-attribute group decision-making approaches. The first one is a fuzzy model of group decision proposed by Blin. The second is the fuzzy synthetic evaluation. The third is Yager's weighted goals method and the last one is fuzzy analytic hierarchy process. Although four approaches have the same objective of selecting the best facility location alternative, they come from different theoretic backgrounds and relate differently to the discipline of multi-attribute group decision-making. These approaches are extended to select the best facility location alternative by taking into account quantitative and qualitative criteria. A short comparative analysis among the approaches and a numeric example to each approach are given.
Beyond AOP: toward naturalistic programming
Authors: Cristina Videira Lopes, Paul Dourish, David H. Lorenz, Karl Lieberherr
Venue: ACM SIGPLAN Notices (2003)

Software understanding for documentation, maintenance or evolution is one of the longest-standing problems in Computer Science. The use of "high-level" programming paradigms and object-oriented languages helps, but fundamentally remains far from solving the problem. Most programming languages and systems have fallen prey to the assumption that they are supposed to capture idealized models of computation inspired by deceptively simple metaphors such as objects and mathematical functions. Aspect oriented programming languages have made a significant breakthrough by noticing that, in many situations, humans think and describe in crosscutting terms. In this paper we suggest that the next breakthrough would require looking even closer to the way humans have been thinking and describing complex systems for thousand of years using natural languages. While natural languages themselves are not appropriate for programming, they contain a number of elements that make descriptions concise, effective and understandable. In particular, natural languages referentiality is a key factor in supporting powerful program organizations that can be easier understood by humans.
The role of learning style in university students' computer attitudes: implications relative to the effectiveness of computer-focused and computer-facilitated instruction
Authors: Pat C. Ames
Venue:  (2003)

This research, conducted in an interdisciplinary approach and employing current education paradigms, models of learning theory, technology acceptance and attitude/technology interaction, investigated the manner in which students' learning styles affected their attitudes towards computer technology and the impact of those learning styles and attitudes on learning outcomes. Analyses of data collected from four higher education institutions over a period of two-and-a-half years using a learning style inventory based on Gregorc's Style Delineator and a computer attitude scale adapted from Loyd and Gressard's Computer Attitude Scale indicate that a student's learning style (how information is gathered from the environment and how that information is processed and organized mentally) and attitudes toward computers may be, to some extent, a factor of gender and other conditions outside the student's control (e.g., fetal brain exposure to gonadal hormones). Certain technology-favoring learning styles were found more often in males while technology-averse learning styles were found more often in females. There were positive differences between overall GPA and students' GPA in computer-focused coursework (computer GPA exceeded overall GPA) in specific learning style groupings. Data also indicate that students tended to select academic majors and instruction delivery methods that complemented their learning styles and computer attitudes. Implications for the future implementation of computers in schools and technology training, especially for females, are discussed and suggestions for future research are proposed.
E-mail's value: internal versus external usage
Authors: Denise J. McManus, Chetan S. Sankar, Houston H. Carr, F. Nelson Ford
Venue: Advanced topics in information resources management (2003)

This chapter provides a new perspective on the competitive advantage of electronic mail within organizations. Essentially, e-mail assists individuals with efficiency and effectiveness. It improves the overall productivity of the firm and provides better coordination of internal processes. Electronic mail has been considered an important channel of communication. Since quality, time and cost are considered the main means of competition in today's global market, this study investigated the relationship between the strategic uses and competitive benefits of electronic mail in contemporary organizations. A sample of 99 management-level staff members in 41 companies responded to a questionnaire assessing their e-mail usage and their perceived e-mail benefits. The results suggested that e-mail usage could augment the competitive posture of the firm.
Topological representation and reasoning in space
Authors: Baher A. El-geresy, Alia I. Abdelmoty
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

In this article, an approach is presented for the representation and reasoning over qualitative spatial relations. A set-theoretic approach is used for representing the topology of objects and underlying space by retaining connectivity relationships between objects and space components in a structure, denoted, adjacency matrix. Spatial relations are represented by the intersection of components, and spatial reasoning is achieved by the application of general rules for the propagation of the intersection constraints between those components. The representation approach is general and can be adapted for different space resolutions and granularities of relations. The reasoning mechanism is simple and the spatial compositions are achieved in a finite definite number of steps, controlled by the complexity needed in the representation of objects and the granularity of the spatial relations required. The application of the method is presented over geometric structures that takes into account qualitative surface height information. It is also shown how directional relationships can be used in a hybrid approach for richer composition scenarios. The main advantage of this work is that it offers a unified platform for handling different relations in the qualitative space, which is a step toward developing general spatial reasoning engines for large spatial databases.
Parallelized File Transfer Protocol (P-FTP)
Authors: Shaleeza Sohail, Sanjay Jha, Hossam ElGindy
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Parallelized FTP (P-FTP) approach, attempts to solvethe problem of slow downloads of large multimedia fileswhile optimizing the utilization of mirror servers. The approachpresented in this paper downloads a single file frommultiple mirror servers simultaneously, where each mirrorserver transfers a portion of the file. P-FTP server calculatesthe optimum division of the file for efficient transfer.The dynamic monitoring ability of P-FTP maintains thefile transfer process at the optimized level no matter howabruptly network and mirror server characteristics change.
Implementing global constraints as graphs of elementary constraints
Authors: Dávid Hanák
Venue: Acta Cybernetica (2003)

Global constraints are cardinal concepts of CLP(FD), a constraint programming language. They are means to find a set of integers that satisfy certain relations. The fact that defining global constraints often requires the knowledge of a specification language makes sharing constraints between scientists and programmers difficult. Nicolas Beldiceanu presented a theory that could solve this problem, because it depicts global constraints as graphs: an abstraction that everyone understands.The abstract description language defined by the theory may also be interpreted by a computer program. This paper deals with the problematic issues of putting the theory into practice by implementing such a program. It introduces a concrete syntax of the language and presents three programs understanding that syntax. These case studies represent two different approaches of propagation. One of these offers exhausting pruning with poor efficiency, the other, yet unfinished attempt provides a better alternative at the cost of being a lot more complicated.
Characterizing E-Participation in Policy-Making
Authors: Ann Macintosh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

This paper argues the urgent need to better understand the e-democracy pilots that have taken place so far and that are currently being developed. It addresses the issues of what should be characterized in e-democracy pilots so as to better identify types of citizen participation exercises and the appropriate technology to support them, as such it offers ananalytical framework for electronic participation. Over the last decade there has been a gradual awareness of the need to consider the innovative application of ICTs for participation that enables a wider audience to contribute to democratic debate and where contributions themselves are broader and deeper. This awareness has resulted in a number of isolated e-democracy pilots and research studies. It is important to consolidate this work and characterizes the level of participation, the technology used, the stage in the policy-making process and various issues and constraints, including the potential benefits.
Network and computing research infrastructure: back to the future
Authors: Robert J. Aiken, Javad Boroumand, Stephen Wolff
Venue: Communications of the ACM (2004)

Return to the historical ARPANET and NSFNET model to support simultaneous application, computational, middleware, storage, and network research on the same experimental infrastructure.
JRastro: A Trace Agent for Debugging Multithreaded and Distributed Java Programs
Authors: Gabriela Jacques da Silva, Lucas Mello Schnorr, Benhur de Oliveira Stein
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Program tracing is one of the most used techniques to debug parallel and distributed programs. In this technique, events are recorded in trace files during the execution of the program for post mortem visualization of its behavior. This article describes JRastro, a trace agent capable of tracing Java programs. The agent was designed to cover three key features: to be transparent to the application developer, to use unmodified Java Virtual Machines and to observe Remote Method Invocations. By integrating these three features,JRastro differentiates itself from similar tools. Unfortunately, for a complete and clean implementation of RMI visualization, additional support on the Java monitoring system is needed.
Switch-level timing models in the MOS simulator BRASIL
Authors: H. Warmers, D. Sass, E. H. Horneber
Venue: Proceedings of the conference on European design automation (1990)

New timing models have been developed and implemented in the switch-level timing simulator BRASIL which are able to give fairly accurate signal waveforms. This enables the detection of faulty aspect ratios, dynamic hazards and races and timing faults caused by clock skew in NMOS and CMOS circuits. In contrast to most existing switch-level timing simulators the algorithm is not restricted to tree structures of the active subnetworks.
Beyond independent components: trees and clusters
Authors: Francis R. Bach, Michael I. Jordan
Venue: The Journal of Machine Learning Research (2003)

We present a generalization of independent component analysis (ICA), where instead of looking for a linear transform that makes the data components independent, we look for a transform that makes the data components well fit by a tree-structured graphical model. This tree-dependent component analysis (TCA) provides a tractable and flexible approach to weakening the assumption of independence in ICA. In particular, TCA allows the underlying graph to have multiple connected components, and thus the method is able to find "clusters" of components such that components are dependent within a cluster and independent between clusters. Finally, we make use of a notion of graphical models for time series due to Brillinger (1996) to extend these ideas to the temporal setting. In particular, we are able to fit models that incorporate tree-structured dependencies among multiple time series.
Overhead-Conscious Voltage Selection for Dynamic and Leakage Energy Reduction of Time-Constrained Systems
Authors: Alexandru Andrei, Marcus Schmitz, Petru Eles, Zebo Peng, Bashir M. Al-Hashimi
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Dynamic voltage scaling and adaptive body biasing have been shown to reduce dynamic and leakage power consumption effectively. In this paper, we optimally solve the combined supply voltage and body bias selection problem for multi-processor systems with imposed time constraints, explicitly taking into account the transition overheads implied by changing voltage levels. Both energy and time overheads are considered. We investigate the continuous voltage scaling as well as its discrete counterpart, and we prove NP-hardness in the discrete case. Furthermore, the continuous voltage scaling problem is formulated and solved using nonlinear programming with polynomial time complexity, while for the discrete problem we use mixed integer linear programming. Extensive experiments, conducted on several benchmarks and a real-life example, are used to validate the approaches.
Evaluation of a fully automatic medical image registration algorithm based on mutual information
Authors: Attila Tanács, Attila Kuba
Venue: Acta Cybernetica (2003)

Registration is a fundamental task in image processing. Its purpose is to find a geometrical transformation that relates the points of an image to their corresponding points of another image. Many registration algorithms have been proposed in the past decade. We present a fast, fully automatic algorithm that is capable of solving rigid-body registration of 3D images of the human brain where the images are taken by different imaging devices. We joined the Retrospective Registration Evaluation Project conducted by Vanderbilt University, USA. The evaluations of our results show that our method has the potential to produce satisfactory results, but visual inspection is necessary to guard against large errors.
Design of 2-D Linear Phase Digital Filters Using Schur Decomposition and Symmetries
Authors: Rabah W. Aldhaheri
Venue: Multidimensional Systems and Signal Processing (2004)

In this paper we present a new and numerically efficient technique for designing 2-D linear phase octagonally symmetric digital filters using Schur decomposition method (SDM) and the diagonal symmetry of the 2-D impulse response specifications. This technique is based on two steps. First, the 2-D impulse response matrix is decomposed into a parallel realization of k sections, each comprising two cascaded linear phase SISO 1-D FIR digital filters. It is shown that using the symmetry property of the 2-D impulse response matrix and the fact that the left and right eigenspaces obtained by SDM are transpose of each other, the design problem of two 1-D digital filters is reduced to the design problem of only one 1-D digital filter in each section.In the second step, the 2-D linear phase FIR filter is converted to 2-D IIR filter. This is done by converting the constituent N-order 1-D FIR filters to an n-order IIR filters, where n < N using the given model reduction algorithm. The reduced order IIR filters are obtained without computing the balancing transformation, but by finding the orthonormal eigenspaces associated with the largest eigenvalues of the cross-Gramian matrix W CO.Two design examples are given to illustrate the advantages of the proposed technique.
Improving Risk Grouping Rules for Prostate Cancer Patients with Optimization
Authors: L. Churilov, A. M. Bagirov, D. Schwartz, K. Smith, M. Dally
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Data mining techniques provide a popular and powerful toolset to address both clinical and management issues in the area of health care. This paper describes the study of assigning prostate cancer patients into homogenous groups with the aim to support future clinical treatment decisions. The cluster analysis based model is suggested and an application of non-smooth non-convex optimization techniques to solve this model is discussed. It is demonstrated that using the optimization based approach to data mining of a prostate cancer patients database can lead to generation of a significant amount of new knowledge that can be effectively utilized to enhance clinical decision making.
Stacked Multicell Converter Controlled by DSP
Authors: José Mariano Fernández Nava, Pedro Bañuelos Sánchez
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This paper presents an overview of some specialpower converters called Stacked Multicell Converters(SMC), with special attention on their control strategy.A SMC is a converter that is used to control highvoltages with conventional power semiconductors. Thisconverter has a characteristic configuration composedby p columns and n stacks. It allows to reduce thevoltage and current stresses on semiconductorcomponents and then attain high output voltages. Thispaper begins with a brief explanation on how a SMCworks and its control complexity. A completeexplanation of a SPWM control strategy by DSP inSMC is clearly given. Simulation and experimentalresults from a 100 V input voltage and 0.5 A outputcurrent prototype complement the work.
Property-oriented testing: a strategy for exploring dangerous scenarios
Authors: Olfa Abdellatif-Kaddour, Pascale Thévenod-Fosse, Hélène Waeselynck
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Property-oriented testing uses the specification of a property to drive the testing process. The aim is to validate a program with respect to a target property, that is, to exercise the program and observe whether the property is violated or not. The paper defines a test strategy for safety properties in cyclic control systems. It consists of the stepwise construction of test scenarios. Each step explores possible continuations of the dangerous scenarios found at the previous step, using black-box sampling techniques. The feasibility of the strategy is illustrated on a stem boiler case study. The target property is the "non explosion" of the boiler in presence of faults in the physical devices. The experimental results are promising since four different explosive scenarios have been identified.