ppxscal/embedding_network huggingface dataset:
Computing functional properties and network flexibilities for logic synthesis and verification
Authors: Malgorzata Chrzanowska-Jeske
Venue:  (2006)

Logic synthesis is a process of converting a given Register Transfer Level (RTL) description into an optimized gate-level netlist implemented using cells in a target technology library while meeting the area, speed and testability requirements. Logic verification ensures the correctness of the original design and that the transformations occurred during logic synthesis do not alter the design behavior. Properties of Boolean functions have long been exploited both in logic synthesis and verification to simplify the design representations, improve the quality of results, and reduce the runtime of these applications. The research in this area often have two orthogonal directions: (1) To discover new functional properties and demonstrate their applications in logic synthesis and verification; (2) To improve the computational efficiency of existing properties so that computational demands can keep pace with the ever increasing design sizes. Part I of this thesis includes research conducted in both directions: (1) A functional property called Linear cofactor relationship (LCR) is formalized and its usefulness is demonstrated through several applications. A recursive BDD-based procedure is proposed to compute LCRs efficiently. (2) Improved computations of several other properties often used in logic synthesis and verification are presented. The properties include classical symmetries, autosymmetry and unateness. The proposed algorithms advance the state-of-the-art of these computations, and therefore, making these functional properties more applicable in logic synthesis and verification applications. Flexibilities in a Boolean network are often exploited during logic synthesis and resynthesis to make local structural changes to the netlist, while maintaining the global functionality of the circuit. Several formalisms have been proposed to express the flexibilities of Boolean networks, most of which require extensive computing. In part II of the thesis, efficient algorithms to compute two forms of flexibilities, i.e. Sets of Pairs of Functions to Be Distinguished (SPFD) and node resubstitution, are proposed. The improvement in their computations will make them applicable in real design optimization.
Erbium photoluminescence in opal matrix and porous anodic alumina nanocomposites
Authors: M. Yu. Tsvetkov, S. M. Kleshcheva, M. I. Samoilovich, N. V. Gaponenko, A. N. Shushunov
Venue: Microelectronic Engineering (2005)

''Self-organizing'' design methods of nanocomposites based on cubic packing SiO"2 nanospheres (opal matrices) and porous anodic alumina (PAA) are considered. The photoluminescence of nanocomposites doped with erbium and other rare earth elements is studied versus the element structure, concentration of rare earth ions, matrix composition, optical properties, and technology. Possible application of 3D-(space) and 2D-(planar) nanocomposites in systems of optical information transfer, storage, and processing are discussed.
A study of the roles of trusts and risks in information-oriented online legal services using an integrated model
Authors: Vincent Cho
Venue: Information and Management (2006)

This study examined the effect of the four constructs - trust in online media, trust in online services, perceived risk with online media, and perceived risk with online services - on the use of information-oriented online legal services. Using past theories on adoption studies, a three-level framework was developed. This framework helped to formulate a new research model. A quantitative survey was conducted to identify the important factors affecting the intention of customers to adopt information-oriented online legal services in Hong Kong. Findings indicated that there is a hierarchical relationship among the four constructs. Perceived usefulness was the most important belief that drove people to adopt the online services. Perceived risk and trust were less important at present, probably because online legal services are still somewhat immature and mainly focus on less risky areas, such as information dissemination and marketing.
Estimation of transport times for chaotic dynamical control systems
Authors: S. M. Khryashchev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Sequences of sets of accessibility and their volumes are studied for dynamical control systems with chaotic behavior of trajectories. Controlled trajectories joining arbitrary initial and final points are constructed. By analysis of sequences of volumes, the transport times, i.e. the times to reach target points, are estimated for some classes of control systems.
Key Issues in the Optimization of Runtime Processes for Dynamic Provisioning of Ubiquitous Services
Authors: Sorin M. Iacob, Mortaza S. Bargh
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Given the complexity of the runtime processes implied by ubiquitous service provisioning, it is likely that some optimization techniques would be needed for service discovery, matchmaking, and resource allocation and management. In this work we provide an analysis of these runtime processes and highlight several limitations of the current approaches. Next, we outline some of the properties that an optimization solution for these processes should display, and propose a solution direction inspired from cognitive sciences, based on the mechanism of selective attention.
How factory physics helps simulation
Authors: Charles R. Standridge
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Factory physics provides a systematic description, expressed as laws, of the underlying behavior of a system. These laws can provide important assistance in performing simulation studies. They help in deciding what performance measures to collect and what alternatives to evaluate as well as in interpreting simulation results. The laws help identify the properties of systems that may be important to include in models. They provide an analytic foundation that helps in understanding the behavior of systems as well as giving insight into the types of issues addressed in simulation studies. Verification and validation evidence can be collected based on these laws. This paper examines the application of specific factory physics laws to the activities of a simulation project. Examples showing the application of these principles in industrial projects, masters level student projects, and application studies used in undergraduate and graduate simulation classes are given.
Die Stacking (3D) Microarchitecture
Authors: Bryan Black, Murali Annavaram, Ned Brekelbaum, John DeVale, Lei Jiang, Gabriel H. Loh, Don McCaule, Pat Morrow, Donald W. Nelson, Daniel Pantuso, Paul Reed, Jeff Rupley, Sadasivan Shankar, John Shen, Clair Webb
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

3D die stacking is an exciting new technology that increases transistor density by vertically integrating two or more die with a dense, high-speed interface. The result of 3D die stacking is a significant reduction of interconnect both within a die and across dies in a system. For instance, blocks within a microprocessor can be placed vertically on multiple die to reduce block to block wire distance, latency, and power. Disparate Si technologies can also be combined in a 3D die stack, such as DRAM stacked on a CPU, resulting in lower power higher BW and lower latency interfaces, without concern for technology integration into a single process flow. 3D has the potential to change processor design constraints by providing substantial power and performance benefits. Despite the promising advantages of 3D, there is significant concern for thermal impact. In this research, we study the performance advantages and thermal challenges of two forms of die stacking: Stacking a large DRAM or SRAM cache on a microprocessor and dividing a traditional microarchitecture between two die in a stack Results: It is shown that a 32MB 3D stacked DRAM cache can reduce the cycles per memory access of a twothreaded RMS benchmark on average by 13% and as much as 55% while increasing the peak temperature by a negligible 0.08ºC. Off-die BW and power are also reduced by 66% on average. It is also shown that a 3D floorplan of a high performance microprocessor can simultaneously reduce power 15% and increase performance 15% with a small 14ºC increase in peak temperature. Voltage scaling can reach neutral thermals with a simultaneous 34% power reduction and 8% performance improvement.
From the Magic Square to the Optimization of Networks of AGVs and from MIP to an Improved GRASP like Optimization Algorithm
Authors: Jose Barahona da Fonseca
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In a previous work we presented an algorithm inspired in the Strong Artificial Intelligence and in the minimax optimization that imitates the human being in the solution of the magic square and we showed that in most cases its performance was better than the human's performance and even better than the performance of the best algorithms to solve the magic square, in terms of number of changes. In this paper we adapt and transform this algorithm to solve the optimization of an AGVs network problem, using as a first test case 9 workstations in fixed positions and 9 operations to be executed, and the optimization problem is translated in the search of which of the 9! possible manners to distribute 9 operations by the 9 workstations that minimizes the total production time for a given plan of production. Finally we considered the more general case where the number of workstations is greater than the number of operations, and so there are some workstations that make the same operation, and we will have a layout with repetitions and multiple trajectories that implement the same product.
Mining Latent Associations of Objects Using a Typed Mixture Model--A Case Study on Expert/Expertise Mining
Authors: Shenghua Bao, Yunbo Cao, Bing Liu, Yong Yu, Hang Li
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

This paper studies the problem of discovering latent associations among objects in text documents. Specifically, given two sets of objects and various types of co-occurrence data concerning the objects existing in texts, we aim to discover the hidden or latent associative relationships between the two sets of objects. Existing methods are not directly applicable as they are unable to consider all this information. For example, the probabilistic mixture model called Separable Mixture Model (SMM) proposed by Hofmann can use only one type of co-occurrences to mine latent associations. This paper proposes a more general probabilistic mixture model called the Typed Separable Mixture Model (TSMM), which is able to use all types of co-occurrences within a single framework. Experimental results based on the expert/expertise mining task show that TSMM outperforms SMM significantly.
Guiding Service Composition in a Visual Service Creation Environment
Authors: Mathieu Braem, Niels Joncheere, Wim Vanderperren, Ragnhild Van Der Straeten, Viviane Jonckers
Venue: Proceedings of the European Conference on Web Services (2006)

Current web service composition languages like WSBPEL require in-depth knowledge of these languages by the service composition designers. In this paper we present a high-level, visual Service Creation Environment (SCE). This SCE provides service composition templates, verification of compatibility and guidelines, and advanced separation of concerns through Aspect-Oriented Software Development. Composition templates are abstract descriptions of reusable compositions containing several placeholders for services. Services are verified to be compatible with the composition template when a service is mapped onto a composition template's placeholder. Composition guidelines such as QoS constraints can be added to the SCE and verified. The modularization of crosscutting concerns is supported by the SCE through the general-purpose Padus Aspect-Oriented Programming language and the possibility to add concern-specific languages on top of Padus. The SCE generates the appropriate WS-BPEL processes given a complete and verified service composition.
BLOSOM: a framework for mining arbitrary boolean expressions
Authors: Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishnan
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We introduce a novel framework, called BLOSOM, for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. We focus on mining the simplest expressions the minimal generators for each class. We also propose a closure operator for each class that yields closed boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing a number of methodical pruning techniques. Experiments showcase the behavior of BLOSOM, and an application study on a real dataset is also given.
A Situation-aware Support Model and Its Implementation
Authors: Zixue Cheng, Tongjun Huang
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Ubiquitous Computing becomes a popular research field, with the progress of sensor networks, automatic identification techniques etc. One of the hottest topics in ubiquitous computing is context-aware service, provided based on users' context, e.g. location and interests. Though many researches have been done in users' context-aware based services, it still a hard challenge to identify the situation of users in a systemic and precise manner to provide personalized services adapted to the users' situations. In this paper, we propose a situation-aware model to specify the situations of the users, define actions on the situations, so that when the situations really happen, defined actions will be triggered to provide services to the users. In order to realized the proposed model, we implement a ubiquitous platform called ubiquitous tiles system, by which users' identifications and location can be acquired with corresponding relation between a user and his/her location, to detect the situations.
Probabilistic quorums for dynamic systems
Authors: Ittai Abraham, Dahlia Malkhi
Venue: Distributed Computing (2005)

A quorum system is a set of sets such that every two sets in the quorum system intersect. Quorum systems are well known building blocks for maintaining information in a distributed system while providing high availability and good load balance. Probabilistic Quorum Systems (PQS) are variants of quorum systems that relax the strict intersection requirement. They are particularly attractive for large scale systems due to their simplicity and highly efficient availability--load balance tradeoff. We introduce scalable techniques that maintain a PQS in a highly decentralized and highly dynamic setting. We address two challenges. First we show how PQS can be realized efficiently even when each process maintains knowledge of only a constant number of other members. Second, we provide algorithms that adaptively evolve the quorums to adjust to the changes in the system caused by processes leaving and joining the system over time.
An approach toward profit-driven optimization
Authors: Min Zhao, Bruce R. Childers, Mary Lou Soffa
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2006)

Although optimizations have been applied for a number of years to improve the performance of software, problems with respect to the application of optimizations have not been adequately addressed. For example, in certain circumstances, optimizations may degrade performance. However, there is no efficient way to know when a degradation will occur. In this research, we investigate the profitability of optimizations, which is useful for determining the benefit of applying optimizations. We develop a framework that enables us to predict profitability using analytic models. The profitability of an optimization depends on code context, the particular optimization, and machine resources. Thus, our framework has analytic models for each of these components. As part of the framework, there is also a profitability engine that uses models to predict the profit. In this paper, we target scalar optimizations and, in particular, describe the models for partial redundancy elimination (PRE), loop invariant code motion (LICM), and value numbering (VN). We implemented the framework for predicting the profitability of these optimizations. Based on the predictions, we can selectively apply profitable optimizations. We compared the profit-driven approach with an approach that uses a heuristic in deciding when optimizations should be applied. Our experiments demonstrate that the profitability of scalar optimizations can be accurately predicted by using models. That is, without actually applying a scalar optimization, we can determine if an optimization is beneficial and should be applied.
Fine Grained Resource Reservation in Open Grid Economies
Authors: Kris Bubendorfer
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The CORA (Coallocative, Oversubscribing Resource Allocation) architecture is a market based resource reservation system that utilises a trustworthy Vickrey auction to make combinatorial allocations of resources. This paper provides an overview of several significant components of the CORA architecture. Firstly, CORA utilises a novel combination of techniques to improve utilisation, including oversubscription, coallocation, just-in-time reallocation and a flexible contract structure. Secondly, this paper utilises a new auction architecture that does not require the auctioneers to be trusted. The advantage is that any entity (untrusted or otherwise) can conduct a privacy preserving Vickrey auction, removing the need for a trusted and privileged auction service within the system. CORA demonstrates how a practical, efficient and trustworthy auction scheme can be implemented in a Grid Economy.
Delay Constrained Fuzzy Rate Control for Video Streaming over DVB-H
Authors: Mehdi Rezaei, Moncef Gabbouj, Imed Bouazizi
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A novel fuzzy video rate control algorithm (RCA) with delay and quality constraints is proposed for video streaming over DVB-H (Digital Video Broadcasting for Handheld terminals) application. In this application a variable bit rate (VBR) bit stream is used to improve the quality and compression performance of encoded video at the expense of buffering delay while there is a holdup as channel changing delay. DVB-H uses a time-sliced transmission scheme to reduce the power consumption for the receiver. The time-slice scheme amplifies the channel changing delay. Two main factors in channel changing delay are the time until a media decoder is refreshed by a random access point such as an IDR (Instantaneous Decoder Refresh) picture in H.264/AVC and the delay to compensate the variation in bit rate. The average decoder refresh delay can decrease by frequent IDR pictures in the bit stream while it drops the quality and compression efficiency remarkably. On the other hand, a VBR video provides higher quality at the expense of higher buffering delay. Hence force, there is a multilateral contradiction between the quality and delay in this application. The proposed RCA has been optimized to provide high quality VBR video with minimum channel changing delay. Simulation results on H.264/AVC video coding standard show that encoded bit streams by proposed RCA strictly obey the delay and quality constraints.
Learning regularities with a constructivist agent
Authors: Filipo Studzinski Perotto, Luís Otávio Álvares
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents an agent learning architecture based on the constructivist approach. After a brief introduction, we show details about the proposed model. Firstly, we explain how the agent represents the knowledge. We introduce an innovative learning method, inspired by the constructivist description of the human learning process. The kind of environment regularities that can be discovered by the method is analyzed. Finally, we discuss how an extension of this agent architecture can lead to the construction of abstract concepts.
Autonomous Agent as Helper - Helpful or Annoying?
Authors: Paul Rudman, Mary Zajicek
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper describes an investigation into the feasibility of agent-provided assistance for two specific situations, (1) when a previously-interrupted task is resumed, offer to open previously-used contextual documents and (2) when a non-optimal task is begun, suggest a more suitable alternative task. A paper-based task places participants in the situations described. The concern is to maximise the balance between helpfulness and annoyance. The results are discussed in terms of timing of interruption and social effects. Overall, the agent needs to take account of the human's likely feelings towards any intervention; interventions must be both useful and perceived to be useful.
Manufacturing opaque predicates in distributed systems for code obfuscation
Authors: Anirban Majumdar, Clark Thomborson
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfuscation is to make the logic embedded in code incomprehensible to automated program analysis tools used by adversaries. Opaque predicates act as tool for obfuscating control flow logic embedded within code. In this position paper, we address the problem of control-flow code obfuscation of processes executing in distributed computing environments by proposing a novel method of combining the open problems of distributed global state detection with a well-known hard combinatorial problem to manufacture opaque predicates. We name this class of new opaque predicates as distributed opaque predicates. We demonstrate our approach with an illustration and provide an extensive security analysis of code obfuscated with distributed opaque predicates. We show that our class of opaque predicates is capable of withstanding most known forms of automated static analysis attacks and a restricted class of dynamic analysis attack that could be mounted by adversaries.
Adapting EPIC Architecture's Register Stack for Virtual Stack Machines
Authors: Jamel Tayeb, Smail Niar
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The register stack (RS) is a major component of the Explicit Parallel Instruction Computer (EPIC) architecture. In this paper, our objective is to close the theoretical performance gap between EPIC and stack processors running virtual stack machines - using Forth, a simple and canonical stack machine. For this purpose, we first introduce a new calling mechanism using the RS to implement a software-only virtual stack machine. Based upon our performance measurements, we show that the new calling mechanism is a promising technique to improve the performance of stack-based interpretative virtual machines. But limitation in EPIC makes the need for hardware support to reach optimal performance. As a second step, we define an addition to Itanium 2 processor's instruction set to accommodate the new calling mechanism. As our third and last step, we describe a conservative architectural implementation of the extended instruction set.