ppxscal/embedding_network huggingface dataset:
Implementing XQuery 1.0: the Galax experience
Authors: Mary Fernández, Jérôme Siméon, Byron Choi, Amélie Marian, Gargi Sur
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Galax is a light-weight, portable, open-source implementation of XQuery 1.0. Started in December 2000 as a small prototype designed to test the XQuery static type system, Galax has now become a solid implementation, aiming at full conformance with the family of XQuery 1.0 specifications. Because of its completeness and open architecture, Galax also turns out to be a very convenient platform for researchers interested in experimenting with XQuery optimization. We demonstrate the Galax system as well as its most advanced features, including support for XPath 2.0, XML Schema and static type-checking. We also present some of our first experiments with optimization. Notably, we demonstrate query rewriting capabilities in the Galax compiler, and the ability to run queries on documents up to a Gigabyte without the need for preindexing. Although early versions of Galax have been shown in industrial conferences over the last two years, this is the first time it is demonstrated in the database community.
Hybrid Intrusion Detection System for Complicated Network
Authors: Baojun Zhang, Xuezeng Pan, Jiebing Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The current network is complicated due to the high- throughput and the multiformity of actions. A hybrid intru- sion detection system (HIDSFCN) is proposed in this study to satisfy the current network. It combines the advantages of all kinds of IDS and put forwards our own solvents to those key problems in current research. Experiment results demonstrate that our HIDSFCN is of high performance and good practicability.
RandSys: Thwarting Code Injection Attacks with System Service Interface Randomization
Authors: Xuxian Jiang, Helen J. Wangz, Dongyan Xu, Yi-Min Wang
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

Code injection attacks are a top threat to today's Internet. With zero-day attacks on the rise, randomization techniques have been introduced to diversify software and operation systems of networked hosts so that attacks that succeed on one host cannot succeed on others. Two most notable system-wide randomization techniques are Instruction Set Randomization (ISR) and Address Space Layout Randomization (ASLR). The former randomizes instruction set for each process, while the latter randomizes the memory address space layout. Both suffer from a number of attacks. In this paper, we advocate and demonstrate that by combining ISR and ASLR effectively, we can offer much more robust protection than each of them individually. However, trivial combination of both schemes is not sufficient. To this end, we make the key observation that system call instructions matter the most to attackers for code injection. Our system, RandSys, uses system call instruction randomization and the general technique of ASLR along with a number of new enhancements to thwart code injection attacks. We have built a prototype for both Linux and Windows platforms. Our experiments show that RandSys can effectively thwart a wide variety of code injection attacks with a small overhead.
Telescopic vector composition and polar accumulated motion residuals for feature extraction in Arabic sign language recognition
Authors: T. Shanableh, K. Assaleh
Venue: Journal on Image and Video Processing (2007)

This work introduces two novel approaches for feature extraction applied to video-based Arabic sign language recognition, namely, motion representation through motion estimation and motion representation through motion residuals. In the former, motion estimation is used to compute the motion vectors of a video-based deaf sign or gesture. In the preprocessing stage for feature extraction, the horizontal and vertical components of such vectors are rearranged into intensity images and transformed into the frequency domain. In the second approach, motion is represented through motion residuals. The residuals are then thresholded and transformed into the frequency domain. Since in both approaches the temporal dimension of the video-based gesture needs to be preserved, hidden Markov models are used for classification tasks. Additionally, this paper proposes to project the motion information in the time domain through either telescopic motion vector composition or polar accumulated differences of motion residuals. The feature vectors are then extracted from the projected motion information. After that, model parameters can be evaluated by using simple classifiers such as Fisher's linear discriminant. The paper reports on the classification accuracy of the proposed solutions. Comparisons with existing work reveal that up to 39% of the misclassifications have been corrected.
Test-Based Specifications of Components and Systems
Authors: Dick Hamlet
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Several program-analysis schemes now make unusual use of information derived from execution sampling. From finite test sets these techniques derive measures with wider meaning, which can then be exploited in novel ways. We call test information used beyond its actual limitations a test-based specification. The idea is quite different from the usual software specification, which is an a priori statement of what a program should do. Rather, a test-based specifi- cation is an empirical approximation to what a program ac- tually does do. The great virtue in analysis using test-based specifications is that (in contrast to the usual software spec- ifications) test-based analysis is decidable and automatic. A test-based specification system for component-based software development (CBSD) has been implemented over the past five years, along with an extension of fundamen- tal testing theory to precisely describe its properties. The CBSD tools provide an ideal context for experiments to study test-based specification, providing insights into sub- domain testing, composition of test results, and especially the role that program persistent state plays in testing and analysis. This paper describes the CBSD theory and tools, lists insights gained, and suggests new ways to think about and practice testing using test-based specifications. Keywords: Component/system testing theory, test- based specification, persistent state
Modeling Expressive Wrinkles of Face For Animation
Authors: Ming Li, BaoCai Yin, DeHui Kong, XiaoNan Luo
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Vivid facial expressions contribute greatly to the visual realism of 3D face models. However, it is often tedious and expensive to model facial details which are authentic and real-time. In this paper, a simple and functional approach for modeling dynamic wrinkles of face is introduced. Started with structured facial mesh, we divide face region into some wrinkle subregions, and create some wrinkle lines with our algorithm in these subregions. Then, some key nodes are labeled on the facial mesh, these key nodes affect wrinkle lines if wrinkle lines locate the subregions that abut on the key nodes. With our algorithm, motion of wrinkle lines is produced by movement of key nodes. Consequently, wrinkle lines drive facial mesh to model expressive wrinkles. In this way, we create dynamic and functional expressive wrinkles of individuals available to date and demonstrate their use in facial animation.
Remote Network Controller Design Based on Fully Tuned RBF Neural Network
Authors: Yun-an Hu, Jing Li, Bin Zuo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Considering a class of networked control systems (NCS) with generalized uncertainty and nonlinearities, a control strategy based on fully tuned RBF neural network(NN) feedback linearization and remote state feedback control is presented in the paper. Firstly, the weight W, center value \phi and incidence \sigma of the fully tuned RBF NN are designed to compensate the nonlinearities and generalized uncertainties. Then the state feedback control is utilized to control NCS with time-varying delay, and the stability of the closed-loop NCS is effectively guaranteed by Lyapunov stability theory. Finally, the simulation results show that this method is very effective.
A Proxy Blind Signature Scheme Based on Elliptic Curve with Proxy Revocation
Authors: Liu Wenyuan, Tong Feng, Luo Yong-An, Zhang Feng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Proxy signature allows an original signer to delegate his signing capacity to a proxy signer. Then the proxy signer creates a signature on behalf of the original singer. When a receiver verifies proxy signature, he verifies the signature itself and original signer's delegation together. In this paper, the present existent problem of proxy revocation is analyzed. Two drawbacks of the Wang's proxy signature scheme based on elliptic curve are given. Then an improved scheme is presented. On the base of this improved scheme, a secure proxy blind signature scheme based on elliptic curve with proxy revocation is proposed by applying Abe-Okamoto partially blind signature. By embedding non-blind time-stamp in the signatures, the original signer can revoke delegation whenever necessary and all valid proxy signatures generated earlier can longer be verified. Besides having the basic properties of the proxy signature, the proposed schemes solve proxy revocation without trustee, and prevent public key substitution attack, original signer's forgery as well as proxy misuse.
Eye-tracking for efficient database labelling: Applications to automatic analysis of colonoscopy video
Authors: Fernando Vilarino, Gerard Lacey
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

In this paper we present our preliminary results in the automatic analysis of colonoscopy video using eye-tracking. We propose that eye-tracking can be successfully applied to solve different problems in computer assisted colonoscopy, such as database labelling, expertise assessment and abnormality detection. We provide results in these three areas, including a machine learning-based system for colon cancer detection using data generated with eye-tracking.
A Ranking-Based Evolutionary Algorithm for Constrained Optimization Problems
Authors: Yibo Hu, Yiu-ming Cheung, Yuping Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In constrained optimization problems, evolutionary algorithms often utilize a penalty function to deal with constraints, which is, however, difficult to control the penalty parameters. This paper therefore presents a new constraint handling scheme. It adaptively defines an extended-feasible region that includes not only all feasible solutions, but some infeasible solutions near the boundary of the feasible region. Furthermore, we construct a new fitness function based on stochastic ranking, and meanwhile propose a new crossover operator that can produce more good individuals in general. Accordingly, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations show the efficiency of the proposed algorithm on four benchmark problems.
A Leaf Image Retrieval Scheme Based on Partial Dynamic Time Warping and Two-Level Filtering
Authors: Yoon-Sik Tak
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper, we propose an efficient leaf image retrieval scheme based on its shape feature. To represent leaf shape, we first derive a distance curve from each leaf using distances between its center and the points along the contour. Next, for the storage and matching purpose, we extract a set of Fourier Coefficients (FCs) from the curve. Typically, a set of FCs fails to restore the original curve completely. In order to reduce the difference between original and restored curves, we divide whole curve into several partitions such that each partition has a small difference with the original curve. For image matching, we propose a Partial Dynamic Time Warping (PDTW) algorithm. We also propose a categorization scheme using the number of unit curves for filtering purpose. In the experiment, we show that our proposed scheme improved both efficiency and accuracy of leaf image retrieval.
State Description Techniques Applied to Industrial Machine Control
Authors: J. V. Landau
Venue: Computer (1979)

A state language, useful for describing the control software for appliances and industrial machines, has been used with a programmable industrial sewing machine, yielding benefits much like those of structured programming. 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
Estimating Error Propagation Probabilities with Bounded Variances
Authors: Hossein Asadi, Mehdi B. Tahoori, Chandra Tirumurti
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Fast and accurate estimation of soft error rate (SER) is essential in obtaining the reliability parameters of a digital system and cost-effective reliability improvements. In this paper we present an approach to obtain uncertainty bounds on the error propagation probability (EPP) values used in SER estimation based on an analytical approach. We demonstrate how we can compute EPP values and their uncertainty bounds (variances) by examining the logic gates in a topological order. Comparison of this method with the Monte-Carlo (MC) fault simulation approach confirms the accuracy of the presented technique for both the computed EPP values and uncertainty bounds. Also, this technique is 3-5 orders of magnitude faster than fault simulation.
An Estimation Methodology for Designing Instruction Cache Memory of Embedded Systems
Authors: N. Kroupis, S. Mamagkakis, D. Soudris
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

The design exploration procedure of DSP systems using simulation tools is a time-consuming process, even for low complexity applications. The main goal of the design methodology introduced in this paper is to provide fast and accurate estimates of the number of (-micro) instructions and the instruction cache miss rate of DSP applications implemented on a programmable embedded platform, during the early design phases. Specific information is extracted from both the high-level code description (C code) of the DSP application considered and its corresponding assembly code, without carrying out any kind of simulation. The proposed methodology requires only a single execution of the application in a general-purpose processor and uses only the assembly code of the targeted embedded processor. In order to automate the estimation procedure, a new software tool, which implements the proposed methodology, has been developed. Using nine real-life applications from different domains of the DSP field, it has been proved that with the proposed methodology the number of instructions and the miss rate of instruction cache can be estimated with high accuracy (>95%). Furthermore, the required time cost is much smaller (orders of magnitude) than the simulation-based approaches
Weighting Method for the Determination of the Irredundant Set of Prime Implicants
Authors: V. Bubenik
Venue: IEEE Transactions on Computers (1972)

A complete or restricted set of prime implicants (PI's) can cover the terms of the switching function with more or less redundancy. In order to find an irredundant form from the set of PI's, it is necessary to choose those PI's which contribute most effectively towards the strict minimum sum. The criterion for the right choice of the PI's is their weight from the point of view of their cost and their ability to cover a maximum number of switching terms. This criterion assures the simplicity of the switching circuit and helps to increase its reliability. The PI's with the highest weight are chosen.
Mapping model with inter-array memory sharing for multidimensional signal processing
Authors: Ilie I. Luican, Hongwei Zhu, Florin Balasa
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The storage requirements in data-intensive signal processing systems (including applications in video and image processing, artificial vision, medical imaging, real-time 3-D rendering, advanced audio and speech coding) have an important impact on both the system performance and the essential design parameters -- the overall power consumption and chip area. This is due to the significant amount of data that must be stored during the execution of the algorithmic specification, as well as due to the amount of data transfers to/from large, energy-consuming, off-chip data memories. This paper addresses the problem of efficiently mapping the multidimensional signals from the algorithmic specification of the system into the physical memory. Different from all the previous mapping models that aim to optimize the memory sharing between the elements of a same array, creating separate windows in the physical memory for distinct arrays, this proposed mapping model is the first one to exploit the possibility of memory sharing between different arrays. As a consequence, this signal-to-memory mapping approach yields significant savings in the amount of data storage resulted after mapping.
Efficiently Querying Large XML Data Repositories: A Survey
Authors: Gang Gou, Rada Chirkova
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Extensible Markup Language (XML) is emerging as a de facto standard for information exchange among various applications on the World-Wide Web. There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently. One important problem in XML query processing is twig pattern matching , that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query pattern Q. In this survey we review, classify, and compare major techniques for twig pattern matching.Specifically, we consider two classes of major XML queryprocessing techniques: the relational approach and the native approach. The relational approach directly utilizes existing relational database systems to store and query XML data, which enables the use of all important techniques that have been developed for relational databases, while in the native approach, specialized storage and query-processing systems tailored for XML data are developed from scratch to further improve XML query performance. As implied by existing work, XML data querying and management are developing in the direction of integrating the relational approach with the native approach, which could result in higher query-processing performance and also significantly reduce system-reengineering costs.
Design, fabrication, and preliminary characterization of a novel MEMS bionic vector hydrophone
Authors: Chenyang Xue, Shang Chen, Wendong Zhang, Binzhen Zhang, Guojun Zhang, Hui Qiao
Venue: Microelectronics Journal (2007)

According to the auditory principle of fish's lateral line organ, a novel microelectromechanical systems (MEMS) bionic vector hydrophone used for obtaining vector information of underwater sound field is introduced in this paper. It is desirable that the application of MEMS-based piezoresistive effect and bionics structure may improve the low-frequency sensitivity of the vector hydrophone as well as its miniaturization. The bionic structure consists of two parts: high-precision four-beam microstructure and rigid plastic cylinder which is fixed at the center of the microstructure. The piezoresistor located at the beam is simulated to the hair cell of lateral line and the rigid plastic cylinder is simulated to stereocilia. When the plastic cylinder is stimulated by sound, the piezoresistor transforms the resultant strain into a differential voltage output signal via the Wheatstone bridge circuit. Microfabrication technology has been employed for the fabrication of the microstructure and measurement results are given. The experiment results show that the receiving sensitivity of the hydrophone is -197.7dB (0dB=1V/@mPa). The novel hydrophone not only possesses satisfactory directional pattern as well as miniature structure, but also has good low-frequency characteristics, and satisfies the requirements for low-frequency acoustic measurement.
An Iterative Cell Switch Design for Hybrid Redundancy
Authors: D. P. Siewiorek
Venue: IEEE Transactions on Computers (1973)

A marriage of N-modular redundancy (NMR) and standby sparing has resulted in a promising redundancy technique for protecting those portions of a fault-tolerant system whose continuous real-time operation is essential. This technique, known as hybrid redundancy, consists of N identical modules connected to a majority voter to form an NMR core. Disagreement detectors instruct a switch to replace any of the N modules that disagree with the majority consensus by a standby spare. The switch is essential to the operation of the hybrid redundancy scheme. The system reliability is a product of the reliabilities of the switch and the hybrid redundancy scheme assuming a perfect switch. To realize the demonstrated potential of the latter a highly reliable, thus simple, switch is required. An iterative cell switch is proposed and demonstrated to save at least 25 percent, and more than 80 percent in some instances, of the complexity of a switch design presented elsewhere in the literature. The use of threshold, rather than majority, voters is considered and shown to yield a simpler design in some cases. Three techniques for decreasing the propagation delay through the iterative cell switch are presented as well as a scheme to implement retry of failed modules. Finally, five different switch designs are compared on a cost and complexity basis.
A Modeling of Software Architecture Reliability
Authors: Jun Wang, Weiru Chen, Jun Liu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper introduces software architecture reliability estimation and some typical software reliability model based architecture. We modify model of software reliability estimation so that to improve precision of estimating software architecture reliability. At the same time, this paper proposed the simplified method of calculating software architecture reliability based on the state transition matrix. The improved model is validated by an application system in the paper, and the result show that the precision is effectively increased.
Monterey Workshop on Computer Packaging
Authors: J. W. Balde
Venue: Computer (1981)

Packaging technology is poorly taught, poorly funded, and constitutes an area for major technical society concern. So said Rex Rice in his keynote address at the Computer Society Packaging Committee's Spring Workshop, held May 13-15 in Monterey, California.