ppxscal/embedding_network huggingface dataset:
Minimizing leakage power in sequential circuits by using mixed Vt flip-flops
Authors: Jaehyun Kim, Youngsoo Shin
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Dual Vt has been widely used to control leakage, while, at the same time, satisfying circuit performance. However, current approaches target the combinational circuits even though sequential elements, such as flip-flops and latches, contribute an appreciable proportion of the total leakage. The use of dual Vt flip-flops is limited to circuits of large timing slack, because introducing high Vt flip-flops in place of low Vt ones yields abrupt change in timing. We propose mixed Vt flip-flops, which are designed by using both low and high Vt, but in different transistors. Compared to low Vt flip-flop, the mixed Vt flip-flops exhibit increased delay, but either on setup time or on clock-to-Q delay but not on both, while their leakage is greatly reduced. We extend the conventional sensitivity-based dual Vt allocation algorithm to incorporate mixed Vt flip-flops together with dual Vt combinational gates. Experimental results show that an average leakage saving of 31% is achieved, compared to the use of dual Vt on combinational subcircuits alone. The leakage of the flip-flops themselves is cut by 57% on average.
Computer Performance Evaluation Methodology
Authors: P. Heidelberger
Venue: IEEE Transactions on Computers (1984)

The quantitative evaluation of computer performance is needed during the entire life cycle of a computer system. We survey the major quantitative methods used in computer performance evaluation, focusing on post-1970 developments and emphasizing trends and challenges. We divide the methods used into three main areas, namely performance measurement, analytic performance modeling, and simulation performance modeling, which we survey in the three main sections of the paper. Although we concentrate on the methods per se, rather than on the results of applying the methods, numerous application examples are cited. The methods to be covered have been applied across the entire spectrum of computer systems from personal computers to large mainframes and supercomputers, including both centralized and distributed systems. The application of these methods has certainly not decreased over the years and we anticipate their continued use as well as their enhancement when needed to evaluate future systems.
Health information exchange policy and evaluation
Authors: Janet M. Marchibroda
Venue: Journal of Biomedical Informatics (2007)

Concerns about the quality, safety, and cost of healthcare have driven the nation to increase its focus on this issue. A number of states are moving forward-in parallel with federal efforts-to develop and adopt policies for improving health and healthcare through health information technology and electronic health information exchange. Based on the eHealth Initiative's experience providing technical assistance to more than 20 states, and its work related to its coalition of more than 250 state, regional and community-based health information exchange initiatives and organizations, the most difficult challenges facing these initiatives and organizations today is that related to assessing the value of services that emerge from the health information exchange to various stakeholders groups such as providers, payers, and employers, and converting those value assessments to business plans that promote and assure sustainability for these initiatives. The combination of increased federal and state focus and funding and the pace at which regional and community-based health information networks are developing, along with the identification of value and sustainability as some of the most difficult challenges experienced by these efforts, all point to the significant need for evaluation. The most critical evaluation questions focus on the impact of health information technology and health information exchange on quality, safety, efficiency, the value of such efforts for various stakeholders, and assessment of how grant programs can be designed to support positive impact, value, and a sustainable business model, so that efforts continue when the grant funds are fully expended.
Supersystems for the 80's
Authors: S. P. Kartashev
Venue: Computer (1980)

LSI technology has led to architectural adaptation and increased computational concurrency powerful means of improving throughput.
Using SPARK for a beginner's course on reasoning about imperative programs
Authors: Kung-Kiu Lau
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

Teaching beginners predicate transformer semantics for imperative languages is not a trivial task. For Computer Science majors, the teaching of the theoretical material must be supported by suitable practical course work. For this, we need a suitable language with appropriate tool support. In this paper, we describe our experience of using SPARK and its tools for this purpose. Our experience has been a very positive one. practical work.
An Access Control Scheme in Wireless Sensor Networks
Authors: SHEN Yu-long, MA Jian-feng, PEI Qing-qi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Access control is a critical security service in sensor networks. Sensor networks provide the query service of the environmental monitoring data as the service provider to the users. The current access control scheme based on public key cryptography is high in expenses, and difficult to resist replay and DoS attacks. This paper proposes several effective access control schemes using the one-way key chain and the Merkle hash tree. Also this paper provides a revocation tree scheme to revoke the access control capability from compromised users. These schemes have several advantages over the current access control methods of low expenses in calculation, storage and communication, and resistance to node capture, query replay and DoS attacks.
Use of Mirror Neurons in a Holographic Associative Memory Implementation
Authors: Policarpo B. Uliana, Rui Seara
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper discusses the implementation of holographic associative memories through artificial neural networks (using mirror neurons). Such memories use a data structure based on random patterns to store and retrieve the desired information, presenting some features that are very similar to biological memory systems. This approach for data storage discards any training process as well as does not need complex procedures to retrieve the output data. As the information is distributed in the whole memory, some part of it may be corrupted by noise or even be deleted without any loss of essential information. An application example is shown and discussed.
A New Methodology for Interconnect Parasitics Extraction Considering Photo-Lithography Effects
Authors: Ying Zhou, Zhuo Li, Yuxin Tian, Weiping Shi, Frank Liu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Even with the wide adaptation of resolution enhancement techniques in sub-wavelength lithography, the geometry of the fabricated interconnect is still quite different from the drawn one. Existing Layout Parasitic Extraction (LPE) tools assume perfect geometry, thus introducing significant error in the extracted parasitic models, which in turn cases significant error in timing verification and signal integrity analysis. Our simulation shows that the RC parasitics extracted from perfect GDS-II geometry can be as much as 20% different from those extracted from the post litho/etching simulation geometry. This paper presents a new LPE methodology and related fast algorithms for interconnect parasitic extraction under photo-lithographic effects. Our methodology is compatible with the existing design flow. Experimental results show that the proposed methods are accurate and efficient.
A Power-Aware Multicast Routing Protocol for Mobile Ad Hoc Networks With Mobility Prediction
Authors: Nen-Chung Wang, Jong-Shin Chen, Yung-Fa Huang, Yu-Li Su
Venue: Wireless Personal Communications: An International Journal (2007)

A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes that message packets use. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. In this paper, we propose a power-aware multicast routing protocol (PMRP) with mobility prediction for MANETs. In order to select a subset of paths that provide increased stability and reliability of routes, in routing discovery, each node receives the RREQ packet and uses the power-aware metric to get in advance the power consumption of transmitted data packets. If the node has enough remaining power to transmit data packets, it uses the global positioning system (GPS) to get the location information (i.e., position, velocity and direction) of the mobile nodes and utilizes this information to calculate the link expiration time (LET) between two connected mobile nodes. During route discovery, each destination node selects the routing path with the smallest LET and uses this smallest link expiration time as the route expiration time (RET). Each destination node collects several feasible routes and then selects the path with the longest RET value as the primary routing path. Then the source node uses these routes between the source node and each destination node to create a multicast tree. In the multicast tree, the source node will be the root node and the destination nodes will be the leaf nodes. Simulation results show that the proposed PMRP outperforms MAODV (Royer, E. M. Perkins, C. E. (1999). In Proceedings of the ACM MOBICOM, pp. 207---218, August 1999.) and RMAODV (Baolin, S. Layuan, L. (2005). In Proceeding of the 2005 IEEE International symposium on microwave antenna, propagation and EMC technologies for wireless communications, Vol. 2, pp. 1514---1517, August 2005.).
On complexity of grammars related to the safety problem
Authors: Tomasz Jurdziski
Venue: Theoretical Computer Science (2007)

Leftist grammars were introduced by Motwani et al., who established the relationship between the complexity of the accessibility problem (or safety problem) for certain general protection systems and the membership problem for these grammars. The membership problem for leftist grammars is decidable. This implies the decidability of the accessibility problem. It is shown that the membership problem for leftist grammars is PSPACE-hard. Therefore, the accessibility problem in the appropriate protection systems is PSPACE-hard as well. Furthermore, the PSPACE-hardness result is adapted to a very restricted class of leftist grammars, if the grammar is a part of the input.
The coming of age of physical synthesis
Authors: Charles J. Alpert, Chris Chu, Paul G. Villarrubia
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Physical synthesis, the integration of logic synthesis with physical design information, was born in the mid to late 1990s, which means it is about to enter its teenage years. Today, physical synthesis tools are a major part of the EDA industry, accounting for hundreds of millions of dollars in revenue. This work looks at how technology and design trends have affected physical synthesis over the last decade and also how physical synthesis will continue to evolve on its way to adulthood.
The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case)
Authors: P. A. Bernstein
Venue: IEEE Transactions on Software Engineering (1978)

SDD-1, A System for Distributed Databases, is a distributed database system being developed by Computer Corporation of America (CCA), Cambridge, MA. SDD-1 permits data to be stored redundantly at several database sites in order to enhance the reliability and responsiveness of the system and to facilitate upward scaling of system capacity. This paper describes the method used by SDD-1 for updating data that are stored redundantly.
Scalable automatic test data generation from modeling diagrams
Authors: Yannis Smaragdakis, Christoph Csallner, Ranjith Subramanian
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling(ORM) language. ORM is a popular conceptual modelinglanguage, primarily targeting database applications, withsignificant uses in practice. The general problem of evenchecking whether an ORM diagram is satisfiable is quitehard: restricted forms are easily NP-hard and the problemis undecidable for some expressive formulations of ORM.Brute-force mapping to input for constraint and SAT solversdoes not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent (i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate that our subset of ORM is expressive enough to handle their vast majority
FL-PCP: Frequency Locking for Energy-Efficient Real-Time Task Synchronization
Authors: Ya-Shu Cheny, Chuan-Yue Yang, Tei-Wei Kuo
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In the past decade, energy-efficient real-time task scheduling has been widely explored in terms of various optimization problems. With a very different goal, this paper considers real-time task synchronization protocols with the minimization of energy consumption. We propose the concept of frequency locking and extend the Priority Ceiling Protocol by locking the processor frequency in a restricted way so that the cost in frequency switching is better managed. Algorithms are proposed to assign tasks base frequencies in the minimization of the energy consumption and with the consideration of schedulability tests. The capability of the proposed methodology is evaluated by a series of experiments, for which encouraging results were presented.
Fuzzy counter-offers in agent-mediated negotiations
Authors: Javier Carbó, José M. Molina, Jorge Dávila
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

Negotiation plays a fundamental role in systems composed of multiple autonomous agents. Some negotiations may require a more elaborated dialogue where agents would explain offer rejections in a general and vague way. We propose that agents would represent their disappointment about an offer through fuzzy logic. Fuzzyness can also be very useful in order to make human-like negotiations, consequently, user profiles may become more difficult to acquire in detail. Specifically we study two alternatives: a piece-wise fuzzy set or a linguistic label applied to each attribute of the offer. These alter-natives are evaluated comparing the performance of both types of counter-offers with a classical approach based on linear programming. Therefore, the average of negotiation length, benefits and percentage of agreements allow us to conclude the accuracy of the alternatives proposed.
A formal semantics for protocol narrations
Authors: Sébastien Briais, Uwe Nestmann
Venue: Theoretical Computer Science (2007)

Protocol narrations are a widely-used informal means to describe, in an idealistic manner, the functioning of cryptographic protocols as a single intended sequence of cryptographic message exchanges among the protocol's participants. Protocol narrations have also been informally ''turned into'' a number of formal protocol descriptions, e.g., using the spi-calculus. In this paper, we propose a direct formal operational semantics for protocol narrations that fixes a particular and, as we argue, well-motivated interpretation on how the involved protocol participants are supposed to execute. Based on this semantics, we explain and formally justify a natural and precise translation of narrations into spi-calculus. An optimised translation has been implemented in OCaml, and we report on case studies that we have carried out using the tool.
A Technique for Generating Specialized Gray Codes
Authors: V. E. Vickers
Venue: IEEE Transactions on Computers (1980)

Gray codes with specialized properties, such as equalized change numbers for general logic circuits or desired statistical properties for experimental designs, can be developed from standard n-bit Gray codes by an efficient block-insertion technique guided by a scalar quality measure. Solutions for n = 5 through 8 are shown.
Performance of Internet Services over the UMTS Enhanced Uplink
Authors: Andreas Mader, Dirk Staehle, Christian Gobwein
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The Enhanced Uplink or High Speed Uplink Packet Access (HSUPA) is designed to enable Internet applications in the uplink in UMTS networks. Its specification includes several new features which on the one hand increases throughput and decreases delay for the users, and on the other hand enables a better resource utilization on the network side. In this work, we explain the most prominent new features of the Enhanced Uplink and investigate their impact on the system and end-to-end performance with a special focus on different scheduling strategies. For the numerical results, a full-featured packet-level simulator has been implemented which enables the evaluation of UMTS networks with Rel. 99 users and Enhanced Uplink users in parallel.
An Empirical Investigation of Mesh and Torus NoC Topologies Under Different Routing Algorithms and Traffic Models
Authors: M. Mirza-Aghatabar, S. Koohi, S. Hessabi, M. Pedram
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

NoC is an efficient on-chip communication architecture for SoC architectures. It enables integration of a large number of computational and storage blocks on a single chip. NoCs have tackled the SoCs disadvantages and are scalable. In this paper, we compare two popular NoC topologies, i.e., mesh and torus, in terms of different figures of merit e.g., latency, power consumption, and power/throughput ratio under different routing algorithms and two common traffic models, uniform and hotspot. To the best of our knowledge, this is the first effort in comparing mesh and torus topologies under different routing algorithms and traffic models with respect to their performance and power consumption.
HiSbase: histogram-based P2P main memory data management
Authors: Tobias Scholl, Bernhard Bauer, Benjamin Gufler, Richard Kuntschke, Daniel Weber, Angelika Reiser, Alfons Kemper
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Many e-science communities, e. g., medicine, climatology, and astrophysics, are overwhelmed by the exponentially growing data volumes that need to be accessible by collaborating researchers. Nowadays, new scientific results are often obtained by exploring and cross-correlating data from different distributed sources [3]. However, neither centralized data processing by shipping the data to the processing site on demand nor a centralized data warehouse approach scale sufficiently to handle the huge data volumes and processing demands of future e-science communities and applications. The former suffers from high transmission costs while the latter cannot scale to the large amounts of data in combination with the growing number of queries.
The Representation and Matching of Pictorial Structures
Authors: M. A. Fischler
Venue: IEEE Transactions on Computers (1973)

The primary problem dealt with in this paper is the following. Given some description of a visual object, find that object in an actual photograph. Part of the solution to this problem is the specification of a descriptive scheme, and a metric on which to base the decision of "goodness" of matching or detection.
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
Authors: P. Balbiani, A. Baltag, H. van Ditmarsch, A. Herzig, T. Hoshi, T. de Lima
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: &squ;&phiv; expresses that &phiv; is true after an arbitrary announcement &psi;. As this includes the trivial announcement ⊤, one might as well say that &squ;&phiv; expresses what remains true after any announcement: it therefore corresponds to truth persistence after (definable) relativisation. The dual operation &diam;&phiv; expresses that there is an announcement after which &phiv;. This gives a perspective on Fitch's knowability issues: for which formulas &phiv; does it hold that &phiv; &rarr; &diam;K&phiv;? We give various semantic results, and we show completeness for a Hilbert-style axiomatisation of this logic.
Multimodal interaction analysis in a smart house
Authors: Pilar Manchón, Carmen del Solar, Gabriel Amores, Guillermo Pérez
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

This is a large extension to a previous paper presented in LREC 2006 [6]. It describes the motivation, collection and format of the MIMUS corpus, as well as an in-depth and issue-focused analysis of the data. MIMUS [8] is the result of multimodal WoZ experiments conducted at the University of Seville as part of the TALK project. The main objective of the MIMUS corpus was to gather information about different users and their performance, preferences and usage of a multimodal multilingual natural dialogue system in the Smart Home scenario in Spanish. The focus group is composed by wheel-chair-bound users, because of their special motivation to use this kind of technology, along with their specific needs. Throughout this article, the WoZ platform, experiments, methodology, annotation schemes and tools, and all relevant data will be discussed, as well as the results of the in-depth analysis of these data. The corpus compresses a set of three related experiments. Due to the limited scope of this article, only some results related to the first two experiments (1A and 1B) will be discussed. This article will focus on subject's preferences, multimodal behavioural patterns and willingness to use this kind of technology.