ppxscal/embedding_network huggingface dataset:
Multi-objective query processing for database systems
Authors: Wolf-Tilo Balke, Ulrich Güntzer
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal result sets (skyline queries) are already common for a variety of applications. Specialized algorithms using either paradigm can avoid naïve linear database scans and thus improve scalability. However, these paradigms are only two extreme cases of exploring viable compromises for each user's objectives. To find the correct result set for arbitrary cases of multi-objective query processing in databases we will present a novel algorithm for computing sets of objects that are nondominated with respect to a set of monotonic objective functions. Naturally containing top k and skyline retrieval paradigms as special cases, this algorithm maintains scalability also for all cases in between. Moreover, we will show the algorithm's correctness and instance-optimality in terms of necessary object accesses and how the response behavior can be improved by progressively producing result objects as quickly as possible, while the algorithm is still running.
Production database systems: making them easy is hard work
Authors: David Campbell
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Enterprise capable database products have evolved into incredibly complex systems, some of which present hundreds of configuration parameters to the system administrator. So, while the processing and storage costs for maintaining large volumes of data have plummeted, the human costs associated with maintaining the data have continued to rise. In this presentation, we discuss the framework and approach used by the team who took Microsoft SQL Server from a state where it had several hundred configuration parameters to a system that can configure itself and respond to changes in workload and environment with little human intervention.
A fuzzified neural fuzzy inference network for handling both linguistic and numerical information simultaneously
Authors: Chia-Feng Juang, Chun-I Lee
Venue: Neurocomputing (2007)

A fuzzified Takagi-Sugeno-Kang (TSK)-type neural fuzzy inference network (FTNFIN) that is capable of handling both linguistic and numerical information simultaneously is proposed in this paper. FTRNFN solves the disadvantages of most existing neural fuzzy systems which can only handle numerical information. The inputs and outputs of FTNFIN may be fuzzy numbers with any shapes or numerical values. Structurally, FTNFIN is a fuzzy network constructed from a series of fuzzy if-then rules with TSK-type consequent parts. The @a-cut technique is used in input fuzzification and consequent part computation, which enables the network to simultaneously handle both numerical and linguistic information. There are no rules in FTNFIN initially since they are constructed on-line by concurrent structure and parameter learning. FTNFIN is characterized by small network size and high learning accuracy, and can be applied to linguistic information processing. The network has been applied to the learning of fuzzy if-then rules, a mathematical function with fuzzy inputs and outputs, and truck backing control problem. Good simulation results are achieved from all these applications.
A Numerical Algorithm for Identifying Spread Functions of Shift-Invariant Imaging Systems
Authors: M. P. Ekstrom
Venue: IEEE Transactions on Computers (1973)

Numerical optimization techniques are applied to the identification of linear, shift-invariant imaging systems in the presence of noise. The approach used is to model the available or measured image of a real known object as the planar convolution of object and system-spread function and additive noise. The spread function is derived by minimization of a spatial error criterion (least squares) and characterized using a matric formalism. The numerical realization of the algorithm is discussed in detail; the most substantial problem encountered being the calculation of a vector-generalized inverse. This problem is avoided in the special case where the object scene is taken to be decomposable.
Exemplar Longest Common Subsequence
Authors: Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stephane Vialette
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the union of two disjoint sets of symbols, a set of mandatory symbols and a set of optional symbols. We show that different versions of the problem are APX-hard even for instances with two sequences. Moreover, we show that the related problem of determining the existence of a feasible solution of the Exemplar Longest Common Subsequence of two sequences is NP-hard. On the positive side, we first present an efficient algorithm for the ELCS problem over instances of two sequences where each mandatory symbol can appear in total at most three times in the sequences. Furthermore, we present two fixed-parameter algorithms for the ELCS problem over instances of two sequences where the parameter is the number of mandatory symbols.
Analysis of the Signal Reliability Measure and an Evaluation Procedure
Authors: I. Koren
Venue: IEEE Transactions on Computers (1979)

The classical reliability measure of digital circuits, known as functional reliability, assumes that the circuit fails whenever a fault is present in it. It has long been known that this reliability measure is overly pessimistic since digital circuits may produce correct output signals even when some faults are present in them. A different reliability measure, known as signal reliability, is the probability that the circuit output is correct. This reliability measure is analyzed first and compared to the functional reliability measure. Next, a new procedure for the evaluation of the signal reliability measure is presented.
Implementation of a Real Time Programmable Encoder for Low Density Parity Check Code on a Reconfigurable Instruction Cell Architecture
Authors: Zahid Khan, Tughrul Arslan
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper presents a real time programmable irregular Low Density Parity Check (LDPC) Encoder as specified in the IEEE P802.16E/D7 standard. The encoder is programmable for frame sizes from 576 to 2304 and for five different code rates. H matrix is efficiently generated and stored for a particular frame size and code rate. The encoder is implemented on Reconfigurable Instruction Cell Architecture (RA) which has recently emerged as an ultra low power, high performance, ANSI-C programmable embedded core. Different general and architecture specific optimization techniques are applied to enhance the throughput. With RA, a throughput from 10 to 19 Mbps has been achieved.
A parametrisable system for physically plausible surface inspection
Authors: Carl-Henrik Grunditz, Lambert Spaanenburg
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

Visual quality assurance techniques focus on the detection and qualification of abnormal structures in the image of an object. The features of abnormality are extracted through image mining, whereupon classification is performed on characteristic combinations. Many techniques for feature extraction have been proposed, but the feed-forward neural network is seldom utilized despite its popularity in other application areas. Based on the wide experience base, this paper shows how a multi-tier feed-forward network can be constructed to model detectable peaks using only the physical properties of the image domain. This generic architecture can easily be adapted for different applications, as in metal plate inspection and protein detection, with mean error rate below 5%.
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
Authors: Adam Biltcliffe, Michael Dales, Sam Jansen, Thomas Ridge, Peter Sewell
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process ofa new protocol, in a close collaboration between systems and theory researchers. The protocol is a Media Access Control (MAC)protocol for the SWIFT optical network, which uses optical switching and wavelength striping to provide very high bandwidthpacket-switched interconnects. The use of optical switching (and the lack of optical buffering) means that the protocol mustcontrol the switch within hard timing constraints. We use higher-order logic to express the protocol design, in the general-purposeHOL automated proof assistant. The specification is thus completely precise, but still concise, readable, and without accidentaloverspecification. Further, we test conformance between the specification and two implementations of the protocol: an NS-2simulation model and the VHDL code of the network hardware. This involves: (1) proving, within HOL, that the specificationis equivalent to an algorithmically-checkable version; (2) using automatic code-extraction to generate a testing oracle; and(3) applying that oracle to traces of the implementation. This design-time use of rigorous methods has resulted in a protocolthat is better specified and more correct than it would otherwise be, with relatively little effort.
SHARP2
Authors: Yoichi Murakami, Susan Jones
Venue: Bioinformatics (2006)

Summary: SHARP2 is a flexible web-based bioinformatics tool for predicting potential protein–protein interaction sites on protein structures. It implements a predictive algorithm that calculates multiple parameters for overlapping patches of residues on the surface of a protein. Six parameters are calculated: solvation potential, hydrophobicity, accessible surface area, residue interface propensity, planarity and protrusion (SHARP2). Parameter scores for each patch are combined, and the patch with the highest combined score is predicted as a potential interaction site. SHARP2 enables users to upload 3D protein structure files in PDB format, to obtain information on potential interaction sites as downloadable HTML tables and to view the location of the sites on the 3D structure using Jmol. The server allows for the input of multiple structures and multiple combinations of parameters. Therefore predictions can be made for complete datasets, as well as individual structures. Availability: Contact: s.jones@sussex.ac.uk
Adaptive aggregation on chip multiprocessors
Authors: John Cieslewicz, Kenneth A. Ross
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The recent introduction of commodity chip multiprocessors requires that the design of core database operations be carefully examined to take full advantage of on-chip parallelism. In this paper we examine aggregation in a multi-core environment, the Sun UltraSPARC T1, a chip multiprocessor with eight cores and a shared L2 cache. Aggregation is an important aspect of query processing that is seemingly easy to understand and implement. Our research, however, demonstrates that a chip multiprocessor adds new dimensions to understanding hash-based aggregation performance---concurrent sharing of aggregation data structures and contentious accesses to frequently used values. We also identify a trade off between private data structures assigned to each thread versus shared data structures for aggregation. Depending on input characteristics, different aggregation strategies are optimal and choosing the wrong strategy can result in a performance penalty of over an order of magnitude. We provide a thorough explanation of the factors affecting aggregation performance on chip multiprocessors and identify three key input characteristics that dictate performance: (1) average run length of identical group-by values, (2) locality of references to the aggregation hash table, and (3) frequency of repeated accesses to the same hash table location. We then introduce an adaptive aggregation operator that performs lightweight sampling of the input to choose the correct aggregation strategy with high accuracy. Our experiments verify that our adaptive algorithm chooses the highest performing aggregation strategy on a number of common input distributions.
Elastic Components: Addressing Variance of Quality Properties in Components
Authors: George Kakarontzas, Panagiotis Katsaros, Ioannis Stamelos
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

The quality properties of a software component, although verified by the component developer and even certified by a trusted third-party, might very well be inappropriate for the requirements of a new system. This is what we call the quality mismatch problem: the mismatch between the quality requirements of a new system with the quality properties exhibited by the components that we want to use for its development. This work contributes to the understanding of the quality mismatch problem between component properties and component-based systems requirements. To solve this problem we introduce the concept of elastic components. An elastic component is an open-ended hierarchy of the same pure component with variants that differ between them to the quality properties that they exhibit. We present a quality-driven design approach that can be effectively applied for the design and implementation of elastic components.
Time Series Modeling Based on ITO Algorithm
Authors: Wenyong Dong, Yuanming Hu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The ITO algorithm, which is based on the Ito process, is a new intelligent meta-heuristic algorithm. Two new operators, named excursion ratio and fluctuate ratio, are introduced in the algorithm. The two operators integrate Einsten's displacement equation, which describes Brown- ian motion. This strategy can effectively deals with contra- dictions between the 'exploration' and 'exploitation'. We study the ITO algorithm by using it to model the time series, and the influence of parameters is also studied.
Analytical Queueing Models
Authors: J. Spragins
Venue: Computer (1980)

Increased use of analytical performance models can be attributed, in part, to a very simple fact: they work. 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
Gender-Specific Approaches to Developing Emotionally Intelligent Learning Companions
Authors: Winslow Burleson, Rosalind W. Picard
Venue: IEEE Intelligent Systems (2007)

A 2 × 2 experiment investigated the effect of elements of an affective learning companion's emotional intelligence on 76 participants aged 11 to 13 during a challenging problem-solving activity. The experiment contrasted use of an agent showing sensor-driven nonverbal mirroring with one showing prerecorded nonverbal interactions and, separately, affective support versus task support interventions. The experiment examined the effect of emotional intelligence, in terms of the presence of active listening, delivery of appropriate interventions, and type of nonverbal interactions, on the participants' experience, including frustration, perseverance, intrinsic motivation, and meta-affective skill. The hypothesized effects of interacting with a more versus less emotionally intelligent agent didn't hold true at the group level; however, the authors found significant gender differences. The results emphasize the importance of appropriately coordinating the relationships between affect- and task-based intervention and nonverbal mirroring with respect to the affective state of girls and boys. This article is part of a special issue on intelligent educational systems.
Visualizing and Analyzing the Mona Lisa
Authors: Louis Borgeat, Guy Godin, Philippe Massicotte, Guillaume Poirier, François Blais, J. -Angelo Beraldin
Venue: IEEE Computer Graphics and Applications (2007)

Size and scale issues present a complexity problem in visualizing detailed 3D models built from sensor data. A model of Leonardo da Vinci's Mona Lisa, with its thin pictorial layer, illustrates the need for intuitive real-time processing tools that are seamlessly integrated with a multiresolution visualization environment.
Completeness of Proof Systems for Equational Specifications
Authors: D. B. MacQueen
Venue: IEEE Transactions on Software Engineering (1985)

Contrary to popular belief, equational logic with induction is not complete for initial models of equational specifications. Indeed, under some regimes (the Clear specification language and most other algebraic specification languages) no proof system exists which is complete even with respect to ground equations. A collection of known results is presented along with some new observations.
Ontology evaluation using wikipedia categories for browsing
Authors: Jonathan Yu, James A. Thom, Audrey Tam
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Ontology evaluation is a maturing discipline with methodologies and measures being developed and proposed. However, evaluation methods that have been proposed have not been applied to specific examples. In this paper, we present the state-of-the-art in ontology evaluation - current methodologies, criteria and measures, analyse appropriate evaluations that are important to our application - browsing in Wikipedia, and apply these evaluations in the context of ontologies with varied properties. Specifically, we seek to evaluate ontologies based on categories found in Wikipedia.
Bright light therapy in focus: lamp emission spectra and ocular safety
Authors: Charlotte E. Remé, Pascal Rol, Knut Grothmann, Helmut Kaase, Michael Terman
Venue: Technology and Health Care (1996)

In recent years, bright light treatment of seasonal affective disorder (SAD), recurrent depressions in fall and winter, has been discovered. Newer applications include circadian sleep phase disorder, shift work and jet lag. Apart from creating the visual signal, light can modify retinal structure and physiology. UV and visible light lead to distinct lesions of ocular tissues under certain experimental und naturalistic conditions. In light therapy, a large variety of fixtures is used but the spectral emission of lamps is mostly unknown to the user and clinician leading to the potential hazard of ocular lesions. Therefore, we have analyzed a wide selection of light sources commonly used for treatment. We measured the spectral emission and calculated irradiant doses for several light therapy regimens. Based on these measurements, potential hazards are analyzed, physiological mechanisms of light action are discussed and safety measures for bright light therapy are proposed. They include recommendations for lamps devoid of damaging spectral emissions and standardized therapy fixtures, ophthalmological monitoring of patients with eye diseases and control by optometrists for patients with healthy eyes who are likely to undergo light treatment for extended periods.
Monitoring Transient Errors in Sequential Circuits
Authors: Ramashis Das, John P. Hayes
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Transient errors have become a major concern due to advances in technology scaling. Existing detection techniques for these errors, such as dual modular redundancy (DMR), have very high area overhead as they typically target all possible faults. In this paper, we analyze the effect of transient faults on sequential circuit behavior. We introduce the notion of transition errors (TEs) to capture the critical errors caused by both transient and permanent faults. We also present an error-monitoring scheme aimed specifically at TEs. Finally we describe experiments using the MCNC synthesis benchmark suite which show that, using the proposed monitoring scheme, all TEs can be detected with about 36% area overhead, which is significantly less than alternative approaches like DMR.
Design of an Aspect-Based Framework to Improve the Dynamic Management of RFID Middleware
Authors: Hee Joung Hwang, Jin Tak Choi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In recent years, the ALE (Application Level Event) by EPCglobal leads the standard of RFID middleware and that represents minimal interfaces and extension points in order to independently operate it in system infrastructures. However, the extension in functions using the extension point has not standardized in the present time. Also, it demonstrated certain problems that require new codes or modifications to apply the function to the system in a system, which is being operated. This paper proposes a dynamic ALE middleware framework by introducing an AOP (Aspect Oriented Programming) method to solve such problems and designs aspects to implement the proposed framework. The middleware framework and aspect designed in this study are able to provide dynamic functions and that solve the difficulty in the maintaining and management of the conventional ALE-based middleware according to their functional extensions. Also, it makes possible to add new functions as a standardized manner.
A User-Centric Pervasive Computing Services Model for Medical and Health-care
Authors: Zhenmin Zhu, Xiaoli Su, Faqun Jiang, Jintao Li, Jian Ye
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The hospital and the health-care center of a community, as persons' life-care and health-care settings, need to provide more and better services for patients or residents. Establishing Electronic Medical Record (EMR) system is the necessity in hospital, and providing pervasive services is the further trend. Based on the EMR database, this paper presents a usercentric Pervasive Computing Service Model (PCSM) that coordinates application services over network and heterogeneous platforms nearby users to form a service environment for medical and health-care. It also provides doctors with legacy information service support without modification to exiting information system based on the PCSM.
A Reduced High-Level-Language Instruction Set
Authors: Peter Schulthess
Venue: IEEE Micro (1984)

The Object Pascal Architecture provides 22 simple stack instructions which enable straightforward compilation of Pascal-like languages.
Mining Frequent Itemsets Using a Pruned Concept Lattice
Authors: Xuegang Hu, Wei Liu, Dexing Wang, Xindong Wu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Mining frequent itemsets is a crucial step in association rule mining. However, most algorithms mining frequent itemsets scan databases many times, which decreases the efficiency. In this paper, the relationship between a concept lattice and frequent itemsets is discussed, and the model of pruned concept lattice (PCL) is introduced to represent frequent itemsets in a given database, and the scale of frequent itemsets is compressed effectively. An algorithm for mining frequent itemsets based on PCL is proposed, which prunes infrequent concepts timely and dynamically during the PCL's construction according to the Apriori property. The efficiency of the algorithm is demonstrated with experiments.