ppxscal/embedding_network huggingface dataset:
Panel Discussion Managing Digital Identities --- Challenges and Opportunities
Authors: Günther Pernul, Marco Casassa Mont, Eduardo B. Fernandez, Socrates Katsikas, Alfred Kobsa, Rolf Oppliger
Venue: Proceedings of the 4th international conference on Trust, Privacy and Security in Digital Business (2007)

Identity Management (IdM) comes in two dimensions: First, the secure and efficient creation, use, and administration of personal attributes which make up a digital identifier of a human and used in large scale global networks, such as the Internet. Second, as in-house IdM which is a core component of enterprise security management. In this panel we will be focusing on both.In open networks the major question is how IdM has to be organised to enable efficient user identification (on request) and how it would still be possible at the same time to safeguard privacy by avoiding the scenario of a "transparent system user". The challenges for global IdM are manifold but linked to a basic trade-off-situation: Service providers will only grant electronic access upon successful authentication of a requester, but at the same time users should be able to protect their privacy and transactions shall not be linkable. In addition, in the wake of terrorist threat, the request for global unique electronic identifiers has gained more popularity than ever.In-house IdM is influenced by organisational and technical drivers. It deals with the management of digital identities during their lifecycle within organisations. Some years ago, technologies like stand-alone Single-Sign-On modules or meta-directories quite often already were branded with the term IdM. Lately researchers as well as software vendors have realised that companies need more than just technical components to solve their identity chaos: Organisations need a comprehensive IdM Infrastructure, bearing in mind technical as well as organisational aspects. In addition to that, the emerging demand for sharing identity information between organisations results in a greater need for standardized data exchange channels.For IdM on a global as well as on a local scale many technical, organisational and political questions are still to be solved. Data ownership, compliance with laws and regulations, data privacy issues are examples for questions which need to be faced in an efficient way in the future.
Analyzing Classifier Hierarchy Multiclassifier Learning
Authors: J. M. Martínez-Otzeta, B. Sierra, E. Lazkano, E. Jauregi, Y. Yurramendi
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Classifier combination falls in the so called machine learning area. Its aim is to combine some classification paradigms in order to improve the individual accuracy of the component classifiers. Classifier hierarchies are an alternative among the several methods of classifier combination. In this paper we present new results about a recently proposed hierarchy construction method. Experiments have been carried out over 42 databases from the UCI repository, showing an improvement over the performance of the base classifiers.
Reducing False Alarm Rate in Anomaly Detection with Layered Filtering
Authors: Rafał Pokrywka
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

There is a general class of methods of detecting anomalies in a computer system which are based on heuristics or artificial intelligence techniques. These methods are to distinguish between normal and anomalous system behaviour. The main weakness of these methods is a false alarm rate which is usually measured by counting false-positives on a sample set representing normal behaviour. In this measurement a base rate of anomalous behaviour in a live environment is not taken into account and that leads to a base-rate fallacy. This problem can greatly affect a real number of false alarms which can be significantly greater then expected value. Usually little can be done to further improve classification algorithms. In this paper a different approach to reducing real false alarm rate based on layered filtering is presented and discussed. The solution explores potential in a properly structured system of several anomaly detectors. 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
Facilitating Collaboration in Virtual Environments
Authors: Diana Chihaia
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

The evolution of learning systems brought improvements to the functionality of their components by offering support and mediating learning, communication and collaboration. However, there are still existing barriers caused by the lack of face to face contact between users. Through our research we aim to provide novel means for supporting the social cohesion of the groups and personalize the e-learning spaces by offering adaptive support in group forming and collaboration processes. As a first step in designing a filtering tool for an adaptive system which recommends application and activities for collaboration within the group, we designed a series of experimental studies on different components of an e-learning system to find out what initiates, influences and increases the level of collaboration between learners.
SESAME-P: Memory Pool-Based Dynamic Stack Management for Sensor Operating Systems
Authors: Sangho Yi, Seungwoo Lee, Yookun Cho, Jiman Hong
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

In wireless sensor networks, each sensor node has very small memory space compared with any other embedded computing systems. For this reason, operating systems running on the sensor nodes cannot allocate sufficient fixed-size stack space for all threads. In the previous work, SESAME was proposed to allocate stack space more space-efficiently, but there is a problem of time overhead. In this paper, we present SESAME-P, which is a dynamic stack allocation scheme based on memory pool. The size of memory pool is predetermined by using static analysis of each function's stack usage information. Using the determined memory pool, SESAME-P reduces the dynamic stack allocation cost. Our experimental results show that SESAME-P significantly reduces the time overhead compared with the existing SESAME.
A Secure Cross-Layer Protocol for Multi-hop Wireless Body Area Networks
Authors: Dave Singelée, Benoît Latré, Bart Braem, Michael Peeters, Marijke Soete, Peter Cleyn, Bart Preneel, Ingrid Moerman, Chris Blondia
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

The development of Wireless Body Area Networks (WBANs) for wireless sensing and monitoring of a person's vital functions, is an enabler in providing better personal health care whilst enhancing the quality of life. A critical factor in the acceptance of WBANs is providing appropriate security and privacy protection of the wireless communication. This paper first describes a general health care platform and pinpoints the security challenges and requirements. Further it proposes and analyzes the CICADA-S protocol, a secure cross-layer protocol for WBANs. It is an extension of CICADA, which is a cross-layer protocol that handles both medium access and the routing of data in WBANs. The CICADA-S protocol is the first integrated solution that copes with threats that occur in this mobile medical monitoring scenario. It is shown that the integration of key management and secure, privacy preserving communication techniques within the CICADA-S protocol has low impact on the power consumption and throughput.
An Inferential Approach to the Generation of Referring Expressions
Authors: Madalina Croitoru, Kees Deemter
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

This paper presents a Conceptual Graph (cg) framework to the Generation of Referring Expressions (gre). Employing Conceptual Graphs as the underlying formalism allows a new rigorous, semantically rich, approach to gre: the intended referent is indentified by a combination of facts that can be deduced in its presence but not if it would be absent. Since cgs allow a substantial generalisation of the GRE problem, we show how the resulting formalism can be used by a gre algorithm that refers uniquely to objects in the scene.
Policy relationship annotations of predefined AS-level topologies
Authors: Andrej Vilhar, Roman Novak
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The contractual relationships between autonomous systems (AS) cannot be ignored in the research of large-scale communication protocols and architectures. It has been widely recognized that disregarding policy relationships leads to unrealistic routing paths in simulated communication networks and thus to inaccurate conclusions about the investigated problem. Current AS-level topology generators either completely overlook the relationships or make the annotation process inherent in topology generation. We propose a novel algorithm for annotating random graphs. Our approach differs from previous studies in focusing on the annotation process rather than on the topology generation, which enables reuse of the state-of-the-art topology generators. We identify five properties of viable annotations and formulate the problem as a type-of-relationship problem in random graphs (TRR) by analogy with the related problem of inferring AS relationships from measured routing data. We propose an annotation algorithm for solving the TRR problem by taking advantage of the stochastic properties found in the inferred annotations provided by the cooperative association for internet data analysis (CAIDA). The evaluation provides the evidence of high resemblance of our annotations to the measured ones.
Towards Blended Learning Environment Based on Pervasive Computing Technologies
Authors: Yue Suo, Yuanchun Shi
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Nowadays Internet-based multimedia learning has been entered into our daily life over various end user devices including mobile phone. Whereas, participating in the classroom and book reading are still major modalities of learning. Pervasive computing technologies will accelerate the progress and help to build a more convenient learning environment for learners. Smart Space technologies can augment real classroom to help teachers and students having class with the support of natural tangible UIs and context aware aids where teaching is still in a similar fashion with what happens in traditional classroom. Books can also be fabricated with bits for browsing multimedia learning materials. Bits from cyberspace and atoms from real world will be more and more blended into each other. And learning will be pervasive and blended which is beyond today's e-learning.
The SPREAD Discussion Continued
Authors: Herbert Hellerman, Robert W. O'Neill, Gene M. Amdahl, Jerome Svigals
Venue: IEEE Annals of the History of Computing (1984)

In the January 1983 issue of the Annals (Volume 5, Number 1), we published the "Final Report of the SPREAD Task Group, December 28, 1961." In the same issue were an introduction by Bob O. Evans and the edited transcript of a discussion by several members of the original SPREAD Task Group with Annals editors held on June 23, 1982. The following are comments by four authors in response to the SPREAD material.
Electricity Quality Control of an Independent Power System Based on Hybrid Intelligent Controller
Authors: Hee-Sang Ko, Min-Jae Kang, Ho-Chan Kim
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Wind power generation is gaining popularity as the power industry in the world is moving toward more liberalized trade of energy along with public concerns of more environmentally friendly mode of electricity generation. The weakness of wind power generation is its dependence on nature--the power output varies in quite a wide range due to the change of wind speed, which is difficult to model and predict. The excess fluctuation of power output and voltages can influence negatively the quality of electricity in the distribution system connected to the wind power generation plant. In this paper, the authors propose an intelligent adaptive system to control the output of a wind power generation plant to maintain the quality of electricity in the distribution system. The target wind generator is a cost-effective induction generator, while the plant is equipped with a small capacity energy storage based on conventional batteries, heater load for co-generation and braking, and a voltage smoothing device such as a static Var compensator (SVC). Fuzzy logic controller provides a flexible controller covering a wide range of energy/voltage compensation. A neural network inverse model is designed to provide compensating control amount for a system. The system can be optimized to cope with the fluctuating market-based electricity price conditions to lower the cost of electricity consumption or to maximize the power sales opportunities from the wind generation plant.
Paired-Domination in P 5-Free Graphs
Authors: Paul Dorbec, Sylvain Gravier
Venue: Graphs and Combinatorics (2008)

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by $$\gamma_pr(G)$$, is the minimum cardinality of a paired-dominating set of G. In [1], the authors gave tight bounds for paired-dominating sets of generalized claw-free graphs. Yet, the critical cases are not claws but subdivided stars. We here give a bound for graphs containing no induced P 5, which seems to be the critical case.
Failures in large systems projects in Poland: Mission [im]possible?
Authors: Agnieszka Pawłowska
Venue: Information Polity (2004)

In spite of rich experience in ICT projects' management, a considerable number of them fail. Success of ICT projects is even further endangered in transitional countries, where two parallel processes of informatization and re-engineering of public institutions is taking place. Measures of successful ICT projects' management are defined in strategic documents of egovernment development, however they are not enough to avoid failures. The risk concerning execution of ICT projects is defined in relation to the decision-making theory and organizational theory. Major parameters of ICT decisions and their implementation are analysed: changing laws and regulations, the scale and diversity of ICT projects executed in public institutions, expertise and skills in ICT management, relations between public institution and private partner. Results of activating those parameters are presented in four examples of large systems projects accomplished in public administration in Poland.
Searching and sharing information in networks of heterogeneous agents
Authors: George A. Vouros
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper extends existing methods for information searching and sharing in large-scale, dynamic networks of agents, to deal with networks of heterogeneous agents: Agents that do not share a common conceptualization of information categories and agents that have different preferences on specific information categories. The proposed method extends the method proposed in [7] by building overlay networks for specific information categories. The paper demonstrates through performance experiments the effectiveness of the method, even in cases where these agents shift their expertise.
Using ZBDDs in Points-to Analysis
Authors: Ondřej Lhoták, Stephen Curial, José Nelson Amaral
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent relations, each element of a domain is assigned a bit pattern to represent it, but not every bit pattern represents an element. The circuit design, model checking, and verification communities have achieved significant reductions in BDD sizes using Zero-Suppressed BDDs (ZBDDs) to avoid the overhead of these don't-care bit patterns. We adapt BDD-based program analyses to use ZBDDs instead of BDDs. Our experimental evaluation studies the space requirements of ZBDDs for both context-insensitive and context-sensitive program analyses and shows that ZBDDs can greatly reduce the space requirements for expensive context-sensitive points-to analysis. Using ZBDDs to reduce the size of the relations allows a compiler or other software analysis tools to analyze larger programs with greater precision. We also provide a metric that can be used to estimate whether ZBDDs will be more compact than BDDs for a given analysis.
Research on Fish Intelligence for Fish Trajectory Prediction Based on Neural Network
Authors: Yanmin Xue, Hongzhao Liu, Xiaohui Zhang, Mamoru Minami
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

This paper researches the behavior modes of some intelligent creature in some environment. The gained modes are used as movement models to construct NN to predict the moving trajectory and then catch it. Firstly the behavior patterns of fish that kept trying to escape from the net attached at robot's hand were studied through lots of experiments. The patterns were divided into five sorts and the learning procedures were divided into three stages. Based on this, the position, orientation and speed of each time were used as the input of multi layer perceptron (MLP) neural networks (NN), and the positions of the fish at next time were the outputs. The NN adopted extended delta-bar-delta (DBD) algorithm as learning method. Thus the NNs were constructed to study the moving regulations of fish in every pattern to predict the moving trajectory. The simulation results shows that the BP NN constructed here have the advantage of faster learning rate, higher identifying precision and can predict the fish trajectory successfully. The research is significant for visual servo in robotic system.
Controlling horse heart rate as a basis for training improvement
Authors: J. -M. Aerts, F. Gebruers, E. Van Camp, D. Berckmans
Venue: Computers and Electronics in Agriculture (2008)

Equine training methods, and consequently, performance times have improved little since the last decades. With advances in measuring signals on-line by means of several new technologies and analytical procedures, and processing these signals immediately with strong and compact processors, it may be possible to develop new training methods. In this research, the objective was to explore the possibilities of using modern model-based algorithms to control the heart rate of horses (bpm) on-line by means of the control input running speed (km/h). Forty-five experiments with five horses and four riders were carried out to generate measurements of physiological status during running. The dynamical characteristics of each horse were quantified using linear discrete transfer function models. The dynamic response of heart rate to step changes in running speed were accurately described. In 90% of the cases, a first-order model gave the best fit. For 69% of the models, the r^2 was higher than 0.90 and for 34% of the models, the r^2 was even higher than 0.95. In a next step, the model-based algorithm was evaluated by controlling cardiac responses of two horses (horses 2 and 4) to a pre-defined trajectory. The model parameters were kept constant. On average, the error between the defined target trajectory in heart rate and the actual controlled heart rate ranged between 0.2 and 1.4bpm for the whole target heart rate trajectory. During the steady-state part of the trajectory the average error was maximum 1.1bpm. In the transient from one steady-state heart rate to another level, the error could increase on average up to 5bpm. In the future, the combination of on-line measured bioresponses with real-time analysis can be used for adjusting the work load of the horse, during training, directly to the immediate needs of horse (welfare) and trainer (performance).
Deep Inference for Automated Proof Tutoring?
Authors: Christoph Benzmüller, Dominik Dietrich, Marvin Schiller, Serge Autexier
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

¿MEGA [7], a mathematical assistant environment comprising an interactive proof assistant, a proof planner, a structured knowledge base, a graphical user interface, access to external reasoners, etc., is being developed since the early 90's at Saarland University. Similar to HOL4, Isabelle/HOL, Coq, or Mizar, the overall goal of the project is to develop a system platform for formal methods (not only) in mathematics and computer science. In ¿MEGA, user and system interact in order to produce verifiable and trusted proofs. By continously improving (not only) automation and interaction support in the system we want to ease the usually very tedious formalization and proving task for the user.
Ian Foster on Recent Changes in the Grid Community
Authors: Mark Baker
Venue: IEEE Distributed Systems Online (2004)

Much to the surprise of many in the Grid community, on 20 January 2004 at GlobusWorld, Foster and his colleagues proposed a further evolution of OGSI concepts into the Web Services Resource Framework.
Performance Evaluation of Non-persistent CSMA as Anti-collision Protocol for Active RFID Tags
Authors: E. Egea-López, J. Vales-Alonso, A. S. Martínez-Sala, M. V. Bueno-Delgado, J. García-Haro
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

In this paper we propose the use of non-persistent CSMA as an anti-collision procedure for RFID active tags. Current proposals for both passive and active tags are based on the framed slotted ALOHA protocol, which does not scale well requiring additional procedures for frame length adaptation. However, active RFID devices already include carrier sense capabilities with no additional cost and, thus, CSMA may be employed seamlessly. Nevertheless, selecting the contention micro-slots of CSMA in the classical way (i.e., with a uniform distribution and an exponential back-off algorithm) does not result in an efficient identification process, as we will demonstrate. Fortunately, better choices can be found. Recently, an optimal distribution for the selection of micro-slots for event-driven sensor networks has been computed, as well as a practical implementation: the Sift distribution. In this work we propose the application of the quasi-optimal Sift distribution along with CSMA for active tag identification. By means of an analytical study, we evaluate the average time needed for identification with this mechanism and compare it with the current ISO 18000-7 and EPC "Gen 2" standard. The results reveal that the Sift-based non-persistent CSMA outperforms both of them. Moreover, it also scales much better, without the need for further adaptation mechanisms.