ppxscal/embedding_network huggingface dataset:
The shock duration: influence factor over the dynamic response of the mechanical systems
Authors: Adrian Leopa
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

In the theoretical simulation techniques of the technological equipments with impulsive actions, the first stage consists in defining the perturbing action parameters of the system. The dynamic loadings application duration is a tender problem because this parameter depends on a series of factors, such as: the mass of the clashing bodies, their relative speed, the collision type, the materials nature of the two bodies. This study evaluates the elastic collision duration of the two bodies with the Hertz theory of collisions for the case of a hammer with drop forging. It will be analyzed by comparison the two cases of solicitations of a mechanical system with the same type of force but with different application durations regarding the system's dynamic response.
Interoperability issues in CONNIECreating a network of decentralised portals
Authors: Tomo Cerovsek, Celson Lima, Gudni Gudnason, Graham Storer, Marco Padula, Marcelo Blasco
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Peer to peer decentralized hybrid networks are well established but are most frequently used to connect desktop machines for fun services. We present a concept that enables creation of p2p like networks where nodes are information portals enabling eBusiness activities. The paper gives an overview of such network and interoperability issues.
Secure direct communication based on ping---pong protocol
Authors: Arti Chamoli, C. M. Bhandari
Venue: Quantum Information Processing (2009)

Communication security with quantum key distribution has been one of the important features of quantum information theory. A novel concept of secured direct communication with no need of establishing any shared secret key has been the next step forward. The present paper presents a secured communication scheme with three particle GHZ state as the initial state where the receiver can simultaneously receive information from two parties. Possible eavesdropping has been examined.
Integrating Domain and Paradigmatic Similarity for Unsupervised Sense Tagging
Authors: Roberto Basili, Marco Cammisa, Alfio Massimiliano Gliozzo
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

An unsupervised methodology for Word Sense Disambiguation, called Dynamic Domain Sense Tagging, is presented. It relies on the convergence of two very well known unsupervised approaches (i.e. Domain Driven Disambiguation and Conceptual Density). For each target word a domain is dynamically modeled by expanding the its topical context, i.e. a set of words evoking the underlying/implict domain where the word is located. The estimation of the paradigmatic similarity within such a specific lexicon is assumed as a disambiguation model. The Conceptual Density measure is here used to account for paradigmatic associations, and the top scored senses of the target word are selected accordingly. Results confirm the impact of domain based representation in capturing useful paradigmatic generalizations, especially when small text fragments are available. In addition, the precision/recall tradeoff of the resulting method can be tuned in a meaningful way, allowing us to achieve impressively high precision scores in a purely unsupervised setting.
A Theorem Prover with Dependent Types for Reasoning about Actions
Authors: Patrick Barlatier, Richard Dapoigny
Venue: Proceeding of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium (2008)

In the development of logic-based formal theories, traditional approaches which rely on first-order classical logic suffer from a number of limitations such as semi-decidability, closed-world assumption, difficulty to cope with partial knowledge, etc. Many solutions have been proposed for these topics, but difficulties and uncertainties remain, even in the latest papers. In order to address these problems, we suggest a new proof-theoretical perspective within a fragment of constructive type theory for reasoning about actions with contexts. The basic structure of the theory are Dependent Record Types (DRTs) which model contexts, actions and effects through a simple and natural representation. DRTs have a higher expressive power and are able to express partial knowledge and dynamic reasoning while assuming an Open World Assumption.
Decision-making automation fuzzy decision-making in industry
Authors: Aziz Soulhi, Said Guedira, Nour-eddine El Alami
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The objective of the research work presented in this paper is the modeling of the industrial regulation in the manufacturing process. We show here the feasibility of a decision-making automation aid model for the manufacturer and the experts of production. The realization of this model is founded on the fuzzy sets theory, which is used for the resolution of the complex and uncertain system problems. The originality of this model resides in taking into account the exploitation requirements as well as the objectives pursued by the manufacturer. It uses the expertise as a source of knowledge to solve the problems of the industry regulation. These problems become much more difficult, when disturbances caused by unexpected incidents are simultaneous in several sections of the manufacturing process. This difficulty is in the modeling of the incidents and of the pertinent decision-making criteria. We find here a good reason to achieve our model on the fuzzy sets theory.
The Effect of Problem Templates on Learning in Intelligent Tutoring Systems
Authors: Moffat Mathews, Antonija Mitrovic
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

This paper proposes the notion of problem templates (PTs), a concept based on theories of memory and expertise. These mental constructs allow experts to quickly recognise problem states, almost instantaneously retrieve potentially vast amounts of domain-specific information, and seemingly effortlessly implement strategies to solve the problem. We investigate the role of problem templates in intelligent tutoring systems. An evaluation study was conducted in which PTs were created and implemented in SQL-Tutor. PTs were used to model students and make pedagogical decisions. Students using templates showed high levels of learning within short periods of time. Further evaluation studies are required to investigate the extent and detail of its effect on learning.
Embedded Software: Facts, Figures, and Future
Authors: Christof Ebert, Capers Jones
Venue: Computer (2009)

Due to the complex system context of embedded-software applications, defects can cause life-threatening situations, delays can create huge costs, and insufficient productivity can impact entire economies. Providing better estimates, setting objectives, and identifying critical hot spots in embedded-software engineering requires adequate benchmarking data.
Accelerating the AES encryption function in OpenSSL for embedded systems
Authors: Vishnu P. Nambiar, M. Khalil-Hani, Muhammad M. Zabidi
Venue: International Journal of Information and Communication Technology (2009)

The internet is an insecure medium and hence, there is an increasing demand for measures to guarantee data privacy and integrity in the associated computer systems and networks. However, data protection and network security comes at a very high cost in the supporting embedded systems. While there are freely available solutions such as the OpenSSL library, the performance of most embedded processors, on their own, are just not adequate enough to perform cryptography for real-time network security applications. In this paper, we focus on the implementation of a cryptographic (crypto) embedded system, deploying an Altera Nios II embedded processor working with an AES encryption hardware accelerator. The RTOS applied is uClinux, on which the OpenSSL library has been ported and cross-compiled. Experimental results show that hardware acceleration can improve, significantly, the performance of OpenSSL crypto functions and hence, of the SSL connection as well.
On the erosion process prediction of the ductile materials
Authors: Viorel-Puiu Paun, Constantin Udriste, Constantin Patrascoiu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

The occurrence of cavitation erosion damage is prevalent in high speed engines and bearing systems operating under high clearance conditions. The cavitation erosion prediction for the hydraulic machines components is very important in the engineering research. The present paper studies this process in the terms of the volume loss curve of erosion cavitations progress. An analytical model for the prediction of cavitation erosion of ductile materials is proposed.
Protein function annotation from sequence
Authors: R. V. Spriggs, Y. Murakami, H. Nakamura, S. Jones
Venue: Bioinformatics (2009)

Motivation: All eukaryotic proteomes are characterized by a significant percentage of proteins of unknown function. Comp-utational function prediction methods are therefore essential as initial steps in the function annotation process. This article describes an annotation method (PiRaNhA) for the prediction of RNA-binding residues (RBRs) from protein sequence information. A series of sequence properties (position specific scoring matrices, interface propensities, predicted accessibility and hydrophobicity) are used to train a support vector machine. This method is then evaluated for its potential to be applied to RNA-binding function prediction at the level of the complete protein. Results: The 5-fold cross-validation of PiRaNhA on a dataset of 81 RNA-binding proteins achieves a Matthews Correlation Coefficient (MCC) of 0.50 and accuracy of 87.2%. When used to predict RBRs in 42 proteins not used in training, PiRaNhA achieves an MCC of 0.41 and accuracy of 84.5%. Decision values from the PiRaNhA predictions were used in a second SVM to make predictions of RNA-binding function at the protein level, achieving an MCC of 0.53 and accuracy of 76.1%. The PiRaNhA RBR predictions allow experimentalists to perform more targeted experiments for function annotation; and the prediction of RNA-binding function at the protein level shows promise for proteome-wide annotations. Availability and Implementation: Freely available on the web at www.bioinformatics.sussex.ac.uk/PIRANHA or http://piranha.protein.osaka-u.ac.jp. Contact:s.jones@sussex.ac.uk. Supplementary Information:Supplementary data are available at the Bioinformatics online.
Information Dynamics and Intelligent Cooperation in Networked Societies
Authors: Jing Wang, Fujun Ren, Mei Zhu, Long Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

We propose a simple yet effective theoretical model for the evolutionary threshold public goods game with binary contributions (the fair personal share or nothing), incorporating the effect of collective risk. We distinguish two distinct public goods games according to whether to return the contributions when the target is not collected. For the two cases, in order to study the impact of collective risk on cooperation, we analyze dynamics of the population which can be represented by the replicator equations. It shows that high rate of loss can enhance the emergence of social cooperation and the provision of public goods. Furthermore, other elements also can promote the cooperation, such as large initial endowment and small threshold. Interestingly, for large group size, it has a positive impact on cooperation in the case of returning the donation amount, whereas a negative impact in the case of no return.
Co-clustering on manifolds
Authors: Quanquan Gu, Jie Zhou
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Co-clustering is based on the duality between data points (e.g. documents) and features (e.g. words), i.e. data points can be grouped based on their distribution on features, while features can be grouped based on their distribution on the data points. In the past decade, several co-clustering algorithms have been proposed and shown to be superior to traditional one-side clustering. However, existing co-clustering algorithms fail to consider the geometric structure in the data, which is essential for clustering data on manifold. To address this problem, in this paper, we propose a Dual Regularized Co-Clustering (DRCC) method based on semi-nonnegative matrix tri-factorization. We deem that not only the data points, but also the features are sampled from some manifolds, namely data manifold and feature manifold respectively. As a result, we construct two graphs, i.e. data graph and feature graph, to explore the geometric structure of data manifold and feature manifold. Then our co-clustering method is formulated as semi-nonnegative matrix tri-factorization with two graph regularizers, requiring that the cluster labels of data points are smooth with respect to the data manifold, while the cluster labels of features are smooth with respect to the feature manifold. We will show that DRCC can be solved via alternating minimization, and its convergence is theoretically guaranteed. Experiments of clustering on many benchmark data sets demonstrate that the proposed method outperforms many state of the art clustering methods.
Petimo: safe social networking robot for children
Authors: Adrian David Cheok, Owen Noel Newton Fernando, Charith Lasantha Fernando
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

As social networking widely spreads among the community, especially among the younger generation, the negative influence created on children has become a serious social concern. "Petimo" is an interactive robotic toy designed to protect children from potential risks in social networks and the virtual world and it helps them to make a safely connected social networking environment. It adds a new physical dimension to social computing through enabling a second authentication mode, providing extra safety in making friends by physically touching each others robot. Petimo can be connected to any social network and it provides safety and security for children. As a proof of concept, we have developed a 3D virtual world, "Petimo-World" which demonstrates all of the realizable basic features with traditional online social networks. Petimo-World stands out from all other virtual worlds with its interesting and sophisticated interactions such as the visualization of a friends' relationships through spatial distribution in the 3D space to clearly understand the closeness of the friendship, personalized avatars and sending of special gifts/emoticons.
Towards insider threat detection using web server logs
Authors: Justin Myers, Michael R. Grimaila, Robert F. Mills
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Malicious insiders represent one of the most difficult categories of threats an organization must consider when mitigating operational risk. Insiders by definition possess elevated privileges; have knowledge about control measures; and may be able to bypass security measures designed to prevent, detect, or react to unauthorized access. In this paper, we discuss our initial research efforts focused on the detection of malicious insiders who exploit internal organizational web servers. The objective of the research is to apply lessons learned in network monitoring domains and enterprise log management to investigate various approaches for detecting insider threat activities using standardized tools and a common event expression framework.
Technical communique: MPC for tracking with optimal closed-loop performance
Authors: A. Ferramosca, D. Limon, I. Alvarado, T. Alamo, E. F. Camacho
Venue: Automatica (Journal of IFAC) (2009)

In the recent paper [Limon, D., Alvarado, I., Alamo, T., & Camacho, E.F. (2008). MPC for tracking of piece-wise constant references for constrained linear systems. Automatica, 44, 2382-2387], a novel predictive control technique for tracking changing target operating points has been proposed. Asymptotic stability of any admissible equilibrium point is achieved by adding an artificial steady state and input as decision variables, specializing the terminal conditions and adding an offset cost function to the functional. In this paper, the closed-loop performance of this controller is studied and it is demonstrated that the offset cost function plays an important role in the performance of the model predictive control (MPC) for tracking. Firstly, the controller formulation has been enhanced by considering a convex, positive definite and subdifferential function as the offset cost function. Then it is demonstrated that this formulation ensures convergence to an equilibrium point which minimizes the offset cost function. Thus, in case of target operation points which are not reachable steady states or inputs for the constrained system, the proposed control law steers the system to an admissible steady state (different to the target) which is optimal with relation to the offset cost function. Therefore, the offset cost function plays the role of a steady-state target optimizer which is built into the controller. On the other hand, optimal performance of the MPC for tracking is studied and it is demonstrated that under some conditions on both the offset and the terminal cost functions optimal closed-loop performance is locally achieved.
A Monitor for Digital Business Ecosystems
Authors: Gabriel Alejandro Lopardo, Josep-Lluís de la Rosa i Esteva, Nicolás Hormazábal
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

This paper proposes to create a monitor of digital business ecosystems so that it provides agents with information to improve the behaviour of the ecosystem in terms of stability. This work proposes that, in digital ecosystems, monitor techniques can provide fundamental services and information. The final goal is to run the monitor algorithms, generate recommendation strategies and test them. A set of evaluation metrics must be defined as well. We want to provide an outline of some global indicators, such as heterogeneity and diversity, and establish relationships between agent behaviour and these global indicators of system performance.
Heuristic algorithms for a second-best congestion pricing problem
Authors: Joakim Ekström, Leonid Engelson, Clas Rydergren
Venue: Netnomics (2009)

Designing a congestion pricing scheme involves a number of complex decisions. Focusing on the quantitative parts of a congestion pricing system with link tolls, the problem involves finding the number of toll links, the link toll locations and their corresponding toll level and schedule. In this paper, we develop and evaluate methods for finding the most efficient design for a congestion pricing scheme in a road network model with elastic demand. The design efficiency is measured by the net social surplus, which is computed as the difference between the social surplus and the collection costs (i.e. setup and operational costs) of the congestion pricing system. The problem of finding such a scheme is stated as a combinatorial bi-level optimization problem. At the upper level, we maximize the net social surplus and at the lower level we solve a user equilibrium problem with elastic demand, given the toll locations and toll levels, to simulate the user response. We modify a known heuristic procedure for finding the optimal locations and toll levels given a fixed number of tolls to locate, to find the optimal number of toll facilities as well. A new heuristic procedure, based on repeated solutions of a continuous approximation of the combinatorial problem is also presented. Numerical results for two small test networks are presented. Both methods perform satisfactorily on the two networks. Comparing the two methods, we find that the continuous approximation procedure is the one which shows the best results.
Efficient hybrid parallelisation of tiled algorithms on SMP clusters
Authors: Nikolaos Drosinos, Nectarios Koziris
Venue: International Journal of Computational Science and Engineering (2009)

This paper emphasises on load balancing issues associated with hybrid parallelisation of tiled algorithms onto SMP clusters. The intrinsic load imbalance in hybrid parallelisation derives from the fact that message passing libraries often provide limited multi-threading support, thus allowing only the master thread to perform inter-node message passing communication. In order to mitigate this effect, we propose a generic method for the application of load balancing on the coarse-grain hybrid model for the appropriate load distribution among the working threads. We investigate both static and dynamic load balancing, and experimentally evaluate three balancing variations against kernel benchmarks.
Bringing order to BGP: Decreasing time and message complexity
Authors: Anat Bremler-Barr, Nir Chen, Jussi Kangasharju, Osnat Mokryn, Yuval Shavitt
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

The Border Gateway Protocol (BGP), the de facto routing protocol of the internet, generates excessive amount of traffic following changes in the underlying backbone. Previous papers [C. Labovitz, R. Wattenhofer, S. Venkatachary, A. Ahuja, The impact of internet policy and topology on delayed routing convergence, in: Proceedings of the INFOCOM, April 2001; C. Labovitz, A. Ahuja, A. Bose, F. Jahanianitz, Delayed internet routing convergence, in: Sigcomm, September 2000.] show that BGP suffers from high convergence delay and high message complexity after a fail down (detachment) of a network, due to path exploration caused by a limited version of the counting to infinity problem. Surprisingly, we show in this paper that BGP suffers from a high message complexity also after an up event (reattachment of a network). We analyze BGP dynamics data from raw update dumps and show that race conditions cause extensive path exploration that increases the amount of redundant updates. We show, based on these BGP dynamics, that up to 26% of the updates sent during up events are redundant. We also find that the effect of this phenomenon is bigger when the change occurs at the edge of the network. We suggest a minor modification to the waiting rule of BGP that pseudo orders the network and reduces the convergence latency of up events by half and the message complexity from O(DE) to O(E), where D is the Diameter of the internet and E is the number of connections between ASes. Our simulation results suggest that our modification may improve the convergence messages and time during all events, with the most noted improvement of up to 36% in the number of messages and 81% in time to convergence during up events in Internet like topologies. We show that our results hold also for partial deployment of the modification in only some of the routers.