ppxscal/embedding_network huggingface dataset:
Covers
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The following topics are dealt with: EDA; DFM; system-on chip design; circuit simulation; optimization tool; RF CMOS IC; placement algorithm; integrated circuit interconnection; analogue circuit CAD; nanometer technologies; video decoder; low-power design and logic design.
Parseweb: a programmer assistant for reusing open source code on the web
Authors: Suresh Thummalapenta, Tao Xie
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Programmers commonly reuse existing frameworks or libraries to reduce software development efforts. One common problem in reusing the existing frameworks or libraries is that the programmers know what type of object that they need, but do not know how to get that object with a specific method sequence. To help programmers to address this issue, we have developed an approach that takes queries of the form "Source object type → Destination object type" as input, and suggests relevant method-invocation sequences that can serve as solutions that yield the destination object from the source object given in the query. Our approach interacts with a code search engine (CSE) to gather relevant code samples and performs static analysis over the gathered samples to extract required sequences. As code samples are collected on demand through CSE, our approach is not limited to queries of any specific set of frameworks or libraries. We have implemented our approach with a tool called PARSEWeb, and conducted four different evaluations to show that our approach is effective in addressing programmer's queries. We also show that PARSEWeb performs better than existing related tools: Prospector and Strathcona
Recovery from DoS Attacks in MIPv6: Modeling and Validation
Authors: Manish C. Kumar, K Gopinath
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Denial-of-Service (DoS) attacks form a very important category of security threats that are prevalent in MIPv6 (Mobile Internet Protocol version 6) today. Many schemes have been proposed to alleviate such threats, including one of our own [9]. However, reasoning about the correctness of such protocols is not trivial. In addition, new solutions to mitigate attacks may need to be deployed in the network on a frequent basis as and when attacks are detected, as it is practically impossible to anticipate all attacks and provide solutions in advance. This makes it necessary to validate the solutions in a timely manner before deployment in the real network. However, threshold schemes needed in group protocols make analysis complex. Model checking threshold-based group protocols that employ cryptography have not been successful so far. Here, we propose a new simulation based approach for validation using a tool called FRAMOGR that supports executable specification of group protocols that use cryptography. FRAMOGR allows one to specify attackers and track probability distributions of values or paths. We believe that infrastructure such as FRAMOGR would be required in future for validating new group based threshold protocols that may be needed for making MIPv6 more robust.
Hardware-rooted trust for secure key management and transient trust
Authors: Jeffrey S. Dwoskin, Ruby B. Lee
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We propose minimalist new hardware additions to a microprocessor chip that protect cryptographic keys in portable computing devices which are used in the field but owned by a central authority. Our authority-mode architecture has trust rooted in two critical secrets: a Device Root Key and a Storage Root Hash, initialized in the device by the trusted authority. Our architecture protects trusted software, bound to the device, which can use the root secrets to protect other sensitive information for many different usage scenarios. We describe a detailed usage scenario for crisis response, where first responders are given transient access to third-party sensitive information which can be securely accessed during a crisis and reliably revoked after the crisis is over. We leverage the Concealed Execution Mode of our earlier user-mode SP (Secret-Protecting) architecture to protect trusted code and its execution [1]. We call our new architecture authority-mode SP since it shares the same architectural lineage and the goal of minimalist hardware roots of trust. However, we completely change the key management hardware and software to enable new remote trust mechanisms that user-mode SP cannot support. In our new architecture, trust is built on top of the shared root key which binds together the secrets, policy and trusted software on the device. As a result, the authority-mode SP architecture can be used to provide significant new functionality including transient access to secrets with reliable revocation mechanisms, controlled transitive support for policy-controlled secrets belonging to different organizations, and remote attestation and secure communications with the authority.
Worst-Case Delay Control in Multigroup Overlay Networks
Authors: Wanqing Tu, Cormac J. Sreenan, Weijia Ji
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in a multi-group network with real-time flows constrained by (σ, ρ) regulators. The control algorithm is implemented at the overlay networks, and provides more regulations through a novel (σ, ρ, λ) regulator at each group end host who suffers from heavy input traffic. To our knowledge, it is the first work to incorporate traffic regulators into the end host multicast to control heavy traffic output. Our further contributions include theoretical analysis and a set of results. We prove the existence and calculate the value of the rate threshold ρ* such that for a given set of K groups, when the average rate of traffic entering the group end hosts ρ‾ > ρ*, the ratio of the worst-case multicast delay bound of the proposed (σ, ρ, λ) regulator over the traditional (σ, ρ) regulator is Ο(1/K^n) for any integer n. We also prove the efficiency of the novel algorithm and regulator in decreasing worst-case delays by conducting computer simulations.
Automatic Ground-truth Generation for Document Image Analysis and Understanding
Authors: P. Heroux, E. Barbu, S. Adam, E. Trupin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Performance evaluation for document image analysis and understanding is a recurring problem. Many ground- truthed document image databases are now used to evalu- ate algorithms, but these databases are less useful for the design of a complete system in a precise context. This pa- per proposes an approach for the automatic generation of synthesised document images and associated ground-truth information based on a derivation of publishing tools. An implementation of this approach illustrates the richness of the produced information.
A Data-Storage Format for Information System Files
Authors: F. D. Anzelmo
Venue: IEEE Transactions on Computers (1971)

In developing its chemical information system, Chemical Abstracts Service (CAS) has built files which require hundreds of millions of bytes of storage and in which data elements may range in length from zero in one instance to several hundred bytes in another. To cope with this size and variability, CAS has developed an internal standardized storage format and has implemented it on the IBM System/360. This format, which is called Standard File Format (SFF), accommodates a mix of fixed-and variable-length data elements and permits the addition and deletion of data elements without affecting the program code. Symbolic addressing of data elements is achieved through the use of a directory within each record in the file. Implementation of standardized files has permitted the CAS system to operate with greater generality and flexibility.
Information Replication Strategy in Unstructured Peer-to-Peer Networks Using Thematic Agents
Authors: N. Bonnel, G. Menier, Pierre-Francois Marteau
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

We present in this article a method to wisely replicate information in an unstructured peer-to-peer network. We make no assumption on the network topology. Thematic agents move randomly on the network and estimate the level of redundancy of the specific information they are dealing with. They can delete or create replicas if this estimated redundancy is too high or too low. Experiments show that we can achieve an homogeneous distribution of information in a distributed environment while achieving a high level of fault tolerance.
A Genetic Algorithm for Reverse Logistics Network Design
Authors: Qi Tang, Fang Xie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

With the increased environmental concerns and stringent environmental laws, reverse logistics has received growing attention throughout this decade. Moreover, an enterprise can save a substantial amount of transportation, inventory, and warehousing costs associated with product returns by optimal handling the product returns. We proposed a reverse logistics model based on supply chain in this paper. The model consists of customers, collection centers, repair centers, and plants. The objective of the model is to minimize the operation costs. A genetic algorithm-based heuristic with associated numerical results is presented in order to obtain good solutions. An experimental is done and result shows that the proposed approach has better synthetic performance in both the computation speed and optimality in reverse logistics network design.
Component Value Calculations and Characterizations for Measurements in the IEEE 1149.4 Environment
Authors: Teuvo Saikkonen, Markku Moilanen
Venue: Journal of Electronic Testing: Theory and Applications (2007)

This paper describes a measurement principle for calculating component values from measurements conducted under less than optimal conditions, as is the case in the IEEE Std 1149.4 environment. Also presented are equations that take into account switch resistances on the signal paths, the output resistance of the signal generator, and the loading effect caused by the input impedance of the voltmeter together with the pin capacitances in parallel to the voltmeter. In addition, the paper presents characterization methods to determine values for these impedances. The inaccuracies achieved in the impedance range from k¿ to M¿ are of the order of few percent.
Photon differentials
Authors: Lars Schjøth, Jeppe Revall Frisvad, Kenny Erleben, Jon Sporring
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

A number of popular global illumination algorithms uses density estimation to approximate indirect illumination. The density estimate is performed on finite points -- particles -- generated by a stochastic sampling of the scene. In the course of the sampling, particles, representing light, are stochastically emitted from the light sources and reflected around the scene. The sampling induces noise, which in turn is handled by the density estimate during the illumination reconstruction. Unfortunately, this noise reduction imposes a systematic error (bias), which is seen as a blurring of prominent illumination features. This is often not desirable as these may lose clarity or vanish altogether. We present an accurate method for reconstruction of indirect illumination with photon mapping. Instead of reconstructing illumination using classic density estimation on finite points, we use the correlation of light footprints, created by using Ray Differentials during the light pass. This procedure gives a high illumination accuracy, improving the trade-off between bias and variance considerable as compared to traditional particle tracing algorithms. In this way we preserve structures in indirect illumination.
SciPort: an adaptable scientific data integration platform for collaborative scientific research
Authors: Fusheng Wang, Pierre-Emmanuel Bourgué, Georg Hackenberg, Mo Wang, David Kaltschmidt, Peiya Liu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Scientific data are posing new challenges to data management due to the large volume, complexity and heterogeneity of the data. Meanwhile, scientific collaboration becomes increasingly important, which relies on integrating and sharing data from distributed institutions. In this demo, we present SciPort, a Web-based platform on supporting scientific data management and integration based on peer-to-peer architectures, where researchers can easily collect, publish, and share their complex scientific data across multi-institutions. SciPort provides a general metadata based data model to capture the context description of experiments and link experiment data into comprehensive metadata documents, and supports a hierarchical organization of the overall data space for data browsing. SciPort takes two alternative "peer"-to-"peer" (or peer-database-to-peer-database) based approaches to integrate scientific data: pure peer-to-peer architecture and central server based peer-to-peer architecture. The later provides a virtual view of all published data from multiple local sites and supports complex queries with XQuery. The system provides a unified framework for adaptable architectures and customizable schemas, and supplies comprehensive tool set to manage and share scientific data. SciPort was first prototyped in Siemens Corporate Research, and now becomes a mature product and has been successfully used in both biomedical research and clinical trials for scientific research communities.
State of the art review of the existing PageRankTM based algorithms for trust computation
Authors: Farookh Khadeer Hussain, Elizabeth Chang, Omar Khadeer Hussain
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In this paper we present a state of the art review of PageRankTM based approaches for trust and reputation computation. We divide the approaches that make use of PageRankTM method for trust and reputation computation, into six different classes. Each of the six classes is discussed in this paper.
Design Automation
Authors: R. L. Russo
Venue: Computer (1972)

It is also an area of considerable controversy. To management it represents an overhead in terms of software development and computer execution costs, an overhead whose return is sometimes obscured. To the engineer it represents a change in his way of doing things and, particularly in the synthesis area of wire-routing, has not produced results as good as manual solutions in many cases.
Operational Requirements Accommodation in Distributed System Design
Authors: S. W. Smoliar
Venue: IEEE Transactions on Software Engineering (1981)

Operational requirements are qualities which influence a software system's entire development cycle. The investigation reported here concentrated on three of the most important operational requirements: reliability via fault tolerance, growth, and availability. Accommodation of these requirements is based on an approach to functional decomposition involving representation in terms of potentiafly independent processors, called virtual machines. Functional requirements may be accommodated through hierarchical decomposition of virtual machines, while performance requirements may be associated with individual virtual machines. Virtual machines may then be mapped to a representation of a confilguration of physical resources, so that performance requirements may be reconciled with available performance characteristics.
Concurrency and the Principle of Data Locality
Authors: Hagit Attiya
Venue: IEEE Distributed Systems Online (2007)

Interference among operations can affect the throughput of concurrent applications. The author explains the difficulties of alleviating this interference, suggests ways to measure it, and outlines future research directions.
Analysis on Transmission Performance for Multiview Video Coding Schemes
Authors: You Yang, Gangyi Jiang, Mei Yu, Randi Fu, Yo-Sung Ho
Venue: ICIG (2007)

The performance of multiview video coding (MVC) scheme is the most important aspect to be considered in future implementations. Many works have been done on the discussions between encoding efficiency and prediction structures. However, the structure of MVC can greatly affect interaction between user and video server, which is important to evaluate MVC scheme besides PSNR. View dependency (VD) is defined based on graph theory to analyze transmission efficiency of MVC scheme. Three definitions and parameters are used to evaluate the performance on interaction and transmission of MVC structures. Experimental results show that VD can be used as a predictor to estimate corresponding transmission band-width for MVC scheme after video sequences are encoded it.
A Lightweight Value-based Software Architecture Evaluation
Authors: Chang-Ki Kim, Dan-Hyung Lee, In-Young Ko, Jongmoon Baik
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Current software engineering practice is focused on value-neutral processes. Value-based architecting, one of value-based software engineering agendas, involves the further consideration of the system objectives associated with different stakeholder values in selecting an optimal architectural alternative. There are several value-based architectural evaluation techniques and Cost Benefit Analysis Method (CBAM) is a widely used, established technique based on Return on Investment (ROI). The weaknesses of the existing techniques are uncertainties from several subjective errors and the heavyweight process, which requires many steps and participation of stakeholders. This paper proposes a lightweight value-based architecture evaluation technique, called LiVASAE, using Analytic Hierarchy Process (AHP), which can support a multi-criteria decisionmaking process. The proposed technique can help overcome the major weakness of the existing techniques such as the uncertainties caused by subjective decision making and heavy-weight process for architecture evaluations. Li- VASAE provides a way to measure the uncertainty level using AHP's Consistency Rate (CR) and It also provides three simplified evaluation steps. In addition, the LiVASAE presents a framework for decision makers to make technical decisions associated with business goals (or values) such as cost, time-to-market, and integration with legacy system.
Building self-adapting services using service-specific knowledge
Authors: An-Cheng Huang, P. Steenkiste
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

With the advances in middleware and Web services technologies, network sendees are evolving from simple client-sender applications to self-configuring services that can compose primitive components distributed in the Internet into a value-added service configuration that provides rich functionalities to users. A resulting research problem is how to continuously adapt such composite service configurations at run time in order to cope with the increasingly dynamic and heterogeneous network environments and computing platforms. In this paper, we propose a self-adaptation architecture that allows service developers to specify their service-specific adaptation knowledge as "externalized" adaptation strategies. These adaptation strategies are used by a general, shared adaptation framework to perform run-time adaptation operations that automatically incorporate service-specific knowledge. In addition to the strategies, we also identify another aspect of adaptation knowledge that is not addressed by previous solutions: adaptation coordination. Our framework provides integrated support for the specification and execution of both aspects of developers' adaptation knowledge.
PROD: A VLSI Fault Diagnosis System
Authors: Peter Odryna, Andrzej Strojwas
Venue: IEEE Design Test (1985)

Faults in the manufacturing of VLSI chips lower the effective yield, thus increasing manufacturing cost. Early diagnosis offaults can avoid this sitution. Such diagnoses can be made by PROD, a diagnostic expert system that analyzes the joint probabilitydensity function of measured IC parameters density fuction of measured IC parameters to determine the source of faults resultingin faults chips. PROD can identify both parametric and catastrophic faults, and the expert system can be expanded to diagnosefaults that cannot be described quantitatively. This article describes PROD's diagnostic algorithms and their implementationin the complete diagnostic system, and includes several exmples that illustrate its capabilities.
Proceedings of the 2007 ACM symposium on Virtual reality software and technology
Authors: Aditi Majumder, Larry Hodges, Daniel Cohen-Or
Venue: Virtual Reality Software and Technology (2007)

ACM Symposium on Virtual Reality Software and Technology (VRST) is an eminent forum for dissemination of the latest research results in virtual reality. The goal of this symposium is to provide an opportunity for researchers in virtual reality and applications to interact with one another, share new results, and discuss emerging directions for the field. On behalf of the program committee and the conference organizing committee, we are pleased to present the program for VRST 2007. This year's program consists of three keynote presentations, thirty-five papers, three panel discussions, and eighteen poster presentations. The Program Committee received over 110 submissions this year. The acceptance rates for full and short papers were about 21% and 32% respectively. These proceedings contain the refereed papers and a collection of abstracts from the keynote speeches, invited panels, and contributed posters presented at ACM VRST 2007. Each full paper was reviewed by at least four members of the program committee and external reviewers, while each short paper was refereed by a minimum of three reviewers. The selected papers cover a variety of topics ranging from tracking technology, rendering algorithms, 3D and multimodal interface design, modeling avatars and crowds, VR software system and architectures, user studies and human factor analysis, simulation of human motions, to computer graphics techniques. The panels feature forward-looking discussions on new trends and current applications of VR technology in various domains. And the posters and live demos provide opportunities to highlight the emergent research and promising ideas.
Preparing for Future Needs
Authors: N. Prywes
Venue: Computer (1975)

Developments now pending will alter the character of SP, as we presently know it, beyond recognition. SP is essentially a discipline for a programming shop that turns out programs in response to assignments. It enables better planning and control of software development work and improves productivity of the programmers. New technology will alter the roles of the chief programmer and the members of his team.