ppxscal/embedding_network huggingface dataset:
Recommended Security Controls to Protect Information Systems
Authors: Staff
Venue: I-WAYS - The Journal of E-Government Policy and Regulation (2005)

The National Institute of Standards and Technology (NIST) of the US Department of Commerce, is responsible for developing standards and guidelines, including minimum requirements, for providing adequate information security for all agency operations, but also may be used by non-governmental organizations on a voluntary basis and is not subject to copyright. In February 2005, NIST released a Special Publication 800-53 entitled Recommended Security Controls to Protect Information Systems (http://csrc.nist.gov/publications/nistpubs/800-53/SP800-53.pdf). The following are excerpts from the report. 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 Tractable and Fast Method for Monitoring SystemC TLM Specifications
Authors: Laurence Pierre, Luca Ferro
Venue: IEEE Transactions on Computers (2008)

The TLM modeling level of the SystemC language emphasizes the transactions in a complex system, considered at a very high level of abstraction. This level of specification considerably improves simulation performance and is therefore increasingly being adopted. We address assertion-based verification (ABV) of TLM SystemC models. We propose a framework for supervising during simulation the verification of temporal properties expressed in PSL. Very few modifications are needed in the original SystemC code. The TLM specification can be timed or not. The properties can involve several channels, of different types.
An efficient logic fault diagnosis framework based on effect-cause approach
Authors: Duncan M. Walker
Venue:  (2007)

Fault diagnosis plays an important role in improving the circuit design process and the manufacturing yield. With the increasing number of gates in modern circuits, determining the source of failure in a defective circuit is becoming more and more challenging. In this research, we present an efficient effect-cause diagnosis framework for combinational VLSI circuits. The framework consists of three stages to obtain an accurate and reasonably precise diagnosis. First, an improved critical path tracing algorithm is proposed to identify an initial suspect list by backtracing from faulty primary outputs toward primary inputs. Compared to the traditional critical path tracing approach, our algorithm is faster and exact. Second, a novel probabilistic ranking model is applied to rank the suspects so that the most suspicious one will be ranked at or near the top. Several fast filtering methods are used to prune unrelated suspects. Finally, to refine the diagnosis, fault simulation is performed on the top suspect nets using several common fault models. The difference between the observed faulty behavior and the simulated behavior is used to rank each suspect. Experimental results on ISCAS85 benchmark circuits show that this diagnosis approach is efficient both in terms of memory space and CPU time and the diagnosis results are accurate and reasonably precise.
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
Authors: Meena Mahajan, B. V. Raghavendra Rao
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Functions in arithmetic NC 1 are known to have equivalent constant width polynomial degree circuits, but the converse containment is unknown. In a partial answer to this question, we show that syntactic multilinear circuits of constant width and polynomial degree can be depth-reduced, though the resulting circuits need not be syntactic multilinear. We then focus specifically on polynomial-size syntactic multilinear circuits, and study relationships between classes of functions obtained by imposing various resource (width, depth, degree) restrictions on these circuits. Along the way, we obtain a characterisation of NC 1 (and its arithmetic counterparts) in terms of log width restricted planar branching programs. We also study the power of skew formulae, and show that even exponential sums of these are unlikely to suffice to express the determinant function.
Coverage Based Testing for Concurrent Software
Authors: Juichi Takahashi, Hideharu Kojima, Zengo Furukawa
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Concurrent programming is playing key roles for improving software performance since multi-core processors are used on various computing system. However, there may be not standard methodology for testing concurrent program. Especially, it would be difficult to know the quality of concurrent software. In this research, one of quality indexes, which would be defined by our research, is concurrent coverage criteria and is used for concurrent software testing. The concurrent coverage criteria would intend to find concurrent software specific defects, such as race conditions.
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
Authors: Hamid Zarrabi-Zadeh
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We present a new streaming algorithm for maintaining an ¿-kernel of a point set in ¿ d using O((1/¿ (d ¿ 1)/2) log(1/¿)) space. The space used by our algorithm is optimal up to a small logarithmic factor. This substantially improves (for any fixed dimension $d \geqslant 3$) the best previous algorithm for this problem that uses O(1/¿ d ¿ (3/2)) space, presented by Agarwal and Yu at SoCG'07. Our algorithm immediately improves the space complexity of the best previous streaming algorithms for a number of fundamental geometric optimization problems in fixed dimensions, including width, minimum enclosing cylinder, minimum-width enclosing annulus, minimum-width enclosing cylindrical shell, etc.
On the Application of Lexical-Syntactic Knowledge to the Answer Validation Exercise
Authors: Óscar Ferrández, Daniel Micol, Rafael Muñoz, Manuel Palomar
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents a system that applies Textual Entailment recognition techniques to the AVE task. This is performed comparing representations of text snippets by means of a variety of lexical measures and syntactic structures. The representations of the question and the answer are compared determining if there is an entailment relation between them. The performed experiments over the English test corpus obtained a maximum F-score of 0.39.
Replacement Algorithms for Fingerprint Template Update
Authors: Biagio Freni, Gian Luca Marcialis, Fabio Roli
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Semi-supervised fingerprint template update is a relatively novel topic in which the problem of template representativeness with respect to unknown data has been pointed out. Current approaches to template update are based on insertion of a novel template into the gallery, and/or fusion of the template with an existing one. The automatic replacement of an existing template by a novel one is another possibility which has not yet been investigated. This paper is a first attempt to study the feasibility of using some template replacement algorithms in fingerprint verification systems. Replacement is performed online, which can be considered as a sort of "worst case" for this approach. Preliminary experiments are carried out on the four data sets of FVC2002 event.
Avatar Augmented Annotation Interface for e-Learning
Authors: Won-Sung Sohn, Jae-Kyung Kim, Jaeho Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Creating avatar-augmented presentations that extend gesture and annotation to distance education is laborious and time-consuming. We present Avatar Augmented Annotation (AAA), a project to design and share web based e-Learning materials using an animated avatar and digital inking. Using AAA, the instructor can create a presentation, using freehand annotations that include high-level teaching behavior without doing any programming. The AAA then generates a script expressed in XML and augments the presentation with an animated avatar following each annotation. We found that AAA provides positive educational effectiveness and usability compared to previous online courseware.
No-Regret Boosting
Authors: Anna Gambin, Ewa Szczurek
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Following [4], we analyze boosting from a game-theoretic perspective. We define a wide class of boosting classification algorithms called H-boosting methods, which are based on Hannan-consistent game playing strategies. These strategies tend to minimize the regret of a player, i.e. are able to minimize the difference between its expected cumulative loss and the cumulative loss achievable using the single best strategy. The "weighted majority" boosting algorithm [4] is proved to belong to the class of H-boosting procedures. A new boosting algorithm is proposed, as an another example of such a regret-minimizing method.
Perceptual Docking for Robotic Control
Authors: Guang-Zhong Yang, George P. Mylonas, Ka-Wai Kwok, Adrian Chung
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

In current robotic surgery, dexterity is enhanced by microprocessor controlled mechanical wrists which allow motion scaling for reduced gross hand movements and improved performance of micro-scale tasks. The continuing evolution of the technology, including force feedback and virtual immobilization through real-time motion adaptation, will permit complex procedures such as beating heart surgery to be carried out under a static frame-of-reference. In pursuing more adaptive and intelligent robotic designs, the regulatory, ethical and legal barriers imposed on interventional surgical robots have given rise to the need of a tightly integrated control between the operator and the robot when autonomy is considered. This paper outlines the general concept of perceptual docking for robotic control and how it can be used for learning and knowledge acquisition in robotic assisted minimally invasive surgery such that operator specific motor and perceptual/cognitive behaviour is acquired through in situ sensing. A gaze contingent framework is presented in this paper as an example to illustrate how saccadic eye movements and ocular vergence can be used for attention selection, recovering 3D tissue deformation and motor channelling during minimally invasive surgical procedures.
Learning Commutative Regular Languages
Authors: Antonio Cano Gómez, Gloria I. Álvarez
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

In this article we study the inference of commutative regular languages. We first show that commutative regular languages are not inferable from positive samples, and then we study the possible improvement of inference from positive and negative samples. We propose a polynomial algorithm to infer commutative regular languages from positive and negative samples, and we show, from experimental results, that far from being a theoretical algorithm, it produces very high recognition rates in comparison with classical inference algorithms.
Projective de Bruijn Sequences
Authors: Yuki Ohtsuka, Makoto Matsumoto, Mariko Hagita
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Let ${{\mathbb F}_q}$ denote the q-element field. A q-ary de Bruijn sequence of degree m is a cyclic sequence of elements of ${{\mathbb F}_q}$, such that every element in ${{\mathbb F}_q}^m$ appears exactly once as a consecutive m-tuple in the cyclic sequence. We consider its projective analogue; namely, a cyclic sequence such that every point in the projective space $({{\mathbb F}_q}^{m+1} -\{0\})/({{\mathbb F}_q}^\times)$ appears exactly once as a consecutive (m + 1)-tuple. We have an explicit formula $(q!)^{\frac{q^m-1}{q-1}}q^{-m}$ for the number of distinct such sequences.
Efficient Certificateless Signature Schemes
Authors: Kyu Young Choi, Jong Hwan Park, Jung Yeon Hwang, Dong Hoon Lee
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

Recently, in order to eliminate the use of certificates in certified public key cryptography and the key-escrow problem in identity based cryptography, the notion of certificateless public key cryptography was introduced. In this paper, to construct an efficient certificateless signature (CLS) scheme, we present a new approach compactly and orthogonally combining short signatures using bilinear maps. Our approach is conceptually simple but effective to improve efficiency greatly. In the proposed CLS scheme a full private key of a user is a single group element and signature verification requires only one pairing operation. In addition, our CLS scheme has a flexible structure which can be easily extended to a certificateless signature scheme with additional properties such as certificateless ring and blind signature schemes.
Semantic Integration of eGovernment Services in Schleswig-Holstein
Authors: Peter Bednar, Karol Furdik, Maren Kleimann, Ralf Klischewski, Marek Skokan, Stefan Ukena
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

The paper presents an example of e-government service integration on a semantic basis, as it was designed within the Access-eGov research project and applied in the Schleswig-Holstein state government. The case study follows up the application of a requirements-driven approach for designing e-government service interfaces with respect to the informational needs of citizens and business users. Using this approach, a conceptual model for e-government services was developed, formalised in the WSML ontology language, and used for semantic annotation of the services as a basis for integration. A subsequent field test was focused on the evaluation of produced semantic description on the client-side system components as Annotation tool and the Personal Assistant Client. The results of the field test have been evaluated and are presented in as lessons learned.
Better multiclass classification via a margin-optimized single binary problem
Authors: Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov
Venue: Pattern Recognition Letters (2008)

We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding smaller binary problems into a single space. A good embedding will allow for large margin classification. We show that the construction of such an embedding can be reduced to the task of learning linear combinations of kernels. We provide a bound on the generalization error of the multiclass classifier obtained with our construction and outline the conditions for its consistency. Our empirical examination of the new method indicates that it outperforms one-vs.-all, all-pairs and the error-correcting output coding scheme at least when the number of classes is small.
Physical investigation of the impact of electrolessly deposited self-aligned caps on insulation of copper interconnects
Authors: S. Olivier, T. Decorps, M. Bernard, P. H. Haumesser, G. Passemard
Venue: Microelectronic Engineering (2008)

With the miniaturization of ULSI circuits and the associated increase of current density up to several MA/cm^2, copper interconnects are facing electromigration issues at the top interface with the dielectric capping layer SiC(N). A promising solution is to insert selectively on top of copper lines a CoWP metallic self-aligned encapsulation layer, deposited using a wet electroless process. We study the impact of this process on electrical line insulation as a function of cap thickness at the 65nm technology node and we investigate the physical origin of leakage currents. Below a critical thickness, only a slight leakage current increase of less than one decade is observed, remaining within the specification for self-aligned capping layer processes. Above this critical thickness, large leakage currents are generated due to the combined effect of lateral growth and the presence of parasitic redeposited nodules. We show that a simple phenomenological model allows to reproduce the experimental data, to assess quantitatively the contribution of parasitic defects, and to predict that the self-aligned barrier technology should be extendible up to the 32nm node, provided that a thin cap layer of less than 8nm is used.
A computer simulation of underwater sound propagation based on the method of parabolic equations
Authors: Reza Soheilifar, Afshin Mohseni Arasteh, Jalil Rasekhi, Arash Guran Urimi
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Due to high financial costs of test operations, computational acoustics has emerged as an important branch of underwater acoustics. A variety of numerical techniques have been introduced in this field, among which, only ray tracing, normal modes, fast field programming and parabolic equations methods have gained more enthusiasm from scientists and engineers. As PE method is suitable for low frequencies and shallow waters, and usually generates reliable results for all environments, we've employed this method in MATLAB routines to simulate acoustic wave propagation. Comparisons are made in figures 1-16 between simulation results and an ideal model.
Sequential Pattern Mining for Protein Function Prediction
Authors: Miao Wang, Xue-Qun Shang, Zhan-Huai Li
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

The prediction of protein sequence function is one of the problems arising in the recent progress in bioinformatics. Traditional methods have its limits. We present a novel method of protein sequence function prediction based on sequential pattern mining. First, we use our designed sequential pattern mining algorithms to mine known function sequence dataset. Then, we build a classifier using the patterns generated to predict function of protein sequences. Experiments confirm the effectiveness of our method.
The dynamic integration of distributed gis through semantic web services
Authors: Trevor M. Harris
Venue:  (2007)

While interest in the GIS community has traditionally &ldquo;been almost entirely on the sharing of data&rdquo; (Goodchild, 2003), Web Service, a solution of software interoperability, is regarded as the &ldquo;future of geoprocessing&rdquo; (Hecht, 2002). While data interoperability and data semantics has long been examined in the community of Geographic Information Systems (GIS), exploring the way for the effective sharing of GIS methods and tools is a completely new effort, although such a theme was only talked. Enabling the dynamic integration of geospatial data and geoprocessing functions and resources over heterogeneous systems and platforms through the cutting-edge technology of semantic Web service (SWS) is the focus of this research.Web service technology is still under development but presents controversies. This research explores the Ontology-enhanced Semantic Request and Response (OSRR) approach as a new paradigm and alternative for developing geospatial Semantic Web Services. By following a reverse engineering approach to rebuild SWS, OSRR enables dynamic service invocation and integration through a standardized interface. OSRR demonstrates that service semantics are neutral and independent from the service interface and the same service semantics can be shared by different service providers, while the same service interface can be deployed by all kinds of different services. Different kinds of Web services can be united within the same semantic service description framework while Web services can be integrated with the (semantic) Web under the same Internet protocol without any extra framework. Geospatial Web service development and deployment can be standardized and simplified through OSRR to enable GIS and other community to consume geospatial Web services.
A Study of Coordinated Dynamic Market-Based Task Assignment in Massively Multi-Agent Systems
Authors: Myungjoo Ham, Gul Agha
Venue: Massively Multi-Agent Technology: AAMAS Workshops, MMAS 2006, LSMAS 2006, and CCMMS 2007 Hakodate, Japan, May 9, 2006 Honolulu, HI, USA, May 15, 2007 Selected and Revised Papers (2008)

This paper studies market-based mechanisms for coordinated dynamic task assignment in large-scale agent systems carrying out search and rescue missions. Specifically, the effect of different auction mechanisms and swapping are studied. The paper describes results from a large number of simulations.The information available to agents and their bidding strategies are used as simulation parameters. The simulations provide insight about the interaction between the strategy of individual agents and the market mechanism. Performance is evaluated using several metrics. Some of the results include: limiting information may improve performance, different utility functions may affect the performance in non-uniform ways, and swapping may help improve the efficiency of assignments in dynamic environments.
Polynomial Nonlinear Integrals
Authors: Jinfeng Wang, Kwongsak Leung, Kinhong Lee, Zhenyuan Wang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Nonlinear Integrals is a useful integration tool. It can get a set of virtual values by projecting original data to a virtual space using Nonlinear Integrals. The classical Nonlinear Integrals implement projection along with a line with respect to the attributes. But in many cases the linear projection is not applicable to achieve better performance for classification or regression. In this paper, we propose a generalized Nonlinear Integrals--Polynomial Nonlinear Integrals(PNI). A polynomial function with respect to the attributes is used as the integrand of Nonlinear Integrals. It makes the projection being along different kinds of curves to the virtual space, so that the virtual values gotten by Nonlinear Integrals can be more regularized well and better to deal with. For testing the capability of the Polynomial Nonlinear Integrals, we apply the Polynomial Nonlinear Integrals to classification on some real datasets. Due to limitation of computational complexity, we take feature selection method studied in another our paper to do preprocessing. We select the value of the highest power of polynomial from 1 to 5 to observe the change of performance of PNI and the effect of the highest power. Experiments show that there is evident advancement of performance for PNI compared to classical NI and the performance is not definitely rising as the highest power is increased.
How to Monitor for Missing RFID tags
Authors: Chiu C. Tan, Bo Sheng, Qun Li
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

As RFID tags become more widespread, new approaches for managing larger numbers of RFID tags will be needed. In this paper, we consider the problem of how to accurately and efficiently monitor a set of RFID tags for missing tags. Our approach accurately monitors a set of tags without collecting IDs from them. It differs from traditional research which focuses on faster ways for collecting IDs from every tag. We present two monitoring protocols, one designed for a trusted reader and another for an untrusted reader.