ppxscal/embedding_network huggingface dataset:
Expandable grids: a user interface visualization technique and a policy semantics to support fast, accurate security and privacy policy authoring
Authors: Lorrie Faith Cranor
Venue:  (2008)

This thesis addresses the problem of designing user interfaces to support creating, editing, and viewing security and privacy policies. Policies are declarations of who may access what under which conditions. Creating, editing, and viewing&mdash;in a word, authoring&mdash;accurate policies is essential to keeping resources both available to those who are authorized to use them and secure from those who are not. User interfaces for policy authoring can greatly affect whether policies match their authors' intentions; a bad user interface can lead to policies with many errors, while a good user interface can ensure that a policy matches its author's intentions. Traditional methods of displaying security and privacy policies in user interfaces are deficient because they place an undue burden on policy authors to interpret nuanced rules or convoluted natural language. We introduce the Expandable Grid, a novel technique for displaying policies in a user interface. An Expandable Grid is an interactive matrix visualization designed to address the problems that traditional policy-authoring interfaces have in conveying policies to users. This thesis describes the Expandable Grid concept, then presents three pieces of work centered on the concept: (1) a design, implementation, and evaluation of a system using an Expandable Grid for setting file permissions in the Microsoft Windows XP operating system; (2) a description and evaluation of a file-permissions policy semantics that complements the Expandable Grid particularly well for reducing policy-authoring errors; and (3) a design, implementation, and evaluation of a system using an Expandable Grid for displaying website privacy policies to Web users. The evaluations of the Expandable Grid system for setting file permissions and its associated policy semantics show that the Expandable Grid can greatly improve the speed and accuracy with which policy authors complete tasks compared to traditional policy-authoring interfaces. However, the evaluation of the Expandable Grid system for displaying website privacy policies suggest some limitations of the Grid concept. We conclude that the Expandable Grid is a beneficial promising approach to policy-authoring interface design, but that it must be applied with care and tailored to each domain to which it is applied.
CABRO: Winner Determination Algorithm for Single-unit Combinatorial Auctions
Authors: Víctor Muòoz, Javier Murillo
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

In this paper we present CABRO, an algorithm for solving the winner determination problem related to single-unit combinatorial auctions. The algorithm is divided in three main phases. The first phase is a pre-processing step with some reduction techniques. The second phase calculates an upper and a lower bound based on a linear programming relaxation in order to delete more bids. Finally, the third phase is a branch and bound depth first search where the linear programming relaxation is used as upper bounding and sorting strategy. Experiments against specific solvers like CASS and general purpose MIP solvers as GLPK and CPLEX show that CABRO is in average the fastest free solver (CPLEX not included), and in some instances drastically faster than any other.
Towards an Ontology-enabled Approach Helping SMEs to Access the Single European Electronic Market
Authors: Celson Lima, Flavio Bonfatti, Silvia Sancho, Anastasiya Yurchyshyna
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The SEAMLESS project targets the design and deployment of a self-organising, open, dynamic collaborative e-environment providing companies (especially SMEs) with the required means to support their e-business needs without cultural/technological constraints. SEAMLESS represents the instantiation of the Single European Electronic Market (SEEM) concept considering the environmental conditions (technical and business-related) required to support simple but useful e-business practices targeting the enlarged Europe. The SEAMLESS conceptual approach is ontology-enabled since the business interoperation heavily depends on how effectively SMEs are able to understand precisely the meaning of the business requests among them. This paper discusses the SEAMLESS vision and framework, and points out the challenges to be faced.
Performance enhancement of TFI-OFDM with path selection based channel identification
Authors: Takeshi Yoshimura, Chang-Jun Ahn, Takeshi Kamio, Hisato Fujisaka, Kazuhisa Haeiwa
Venue: Digital Signal Processing (2009)

Recently time-frequency interferometry (TFI)-OFDM has been proposed as a channel identification scheme. TFI-OFDM system can multiplex the same impulse response in twice on the time domain without overlapping each other. In this case, the required pilot signal is only one. Moreover, by averaging these impulse responses, the accurated channel impulse responses are obtained. However, if the total channel paths are reduced, the performance might be degraded. This is because the channel identification of TFI-OFDM is operated with averaging the selected spectrum signals from the time windows. For the case with reduced channel paths, the selected time spectrum signals include the noise terms. By applying the FFT operation, these noise terms are spread in the frequency domain. In this case, the channel identification is poorly operated due to the noise. To reduce this problem, in the paper, we propose the channel identification method with path selection for performance enhancement of TFI-OFDM.
Enhancing commercial grammar-based applications using robust approaches to speech understanding
Authors: Matthieu Hébert
Venue: Proceedings of the Workshop on Bridging the Gap: Academic and Industrial Research in Dialog Technologies (2007)

This paper presents a series of measurements of the accuracy of speech understanding when grammar-based or robust approaches are used. The robust approaches considered here are based on statistical language models (SLMs) with the interpretation being carried out by phrase-spotting or robust parsing methods. We propose a simple process to leverage existing grammars and logged utterances to upgrade grammar-based applications to become more robust to out-of-coverage inputs. All experiments herein are run on data collected from deployed directed dialog applications and show that SLM-based techniques outperform grammar-based ones without requiring any change in the application logic.
On the rate & distortion: conformity with the statistics of natural images and visual perception in humans
Authors: Truong Nguyen
Venue:  (2008)

In this dissertation the subjects of entropy coding and quality assessment in the context of natural image processing and compression have been revisited. Both subjects are amongst the most fundamental concepts which have been extensively studied under the theories of source coding and signal processing. In this dissertation, it will be demonstrated how conformity to the statistical properties of natural image data, makes it possible to estimate the entropy rate of such data with high accuracy and very low complexity. A maximum likelihood parameter estimation framework is proposed which not only is enabling the design of a fast and efficient entropy rate estimator, but also unifies the legacy rate estimation methods, namely the heuristic low-data-rate methods and the analytical high-data-rate methods. The concept of entropy rate crosses the concept of image quality measure, or distortion metric (fidelity criterion), most often under the subject of lossy source coding to measure the optimality of a compression scheme. However the distortion metrics are amongst the most basic concepts for evaluation of other image processing algorithms, beyond the image compression. Underlined by numerous publications, the need for a perceptual quality metric that reflects the perception of humans on the subject of visual quality is unanimously agreed upon. The endeavor to find a suitable image quality metric has resulted in the introduction of many image quality assessment methods. The contribution of this work on the subject of image quality is a modest step forward in unifying many of the legacy methods under a "probabilistic perceptual image quality" framework. It will be shown that different methods such as contrast sensitivity, channel decomposition and structural similarity methods are different realizations of the proposed framework. This framework not only unifies the legacy methods, but also provides means for comparing different legacy methods. Furthermore, the proposed framework creates opportunities to enhance most of the legacy perceptual image quality measures. Finally the probabilistic nature of image quality in the proposed method lends itself to extending the quality metric beyond image quality assessment with full-reference image. It also covers the quality assessment when there is no access to the reference image.
Subject Access to a Multilingual Museum Database: A Step-by-Step Approach to the Digitization Process
Authors: Allison Kupietzky
Venue: Third Millennium Cataloging (2007)

Translating visual works into verbal form is clearly a formidable task. While libraries have a century of cooperative cataloguing behind them, museums and other cultural institutions have tended to go their separate ways, believing the objects in their collections are unique. Dr. Kupietzky has put together a guide for digitizing encyclopedic, multilingual museums that promises to both standardize and streamline the process.Part I provides a review of the literature and of the problems concerning methods used in the computerization of museums. Part II offers practical guidelines for mono- or multilingual museums seeking to implement a database to aid in cataloguing their holdings. A six-step process of computerizing museum collections (the SAGE-K method) was developed to facilitate the application of these ideas by all museums and enable them to achieve the goal of digitization. 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
An instructional approach to drive computer science courses through virtual learning environments
Authors: Félix Buendía, Juan Carlos Cano, José Vicente Benlloch
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

Nowadays, many universities have adopted Virtual Learning Environments for delivering and distributing educational resources. In the context of Computer Science (CS) courses, the use of these environments addresses several issues ranging from the application of instructional strategies to the selection of the most adequate learning platform. In this work, we propose an instructional approach to drive CS courses through virtual learning environments. The concept of driving a CS course adds a pedagogical value to the classical approach delivering educational resources. This pedagogical value is supported by applying instructional methods based on pedagogical patterns to design specific components of CS courses. The use of these pedagogical patterns helps to guide the deployment of Virtual Learning Environments (VLE) in CS courses enabling a connection between the course requirements and the VLE features. We have evaluated the proposed approach using an example of VLE called Poliformat. The evaluation focuses on the platform role as the road to drive Operating System courses during the 2005-06, 2006-07 and 2007-08 academic years. The evaluation results have contributed to a better understanding of how virtual learning environments can be used in CS courses and they confirm the benefits of applying instructional based approaches.
On probe permutation graphs
Authors: David B. Chandler Maw-Shang Chang, Ton Kloks Jiping Liu, Sheng-Lung Peng
Venue: Discrete Applied Mathematics (2009)

Given a class of graphs G, a graph G is a probe graph ofG if its vertices can be partitioned into two sets, P, the probes, and an independent set N, the nonprobes, such that G can be embedded into a graph of G by adding edges between certain vertices of N. If the partition of the vertices into probes and nonprobes is part of the input, then we call the graph a partitioned probe graph ofG. In this paper, we provide a recognition algorithm for partitioned probe permutation graphs with time complexity O(n^2), where n is the number of vertices of the input graph. We show that a probe permutation graph has at most O(n^4) minimal separators. As a consequence, for probe permutation graphs there exist polynomial-time algorithms solving problems like treewidth and minimum fill-in. We also characterize those graphs for which the probe graphs must be weakly chordal.
Solving the sorting network problem using iterative optimization with evolved hypermutations
Authors: Jiří Kubalík
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

This paper presents an application of a prototype optimization with evolved improvement steps algorithm (POEMS) to the well-known problem of optimal sorting network design. The POEMS is an iterative algorithm that seeks the best variation of the current solution in each iteration. The variations, also called hypermutations, are evolved by means of an evolutionary algorithm. We compared the POEMS to two mutation-based optimizers, namely the (\mu+\lambda)- and (1+\lambda)-evolution strategies. For experimental evaluation 10-input, 12-input, 14-input and 16-input instances of the sorting network problem were used. Results show that the proposed POEMS approach clearly outperforms both compared algorithms. Moreover, POEMS was able to find several perfect networks that are equivalent w.r.t. the number of comparators to the best known solutions for the 10-input, 12-input, 14-input, and 16-input problems. Finally, we propose a modification to the POEMS approach that might further improve its performance.
Modeling and simulation of a solid-state breaker for medium-voltage feeder protection using Matlab's power system blockset
Authors: Thanatchai Kulworawanichpong
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

This paper proposes detail of formulating solid-state breakers (SSB) in electric power distribution systems by using GUI-based environment of MATLAB/SIMULINK. Utilization of MATLAB software simplifies problem solving complexity and also reduces working time. In this paper, a 22-kV power distribution feeder with a load having the SSB for protection is situated. A thyristor-based circuit breaker is modeled. Detail of the power circuit and its firing control part is demonstrated in graphical diagrams using elements of the MATLAB's Power System Blockset (PSB). Test against a fault condition to verify its use is carried out. The results show that, with a moderate sensing technique to monitor voltage and current of the protected feeder, the SSB can interrupt fault instantaneously.
A Lagrangian approach to single-machine scheduling problems with two competing agents
Authors: Alessandro Agnetis, Gianluca Pascale, Dario Pacciarelli
Venue: Journal of Scheduling (2009)

In this paper, we develop branch-and-bound algorithms for several hard, two-agent scheduling problems, i.e., problems in which each agent has an objective function which depends on the completion times of its jobs only. Our bounding approach is based on the fact that, for all problems considered, the Lagrangian dual gives a good bound and can be solved exactly in strongly polynomial time. The problems addressed here consist in minimizing the total weighted completion time of the jobs of agent A, subject to a bound on the cost function of agent B, which may be: (i) total weighted completion time, (ii) maximum lateness, (iii) maximum completion time. An extensive computational experience shows the effectiveness of the approach.
Revenue-based Call Admission Control for MPEG-4 wireless videoconference traffic
Authors: Aggelos Lazaris, Polychronis Koutsakis
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

In this work, we first introduce a new traffic model for medium quality MPEG-4 videoconference traffic and then proceed to use it in the implementation of a new Call Admission Control scheme. Our scheme makes decisions on the acceptance/rejection of a new video call not only based on the predicted capacity that users will consume, but also on the possible revenue gained for the provider when degrading current users in order to accommodate new ones. Via an extensive simulation study our scheme is shown to provide excellent Quality of Service (QoS) to wireless videoconference users.
Implementing Power System Management via Semantic Web Services Composition
Authors: Qing Liu, Jinyu Wen, Haishun Sun
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The increasing amount of application software in power system demands for an effectual software integration pattern. Web services satisfy the requirement. But WSDL and UDDI standards lack the capability of semantic representation. In this paper, we present a semantic description for service based on OWL-S, and design an exactor which gets IPOE information from WSDL/UDDI, propose an architecture SM4PS based on OWL-S and power system domain ontology for service discovery and composition. A prototype of composing service for a provincial power system operation management is shown.
Acquisition of a New Type of Lexical-Semantic Relation from German Corpora
Authors: Lothar Lemnitzer, Piklu Gupta, Holger Wunsch
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

In this paper we will report on work in progress towards increasing the relational density of the German wordnet. It is also an experiment in corpus-based lexical acquisition. The source of the acquisition is a large corpus of German newspaper texts. The target is the German wordnet (GermaNet). We acquire a new type of lexical-semantic relation, i.e. the relation between the verbal head of a predicate and the nominal head of its argument. We investigate how the insertion of instances of this relation into the German wordnet GermaNet affects the neighbourhood of the nodes which are connected by an instance of the new relation. Special attention is given in this paper to the language-specific aspects of the acquisition process.
You are what you say: using meeting participants' speech to detect their roles and expertise
Authors: Satanjeev Banerjee, Alexander I. Rudnicky
Venue: Proceedings of the HLT-NAACL 2006 Workshop on Analyzing Conversations in Text and Speech (2006)

Our goal is to automatically detect the functional roles that meeting participants play, as well as the expertise they bring to meetings. To perform this task, we build decision tree classifiers that use a combination of simple speech features (speech lengths and spoken keywords) extracted from the participants' speech in meetings. We show that this algorithm results in a role detection accuracy of 83% on unseen test data, where the random baseline is 33.3%. We also introduce a simple aggregation mechanism that combines evidence of the participants' expertise from multiple meetings. We show that this aggregation mechanism improves the role detection accuracy from 66.7% (when aggregating over a single meeting) to 83% (when aggregating over 5 meetings).
Guarding algorithms and robust video surveillance
Authors: Simeon C. Ntafos, B. Prabhakaran
Venue:  (2008)

This dissertation presents the theoretical and experimental results in the course of my pursuit of the Ph.D. degree. My Ph.D. study fundamentally consists of two major parts: theoretical study and system study. For the theoretical part, I mainly study some &ldquo;guarding&rdquo; problems in computational geometry, especially Art Gallery problems. Two-Guard Art Gallery problem, City Guarding problems are intensively studied. The significant results include: (a) complexity study (NP-hardness proof), approximation algorithm design and special case study for Two-Guard Art Gallery problem, (b) modeling, bounds proof, algorithm design and complexity study for City Guarding problems, which consist of three sub-problems: Roof Guarding, Ground and Wall Guarding and City Guarding. The theoretical research makes many applications possible. The system study is mainly on Video Surveillance systems: (a) fault detection framework for Video Surveillance system and (b) surveillance camera placement optimization. In the first part, I devise algorithms and implement the framework for Video Surveillance systems such that they are capable to detect spatial faults and temporal faults without additional hardware or personnel. In the second part, I seek a robust placement algorithm to enhance the fault tolerance of the Video Surveillance systems. The system research extensively uses results from graph theory and computational geometry.
Research on the Application of Neural Network in Diaphragm Icing Sensor Fault Diagnosis
Authors: Zhen Zhang, Jie Zhang, Lin Ye, Ying Zheng
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

As the core component of the Icing Detection System of aircrafts, the reliability of Diaphragm Icing Sensor is a key factor for the ice detection system to work normally. This paper makes use of Neural Network and Autoregressive Exogeneous Model (ARX) to set up the output prediction model of the diaphragm icing sensor. Compare the predicted output of the model with the actual output to diagnose sensor faults of the sensor. According to the data acquiring from our experiment platform of Diaphragm Icing Sensor, it has been proved that this method is effective for fault diagnosis of the Diaphragm Icing Sensor.
Self-organizing Fuzzy Logic Steering Algorithm in Complex Air Condition System
Authors: Michal Lower
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

This paper proposes considering the problem of automatic controlling of heating and air-condition system in conference halls with changeable structure and shape. Modern conference halls are often designed in such a way that there are possibilities of making many different arrangements within the limits of one expanse. The great hall can be divided into e.g. three smaller rooms. It is obvious that each possible configuration should require different algorithm of heating and air condition systems controlling.