ppxscal/embedding_network huggingface dataset:
Modeling the Overshooting Effect for CMOS Inverter in Nanometer Technologies
Authors: Zhangcai Huang, Hong Yu, Atsushi Kurokawa, Yasuaki Inoue
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

With the scaling of CMOS technology, the over-shooting time due to the input-to-output coupling capacitance has much more significant effect on inverter delay. Moreover, the overshooting time is also an important parameter in the short circuit power estimation. Therefore, in this paper an effective analytical model is proposed to estimate the overshooting time for the CMOS inverter in nanometer technologies. Furthermore, the influence of process variation on the overshooting time is illustrated based on the proposed model. And the accuracy of the proposed model is proved to greatly agree with SPICE simulation results.
A UML 2 Profile for Variability Models and their Dependency to Business Processes
Authors: Birgit Korherr, Beate List
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Variability Models are designed for modelling variabilities of a software. Unfortunately they are not part of a wellknown modelling framework for a higher usability, like the Unified Modelling Language. To address this limitation, we provide a UML 2 profile for variability models. Furthermore we show the dependency from the UML profile to activity diagrams to make the relationship between variability models and process models visible. This profile and its mapping are tested with example business processes.
Machine Understanding of CSG: Extraction and Unification of Manufacturing Features
Authors: Y. c. Lee, K. s. Fu
Venue: IEEE Computer Graphics and Applications (1987)

Constructive Solid Geomety (CSG)-albeit a concise, powerful, and informationally complete scheme-does not explicitly present certain high-level conceptual information, which is directly available from traditional engineering drawings and has been extremely useful for manufcturing processes. Such manufacturing fetures as chamfer, round, fillet, bore, and neck are typical examples of this kind of information. The fact that CSG is unambiguous but not unique, however, has posed great difficulties in the development of algorithms capable of understanding CSG and making it more useful for manufactuing. We propose a general apporach, based on principal axis and tree reconstruction, to extract and unify feature representations while retaining the simplicity and conciseness of CSG.
An Analytic Word Recognition Algorithm Using a Posteriori Probability
Authors: T. Hamamura, T. Akagi, B. Irie
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Word recognition algorithms are classified into two major groups. One is an "analytic" approach of recognizing individual characters, while the other is a "holistic" approach dealing with an entire word image. In the former approach, matching scores used to be calculated using heuristic functions, such as an average of confidence values on character recognition. In some non-heuristic studies, a stochastic evaluation function is employed, which is a ratio between an "a posteriori" probability and an "a priori" probability ("a posteriori" probability ratio). In this research, a new evaluation function is proposed, which is an improvement of "a posteriori" probability ratio. A result of an experiment using real images shows 9.1% improvement on handwritten word recognition.
An Efficient Distributed Algorithm for Mining Association Rules
Authors: Yan Zhao, Yong Yao, Zhijng Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Modern organizations are geographically distributed. Using the traditional centralized association rule mining to discover useful patterns in such distributed system is not always feasible because merging data sets from different sites into a centralized site incurs huge network communication and time costs. This paper presents an efficient distributed association rule mining(ED-ARM) algorithm to fast find the large itemsets over the distributed transaction database system. Our performance study shows that ED-ARM has a superior performance over the algorithms of CD and FDM.
Dynamic interval-based labeling scheme for efficient XML query and update processing
Authors: Jung-Hee Yun, Chin-Wan Chung
Venue: Journal of Systems and Software (2008)

XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationships are parent-child and ancestor-descendant, and finding all occurrences of these basic structural relationships in an XML data is clearly a core operation in XML query processing. Several node labeling schemes have been suggested to support the determination of ancestor-descendant or parent-child structural relationships simply by comparing the labels of nodes. However, the previous node labeling schemes have some disadvantages, such as a large number of nodes that need to be relabeled in the case of an insertion of XML data, huge space requirements for node labels, and inefficient processing of structural joins. In this paper, we propose the nested tree structure that eliminates the disadvantages and takes advantage of the previous node labeling schemes. The nested tree structure makes it possible to use the dynamic interval-based labeling scheme, which supports XML data updates with almost no node relabeling as well as efficient structural join processing. Experimental results show that our approach is efficient in handling updates with the interval-based labeling scheme and also significantly improves the performance of the structural join processing compared with recent methods.
Wave hierarchies in continua with scalar microstructure in the plane and spherical symmetry
Authors: F. Oliveri, M. P. Speciale
Venue: Computers Mathematics with Applications (2008)

In this paper, we consider the balance equations for a continuum with scalar microstructure and propose a general approach to investigate nonlinear wave propagation by means of an asymptotic approach within the theoretical context of wave hierarchies. The evolution equations that are obtained for the leading terms of the asymptotics allow for the description of various levels of wave motion in agreement with the different scales involved in the modelling of continua with microstructure. Both the one-dimensional planar and the axisymmetric spherical cases are considered in a unified way, and various examples (immiscible mixtures of perfect fluids, granular materials, liquid with bubbles) are discussed in order to illustrate the procedure.
Redundant Bit Vectors for Robust Indexing and Retrieval of Electronic Ink
Authors: K. Chellapilla, J. Platt
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents a redundant bit vector approach for indexing and retrieval of handwritten words captured using an electronic pen or tablet. Handwritten words (cursive or print) are first segmented into strokes and each stroke is featurized using a neural network. Oriented principal component analysis (OPCA) is used for dimensionality reduction while ensuring robustness to handwriting variation (noise). Redundant bit vectors are used to index the resulting low dimensional representations for efficient storage and retrieval. Experimental results on large datasets with 898,652 handwritten words show good retrieval performance that is robust to handwriting variations and generalizes well over different writers and writing styles.
Computer Graphics Display Hardware
Authors: L. C. Hobbs
Venue: IEEE Computer Graphics and Applications (1981)

The CRT is likely to remain the dominant display technologv for at least another decade. Progress in competing technologies, however, will ensure them a place in specialized applications.
The Effects of Morphemes on Korean Word Recognition: Revealed on the Frequency and Length Effects
Authors: Ji-Hyang Oh, Min-Gyeong Choi, Hyeon-Woo Yi, Chang H. Lee
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The effects of two important lexical variables, word frequency and word length, are investigated for Korean word recognition. The processing of Korean words did not show similar effects as one of many other orthographies. First, a subtype of Korean orthography showed no word frequency effects. Second, one syllable words are processed more slowly than two syllable words. The possible confounding variable, the effect of morphemes, was suggested.
The conductor interaction method
Authors: Dorothy Rachovides, James Walkerdine, Peter Phillips
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2007)

Computers have increasingly become part of our everyday lives, with many activities either involving their direct use or being supported by one. This has prompted research into developing methods and mechanisms to assist humans in interacting with computers (human-computer interaction, or HCI). A number of HCI techniques have been developed over the years, some of which are quite old but continue to be used, and some more recent and still evolving. Many of these interaction techniques, however, are not natural in their use and typically require the user to learn a new means of interaction. Inconsistencies within these techniques and the restrictions they impose on user creativity can also make such interaction techniques difficult to use, especially for novice users. This article proposes an alternative interaction method, the conductor interaction method (CIM), which aims to provide a more natural and easier-to-learn interaction technique. This novel interaction method extends existing HCI methods by drawing upon techniques found in human-human interaction. It is argued that the use of a two-phased multimodal interaction mechanism, using gaze for selection and gesture for manipulation, incorporated within a metaphor-based environment, can provide a viable alternative for interacting with a computer (especially for novice users). Both the model and an implementation of the CIM within a system are presented in this article. This system formed the basis of a number of user studies that have been performed to assess the effectiveness of the CIM, the findings of which are discussed in this work.
Alternate reality gaming
Authors: Jeffrey Y. Kim, Jonathan P. Allen, Elan Lee
Venue: Communications of the ACM (2008)

Millions update the state of the game on the way to a common conclusion, in one case to help the Operator regain control of a spaceship and bring her crew back to the future.
Comparative Assessment of Testing and Model Checking Using Program Mutation
Authors: Jeremy S. Bradbury, James R. Cordy, Juergen Dingel
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Developing correct concurrent code is more difficult than developing correct sequential code. This difficulty is due in part to the many different, possibly unexpected, executions of the program, and leads to the need for special quality assurance techniques for concurrent programs such as randomized testing and state space exploration. In this paper an approach is used that assesses testing and formal analysis tools using metrics to measure the effectiveness and efficiency of each technique at finding concurrency bugs. Using program mutation, the assessment method creates a range of faulty versions of a program and then evaluates the ability of various testing and formal analysis tools to detect these faults. The approach is implemented and automated in an experimental mutation analysis framework (ExMAn) which allows results to be more easily reproducible. To demonstrate the approach, we present the results of a comparison of testing using the IBM tool ConTest and model checking using the NASA tool Java PathFinder (JPF).
2007 Special Issue: Consciousness & the small network argument
Authors: Michael H. Herzog, Michael Esfeld, Wulfram Gerstner
Venue: Neural Networks (2007)

The last decade has experienced a vivid enthusiasm to unravel the mystery of consciousness believed to be one of the major puzzles of human kind. We share this enthusiasm. Still, we feel that current models are incomplete suffering from a problem that we call the ''small network argument''.
A Context Quality Model for Ubiquitous Applications
Authors: Siliang Tang, Jianhua Yang, Zhaohui Wu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Quality of Context (QoC) is critical in context reasoning, context refining, security policy configuring, etc. Many researches have been presented to model context and its quality by quantifying QoC-parameters. However, these quality models emphasis on the information-inherent QoC, while the influence of context-aware applications and environment situation on QoC is not well considered. In this paper, we will propose a novel context quality model based on OWL-DL, which is related with situation and can be specified by context-aware applications. Moreover, a context processing infrastructure is introduced, since QoC model is relevant to context processing. Furthermore, a context information service prototype is implemented to support application and situation related QoC rectification. Finally, we demonstrate the efficacy of this approach through a storeroom scenario and a case study of context file system application with the help of a Pioneer III-AT mobile robot and a FUSE-based Context file system.
A convergence analysis for the superconsistent Chebyshev method
Authors: Lorella Fatone, Daniele Funaro, Gang Joon Yoon
Venue: Applied Numerical Mathematics (2008)

The superconsistent collocation method is based on collocation nodes which are different from those used to represent the solution. The two grids are chosen in such a way that the continuous and the discrete operators coincide on a space as larger as possible (superconsistency). There are many documented situations in which this technique provides excellent numerical results. Unfortunately very little theory has been developed. Here, a theoretical convergence analysis for the superconsistent discretization of the second derivative operator, when the representation grid is the set of Chebyshev Gauss-Lobatto nodes is carried out. To this end, a suitable quadrature formula is introduced and studied.
Adaptive patch-based mesh fitting for reverse engineering
Authors: Hongwei Lin, Wei Chen, Hujun Bao
Venue: Computer-Aided Design (2007)

In this paper, we propose a novel adaptive mesh fitting algorithm that fits a triangular model with G^1 smoothly stitching bi-quintic Bezier patches. Our algorithm first segments the input mesh into a set of quadrilateral patches, whose boundaries form a quadrangle mesh. For each boundary of each quadrilateral patch, we construct a normal curve and a boundary-fitting curve, which fit the normal and position of its boundary vertices respectively. By interpolating the normal and boundary-fitting curves of each quadrilateral patch with a Bezier patch, an initial G^1 smoothly stitching Bezier patches is generated. We perform this patch-based fitting scheme in an adaptive fashion by recursively subdividing the underlying quadrilateral into four sub-patches. The experimental results show that our algorithm achieves precision-ensured Bezier patches with G^1 continuity and meets the requirements of reverse engineering.
Complex-valued ICA utilizing signal-subspace demixing for robust DOA estimation and blind signal separation
Authors: Ann-Chen Chang, Chih-Wei Jen
Venue: Wireless Personal Communications: An International Journal (2007)

This paper deals with direction of arrival (DOA) estimation and blind signal separation (BSS) based on independent component analysis (ICA) with robust capabilities. An efficient demixing procedure of complex-valued ICA is presented here, which combines the signal-subspace demixing procedure exploiting individual signal-subspace projection and Newton's iteration algorithm based on maximization of the approximate negentropy of non-Gaussian signal for array signal processing. It resolves the problems of order ambiguity and identifiability of traditional ICA for time-domain BSS. The proposed method could be directly applied to radar, sonar, radio surveillance, and communications systems for separating signals and estimating relative DOAs of signals. Several computer simulation examples for perturbations to the array manifold, unknown noise environments, and Rayleigh fading channel are provided to illustrate the effectiveness of the proposed method.
An Efficient Algorithm for Motion Estimation with Multiple Reference Frames in H.264/AVC
Authors: Zhengning Wang, Jun Yang, Qiang Peng, Changqian Zhu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Multiple reference frames motion compensation is one of the new features adopted in H.264/AVC to improve the coding efficiency of inter frames. However, the computational complexity of multi-reference frames motion estimation (MRME) is increased in proportion to the number of searched reference frames. This paper presents a novel scheme to reduce the complexity of MRME. In order to speed up the MRME process, the following factors such as frame rate, motion activity and search range are considered. Experiment results verify that the proposed algorithm can reduce the number of reference frame from 5 to 1.6 and save the MRME time by 90.2% on average respectively with little degradation of coding efficiency.
The Design and Implementation of XML-based Workflow Engine
Authors: Xin Jin, Jing Xu, Xuemeng Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper brings up a design of XML-based workflow engine and gives an implementation of a web-based workflow management system. Workflow is the automation of business procedures and workflow engine is the key part to carry out the system. Workflow engine can supply the conditions needed for executing a workflow process. This paper focuses on the workflow description language[1,5]--X-WPDL (XML-based Workflow Process Definition Language) that we designed and the implementation of the engine. All of the workflow processes that our engine operates are all described by X-WPDL. The engine translates the workflow process into an execution sequence that is consist of events or activities, then loads it in and drives it to run. The engine also offers an interface for the manager and participants for interaction. The application case will show that our implementation of this engine and the whole system is capable of processing workflow.
An interorganizational knowledge-sharing security model with breach propagation detection
Authors: Daniel S. Soper, Haluk Demirkan, Michael Goul
Venue: Information Systems Frontiers (2007)

The increasing adoption of Service Oriented Architecture (SOA) is allowing more and more companies to integrate themselves in interorganizational netchain environments wherein knowledge assets can be electronically shared with selected business partners. The dynamic nature of these environments implies a need for organizations to protect and monitor the flow of their valuable knowledge assets throughout the netchain if they hope to maintain their long-term competitive positions. In this paper, we propose an interorganizational knowledge-sharing security model that integrates the value chain reference model (VCOR), the federated enterprise reference architecture model (FERA), and multidimensional data warehouse technologies to allow for the proactive monitoring of shared knowledge assets across an SOA-based netchain. The proposed architecture is novel In that it supports dynamic policy revision through the automated detection of knowledge-sharing breaches within a netchain--a process whose viability is demonstrated using network flow theory and a series of simulations. Existing business intelligence infrastructures can be readily modified to support the proposed model, as multidimensional data warehousing has already been adopted in many organizations.
A Recommended Resource for Linux-Based Companies
Authors: Arturo Ortiz-Tapia
Venue: IEEE Distributed Systems Online (2007)

A review of "The Linux Enterprise Cluster" by Karl Kopper
An Approach to Formal Specification of Control Modules
Authors: W. H. Leung
Venue: IEEE Transactions on Software Engineering (1980)

This paper is concerned with the formal specification of program modules which control access to resources shared among concurrent proceses. The concept of state space is defined for such program modules and the formal specification is given in terms of a program module invariant and input-output assertions defined on the state space. Examples are provided to ilustrate the construction of sDecifications with this approach.
Real-Time SLAM with a High-Speed CMOS Camera
Authors: Peter Gemeiner, Wolfgang Ponweiser, Peter Einramhof, Markus Vincze
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

A typical task in mobile robotics or augmented reality applications is self-localization in an unknown environment. In the robotics community the localization and mapping of the unknown environment is called SLAM (Simultaneous Localization and Mapping). Important constraints in SLAM using visual input are real-time processing and robustness against motion blur or jitter. The contribution of this paper is in enhancing the performance of a well known SLAM method using a high-speed CMOS camera. Benefits of this camera are that it allows fast image processing, little motion blur and low localization uncertainty. SLAM performance with a high-speed camera is demonstrated on a robotic arm. The result of the experiments is that for SLAM applications in robotics, where the motion is not smooth, the high-speed CMOS camera is a more suitable sensor than a standard CCD camera.
The Hardness of Approximating Spanner Problems
Authors: Michael Elkin, David Peleg
Venue: Theory of Computing Systems (2007)

This paper examines a number of variants of the sparse k-spanner problem and presents hardness results concerning their approximability. Previously, it was known that most k-spanner problems are weakly inapproximable (namely, they are NP-hard to approximate with ratio O(log n), for every k &ge; 2) and that the unit-length k-spanner problem for constant stretch requirement k &ge; 5 is strongly inapproximable (namely, it is NP-hard to approximate with ratio O(2log1-en)) ). The results of this paper significantly expand the ranges of hardness for k-spanner problems. In general, strong hardness is shown for a number of k-spanner problems, for certain ranges of the stretch requirement k depending on the particular variant at hand. The problems studied differ by the types of edge weights and lengths used, and they include directed, augmentation and client-server variants. The paper also considers k-spanner problems in which the stretch requirement k is relaxed (e.g., k = &Omega;(logn)). For these cases, no inapproximability results were known (even for a constant approximation ratio) for any spanner problem. Moreover, some versions of the k-spanner problem are known to enjoy the ratio-degradation property; namely, their complexity decreases exponentially with the inverse of the stretch requirement. So far, no hardness result existed precluding any k-spanner problem from enjoying this property. This paper establishes strong inapproximability results for the case of relaxed stretch requirement (up to k = O(n1 - &delta;), for any 0 < &acute; < 1), for a large variety of k-spanner problems. It is also shown that these problems do not enjoy the ratio-degradation property.