ppxscal/embedding_network huggingface dataset:
A Binarization Algorithm specialized on Document Images and Photos
Authors: Ergina Kavallieratou
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, a new method for document images or photos binarization is presented. The method is simple, fast and robust and appropriate for normal as well as for special cases of documents like photos, historical documents etc. The proposed method is applied to problematic cases of documents and it is compared to other traditional methods.
A Temperature, Supply Voltage Compensated Floating-Gate MOS Dosimeter Using V_TH Extractor
Authors: Yanjie Wang, Yanbin Wang, Garry Tarr, Kris Iniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

A temperature and supply voltage compensated floating-gate MOSFET dosimeter is presented. The dosimeter consists of two pairs of floating-gate sensor transistors with identical geometry for compensation purpose, V_TH (threshold voltage) extractor circuits and substractors. The dosimeter output presents the threshold voltage changes of the floating-gate MOSFET sensors before and after radiation. The circuit has been modeled and simulated in Hspice using TSMC 0.35µm CMOS technology at 2.4V power supply. Simulated results show a low sensitivity to temperature and V_DD variations and a low power consumption of 0.44mW.
Improving Contact Realism through Event-Based Haptic Feedback
Authors: Katherine J. Kuchenbecker, Jonathan Fiene, Gunter Niemeyer
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

Tapping on surfaces in a typical virtual environment feels like contact with soft foam rather than a hard object. The realism of such interactions can be dramatically improved by superimposing event-based, high-frequency transient forces over traditional position-based feedback. When scaled by impact velocity, hand-tuned pulses and decaying sinusoids produce haptic cues that resemble those experienced during real impacts. Our new method for generating appropriate transients inverts a dynamic model of the haptic device to determine the motor forces required to create prerecorded acceleration profiles at the user's fingertips. After development, the event-based haptic paradigm and the method of acceleration matching were evaluated in a carefully controlled user study. Sixteen individuals blindly tapped on nine virtual and three real samples, rating the degree to which each felt like real wood. Event-based feedback achieved significantly higher realism ratings than the traditional rendering method. The display of transient signals made virtual objects feel similar to a real sample of wood on a foam substrate, while position feedback alone received ratings similar to those of foam. This work provides an important new avenue for increasing the realism of contact in haptic interactions.
The Performance Penalty of XML for Program Intermediate Representations
Authors: Paul Anderson
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

XML has been proposed as a file format for representing program intermediate forms such as abstract syntax trees (ASTs), and dependence graphs. Although XML offers many advantages over custom binary representations of the same information, there is an associated performance cost. This paper reports on the results of experiments aimed at quantifying this cost. Two representations are studied: the abstract syntax tree, and the system dependence graph (SDG). The performance penalty for using XML is found to be very significant for ASTs, and crippling for the SDG. The tradeoff between the performance and flexibility is discussed.
Time-series forecasting using flexible neural tree model
Authors: Yuehui Chen, Bo Yang, Jiwen Dong, Ajith Abraham
Venue: Information Sciences: an International Journal (2005)

Time-series forecasting is an important research and application area. Much effort has been devoted over the past several decades to develop and improve the time-series forecasting models. This paper introduces a new time-series forecasting model based on the flexible neural tree (FNT). The FNT model is generated initially as a flexible multi-layer feed-forward neural network and evolved using an evolutionary procedure. Very often it is a difficult task to select the proper input variables or time-lags for constructing a time-series model. Our research demonstrates that the FNT model is capable of handing the task automatically. The performance and effectiveness of the proposed method are evaluated using time series prediction problems and compared with those of related methods.
Double-Gate SOI Devices for Low-Power and High-Performance Applications
Authors: Kaushik Roy, Hamid Mahmoodi, Saibal Mukhopadhyay, Hari Ananthan, Aditya Bansal, Tamer Cakici
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Double-Gate (DG) transistors have emerged as promising devices for nano-scale circuits due to their better scalability compared to bulk CMOS. Among the various types of DG devices, quasi-planar SOI FinFETs are easier to manufacture compared to planar double-gate devices. DG devices with independent gates (separate contacts to back and front gates) have recently been developed. DG devices with symmetric and asymmetric gates have also been demonstrated. Such device options have direct implications at the circuit level. Independent control of front and back gate in DG devices can be effectively used to improve performance and reduce power in sub-50nm circuits. Independent gate control can be used to merge parallel transistors in non-critical paths. This results in reduction in the effective switching capacitance and hence power dissipation. We show a variety of circuits in logic and memory that can benefit from independent gate operation of DG devices. As examples, we show the benefit of independent gate operation in circuits such as dynamic logic circuits, Schmitt triggers, sense amplifiers, and SRAM cells. In addition to independent gate option, we also investigate the usefulness of asymmetric devices and the impact of width quantization and process variations on circuit design
An analytical throughput model for bulk data transfers over wide area networks
Authors: H. Simitci
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

This work presents an analytical queuing network model for bulk data transfers over long distances. Large scale scientific applications like climate modeling and high energy physics generate huge amounts of data that needs to be replicated across long distances for collaboration purposes. In addition, businesses need to copy critical data to remote sites for disaster recovery. The performance of these kinds of applications depends on the latency of the link due to the physical distance between the sites. The model presented in this paper uses the most prominent characteristics of remote data transfer applications and simplifies the performance prediction. This study shows that the overall throughput is mostly determined by the latency of the link, bandwidth of the link, number of round trips required for each I/O operation, and the number of simultaneously active I/O operations (asynchronous window size). Through laboratory and field experiments, we show that the model is capable of approximating the performance of remote data transfers within a very small error range. 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
A color-based layout analysis to process censorship cards of film archives
Authors: Margherita Berardi, Oronzo Altamura, Michelangelo Ceci, Donato Malerba
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Processing censorship cards of the 20th century in order to support annotation and retrieval processes, leads to a number of challenges for many DIA systems. Problems due to the low layout quality and standard of such a material can be reduced by exploiting information conveyed by color. In this paper, taking into account lessons learned in the context of the IST project Collate, we propose a new method for image segmentation and layout analysis that takes full advantage of color information. The method has been implemented in the DIA system WISDOM++ and tested on a corpus of multiformat documents concerning historic film censorships.
A systems methodology for measuring operational organization effectiveness: a study of the original equipment computer manufacturing industry, 1948 to 2001
Authors: Teddy Steven Cotter
Venue:  (2005)

Optimizing operational organizational effectiveness is the central, although often unstated, goal of engineering management and systems engineering research and applications. Two fundamental problems remain to be addressed in pursuit of this goal. First, despite over fifty years of research in various disciplines, there is still no universally accepted definition of organizational effectiveness. Second, no methodology exists to identify the domains, dimensions, and determinants of operational organizational effectiveness and dynamically model operational organizational effectiveness within a given population. This research synthesizes a systems engineering methodology for identifying the domains, dimensions, and determinants of and dynamically modeling operational organizational effectiveness for an identified population. First, the methodology takes the concept of the niche from ecological theory as its definition of effectiveness. Specifically, an organization that is able to sustain a real nonnegative growth rate in its niche dimension under a set of competitive conditions is defined as being effective. Next, the methodology integrates organizational ecology and open systems theories, principles, and models into a unified systemic model of environmental and organizational domains and dimensions that provide the structure for research into the determinants of organizational effectiveness. Based on this model, the methodology gathers observable data on hypothesized determinants of effectiveness and applies event history survival and effectiveness analyses to identify the statistically significant determinants. The methodology's final two steps are to construct and validate a dynamic simulation model of organizational effectiveness based on the identified determinants and to perform sensitivity analyses. (Abstract shortened by UMI.)
BRILLANT: An Open Source and XML-based platform for Rigourous Software Development
Authors: Samuel Colin, Dorian Petit, Vincent Poirriez, Jerome Rocheteau, Rafael Marcano, Georges Mariano
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

The need for the B method first appeared in industry, and several commercial tools have been developed to support this formalism. However, few of these tools allow reasoning on the formalism itself or on its possible extensions. This article presents an open-source platform, with a focus on the platform's core component, the BCaml project. The tools presented here are used to show how very different approaches can be brought together around a central design to form a consistent toolbox, and can be used to develop safe systems, from their specifications to their validation and the generation of safe code.
A formatter generator or programming a formatter machine
Authors: Russell Abbott
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

It happened with compilers, and I guess it had to happen eventually with text formatters. But the source for this development in formatters is surprising--at least to someone who has spent so much time in an academic environment. After having written enough compilers, we, the computer industry, abstracted ourselves to the stage of producing compiler generators. We have, by now, been writing text formatters for quite some time, and yet no one has produced a "theory of text formatting" enabling him to write a formatter generator. Yet Autologic', a leading manufacturer of computer controlled typesetters, needed a formatting facility more sophisticated than those generally available on the standard time sharing system. Serving printers is far different from serving terminal-bound authors.
Improved H∞ control of discrete-time fuzzy systems: a cone complementarity linearization approach
Authors: Huijun Gao, Zidong Wang, Changhong Wang
Venue: Information Sciences: an International Journal (2005)

In this paper, new results are presented for H∞ analysis and synthesis problems of discrete-time Takagi-Sugeno (TS) fuzzy systems. By defining a multiple Lyapunov function, a new sufficient condition guaranteeing the H∞ performance of the TS fuzzy systems is first derived, which is expressed by a set of linear matrix inequalities (LMIs). Both theoretical analysis and numerical examples show that such a new condition is less conservative than previous results obtained within the quadratic framework. Based on this new condition for H∞ performance, the corresponding H∞ controller design problem is then investigated. Different from the traditional quadratic framework, the synthesis problem is solved by exploiting the cone complementarity linearization (CCL) method, together with a sequential minimization problem subject to LMI constraints obtained for the existence of admissible controllers, which can be readily solved by using standard numerical software.
Ray-Tracing Polymorphic Multidomain Spectral/hp Elements for Isosurface Rendering
Authors: Blake Nelson Robert M. Kirby
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

The purpose of this paper is to present a ray-tracing isosurface rendering algorithm for spectral/hp (high-order finite) element methods in which the visualization error is both quantified and minimized. Determination of the ray-isosurface intersection is accomplished by classic polynomial root-finding applied to a polynomial approximation obtained by projecting the finite element solution over element-partitioned segments along the ray. Combining the smoothness properties of spectral/hp elements with classic orthogonal polynomial approximation theory, we devise an adaptive scheme which allows the polynomial approximation along a ray-segment to be arbitrarily close to the true solution. The resulting images converge toward a pixel-exact image at a rate far faster than sampling the spectral/hp element solution and applying classic low-order visualization techniques such as marching cubes.
Learning from the Web
Authors: Adam Bosworth
Venue: Queue (2005)

In the past decade we have seen a revolution in computing that transcends anything seen to date in terms of scope and reach, but also in terms of how we think about what makes up “good” and “bad” computing. The Web taught us several unintuitive lessons:
Support Vector Machines Applied to White Blood Cell Recognition
Authors: Daniela Mayumi Ushizima, Ana C. Lorena, Andre C. P. L. F. de Carvalho
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

A clinical decision support system known as Leuko has been developed for leukemia diagnosis using a Naive Bayes classifier. The system is able to recognize six types of white blood cells (WBC), including a malignancy. This paper investigates the use of Support Vector Machines (SVMs) classifiers to recognize WBC for future leukemia diagnosis. Since SVMs are originally designed for the solution of two class problems, several strategies for their extension to this multiclass task are investigated and compared. The experimental results evidence the potential of SVMs to leukemia diagnosis and indicate that an hierarchical tree-based multiclass strategy can be better suited to a future update of the Leuko system.
EA-Miner: a tool for automating aspect-oriented requirements identification
Authors: Américo Sampaio, Ruzanna Chitchyan, Awais Rashid, Paul Rayson
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Aspect-Oriented requirements engineering helps to achieve early separation of concerns by supporting systematic analysis of broadly-scoped properties such as security, real-time constraints, etc. The early identification and separation of aspects and base abstractions crosscut by them helps to avoid costly refactorings at later stages such as design and code. However, if not handled effectively, the aspect identification task can become a bottleneck requiring a significant effort due to the large amount of, often poorly structured or imprecise, information available to a requirements engineer. In this paper, we describe a tool, EA-Miner, that provides effective automated support for identifying and separating aspectual and non-aspectual concerns as well as their crosscutting relationships at the requirements level. The tool utilises natural language processing techniques to reason about the properties of the concerns and model their structure and relationships.
iVuBlender: A Tool for Merging Incomplete and Inconsistent Views
Authors: Mehrdad Sabetzadeh, Steve Easterbrook
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

View merging is an important activity in any conceptual modeling language. It is often desirable to combine a set of views to gain a unified perspective, to test hypotheses about how views are related, or to perform various types of analysis. A major challenge for view merging is toleration of incompleteness and inconsistency: views may be inconclusive, and may have conflicts over the concepts being modeled or how they are structured. Drawing on the theory developed in our earlier work [6, 5], we present a view merging tool, called iVuBlender, that allows for explicit modeling of incompleteness and inconsistency and provides a framework for interconnecting and merging incomplete and inconsistent views.
Application of Lightweight Formal Methods to Software Security
Authors: David P. Gilliam, John D. Powell, Matt Bishop
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Formal specification and verification of security has proven a challenging task. There is no single method that has proven feasible. Instead, an integrated approach which combines several formal techniques can increase the confidence in the verification of software security properties. Such an approach which specifies security properties in a library that can be re-used by 2 instruments and their methodologies developed for the National Aeronautics and Space Administration (NASA) at the Jet Propulsion Laboratory (JPL) are described herein The Flexible Modeling Framework (FMF) is a model based verification instrument that uses Promela and the SPIN model checker. The Property Based Tester (PBT) uses TASPEC and a Test Execution Monitor (TEM). They are used to reduce vulnerabilities and unwanted exposures in software during the development and maintenance life cycles. These instruments are currently being piloted with a COTS Server-Agent Application.
Finding Frequent Patterns in a Large Sparse Graph*
Authors: Michihiro Kuramochi, George Karypis
Venue: Data Mining and Knowledge Discovery (2005)

Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteristics that are present in a variety of datasets and application areas. Computationally efficient algorithms that find patterns corresponding to frequently occurring subgraphs play an important role in developing data mining-driven methodologies for analyzing the graphs resulting from such datasets. This paper presents two algorithms, based on the horizontal and vertical pattern discovery paradigms, that find the connected subgraphs that have a sufficient number of edge-disjoint embeddings in a single large undirected labeled sparse graph. These algorithms use three different methods for determining the number of edge-disjoint embeddings of a subgraph and employ novel algorithms for candidate generation and frequency counting, which allow them to operate on datasets with different characteristics and to quickly prune unpromising subgraphs. Experimental evaluation on real datasets from various domains show that both algorithms achieve good performance, scale well to sparse input graphs with more than 120,000 vertices or 110,000 edges, and significantly outperform previously developed algorithms.
Evolutionary computation methods for synchronization of effects based operations
Authors: Jeffrey P. Ridder
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Effects based operations (EBO) is a concept based on the premise that a desired strategic outcome can be achieved through synergistic, multiplicative, and cumulative application of the full range of military and nonmilitary capabilities. Such synergism requires synchronizing a large set of operations in order to achieve a set of effects. The synchronizer develops a set of alternative plans by solving a multi-objective optimization problem subject to several constraints. The EBO synchronization problem is also dynamic since planning is a continuous activity in a dynamically changing environment. In this paper, we describe the operational concept for EBO synchronization, the requirements for algorithms to perform synchronization, and some algorithmic steps toward constructing a synchronizer.
Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases
Authors: Mohammad R. Kolahdouzan, Cyrus Shahabi
Venue: Geoinformatica (2005)

Continuous K nearest neighbor queries (C-KNN) are defined as finding the nearest points of interest along an enitre path (e.g., finding the three nearest gas stations to a moving car on any point of a pre-specified path). The result of this type of query is a set of intervals (or split points) and their corresponding KNNs, such that the KNNs of all points within each interval are the same. The current studies on C-KNN focus on vector spaces where the distance between two objects is a function of their spatial attributes (e.g., Euclidean distance metric). These studies are not applicable to spatial network databases (SNDB) where the distance between two objects is a function of the network connectivity (e.g., shortest path between two objects). In this paper, we propose two techniques to address C-KNN queries in SNDB: Intersection Examination (IE) and Upper Bound Algorithm (UBA). With IE, we first find the KNNs of all nodes on a path and then, for those adjacent nodes whose nearest neighbors are different, we find the intermediate split points. Finally, we compute the KNNs of the split points using the KNNs of the surrounding nodes. The intuition behind UBA is that the performance of IE can be improved by determining the adjacent nodes that cannot have any split points in between, and consequently eliminating the computation of KNN queries for those nodes. Our empirical experiments show that the UBA approach outperforms IE, specially when the points of interest are sparsely distributed in the network.