ppxscal/embedding_network huggingface dataset:
SPR: an architecture-adaptive CGRA mapping tool
Authors: Stephen Friedman, Allan Carroll, Brian Van Essen, Benjamin Ylvisaker, Carl Ebeling, Scott Hauck
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

In this paper we present SPR, a new architecture-adaptive mapping tool for use with Coarse-Grained Reconfigurable Architectures (CGRAs). It combines a VLIW style scheduler and FPGA style placement and pipelined routing algorithms with novel mechanisms for integrating and adapting the algorithms to CGRAs. We introduce a latency padding technique that provides feedback from the placer to the scheduler to meet the constraints of a fixed frequency device with configurable interconnect. Using a new dynamic clustering method during placement, we achieved a 1.3x improvement in throughput of mapped designs. Finally, we introduce an enhancement to the PathFinder algorithm for targeting architectures with a mix of dynamically multiplexed and statically configurable interconnects. The enhanced algorithm is able to successfully share statically configured interconnect in a time-multiplexed way, achieving an average channel width reduction of .5x compared to non-shared static interconnect.
Exploring interpersonal touch in computer games
Authors: Cody Watts, Ehud Sharlin, Peter Woytiuk
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Acts of interpersonal touch are used by couples to communicate with their partner in a simple, lightweight and emotionally significant way. In this abstract, we briefly present our motivation and initial design approach for Matchmaker -- a cooperative, romantically-themed game for tabletop computers which integrates acts of interpersonal into its game mechanics.
The BlenX Language with Biological Transactions
Authors: Federica Ciocchetta
Venue: Transactions on Computational Systems Biology IX (2009)

An extension of the BlenX language with biological transactions, called TBlenX, is presented. The aim of this extension is to model a sequence of elementary actions as if it were atomic. This extension is useful when we need to specify multi-reactant multi-product reactions or when we use a sequence of actions to represent a biological interaction. Some properties of these transactions are discussed and some examples are reported to illustrate our extension.
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Authors: Stefano Galatolo, Mathieu Hoyrup, Cristóbal Rojas
Venue: Theoretical Computer Science (2009)

In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets A"i with effectively summable measures, there are computable points which are not contained in infinitely many A"i. As a consequence of this we obtain the existence of computable points which follow the typical statistical behavior of a dynamical system (they satisfy the Birkhoff theorem) for a large class of systems, having computable invariant measure and a certain ''logarithmic'' speed of convergence of Birkhoff averages over Lipschitz observables. This is applied to uniformly hyperbolic systems, piecewise expanding maps, systems on the interval with an indifferent fixed point and it directly implies the existence of computable numbers which are normal with respect to any base.
Engineering Privacy
Authors: Sarah Spiekermann, Lorrie Faith Cranor
Venue: IEEE Transactions on Software Engineering (2009)

In this paper we integrate insights from diverse islands of research on electronic privacy to offer a holistic view of privacy engineering and a systematic structure for the discipline's topics. First we discuss privacy requirements grounded in both historic and contemporary perspectives on privacy. We use a three-layer model of user privacy concerns to relate them to system operations (data transfer, storage and processing) and examine their effects on user behavior. In the second part of the paper we develop guidelines for building privacy-friendly systems. We distinguish two approaches: "privacy-by-policy" and "privacy-by-architecture." The privacy-by-policy approach focuses on the implementation of the notice and choice principles of fair information practices (FIPs), while the privacy-by-architecture approach minimizes the collection of identifiable personal data and emphasizes anonymization and client-side data storage and processing. We discuss both approaches with a view to their technical overlaps and boundaries as well as to economic feasibility. The paper aims to introduce engineers and computer scientists to the privacy research domain and provide concrete guidance on how to design privacy-friendly systems.
Plenary lecture VI: content aware image processing
Authors: Raimondo Schettini
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

The great diffusion of digital cameras and the widespread use of the internet have produced a mass of digital images depicting a huge variety of subjects, generally acquired by non-professional photographers using unknown imaging systems under unknown lighting conditions. The quality of these real-world photos can be considerably improved by digital image processing. In this lecture we describe our approach for content-aware image processing and enhancement. According to our approach, the overall quality of a digital photo is improved by modular, fully automatic, image enhancement procedures driven by the image class and content. Single processing modules can be considered as autonomous elements that are suitably combined to improve the overall quality according to image and defect categories.
Cloud Computing: Does Nirvana Hide behind the Nebula?
Authors: Hakan Erdogmus
Venue: IEEE Software (2009)

At the core of cloud computing is a simple concept: software as a service, or SaaS. Whether the underlying software is an application, application component, platform, framework, environment, or some other soft infrastructure for composing applications to be delivered as a service on the Web, it's all software in the end. But the simplicity ends there. Just a step away from that core, a complex concoction of paradigms, concepts, and technologies envelop cloud computing.
Significance of Word and Syllable Level Information for Expressive Speech Processing
Authors: K. Sreenivasa Rao, S. R. M. Prasanna, T. V. Sagar
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In general, human beings make use of expressions (emotions) through speech, facial movements and gestures for conveying the crucial information. Mostly, expressions in speech can be attributed to longer segments, i.e., suprasegmental features also known to be prosodic features. In this paper we analyze the expressions in speech using prosodic features from utterance level, word level and syllable level. The emotions considered for the analysis are anger,compassion, happy and neutral. The prosodic features used in the analysis are duration, intonation (pitch) and energy. The analysis is performed on SUSE (Speech Under Simulated Emotion) database. The results of the analysis are used for synthesizing the expressions in neutral speech. The synthesis experiments using the features from utterance level to syllable level showed that a steady improvement in the quality of speech for the desired expressions.
A two-stage modelling architecture for distributed control of real-time industrial systems: Application of UML and Petri Net
Authors: Francesco Basile, Pasquale Chiacchio, Domenico Del Grosso
Venue: Computer Standards Interfaces (2009)

The use of UML in the design process of distributed automation systems is here proposed. UML is used to formally express system's requirements, model the uncontrolled system and design the controlled one. It is here proposed a domain transformation: to go from the informal description to UML and from UML to PN models. In this way the capability to describe the system behavior is fully exploited, while the system analysis can be more properly performed in PN domain. Furthermore, it is to show the possibility of conferring intelligence to real objects, even to immaterial objects, so that they can cooperate to fulfil the desired tasks in a distributed plant. To illustrate the methodology a real case study is used.
Exploration of Virtual Avatar Technology Based on VRML and Java
Authors: Duan Xinyu, Jiang Pin
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

VRML is mainly used to make 3D user interface and to control dynamic display in real-time state. Java is responsible for correspondence between Web browser and VRML scene, also for linkage with other information system section. Paper first introduced default VRML’s invisible 3D viewer’s avatar modeling. Then mainly discussed VRML and Java combination, including VRML’s deficiency in creating real-time data input and output for peripheral equipment; adopting EAI to create Java Applet for the purpose of real-time data correspondence between external application program and VRML scene nodes. EAI technology strategies, EAI operation mechanism, EAI four kinds of possible accessing type and its event transmit mechanism etc. contents are detailed formulated. Finally paper described a typical VRML avatar PROTO definition specification and its concrete avatar citation application example.
Budgeted Phylogenetic Diversity on Circular Split Systems
Authors: Bui Quang Minh, Fabio Pardi, Steffen Klaere, Arndt von Haeseler
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

In the last 15 years, Phylogenetic Diversity (PD) has gained interest in the community of conservation biologists as a surrogate measure for assessing biodiversity. We have recently proposed two approaches to select taxa for maximizing PD, namely PD with budget constraints and PD on split systems. In this paper, we will unify these two strategies and present a dynamic programming algorithm to solve the unified framework of selecting taxa with maximal PD under budget constraints on circular split systems. An improved algorithm will also be given if the underlying split system is a tree.
Loss reduction of double-layer networks with holographic optical switches
Authors: Jiun-Shiou Deng, Hsin-Hua Huang, Ming-Feng Lu, Yang-Tung Huang
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Combining the unique features of the double-layer network and holographic optical switches not only reduces the volume of the whole system and eliminates all interconnection lines and crossovers significantly, but also reduces the number of drivers from N2/4+2Nlog2N-2N to 2Nlog2N. After modifying the structures of the holographic optical switches to satisfy the characteristics of the double-layer network, the system insertion loss can also be significantly minimized and the required components can be reduced.
CAPgets: Mobile Web Runtime Environment for Community Applications
Authors: David Linner, Steffen Krüssel, Stephan Steglich
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The Web as a platform for networked applications is pushing for mobile phones. Will the mobile Web be about the same as the 'desktop Web' or an enabler for a completely new kind of applications? Based on our experiences in the area of location-based community applications for mobile devices, we developed a Web runtime environment for mobile phones named CAPgets. In this work we describe the requirements we started from, the resulting architecture, a first implementation of the architecture for Java-enabled mobile phones, and some simple examples for a location-based, mobile Web application.
A low-jitter 1.5-GHz and large-EMI reduction 10-dBm spread-spectrum clock generator for Serial-ATA
Authors: Takashi Kawamoto, Masaru Kokubo
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A low-jitter and large-EMI-reduction spread spectrum clock generator (SSCG) for Serial-ATA (SATA) was developed. A low-jitter voltage-controlled oscillator (VCO) with a high-frequency limiter was developed to prevent the SSCG from malfunctioning. This VCO achieved far less jitter than that of a conventional VCO. An autocalibration technique suitable for this VCO was developed to prevent the SSCG from degrading performance because of process variations. A SATA PHY using a technique for calibrating the SSCG was developed to use an inexpensive but large frequency-variation reference oscillator. This technique was used to calibrate the SSCG output-signal frequency. This is achieved by shifting an SSCG divide ratio by utilizing the difference between an SSCG output signal frequency and a received signal frequency. These techniques were fabricated in 0.13- and 0.15-&mu;m CMOS processes. The proposed SSCG achieved a 10.0-dB reduction in EMI. The variation in the rms jitter at 1.5 GHz with spread-spectrum clocking was reduced from 2.1--7.8 ps to 1.9--3.3 ps by the proposed autocalibration technique. The proposed SATA PHY achieved less than 400-ppm production-frequency tolerance of reference clocks.
Performances of turbo decoders in terms of channel reliability factor
Authors: Lucian Andrei Perisoara, Rodica Stoian
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

The paper is a study of reliability for turbo decoder. To improve the weakness of reliability assignment using metric values directly, the reliability values of the survivor paths are trace back by an updating process at different time values. It is also analyzed the influence of channel reliability factor on performance of the iterative turbo decoder over a Gaussian channel. The simulations are done for a Parallel Concatenated Convolutional Codes (PCCC) system with MAP and SOVA decoding algorithms.
A distribution-free tabular CUSUM chart for correlated data with automated variance estimation
Authors: Joongsup Jay Lee, Christos Alexopoulos, David Goldsman, Seong-Hee Kim, Kwok-Leung Tsui, James R. Wilson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We formulate and evaluate distribution-free statistical process control (SPC) charts for monitoring an autocorrelated process when a training data set is used to estimate the marginal mean and variance of the process as well as its variance parameter (i.e., the sum of covariances at all lags). We adapt variance-estimation techniques from the simulation literature for automated use in DFTC-VE, a distribution-free tabular CUSUM chart for rapidly detecting shifts in the mean of an autocorrelated process. Extensive experimentation shows that our variance-estimation techniques do not seriously degrade the performance of DFTC-VE compared with its performance using exact knowledge of the variance parameter; moreover, the performance of DFTC-VE compares favorably with that of other competing distribution-free SPC charts.
Quantitative analysis of location management and QoS in wireless networks
Authors: Yan Zhang, Laurence T. Yang, Jianhua Ma, Jun Zheng
Venue: Journal of Network and Computer Applications (2009)

As a fundamental component in wireless networks, location management consists of two operations: location update and paging. These two supplementary operations enable the mobile user ubiquitous mobility. However, in case of failed location update, a significant consequence is the obsolete location identity in the network databases and thereafter the incapability in establishing the valid route for the potential call connection, which will seriously degrade the network quality-of-service (QoS). This issue is not theoretically studied in the literature. In this paper, we perform a quantitative analysis of the location management effect on QoS in the wireless networks. The metrics call blocking probability and the average number of blocked calls are introduced to reflect the QoS. For the sake of general applicability, the performance metrics are formulated with the relaxed tele-traffic parameters. Namely, the call inter-arrival time, cell residence time, location area residence time and location update inter-arrival time follow a general probability density function. The formulae are additionally specified in the static and several dynamic location management mechanisms. Numerical examples are presented to show the interaction between the performance metrics and location management schemes. The discussions on the sensitivity of tele-parameters are also given.
Towards implementation of a novel scheme for data prefetching on distributed shared memory systems
Authors: Hsiao-Hsi Wang, Kuan-Ching Li, Ssu-Hsuan Lu, Chun-Chieh Yang
Venue: The Journal of Supercomputing (2009)

High speed networks and rapidly improving microprocessor performance make the network of workstations an extremely important tool for parallel computing in order to speedup the execution of scientific applications. Shared memory is an attractive programming model for designing parallel and distributed applications, where the programmer can focus on algorithmic development rather than data partition and communication. Based on this important characteristic, the design of systems to provide the shared memory abstraction on physically distributed memory machines has been developed, known as Distributed Shared Memory (DSM). DSM is built using specific software to combine a number of computer hardware resources into one computing environment. Such an environment not only provides an easy way to execute parallel applications, but also combines available computational resources with the purpose of speeding up execution of these applications. DSM systems need to maintain data consistency in memory, which usually leads to communication overhead. Therefore, there exists a number of strategies that can be used to overcome this overhead issue and improve overall performance. Strategies as prefetching have been proven to show great performance in DSM systems, since they can reduce data access communication latencies from remote nodes. On the other hand, these strategies also transfer unnecessary prefetching pages to remote nodes. In this research paper, we focus on the access pattern during execution of a parallel application, and then analyze the data type and behavior of parallel applications. We propose an adaptive data classification scheme to improve prefetching strategy with the goal to improve overall performance. Adaptive data classification scheme classifies data according to the accessing sequence of pages, so that the home node uses past history access patterns of remote nodes to decide whether it needs to transfer related pages to remote nodes. From experimental results, we can observe that our proposed method can increase the accuracy of data access in effective prefetch strategy by reducing the number of page faults and misprefetching. Experimental results using our proposed classification scheme show a performance improvement of about 9---25% over the same benchmark applications running on top of an original JIAJIA DSM system.
Logic Synthesis of Handshake Components Using Structural Clustering Techniques
Authors: Francisco Fernández-Nogueira, Josep Carmona
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

A methodology to optimize handshake circuits is presented. The approach selects clusters of a handshake network for which signals representing internal channels within a cluster are hidden. To guarantee asynchronous implementability on the resulting cluster, state encoding is applied using modern structural techniques. The theory of Petri nets is used to identify clusters for which the structural techniques perform successfully. Finally logic synthesis is employed for each reencoded cluster. The approach is integrated into the Balsa synthesis flow and represent a significant improvement with respect to the local optimizations typically applied. Experimental results in area and performance have been obtained to measure the optimization on typical Balsa examples.
A direct construction of polynomial-size OBDD proof of pigeon hole problem
Authors: Wěi Chén, Wenhui Zhang
Venue: Information Processing Letters (2009)

Viewing OBDD from the explicit perspective of a propositional proof system is first proposed and studied in [A. Atserias, P.G. Kolaitis, M.Y. Vardi, Constraint propagation as a proof system, in: CP, 2004, pp. 77-91]. It has been shown that OBDD proof system defined in [A. Atserias, P.G. Kolaitis, M.Y. Vardi, Constraint propagation as a proof system, in: CP, 2004, pp. 77-91] is strictly stronger than resolution and can polynomially simulate cutting plane proof system with small coefficients CP^*. It is already shown in [W. Cook, C.R. Coullard, G. Turan, On the complexity of cutting-plane proofs, Discrete Appl. Math. 18 (1) (1987) 25-38] that there exists polynomial-size proof for pigeon hole problem PHP"n^n^+^1 of cutting plane proof system. Then it follows directly that there exists polynomial-size proof for PHP"n^n^+^1 of OBDD proof system. However, this is an indirect result. Atserias et al. [A. Atserias, P.G. Kolaitis, M.Y. Vardi, Constraint propagation as a proof system, in: CP, 2004, pp. 77-91] call for the need of a direct construction. Hereby we present such construction. Moreover, in this construction we do not need the weakening rule introduced in [A. Atserias, P.G. Kolaitis, M.Y. Vardi, Constraint propagation as a proof system, in: CP, 2004, pp. 77-91]. We believe this may shed some light on the understanding of the role of the weakening rule.
The high cost of software: causes and corrections
Authors: Richard H. Thayer, John B. Slaughter, Barry W. Boehm, Judith A. Clapp, John H. Manley, James H. Burrows
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In any large scale data processing development the cost of software development is three to five times the cost of hardware. It is estimated that in 1980's this development cost will jump to ten times that of the expenditures predicted for the hardware of that era. If the Government or industry is to maintain a ceiling on this cost, research must be conducted on ways to reduce costs in the various phases of software development such as design, specification, implementation, etc. For purposes of this session, "cost" will encompass not only the resources necessary to develop the software or transfer it, but also costs associated with delays in both delivery and "fixing," and resources wasted with software of poor quality. This session is an outgrowth of a tri-service/industry symposium entitled "The High Cost of Software" which was held at the Navy Post-Graduate Center, Monterey, California from September 17--19, 1973, in which service, industry and university experts attempted, for the first time, to get a better understanding of the costs of computer software and to make some recommendations as to what could be done about it. This session deals with the causes of software costs, the identification of both specific trouble areas and proposed R&D approaches that could be taken to eliminate the negative impact these areas have, and the particular ongoing research projects aimed at reducing software costs.