ppxscal/embedding_network huggingface dataset:
Towards an Ontology for Crowds Description: A Proposal Based on Description Logic
Authors: Stefania Bandini, Sara Manzoni, Stefano Redaelli
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The research context of this paper refers to bottom---up approaches to crowd dynamics that is, the study of how and where crowds form and move [1]. Several phenomena like crowd aggregation, dispersion and self---organized movement have been observed and studied by multiple disciplines interested to crowds (e.g. physics, sociology, ethology, social and behavioral psychology, building design, urban planning, security management, among others), each one with its specific viewpoint and ontological setting. SCA4CROWDS is an interdisciplinary research within this context that aims at contributing towards the development of a unifying ontology on crowds allowing the integration of contributions coming from several disciplines and that could be exploited for scientific and applicative issues (e.g. model comparison, validation, calibration). Potential exploitations of SCA4CROWDS results are towards the support of design and management of public crowded spaces and events to improve security, safety and comfort of people. SCA4CROWDS, in particular, aims at developing formal and computational tools to support the design, execution and analysis of crowds' behavior as effect of individual interactions (e.g. physical, social, emotional) according to Situated Cellular Agent (SCA) [2]. SCA is a modeling and simulation framework to model and study crowd dynamics phenomena with an approach based on Multi---Agent Systems (MAS) and Cellular Automata [3] principles.
Ontology-Based Deep Web Data Sources Selection
Authors: Wei Fang, Pengyu Hu, Pengpeng Zhao, Zhiming Cui
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Many Web applications are all required high quality information from the Deep Web data sources at present. Such as the Deep Web data source discovering, the extract from query results, and the information integration of query results. They are the key technology in the process of Deep Web information integration. This paper proposes a data sources selection method based on domain ontology. It is used for finding the most relevant sets of query interface related to domain ontology, which is a premise for Deep Web information integration. This approach is based on the interface for its own features and the back-end database semantic. Therefore, it makes better performance than existing approaches.
On Cooperative Caching in Wireless P2P Networks
Authors: Jing Zhao, Ping Zhang, Guohong Cao
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these studies are at a very high level, leaving many design and implementation issues unanswered. In this paper, we present our design and implementation of cooperative cache in wireless P2P networks. We propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data. This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay. We also study the effects of different MAC layers such as 802.11 based ad hoc networks and multi-interface multi-channel based mesh networks, on the performance of cooperative cache. Our results show that the asymmetric approach outperforms the symmetric approach in traditional 802.11 based ad hoc networks by removing most of the processing overhead. In mesh networks, the asymmetric approach can significantly reduce the data access delay compared to the symmetric approach due to data pipelines.
Pervasive RFID and Near Field Communication Technology
Authors: Florian Michahelles, Frederic Thiesse, Albrecht Schmidt, John R. Williams
Venue: IEEE Pervasive Computing (2007)

Today, RFID enjoys enormous interest as the first widely deployed pervasive technology, and Near Field Communication will be the first widely deployed technology enabling humans to communicate with physical objects. This article reports on the Pertec (Pervasive RFID/Near Field Communication Technology and Applications) workshop, which discussed the future evolution of RFID beyond goods identification, including sensor integration, localization, NFC applications, and emerging challenges.
Integrated Simulation and Information Sharing System for Disaster Mitigation
Authors: Itsuki Noda
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

When a huge disaster occurs, many phenomena, not only physical one like land-slides but also human factors like evacuation and rescue, emerge and influent with each other. In order to mitigate damages from such a disaster, we need a tool to understand and to investigat the disaster as a whole. I have been joined several research projects for disaster mitigation in Japan, in which we have been developing an integrated disaster-and-rescue simulation framework and a disaster mitigation information sharing platform. A key concept of these framework and platform is modularity and integration. Because no researcher can be a specialist of all phenomena of the disaster, we need a simple and flexible framework to combine simulation technique for each phenomenon. I show several example of application of these works like fire-fighting, traffic under disaster, and evacuation from terrors.
A Metamodeling Approach for Reasoning about Requirements
Authors: Arda Goknil, Ivan Kurtev, Klaas Berg
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

In requirements engineering, there are several approaches for requirements modeling such as goal-oriented, aspect-driven, and system requirements modeling. In practice, companies often customize a given approach to their specific needs. Thus, we seek a solution that allows customization in a systematic way. In this paper, we propose a metamodel for requirements models (called core metamodel) and an approach for customizing this metamodel in order to support various requirements modeling approaches. The core metamodel represents the common concepts extracted from some prevalent approaches. We define the semantics of the concepts and the relations in the core metamodel. Based on this formalization, we can perform reasoning on requirements that may detect implicit relations and inconsistencies. Our approach for customization keeps the semantics of the core concepts intact and thus allows reuse of tools and reasoning over the customized metamodel. We illustrate the customization of our core metamodel with SysML concepts. As a case study, we apply the reasoning on requirements of an industrial mobile service application based on this customized core requirements metamodel.
FLSOM with Different Rates for Classification in Imbalanced Datasets
Authors: Iván Machón-González, Hilario López-García
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

There are several successful approaches dealing with imbalanced datasets. In this paper, the Fuzzy Labeled Self-Organizing Map (FLSOM) is extended to work with that type of data. The proposed approach is based on assigning two different values in the learning rate depending on the data vector membership of the class. The technique is tested with several datasets and compared with other approaches. The results seem to prove that FLSOM with different rates is a suitable tool and allows understanding and visualizing the data such as overlapped clusters.
A New Method of Detecting Microcalcification Clusters for Computer Aided Digital Mammography
Authors: G. Veni, E. E. Regentova, A. K. Mandava
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Digital mammograms are processed for detecting microcalcification clusters (MCCs) and prompting radiologists on their locations without specifying their type, i.e., benign, normal or malignant. The method includes image segmentation using SUSAN edge detector followed by the shape filters. Then the objects are classified with a four-level feed-forward Neural Network with four input features comprising perimeter and other three characterizing foreground-background relation. MCCs are found using the distance and the object count spatial filters. This simple yet robust system is capable to detect MC clusters with 98.4% of true positives at no false positive cases. The trial is performed on 118 mammograms from the DDSM database. It is shown in the paper that the reported performance is achieved due to the outstanding property of the edge detector to capture objects in a closed contour fashion; an efficient classifier, and significant features characterizing MCCs' geometry and intensities with respect to the background.
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
Authors: Sabina Serbu, Silvia Bianchi, Peter Kropf, Pascal Felber
Venue: IEEE Internet Computing (2007)

Object caching and replication are the primary mechanisms for addressing load balancing in peer-to-peer systems. In structured P2P networks, object popularity compounds the challenge as both the request and forwarding loads increase for the nodes responsible for high-demand objects. To balance loads across P2P networks, the authors propose a method for dynamically updating routing tables at peer nodes that redirects forwarding traffic to nodes in the same neighborhoods as those with popular objects.
An Efficient Approach to Minimum-Cost Network Hardening Using Attack Graphs
Authors: Feng Chen, Lingyu Wang, Jinshu Su
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Attack graphs can reveal the threat of sophisticated multi-step attacks by enumerating possible sequences of exploits leading to the compromise of given critical resources. Finding a solution to remove such threats by hands is tedious and error prone, particularly for larger and poorly secured networks. Existing automated approaches for hardening a network has an exponential complexity and is not scalable to large networks. This paper proposes a novel approach of applying the Reduced Ordered Binary Decision Diagram (ROBDD) method to network hardening. Existing mature optimization techniques in ROBDD makes the proposed approach an efficient solution that can potentially be applied to large networks.
Hybrid DHT Design for Mobile Environments
Authors: Stefan Zoels, Simon Schubert, Wolfgang Kellerer, Zoran Despotovic
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

In this paper we present a hybrid design concept for Distributed Hash Tables (DHTs), in order to increase the performance of DHTs in scenarios with mobile participants. By defining two classes of nodes (static and temporary) and assigning critical overlay networking tasks to reliable static nodes, our concept allows the disburdening of resource-constrained temporary nodes such as PDAs or mobile phones. Further we present an implementation of our system design, based on the Chord protocol, in the Network Simulator 2 (NS-2) and in the overlay simulator L7Sim and show simulation results that prove the significant advantages of our extension in comparison to conventional DHTs.
Bipolar Queries Using Various Interpretations of Logical Connectives
Authors: Sławomir Zadrożny, Janusz Kacprzyk
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In [1,2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated the use of a fuzzified version of the original crisp definition by Lacroix and Lavency [4]. However, the general fuzzification proposed leaves open the choice of a representation of logical connectives and quantifiers. In the present paper we study the influence of the choice some representations that are popular in fuzzy logic on matching degrees of the tuples and their resulting ordering.
A Simple and Effective Method of Color Image Quantization
Authors: Sergio Márquez -De-Silva, Edgardo Felipe-Riverón, Luis Pastor Sánchez Fernández
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper a new algorithm for color quantization of color digital image is presented. The method is based on finding homogeneous regions of colors with a level of tolerance depending on the CIE2000 metric. A consequence obtained from the results obtained with other quantization methods is that the number of final colors depends very importantly on the characteristics of the image. In this paper is demonstrated that the proposed method of color quantization have better behavior than the Median-Cut and the Principal Component's algorithms.
Network Anomaly Detection Based on DSOM and ACO Clustering
Authors: Yong Feng, Jiang Zhong, Zhong-Yang Xiong, Chun-Xiao Ye, Kai-Gui Wu
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

An approach to network anomaly detection is investigated, based on dynamic self-organizing maps (DSOM) and ant colony optimization (ACO) clustering. The basic idea of the method is to produce the cluster by DSOM and ACO. With the classified data instances, anomaly data clusters can be easily identified by normal cluster ratio. And then the identified cluster can be used in real data detection. In the traditional clustering-based intrusion detection algorithms, clustering using a simple distance-based metric and detection based on the centers of clusters, which generally degrade detection accuracy and efficiency. Our approach based on DSOM and ACO clustering can settle these problems effectively. The experiment results show that our approach can detect unknown intrusions efficiently in the real network connections.
An Algorithm for Selecting a Group Leader in Mobile Robots Realized by Mobile Ad Hoc Networks and Object Entropy
Authors: Sang-Chul Kim
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

This paper proposes a novel algorithm for mobile robots to select a group leader and to be guided in order to perform a specific work. The concepts of mobile ad hoc network (MANET) and object entropy are adopted to design the selection of a group leader. A logical robot group is created based on the exchange of request and reply messages in a robot communication group whose organization depends on a transmission range. A group leader is selected based on the transmission of confirmation message from a robot who initiates to make a logical robot group. The proposed algorithm has been verified based on the computer-based simulation. The performance metric such as the number of message in order to make a logical robot group and to select a group leader is defined and verified by using the computer-based simulation.
Formal Language Tools for Template-Guided DNA Recombination
Authors: Michael Domaratzki
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Certain stichotrichous ciliates, single-celled organisms with hair-like structures called cilia, have a well-studied ability to rearrange their DNA during a form of asexual reproduction called conjugation. Ciliates also demonstrate nuclear dualism: each ciliate has both a micronucleus and a macronucleus. The unscrambling of DNA during conjugation occurs when the scrambled version, contained in the micronucleus, is rearranged in a precise way to produce an unscrambled equivalent which forms the macronucleus.
Brief Announcment: Corruption Resilient Fountain Codes
Authors: Shlomi Dolev, Nir Tzachar
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruption may be attributed to a portion of the sources that are malicious.
Experimental and analytical comparison between pair development and software development with fagan's inspection
Authors: Barry Boehm
Venue:  (2007)

Peer review is one of the essential activities in software quality assurance since peer reviews can detect and remove defects in the early stages of the software development life cycle. Removing defects early reduces the cost of defect rework later. Selecting a peer review methodology (e.g., inspection, walkthrough, checklist-based, defect-based, function-based, perspective-based, usage-based, value-based) to execute in a software project is difficult. The developers have to understand the commonalities and differences of each methodology. They need to know the relative strengths and weaknesses of these practices. However, very few studies have compared the commonalities and differences of each peer review methodology and none of the studies have shown an empirical comparison between pair programming and software inspection. Software inspection and pair programming are effective verification techniques. Software inspection is one of the best practices in traditional software development while pair programming is one of the best practices in agile development. Numerous studies have shown the success of software inspection in large-scale software development over the past three decades. Although Pair Programming (PP) is a newer approach and less structured, it has had a strong impact on the success of agile software development projects over the past five years. This dissertation aims to identify the critical factors that impact the cost-effectiveness of either pair programming/development or inspection and provide the decision framework to help the developers select the most effective technique under given conditions. To compare both techniques, four classroom experiments and one industry experiment were conducted in Thailand and US. The development effort and effect of quality were investigated with some additional calendar time comparisons.
Blind Image Separation Using Nonnegative Matrix Factorization with Gibbs Smoothing
Authors: Rafal Zdunek, Andrzej Cichocki
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Nonnegative Matrix Factorization (NMF) has already found many applications in image processing and data analysis, including classification, clustering, feature extraction, pattern recognition, and blind image separation. In the paper, we extend the selected NMF algorithms by taking into account local smoothness properties of source images. Our modifications are related with incorporation of the Gibbs prior, which is well-known in many tomographic image reconstruction applications, to a underlying blind image separation model. The numerical results demonstrate the improved performance of the proposed methods in comparison to the standard NMF algorithms.
The citation advantage of open-access articles
Authors: Michael Norris, Charles Oppenheim, Fytton Rowland
Venue: Journal of the American Society for Information Science and Technology (2008)

Four subjectsecology, applied mathematics, sociology, and economicswere selected to assess whether there is a citation advantage between journal articles that have an open-access (OA) version on the Internet compared to those articles that are exclusively toll access (TA). Citations were counted using the Web of Science, and the OA status of articles was determined by searching OAIster, OpenDOAR, Google, and Google Scholar. Of a sample of 4,633 articles examined, 2,280 (49%) were OA and had a mean citation count of 9.04 whereas the mean for TA articles was 5.76. There appears to be a clear citation advantage for those articles that are OA as opposed to those that are TA. This advantage, however, varies between disciplines, with sociology having the highest citation advantage, but the lowest number of OA articles, from the sample taken, and ecology having the highest individual citation count for OA articles, but the smallest citation advantage. Tests of correlation or association between OA status and a number of variables were generally found to weak or inconsistent. The cause of this citation advantage has not been determined. &copy; 2008 Wiley Periodicals, Inc.
Collaborative and Cooperative Environments
Authors: Christoph Anthes, Vassil Alexandrov, Dieter Kranzlmüller, Jens Volkert, Gerhard Widmer
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Technological advances in high-speed networking and computational grids do not only transform the methods applied to everyday science, but also the collaboration and cooperation between scientists at almost arbitrary locations around the world. The additional provision of multi-sensory, immersive Virtual Reality interfaces as tools to improve the collaboration between groups of human users is another hot topic in this research domain, which will most likely increase the potential benefits of these distributed research communities. The vision to facilitate large scale, complex simulations, which may be steered through natural and intuitive interfaces, is both intriguing and of high scientific interest.
Genotype Sequence Segmentation: Handling Constraints and Noise
Authors: Qi Zhang, Wei Wang, Leonard Mcmillan, Jan Prins, Fernando Pardo-Manuel De Villena, David Threadgill
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Recombination plays an important role in shaping the genetic variations present in current-day populations. We consider populations evolved from a small number of founders, where each individual's genomic sequence is composed of segments from the founders. We study the problem of segmenting the genotype sequences into the minimum number of segments attributable to the founder sequences. The minimum segmentation can be used for inferring the relationship among sequences to identify the genetic basis of traits, which is important for disease association studies. We propose two dynamic programming algorithms which can solve the minimum segmentation problem in polynomial time. Our algorithms incorporate biological constraints to greatly reduce the computation, and guarantee that only minimum segmentation solutions with comparable numbers of segments on both haplotypes of the genotype sequence are computed. Our algorithms can also work on noisy data including genotyping errors, point mutations, gene conversions, and missing values.