ppxscal/embedding_network huggingface dataset:
Fast and Accurate OPC for Standard-Cell Layouts
Authors: David M. Pawlowski, Liang Deng, Martin D. F. Wong
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Model based optical proximity correction (OPC) has become necessary at 90nm technology node and beyond. Cell-wise OPC is an attractive technique to reduce the mask data size as well as the prohibitive runtime of full-chip OPC. As feature dimensions have gotten smaller, the radius of influence for edge features has extended further into neighboring cells such that it is no longer sufficient to perform cellwise OPC independent of neighboring cells, especially for the critical layers. The methodology described in this work accounts for features in neighboring cells and allows a cellwise approach to be applied to cells with a printed gate length of 45nm with the projection that it can also be applied to future technology nodes. OPC-ready cells are generated at library creation (independent of placement) using a boundary-based technique. Each cell has a tractable number of OPC-ready versions due to an intelligent characterization of standard cell layout features. Total number of cells with boundaries in the OPC-ready library only increases linearly with the number of cells in the original library. Results are very promising: the average edge placement error (EPE) for all metal1 features in 100 layouts is 0.731nm which is less than 1% of metal1 width, creating similar levels of lithographic accuracy while obviating any of the drawbacks inherent in layout specific full-chip model-based OPC. For even small circuits, there were runtime reductions of up to 100X and a potential 35X decrease in mask data size.
Incrementally-Updatable Stream Processors for XPath Queries based on Merging Automata via Ordered Hash-keys
Authors: Hajime Takekawa, Hiroshi Ishikawa
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Various kinds of data such as news articles and sensor data are generated continuously in the form of XML data on the network. The processing systems (e.g., systems for selective dissemination of information and notification) must evaluate many filters for every XML data. Therefore, Gupta and Suciu proposed an automaton called the XPush machine, which can efficiently evaluate a large number of XPath filters, each with many predicates, on a stream of XML documents. The XPush machine is constructed by creating an AFA (Alternating Finite Automaton) for each filter, and then transforming the set of AFAs into a single DPDA (Deterministic PushDown Automaton). Since the XPush machine cannot be partially updated inherently, however, addition of a single filter necessitates recalculation (i.e., reconstruction) of the XPush machine as a whole. In other words, the cost of updating an automaton depends on the total number of AFAs (or filters). In this paper, we propose and evaluate an integrated XPush machine, which enables incremental update by constructing the whole machine from a set of sub-XPush machines. The evaluation result positively demonstrates that efficient partial exchange of the AFAs is possible without significantly affecting all of the state transition tables.
Computational methods for study of foldness of H-ideals in BCI-algebras
Authors: Celestin Lele, Salissou Moutari
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

We study the notion of n-folds H-ideals in BCI-algebras as a natural generalization of H-ideals in BCI-algebras. Thanks to the concept of fuzzy point, we give some properties of n-folds and fuzzy n-folds H-ideals. Finally, we establish some algorithms for study of foldness theory of H-ideals in BCI-algebras.
How to Reduce the Size of Bank Check Image Archive?
Authors: V. Shapiro
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

TIFF Group 4 is the dominant format for storing bitonal bank check images in digital archives. Kept for at least seven years these images demand huge volume of disk space. The image size becomes a critical resource from the bandwidth perspective in the era of the widespread Internet banking and Image exchange between various financial institutions. This paper proposes an approach for lossy compression of TIFF Group 4 images able to reducing the compressed size by an extra 30%. The approach consists of the two separate steps: generic preprocessing, applicable to any document, and the check context-sensitive step that is specific to the check image compression. Compared to the widely used resolution reduction method, the proposed approach preserves the essential information in the image, providing comparable compression rates.
Symbolic Evaluation and the Analysis of Programs
Authors: T. E. Cheatham
Venue: IEEE Transactions on Software Engineering (1979)

Symbolic evaluation is a form of static program analysis in which symbolic expressions are used to denote the values of program variables and computations. It does not require the user to specify which path at a conditional branch to follow nor how many cycles of a loop to consider. Instead, a symbolic evaluator uses conditional expressions to represent the uncertainty that arises from branching and develops and attempts to solve recurrence relations that describe the behavior of loop variables.
Dental Biometrics: Human Identification Based On Dental Work Information
Authors: Michael Hofer, Aparecido Nilceu Marana
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Dental biometrics is used in forensic dentistry to identify or verify persons based on their dental radiographs. This paper presents a method for human identification based on dental work information. The proposed method works with three main processing steps: segmentation (feature extraction), creation of a dental code, and matching. In the segmentation step, seed points of the dental works are detected by thresholding. The final segmentation is obtained with a snake (active contour) algorithm. The dental code is defined from the position (upper or lower), the size of the dental works, and distance between neighboring dental works. The matching stage is performed with the Edit distance (Levenshtein distance). The costs for the insertion, deletion and substitution operations were adapted to make the matching algorithm more sensitive. The method was tested on a database including 68 dental radiographs and the results are encouraging.
Operational risk: acceptability criteria
Authors: Daniel Gideon Dresner, J. Robert (Bob) G. Wood
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

The English proverb 'one man's meat is another man's poison' may be an apt description of our approach to risk. Some will ski or bungee jump whilst others shun even the gentlest of fairground rides. Some organisations allow their staff unrestricted Internet access; for others access is constrained technically with monitoring and blocking tools, and psychologically with the threat of dismissal. In this paper we look at whether there is a way that organisations, whose appetite for risk may vary greatly, could find a way to share resources and data with assurance. Could we define a model of attitudes to risk which permits one organisation to plug into another and vice versa? We propose that where standards are employed either with the intentional or coincidental purpose of managing risk, there is a way to find common ground on which to build trust.
A Simple Framework for Natural Animation of Digitized Models
Authors: Edilson de Aguiar, Rhaleb Zayer, Christian Theobalt, Hans-Peter Seidel, Marcus Magnor
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

We present a versatile, fast and simple framework to generate animations of scanned human characters from input optical motion capture data. Our method is purely mesh-based and requires only a minimum of manual interaction. The only manual step needed to create moving virtual people is the placement of a sparse set of correspondences between the input data and the mesh to be animated. The proposed algorithm implicitly generates realistic body deformations, and can easily transfer motions between human subjects of completely different shape and proportions. We feature a working prototype system that demonstrates that our method can generate convincing lifelike character animations directly from optical motion capture data.
A improved method of face recognition by kernel maximum margin criterion
Authors: Yong-zhi Li, Jing-yu Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

A improved method of feature extraction based on kernel maximum margin criterion (KMMC) is presented for face recognition in this paper. i.e. a simple algorithm of uncorrelated optimal discriminant vectors in kernel feature space is proposed for nonlinear feature extraction. The proposed method has more powerful capability to eliminate the statistical correlation between feature vectors and its mathematical formulation is simple. Experimental results on ORL face database and YALE face database show that the new method is better than KMMC and kernel principal component analysis (KPCA) in terms of recognition rate.
Towards smart meeting: enabling technologies and a real-world application
Authors: Zhiwen Yu, Motoyuki Ozeki, Yohsuke Fujii, Yuichi Nakamura
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

In this paper, we describe the enabling technologies to develop a smart meeting system based on a three layered generic model. From physical level to semantic level, it consists of meeting capturing, meeting recognition, and semantic processing. Based on the overview of underlying technologies and existing work, we propose a novel real-world smart meeting application, called MeetingAssistant. It is distinctive from previous systems in two aspects. First it provides the real-time browsing that allows a participant to instantly view the status of the current meeting. This feature is helpful in activating discussion and facilitating human communication during a meeting. Second, the context-aware browsing adaptively selects and displays meeting information according to user's situational context, e.g., user purpose, which makes meeting viewing more efficient.
Event-driven simulations of nonlinear integrate-and-fire neurons
Authors: Arnaud Tonnelier, Hana Belmabrouk, Dominique Martinez
Venue: Neural Computation (2007)

Event-driven strategies have been used to simulate spiking neural networks exactly. Previous work is limited to linear integrate-and-fire neurons. In this note, we extend event-driven schemes to a class of nonlinear integrate-and-fire models. Results are presented for the quadratic integrate-and-fire model with instantaneous or exponential synaptic currents. Extensions to conductance-based currents and exponential integrate-and-fire neurons are discussed.
FRACTEL: a fresh perspective on (rural) mesh networks
Authors: Kameswari Chebrolu, Bhaskaran Raman
Venue: Proceedings of the 2007 workshop on Networked systems for developing regions (2007)

The use of commodity 802.11 hardware to provide network connectivity to rural regions is an appealing proposition. In this paper, we consider such networks, with a combination of long-distance and short-distance links. In such a setting, we offer a fresh perspective on a variety of technical issues in multi-hop mesh networks. To support QoS for voice, video-based real-time applications, the use of a TDMA-based MAC is appropriate. In this context, we argue that existing approaches to TDMA scheduling and channel allocation are either inapplicable, or are too general and hence complicated. We apply extensive domain knowledge in designing a solution applicable in our context. We also suggest appropriate implementation strategies for the TDMA MAC, capable of scaling to large networks. In all of the above topics, we articulate open technical issues wherever applicable.
The Range of Logical Flexibility of Tree Networks
Authors: A. Maruoka
Venue: IEEE Transactions on Computers (1975)

The flexible network is a network composed of flexible logical multivalued cells which can be adjusted at will to perform any functions. The network is assumed to have a fixed interconnection pattern and to have a fixed-input variable assignment. We have already investigated the necessary and sufficient range of flexibility of the cell's function to obtain all the output functions the network coul
A measurement study of virtual populations in massively multiplayer online games
Authors: Daniel Pittman, Chris GauthierDickey
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Understanding the distributions and behaviors of players within Massively Multiplayer Online Games (MMOGs) is essential for research in scalable architectures for these systems. We provide the first look into this problem through a measurement study on one of the most popular MMOGs, World of Warcraft [15]. Our goal is to answer four fundamental questions: how does the population of the virtual world change over time, how are players distributed in the virtual world, how much churn occurs with players, and how do they move in the virtual world. Through probing-based measurements, our preliminary results show that populations fluctuate according to a prime-time schedule, player distribution and churn appears to occur on a power-law distribution, and players move to only a small number of zones during each playing session. The ultimate goal of our research is to design an accurate player model for MMOGs so that future research can predict and simulate player behavior and population fluctuations over time.
Formalizing ontology reconciliation techniques as a basis for meaningful mediation in service-related tasks
Authors: Patrício de Alencar Silva, Cláudia M. F. A. Ribeiro, Ulrich Schiel
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

With the advent of Semantic Web, the fast dissemination of ontologies to represent and share information causes a deep impact on knowledge retrieval, as a whole. In this context, the use of different ontologies to express meaning on the same application domain leads to a kind of "Tower of Babel Effect" on the Web, bringing new problems to the communication among different applications. This problem still remains in service-oriented architectures, considering that a same service can be described by the use of different ontologies and standards. Therefore, the urge of an ontology reconciliation approach arises in order to enable communication despite the differences. This paper focuses on providing a formal description of ontology reconciliation techniques, such as merging, alignment and integration, to provide better understanding of how these techniques can be used on the scope of Semantic Web Services Architecture.
The dogear game: a social bookmark recommender system
Authors: Casey Dugan, Michael Muller, David R. Millen, Werner Geyer, Beth Brownholtz, Marty Moore
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

We describe the Dogear Game, which works with an enterprise social bookmarking system. The game is designed to accomplish individual, collaborative, and organization goals. Individual players receive entertainment and learn about their colleagues' bookmarks. The player's colleagues receive recommendations of websites and documents of potential interest to them. And the organization benefits from a richer knowledge-base of bookmarks as recommendations are accepted. The Dogear Game builds on von Ahn's "serious games," useful in motivating and distributing game-like entertaining "work" to a large group of game players. This note presents the design and implementation of a working prototype and some initial user feedback.
Identification of the inputs of quasilinear systems
Authors: S. A. Anikin
Venue: Automation and Remote Control (2007)

Consideration was given to restoration of the input of the quasilinear dynamic system from the measurements of its output. By the input is meant the pair consisting of the initial system state and the input action on the system (control, perturbation, and so on). The problem was solved using A.N. Tikhonov's method of regularization for which the sufficient convergence conditions and error estimates were established. Conditions for representability of an unknown input as a series in powers of a small parameter and the explicit form of the coefficients of this representation were determined.
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Authors: Marc Bezem, Dimitri Hendriks
Venue: Journal of Automated Reasoning (2008)

We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential quantification to make Skolemization unnecessary. Moreover, CL has a constructive proof system based on forward reasoning, which is easy to automate and where standardized proof objects can easily be obtained. We have implemented in Prolog a CL prover which generates Coq proof scripts. We test our approach with a case study: Hessenberg's Theorem, which states that in elementary projective plane geometry Pappus' Axiom implies Desargues' Axiom. Our CL prover makes it possible to automate large parts of the proof, in particular taking care of the large number of degenerate cases.
An Accelerator for Physics Simulations
Authors: Giovanni Danese, Francesco Leporati, Marco Bera, Mauro Giachero, Nelson Nazzicari, Alvaro Spelgatti
Venue: Computing in Science and Engineering (2007)

An accelerator based on field-programmable gate array (FPGA) technology accelerates double-precision floating-point operations present in the energy calculation of Monte Carlo–Metropolis simulations. The accelerator uses COTS components and is scalable in terms of clock frequency, memory capability, and number of computing units. It could also be part of a cluster of accelerated workstations.
Security Analysis of wrNAF and SPA Resistant Scalar Multiplication
Authors: Baodong Qin, Ming Li, Fanyu Kong, Daxing Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Recently, signed digit radix-r representation (such as wrNAF) is used for the efficient implementation of the pairing based cryptosystems. The side channel attack, which uses the leaked information such as power consumption and timing information from a cryptographic device, is a serious threat to the implementations of a cryptosystem. In this paper, we utilize the simple power analysis technique to analyze the security of the scalar multiplication using wrNAF representation and we can see that the wrNAF is not a SPA resistant recoding. In order to resist against SPA, we present two integer recodings (right-to-left and left-to-right) using two special digit sets respectively. The two recodings can be used to perform the scalar multiplication with a fixed sequence of operations without inserting dummy operations. Compared to Han's fixed pattern scheme, the proposed schemes can reduce about 16.7% to 37.5% table sizes (the number of precomputed and needed to be stored points) for r = 3, 5 and w = 2, 3, 4, 5.
Optimization and Simulation of Two Classes of Nonresetting Data Reconstructors
Authors: S. K. Jones, J. L. Melsa
Venue: IEEE Transactions on Computers (1971)

This paper explores some new solutions to the problem of high-speed data reconstruction in real time. Two types of nonresetting data reconstructors are developed. Both types are simpler than the classical extrapolative hold circuits and when optimized give better performance. The optimization procedure is given and results of simulation studies are included.
Mining conversational text for procedures with applications in contact centers
Authors: Deepak Padmanabhan, Krishna Kummamuru
Venue: International Journal on Document Analysis and Recognition (2007)

Many organizations provide dialog-based support through contact centers to sell their products, handle customer issues, and address product-and service-related issues. This is usually provided through voice calls&#x2014;of late, web-chat based support is gaining prominence. In this paper, we consider any conversational text derived from web-chat systems, voice recognition systems etc., and propose a method to identify procedures that are embedded in the text. We discuss here how to use the identified procedures in knowledge authoring and agent prompting. In our experiments, we evaluate the utility of the proposed method for agent prompting. We first cluster the call transcripts to find groups of conversations that deal with a single topic. Then, we find possible procedure-steps within each topic-cluster by clustering the sentences within each of the calls in the topic-cluster. We propose a measure for differentiating between clusters that are procedure-steps and those that are topical sentence collections. Once we identify procedure-steps, we represent the calls as sequences of procedure-steps and perform mining to extract distinct and long frequent sequences which represent the procedures that are typically followed in calls. We show that the extracted procedures are comprehensive enough. We outline an approach for retrieving relevant procedures for a partially completed call and illustrate the utility of distinct collections of sequences in the real-world scenario of agent prompting using the retrieval mechanism.
Workshop on Technology for supporting software engineers in globally distributed contexts
Authors: Arie van Deursen, Rob Kommeren, Paivi Parviainen, Rini Van Solingen
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Research shows that people apart more than 30 meters communicate no more frequently than those separated by oceans. Technological support for globally distributed software engineering should therefore focus on: "Creating a virtual 30 meters. Creating such transparency among dislocated software engineers can be provided by specific development technology. Within the Merlin project research has been carried out between international industrial organizations and research institutions. The focus has been on the development and validation of solutions global distributed software engineering with different companies/partners on the same product. The workshop aims in defining engineer requirements for GDSE technology with a focus on the virtual 30 meters. To do so, first work done in the Merlin project is briefly presented. After that the participants work together to define the challenges and priorities for GDSE development technology. At the end of the workshop needs and requirements for GDSE will be available.
Sensitivity-Function Calculation in Linear Systems Using Time-Shared Analog Integration
Authors: S. J. Kahne
Venue: IEEE Transactions on Computers (1968)

Abstract Sensitivity functions which relate the effect of parameter variations to system variables may be calculated for linear systems by simultaneous integration of two sets of first-order linear differential equations. These sets have the same homogeneous part. This note describes how an analog computer may be used to solve these equations without using two distinct simulations wired together. The number of integrators in the analog simulation is equal to the system order.