ppxscal/embedding_network huggingface dataset:
Enforcing Confidentiality Constraints on Sensitive Databases with Lightweight Trusted Clients
Authors: Valentina Ciriani, Sabrina Capitani Di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

Existing approaches for protecting sensitive information stored (outsourced) at external "honest-but-curious" servers are typically based on an overlying layer of encryption that is applied on the whole information, or use a combination of fragmentation and encryption. The computational load imposed by encryption makes such approaches not suitable for scenarios with lightweight clients.In this paper, we address this issue and propose a novel model for enforcing privacy requirements on the outsourced information which departs from encryption. The basic idea of our approach is to store a small portion of the data (just enough to break sensitive associations) on the client, which is trusted being under the data owner control, while storing the remaining information in clear form at the external (honest-but-curious) server. We model the problem and provide a solution for it aiming at minimizing the data stored at the client. We also illustrate the execution of queries on the fragmented information.
An event-driven information dissemination model
Authors: Raghul Gunasekaran, Mallikarjun Shankar, Dieter Gawlick, Steve Fisher, Aravind Yalamanchi, Ronny Fehling, Hairong Qi
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

We note that over the past decade publish-subscribe systems have improved the ability of users to exchange information but we argue that these systems have been either restrictive or simplistic - relying on narrowly defined channels for data exchange. The Information Dissemination (INFOD) approach we present here introduces a flexible and dynamic framework for brokering information in publish-subscribe systems. INFOD enables communities of interest to constitute and use vocabularies to describe their interests as well as their capabilities (available information). Publishers, consumers and subscribers are real-world entities characterized in terms of vocabularies and constraints within an INFOD registry. Subscribers define subscriptions expressing events of interest at candidate publishers and constraints on the run-time event data. The registry matches entities based on subscriptions and constraints, and sets up event channels between them.
Study on the Retardation of Hydrochloric Acid Fume
Authors: Wu Yan, Zheng Wei, Jia Qingzhu, Wang Bingwen
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

A novel kind of the hydrochloric acid fume retardant was prepared with the long chain fatty alcohols and the nonionic surfactants in this work. The results showed that the film-forming materials could spread as monolayers quickly and spontaneously at the hydrochloric acid surface. The mixed monolayers exhibited considerably larger effective resistance to hydrochloric acid fume when the concentration of the retardant was 7.5 g/m2, and it could retard hydrochloric acid fume almost completely even lasting for 10h. Moreover, the environmental factors, such as the temperature, the wind force and the dust, were also discussed in detail, and the results showed that the retardant had a good anti-interference ability. Also, microstructures of the mixed monolayers were obtained by an atomic force microscopy (AFM). From AFM images, it could be found that the mixed monolayers gave a film with a less-defective and relatively flat surface.
Development of Quantitative Usability Evaluation Method
Authors: Shin'Ichi Fukuzumi, Teruya Ikegami, Hidehiko Okada
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

A variety of evaluation methods are practiced in order to make more appealing and improve the usability of computer systems. The authors have developed a quantitative usability evaluation method that uses a checklist that outlines an evaluation procedure and clarifies judging standards. This paper describes this quantitative usability evaluation method that is not influenced by an evaluator's subjective impression. Moreover, such clear and precise definitions makes checklist-based evaluations more repeatable (thus more reliable) and less affected by differences among evaluators. The effectiveness of our checklist has been evaluated by the experiments with novice and experienced evaluators. This article reports the method and results of the experiments.
What humour tells us about discourse theories
Authors: Arjun Karande
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop (2006)

Many verbal jokes, like garden path sentences, pose difficulties to models of discourse since the initially primed interpretation needs to be discarded and a new one created based on subsequent statements. The effect of the joke depends on the fact that the second (correct) interpretation was not visible earlier. Existing models of discourse semantics in principle generate all interpretations of discourse fragments and carry these until contradicted, and thus the dissonance criteria in humour cannot be met. Computationally, maintaining all possible worlds in a discourse is very inefficient, thus computing only the maximum-likelihood interpretation seems to be a more efficient choice on average. In this work we outline a probabilistic lexicon based lexical semantics approach which seems to be a reasonable construct for discourse in general and use some examples from humour to demonstrate its working.
Scene Text Recognition Using Similarity and a Lexicon with Sparse Belief Propagation
Authors: Jerod J. Weinman, Erik Learned-Miller, Allen R. Hanson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Scene text recognition (STR) is the recognition of text anywhere in the environment, such as signs and storefronts. Relative to document recognition, it is challenging because of font variability, minimal language context, and uncontrolled conditions. Much information available to solve this problem is frequently ignored or used sequentially. Similarity between character images is often overlooked as useful information. Because of language priors, a recognizer may assign different labels to identical characters. Directly comparing characters to each other, rather than only a model, helps ensure that similar instances receive the same label. Lexicons improve recognition accuracy but are used post hoc. We introduce a probabilistic model for STR that integrates similarity, language properties, and lexical decision. Inference is accelerated with sparse belief propagation, a bottom-up method for shortening messages by reducing the dependency between weakly supported hypotheses. By fusing information sources in one model, we eliminate unrecoverable errors that result from sequential processing, improving accuracy. In experimental results recognizing text from images of signs in outdoor scenes, incorporating similarity reduces character recognition error by 19 percent, the lexicon reduces word recognition error by 35 percent, and sparse belief propagation reduces the lexicon words considered by 99.9 percent with a 12X speedup and no loss in accuracy.
Content-Aware Video Editing in the Temporal Domain
Authors: Kristine Slot, René Truelsen, Jon Sporring
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

An extension of 2D Seam Carving [Avidan and Shamir, 2007] is presented, which allows for automatic resizing the duration of video from stationary cameras without interfering with the velocities of the objects in the scenes. We are not interested in cutting out entire frames, but instead in removing spatial information across different frames. Thus we identify a set of pixels across different video frames to be either removed or duplicated in a seamless manner by analyzing 3D space-time sheets in the videos. Results are presented on several challenging video sequences.
Survey of E-Government Portals in European Capitals and Large Cities: A Benchmarking Study of G2B-Services
Authors: Frank Hogrebe, Nadine Blinn, Markus Nüttgens
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

To fulfil the requirements of the EU Services Directive, suppliers of public services have to realign their product and process organisation. At present, a summary on the implementation status does not exist for European capitals and large cities. Thus, the paper presents the status quo by illustrating the results of a benchmarking survey. The survey analyses the offer of G2B eServices in all 27 European capitals and all European cities with more than 500.000 inhabitants and it was done in 21 first EU-languages and in English as second language. The findings of the survey address academic research as well as administration practice in the context of eGovernment.
Domain-dependent parameter selection of search-based algorithms compatible with user performance criteria
Authors: Biplav Srivastava, Anupam Mediratta
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Search-based algorithms, like planners, schedulers and satisfiability solvers, are notorious for having numerous parameters with a wide choice of values that can affect their performance drastically. As a result, the users of these algorithms, who may not be search experts, spend a significant time in tuning the values of the parameters to get acceptable performance on their particular problem domains. In this paper, we present a learning-based approach for automatic tuning of search-based algorithms to help such users. The benefit of our methodology is that it handles diverse parameter types, performs effectively for a broad range of systematic as well as non-systematic search based solvers (the selected parameters could make the algorithms solve up to 100% problems while the bad parameters would lead to none being solved), incorporates user-specified performance criteria (Φ) and is easy to implement. Moreover, the selected parameter will satisfy Φ in the first try or the ranked candidates can be used along with Φ to minimize the number of times the parameter settings need to he adjusted until a problem is solved.
Mapping of Usability Guidelines onto User's Temporal Viewpoint Matrix
Authors: Tadashi Kobayashi, Hiromasa Nakatani
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

There are many sets of usability guidelines that could be used to quantitatively evaluate products or systems. There were, however, no quantitative means so far to evaluate a set of usability guidelines by comparing with another set of usability guidelines of an established reputation. In this paper, a new evaluation method of usability guidelines is introduced and verified as an applicable evaluation method to all kinds of usability guidelines. Our method has characteristics of employing two temporal scales, forming a user's temporal viewpoint matrix with a scale of utilization timeline and a scale of applied principles, as the means of improving the comparison accuracy. By comparing the graph patterns for each scale, we can provide a means of qualitative evaluation of the targeted guidelines; by comparing the computed similarity value of user's temporal viewpoint matrix, we can provide a means of quantitative evaluation of the targeted guidelines.
Fuzzy Control for a Visual Servoing System
Authors: Xiaojing Shen, Runyuan Yin
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper is concerned with a specific class of IBVS problem, in which a camera is constrained to move in the depth-axis (or Z-axis). Such a constraint condition makes it possible to find an image moment reflecting target depth. Using image moments can be benefit to the performance of visual servoing system, such as image-noise-insensitive, economical computation, and etc.In this paper, the mathematic relationship between zero-order image moment (M00) and target depth is firstly deduced. Then the appropriate image feature is found, and thus leads to an effective fuzzy logical controller (FLC). The simulation results show that in the control of our FLC, visual servoing system performances well with a high accuracy.
Decidability of Sub-theories of Polynomials over a Finite Field
Authors: Alla Sirokofskich
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Let ${\mathbb{F}}_q$ be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, ${\mathbb{F}}_q[t]$, of one variable, in the language which contains symbols for addition, multiplication by t, inequalities of degrees, divisibility of degrees by a positive integer and, for each $d\in{\mathbb{F}}_q[t]$, a symbol for divisibility by d. We discuss the possibility of extending our results to the structure which results if one includes a predicate for the relation "x is a power of t". 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
INFORMATION TECHNOLOGY REQUIREMENTS FOR COMPLIANCE WITH SECTION 404: INFORMATION TECHNOLOGY REQUIREMENTS FOR COMPLIANCE WITH SECTION 404 OF THE SARBANES-OXLEY ACT OF 2002
Authors: Stephan Harvey
Venue:  (2009)

The problem faced by Information Technology departments is the lack of direction in complying with the Act. Section 404 of the Act addresses the requirement of effective internal controls regarding financial statement reporting being in place, and that external auditors attest that the management statement stating the existence and effectiveness of the controls is correct. Companies are struggling with how to supply management the necessary assurance that the internal controls are effective. The method used in this study was the Delphi method. This method utilized individual interviews to elicit the intuitive information that was available from experts in the analyzed field. Each company has its own unique situation in meeting the compliance regulations of the Act. Analysis of the data further indicated that IT departments have the capability to contribute to the compliance efforts, especially when there was a clear definition of their appropriate role. Finally, it was revealed the importance attributed to compliance with the Act, while investigating some of the problems experienced. 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
Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks
Authors: J. A. Naranjo, J. A. López-Ramos, L. G. Casado
Venue: Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks (2009)

Key distribution for multimedia live streaming peer-to-peer overlay networks is a field still in its childhood stage. A scheme designed for networks of this kind must seek security and efficiency while keeping in mind the following restrictions: limited bandwidth, continuous playing, great audience size and clients churn. This paper introduces two novel schemes that allow a trade-off between security and efficiency by allowing to dynamically vary the number of levels used in the key hierarchy. These changes are motivated by great variations in audience size, and initiated by decision of the Key Server. Additionally, a comparative study of both is presented, focusing on security and audience size. Results show that larger key hierarchies can supply bigger audiences, but offer less security against statistical attacks. The opposite happens for shorter key hierarchies.
The Application of Data Mining in Tourism Information
Authors: Zou Guoxia, Tang Jianqing
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Using SAS/EM tools, with the classification technology of data mining, data of touring investigation of Guilin City TouringAgency, perform classification mining from two aspects that is tourists' consumption and comprehensive evaluation. In this process, realize classification data mining's whole process perfectly, includes:data pretreatment, data mining, obtain corresponding rules, analyzing results. Among these, the data pretreatment use x2 statistical testing to select the properties associated with the mining targets. This step is very important, because the algorithm c4.5 that SAS/EM decision tree node supports, which requires too much for effectiveness of property.
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
Authors: Chandra Chekuri, Alina Ene, Nitish Korula
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V,E) and k request pairs R 1, ..., R k , where each R i consists of a source-destination pair (s i ,t i ), a demand d i and a weight w i . The goal is to find a maximum weight subset of requests that can be routed unsplittably in G. Most previous work on UFP has focused on the no-bottleneck case in which the maximum demand of the requests is at most the smallest edge capacity. Inspired by the recent work of Bansal et al. [3] on UFP on a path without the above assumption, we consider UFP on paths as well as trees. We give a simple O(logn) approximation for UFP on trees when all weights are identical; this yields an O(log2 n) approximation for the weighted case. These are the first non-trivial approximations for UFP on trees. We develop an LP relaxation for UFP on paths that has an integrality gap of O(log2 n); previously there was no relaxation with o(n) gap. We also consider UFP in general graphs and CPIPs without the no-bottleneck assumption and obtain new and useful results.
Forecasting Model over Random Interval Data Stream Based on Kalman Filter
Authors: Yu Yonghong, Bai Wenyang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

It is very important in a lot of applications to forecast future trend of data streams. Recent works on prediction analysis over data streams mainly supposed that data are complete and data occur at equal time interval. Adopting state transition of time series and Kalman filter, a predictive model for forecasting the trend of data stream with missing values and data occurring in random time interval is proposed in the paper. The proposed model adopts Kalman gain matrix to compute automatically the maximum likelihood estimation of data stream to obtain optimal estimates in linear, no deviation, and minimum mean square error way. Experiment shows that the proposed model has higher performance and provides better trend prediction of data stream in bounded memory and limited run time, and it can predict future trend of data streams online.
Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing
Authors: Dorabella Santos, Amaro Sousa, Filipe Alvelos
Venue: Traffic Management and Traffic Engineering for the Future Internet: First Euro-NF Workshop, FITraMEn 2008, Porto, Portugal, December 11-12, Revised Selected Papers (2009)

This paper focuses on traffic engineering of telecommunication networks, which arises in the context of switched Ethernet networks. It addresses the minimization of the maximum network link load. With the IEEE 802.1s Multiple Spanning Tree Protocol, it is possible to define multiple routing spanning trees to provide multiple alternatives to route VLAN traffic demands. Two compact mixed integer linear programming models defining the optimization problem and several models based on the Dantzig-Wolfe decomposition principle, which are solved by branch-and-price, are proposed and compared. The different decompositions result from defining as subproblems either the supporting spanning trees and/or the demand routing paths, which can be solved by well known efficient algorithms.
Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications, 1st edition
Authors: Michael Affenzeller, Stephan Winkler, Stefan Wagner, Andreas Beham
Venue:  (2009)

Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for algorithm development.The book focuses on both theoretical and empirical aspects. The theoretical sections explore the important and characteristic properties of the basic GA as well as main characteristics of the selected algorithmic extensions developed by the authors. In the empirical parts of the text, the authors apply GAs to two combinatorial optimization problems: the traveling salesman and capacitated vehicle routing problems. To highlight the properties of the algorithmic measures in the field of GP, they analyze GP-based nonlinear structure identification applied to time series and classification problems. Written by core members of the HeuristicLab team, this book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts. By comparing the results of standard GA and GP implementation with several algorithmic extensions, it also shows how to substantially increase achievable solution quality.
Learning styles and cognitive traits - Their relationship and its benefits in web-based educational systems
Authors: Sabine Graf, Tzu-Chien Liu, Kinshuk, Nian-Shing Chen, Stephen J. H. Yang
Venue: Computers in Human Behavior (2009)

Different learners have different needs; they differ, for example, in their learning goals, their prior knowledge, their learning styles, and their cognitive abilities. Adaptive web-based educational systems aim to cater individual learners by customizing courses to suit their needs. In this paper, we investigate the benefits of incorporating learning styles and cognitive traits in web-based educational systems. Adaptivity aspects based on cognitive traits and learning styles enrich each other, enabling systems to provide learners with courses which fit their needs more accurately. Furthermore, consideration of learning styles and cognitive traits can contribute to more accurate student modelling. In this paper, the relationship between learning styles, in particular the Felder-Silverman learning style model (FSLSM), and working memory capacity, a cognitive trait, is investigated. For adaptive educational systems that consider either only learning styles or only cognitive traits, the additional information can be used to provide more holistic adaptivity. For systems that already incorporate both learning styles and cognitive traits, the relationship can be used to improve the detection process of both by including the additional information of learning style into the detection process of cognitive traits and vice versa. This leads to a more reliable student model.