ppxscal/embedding_network huggingface dataset:
Hardware-Assisted Application-Level Access Control
Authors: Yu-Yuan Chen, Ruby B. Lee
Venue: Proceedings of the 12th International Conference on Information Security (2009)

Applications typically rely on the operating system to enforce access control policies such as MAC, DAC, or other policies. However, in the face of a compromised operating system, such protection mechanisms may be ineffective. Since security-sensitive applications are most motivated to maintain access control to their secret or sensitive information, and have no control over the operating system, it is desirable to provide mechanisms to enable applications to protect information with application-specific policies, in spite of a compromised operating system. In this paper, we enable application-level access control and information sharing with direct hardware support and protection, bypassing the dependency on the operating system. We analyze an originator-controlled information sharing policy (ORCON), where the content creator specifies who has access to the file created and maintains this control after the file has been distributed. We show that this policy can be enforced by the software-hardware mechanisms provided by the Secret Protection (SP) architecture, where a Trusted Software Module (TSM) is directly protected by SP's hardware features. We develop a proof-of-concept text editor application which contains such a TSM. This TSM can implement many different policies, not just the originator-controlled policy that we have defined. We also propose a general methodology for trust-partitioning an application into security-critical and non-critical parts.
Learning a multi-dimensional companding function for lossy source coding
Authors: Shin-ichi Maeda, Shin Ishii
Venue: Neural Networks (2009)

Although the importance of lossy source coding has been growing, the general and practical methodology for its design has not been completely resolved. The well-known vector quantization (VQ) can represent any fixed-length lossy source coding, but requires too much computation resource. Companding vector quantization (CVQ) can reduce the complexity of non-structured VQ by replacing vector quantization with a set of scalar quantizations and can represent a wide class of practically useful VQs. Although an analytical derivation of optimal CVQ is difficult except for very limited cases, optimization using data samples can be performed instead. Here we propose a CVQ optimization method, which includes bit allocation by a newly derived distortion formula as a generalization of Bennett's formula, and test its validity. We applied the method to transform coding and compared the performance of our CVQ with those of Karhunen-Loeve transformation (KLT)-based coding and non-structured VQ. As a consequence, we found that our trained CVQ outperforms not only KLT-based coding but also non-structured VQ in the case of high bit-rate coding of linear mixtures of uniform sources. We also found that trained CVQ even outperformed KLT-based coding in the low bit-rate coding of a Gaussian source. To highlight the advantages of our approach, we also discuss the degradation of non-structured VQ and the limitations of theoretical analyses which are valid for high bit-rate coding.
Type-Based Object Immutability with Flexible Initialization
Authors: Christian Haack, Erik Poll
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

We present a type system for checking object immutability, read-only references, and class immutability in an open or closed world. To allow object initialization outside object constructors (which is often needed in practice), immutable objects are initialized in lexically scoped regions. The system is simple and direct; its only type qualifiers specify immutability properties. No auxiliary annotations, e.g., ownership types, are needed, yet good support for deep immutability is provided. To express object confinement, as required for class immutability in an open world, we use qualifier polymorphism. The system has two versions: one with explicit specification commands that delimit the object initialization phase, and one where such commands are implicit and inferred. In the latter version, all annotations are compatible with Java's extended annotation syntax, as proposed in JSR 308.
Value-Event Path Based Policy Management Model
Authors: Fenglin Peng, Xuping Jiang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Value based management (VBM) aims to promote value of enterprise. In the management process, value of enterprise is changed dynamically and the value change corresponds to an event which happens to the enterprise, such as success of new product development, fall of share price and so on. In other words, an event indicates a change of enterprise value. In this paper, the concepts of enterprise event, value-event node, and value-event path are proposed and defined formally. A process of VBM can be looked upon as a value-event path. A good management process is a value-event path along which value increases with the event sequence, otherwise value decreases with the event sequence. Furthermore, Value-Event Path Based Policy Management Model is also proposed in this paper. In the model, a policy is a management activity which is driven by an enterprise event, and the execution result of the policy is a new event. Finally, two typical examples are given to show that Value-Event Path Based Policy Management Model is a novel policy-based tool of VBM planning and decision support.
Exploring the experiences concerning leadership communication in online gaming groups
Authors: Marko Siitonen
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

This paper looks at leadership communication in the context of multiplayer computer games and the groups that operate within them. In multiplayer games promoting teamwork and long-term cooperation, issues of management and leadership are prevalent. The paper explores the experiences that members of multiplayer communities have towards leadership communication in multiplayer games by looking at one specific case of organized team play within the framework of a turn-based online strategy game. The data utilized in this study consists of themed player interviews conducted via e-mail. The analysis proposes three central dimensions that emerged from the data. These were labeled: 1) the leader as a primus motor, 2) the necessity of authority, and 3) the discourse of leadership as work. At the end of the article, directions for future research are outlined.
Glancephone: an exploration of human expression
Authors: Richard Harper, Stuart Taylor
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In this paper, we describe the design and ethnographic study of a phone developed so as to allow people to glance at each other, rather than simply message or voice call. Glancephones work through having a form factor that allows them to be placed upright when a user wants to be available for glancing, and support a web-based application that allows glances, bitmap images, to be taken and sent to a remote viewer on request, via GPRS connections. Glancephones were originally invented to allow callers to see if it is appropriate to call or interrupt and thus act like normal glances in face-to-face situations. Ethnographic studies of the use indicate that people prefer using the devices not to support greeting sequences, however, but to enable others to glance at them. It was found that Glacephones were used to draw attention to oneself, not to encourage better control of interruption and greeting sequences. The paper uses this data to remark on the concepts of human expression that underscore much of the research reported in Mobile HCI, and it proposes Bourdieu's concepts of habitus and relatedly, distinction, as explanatory tools for this and other evidence about expression enabled by mobile and other technologies of communication.
Influence of Antigenic Mutations in Time Evolution of the Immune Memory --- A Dynamic Modeling
Authors: Alexandre Castro, Carlos Frederico Fronza, Poliana Fernanda Giachetto, Domingos Alves
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

In this paper, we study the behavior of immune memory against antigenic mutation. Using a dynamic model proposed in previous studies, we have performed simulations of several inoculations, where in each virtual sample the viral population undergoes mutations. Our results suggest that the sustainability of the immunizations is dependent on viral variability and that the memory lifetimes are not random, what contradicts what was suggested by recent works. We show that what may cause an apparent random behavior of the immune memory is the antigenic variability.
Clustering rows and/or columns of a two-way contingency table and a related distribution theory
Authors: C. Hirotsu
Venue: Computational Statistics Data Analysis (2009)

The row-wise multiple comparison procedure proposed in Hirotsu [Hirotsu, C., 1977. Multiple comparisons and clustering rows in a contingency table. Quality 7, 27-33 (in Japanese); Hirotsu, C., 1983. Defining the pattern of association in two-way contingency tables. Biometrika 70, 579-589] has been verified to be useful for clustering rows and/or columns of a contingency table in several applications. Although the method improved the preceding work there was still a gap between the squared distance between the two clusters of rows and the largest root of a Wishart matrix as a reference statistic for evaluating the significance of the clustering. In this paper we extend the squared distance to a generalized squared distance among any number of rows or clusters of rows and dissolves the loss of power in the process of the clustering procedure. If there is a natural ordering in columns we define an order sensitive squared distance and then the reference distribution becomes that of the largest root of a non-orthogonal Wishart matrix, which is very difficult to handle. We therefore propose a very nice @g^2-approximation which improves the usual normal approximation in Anderson [Anderson, T.W., 2003. An Introduction to Multivariate Statistical Analysis. 3rd ed. Wiley Intersciences, New York] and also the first @g^2-approximation introduced in Hirotsu [Hirotsu, C., 1991. An approach to comparing treatments based on repeated measures. Biometrika 75, 583-594]. A two-way table reported by Guttman [Guttman, L., 1971. Measurement as structural theory. Psychometrika 36, 329-347] and analyzed by Greenacre [Greenacre, M.J., 1988. Clustering the rows and columns of a contingency table. Journal of Classification 5, 39-51] is reanalyzed and a very nice interpretation of the data has been obtained.
Scale Space Hierarchy of Segments
Authors: Haruhiko Nishiguchi, Atsushi Imiya, Tomoya Sakai
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper, we develop a segmentation algorithm using configurations of singular points in the linear scale space. We define segment edges as a zero-crossing set in the linear scale space using the singular points. An image in the linear scale space is the convolution of the image and the Gaussian kernel. The Gaussian kernel of an appropriate variance is a typical presmoothing operator for segmentation. The variance is heuristically selected using statistics of images such as the noise distribution in images. The variance of the kernel is determined using the singular point configuration in the linear scale space, since singular points in the linear scale space allow the extraction of the dominant parts of an image. This scale selection strategy derives the hierarchical structure of the segments. 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
Compositional Model Checking of product-form CTMCs
Authors: Paolo Ballarini, András Horváth
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Product form Markov chains are a class of compositional Markovian models that can be proved to benefit from a decomposed solution of the steady-state distribution (i.e. the steady-state distribution is given by the product of the components' steady-state distributions). In this paper we focus on the Boucherie product processes, a specific class of product form Continuous Time Markov Chains. We show that the compositional constraints that lead to the product form result in that class, can be exploited in the model checking problem as well, leading to a decomposed semantics for a fragment of the Continuous Stochastic Logic.
Robust Design about Container Terminal Logistics System
Authors: Li Li, Wang Xiaodong, Zhang Mengjie
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Development and application of modeling and simulation in container terminal logistics system is rapid and wide, and especially the robust design is latest research field. This paper describes the process of the modeling and simulation of container terminal logistics system, which includes Logistics system modeling technology, Verification Validation and Accreditation and Screening Test and Robust Design , and then the research approach and target, the primary coverage and the key problem about robust design is given after summarized and selected. In this study investigators tend to contributes to reduce the difference between the simulation and reality system and increase the capacity and efficiency of container terminal logistics system. Finally a possible robust plan would be provided.
Research on a Method of Knowledge Reused for Switchgear Design
Authors: Zeng Xiaosong, Tan Qiong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper analyses the characteristics of switchgear structures and designing knowledge and puts forward a method to describe the whole switchgear unit and role element. It gives the configuration regulations for role module and judgment rules for similarity of cases. This paper also establishes an assisted designing system using case-based reasoning (CBR) and configuration rules after analyzing the configuration design knowledge and the method to implement the configuration. This method is applied to an actual design case in the end.
Learning the Difference between Partially Observable Dynamical Systems
Authors: Sami Zhioua, Doina Precup, François Laviolette, Josée Desharnais
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

We propose a new approach for estimating the difference between two partially observable dynamical systems. We assume that one can interact with the systems by performing actions and receiving observations. The key idea is to define a Markov Decision Process (MDP) based on the systems to be compared, in such a way that the optimal value of the MDP initial state can be interpreted as a divergence (or dissimilarity) between the systems. This dissimilarity can then be estimated by reinforcement learning methods. Moreover, the optimal policy will contain information about the actions which most distinguish the systems. Empirical results show that this approach is useful in detecting both big and small differences, as well as in comparing systems with different internal structure.
Merging PropBank, NomBank, TimeBank, Penn Discourse Treebank and Coreference
Authors: James Pustejovsky, Adam Meyers, Martha Palmer, Massimo Poesio
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

Many recent annotation efforts for English have focused on pieces of the larger problem of semantic annotation, rather than initially producing a single unified representation. This paper discusses the issues involved in merging four of these efforts into a unified linguistic structure: PropBank, NomBank, the Discourse Treebank and Coreference Annotation undertaken at the University of Essex. We discuss resolving overlapping and conflicting annotation as well as how the various annotation schemes can reinforce each other to produce a representation that is greater than the sum of its parts.
Agent-based distributed manufacturing control: A state-of-the-art survey
Authors: Paulo Leitão
Venue: Engineering Applications of Artificial Intelligence (2009)

Manufacturing has faced significant changes during the last years, namely the move from a local economy towards a global and competitive economy, with markets demanding for highly customized products of high quality at lower costs, and with short life cycles. In this environment, manufacturing enterprises, to remain competitive, must respond closely to customer demands by improving their flexibility and agility, while maintaining their productivity and quality. Dynamic response to emergence is becoming a key issue in manufacturing field because traditional manufacturing control systems are built upon rigid control architectures, which cannot respond efficiently and effectively to dynamic change. In these circumstances, the current challenge is to develop manufacturing control systems that exhibit intelligence, robustness and adaptation to the environment changes and disturbances. The introduction of multi-agent systems and holonic manufacturing systems paradigms addresses these requirements, bringing the advantages of modularity, decentralization, autonomy, scalability and re-usability. This paper surveys the literature in manufacturing control systems using distributed artificial intelligence techniques, namely multi-agent systems and holonic manufacturing systems principles. The paper also discusses the reasons for the weak adoption of these approaches by industry and points out the challenges and research opportunities for the future.
A user-extensible and adaptable parser architecture
Authors: John Tobin, Carl Vogel
Venue: Knowledge-Based Systems (2009)

Some parsers need to be very precise and strict when parsing, yet must allow users to easily adapt or extend the parser to parse new inputs, without requiring that the user have an in-depth knowledge and understanding of the parser's internal workings. This paper presents a novel parsing architecture, designed for parsing Postfix log files, that aims to make the process of parsing new inputs as simple as possible, enabling users to trivially add new rules (to parse variants of existing inputs) and relatively easily add new actions (to process a previously unknown category of input). The architecture scales linearly or better as the number of rules and size of input increases, making it suitable for parsing large corpora or months of accumulated data.
Special subsets of difference sets with particular emphasis on skew Hadamard difference sets
Authors: Robert S. Coulter, Todd Gutekunst
Venue: Designs, Codes and Cryptography (2009)

This article introduces a new approach to studying difference sets via their additive properties. We introduce the concept of special subsets, which are interesting combinatorial objects in their own right, but also provide a mechanism for measuring additive regularity. Skew Hadamard difference sets are given special attention, and the structure of their special subsets leads to several results on multipliers, including a categorisation of the full multiplier group of an abelian skew Hadamard difference set. We also count the number of ways to write elements as a product of any number of elements of a skew Hadamard difference set.
Extending Quality in Use to Provide a Framework for Usability Measurement
Authors: Nigel Bevan
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

ISO has recently developed a new more comprehensive definition of quality in use, which has usability, flexibility and safety as subcharacteristics that can be quantified from the perspectives of different stakeholders, including users, managers and maintainers. While this provides a more complete set of requirements for operational use of a product, it also presents new challenges for measurement.
Short Communication: Duration modification using glottal closure instants and vowel onset points
Authors: K. Sreenivasa Rao, B. Yegnanarayana
Venue: Speech Communication (2009)

This paper proposes a method for duration (time scale) modification using glottal closure instants (GCI, also known as instants of significant excitation) and vowel onset points (VOP). In general, most of the time scale modification methods attempt to vary the duration of speech segments uniformly over all regions. But it is observed that consonant regions and transition regions between a consonant and the following vowel, and between two consonant regions do not vary appreciably with speaking rate. The proposed method implements the duration modification without changing the durations of the transition and consonant regions. Vowel onset points are used to identify the transition and consonant regions. A VOP is the instant at which the onset of the vowel takes place, which corresponds to the transition from a consonant to the following vowel in most cases. The VOPs are computed using the Hilbert envelope of linear prediction (LP) residual. The instants of significant excitation correspond to the instants of glottal closure (epochs) in the case of voiced speech, and to some random excitations, like the onset of burst, in the case of nonvoiced speech. Manipulation of duration is achieved by modifying the duration of the LP residual with the help of instants of significant excitation as pitch markers. The modified residual is used to excite the time-varying filter whose parameters are derived from the original speech signal. Perceptual quality of the synthesized speech is found to be natural. Performance of the proposed method is compared with the method, where the duration of speech is modified uniformly over all regions. Samples of speech signals for different modification factors is available for listening at http://sit.iitkgp.ernet.in/~ksrao/result.html.
Technical communique: Limit or limit superior? Observations on the convergence of some iterative learning control schemes
Authors: Robert Schmid
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we survey the convergence properties of a number of iterative learning control schemes from the past decade. We observe a common technical error that appeared in these papers, point out how the results should be corrected, and finally consider the significance of these corrections with regard to the effectiveness of the schemes concerned.