ppxscal/embedding_network huggingface dataset:
Linguistic summarization of time series using a fuzzy quantifier driven aggregation
Authors: J. Kacprzyk, A. Wilbik, S. Zadrożny
Venue: Fuzzy Sets and Systems (2008)

We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of trends identified here with straight line segments of a piecewise linear approximation of time series. We first show how to construct such an approximation. Then we employ a set of features (attributes) to characterize the trends such as the slope of the line segment, the goodness of approximation and the length of the trend. The derivation of a linguistic summary of a time series is then related to a linguistic quantifier driven aggregation of trends. For this purpose we employ the classic Zadeh's calculus of linguistically quantified propositions but, extending our previous works, with different t-norms in addition to the basic minimum. We show an application to the analysis of time-series data on daily quotations of an investment fund over an eight year period, present some interesting linguistic summaries obtained, and show results for different t-norms. The results are very promising.
Drying Simulation of Ceramic Shell Build Up Process
Authors: Zawati Harun, D. T. Gethin
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this work, a two-dimensional numerical model for the convective drying process of ceramic shell layers was developed. The governing system of fully coupled non-linear partial differential equations describing the process was derived from a mechanistic approach along with the implementation of continuum model. The most extensive formulation of the material used in many hygrothermal and soil transport investigation was adopted as the basis for further development in this work. Two examples comprising one dimensional brick drying and shell drying are solved to validate and demonstrate robustness of the approach. Validation within a one dimensional framework showed that the model presented is in a good agreement with other studies that have been reported previously in the drying of porous material. A two layers case study which illustrate the drying of ceramic shell layers are compared and contrasted against experimental data on shell drying, showing good agreements.
A type system for data-flow integrity on windows vista
Authors: Avik Chaudhuri, Prasad Naldurg, Sriram Rajamani
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow attack. Thus, it is possible to eliminate such attacks by statically restricting trusted code. We formalize this model by designing a type system that can efficiently enforce data-flow integrity on Windows Vista. Typechecking guarantees that objects whose contents are statically trusted never contain untrusted values, regardless of what untrusted code runs in the environment. Some of Windows Vista's runtime access checks are necessary for soundness; others are redundant and can be optimized away.
Defect List Compression
Authors: Giovanni Motta, Erik Ordentlich, Marcelo J. Weinberger
Venue: Proceedings of the Data Compression Conference (2008)

We consider a setting relevant to the design of storage systems in which a list of defective storage blocks, as determined at manufacture time, is stored in a high-speed system controller memory to enable the efficient bypassing of defective blocks in a transparent manner, external to the system. Conventionally, such lists have been compressed losslessly to save on the cost of the controller memory. Under the assumption of a total system cost that is a linear combination of the number of storage blocks and the controller memory size, we study the potential benefits of compressing the defect list using lossy algorithms. The only restriction is that the reconstructed defect list not label any defective storage blocks as being non-defective.
Context Ontology for Secure Interoperability
Authors: Céline Coma, Nora Cuppens-Boulahia, Frédéric Cuppens, Ana-Rosa Cavalli
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

During interoperability exchanges, organizations are jointly conducting computation and sharing tasks. However, organization scan have different security policies. To guarantee good interoperability exchanges, organizations need to share with other participants information about the services they provide. They also manage knowledge about their information system. To guarantee good interoperability exchanges, organizations need to share some pieces of their knowledge. By this way, they will inform other participants about specific services they provide. In addition, to be compliant with security requirements during interoperability, security policies have to be dynamic. One purpose of this paper is to provide this dynamic behavior by taking care about context of access parameters. The context-aware security requirements may be met by using a contextual access control model to define the security policy of each party involvedin the interaction, and OrBAC (Organization based Access Control) is an adequate model for this purpose. Elaborating an ontology based security model provides a mean to ensure sharing of understandable knowledge, in particular knowledge needed to derive the authorized accesses and usages during the interoperability sessions. In this paper, we thus suggest a context ontology to be combined with an ontological representation of the OrBAC model and show how it can be used to ease the security rules definition and derivation during interoperability sessions.
On the minimum size of binary codes with length 2R + 4 and covering radius R
Authors: Gerzson Kéri, Patric R. Östergård
Venue: Designs, Codes and Cryptography (2008)

The minimum size of a binary code with length n and covering radius R is denoted by K(n, R). For arbitrary R, the value of K(n, R) is known when n ¿ 2R + 3, and the corresponding optimal codes have been classified up to equivalence. By combining combinatorial and computational methods, several results for the first open case, K(2R + 4, R), are here obtained, including a proof that K(10, 3) = 12 with 11481 inequivalent optimal codes and a proof that if K(2R + 4, R) < 12 for some R then this inequality cannot be established by the existence of a corresponding self-complementary code.
The Design of the Zinc Modelling Language
Authors: Kim Marriott, Nicholas Nethercote, Reza Rafeh, Peter J. Stuckey, Maria Garcia De La Banda, Mark Wallace
Venue: Constraints (2008)

Zinc is a new modelling language developed as part of the G12 project. It has four important characteristics. First, Zinc allows specification of models using a natural mathematical-like notation. To do so it supports overloaded functions and predicates and automatic coercion and provides arithmetic, finite domain and set constraints. Second, while Zinc is a relatively simple and small language, it can be readily extended to different application areas by means of powerful language constructs such as user-defined predicates and functions and constrained types. Third, Zinc provides sophisticated type and instantiation checking which allows early detection of errors in models. Finally, perhaps the main novelty in Zinc is that it is designed to support a modelling methodology in which the same conceptual model can be automatically mapped into different design models, thus allowing modellers to easily "plug and play" with different solving techniques and so choose the most appropriate for that problem. We describe in detail the various language features of Zinc and the many trade-offs we faced in its design.
Cooperative ambient intelligence: towards autonomous and adaptive cooperative ubiquitous environments
Authors: Tom Gross
Venue: International Journal of Autonomous and Adaptive Communications Systems (2008)

Cooperative ambient intelligence provides users and groups of users with seamless and flexible support for communication and work in groups at one location and among groups at distributed locations. Autonomous and adaptive cooperative ubiquitous environments that are conceptually elegant, technologically sound and user-centred provide vital contributions for their success. This article characterises the evolution of interactive systems based on five foci, identifies the respective strengths of autonomous and adaptive behaviour from a users' perspective, and derives research issues for future cooperative ambient intelligence environments.
Behavioral detection of malware on mobile handsets
Authors: Abhijit Bose, Xin Hu, Kang G. Shin, Taejoon Park
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

A novel behavioral detection framework is proposed to detect mobile worms, viruses and Trojans, instead of the signature-based solutions currently available for use in mobile devices. First, we propose an efficient representation of malware behaviors based on a key observation that the logical ordering of an application's actions over time often reveals the malicious intent even when each action alone may appear harmless. Then, we generate a database of malicious behavior signatures by studying more than 25 distinct families of mobile viruses and worms targeting the Symbian OS - the most widely-deployed handset OS - and their variants. Next, we propose a two-stage mapping technique that constructs these signatures at run-time from the monitored system events and API calls in Symbian OS. We discriminate the malicious behavior of malware from the normal behavior of applications by training a classifier based on Support Vector Machines (SVMs). Our evaluation on both simulated and real-world malware samples indicates that behavioral detection can identify current mobile viruses and worms with more than 96% accuracy. We also find that the time and resource overheads of constructing the behavior signatures from low-level API calls are acceptably low for their deployment in mobile devices.
A two-tier semantic overlay network for P2P search
Authors: Tao Gu, Daqing Zhang, Hung Keng Pung
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

This paper proposes a two-tier semantic peer-to-peer network that facilitates efficient search for context information in wide-area networks. Context data with the same semantics are grouped together into a one-dimensional semantic ring space in the upper-tier network. This is achieved by applying an ontology-based semantic clustering technique and dedicating part of node identifiers to correspond to their data semantics. In the lower-tier network, peers in each semantic cluster are organized as Chord identifier space. Thus, all the nodes in the same semantic cluster know which node is responsible for storing context data triples they are looking for, and context queries can be efficiently routed to those nodes. Through the simulation studies, we demonstrate the effectiveness of our proposed scheme.
Managing a document-based information space
Authors: Matthias Deller, Stefan Agne, Achim Ebert, Andreas Dengel, Hans Hagen, Bertin Klein, Michael Bender, Tony Bernardin, Bernd Hamann
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present a novel user interface in the form of a complementary virtual environment for managing personal document archives, i.e., for document filing and retrieval. Our implementation of a spatial medium for document interaction, exploratory search and active navigation plays to the strengths of human visual information processing and further stimulates it. Our system provides a high degree of immersion so that the user readily forgets the artificiality of our environment. Three well-integrated features support this immersion: first, we enable users to interact more naturally through gestures and postures (the system can be taught custom ones); second, we exploit 3D display technology; and third, we allow users to manage arrangements (manually edited structures, as well as computer-generated semantic structures). Our ongoing evaluation indicates that even non-expert users can efficiently work with the information in a document collection and that the process can actually be enjoyable.
FVE A Virtual Environment for Collaboration
Authors: Ivan Tomek, Rick Giles, Hai Zhang, Li Di
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

FVE (Federated Virtual Environment) is a groupware research project addressing critical groupware issues such as scalability, adaptability and extendibility, and performance. It uses the virtual universe metaphor and offers unique features such as transparent operation on an unlimited number of servers, and runtime modifiability via several well-known scripting languages. This paper describes the evolution of FVE, its functionality, design, implementation, and our plans for its further evolution.
IMITATION LEARNING AND ANCHORING THROUGH CONCEPTUAL SPACES
Authors: Antonio Chella, Haris Dindo, Ignazio Infantino
Venue: Applied Artificial Intelligence (2007)

In order to have a robotic system able to effectively learn by imitation and not merely reproduce the movements of a human teacher, the system should have the capability to deeply understand the perceived actions to be imitated. This paper deals with the development of a cognitive architecture for learning by imitation in which a rich conceptual representation of the observed actions is built. The purpose of the following discussion is to show how the same conceptual representation can be used both in a bottom-up approach, in order to learn sequences of actions by imitation learning paradigm, and in a top-down approach, in order to anchor the symbolical representations to the perceptual activities of the robotic system. Experiments concerned with the problem of teaching a humanoid robotic system simple manipulative tasks are reported.
Variable frame rate video for mobile devices
Authors: V. Baroncini, D. Ciavatta, G Gaudino, R. Felice, G. Iacovoni, F. Ubaldi
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

In [1] we introduced a new real-time variable frame rate control scheme. It is based on the video jerkiness and it can be applied to both coding and transcoding. This scheme constantly traces the motion of the incoming video and automatically tunes the outgoing frame rate according to the level of jerkiness acceptable by the user. This scheme has been conceived in the framework of mobile communications, which calls for an optimum use of both the available bandwidth and terminal resources. In this paper we present a subjective assessment of our solution carried out in a professional laboratory suitably equipped. Towards this aim a group of non-expert users was asked to express their preference when watching side by side the same video coded at variable frame rate and at fixed frame rate. Results show that most of the times a variable frame rate control based on a dynamic bit/frame allocation scheme may substantially improve the video quality perceived by the users.
Localized empirical discriminant analysis
Authors: L. Cutillo, U. Amato
Venue: Computational Statistics Data Analysis (2008)

Some empirical localized discriminant analysis methods for classifying images are introduced. They use spatial correlation of images in order to improve classification reducing the 'pseudo-nuisance' present in pixel-wise discriminant analysis. The result is obtained through an empirical (data driven) and local (pixel-wise) choice of the prior class probabilities. Local empirical discriminant analysis is formalized in a framework that focuses on the concept of visibility of a class that is introduced. Numerical experiments are performed on synthetic and real data. In particular, methods are applied to the problem of retrieving the cloud mask from remotely sensed images. In both cases classical and new local discriminant methods are compared to the ICM method.
Misuse of automated decision aids: Complacency, automation bias and the impact of training experience
Authors: J. Elin Bahner, Anke-Dorothea Hüper, Dietrich Manzey
Venue: International Journal of Human-Computer Studies (2008)

The present study investigates automation misuse based on complacency and automation bias in interacting with a decision aid in a process control system. The effect of a preventive training intervention which includes exposing participants to rare automation failures is examined. Complacency is reflected in an inappropriate checking and monitoring of automated functions. In interaction with automated decision aids complacency might result in commission errors, i.e., following automatically generated recommendations even though they are false. Yet, empirical evidence proving this kind of relationship is still lacking. A laboratory experiment (N=24) was conducted using a process control simulation. An automated decision aid provided advice for fault diagnosis and management. Complacency was directly measured by the participants' information sampling behavior, i.e., the amount of information sampled in order to verify the automated recommendations. Possible commission errors were assessed when the aid provided false recommendations. The results provide clear evidence for complacency, reflected in an insufficient verification of the automation, while commission errors were associated with high levels of complacency. Hence, commission errors seem to be a possible, albeit not an inevitable consequence of complacency. Furthermore, exposing operators to automation failures during training significantly decreased complacency and thus represents a suitable means to reduce this risk, even though it might not avoid it completely. Potential applications of this research include the design of training protocols in order to prevent automation misuse in interaction with automated decision aids.
Lares: An Architecture for Secure Active Monitoring Using Virtualization
Authors: Bryan D. Payne, Martim Carbone, Monirul Sharif, Wenke Lee
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

Host-based security tools such as anti-virus and intrusion detection systems are not adequately protected on today's computers. Malware is often designed to immediately disable any security tools upon installation, rendering them useless. While current research has focused on moving these vulnerable security tools into an isolated virtual machine, this approach cripples security tools by preventing them from doing active monitoring. This paper describes an architecture that takes a hybrid approach, giving security tools the ability to do active monitoring while still benefiting from the increased security of an isolated virtual machine. We discuss the architecture and a prototype implementation that can process hooks from a virtual machine running Windows XP on Xen. We conclude with a security analysis and show the performance of a single hook to be 28 microseconds in the best case.
Discovering services with restricted location scope in ubiquitous environments
Authors: José Viterbo F., Markus Endler, Vagner Sacramento
Venue: Proceedings of the 5th international workshop on Middleware for pervasive and ad-hoc computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

In ubiquitous computing systems, the mobility of users and their devices results in recurring disconnections and recon-nections with different networks, and the corresponding dynamic change of the network and domain-specific resources and services accessible from the user's device. On the other hand, some services are available to be used only by users that are located in a well defined region. In this highly dynamic and heterogeneous scenario, applications must be capable of discovering the appropriate instances of the required services in each visited network or region. In order to support such spontaneous interaction, we propose a discovery service based on the notion of a (geographic) location scope. This discovery service is one of the core services of the MoCA architecture, a middleware that supports the development and deployment of location-aware ubiquitous applications.
Formation flight control under communication failure
Authors: Jongho Shin, H. Jin Kim, Seungkeun Kim, Yongsoon Yoon
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This paper presents the management of UAV formation flight with respect to varying levels of communication among UAVs. Inter-vehicle communication in the formation is a critical issue because each UAV needs the information on other vehicles for formation. However, since communication is not perfect in reality, the formation performance under communication failure has to be analyzed. This study uses position data measured by sensors for overcoming communication failures in the standard leader-follower structure formulated in the nonlinear model predictive control (NMPC) framework. The perceived and obtained position data of each UAVs through GPS or sensor are noisy. These are estimated by extended Kalman filter. The numerical simulation results support the feasibility of the proposed formation flight method.
Dynamic Epicardial Mapping Using 3D Emulation
Authors: Weijia Lu, Tuo Zhou, Cuiwei Yang, Zuxiang Fang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Dynamic epicardial mapping is an important tool in cardiac electrophysiology. This article brings forward a method for 3D dynamic modeling used in epicardial mapping system. Firstly, 3DMAX was used to create a 3D heart model and an .ase file was stored. Secondly, OpenGL was applied to display this model in user’s window interface. When electrodes and amplifiers sampled new data, the electrode which had the minimum euler distance to each vertex of 3D model was calculated, thus an interpolate triangle was formed by combining another two adjacent electrodes. The voltage value of each vertex was obtained by using a new linear interpolation based on grads calculation. This method was proved to be feasible in animal experiments. Electrical activity could be investigated directly in a cardiac cycle through this 3D model. This model can also reflect the conduction process of depolarization in complex arrhythmia such as atrial fibrillation. This method is appropriate for any real-time 3D dynamic field modeling, which has an array of regular measure points.
A Phylogenetic Tree Constructing Algorithm Based on Ant Colony Optimization
Venue: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops (2007)

An algorithm for constructing phylogenetic tree based on ant colony optimization (Ant-PTC) is presented. To take full advantage of the strong optimization ability of ant colony algorithm, a graph is built using all the input species according to their distances. The pheromone on the edges is adaptively updated when the ants travel on the graph. Then the graph is modified by omitting some edges with less pheromone. Clusters of species extracted from the connected components of the graph are used to construct the phylogenetic tree progressively. Experimental results show that our algorithm Ant-PTC can obtain higher classification accuracy, higher convergence speed than other similar method. 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