ppxscal/embedding_network huggingface dataset:
Guiding global placement with wire density
Authors: Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper presents an efficient technique for the estimation of the routed wirelength during global placement using the wire density of the net. The proposed method identifies congested regions of the chip and incorporates the model of the routed wirelength into the objective function in order to effectively alleviate these regions from congestion. The method is integrated in the analytical placement framework and the two-level structure improves the scalability of the placer and speeds up the algorithm. The proposed analytical placer provides the best-so-far average routed wirelength in the IBM version2 benchmark suite.
A branch-and-cut algorithm for the Winner Determination Problem
Authors: Laureano F. Escudero, Mercedes Landete, Alfredo Marín
Venue: Decision Support Systems (2009)

The Winner Determination Problem is the problem of maximizing the benefit when bids can be made on a group of items. In this paper, we consider the set packing formulation of the problem, study its polyhedral structure and then propose a new and tighter formulation. We also present new valid inequalities which are generated by exploiting combinatorial auctions peculiarities. Finally, we implement a branch-and-cut algorithm which shows its efficiency in a big number of instances.
Method for improvement of soft input decryption performances
Authors: Natasa Zivic, Christoph Ruland
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this work, the strategy for correction of bits using Soft Input Decryption is analyzed. Soft Input Decryption is used for correction of cryptographic check values, which are very fragile when they are transmitted over noisy channels: only one wrong bit at input of the decryptor causes about 50% of errors at output of the decryptor. Soft Input Decryption corrects wrong bits of cryptographic check values in most of cases using combination of SISO channel decoding and decrypting. Soft Input Decryption is an iterative process and therefore it is needed to minimize duration of iterations. This paper suggests an algorithm for optimization of Soft Input Decryption, which enables restriction of needed time to, theoretically, about 15% of it. Suggested optimization is performed for ECDSA digital signatures.
Flexible modeling based on copulas in nonparametric median regression
Authors: Roel Braekers, Ingrid Van Keilegom
Venue: Journal of Multivariate Analysis (2009)

Consider the model Y=m(X)+@e, where m(@?)=med(Y|@?) is unknown but smooth. It is often assumed that @e and X are independent. However, in practice this assumption is violated in many cases. In this paper we propose modeling the dependence between @e and X by means of a copula model, i.e. (@e,X)~C"@q(F"@e(@?),F"X(@?)), where C"@q is a copula function depending on an unknown parameter @q, and F"@e and F"X are the marginals of @e and X. Since many parametric copula families contain the independent copula as a special case, the so-obtained regression model is more flexible than the 'classical' regression model. We estimate the parameter @q via a pseudo-likelihood method and prove the asymptotic normality of the estimator, based on delicate empirical process theory. We also study the estimation of the conditional distribution of Y given X. The procedure is illustrated by means of a simulation study, and the method is applied to data on food expenditures in households.
A Novel Compatible Hardware Expansion Method Based on General Memory Interface
Authors: Xin Zhang, Xiaomu Wang, Yong Ren, Canfeng Chen, Jian Ma
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A new hardware expansion method based on memory card slot has been proposed in this paper, which can make the extended equipment more compatible with hosts that are running on different platforms. The main idea of our method is based on the fact that the logic interface between client devices and the higher level is memory card, and memory host controllers and drivers are all compatible with expansion memory cards; therefore, the driver of the extended equipment can communicate with the equipment smoothly through files in the operating system instead of employing API at the lower level. In this way, the host that supports memory cards will support the extended equipment, which brings much advantage in cross-platform compatibility and transportability. As an example to verify the proposed method, the hardware design framework for Zigbee transceiver based on SD slot is introduced.
Secure pairing with biometrics
Authors: Ileana Buhan, Bas Boom, Jeroen Doumen, Pieter H. Hartel, Raymond N. J. Veldhuis
Venue: International Journal of Security and Networks (2009)

Secure pairing enables two devices that share no prior context with each other to agree upon a security association, which they can use to protect their subsequent communication. Secure pairing offers guarantees of the association partner identity and it should be resistant to eavesdropping and to a man-in the middle attack. We propose the SAfE pairing system, a user friendly solution to this problem. Details are presented along with a discussion of the security features, experimental validation with two types of biometric data (face recognition and hand grip pressure pattern) and a usability analysis for face recognition biometric pairing.
Towards Improved Partner Selection Using Recommendations and Trust
Authors: Sarah N. Keung, Nathan Griffiths
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

Agents in open and dynamic environments face the challenge of uncertainty while interacting with others to achieve their goals. They face quick and unforeseen changes to the behaviour of other agents and the population itself, as agents join and leave at will. Since agents are assumed to be self-interested, it is essential for them to be able to choose the most reliable interaction partners to maximise the success of their interactions. Efficient agent selection requires information about their behaviour in different situations. This information can be obtained from direct experience as well as from recommendations. This paper presents a trust and reputation model, which allows agents to select interaction partners efficiently by adapting quickly to a dynamic environment. Our approach is built upon a number of components from several existing models to assess trustworthiness from direct interactions and recommendations. We take a multidimensional approach to evaluate trust and reputation and include indirect recommendations as another source of trust. This reinforces our previous work on recommendation sharing, which includes information about the recency and relevance of interactions, allowing an evaluator to select recommenders based on trust.
Shape preserving approximation on the real line with exponential weights
Authors: Oleksandr Maizlish
Venue: Journal of Approximation Theory (2009)

The well-known ''Bernstein's weighted problem'' deals with the possibility of weighted approximation on the whole real line. In this paper, we show the possibility of k-monotone approximation on the real line with Freud's weight W"@a(x)@?e^-^|^x^|^^^@a,@a>=1.
Synthesis of Silver Colloids: Experiment and Computational Model
Authors: Ionel Halaciuga, Daniel T. Robb, Vladimir Privman, Dan V. Goia
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

We summarize our recent results that model the formation of uniform spherical silver colloids prepared by mixing iso-ascorbic acid and silver-amine complex solutions in the absence of dispersants. We found that the experimental results can be modeled effectively by the two-stage formation mechanism used previously to model the preparation of colloidal gold spheres. The equilibrium concentration of silver atoms and the surface tension of silver precursor nanocrystals are both treated as free parameters, and the experimental reaction time scale is fit by a narrow region of this two-parameter space. The kinetic parameter required to match the final particle size is found to be very close to that used previously in modeling the formation of uniform gold particles, suggesting that similar kinetics governs the aggregation process. The model also reproduces semi quantitatively the effects of temperature and solvent viscosity on particle synthesis.
Trade-off analysis between timing error rate and power dissipation for adaptive speed control with timing error prediction
Authors: Hiroshi Fuketa, Masanori Hashimoto, Yukio Mitsuyama, Takao Onoye
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Timing margin of a chip varies chip by chip due to manufacturing variability, and depends on operating environment and aging. Adaptive speed control with timing error prediction is a promising approach to mitigate the timing margin variation, whereas it inherently has a critical risk of timing error occurrence when a circuit is slowed down. This paper presents how to evaluate the relation between timing error rate and power dissipation in self-adaptive circuits with timing error prediction. The discussion is experimentally validated using a 32-bit ripple carry adder in subthreshold operation in a 90nm CMOS process. We show a trade-off between timing error rate and power dissipation, and reveal the dependency of the trade-off on design parameters.
A field study in static extraction of runtime architectures
Authors: Marwan Abi-Antoun, Jonathan Aldrich
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

We recently developed a static analysis to extract runtime architectures from object-oriented programs written in existing languages. The approach relies on adding ownership domain annotations to the code, and statically extracts a hierarchical runtime architecture from an annotated program. We present promising results from a week-long on-site field study to evaluate the method and the tools on a 30-KLOC module of a 250-KLOC commercial system. In a few days, we were able to add the annotations to the module and extract a top-level architecture for review by a developer.
My Happy End
Authors: Milen Vitanov
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

"My Happy End" is an homage to traditional stop-motion animation. The technique used in the film is a mix of hand-drawn animation on paper, stop motion, and 3D computer animation.
Scheduled voltage scaling for increasing lifetime in the presence of NBTI
Authors: Lide Zhang, Robert P. Dick
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Negative Bias Temperature Instability (NBTI) is a leading reliability concern for integrated circuits (ICs). It gradually increases the threshold voltages of PMOS transistors, thereby increasing delay. We propose scheduled voltage scaling, a technique that gradually increases the operating voltage of the IC to compensate for NBTI-related performance degradation. Scheduled voltage scaling has the potential to increase IC lifetime by 46% relative to the conventional approach using guard banding for ICs fabricated using a 45nm process.
Scheduling optimisations for SPIN to minimise buffer requirements in synchronous data flow
Authors: Pieter H. Hartel, Theo C. Ruys, Marc C. W. Geilen
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling optimisations. We extend related work on using SPIN to experiment with scheduling optimisations aimed at minimising buffer requirements. We show that for a benchmark of commonly used case studies the performance of our SPIN based scheduler is comparable to that of state of the art research tools. The key to success is using the semantics of SDF to prove when using (even unsound and/or incomplete) optimisations are justified. The main benefit of our approach lies in gaining deep insight in the optimisations at relatively low cost.
Evaluations of the remainder term in approximation formulas
Authors: Daniel Florin Sofonea
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Using the linear operator (Lnf)(x) = (Bnf)(x) - x(1-x)/2(n-1) (B″nf)(x), where (Bnf)(x) is Bernstein polynomials, and f : [0, 1] → R, we present in this paper two evaluations form for the remainder. In final starting with A. Lupa's operators Ln as in (4), we prove Theorem 4 and one finds a lower-bound for (Lne2)(x) (see Theorem 5).
Towards reliable 5Gbps wave-pipelined and 3Gbps surfing interconnect in 65nm FPGAs
Authors: Paul Teehan, Guy G.F. Lemieux, Mark R. Greenstreet
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

FPGA user clocks are slow enough that only a fraction of the interconnect's bandwidth is actually used. There may be an opportunity to use throughput-oriented interconnect to decrease routing congestion and wire area using on-chip serial signaling, especially for datapath designs which operate on words instead of bits. To do so, these links must operate reliably at very high bit rates. We compare wave pipelining and surfing source-synchronous schemes in the presence of power supply and crosstalk noise. In particular, supply noise is a critical modeling challenge; better models are needed for FPGA power grids. Our results show that wave pipelining can operate at rates as high as 5Gbps for short links, but it is very sensitive to noise in longer links and must run much slower to be reliable. In contrast, surfing achieves a stable operating bit rate of 3Gbps and is relatively insensitive to noise.
A Comparison of DCT and DWT Block Based Watermarking on Medical Image Quality
Authors: Jason Dowling, Birgit M. Planitz, Anthony J. Maeder, Jiang Du, Binh Pham, Colin Boyd, Shaokang Chen, Andrew P. Bradley, Stuart Crozier
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

Hiding watermark information in medical image data files is one method of enhancing security and protecting patient privacy. However the research area of medical image watermarking has not been particularly active, partly due to concerns that any distortion could affect the diagnostic value of the medical image. These concerns can be addressed by ensuring that any image changes are kept below visual perception thresholds. In this paper the effects of image watermarking and common image manipulations are measured using the Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Measure (SSIM) and Steerable Visual Difference Predictor (SVDP) numerical metrics. Two methods of block based watermarking are compared: the Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT). To ensure a fair comparison a 128-pixel block size is used which allows an identical amount of information to be embedded for each method (3072 bits multiplied by embedding strength). The results suggest that although the two methods are similar, the DCT method is preferable if localization of changes is required. If localization is not required the DWT method is supported.
Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations
Authors: Sidney Rosario, Albert Benveniste, Stefan Haar, Claude Jard
Venue: IEEE Transactions on Services Computing (2008)

Service level agreements (SLAs), or contracts, have an important role in web services. They define the obligations and rights between the provider of a web service and its client, about the function and the Quality of the service (QoS). For composite services like orchestrations, contracts are deduced by a process called QoS contract composition, based on contracts established between the orchestration and the called web services. Contracts are typically stated as hard guarantees (e.g., response time always less than 5 msec). Using hard bounds is not realistic, however, and more statistical approaches are needed. In this paper we propose using soft probabilistic contracts instead, which consist of a probability distribution for the considered QoS parameter&#x2014;in this paper, we focus on timing. We show how to compose such contracts, to yield a global probabilistic contract for the orchestration. Our approach is implemented by the TOrQuE tool. Experiments on TOrQuE show that overly pessimistic contracts can be avoided and significant room for safe overbooking exists. An essential component of SLA management is then the continuous monitoring of the performance of called web services, to check for violations of the SLA. We propose a statistical technique for run-time monitoring of soft contracts.
From Obligations to Organizational Structures in Multi-Agent Systems
Authors: J. Octavio Gutiérrez-García, Jean-Luc Koning, Félix F. Ramos-Corchado
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

The achievement of common objectives in multi-agent systems is only possible through interaction and coordination; in order to implement both aspects in a effective manner, rules to direct the behavior of a group of agents are necessary, however, existing rules are usually static, inflexible, and inappropriate for large systems, where dynamic interaction takes place. We propose modeling agent behavior by means of obligations, utilized as social norms, delineating agents' roles as independent components, which can be grouped into organizational structures. Moreover, such organizations can be deployed on a service oriented platform, where the composition of organizations leads to the creation of new services.
New Characterizations of Simple Points in 2D, 3D, and 4D Discrete Spaces
Authors: Michel Couprie, Gilles Bertrand
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

A point of a discrete object is called simple if it can be deleted from this object without altering topology. In this article, we present new characterizations of simple points which hold in dimensions 2, 3 and 4, and which lead to efficient algorithms for detecting such points. In order to prove these characterizations, we establish two confluence properties of the collapse operation which hold in the neighborhood of a point in spaces of low dimension. This work is settled in the framework of cubical complexes, which provides a sound topological basis for image analysis, and allows to retrieve the main notions and results of digital topology, in particular the notion of simple point.
Coordinating randomized policies for increasing security of agent systems
Authors: Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordóñez, Sarit Kraus
Venue: Information Technology and Management (2009)

We consider the problem of providing decision support to a patrolling or security service in an adversarial domain. The idea is to create patrols that can achieve a high level of coverage or reward while taking into account the presence of an adversary. We assume that the adversary can learn or observe the patrolling strategy and use this to its advantage. We follow two different approaches depending on what is known about the adversary. If there is no information about the adversary we use a Markov Decision Process (MDP) to represent patrols and identify randomized solutions that minimize the information available to the adversary. This lead to the development of algorithms CRLP and BRLP, for policy randomization of MDPs. Second, when there is partial information about the adversary we decide on efficient patrols by solving a Bayesian---Stackelberg games. Here, the leader decides first on a patrolling strategy and then an adversary, of possibly many adversary types, selects its best response for the given patrol. We provide two efficient MIP formulations named DOBSS and ASAP to solve this NP-hard problem. Our experimental results show the efficiency of these algorithms and illustrate how these techniques provide optimal and secure patrolling policies. We note that these models have been applied in practice, with DOBSS being at the heart of the ARMOR system that is currently deployed at the Los Angeles International airport (LAX) for randomizing checkpoints on the roadways entering the airport and canine patrol routes within the airport terminals.
Vision and the atmosphere
Authors: Srinivasa G. Narasimhan, Shree K. Nayar
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer vision systems must include mechanisms that enable them to function (even if somewhat less reliably) in the presence of haze, fog, rain, hail and snow. We begin by studying the visual manifestations of different weather conditions. For this, we draw on what is already known about atmospheric optics, and identify effects caused by bad weather that can be turned to our advantage. Since the atmosphere modulates the information carried from a scene point to the observer, it can be viewed as a mechanism of visual information coding. We exploit two fundamental scattering models and develop methods for recovering pertinent scene properties, such as three-dimensional structure, from one or two images taken under poor weather conditions. Next, we model the chromatic effects of the atmospheric scattering and verify it for fog and haze. Based on this chromatic model we derive several geometric constraints on scene color changes caused by varying atmospheric conditions. Finally, using these constraints we develop algorithms for computing fog or haze color, depth segmentation, extracting three-dimensional structure, and recovering "clear day" scene colors, from two or more images taken under different but unknown weather conditions.
Three-dimensional integration technology and integrated systems
Authors: Mitsumasa Koyanagi, Takafumi Fukushima, Tetsu Tanaka
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A three-dimensional (3-D) integration technology based on the wafer-to-wafer bonding using through silicon vias (TSV's) has been developed for the fabrication of new 3-D LSIs. A 3-D image sensor chip, 3-D shared memory chip, 3-D artificial retina chip and 3-D microprocessor test chip have been fabricated by using this technology. In addition, we have proposed a new reconfigurable parallel image processing system. To achieve this system, we have proposed a new 3-D integration technology based on multichip-to-wafer bonding called a super-chip integration. Many chips are simultaneously aligned and bonded onto lower chips using a self-assembly technique in a super-chip integration.
Drawing Rooted Phylogenetic Networks
Authors: Daniel H. Huson
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.