ppxscal/embedding_network huggingface dataset:
Analyzing (social media) networks with NodeXL
Authors: Marc A. Smith, Ben Shneiderman, Natasa Milic-Frayling, Eduarda Mendes Rodrigues, Vladimir Barash, Cody Dunne, Tony Capone, Adam Perer, Eric Gleave
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

We present NodeXL, an extendible toolkit for network overview, discovery and exploration implemented as an add-in to the Microsoft Excel 2007 spreadsheet software. We demonstrate NodeXL data analysis and visualization features with a social media data sample drawn from an enterprise intranet social network. A sequence of NodeXL operations from data import to computation of network statistics and refinement of network visualization through sorting, filtering, and clustering functions is described. These operations reveal sociologically relevant differences in the patterns of interconnection among employee participants in the social media space. The tool and method can be broadly applied.
An Ontology-Based Spatial Clustering Selection System
Authors: Wei Gu, Xin Wang, Danielle Ziébelin
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

Spatial clustering, which groups similar spatial objects into classes, is an important research topic in spatial data mining. Many spatial clustering methods have been developed recently. However, many users do not know how to choose the most suitable spatial clustering method to implement their own projects due to lack of expertise in the area. In order to reduce the difficulties of choosing, linking and executing appropriate programs, we build a spatial clustering ontology to formalize a set of concepts and relationships in the spatial clustering domain. Based on the spatial clustering ontology, we implement an ontology-based spatial clustering selection system (OSCS) to guide users selecting an appropriate spatial clustering algorithm. The system consists of the following parts: a spatial clustering ontology, an ontology reasoner using a task-model, a web server and a user interface. Preliminary experiments have been conducted to demonstrate the efficiency and practicality of the system.
A hybrid method for the parallel computation of Green's functions
Authors: Dan Erik Petersen, Song Li, Kurt Stokbro, Hans Henrik B. Sørensen, Per Christian Hansen, Stig Skelboe, Eric Darve
Venue: Journal of Computational Physics (2009)

Quantum transport models for nanodevices using the non-equilibrium Green's function method require the repeated calculation of the block tridiagonal part of the Green's and lesser Green's function matrices. This problem is related to the calculation of the inverse of a sparse matrix. Because of the large number of times this calculation needs to be performed, this is computationally very expensive even on supercomputers. The classical approach is based on recurrence formulas which cannot be efficiently parallelized. This practically prevents the solution of large problems with hundreds of thousands of atoms. We propose new recurrences for a general class of sparse matrices to calculate Green's and lesser Green's function matrices which extend formulas derived by Takahashi and others. We show that these recurrences may lead to a dramatically reduced computational cost because they only require computing a small number of entries of the inverse matrix. Then, we propose a parallelization strategy for block tridiagonal matrices which involves a combination of Schur complement calculations and cyclic reduction. It achieves good scalability even on problems of modest size.
High Performance Computing on Vector Systems 2007, 1st edition
Authors: Michael Resch, Sabine Roller, Peter Lammers, Toshiyuki Furui, Martin Galle, Wolfgang Bez
Venue:  (2007)

The book presents the state-of-the-art in high performance computing and simulation on modern supercomputer architectures. It covers trends in hardware and software development in general and specifically the future of vector-based systems and heterogeneous architectures. The application contributions cover computational fluid dynamics, fluid-structure interaction, physics, chemistry, astrophysics, and climate research. Innovative fields like coupled multi-physics or multi-scale simulations are presented. All papers were chosen from presentations given at the fifth Teraflop Workshop held in November 2006 at Tohoku University, Japan, and the sixth Teraflop Workshop held in March 2007 at the Stuttgart High Performance Computing Center (HLRS), Germany.
Nanometer Technology Designs: High-Quality Delay Tests, 1st edition
Authors: Mohammad Tehranipoor, Nisar Ahmed
Venue: Frontiers In Electronic Testing (2007)

Adopting new fabrication technologies not only provides higher integration and enhances performance, but also increases the types of manufacturing defects. With design size in millions of gates and working frequency in GHz timing-related defects havv become a high proportion of the total chip defects. For nanometer technology designs, the stuck-at fault test alone cannot ensure a high quality level of chips. At-speed tests using the transition fault model has become a requirement in technologies below 180nm. Traditional at-speed test methods cannot guarantee high quality test results as they face many new challenges. Supply noise (including IR-drop, ground bounce, and Ldi/dt) effects on chip performance, high test pattern volume, low fault/defect coverage, small delay defect test pattern generation, high cost of test implementation and application, and utilizing low-cost testers are among these challenges. This book discusses these challenges in detail and proposes new techniques and methodologies to improve the overall quality of the transition fault test.
Towards a knowledge-sharing approach for Information Security Risk Management
Authors: Katerina Papadaki, Nineta Polemi
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Information security risk management (ISRM) is a major concern of organizations worldwide. Although the number of existing ISRM methodologies is enormous, in practice a lot of resources are invested by organizations in creating new ISRM methodologies in order to capture more accurately the risks of their complex information systems. This is a crucial knowledge-intensive process for organizations, but in most cases it is addressed in an ad hoc manner. The existence of a systematic approach for the development of new or improved ISRM methodologies would enhance the effectiveness of the process. In this paper we propose a systematic meta-process for developing new, or improved ISRM methods. We also present the specifications for a collaboration and knowledge-sharing platform supporting a virtual intra-organizational cross-disciplinary team, which aims at improving its ISRM methodologies by adopting the proposed meta-process.
Randomization methods in data mining
Authors: Heikki Mannila
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Data mining research has developed many algorithms for various analysis tasks on large and complex datasets. However, assessing the significance of data mining results has received less attention. Analytical methods are rarely available, and hence one has to use computationally intensive methods. Randomization approaches based on null models provide, at least in principle, a general approach that can be used to obtain empirical p-values for various types of data mining approaches. I review some of the recent work in this area, outlining some of the open questions and problems.
Auditory and visual distractor decrement in older worker manual assembly task learning: Impact of spatial reasoning, field independence, and level of education
Authors: S. F. Wiker, D. J. Schwerha, M. Jaraiedi
Venue: Human Factors in Ergonomics Manufacturing (2009)

This study examined the impact of age on manual assembly task learning in the presence of visual and auditory distracters. Manual assembly task learning (e.g., number of learning trials needed to obtain consistently accurate assembly and near asymptote performance times) was studied in men and women between 18 and 65 years of age. Higher spatial reasoning capabilities were associated with fewer trials to reach the learning criterion, faster manual assembly times, and material prophylaxis for the type of distractors addressed in this study that are likely to be encountered in the workplace. Years of formal education and field independence showed no impact on distractor-based decrements in task learning. For the oldest group of subjects (>50 years), concomitant presentation of visual and auditory distractors that are commonly encountered in industry were associated with a greater number of learning trials that were needed to achieve asymptotic manual assembly task learning. Spatial reasoning and field independence measures were lower in the older than in the younger age groups (p < 0.05). When spatial reasoning was treated as a covariate, however, nearly all age differences found in learning performance in the face of distractors were removed. The findings suggest that selection of workers based on spatial reasoning ability, rather than age, would yield better manual task learning in the face of visual and auditory distraction. &copy; 2009 Wiley Periodicals, Inc.
Distributed Log-based Reconciliation
Authors: Yek Loong Chong, Youssef Hamadi
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)

Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this work, we present four distributed algorithms for log-based reconciliation, an important NP-hard problem occurring in CSCW. Our methods remove the classical drawbacks of centralized systems like single point of failure, performance bottleneck and loss of autonomy. The problem is formalized using the Distributed Constraint Satisfaction paradigm (DisCSP). In the worst case, the message passing complexity of our methods range from O(p2) to O(2p) in a system of p nodes. Experimental results confirm our theoretical analysis and allow us to establish quality and efficiency trade-off for each method.
Reducing STM overhead with access permissions
Authors: Nels E. Beckman, Yoon Phil Kim, Sven Stork, Jonathan Aldrich
Venue: International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming (2009)

While transactional memory makes concurrent programming more convenient, software transactional memory (STM) is typically associated with a high overhead. In this work we present a technique for reducing overhead associated with STM using access permissions, annotations on method parameters describing how references may alias. This information, which is statically checked for correctness, can be used to eliminate synchronization and logging operations. We have implemented this technique and show that it improves performance on a number of benchmarks.
Textual data compression in computational biology
Authors: Raffaele Giancarlo, Davide Scaturro, Filippo Utro
Venue: Bioinformatics (2009)

Motivation: Textual data compression, and the associated techniques coming from information theory, are often perceived as being of interest for data communication and storage. However, they are also deeply related to classification and data mining and analysis. In recent years, a substantial effort has been made for the application of textual data compression techniques to various computational biology tasks, ranging from storage and indexing of large datasets to comparison and reverse engineering of biological networks. Results: The main focus of this review is on a systematic presentation of the key areas of bioinformatics and computational biology where compression has been used. When possible, a unifying organization of the main ideas and techniques is also provided. Availability: It goes without saying that most of the research results reviewed here offer software prototypes to the bioinformatics community. The Supplementary Material provides pointers to software and benchmark datasets for a range of applications of broad interest. In addition to provide reference to software, the Supplementary Material also gives a brief presentation of some fundamental results and techniques related to this paper. It is at: http://www.math.unipa.it/~raffaele/suppMaterial/compReview/ Contact: raffaele@math.unipa.it
An Image-Query Creation Method for Representing Impression by Color-based Combination of Multiple Images
Authors: Shiori Sasaki, Yoshiko Itabashi, Yasushi Kiyoki, Xing Chen
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

This paper presents a dynamic image-query creation and metadata extraction method with semantic correlation computation between color-combinations and impressions of multiple image data. The main features of our method are (1) to create an image-query which reflects user's intention dynamically according to the color-based combinations of images with common features selected by a user as context, (2) to extract appropriate impression by each image collection which cannot be easily extracted from a single image, (3) to provide users an image retrieval environment reflecting historical and cultural semantics and impression of color especially for cultural properties, and (4) to enable an image retrieval environment for the collection of images by time, culture, author e.t.c.. The queries are created by the combination of multiple image sets and operations, which are intersection, accumulation, average, difference of color elements of sample images. First, a set of multiple images with common features is set as sample data for a query creation. Second, color histograms are extracted from the image sets for creating feature vector of a query. Third, the correlations between an image-query vector and target image vectors are calculated on a space which represents the relationship between color and the impression according to historical and cultural semantics of color. This image-query creation method representing impression of color makes it possible to expand the range of image retrieval for a large number of image data of cultural property in digital archives, such as electronic library and electronic museum, automatically.
Web service clustering using multidimensional angles as proximity measures
Authors: Christian Platzer, Florian Rosenberg, Schahram Dustdar
Venue: ACM Transactions on Internet Technology (TOIT) (2009)

Increasingly, application developers seek the ability to search for existing Web services within large Internet-based repositories. The goal is to retrieve services that match the user's requirements. With the growing number of services in the repositories and the challenges of quickly finding the right ones, the need for clustering related services becomes evident to enhance search engine results with a list of similar services for each hit. In this article, a statistical clustering approach is presented that enhances an existing distributed vector space search engine for Web services with the possibility of dynamically calculating clusters of similar services for each hit in the list found by the search engine. The focus is laid on a very efficient and scalable clustering implementation that can handle very large service repositories. The evaluation with a large service repository demonstrates the feasibility and performance of the approach.
Testing the limits of emergent behavior in MAS using learning of cooperative behavior
Authors: Jordan Kidney, Jörg Denzinger
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)

We present a method to test a group of agents for (unwanted) emergent behavior by using techniques from learning of cooperative behavior. The general idea is to mimick users or other systems interacting with the tested agents by a group of tester agents and to evolve the actions of these tester agents. The goal of this evolutionary learning is to get the tested agents to exhibit the (unwanted) emergent behavior. We used our method to test the emergent properties of a team of agents written by students for an assignment in a basic MAS class. Our method produced tester agents that helped the tested agents to perform at their best and another configuration of our system showed how much the tested agents could hold their own against very competitive agents, which revealed breakdowns in the tested agents' cooperation.
Secure two-party point-circle inclusion problem
Authors: Yong-Long Luo, Liu-Sheng Huang, Hong Zhong
Venue: Journal of Computer Science and Technology (2007)

Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol. In comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly.
Workshop on Sketch tools for diagramming
Authors: Beryl Plimmer, Tracy Hammond
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Diagrams are widely used as abstract models of systems. The act of creating the initial diagram is a common problem solving strategy. Most diagrams are conceived and created with an old-fashioned pen on a piece of blank paper or a whiteboard. Current widget based tools, in contrast, are unsuitable for early design support because of the constraints they place on the user. Sketch diagramming tools provide the unrestrained interface of paper and the document preparation support of computers. However there are many outstanding challenges before we can provide really good sketch tools for tasks such as diagramming.
Program Evolution for General Intelligence
Authors: Moshe Looks
Venue: Proceeding of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006 (2007)

A program evolution component is proposed for integrative artificial general intelligence. The system's deployment is intended to be comparable, on Marr's level of computational theory, to evolutionary mechanisms in human thought. The challenges of program evolution are described, along with the requirements for a program evolution system to be competent --solving hard problems quickly, accurately, and reliably. Meta-optimizing semantic evolutionary search (MOSES) is proposed to fulfill these requirements.
Reputation-based service selection in a peer-to-peer mobile environment
Authors: Michele Amoretti, Maria Chiara Laghi, Alberto Carubelli, Francesco Zanichelli, Gianni Conte
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Mobile computing environments may be very critical for traditional QoS management techniques often relying on centralized resource coordinating services, due to the unavoidable high unstability of network and service layers. On the other hand, a peer-to-peer approach for continuous service provisioning to mobile users may maintain locally an updated list of service providers, and allow clients to switch sources depending on the experienced service quality. In this paper we present a QoS-aware reputation management system for service-oriented P2P networks which aims at improving the quality of service provider selection within purely decentralized mobile environments. The selection process is based on the evaluations provided by other service consumers in terms of a set of application specific QoS parameters.
Case-based Reasoning for Ontology Engineering
Authors: Eva Blomqvist
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

When developing semantic applications, constructing the underlying ontologies is a crucial part. Construction of both Semantic Web and enterprise ontologies need to be semi-automatic in order to reduce the effort required and the need for expert ontology engineers. Another important issue is to introduce knowledge reuse in the ontology construction process. By basing our semi-automatic method on the principles of case-based reasoning (CBR) we envision a novel semi-automatic ontology construction approach and also a novel application of case-based reasoning. The development of OntoCase is still ongoing work, in this paper we report mainly on the motivation for using CBR and the possible benefits of this.
Choice of the acquisition parameters for frequency estimation of a sine wave by interpolated DFT method
Authors: Daniel Belega, Dominique Dallet
Venue: Computer Standards Interfaces (2009)

The accuracy of the frequency estimation of a sine wave corrupted by quantization noise using the Interpolated Discrete Fourier Transform (IpDFT) method is affected by systematic and random errors. The systematic errors are independent of quantization noise and are due to the interferences from the image parts of the sine wave spectrum. They depend of the acquisition parameter - integer number of recorded sine wave cycles. The random errors are due to the quantization noise and depend on the acquisition parameter - number of acquired samples. In this paper for the situations in which the IpDFT method uses the maximum side lobe decay windows a condition for the integer part of the number of recorded sine wave cycles is derived to ensure that the systematic errors are very small compared with the quantization errors. Also, a condition for the number of samples is derived to ensure that the absolute error of the normalized frequency due to the random errors is smaller than a desired value with a high confidence level. Carried out simulations confirm the validity of each derived condition.