ppxscal/embedding_network huggingface dataset:
Improving the Performance of CAD Optimization Algorithms Using On-Line Meta-Level Control
Authors: Sandip Aine, P. P. Chakrabarti, Rajeev Kumar
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

We present a profile based meta-reasoning model for parameter control of CAD algorithms working under constrained run-time. We also propose a unified framework, that can take informed decision about the time allocation and parameter adaptation of the algorithm, where there is no hard run-time constraints, instead the quality-time trade-off is expressed by a utility function. We use the proposed strategy to get an adaptive cooling schedule for the simulated annealing algorithm. Application on two classical NP-hard problems in the VLSI domain, namely, the standard cell placement problem and the circuit partitioning problem shows that significant improvement of quality can be achieved using a profile based control.
Realistic Haptic Rendering of Interacting Deformable Objects in Virtual Environments
Authors: Christian Duriez, Frederic Dubois Abderrahmane Kheddar
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

A new computer haptics algorithm to be used in general interactive manipulations of deformable virtual objects is presented. In multimodal interactive simulations, haptic feedback computation often comes from contact forces. Subsequently, the fidelity of haptic rendering depends significantly on contact space modeling. Contact and friction laws between deformable models are often simplified in up to date methods. They do not allow a "realistic¿ rendering of the subtleties of contact space physical phenomena (such as slip and stick effects due to friction or mechanical coupling between contacts). In this paper, we use Signorini's contact law and Coulomb's friction law as a computer haptics basis. Real-time performance is made possible thanks to a linearization of the behavior in the contact space, formulated as the so-called Delassus operator, and iteratively solved by a Gauss-Seidel type algorithm. Dynamic deformation uses corotational global formulation to obtain the Delassus operator in which the mass and stiffness ratio are dissociated from the simulation time step. This last point is crucial to keep stable haptic feedback. This global approach has been packaged, implemented, and tested. Stable and realistic 6D haptic feedback is demonstrated through a clipping task experiment.
Projected Augmentation II — A Scalable Architecture for Multi Projector Based AR-Systems Based on 'Projected Applications'
Authors: Jochen Ehnes, Koichi Hirota, Michitaka Hirose
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Augmenting or annotating physical objects using steerable video projector and camera combinations works well in the range of the projection system. However, since these systems are usually mounted in fixed locations, users have to stay within a certain radius around that location. By using several of these AR-Projection systems, we can make the application roam these systems and thus follow the user beyond these limits. Using this method, we furthermore remove the need to hold the augmented objects in a suitable direction towards the projector and can reduce the possibility of shadowing the projection by the user. We describe an architecture based on our 'Projected Applications' which coordinates the systems used to project the augmentations and keeps the projected applications' states in sync between the projection systems.
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
Authors: Luis Alejandro Cortes, Petru Eles, Zebo Peng
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

We address in this paper the problem of scheduling for multi-processor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their relative importance and how the quality of results is affected when a soft deadline is missed. The problem is to find a task execution order that maximizes the total utility and guarantees the hard deadlines. In order to account for actual execution times, we consider time intervals for tasks rather than fixed execution times. A single static schedule computed off-line is pessimistic, while a purely on-line approach, which computes a new schedule every time a task completes, incurs an unacceptable overhead. We propose therefore a quasi-static solution where a number of schedules are computed at design-time, leaving for run-time only the selection of a particular schedule, based on the actual execution times. We propose an exact algorithm as well as heuristics that tackle the time and memory complexity of the problem. We evaluate our approach through synthetic examples and a realistic application.
SP-Frame Selection for Video Streaming over Burst-loss Networks
Authors: Wai-tian Tan, Gene Cheung
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

SP-frame is a new picture type supported by H.264. The traditional usage of SP-frames is for switching between different compressed bit-streams. In this paper, we proposed and evaluated a scheme that uses SP frames as a mechanism to switch within a single compressed stream for the purpose of achieving error resilience and rate scalability. We have only considered the restricted but practical case in which only one secondary SP frame is allowed for every primary SP frame. Nevertheless, simulation results show that the technique can significantly increase the chance of video frames meeting their deadlines, and also improve overall PSNR.
Online stochastic optimization under time constraints
Authors: Pascal Van Hentenryck
Venue:  (2005)

Recent advances in both computational power and communications technologies have created novel opportunities for research in combinatorial optimizations. Many applications in routing, scheduling, and networking raise exciting challenges, in particular in uncertainty. These applications are often online optimization problems, where the input is not known a priori, but characterized by a probabilistic model, and where decisions are made under severe time constraints. This thesis presents an online stochastic optimization framework whose goal is to maximize expected profit. It presents two algorithms, consensus and regret, designed to operate under severe time constraints. Theoretical results show that the framework and algorithms provide strong guarantees on solution quality under reasonable assumptions about the input distribution). Moreover, experimental results on a variety of applications in packet scheduling, vehicle dispatching, and vehicle routing indicate that the approach provides significant improvements in quality of service, even under severe time constraints. The framework is also shown to be robust even when the distribution itself is unknown. Finally, a large neighborhood search that hybridizes constraint programming and local search in novel ways is presented for its success in online vehicle routing problems.
Determining the Optimal Size of Handwriting Character Entry Boxes for Pen-Based Systems
Authors: Xiangshi Ren
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper presents two experiments to determine the optimal size of a box for the input of Chinese characters (called Kanji in Japanese) mixed with Japanese Kana (phonetic) handwriting characters on a tablet computer. The experiments involve an evaluation of boxes of different sizes. The results are assessed in terms of high performance factors (e.g., high character recognition rates, minimal stroke protrusions outside the character box) and subjective ratings (e.g., ease of writing and a minimum level of fatigue). The results show that the optimal size of character boxes for Kanji and Kana characters is around 1.44 x 1.44 cm. The experimental results also show that the optimal size is the same for both PDAs and Tablet PCs. The results provide important guidelines to designers who are concerned about the interplay between user comfort, input efficiency and output display efficiency. The knowledge obtained from our experiments on Tablet PCs will be added to the literature on optimal size for handwriting character entry boxes.
WETICE 2005 ECE Workshop - Final Report
Authors: David Nutter, Cornelia Boldyreff
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The primary goal of this workshop is to provide a forum, in which researchers and practitioners can share approaches to the evaluation of collaborative enterprises, lessons learned from deployment of collaborative systems in organisations or educational institutions, and ideas for directions the area of evaluation must move toward in order to facilitate the progress of distributed virtual collaboration. At the SixthWorkshop on Evaluation of Collaborative Information Systems and Support for Virtual Enterprises (ECE), papers were presented in two sessions with the following themes: "Evaluation in practice" for papers describing the results of finished evaluations and "Methodological Issues" for papers which dealt with work dedicated to improving the theoretical body of knowledge associated with evaluation. One paper presented crossed these themes describing ongoing evaluation driving evolution of an awareness system. From the work presented, it is clear that evaluation is being practised and that the theory of evaluation is being advanced resulting in more rigorous practice, though there is much still to be done.
uComplexity: Estimating Processor Design Effort
Authors: Cyrus Bazeghi, Francisco J. Mesa-Martinez, Jose Renau
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Microprocessor design complexity is growing rapidly. As a result, current development costs for top of the line processors are staggering, and are doubling every 4 years. As we design ever larger and more complex processors, it is becoming increasingly difficult to estimate how much time it will take to design and verify them. To compound this problem, processor design cost estimation still does not have a quantitative approach. Although designing a processor is very resource consuming, there is little work measuring, understanding, and estimating the effort required. To address this problem, this paper introduces µComplexity, a methodology to measure and estimate processor design effort. µComplexity consists of three main parts, namely a procedure to account for the contributions of the different components in the design, accurate statistical regression of experimental measures using a nonlinear mixed-effects model, and a productivity adjustment to account for the productivities of different teams. We use µComplexity to evaluate a series of design effort estimators on several processor designs. Our analysis shows that the number of lines of HDL code, the sum of the fan-ins of the logic cones in the design, and a linear combination of the two metrics are good design effort estimators. On the other hand, power, area, frequency, number of flip-flops, and number of standard cells are poor estimators of design effort. We also show that productivity adjustments are necessary to produce accurate estimations.
Spatio-temporal quality assessment for home videos
Authors: Tao Mei, Cai-Zhi Zhu, He-Qin Zhou, Xian-Sheng Hua
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Compared with the video programs taken by professionals, home videos are always with low-quality content resulted from lack of professional capture skills. In this paper, we present a novel spatio-temporal quality assessment scheme in terms of low-level content features for home videos. In contrast to existing frame-level-based quality assessment approaches, a type of temporal segment of video, sub-shot, is selected as the basic unit for quality assessment. A set of spatio-temporal artifacts, regarded as the key factors affecting the overall perceived quality (i.e. unstableness, jerkiness, infidelity, blurring, brightness and orientation), are mined from each sub-shot based on the particular characteristics of home videos. The relationship between the overall quality metric and these factors are exploited by three different methods, including user study, factor fusion, and a learning-based scheme. To validate the proposed scheme, we present a scalable quality-based home video summarization system, aiming at achieving the best quality while simultaneously preserving the most informative content. A comparison user study between this system and the attention model based video skimming approach demonstrated the effectiveness of the proposed quality assessment scheme.
Ianus: An Adaptive FPGA Computer
Authors: Francesco Belletti, Filippo Mantovani, Giorgio Poli, Sebastiano Fabio Schifano, R. Tripiccione, Isabel Campos, Andres Cruz Flor, Denis Navarro, Sergio Perez Gaviro, Daniele Sciretti, Alfonso Tarancon, Jose Luis Velasco, Pedro Tellez, Luis Antonio Fernandez, Victor Martin-Mayor, Antonio Munoz Sudupe, Sergio Jimenez, Andrea Maiorano, Enzo Marinari, Juan Jesus Ruiz-Lorenzo
Venue: Computing in Science and Engineering (2006)

With Ianus, a next-generation field-programmable gate array (FPGA)-based machine, the authors hope to build a system that can fully exploit the performance potential of FPGA devices. A software platform that simplifies Ianus programming will extend its intended application range to a wide class of interesting and computationally demanding problems.
Distributed multimodal sensing: sensor suitability
Authors: Pradeep K. Khosla
Venue:  (2005)

This work presents an algorithm for determination of low-level actions for distributed mobile, heterogeneous multi-sensor systems. The algorithm is based on the definition of a common currency for control systems involving multiple sensors. This common denominator, called sensor suitability, allows the conversion of multiple attributes into a single real-valued number that measures the sensor's performance in relation to a sensing attribute. The concept of sensor suitability facilitates the incorporation of different kinds of sensors and sensing modalities into the system, since decisions are made entirely based on the concept of &ldquo;how suitable a sensor is for the task&rdquo;, independently of the kind of sensor. This results in a flexible and effective way of designing multi-sensor systems for multi-sensor applications such as surveillance, mapping, exploration, recognition, etc. Suitability functions are decision-theoretically sound functions that assign larger values to those conditions that represent the most advantageous sensing condition, thus evaluating the current sensor vantage point. This information is used to position sensors in the same way an expert (i.e., the decision maker) would do it. Multiple attributes are easily combined in an intuitive fashion that allows a human user to aggregate multiple behaviors into a single sensing requirement that otherwise might be too complex or counter-intuitive. Sensor suitability evaluates the sensor's ability to perform the task. However, this is an individual measure that does not convey a sense of how the overall team is doing. Using a special metric, the effect of potential sensor actions is evaluated in terms of their contribution towards the team's objectives, and then those actions that produce the highest collective performance are selected. The algorithm produces adequate performance in sensor teams, while operating under a regime that maintains computational efficiency. Using a one-step approach, the optimal solution is approximated at every step, instead of rigorously computed. The algorithm trades optimality for computational efficiency.
Enhancing the Behavior of the Ant Algorithms to Solving Network Planning Problem
Authors: Lamiaa Fattouh Ibrahim, Olaa Metwaly, Amira Kapel, Agsan Ahmed
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper introduces an enhancements to Ant Colony system, which is considered one of the most successful ant algorithms used to solve combinatorial optimization problems. Network Planning is the problem of how to plan the infrastructure network in the new city. This paper deals with optimization algorithms for network design problem. The objective is to design a distribution network at a minimum cost that satisfies the demand and constraints required by the subscribers. This approach uses the idea of an ant group to represent a solution and can assist the solution of large networks that cannot normally be solved to optimality. The algorithmic implementation of the proposed algorithm is described and computational experience is reported. Results demonstrate the effectiveness and flexibility of the modifying algorithm. Comparisons with related work are presented showing the advantages of the purposed algorithm introduced in this paper.
Use Cases based Requirements Validation with Scenarios
Authors: Stephane S. Some
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Use cases are analytical descriptions of how a system should react in interaction with actors. Use cases are appropriate as specification of a system required behavior. A scenario is an example of execution of a system that may be defined with the intention that it should be supported or the intention that it should be avoided. As such scenarios are appropriate for requirements validation. This paper presents an approach where use cases and scenarios are used to complement each other for requirements engineering. Use cases define what a system should do, and scenarios are used to validate use cases.
Domain Consistency in Requirements Specification
Authors: Satyajit Acharya, Chris George, Hrushikesha Mohanty
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Fixing requirements errors that are detected late in the software development life cycle can be extremely costly. So, finding problems in requirements specification early in the development cycle is critical and crucial. A formal specification can reduce errors by reducing ambiguity and imprecision and by making some instances of inconsistency and incompleteness obvious. In this paper, with an example of a moderately complex system of the mobile computing domain, we discuss how the consistency conditions found during initial abstract formal specification help in detecting logical errors during early stages of system development. We also discuss the importance of consistency conditions while modelling the domain of a complex system and show how the identified consistency conditions help in better understanding the specification and to gain confidence on the correctness of the specification. We use a combination of techniques, like specification inspection and testing the executable specification of a prototype using test cases, to validate the specification against the requirements as well as to ensure that the specified consistency conditions are respected and maintained by the operations defined in the specification.
Efficient Localized Localization Algorithm for Wireless Sensor Networks
Authors: Kezhong Liu, Shu Wang, Fan Zhang, Fuping Hu, Changchun Xu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The location of sensor nodes in wireless sensor networks plays an important role in most applications. In this paper, we address the localization problem by characterizing some sufficient conditions such that technical convenience for the collection of local information used for network localization can be enabled. The main contribution of this paper is as follows. Some latest research results on the graph rigidity theory are introduced and incorporated, and a feasible node localization scheme is presented. More specifically, a tree structure termed BN-tree is introduced to construct a localizable collaborative body. Especially, the localizable collaborative body can be constructed dynamically with the variety of the network topology. Simulation results, which show that the quality of localization is well bounded by the range of communication, are also provided to validate the proposed algorithm.
A random number generator
Authors: Bernard Werner
Venue: ACM SIGSIM Simulation Digest (1976)

In looking through the two FORTRAN routines which Bernard Werner submitted, I noted that he had embedded a Call statement for a routine, TADT. A copy of that routine in assembly language is included below. This is a macro often found in most IBM installations. If the system does not have the macro, then it can be added for use with the routines through normal program linkage. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Efficient Traitor Tracing Scheme Based On NTRU
Authors: LV Xixiang, YANG Bo, Changxing Pei
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

Since its introduction, broadcast encryption has attracted many useful applications. One major problem faced by such broadcast systems is "piracy." An effective approach to piracy prevention in such systems is traitor tracing. In this paper, a new traitor tracing scheme is proposed by using the efficient and computationally inexpensive public key cryptosystem NTRU. The proposed scheme is the first concrete construction of NTRU-based public-key traitor tracing and has the advantages of extremely efficient encryption and decryption, fast and easy key creation, low memory requirements and revocation property etc. Moreover, this novel work contains other desirable features, such as Collusion-resistant, which the previous traitor tracing schemes did not offer. In addition, with its complexity only O(log2n), the tracing algorithm of this system is more efficient than that of the previous ones.
On the Transformation of Manufacturing Test Sets into On-Line Test Sets for Microprocessors
Authors: E. Sanchez, M. Sonza Reorda, G. Squillero
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In software-based self-test (SBST) a microprocessor executes a set of test programs devised for detecting the highest possible percentage of faults. The main advantages of this approach are its high defect fault coverage (being performed at-speed) and the reduced cost (since it does not require any change in the processor hardware). SBST can also be used for on-line test of a microprocessor-based system. However, some additional constraints exist in this case (e.g. in terms of test length and duration, as well as intrusiveness). This paper faces the issue of automatically transforming a test set devised for manufacturing test in a test set suitable for on-line test. Experimental results are reported on an Intel 8051 microcontroller.