ppxscal/embedding_network huggingface dataset:
Automated trust negotiation using cryptographic credentials
Authors: Jiangtao Li, Ninghui Li, William H. Winsborough
Venue: ACM Transactions on Information and System Security (TISSEC) (2009)

In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Because the information in question is often sensitive, credentials are protected according to access control policies. In traditional ATN, credentials are transmitted either in their entirety or not at all. This approach can at times fail unnecessarily, either because a cyclic dependency makes neither negotiator willing to reveal her credential before her opponent because the opponent must be authorized for all attributes packaged together in a credential to receive any of them, or because it is necessary to disclose the precise attribute values, rather than merely proving they satisfy some predicate (such as being over 21 years of age). Recently, several cryptographic credential schemes and associated protocols have been developed to address these and other problems. However, they can be used only as fragments of an ATN process. This article introduces a framework for ATN in which the diverse credential schemes and protocols can be combined, integrated, and used as needed. A policy language is introduced that enables negotiators to specify authorization requirements that must be met by an opponent to receive various amounts of information about certified attributes and the credentials that contain it. The language also supports the use of uncertified attributes, allowing them to be required as part of policy satisfaction, and to place their (automatic) disclosure under policy control.
CPSO-Based Hybrid Approach for Scheduling Parallel Machines with Processing Set Restrictions
Authors: Hao Jinghua, Liu Min, Wu Cheng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

We consider identical parallel machine scheduling problem where every job is only allowed to be processed on a specified subset of machines. We develop an efficient CPSO (Chaotic Particle Swarm Optimization) based hybrid approach to solve the above problem with the objective of minimizing total number of tardy jobs. In the proposed approach, the problem is firstly decomposed into a machine assignment subproblem and a job sequencing subproblem, then the job sequencing subproblem is solved optimally by a heuristic algorithm with the time complexity of O(mnlogn), and the machine assignment subproblem is solved by the proposed CPSO algorithm, in which the problem characteristics are incorporated to enhance the performance of exploration and exploitation in the proposed algorithm. Numerical computations show that the proposed hybrid approach outperforms several other methods on the studied problems.
RiboSW - A Web Server for Identifying RNA Riboswitches
Authors: Tzu-Hao Chang, Li-Ching Wu, Chi-Ta Yeh, Cheng-Wei Chang, Baw-Jhiune Liu, Hsien-Da Huang, Jorng-Tzong Horng
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Riboswitches are cis-acting genetic regulatory elements within a specific mRNA, and can regulate both transcription and translation by interacting with their corresponding metabolites. Recently, more and more riboswitches were identified and investigated about their roles in regulatory functions in different species. Both of the sequence contexts and structural conformations are important characteristics of riboswitches. None of previous developed tools, such Covariance Models (CMs), Riboswitch finder, and RibEx, provides a web server for efficiently searching homologous instances to known riboswitches and considers two crucial characteristics of each riboswitch, such as structural conformations and sequence contexts of functional regions. Therefore, we developed a systematic method to identify twelve kinds of riboswitches. The method is implemented and provided as a web server, RiboSW, to efficiently and conveniently identify riboswitches within messenger RNA sequences. RiboSW is now available on the web at http://bioinfo.csie.ncu.edu.tw/RiboSW/. The predictive accuracy of the proposed method is comparable with other previous tools. The efficiency of the proposed method for identifying riboswitches was improved in order to achieve a reasonable computational time required for the prediction. That makes it possible to have an accurate and convenient web server for biologists to obtain their analyzing results in a given mRNA sequence.
A Context-Aware AR Navigation System Using Wearable Sensors
Authors: Daisuke Takada, Takefumi Ogawa, Kiyoshi Kiyokawa, Haruo Takemura
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

We have been developing a networked wearable AR system that determines the user's current context to provide appropriate annotations. This system allows for annotation management based on the relationship between annotations and the real environment along with data transfer routines that dynamically calculate annotations' priority to transfer just enough data from the annotation server to the wearable PC worn by the user. Furthermore, this system recognizes the user's activity to predict the kind and level of detail of annotations the user needs at a given time. This information can be used for dynamic annotation filtering and switching of rendering modes.
WebCrow: a WEB-based system for crossword solving
Authors: Marco Ernandes, Giovanni Angelini, Marco Gori
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Language games represent one of the most fascinating challenges of research in artificial intelligence. In this paper we give an overview of WebCrow, a system that tackles crosswords using the Web as a knowledge base. This appears to be a novel approach with respect to the available literature. It is also the first solver for non-English crosswords and it has been designed to be potentially multilingual. Although WebCrow has been implemented only in a preliminary version, it already displays very interesting results reaching the performance of a human beginner: crosswords that are "easy" for expert humans are solved, within competition time limits, with 80% of correct words and over 90% of correct letters.
Native judgments of non-native usage: experiments in preposition error detection
Authors: Joel R. Tetreault, Martin Chodorow
Venue: Proceedings of the Workshop on Human Judgements in Computational Linguistics (2008)

Evaluation and annotation are two of the greatest challenges in developing NLP instructional or diagnostic tools to mark grammar and usage errors in the writing of non-native speakers. Past approaches have commonly used only one rater to annotate a corpus of learner errors to compare to system output. In this paper, we show how using only one rater can skew system evaluation and then we present a sampling approach that makes it possible to evaluate a system more efficiently.
Content-Based Classification and Segmentation of Mixed-Type Audio by Using MPEG-7 Features
Authors: Ebru Dogan, Mustafa Sert, Adnan Yazici
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

This paper describes the development of a generated solution for classification and segmentation of broadcast news audio. A sound stream is segmented by classifying each sub-segment into silence, pure speech, music, environmental sound, speech over music, and speech over environmental sound classes in multiple steps. Support Vector Machines and Hidden Markov Models are employed for classification and these models are trained by using different sets of MPEG-7 features. A series of tests was conducted on hand-labeled audio tracks of TRECVID broadcast news to evaluate the performance of MPEG-7 features and the selected classification methods in the proposed solution. The results obtained from our experiments clearly demonstrate that classification of mixed type audio data using Audio Spectrum Centroid, Audio Spectrum Spread, and Audio Spectrum Flatness features has considerably high accuracy rates in news domain.
Bigraphical Categories
Authors: Robin Milner
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

Bigraphs are a candidate model that aims to provide a theoretical platform for ubiquitous computing systems. This short paper summarises the categories, and the functors between them, that represent the structure of that theory.
Problem-dependent search for optimal parameter instantiation order in design spaces
Authors: A. J. Dentsoras
Venue: Advanced Engineering Informatics (2009)

The paper refers to the domain of engineering design and introduces a method for obtaining an optimal instantiation process for the design parameters in a design problem by using extended, problem- and path-dependent search within the digraphs that these parameters form. Design parameters are considered as entities being interrelated via deterministic associative relationships and forming digraphs that accommodate declarative and procedural design knowledge. They participate in establishing formal metrics for the estimation of importance and design effort. Factors with values assigned by the designer(s) define the required effort for the instantiation of primary parameters. A method is presented and an algorithm is proposed for obtaining optimal instantiation lists. The algorithm uses extended problem- and path-dependent search within the parameter digraphs. Iteratively, in each step, the algorithm performs extended search in order to: (a) locate the optimal path, (b) instantiate its primary parameter and (c) propagate its value throughout design space. Thus information and knowledge of major importance is produced early in the design process with minimum instantiation effort. The design of a belt conveyor carrying unit loads is used as a case study for the suggested method. The proposed method can optimally guide the instantiation process. Violations of requirements, specifications and constraints for important parameters are promptly realized, modifiable primary parameters are easily located and, as a result, the necessity for changes to parameter interrelationships can be subsequently justified.
Enhanced direct linear discriminant analysis for feature extraction on high dimensional data
Authors: A. K. Qin, S. Y. M. Shi, P. N. Suganthan, M. Loog
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We present an enhanced direct linear discriminant analysis (EDLDA) solution to effectively and efficiently extract discriminatory features from high dimensional data. The EDLDA integrates two types of class-wise weighting terms in estimating the average within-class and between-class scatter matrices in order to relate the resulting Fisher criterion more closely to the minimization of classification error. Furthermore, the extracted discriminant features are weighted by mutual information between features and class labels. Experimental results on four biometric datasets demonstrate the promising performance of the proposed method.
Unsupervised and simultaneous training of multiple object detectors from unlabeled surveillance video
Authors: Hasan Celik, Alan Hanjalic, Emile A. Hendriks
Venue: Computer Vision and Image Understanding (2009)

Object detection is an essential component in automated vision-based surveillance systems. In general, object detectors are constructed using training examples obtained from large annotated data sets. The inevitable limitations of typical training data sets make such supervised methods unsuitable for building generic surveillance systems applicable to a wide variety of scenes and camera setups. In our previous work we proposed an unsupervised method for learning and detecting the dominant object class in a general dynamic scene observed by a static camera. In this paper, we investigate the possibilities to expand the applicability of this method to the problem of multiple dominant object classes. We propose an idea on how to approach this expansion, and perform an evaluation of this idea using two representative surveillance video sequences.
Case Study on Utilizing Mobile Applications in Industrial Field Service
Authors: Markus Aleksy, Bernd Stieger, Gerhard Vollmar
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Mobile solutions provide the opportunity for seamless integration of mobile field service engineers into theservice processes resulting in new form of interactionbetween them and the dispatcher.In this paper, we describe the results of our study regarding the requirements of utilizing a mobile applicationin the area of industrial field service. After a brief description of the challenges these kinds of applicationshave to face and an overview of the utilized mobile service system architecture, we present the results of our usability study followed by a discussion.
A Homomorphic Method for Sharing Secret Images
Authors: Naveed Islam, William Puech, Robert Brouzet
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem. With our method, we show that it is possible to multiply two encrypted images, to decrypt the resulted image and after to extract and reconstruct one of the two original images if the second original image is available. Indeed, extraction and reconstruction of original image at the receiving end is done with the help of carrier image. Experimental results and security analysis show the effectiveness of the proposed scheme.
On the Aizerman problem
Authors: G. A. Leonov
Venue: Automation and Remote Control (2009)

The method of harmonic linearization in degenerate cases is stated and strictly mathematically justified. This method is applied to the search for periodic oscillations for systems satisfying the generalized Routh-Hurwitz condition.
Positivity of third order linear recurrence sequences
Authors: Vichian Laohakosol, Pinthira Tangsupphathawat
Venue: Discrete Applied Mathematics (2009)

It is shown that the Positivity Problem for a sequence satisfying a third order linear recurrence with integer coefficients, i.e., the problem whether each element of this sequence is nonnegative, is decidable.
Hierarchical Dependency Graphs: Abstraction and Methodology for Mapping Systolic Array Designs to Multicore Processors
Authors: Sudhir Vinjamuri, Viktor Prasanna
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

Systolic array designs and dependency graphs are some of the most important class of algorithms in several scientific computing areas. In this paper, we first propose an abstraction based on the fundamental principles behind designing systolic arrays. Then, based on the abstraction, we propose a methodology to map a dependency graph to a generic multicore processor. Then we present two case studies: Convolution and Transitive Closure, on two state of the art multicore architectures: Intel Xeon and Cell multicore processors, illustrating the ideas in the paper. We achieved scalable results and higher performance compared to standard compiler optimizations and other recent implementations in the case studies. We comment on the performance of the algorithms by taking into consideration the architectural features of the two multicore platforms.
Energy-Saving Topology Control for Heterogeneous Ad Hoc Networks
Authors: Lei Zhang, Xuehui Wang
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

Topology control with per-node transmission power adjustment in wireless ad hoc networks has been shown to be effective with respect to prolonging network lifetime and increasing network capacity. In this paper, we propose a fully distributed, asynchronous and localized energy-saving topology control algorithm for heterogeneous ad hoc networks with non-uniform transmission ranges. We prove the topology derived from the algorithm preserves the network connectivity and bi-directionality. It need not the position system support and dramatically reduces the communication overhead compared to other topology control algorithms. Simulation results show the effectiveness of our proposed algorithm.
Video Event Classification Using Bag of Words and String Kernels
Authors: Lamberto Ballan, Marco Bertini, Alberto Bimbo, Giuseppe Serra
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The recognition of events in videos is a relevant and challenging task of automatic semantic video analysis. At present one of the most successful frameworks, used for object recognition tasks, is the bag-of-words (BoW) approach. However this approach does not model the temporal information of the video stream. In this paper we present a method to introduce temporal information within the BoW approach. Events are modeled as a sequence composed of histograms of visual features, computed from each frame using the traditional BoW model. The sequences are treated as strings where each histogram is considered as a character. Event classification of these sequences of variable size, depending on the length of the video clip, are performed using SVM classifiers with a string kernel that uses the Needlemann-Wunsch edit distance. Experimental results, performed on two datasets, soccer video and TRECVID 2005, demonstrate the validity of the proposed approach.
Exploring an auxiliary distribution based approach to domain adaptation of a syntactic disambiguation model
Authors: Barbara Plank, Gertjan van Noord
Venue: Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation (2008)

We investigate auxiliary distributions (Johnson and Riezler, 2000) for domain adaptation of a supervised parsing system of Dutch. To overcome the limited target domain training data, we exploit an original and larger out-of-domain model as auxiliary distribution. However, our empirical results exhibit that the auxiliary distribution does not help: even when very little target training data is available the incorporation of the out-of-domain model does not contribute to parsing accuracy on the target domain; instead, better results are achieved either without adaptation or by simple model combination.
Probabilistic Methods for Bioinformatics: with an Introduction to Bayesian Networks
Authors: Richard E. Neapolitan
Venue:  (2009)

The Bayesian network is one of the most important architectures for representing and reasoning with multivariate probability distributions. When used in conjunction with specialized informatics, possibilities of real-world applications are achieved. Probabilistic Methods for BioInformatics explains the application of probability and statistics, in particular Bayesian networks, to genetics. This book provides background material on probability, statistics, and genetics, and then moves on to discuss Bayesian networks and applications to bioinformatics. Rather than getting bogged down in proofs and algorithms, probabilistic methods used for biological information and Bayesian networks are explained in an accessible way using applications and case studies. The many useful applications of Bayesian networks that have been developed in the past 10 years are discussed. Forming a review of all the significant work in the field that will arguably become the most prevalent method in biological data analysis. Unique coverage of probabilistic reasoning methods applied to bioinformatics data--those methods that are likely to become the standard analysis tools for bioinformatics. Shares insights about when and why probabilistic methods can and cannot be used effectively; Complete review of Bayesian networks and probabilistic methods with a practical approach. 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
Solving the problem of cascading errors: approximate Bayesian inference for linguistic annotation pipelines
Authors: Jenny Rose Finkel, Christopher D. Manning, Andrew Y. Ng
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

The end-to-end performance of natural language processing systems for compound tasks, such as question answering and textual entailment, is often hampered by use of a greedy 1-best pipeline architecture, which causes errors to propagate and compound at each stage. We present a novel architecture, which models these pipelines as Bayesian networks, with each low level task corresponding to a variable in the network, and then we perform approximate inference to find the best labeling. Our approach is extremely simple to apply but gains the benefits of sampling the entire distribution over labels at each stage in the pipeline. We apply our method to two tasks -- semantic role labeling and recognizing textual entailment -- and achieve useful performance gains from the superior pipeline architecture.
Designers of Different Cognitive Styles Editing E-Learning Materials Studied by Monitoring Physiological and Other Data Simultaneously
Authors: Károly Hercegfi, Olga Csillik, Éva Bodnár, Judit Sass, Lajos Izsó
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

At the Corvinus University of Budapest, a series of experiments was performed, applying the INTERFACE testing methodology developed by researchers of the Budapest University of Technology and Economics. This methodology is capable of recording data characterizing the user's current mental effort derived from Heart Period Variability (HPV) and the user's emotional state indicated by Skin Conductance (SC) parameterssimultaneously and synchronized with other characteristics of Human-Computer Interaction (HCI). The current experiments aim to study how the teachers (electronic curriculum designers, developers) themselves use the e-learning development tools to design and edit a new piece of e-learning material.
On the Security of Goldreich's One-Way Function
Authors: Andrej Bogdanov, Youming Qiao
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function where each bit of output is a fixed predicate P of a constant number d of (random) input bits. We investigate the security of this construction in the regime m = Dn, where D(d) is a sufficiently large constant. We prove that for any predicate P that correlates with either one or two of its variables, f can be inverted with high probability.We also prove an amplification claim regarding Goldreich's construction. Suppose we are given an assignment that has correlation ¿> 0 with the hidden assignment . Then, given access to x¿, it is possible to invert f on x with high probability, provided is sufficiently large.
Invariant-geometry conditions for the rational bi-quadratic Bézier surfaces
Authors: H. E. Bez
Venue: Computer Aided Geometric Design (2009)

A generalisation of Patterson's work, on the invariants of the rational Bezier paths, to the case of surface patches is presented. An equation for the determination of the invariants for patches of degree (n,n) is derived and solved for the bi-quadratics - for which it is shown that seven independent, invariant functions exist. Explicit forms of the invariants are derived and a number of applications are presented.