ppxscal/embedding_network huggingface dataset:
An annotation management system for relational databases
Authors: Deepavali Bhagwat, Laura Chiticariu, Wang-Chiew Tan, Gaurav Vijayvargiya
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We present an annotation management system for relational databases. In this system, every piece of data in a relation is assumed to have zero or more annotations associated with it and annotations are propagated along, from the source to the output, as data is being transformed through a query. Such an annotation management system is important for understanding the provenance and quality of data, especially in applications that deal with integration of scientific and biological data. We present an extension, pSQL, of a fragment of SQL that has three different types of annotation propagation schemes, each useful for different purposes. The default scheme propagates annotations according to where data is copied from. The default-all scheme propagates annotations according to where data is copied from among all equivalent formulations of a given query. The custom scheme allows a user to specify how annotations should propagate. We present a storage scheme for the annotations and describe algorithms for translating a pSQL query under each propagation scheme into one or more SQL queries that would correctly retrieve the relevant annotations according to the specified propagation scheme. For the default-all scheme, we also show how we generate finitely many queries that can simulate the annotation propagation behavior of the set of all equivalent queries, which is possibly infinite. The algorithms are implemented and the feasibility of the system is demonstrated by a set of experiments that we have conducted.
Electromagnetic field behavior in dispersive isotropic negative phase velocity/negative refractive index guided wave structures compatible with millimeter-wave monolithic integrated circuits
Authors: Clifford M. Krowne, Maurice Daniel
Venue: Journal of Nanomaterials (2007)

A microstrip configuration has been loaded with a dispersive isotropic left-handed medium (LHM) substrate and studied regarding its high frequency millimeter-wave behavior near 100 GHz. This has been accomplished using a full-wave integral-equation anisotropic Green's function code configured to run for isotropy. Never before seen electromagnetic field distributions are produced, unlike anything found in normal media devices, using this ab initio solver. These distributions are made in the cross-sectional dimension, with the field propagating in the perpendicular direction. It is discovered that the LHM distributions are so radically different from ordinary media used as a substrate that completely new electronic devices based upon the new physics become a real possibility. The distinctive dispersion diagram for the dispersive medium, consisting of unit cells with split ring resonator-rod combinations, is provided over the upper millimeter-wave frequency regime.
Arabic Handwriting Recognition Using Variable Duration HMM
Authors: A. Kundu, T. Hines, B. Huyck, J. Phillips, L. Van Guilder
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The present paper describes a complete system for the recognition of unconstrained handwritten Arabic words us- ing over-segmentation of characters and Variable Duration Hidden Markov Model (VDHMM). First, a segmentation algorithm is used to translate the 2-D image into 1-D se- quence of sub-character symbols. This sequence of symbols is modeled by the VDHMM. The shape information of char- acter and sub-character symbols is compactly represented by forty-five features in the feature space. The feature vec- tor is modeled as an independently distributed multivariate discrete distribution. The linguistic knowledge about char- acter transition is modeled as a Markov chain where each character in the alphabet is a state and bigram probabili- ties are the state transition probabilities. In this context, the variable duration state is used to resolve the segmentation ambiguity among the consecutive characters. Using Arabic handwritten data from two different sources, detailed exper- imental results are described to demonstrate the success of the proposed scheme.
Multi-criteria Fuzzy Clustering Problems Based on Vague Set Theory
Authors: Qingbo Yang, Jinping Li, Weiyu Zhang, Ruiying Gong
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Multi-criteria fuzzy clustering problems are kind of common problems in decision-making and data mining. A method for modeling multi-criteria problems based on vague set theory is used in this paper. Each object in a universe of discourse is represented by a vague set in this model, then similar objects can be clustered into a subgroup after similarity measure between corresponding vague sets. The proposed method can solve the multi-criteria fuzzy clustering problems in a reasonable and reliable way. Key words: multi-criteria fuzzy clustering problem; vague set; truth-membership function; false- membership function
The Design of a Multimedia Protocol Analysis Software Environment
Authors: Tony Tsang, Yong Soo Kim, Richard Lai
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

We have developed a variant of Estelle, called Time- Estelle which is able to express multimedia Quality of Service (QoS) parameters, synchronisation scenarios, and time-dependent and probabilistic behaviours of multimedia protocols. We have developed an approach to verifying a multimedia protocol specified in Time-Estelle. To predict the performance of a multimedia system, we have also de- veloped a method for the performance analysis of a mul- timedia protocol specified in Time-Estelle. However, with- out the support of a software environment to automate the processes, verification and performance analysis methods would be very time-consuming. This paper describes the design of such a software environment.
Functional plasticity in ventral temporal cortex following cognitive rehabilitation of a congenital prosopagnosic
Authors: Joseph M. DeGutis, Shlomo Bentin, Lynn C. Robertson, Mark D'Esposito
Venue: Journal of Cognitive Neuroscience (2007)

We used functional magnetic resonance imaging (fMRI) and electroencephalography (EEG) to measure neural changes associated with training configural processing in congenital prosopagnosia, a condition in which face identification abilities are not properly developed in the absence of brain injury or visual problems. We designed a task that required discriminating faces by their spatial configuration and, after extensive training, prosopagnosic MZ significantly improved at face identification. Event-related potential results revealed that although the N170 was not selective for faces before training, its selectivity after training was normal. fMRI demonstrated increased functional connectivity between ventral occipital temporal face-selective regions (right occipital face area and right fusiform face area) that accompanied improvement in face recognition. Several other regions showed fMRI activity changes with training; the majority of these regions increased connectivity with face-selective regions. Together, the neural mechanisms associated with face recognition improvements involved strengthening early face-selective mechanisms and increased coordination between face-selective and nonselective regions, particularly in the right hemisphere.
Display Strategies for Program Browsing: Concepts and Experiment
Authors: B. Shneiderman
Venue: IEEE Software (1986)

The new, larger display screens can improve program comprehension if the added space is used for mome effective presentation, not just more code or larger type.
Censor Updation during Dynamic Clustering of Hierarchical Censored Production Rules (HCPRs)
Authors: Rekha Kandwal, K. K. Bharadwaj
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

An incremental learning algorithm takes a new piece of information at each learning cycle and tries to revise the theory using the new data. In this paper a cumulative learning methodology, analogous to incremental learning, is suggested for appropriate modification of censor conditions during dynamic clustering of Hierarchical Censored Production Rules (HCPRs). HCPR system is capable of handling trade-off between the precision of an inference and its computational efficiency leading to trade-off between the certainty of a conclusion and its specificity. An HCPR has the form: Decision If Unless Generality Specificity, where censors (exceptions) are assumed to be low-likelihood assertions. Under tight resources, censors can be ignored and decision is true with high likelihood. However, decisions need to be revised if censors are later found to be true. The proposed algorithm appropriately modifies censor conditions at different level of hierarchy thereby removing redundancy and maintains consistency. The resulting knowledge base so obtained is used for the next learning cycle. Examples are given to demonstrate the behaviour of the proposed scheme.
IBFS-HDI: an Effective Resource Searching Model in Database Grid under Pure Unstructured P2P Framework
Authors: Shen Derong, Lv Li-ang, Kou Yue, Li Meifang, Ge Yu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Most grid services have adopted the centralized register and searching mechanism, currently. Those are easily led to single peer failure and access bottleneck. With expanding of the grid's scale, P2P will become one of the primary frameworks of grid. Inspired by combining the grid with P2P technique, we focus on data resource searching mechanism in database grid on pure non-structural P2P framework, and an effective resource searching model(IBFS-HDI) is put forward, in which, a breadth first resource searching mechanism based on schema matching index routing (IBFS) is raised for reducing the routing filiations as earlier as possible and decreasing the number of peers accessed, while hierarchical top-k query and data integration mechanism(HDI) for lessening the data transmission cost and improving the data integration efficiency. Finally, experiments demonstrated the effectiveness of the resource searching model, and database grid with IBFS-HDI can return satisfying results to user rapidly and efficiently.
Building Multicast Controller for Carrier-grade IPTV Service over Ethernet Passive Optical Network
Authors: Juan Wu, YaLing Nie, Hideya Yoshiuchi, Hiroki Ikeda
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Ethernet Passive Optical Network (EPON) is an emerging high-speed access network technology that can provide an ideal transmission platform for high-bandwidth applications such as IPTV (Internet Protocol Television). To deploy the carrier-grade IPTV service, especially HDTV (High Definition TV), it is very essential to construct a controllable multicast architecture for IPTV service over EPON. In this paper, we present a multicast control solution over EPON system to satisfy the demand of the service management and control from the service providers. Furthermore, we successfully develop a multicast controller to perform the multicast control function including managing the eligibility of the subscribers and controlling the delivery of the multicast channels. The evaluation results demonstrate that the multicast controller can not only provide high processing performance but also improve the operation and management ability for the service providers greatly.
Robust adaptive fuzzy controller for nonlinear system with unknown nonlinearities
Authors: Jang-Hyun Park, Gwi-Tae Park
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

This paper describes the design of the robust adaptive fuzzy controller for uncertain nonlinear dynamical systems with unknown nonlinearities. These unknown nonlinearities are approximated by the fuzzy system with a set of fuzzy IF-THEN rules whose parameters are adjusted on-line according to some adaptive laws for the purpose of controlling the output of the nonlinear system to track a given trajectory. The Lyapunov synthesis approach is used to develop a state-feedback adaptive control algorithm based on the adaptive fuzzy model. The key assumption is that the reconstruction errors satisfy certain bounding conditions. The control law consists of two terms. One is the certainty equivalent control and the other is the bounding control. A bounding parameter adaptive law is used to obtain this bounding control. The overall control system guarantees that the tracking error converges in the small neighborhood of zero and that all signals involved are uniformly bounded. The theoretical results are illustrated through a simulation example.
Control of the motion of a disk rolling on a plane curve
Authors: Y. Yavin
Venue: Computers Mathematics with Applications (2007)

This work deals with the control of the motion of a disk rolling without slipping on a curve located in the horizontal plane. The disk's motion is driven by a pedalling torque and by using two overhead rotors. In addition, the case where the disk rolls on a plane curve with its plane vertical to the (X,Y)-plane, is discussed.
The Advancing Technology of Motorola's Microprocessors and Microcomputers
Authors: James Farrell
Venue: IEEE Micro (1984)

Starting with the first five-volt microprocessor in 1975, Motorola has gone on to produce an entire family of midrange microcomputers and peripherals designed for high-speed operation and maximum efficiency. 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
Liquids with vapour bubbles
Authors: Malika Bongué-Boma, Maurizio Brocato
Venue: Computers Mathematics with Applications (2008)

We propose a model for liquids with bubbles calling upon the theory of continua with microstructure. In addition to the contraction and expansion of bubbles due to pressure already included in models available in the literature on such continua, we take into account possible phase changes at the bubble surfaces. To begin with, we consider here the simplest constitutive assumptions for both phases: a perfect incompressible fluid and a perfect gas. Furthermore we assume temperature to be constant and uniform within each bubble and in the fluid next to it. The model introduces the subject of configurational forces that are dual to microvelocities, leading to a generalization of the Rayleigh-Plesset bubble dynamics.
Pattern rewriting for efficient search in partial-order event data
Authors: Matthew Nichols, David Taylor
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

When working with large sets of partial-order event data, typically collected from the execution of a distributed application, it is often desirable to search for specific patterns of events within this data. Such pattern matching must account for attributes on individual events as well as relationships between events and sets of events. In this paper, we propose a method for transforming complex hierarchical patterns into simpler, flattened patterns. This new way of expressing patterns eliminates the need for a costly convex-closure operation at each step in the search process. It also facilitates further optimizations such as re-ordering of pattern elements.
Unwarping scanned image of Japanese/English documents
Authors: Ali Zandifar
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We present methods for eliminating or reducing the distortion in a scanned image. Aspects of the present paper allow for the automatic pruning, de-skewing, and unwarping of an image using boundary document layout information. Here, two dominant top/down baselines are selected, in part, by examining the letter spatial locations on boundary baselines rather than examining the entire document layout. It shall be noted that present method is robust enough to handle many types of content, including different languages: Japanese and English, as well as documents with different layouts. The algorithm is applied to images obtained from bound documents and flat documents.
Multi-core + multi-tasking = multi-opportunity?
Authors: Karl Nyberg
Venue: ACM SIGAda Ada Letters (2007)

In this paper we look at the opportunity provided by the introduction of multicore chips to leveraging Ada's multitasking capabilities, with an eye to expanding the influence of Ada in this environment. The Sun Microsystems Sun Fire T1000 running Solaris is used as a platform for investigation of Ada in a multicore environment. Some sample applications are described and evaluated. Guidance on developing multi-tasking applications is also given. Opportunities for the Ada community to leverage this hardware shift to expand Ada's scope of application are presented.
Using trace sampling techniques to identify dynamic clusters of classes
Authors: Philippe Dugerdil
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

In dynamic analysis (i.e. execution trace analysis), an important problem is to cope with the volume of data to process. However, in the literature, no definitive solution has yet been proposed. Generally, the techniques start by compressing the execution trace before proceeding with the analysis. In this paper we propose a way to process the uncompressed execution trace using a sampling technique. Then, we present the concept of temporally omnipresent class that is the analogy of the "noise" in signal processing. During analysis, the omnipresent classes can be filtered out to concentrate only on relevant ones. Next, we present the extension of our sampling technique to the dynamic clustering of classes. This is a way to recover the components of a legacy system. We finally show the application of this approach to a medium size industrial software system, as well as the tool that supports it. As a conclusion, we suggest that our noise reduction and clustering techniques are both efficient and scalable.
Towards Feature Fusion for Human Identification by Gait
Authors: Shi Chen, Tianjun Ma, Laicang Dong
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we propose a statistical gait feature fusion approach for human recognition by gait. First, we produce a gait period estimation function by converting the contour of silhouette in specific regions into an 1D signal, and divide each silhouette sequence into cycles. With a novel shape descriptor while retaining translation, scale and rotation invariance, a statistical feature extraction method is used for learning gait features from individual frame and consecutive frames, respectively. Features learned from individual frame characterize human silhouette properties, and features learned from consecutive frames describe dynamic properties of human motion. Next, we employ Jeffrey divergence and dynamic time warping for measuring the similarity between test and reference sequences. To improve the recognition performance, a fusion rule on silhouette and dynamic gait features is developed. Experimental results show that recognition performance achieved by the proposed feature fusion approach is better than that achieved by individual silhouette or dynamic feature classification approaches, and better than existed methods.
Computing Eigenface from Edge Images for Face Recognition Based on Hausdorff Distance
Authors: Huachun Tan, Yu-Jin Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The different face regions have different degrees of importance for face recognition. In previous Hausdorff distance measures for face recognition, such as Spatially Eigen-Weighted Hausdorff distance (SEWHD) in which the weighting function is computed from grayscale images. However, Hausdorff distance is a measure for two binary point sets, not for grayscale point sets. Based on our previous work on Weighted Hausdorff distance (EFWHD) for face localization, a new weighting function of Hausdorff distance measure termed Edge Eigenface Weighted Hausdorff distance (EEWHD) is proposed for face recognition in this paper. The weighting function, which reflects the discriminative properties of face edge images effectively, is based on the eigenface of face edge images, not the eigenface of grayscale images in SEWHD, nor the edge points appearing frequency in EFWHD. The weighted Hausdorff distance Experimental results show the new method achieves higher recognition rate comparing with previous Hausdorff distance measures.
A Module for BiST of CMOS RF Receivers
Authors: Kay Suenaga, Rodrigo Picos, Sebastià Bota, Miquel Roca, Eugeni Isern, Eugeni García
Venue: Journal of Electronic Testing: Theory and Applications (2007)

A module to perform a built-in self-test in CMOS RF receivers is presented. The module is associated with a test strategy consisting of measuring the main performance parameters of the single building blocks individually. Circuitry overhead, however, is kept low by using some blocks as part of the test set-up and reusing them. The test overhead has also been reduced by replacing direct determination of performance parameters with their estimation. The test methodology has been applied to a mixer in the first down conversion stage of a GSM receiver, estimating its conversion gain, 1dB compression and third-order interception points. Using the output of the IF amplifier as the only testing point, the rms errors in the estimation of the above mentioned parameters are 1.5, 3.0 and 2.7%, respectively.
An XOR-based erasure-recovered algorithm for tolerating double disk failure in disk array systems
Authors: Chih-Shing Tau
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper proposes an efficient erasure-recovered algorithm based on parity placement scheme, called Horizontal-Oblique Parity (HOP), for protecting against double disk failures in RAID-5 disk array systems. HOP keeps all data unencoded, and uses only exclusive-or (XOR) operations to compute parity. HOP is provably near optimal in computational complexity, both during encoding and reconstruction. It is optimal in the amount of redundant information stored and is sub-optimal in its accessing. HOP works within a single stripe of blocks of sizes normally used by file systems, databases, and disk arrays.
Relational Blocks: A Visual Dataflow Language for Relational Web-Applications
Authors: Avraham Leff, James T. Rayfield
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Many web-applications can be characterized as "relational". In this paper we show that developers can greatly benefit from Relational Blocks, a visual, domain-specific, dataflow language that is designed to facilitate the construction of such web-applications. We define the Relational Blocks visual language, discuss our WebRB implementation, and show how WebRB is used to construct non-trivial web-pages.
A Theoretical Framework for CustomizableWeb Services Description, Discovery and Composition
Authors: Yacine Sam, Omar Boucelma
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

In this paper we are interested in offering customizable Web services : we present a theoretical framework for customizable Web services description, discovery and composition. In our approach, each Web service is described at a high level of abstraction and can be seen as a "black box" labeled by its name and input/output parameters. Complementary to this formalism, we define a set of mechanisms for customizable Web services discovery and composition.