ppxscal/embedding_network huggingface dataset:
Unified synthesis techniques for high performance fpga designs
Authors: Gang Chen
Venue:  (2005)

As the device geometry keeps shrinking in today's deep sub-micron technologies, interconnect delay dominates the critical path. In the current FPGA design flow, there are two major drawbacks: the separation of technology-independent optimization and technology mapping in the traditional logic synthesis flow, and the separation of logic synthesis and physical implementation in the traditional implementation flow. Such drawbacks result in sub-optimal performance and a long timing closure cycle. In this thesis we propose the utilization of unified synthesis techniques in the context of FPGAs to address these issues and improve the overall design performance. In Chapter 3 we bridge the gap between technology-independent optimization and technology mapping by combining logic decomposition and mapping. In Chapter 4, we introduce a novel algorithm named SCPlace [17] to perform simultaneous clustering during placement. In Chapter 5 we introduce an algorithm named SPD to perform logic duplication during placement. In Chapter 6 we build the first complete academic CAD flow, which can be easily plugged in to a state-of-the-art commercial tool, Altera's Quartus 4.0 software. Our unified synthesis and placement tool, SPCD, combines both the clustering and duplication techniques. Our experimental results show up to over 30% improvement in performance compared with the current state-of-the-art academic flow.
Blind source separation using order statistics
Authors: Jani Even, Eric Moisan
Venue: Signal Processing (2005)

This paper shows the possibility to blindly separate instantaneous mixtures of sources by means of a criterion exploiting order statistics. Properties of higher order statistics and second-order methods are first underlined. Then a brief description of the order statistics shows that they gather all these properties and a new criterion is proposed. Next an iterative algorithm able to simultaneously extract all the sources is developed. The last part is comparison of this algorithm with well-known methods (JADE and SOBI). The most striking result is the possibility to exploit together independence and correlation through the use of order statistics.
Systems of bounded arithmetic from descriptive complexity
Authors: Antonina Kolokolova
Venue:  (2005)

In this thesis we discuss a general method of constructing systems of bounded arithmetic from descriptive complexity logics of known complexity. We discuss the conditions under which the resulting systems capture the same complexity class in the bounded arithmetic setting as the corresponding logic in the descriptive complexity setting. Our method works for small complexity classes (P and below) which have simple proofs of closure under complementation. Additionally, we require proofs of membership and co-membership for instances of decision problems to be constructible within the same complexity class. More formally, given a logic L capturing complexity class C, the corresponding second-order system V-L of arithmetic consists of a system for AC 0 together with comprehension over L-formulae. If the class is provably in V-L closed under AC 0 reductions and every formula or its (possibly semantic) negation can be witnessed in C, then the resulting system captures C. Based on this general theorem, we discuss systems of arithmetic for classes P and NL. We also give a system of arithmetic for SL, although the definability theorem for SL is weaker.
Optimizing the Evaluation of Finite Element Matrices
Authors: Robert C. Kirby, Matthew Knepley, Anders Logg, L. Ridgway Scott
Venue: SIAM Journal on Scientific Computing (2005)

Assembling stiffness matrices represents a significant cost in many finite element computations. We address the question of optimizing the evaluation of these matrices. By finding redundant computations, we are able to significantly reduce the cost of building local stiffness matrices for the Laplace operator and for the trilinear form for Navier--Stokes operators. For the Laplace operator in two space dimensions, we have developed a heuristic graph algorithm that searches for such redundancies and generates code for computing the local stiffness matrices. Up to cubics, we are able to build the stiffness matrix on any triangle in less than one multiply-add pair per entry. Up to sixth degree, we can do it in less than about two pairs. Preliminary low-degree results for Poisson and Navier-Stokes operators in three dimensions are also promising.
Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints
Authors: Xiaonan Ji, James Bailey, Guozhu Dong
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Discovering contrasts between collections of data is an important task in data mining. In this paper, we introduce a new type of contrast pattern, called a Minimal Distinguishing Subsequence (MDS). An MDS is a minimal subsequence that occurs frequently in one class of sequences and infrequently in sequences of another class. It is a natural way of representing strong and succinct contrast information between two sequential datasets and can be useful in applications such as protein comparison, document comparison and building sequential classification models. Mining MDS patterns is a challenging task and is significantly different from mining contrasts between relational/transactional data. One particularly important type of constraint that can be integrated into the mining process is the maximum gap constraint. We present an efficient algorithm called ConSGapMiner, to mine all MDSs according to a maximum gap constraint. It employs highly efficient bitset and boolean operations, for powerful gap based pruning within a prefix growth framework. A performance evaluation with both sparse and dense datasets, demonstrates the scalability of ConSGapMiner and shows its ability to mine patterns from high dimensional datasets at low supports.
Hybrid visual and conceptual image representation within active relevance feedback context
Authors: Marin Ferecatu, Nozha Boujemaa, Michel Crucianu
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

Many of the available image databases have keyword annotations associated with the images. In spite of the availability of good quality low-level visual features that reflect well the physical content, image retrieval based on visual features alone is subject to semantic gap. Text annotations are related to image context or semantic interpretation of the visual content and are not necessarely directly linked to the visual appearance of the images. Keywords and visual features thus provide complementary information. Using both sources of information is an advantage in many applications and recent work in this area reflects this interest. In this paper, we address the challenge of semantic gap reduction using a hybrid visual and conceptual representation of the content within an active relevance feedback context. We introduce a new feature vector, based on the keyword annotations available for the images, which makes use of conceptual information extracted from an external lexical database, information represented by a set of "core concepts". Our experiments show that the use of the proposed hybrid conceptual and visual feature vector dramatically improves the quality of the relevance feedback results.
Generating Quality Dominating Sets for Sensor Network
Authors: K. Mohammed, L. Gewali, V. Muthukumar
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

We consider the problem of generating dominating sets for applications in information communication and sensor network. Known algorithms for solving this problem consider number of nodes in the dominating set as the sole criteria. We report algorithms for generating dominating sets by considering diameter and interference as the additional factors. Experimental investigation shows that the proposed algorithms can generate diameter reduced and interference aware dominating sets without increasing the size of the solution.
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy
Authors: Andrew W. Cook, William H. Cabot, Peter L. Williams, Brian J. Miller, Bronis R. de Supinski, Robert K. Yates, Michael L. Welcome
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We describe Miranda, a massively parallel spectral/compact solver for variabledensity incompressible flow, including viscosity and species diffusivity effects. Miranda utilizes FFTs and band-diagonal matrix solvers to compute spatial derivatives to at least 10th-order accuracy. We have successfully ported this communicationintensive application to BlueGene/L and have explored both direct block parallel and transpose-based parallelization strategies for its implicit solvers. We have discovered a mapping strategy which results in virtually perfect scaling of the transpose method up to 65,536 processors of the BlueGene/L machine. Sustained global communication rates in Miranda typically run at 85% of the theoretical peak speed of the BlueGene/L torus network, while sustained communication plus computation speeds reach 2.76 TeraFLOPS. This effort represents the first time that a high-order variable-density incompressible flow solver with species diffusion has demonstrated sustained performance in the TeraFLOPS range.
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
Authors: Jian-Jia Chen, Tei-Wei Kuo
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task runs before its deadline. When voltage scaling could be done at any time, and tasks share the same power consumption function, we propose a greedy algorithm which derives a solution with at least a half of the optimal reward for any input instance. A fully polynomial-time approximation scheme is also proposed by applying the dynamic programming approach so that the ratio of the reward of the derived solution to that of an optimal solution is at least 1-ε under polynomial-time complexity in 1/ε for any 0
A Unified Mechanism for Multimedia Downlink Scheduling and Call Admission Control for Future Error-Prone Wireless Networks
Authors: P. Koutsakis
Venue: Wireless Personal Communications: An International Journal (2005)

In this paper we design and evaluate the performance of a unified mechanism for downlink scheduling and call admission control of multimedia traffic in a high-capacity TDMA wireless channel. In our scheme, the Base Station interacts with the Call Admission Controller and incorporates predictions on the channel condition in its decision making. Our results show that, with the use of the "intelligent" scheduler-admission controller mechanism, system performance is significantly enhanced compared to two other schemes without prediction on the channel condition.
Modeling QCA Defects at Molecular-level in Combinational Circuits
Authors: Mariam Momenzadeh, Marco Ottavi, Fabrizio Lombardi
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

This paper analyzes the deposition defects in devices and circuits made of Quantum-dot Cellular Automata (QCA) for molecular implementation. Differently from metal-based QCA, in this type of implementation a defect may occur due to the erroneous deposition of cells (made of molecules) on a substrate, i.e. no cell, or an additional cell is placed either near, or within the layout configuration of a QCA device. The effects of an erroneous cell deposition defect are analyzed by considering the induced functional faults for different QCA devices, such as the majority voter, the inverter and various wire configurations (straight, L-shape, coplanar crossing and fanout). Extensive simulation results are provided. As an example, testing of an EXOR circuit is analyzed in detail.
Distributed, Parallel Web Service Orchestration Using XSLT
Authors: Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

GridXSLT is an implementation of the XSLT programming language designed for distributed web service orchestration. Based on the functional semantics of the language, it compiles programs into dataflow graphs which can be efficiently executed across a collection of machines in a cluster or grid environment. Calls to web services can be made using the standard function call semantics provided by the language, and occur in parallel using the dataflow model of computation. The programmer is not required to explicitly specify the parallelism, as the details of how programs are scheduled and executed in a distributed environment are abstracted away by the run-time engine. XSLT provides a higher level programming model than many other approaches to web services composition; we explore its use here as a means of easing the task of orchestrating the interactions between services. In addition to the normal XSLT syntax, our system also supports programs written in XSLiTe, an alternative syntax we have developed which uses more concise representations of language constructs, increasing the ease of development, and bringing code readability closer to that of traditional programming languages. Our goal is to ease the construction of applications based on web services composition, such as those used in eScience and other fields in which service oriented architectures are prominent.
Influences of network latency and packet loss on consistency in networked racing games
Authors: Takahiro Yasui, Yutaka Ishibashi, Tomohito Ikedo
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

This paper investigates the influences of network latency and packet loss on the consistency among players in networked racing games. We here deal with the &Delta;-causality control as causality control and dead-reckoning as prediction control. By experiment, we make a performance comparison among the &Delta;-causality scheme, the dead-reckoning scheme, a scheme which carries out the &Delta;-causality control and dead-reckoning together, and a scheme which performs neither of the two types of control. As a result, we show that the combination use of the two types of control can keep the consistency and fairness among players in good condition.
A view of the data file access problem from the perspective of a research librarian
Authors: James Krikelas
Venue: ACM SIGSOC Bulletin (1974)

In the 1960s, the emergence of a relatively large number of archives for machine-readable data (i.e., data libraries) gave rise to the notion that traditional university and research libraries would be forced to cope with the integration of such information into their collections. Historically, libraries have been dedicated to the gathering, processing, and storage of information and, in all but the weakest organizations, to providing active and skilled assistance in the interpretation and use of the collection. For a variety of reasons, libraries have occasionally failed to acquire new types of information, either because of inaccurate perception about the need of such material or because of some reluctance to deal with a new medium of distribution. Nonconventional information centers have developed as alternative sources of such materials. The scope and depth of the collection of such centers can be stated in relatively precise terms which describe the narrowly defined target user-group. Under these circumstances special libraries appear to respond much more rapidly to user needs, and users tend to view the center almost as an extension of one's own personal collection. As the special collection grows and the user group diversifies, the informal procedures developed for the acquisition, indexing and storage of materials begins to break down. If this evolution follows traditional patterns, personnel in data libraries will be confronted with increasing problems of storage and retrieval of information. It may be tempting to believe that these are unique difficulties requiring previously untried solutions. In actuality, there are many problems facing the data library manager that have their analogous situations and solutions in traditional libraries. It is the purpose of this paper to share a few observations about these similarities based on a preliminary investigation of the procedures and services offered at one particular data center.
Counting Interface Automata and their Application in Static Analysis of Actor Models
Authors: Ernesto Wandeler, Jorn W. Janneck, Edward A. Lee, Lothar Thiele
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

We present an interface theory based approach to static analysis of actor models. We first introduce a new interface theory, which is based on Interface Automata, and which is capable of counting with numbers. Using this new interface theory, we can capture temporal and quantitative aspects of an actor interface as well as an actor's token exchange rate. We will show, how to extract this information from actors written in the Cal Actor Language (CAL), and we also present a method to capture the interface information as well as the structure of dataflow models into an interface automaton. This automaton acts as glue between the automata of all actors in the model, and by successfully composing all actor automata with it, we can prove interface compatibility of all actors with the composition framework. After successful composition, the resulting automaton will contain information that can be used for further static analysis of the composite actor model.
Impact of H2/N2 annealing on interface defect densities in Si(100)/SiO2/HfO2/TiN gate stacks
Authors: M. Schmidt, M. C. Lemme, H. Kurz, T. Witters, T. Schram, K. Cherkaoui, A. Negara, P. K. Hurley
Venue: Microelectronic Engineering (2005)

This paper reports on the influence of forming gas annealing (5%H2/95%N2) over the temperature range 350°C-550°C on the density of electrically active interface states in Si(100)/SiO2/HfO2/TiN gate stacks. Prior to forming gas annealing the distribution of interface states across the energy gap exhibits the electrical signature of the Pb0 dangling bond centre for the hydrogen free Si(100)/SiO2 interface. Forming gas annealing at 350°C and 400°C results in a reduction of the interface state density, with an increase in interface state density for forming gas anneals in the range 450°C-550°C. The effect of the cooling ambient for the forming gas anneal (N2 or H2/N2) is also reported.
Detection for Conflicts of Dependencies in Advanced Transaction Models
Authors: Tai Xin, Indrakshi Ray
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Transactional dependencies play an important role in coordinating the execution of subtransactions in advanced transaction models, such as, nested transactions and workflowtransactions. The correct execution of the advanced transactions depends on ensuring the satisfaction of all the dependencies, which are specified by the application developer. Incorrect specification of transaction dependencies might lead to information integrity problems and unavailability of resources. An example of incorrect specification of dependencies is the presence of conflicts ¿ the satisfaction of constraints imposed by one dependency may violate the constraints imposed by another dependency. Algorithms that can analyze and detect dependency conflicts are necessary. Although a lot of research appears on advanced transactions, no previous work has been done on analysis of dependency conflicts. In this work we analyze different kinds of dependency conflicts, propose algorithms to detect and remove the conflicts of dependencies in advanced transaction specifications. This will enable the application developer to get assurance about the correctness of the dependency specification and the correct behavior of the underlying advanced transaction model.
A profile of simulation modelers
Authors: Susan L. Solomon
Venue: ACM SIGSIM Simulation Digest (1979)

A paper discussing some issues germane to the preparation and interests of simulation professionals was published in the <u>Proceedings of the 1979 Annual Simulation Symposium</u>. A portion of the presentation at the Symposium was based on a questionnaire circulated at the 1978 Winter Simulation Conference and was compiled too late for inclusion in the <u>Proceedings</u> copy. The same questionnaire was distributed in registration packets at the 1979 Annual Simulation Symposium. The results of the latter survey have now been tallied. Some interesting similarities and differences present themselves. The questionnaire and results for the two groups are shown below. In each case, column 1 shows the percentage of the 35 Winter Simulation Conference attendees who responded affirmatively, while column 2 shows the comparable percentage of the 59 Annual Simulation Symposium attendees who responded affirmatively.
Power aware memory system
Authors: Xiaobo Fan
Venue:  (2004)

Main memory is becoming an important target for energy optimization. Memory technology is becoming available that offers power management features. We address the problem of memory energy optimization in several levels and stages. First, in the software level, we revisit traditional virtual memory page allocation and propose a power aware page allocation scheme to complement the hardware power management strategies. We explore the interaction of page placement with static and dynamic hardware policies. Using both trace-drive and execution-driven simulations, our results make a compelling case for a cooperative hardware/software approach for exploiting memory power management features. Second, we investigate what the appropriate hardware control policy should be given a set of hardware power states. A device with power management features can be transitioned down to a low power state to save energy when it is not in use. Only when the time of staying in low power is long enough, can the energy saving cover the transition cost. Power management makes decisions on if and when to make transitions during each idle period. Without perfect knowledge about the access pattern, the power manager has to make a guess on the upcoming idle time. However, single value prediction fails to capture the uncertainty of the access patterns; probabilistic modeling fails to capture the variety and non-stationarity of the access patterns. While identifying the limitations of these approaches, we propose a probability-based online approach for adapting to access patterns and making decisions efficiently. Simulation results show that our strategy saves more energy than other available strategies, and is general and efficient enough to be applied to various devices. Finally, in recognization that Dynamic Voltage Scaling (DVS) has been studied extensively to optimize CPU power consumption while not considering other components' contribution, we explore the interactions between memory and processor voltage scaling. The results indicate that effective CPU speed settings should take into account the information of memory access behavior.