ppxscal/embedding_network huggingface dataset:
Computer Aids for IC Design
Authors: J. Kim
Venue: IEEE Software (1986)

Talib augments existing algorithmic techniques with domain-specific knowledge to automate NMOS IC cell layout. Its efficiency rating is within five percent of layouts generated manually.
A New Protocol for Securing Wireless Sensor Networks against Nodes Replication Attacks
Authors: Chakib Bekara, Maryline Laurent-Maknavicius
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

of self-organizing of sensors, yield the use of Wireless Sensor Networks (WSN) very popular to day. Unfortunately, the un- shielded nature of sensors, their deployment in remote open (hostile) areas, and the use of wireless transmission medium, make them subject to several kind of threats and attacks, like eavesdropping, intrusion, Deny of Services (DoS) attacks and nodes compromising. While most of threats and attacks can be prevented using cryptographic materials (i.e. shared pair- wise secret keys, certificates, etc.) provided by key management protocols, some other threats, like nodes replication attacks, can still go undetectable. Nodes replication attacks are harmful attacks, where an attacker compromising a node, uses its secret cryptographic key materials to successfully populate the network with several clones of it, in-order to gain the control over the network or disturb the normal operation of the network. Several nodes replication detection protocols were proposed in the liter- ature, but unfortunately, they require either a high computation, transmission and energy overheads, or that nodes know their exact locations coordinates, which limits their usability in most WSN scenarios. In this paper, we present a new protocol for securing and preventing against nodes replication attacks in static WSN, which requires no knowledge of nodes deployment locations, and introduces no significant overhead on the resource- constrained sensors. Index Terms--WSN security, Nodes replication attacks, Key management protocols, Pubic key cryptography
Discovering and ranking semantic associations over a Large RDF metabase
Authors: Chris Halaschek, Boanerges Aleman-Meza, I. Budak Arpinar, Amit P. Sheth
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Information retrieval over semantic metadata has recently received a great amount of interest in both industry and academia. In particular, discovering complex and meaningful relationships among this data is becoming an active research topic. Just as ranking of documents is a critical component of today's search engines, the ranking of relationships will be essential in tomorrow's semantic analytics engines. Building upon our recent work on specifying these semantic relationships, which we refer to as Semantic Associations, we demonstrate a system where these associations are discovered among a large semantic metabase represented in RDF. Additionally we employ ranking techniques to provide users with the most interesting and relevant results.
Attribute-based encryption with non-monotonic access structures
Authors: Rafail Ostrovsky, Amit Sahai, Brent Waters
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We construct an Attribute-Based Encryption (ABE) scheme that allows a user's private key to be expressed in terms of any access formula over attributes. Previous ABE schemes were limited to expressing only monotonic access structures. We provide a proof of security for our scheme based on the Decisional Bilinear Diffie-Hellman (BDH) assumption. Furthermore, the performance of our new scheme compares favorably with existing, less-expressive schemes.
Holistic twig joins on indexed XML documents
Authors: Haifeng Jiang, Wei Wang, Hongjun Lu, Jeffrey Xu Yu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Finding all the occurrences of a twig pattern specified by a selection predicate on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms were proposed recently as an optimal solution when the twig pattern only involves ancestor-descendant relationships. In this paper, we address the problem of efficient processing of holistic twig joins on all/partly indexed XML documents. In particular, we propose an algorithm that utilizes available indices on element sets. While it can be shown analytically that the proposed algorithm is as efficient as the existing state-of-the-art algorithms in terms of worst case I/O and CPU cost, experimental results on various datasets indicate that the proposed index-based algorithm performs significantly better than the existing ones, especially when binary structural joins in the twig pattern have varying join selectivities.
An Efficient Eigenvalue-based P2P XML Routing Framework
Authors: Qiang Wang, M. Tamer Ozsu
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Many emerging applications that use XML are distributed, usually over large peer-to-peer (P2P) networks on the Internet. The deployment of an XML query shipping system over P2P networks requires a specialized synopsis to capture XML data in routing tables. In this paper, we propose a novel eigenvalue-based routing synopsis for deployment over unstructured P2P networks. Based on well-established Cauchy's Interlacing Theorem, our approach employs multiple eigenvalues as routing synopsis and facilitates query routing process with computationally-inexpensive range inequality checking. Through extensive experiments, we demonstrate the effectiveness of our approach.
Parameter Reduction for Variability Analysis by Slice Inverse Regression (SIR) Method
Authors: Alexander Mitev, Michael Marefat, Dongsheng Ma, Janet Wang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

With semiconductor fabrication technologies scaled below 100 nm, the design-manufacturing interface becomes more and more complicated. The resultant process variability causes a number of issues in the new generation IC design. One of the biggest challenges is the enormous number of process variation related parameters. These parameters represent numerous local and global variations, and pose a heavy burden in today's chip verification and design. This paper proposes a new way of reducing the statistical variations (which include both process parameters and design variables) according to their impacts on the overall circuit performance. The new approach creates an effective reduction subspace (ERS) and provides a transformation matrix by using the mean and variance of the response surface. With the generated transformation matrix, the proposed method maps the original statistical variations to a smaller set of variables with which we process variability analysis. Thus, the computational cost due to the number of variations is greatly reduced. Experimental results show that by using new method we can achieve 20% to 50% parameter reduction with only less than 8% error on average.
A System Architecture for Pervasive Computing
Authors: Wenshuan Xu, Yunwei Xin, Guizhang Lu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

With the development of pervasive computing, the essentiality of universal system architecture for pervasive computing is recognized. At present, there are lots of researches on the related fields in system architecture for pervasive computing. In this paper, a novel system architecture for pervasive computing is presented. The architecture is based on component and middleware technology and contains series of services, such as service discovery, security control, communication management, etc. From the architecture presented, services in pervasive computing environments can be integrated seamlessly. The current state of research is evaluated and the future work agenda in our presented system architecture for pervasive computing is presented, too.
Integrated tool support for software product line engineering
Authors: Deepak Dhungana, Rick Rabiser, Paul Grünbacher, Thomas Neumayer
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Product line engineering comprises many heterogeneous activities such as capturing the variability of reusable assets, supporting the derivation of products from the product line, evolving the product line, or tailoring the approach to the specifics of a domain. The inherent complexity of product lines implicates that tool support is inevitable to facilitate smooth performance and to avoid costly errors. Product line engineering tools have to support heterogeneous stakeholders involved in diverse activities. Tool integration therefore is of particular importance to foster their seamless cooperation. However, the integration is difficult to achieve due to the diversity of models and work products. This paper describes the DOPLER tool suite which has been developed to provide such integrated support. The tool suite is flexible and extensible to support domain-specific needs
Probabilistic skylines on uncertain data
Authors: Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Uncertain data are inherent in some important applications. Although a considerable amount of research has been dedicated to modeling uncertain data and answering some types of queries on uncertain data, how to conduct advanced analysis on uncertain data remains an open problem at large. In this paper, we tackle the problem of skyline analysis on uncertain data. We propose a novel probabilistic skyline model where an uncertain object may take a probability to be in the skyline, and a p-skyline contains all the objects whose skyline probabilities are at least p. Computing probabilistic skylines on large uncertain data sets is challenging. We develop two efficient algorithms. The bottom-up algorithm computes the skyline probabilities of some selected instances of uncertain objects, and uses those instances to prune other instances and uncertain objects effectively. The top-down algorithm recursively partitions the instances of uncertain objects into subsets, and prunes subsets and objects aggressively. Our experimental results on both the real NBA player data set and the benchmark synthetic data sets show that probabilistic skylines are interesting and useful, and our two algorithms are efficient on large data sets, and complementary to each other in performance.
A Comparative Study of Some Two-Processor Organizations
Authors: S. K. Mehra
Venue: IEEE Transactions on Computers (1980)

In many applications, parallelism inherent in a computation can be exploited by using a parallel computer organization. Such organizations may suffer throughput degradation because of data dependencies. The case of no data dependencies is considered. In this case, the throughput realized is dependent on the actual manner in which the parallel computer system is organized. A comparative performance study of four models of two-processor organizations is presented. The performance evaluation is through queueing analysis or simulation, the aim being to compare their response times under different workloads. This study also indicates the possibility of switching between alternate organizations in a dynamically reconfigurable system.
Coherency-based fast voltage contingency ranking employing counterpropagation neural network
Authors: Manjaree Pandit, Laxmi Srivastava, Vijay Singh, Jaydev Sharma
Venue: Engineering Applications of Artificial Intelligence (2007)

Power system security is one of the major concerns in competitive electricity markets driven by trade demands and regulations. If the system is found to be insecure, timely corrective measures need to be taken to prevent system collapse. This paper presents an approach based on a counterpropagation neural network (CPNN) to identify and rank the contingencies expected to reduce or eliminate the steady-state loadability margin of the system, making it prone to voltage collapse. It has been shown that unlike other artificial neural networks (ANN) paradigms, which start with random weights, CPNN is very sensitive to initial weights. To reduce the dimension and training time, a novel feature selection method, based on the coherency existing between load buses with respect to voltage dynamics, is employed to select significant input features for the CPNN. Once trained, the CPNN is found to rank voltage contingencies accurately for previously unknown system conditions very fast. Due to its fast training, the proposed CPNN will be particularly useful for power system planning studies, as a number of combinations can be tried within a small time frame. The effectiveness of the proposed approach has been demonstrated on IEEE 30-bus test system and a 75-bus practical Indian system.
The great challenge of multimodal interfacestowards symbiosis of human and robots
Authors: Norihiro Hagita
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

This paper introduces the possibilities of symbiosis between human and communication robots fromthe viewpoint of multi-modal interfaces. Current communication abilities of robots, such as speech recognition, are insufficient for practical use and needs to be improved. A network robot system integrating ubiquitous networking and robot technologies, has been introduced in Japan, Korea and EU countries in order to improve the abilities. Recent field experiments on communication robots based on the system were made in a science museum, a train station and a shopping mall in Japan. Results suggests that network robot systems may be used more as the next-generation communication media. The improvement of communication ability causes problems on privacy policy, since the history of human robot interaction often includes personal information. For example,when a robot askes me, "Hi, Nori. I know you," and I have never met it before, how should I respond to it? Therefore, access control method based on multi-modal interfaces would be requiredand discussed. Android science will be introduced as an ultimate human interface. The research aimsto clarify the difference between "existence" for robot-like robots and "presence" for human-like robots. Once the appearance of robots becomes more similar to that of humans, how should I respond to it? The development of communication robots at our lab, including privacy policy and android science is outlined.
Motorola's MC68HC11: Definition and Design of a VLSI Microprocessor
Authors: James Sibigtroth
Venue: IEEE Micro (1984)

The MC68HC11 demonstrates Motorola's conviction that 8-bit devices still address a significant market; its design proves that 8-bit technology still offers ample technical challenge and opportunity for creativity.
Improved Algorithm and Simulation of the Provision Refrigerating Unit
Authors: HE Zhi-bin, ZHANG Jun-dong, SUN Yu-qing, ZENG Hong, GAN Hui-bing
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The dynamic model of reciprocating provision cooling plant is presented, and the algorithm of the model is amended, through the method of quoting an unknown variable, which is enthalpy of the refrigerant at the compressor outlet. Dynamic simulation of the refrigerating system is given. The experiment validates that the model is precise and the amended algorithm improve the speed and the precision, the model and the algorithm can be applied to develop the unit simulator and control the unit. The evaporator and the condenser are adopted the distributing parameter model in general, the compression process of compressor is described as polytropic process, the expansion process of expansion valve is considered isenthalpic, and the heat exchanger is calculated with method of logarithmic mean temperature difference.
Empirical Validation of Yield Recovery Using Idle-Cycle Insertion
Authors: Donghwi Lee, Erik Volkerink, Intaik Park, Jeff Rearick
Venue: IEEE Design Test (2007)

The act of applying a scan-based delay test to a chip can cause electrical disturbances in the power and clock distribution networks that affect the results of the test, either for better or for worse. Empirical data presented in this study suggest that altering the details of the delay test application protocol can have a significant effect on the test results, and thus the yield of the product being tested. Specifically, inserting wait states between scan shifting and the launch clock results in measurable yield improvement. Although the exact mechanisms involved remain elusive, the authors were able to eliminate several possibilities through a series of experiments. It is clear from these experiments that yield recovery is a real phenomenon, and that launch delay (LD) tests can help to recover from IR drop.
Special Feature New Chip Carrier Package Concepts
Authors: J. W. Balde
Venue: Computer (1977)

The chip carrier concept was originally conceived as a square ceramic semiconductor package that could be surface reflow soldered to a ceramic substrate. Its advantages of reduced package size, higher board packing density, lower lead inductance and internal propagation delay, and easy assembly and disassembly were, unfortunately, limited to largely military applications.
Scalable and Statistically Secure Fingerprinting Scheme for Mobile Game Content Distribution
Authors: Jae Min Seol, Seong-Whan Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Digital fingerprinting is a technique to prevent customers from redistributing multimedia contents illegally. Main attack for fingerprinting is the collusion attack, where multiple users collude by creating a mix (e.g. average or median) of their individual fingerprinted copies, and escape identification. Previous research such as ACC (anti-collusion code) cannot support large number of users, and also vulnerable to LCCA (linear combination collusion attack). We present a practical SACC (scalable ACC) scheme to generate codebooks for supporting large number of users; and angular decoding scheme to be robust on LCCA. We implemented the SACC codebook using a Gaussian distributed random variable for robustness, and experimented with commercial mobile game video sequences. Experimental results show that we can achieve good collusion detection performance over average and median attacks. For LCCA collusion attack on SACC, our angular decoding scheme identifies the correct colluder set under various WNR (watermark to noise ratio).
Implementing Ada Exceptions
Authors: T. P. Baker
Venue: IEEE Software (1986)

Can exceptions be implemented for Ada without imposing overhead on normal execution? Yes, as long as certain rules are followed.
Projective filtering of time warped ECG beats
Authors: M. Kotas
Venue: Computers in Biology and Medicine (2008)

The paper proposes a modification of the nonlinear state-space projections (NSSP) method. Our approach, when applied to ECG signal processing, considerably improves the method's performance. One of the crucial operations in NSSP is the search for neighborhoods of the state-space trajectory points. The modification proposed is based on imposing a few restrictions on the time location of the neighborhood points. Dynamic time warping, a technique which allows for nonlinear alignment of time series or sequences of vectors, is applied as a straightforward solution to the task of neighborhoods determination with the restrictions imposed. The influence of nonlinear alignment on the distributions of the determined neighborhoods is presented, and the resulting method of ECG enhancement is investigated.
Enabling QoS for Service-Oriented Workflow on GRID
Authors: L. Guo, A. S. McGough, A. Akram, D. Colling, J. Martyniak, M. Krznaric
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

intensive scientific applications, Grid[1] enables resource sharing and dynamic allocation of computational resources. It promotes access to distributed data, operational flexibility and collabora- tion, and allows service providers to be distributed both concep- tually and physically to meeting different requirements. Large- scale grids are normally composed of huge numbers of compo- nents from different sites, which increases the requirements of workflows and quality of service (QoS) upon these workflows as many of these components have real-time requirements. In this paper, we describe our web services based QoS-aware workflow management system(WfMS) from GridCC project[7] and show how this WfMS can aid to ensure workflows meet the pre-defined QoS requirements and optimise them accordingly. keywords: Grid, Quality of Service (QoS), Web Services, Service Oriented Architecture (SOA)
Software Productivity, Quality, and Cost-All Up
Authors: W. Myers
Venue: Computer (1977)

The IEEE Computer Society's newest major conference series-COMPSAC-was kicked off last month in Chicago, where more than 550 paid attendees gathered at the Sheraton O'Hare Hotel to participate in sessions on software technology and computer applications. The success of COMPSAC 77 (Computer Software and Applications Conference) was underscored by the approval of COMPSAC as an ongoing series by the society's Board of Governors, meeting during the final day of the three-day conference. Below and on the following pages: scenes from COMPSAC 77. 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
Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure
Authors: Ali Sajedi Badashian, Mohammad Reza Razzazi
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In this paper we present an effective kinetic data structure (KDS) and algorithm for efficient maintenance of convex hull of moving points in 2d space. Given n objects continuously moving in the plane we present an efficient algorithm for maintaining their convex hull. Our algorithm considers cases based on status of a constant number of points. We show that our algorithm's time and space complexity are at most linear. A simulation program dev
Covert channels in privacy-preserving identification systems
Authors: Daniel V. Bailey, Dan Boneh, Eu-Jin Goh, Ari Juels
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We examine covert channels in privacy-enhanced mobile identification devices where the devices uniquely identify themselves to an authorized verifier. Such devices (e.g. RFID tags) are increasingly commonplace in hospitals and many other environments. For privacy, the device outputs used for identification should "appear random" to any entity other than the verifier, and should not allow physical tracking of device bearers. Worryingly, there already exist privacy breaches for some devices [28] that allow adversaries to physically track users. Ideally, such devices should allow anyone to publicly determine that the device outputs are covert-channel free (CCF); we say that such devices are CCF-checkable. Our main result shows that there is a fundamental tension between identifier privacy and CCF-checkability; we show that the two properties cannot co-exist in a single system. We also develop a weaker privacy model where a continuous observer can correlate appearances of a given tag, but a sporadic observer cannot. We also construct a privacy-preserving tag identification scheme that is CCF-checkable and prove it secure under the weaker privacy model using a new complexity assumption. The main challenge addressed in our construction is the enforcement of public verifiability, which allows a user to verify covert-channel-freeness in her device without managing secret keys external to the device.