ppxscal/embedding_network huggingface dataset:
UK-NEES: grid services architecture for earthquake
Authors: Kashif Saleem, Javier Parra-Fuente, Mobin Ojaghi, Martin Williams, Anthony Blakeborough
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Grid service technologies are often used to increase computational capacity. However, they may also be used to connect and share physical resources in a coordinated manner. This technology is showing potential applications in earthquake engineering where structural seismic response, measured by testing, is used to understand structural failures and to assess the effectiveness of new seismic counter-measures. Such tests require to be carried out at large scale, exceeding the capacity of any one lab, both financially and due to physical size. Recently testing techniques have been implemented allowing tests to be distributed across many sites. Grid technologies are therefore utilised to share geographically distributed heterogeneous resources, connecting legacy systems in different earthquake engineering laboratories. This paper presents the grid services architecture and communication model to be used to facilitate efficient distributed earthquake testing within the framework of the UK Network for Earthquake Engineering Simulation (UK-NEES).
A Role-Based Infrastructure for the Management of Dynamic Communities
Authors: Alberto Schaeffer-Filho, Emil Lupu, Morris Sloman, Sye-Loong Keoh, Jorge Lobo, Seraphin Calo
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

This paper defines an operational framework for specifying and establishing secure collaborations between autonomous entities that need to interact and depend on each other in order to accomplish their goals, in the context of mobile ad-hoc networks. We call such collaborations mission-oriented dynamic communities. We propose an abstract model for policy-based collaboration that relies on a set of task-oriented roles. Nodes are discovered dynamically and assigned to one or more roles, and then enforce the policies associated with these roles according to the description of the community. In this paper we focus on the roles that are needed to provide management and security functions for dynamic communities.
Error Weighting in Artificial Neural Networks Learning Interpreted as a Metaplasticity Model
Authors: Diego Andina, Aleksandar Jevtić, Alexis Marcano, J. M. Barrón Adame
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Many Artificial Neural Networks design algorithms or learning methods imply the minimization of an error objective function. During learning, weight values are updated following a strategy that tends to minimize the final mean error in the Network performance. Weight values are classically seen as a representation of the synaptic weights in biological neurons and their ability to change its value could be interpreted as artificial plasticity inspired by this biological property of neurons. In such a way, metaplasticity is interpreted in this paper as the ability to change the efficiency of artificial plasticity giving more relevance to weight updating of less frequent activations and resting relevance to frequent ones. Modeling this interpretation in the training phase, the hypothesis of an improved training is tested in the Multilayer Perceptron with Backpropagation case. The results show a much more efficient training maintaining the Artificial Neural Network performance.
The permutable POMDP: fast solutions to POMDPs for preference elicitation
Authors: Finale Doshi, Nicholas Roy
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its environment. Partially Observable Markov Decision Processes (POMDPs) are a desirable framework in these planning domains because the resulting policies allow the agent to reason about its own uncertainty. In domains with hidden state and noisy observations, POMDPs optimally trade between actions that increase an agent's knowledge and actions that increase an agent's reward. Unfortunately, for many real world problems, even approximating good POMDP solutions is computationally intractable without leveraging structure in the problem domain. We show that the structure of many preference elicitation problems---in which the agent must discover some hidden preference or desire from another (usually human) agent---allows the POMDP solution to be solved with exponentially fewer belief points than standard point-based approximations while retaining the quality of the solution.
Sound Change and Speaker Identity: An Acoustic Study
Authors: Gea Jong, Kirsty Mcdougall, Francis Nolan
Venue: Speaker Classification II: Selected Projects (2007)

This study investigates whether the pattern of diachronic sound change within a language variety can predict phonetic variability useful for distinguishing speakers. An analysis of Standard Southern British English (SSBE) monophthongs is undertaken to test whether individuals differ more widely in their realisation of sounds undergoing change than in their realisation of more stable sounds. Read speech of 20 male speakers of SSBE aged 18-25 from the DyViS database is analysed. The vowels , demonstrated by previous research to be changing in SSBE, are compared with the relatively stable . Results from Analysis of Variance and Discriminant Analysis based on F1 and F2 frequencies suggest that although `changing' vowels exhibit greater levels of between-speaker variation than `stable' vowels, they may also exhibit large within-speaker variation, resulting in poorer classification rates. Implications for speaker identification applications are discussed.
The Hermite Transform: An Alternative Image Representation Model for Iris Recognition
Authors: Alfonso Estudillo-Romero, Boris Escalante-Ramirez
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this work we propose an alternative image representation model to efficiently characterize iris textures based on the Hermite transform. The Hermite transform can simulate some properties of the mammalian visual system and it is founded on a well established mathematical framework. These properties are used to extract the most important information of the iris textures. The results show that the Hermite transform is able to characterize iris textures as well as the Gabor model, with the advantage on the second that the discrete analysis filters in the Hermite transform are given by the Krawtchouk polynomials and, it is not needed to compute the filter coefficients by means of optimization methods, nor to suppress the zero mean (d.c. response). The proposed iris recognition system achieved an overall performance of 97.34% and a Correct Access Rate (CAR) of 90.29% when the False Access Rate (FAR) was closed to zero.
Research on Improved Data-Mining Algorithm Based on Strong Correlation
Authors: Chunhong Hu, Zhengqiang Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The extensive application of association rules in commerce enables itself to be one of the most active research directions in data mining. Recently, the mining of strong correlation item pairs with statistical significance in transaction database receives a certain value. In order to further reduce the cost of testing candidate item pairs in relational database, we have developed the Taper algorithm according to 1NF property. The developed TaperR algorithm can cut the number of candidate pairs to improve effciency.
Hierarchical Text Categorization Through a Vertical Composition of Classifiers
Authors: Andrea Addis, Giuliano Armano, Francesco Mascia, Eloisa Vargiu
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper we present a hierarchical approach to text categorization aimed at improving the performances of the corresponding tasks. The proposed approach is explicitly devoted to cope with the problem related to the unbalance between relevant and non relevant inputs. The technique has been implemented and tested by resorting to a multiagent system aimed at performing information retrieval tasks.
Use of operation semantics for parallel iSCSI protocol
Authors: Ranjana Singh, Rekha Singhal
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

iSCSI is an emerging communication protocol enabling block data transport over TCP/IP network. This paper uses a storage architecture allowing parallel processing of iSCSI commands and presents two novel techniques for improving the performance of iSCSI protocol - the first is the elimination technique for reducing latency caused by redundant overwrites and second technique reduces the latency caused due to multiple reads to same storage sector. The theoretical performance analysis shows that use of operation semantics has the potential to improve performance as compared to the existing iSCSI protocol.
An Agent Based Modelling Approach for Stochastic Planning Parameters
Authors: Wilhelm Dangelmaier, Benjamin Klöpper, Alexander Blecken
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Many planning problems are influenced by stochastical environmental factors. There are several planning algorithms from various application domains which are able to handle stochastic parameters. Correct information about these stochastic parameters has impact on the quality of plans. There is a lack of sufficient research on how to obtain this information. In this paper, we introduce a Multiagent System (MAS) that is able to model stochastic parameters and to provide up-to-date information about these parameters. Due to their access to locally available informations expert agents are used, which apply the paradigm of Bayesian Thinking in order to provide high quality information to planning agents.
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
Authors: Marco Baldi, Marco Bodrato, Franco Chiaraluce
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now, but has two major drawbacks: long key and low transmission rate. Our variant is based on QC-LDPC codes and is able to overcome such drawbacks, while avoiding the known attacks. Recently, however, a new attack has been discovered that can recover the private key with limited complexity. We show that such attack can be avoided by changing the form of some constituent matrices, without altering the remaining system parameters. We also propose another variant that exhibits an overall increased security level. We analyze the complexity of the encryption and decryption stages by adopting efficient algorithms for processing large circulant matrices. The Toom-Cook algorithm and the short Winograd convolution are considered, that give a significant speed-up in the cryptosystem operations.
Onto'CoPE: Ontology for Communities of Practice of E-Learning
Authors: Akila Sarirete, Azeddine Chikh, Lamia Berkani
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

The purpose of this article is to extend the application of the communities of practice to the e-learning field which handles an interdisciplinary techno-pedagogic knowledge: cognitive, psycho-pedagogic, multi-media, software, etc. We propose a new category of CoPs called CoPE (Communities of Practice of E-learning) which combines two fields: CoPs as basic field, and E-learning as an application domain. To be able to capitalize the knowledge in a CoPE, we propose an ontology entitled "Onto'CoPE" that aims to model the members of the CoPE and their roles, the learning situations, and annotating the CoPE's knowledge resources through activities and possible types of interactions, as well as the environment made up of services, tools and resources. The paper briefly describes our method for building our ontology, its structure, and contents.
On intuitionistic fuzzy negations and intuitionistic fuzzy modal operators with contradictory evidence
Authors: Chris J. Hinde, Krassimir T. Atanassov
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

Some relations between intuitionistic fuzzy negations and intuitionistic fuzzy modal operations (from standard type) are studied. In particular versions of negation are extended to deal with contradictory evidence. Example proofs are presented for both the negations and the modal operators to show that the results from Intuitionistic Fuzzy Sets carry over to the extended versions incorporating contradictory evidence.
Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases
Authors: P. Krishna Prasad, C. Pandu Rangan
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

BIRCH algorithm [22] is a well known algorithm for clustering for effectively computing clusters in a large data set. As the data is typically distributed over several sites, clustering over distributed data is an important problem. The data can be distributed in horizontal, vertical or arbitrarily partitioned databases. But, because of privacy issues no party may share its data to other parties. The problem is how the parties can cluster the distributed data without breaching privacy of others data. The solutions in arbitrarily partitioned database setting generally work for both horizontal and vertically partitioned databases. In our work we give a procedure for securely running BIRCH algorithm over arbitrarily partitioned database. We introduce secure protocols for distance metrics and give a procedure for using these metrics in securely computing clusters over arbitrarily partitioned database.
ICANN's TLD Plans Are Defined, Not Yet Refined
Authors: Greg Goth
Venue: IEEE Internet Computing (2008)

The ICANN board of directors' recent decisions to greatly expand the number of generic Top-Level Domains (gTLDs) and fast-track some country-code TLDs (ccTLDs) using internationalized characters illustrates that ICANN has stumbled into a quagmire; that is, in hoping to satisfy constituent groups' demands for expanded TLDs, it might expose profound procedural shortcomings that it must fix or suffer the consequences.
Quality-of-Protection (QoP): A Quantitative Methodology to Grade Security Services
Authors: Yan Sun, Anup Kumar
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

A tree based quality of protection (QoP) evaluation method for cyber system is presented. The elements of a security system structure are represented as normalized weighted tree. We show that our weighted tree representation of security system structure is informative and useful. Based on this unique representation QoP evaluation methodology is introduced and the foundations of QoP modeling and evaluation are established. The important steps in the evaluation process are the introduction of normalized weighted tree which establishes the hierarchy of the requirements of a secure system and the formulation of the normalized weighted tree. This is used to compute the QoP in a quantitative manner. We demonstrate through several examples, how the proposed methodology can assess QoP from a holistic view.
Linkages Knowledge Process and Business Process: A Case Study in China Motor Corporation
Authors: Ming-Chang Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Knowledge and its management has become an important issue for manager, consultants, and researchers. An application of Knowledge Management system is need in order to facilitate these knowledge processes, therefore supporting the business processes. This study will briefly review the existing literature on both knowledge management and e-business and then will present on the linkages or supplementary relationships between the knowledge management and e-business. The case study (China Motor Corporation) is showing the process of knowledge used on e-business.
Terrain Synthesis Based on Microscopic Terrain Feature
Authors: Shih-Chun Tu, Chun-Yen Huang, Wen-Kai Tai
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In this paper, we use real terrain elevation data and the microscopic terrain feature unit to synthesize the macroscopic terrain flexibly and effectively. An interactive system provides users a convenient and intuitive interface to profile microscopic terrain features using terrain primitives. A number of terrain primitives, geometric objects such as prism-like, tetrahedron-like, and cone-like objects regarded as the concept representation object of microscopic terrain features, can be transformed to construct the terrain profile. Then, these terrain primitives are replaced by matching terrain units searched from real terrain elevation database to seamlessly synthesize the macroscopic terrain, the landform. As experimental results show, the resultant efficient synthesized terrains are realistic, fitting user's intuition.
Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
Authors: Kenneth G. Paterson, Sriramkrishnan Srinivasan
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

We consider the security of Identity-Based Encryption (IBE) in the setting of multiple Trusted Authorities (TAs). In this multi-TA setting, we envisage multiple TAs sharing some common parameters, but each TA generating its own master secrets and master public keys. We provide security notions and security models for the multi-TA setting which can be seen as natural extensions of existing notions and models for the single-TA setting. In addition, we study the concept of TA anonymity, which formally models the inability of an adversary to distinguish two ciphertexts corresponding to the same message and identity but generated using different TA master public keys. We argue that this anonymity property is a natural one of importance in enhancing privacy and limiting traffic analysis in multi-TA environments. We study a modified version of a Fujisaki-Okamoto conversion in the multi-TA setting, proving that our modification lifts security and anonymity properties from the CPA to the CCA setting. Finally, we apply these results to study the security of the Boneh-Franklin and Sakai-Kasahara IBE schemes in the multi-TA setting.
Formal Modeling of a Generic Middleware to Ensure Invariant Properties
Authors: Xavier Renault, Jérôme Hugues, Fabrice Kordon
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

The complexity of middleware leads to complex Application Programming Interfaces (APIs) and semantics, supported by configurable components in the middleware. Those components are selected to provide the desired semantics. Yet, incorrect configuration can lead to faulty middleware executions, detected late in the development cycle.We use formals methods to tackle this problem. They allow us to find appropriate composition of middleware components and the use of their APIs, and to detect valid or faulty sequences. To provide reusable results, we modeled a canonical middleware architecture using Z.We propose a validation scenario to verify middleware's invariants. We define invariants to exhibit inconsistent usage of these APIs. The specification has been checked with the Z/EVES [13] theorem prover.
Gaussian Mixture Models for Higher-Order Side Channel Analysis
Authors: Kerstin Lemke-Rust, Christof Paar
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

We introduce the use of multivariate Gaussian mixture models for enhancing higher-order side channel analysis on masked cryptographic implementations. Our contribution considers an adversary with incomplete knowledge at profiling, i.e., the adversary does not know random numbers used for masking. At profiling, the adversary observes a mixture probability density of the side channel leakage. However, the EM algorithm can provide estimates on the unknown parameters of the component densities using samples drawn from the mixture density. Practical results are presented and confirm the usefulness of Gaussian mixture models and the EM algorithm. Especially, success rates obtained by automatic classification based on the estimates of the EM algorithm are very close to success rates of template attacks.
Securely Deliver Data by Multi-path Routing Scheme in Wireless Mesh Networks
Authors: Cao Trong Hieu, Choong Seon Hong
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Wireless Mesh Networks with static Transit Access Points (TAPs) have many advantages to connect different kinds of networks. While Mobile Ad hoc Networks still have many challenges to improve because of dynamic topology and security vulnerabilities, WMNs are the best solution for wireless communication recently. To utilize the characteristics of WMN's topology, in this paper, we propose an algorithm to preserve privacy for routing. This idea comes from the fact that if we can separate data traffic into more than one path, the probability to capture all traffic from intermediate node is very small. It means it is very difficult to launch traffic analysis attacks because of traffic confidentiality. In addition, to hide securely the real source and destination addresses a new technique is proposed along with an Adaptive Key Agreement Scheme. We apply Information Entropy to model our routing traffic and highlight the robustness of the algorithm. We also present a detail traffic evaluation observed from neighboring nodes to show the availability of our proposal in term of robustness, loop free and computational overhead.