ppxscal/embedding_network huggingface dataset:
Interactive Visualization of Network Anomalous Events
Authors: Yang Cai, Rafael M. Franco
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

We present an interactive visualization and clustering algorithm that reveals real-time network anomalous events. In the model, glyphs are defined with multiple network attributes and clustered with a recursive optimization algorithm for dimensional reduction. The user's visual latency time is incorporated into the recursive process so that it updates the display and the optimization model according to a human-based delay factor and maximizes the capacity of real-time computation. The interactive search interface is developed to enable the display of similar data points according to the degree of their similarity of attributes. Finally, typical network anomalous events are analyzed and visualized such as password guessing, etc. This technology is expected to have an impact on visual real-time data mining for network security, sensor networks and many other multivariable real-time monitoring systems.
Short communication: A novel method for hybrid multiple attribute decision making
Authors: Liu Pei-de
Venue: Knowledge-Based Systems (2009)

An approach based on 2-tuple is presented to solve the hybrid multiple attribute decision making problem with weight information unknown. First, transformation rules between linguistic variables and triangular fuzzy numbers, and distance between 2-tuple linguistics are defined, then the transformation method between 2-tuple linguistic and different forms of indicator values is given. Besides, according to grey incidence minimum deviation theory of positive ideal solution, the weights of indicators are determined, and then alternatives are ranked by 2-tuple linguistic weighting arithmetic average values. Finally, an illustrative example is given to demonstrate the procedure of the method and to compare with TOPSIS method to show the effectiveness and advantages of the presented method.
Interaction Analysis in Collaborative Modeling of Graphical Representations
Authors: M. Angeles, V. Zarate
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

The use of external representations for collaborative learning or problem solving represents a medium of communication different to the natural language. The analysis of this interaction offers new ways of modeling the collaboration. In this paper we report an empirical analysis of the interaction in the creation of simple graphical representations between pairs of students. The paper describes part of the work in progress about the role of the representations in the collaboration and presents an analysis of the actions to identify the dimensions of symmetry, alignment and agreement as indicators of collaboration related with the graphical representation created. The values are obtained considering the actions of the as the only source of information, independently of the dialog. The analysis is presented for the interaction of a pair of students in an experiment based on problem based learning including the use of a synchronous graphical modeling tool.
A Hierarchical Methodology to Specify and Simulate Complex Computational Systems
Authors: César Andrés, Carlos Molinero, Manuel Núñez
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

We introduce a novel methodology to formally specify complex multi-agent systems. Our approach allows us to redefine computational problems in terms of agents that perform certain tasks. In our view, a system is formed by the combination of atomic and complex agents. Atomic agents are in charge of executing atomic tasks while complex agents reunite and summarize the properties of their underlying atomic agents. Basically, our approach consists in specifying the smaller parts of the problem as atomic agents. Each atomic agent is in charge of executing a small transformation of resources. Afterwards, the system will recombine them to form complex agents that will embrace the knowledge of several atomic agents. All agents are located on a superstructure of communication cellules created to record the hierarchy of the tasks. In order to provide a useful framework, we have developed a tool that fully implements all the stages of the methodology. 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
The Image as Spatial Region: Location and Adjacency within the Radiological Image
Authors: James M. Fielding, Dirk Marwede
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

Biomedical ontologies define entities and relations in order to represent knowledge in the biomedical domain. In this paper we concentrate on the domain of medical imaging. In previous work, we analyzed a representative sample of computed tomography reports in order to determine to which entities and relations the terms used in such reports refer (with regard to the Foundational Model of Anatomy (FMA) and the recently published Open Biomedical Ontology (OBO) Relation Ontology, respectively) in order to construct an imaging ontology for electronic reporting in radiology. In this paper we expand the role of two OBO relations in particular, as they may be applied to radiological image information: the relations located_in and adjacent_to. Defining these relations in terms of the basic topological relations of Region Connection Calculus (RCC), we show how the qualitative description of image feature locations in radiological reporting may be formalized for reasoning.
Overview of the new generation network R&D in Japan
Authors: Tomonori Aoyama
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

This talk presents the current status of R&D on New Generation Network (NWGN) in Japan which is expected to be developed until 2020 as a network beyond the Internet and Next Generation Network (NGN). Social and technological requirements for NWGN and the Japanese formation of R&D are introduced. Some of key technologies studied in Japan for NWGN are shown.
Graphics hardware & GPU computing: past, present, and future
Authors: David Luebke
Venue: Proceedings of Graphics Interface 2009 (2009)

Modern GPUs have emerged as the world's most successful parallel architecture. GPUs provide a level of massively parallel computation that was once the preserve of supercomputers like the MasPar and Connection Machine. For example, NVIDIA's GeForce GTX 280 is a fully programmable, massively multithreaded chip with up to 240 cores, 30,720 threads and capable of performing up to a trillion operations per second. The raw computational horsepower of these chips has expanded their reach well beyond graphics. Today's GPUs not only render video game frames, they also accelerate physics computations, video transcoding, image processing, astrophysics, protein folding, seismic exploration, computational finance, radioastronomy - the list goes on and on. Enabled by platforms like the CUDA architecture, which provides a scalable programming model, researchers across science and engineering are accelerating applications in their discipline by up to two orders of magnitude. These success stories, and the tremendous scientific and market opportunities they open up, imply a new and diverse set of workloads that in turn carry implications for the evolution of future GPU architectures. In this talk I will discuss the evolution of GPUs from fixed-function graphics accelerators to general-purpose massively parallel processors. I will briefly motivate GPU computing and explore the transition it represents in massively parallel computing: from the domain of supercomputers to that of commodity "manycore" hardware available to all. I will discuss the goals, implications, and key abstractions of the CUDA architecture. Finally I will close with a discussion of future workloads in games, highperformance computing, and consumer applications, and their implications for future GPU architectures.
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Authors: Huma Lodhi, Stephen Muggleton, Mike J. E. Sternberg
Venue: Proceedings of the KDD-09 Workshop on Statistical and Relational Learning in Bioinformatics (2009)

Inductive Logic Programming (ILP) systems have been successfully applied to solve complex biological problem by viewing them as binary classification tasks. It remains an open question how an accurate solution to a multi-class problem can be obtained by using a logic based learning method. In this paper we present a novel logic based approach to solve complex and challenging multi-class classification problems in bioinformatics by focusing on a particular task, namely protein fold recognition. Our technique is based on the use of large margin kernel-based methods in conjunction with first order rules induced by an ILP system. The proposed approach learns a multi-class classifier by using a divide and conquer reduction strategy that splits multi-classes into binary groups and solves each individual problem recursively hence generating an underlying decision list structure. The method is applied to assigning protein domains to folds. Experimental evaluation of the method demonstrates the efficacy of the proposed approach to solving complex multi-class classification problems in bioinformatics.
Residual-based estimation of peer and link lifetimes in P2P networks
Authors: Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-Based Method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Δ time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we first derive a model for CBM and show that small window size or large Δ may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent tradeoff between overhead and accuracy, which does not allow any fundamental improvement to the method. Instead, we propose a completely different approach for sampling user dynamics that keeps track of only residual lifetimes of peers and uses a simple renewal-process model to recover the actual lifetimes from the observed residuals. Our analysis indicates that for reasonably large systems, the proposed method can reduce bandwidth consumption by several orders of magnitude compared to prior approaches while simultaneously achieving higher accuracy. We finish the paper by implementing a two-tier Gnutella network crawler equipped with the proposed sampling method and obtain the distribution of ultrapeer lifetimes in a network of 6.4 million users and 60 million links. Our experimental results show that ultrapeer lifetimes are Pareto with shape α ≅ 1.1; however, link lifetimes exhibit much lighter tails with α ≅ 1.8.
Approaches to Qualitative Evaluation of the Software Quality Attributes: Overview
Authors: Kozlov Denis
Venue: Proceeding of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05 (2005)

An overview of three most frequently used methods for qualitative evaluation of entities is presented in the paper, namely Overall Integral Index, Fuzzy Analytic Hierarchy Process and Consensus Relation. The implementation of these approaches to the measurement of the software quality attributes is discussed.
Requirements Engineering Education for Professional Engineers
Authors: Takako Nakatani
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

We have developed an educational course for professional engineers to improve their abilities in requirements engineering, especially, the ability to fully grasp problems of the real world in order to elicit requirements. This is essential for engineers to establish valid software requirements specifications (SRS). In order to improve their abilities, we teach multiple methods on RE: e.g. SSM, problem flames and goal-oriented analysis methods, as well as object-oriented modeling methods with UML. In this article, we outline the course and the results of our experiences. The course is evaluated qualitatively.
How children search the internet with keyword interfaces
Authors: Allison Druin, Elizabeth Foss, Leshell Hatley, Evan Golub, Mona Leigh Guha, Jerry Fails, Hilary Hutchinson
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

Children are among the most frequent users of the Internet, yet searching and browsing the web can present many challenges. Studies over the past two decades on how children search were conducted with finite and pre-determined content found in CD-ROM applications, online digital libraries, and web directories. However, with the current popularity of the open Internet and keyword-based interfaces for searching it, more critical analysis of the challenges children face today is needed. This paper presents the findings of our initial study to understand how children ages 7, 9, and 11 search the Internet using keyword interfaces in the home. Our research has revealed that although today's children have been exposed to computers for most of their lives, spelling, typing, query formulation, and deciphering results are all still potential barriers to finding the information they need.
Co-evolution and Information Signals in Biological Sequences
Authors: Alessandra Carbone, Linda Dib
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Information content of a pool of sequences has been defined in information theory through enthropic measures aimed to capture the amount of variability within sequences. When dealing with biological sequences coding for proteins, a first approach is to align these sequences to estimate the probability of each amino-acid to occur within alignment positions and to combine these values through an "entropy" function whose minimum corresponds to the case where for each position, each amino-acid has the same probability to occur. This model is too restrictive when the purpose is to evaluate sequence constraints that have to be conserved to maintain the function of the proteins under random mutations. In fact, co-evolution of amino-acids appearing in pairs or tuplets of positions in sequences constitutes a fine signal of important structural, functional and mechanical information for protein families. It is clear that classical information theory should be revisited when applied to biological data. A large number of approaches to co-evolution of biological sequences have been developed in the last seven years. We present a few of them, discuss their limitations and some related questions, like the generation of random structures to validate predictions based on co-evolution, which appear crucial for new advances in structural bioinformatics.
Performing traffic analysis on a wireless identifier-free link layer
Authors: Kevin Bauer, Damon McCoy, Ben Greenstein, Dirk Grunwald, Douglas Sicker
Venue: The Fifth Richard Tapia Celebration of Diversity in Computing Conference: Intellect, Initiatives, Insight, and Innovations (2009)

Recent work has focused on removing explicit network identifiers (such as MAC addresses) from the wireless link layer to protect users' privacy. However, despite comprehensive proposals to conceal all information encoded in the bits of the headers and payloads of network packets, we find that a straightforward attack on a physical layer property yields information that aids in the profiling of users. In this paper, a statistical technique is developed to associate wireless packets with their respective transmitters solely using the signal strengths of overheard packets. Through experiments conducted in a real indoor office building environment, we demonstrate that packets with no explicit identifiers can be grouped together by their respective transmitters with high accuracy. We next show that this technique is sufficiently accurate to allow an adversary to conduct a variety of complex traffic analysis attacks. As an example, we demonstrate that one type of traffic analysis--a website fingerprinting attack--can be successfully implemented after packets have been associated with their transmitters. Finally, we propose and evaluate techniques that can introduce noise into the measurements of such physical layer phenomena to obfuscate the identifiers derived from them.
Adobe Creative Suite 4 Web Premium All-in-One Desk Reference For Dummies
Authors: Jennifer Smith, Christopher Smith, Fred Gerantabee
Venue:  (2009)

The Adobe Creative Suite 4 Web Premium package has all the tools you need to create cool Web pages with interactive content, animations, 3D images, and more. Learn to use them all in Adobe Creative Suite 4 Web Premium All-in-One For Dummies. Nine handy minibooks cover: Adobe Creative Suite Basics Photoshop CS4 Illustrator CS4 Dreamweaver CS4 Fireworks CS4 Soundbooth Flash CS4 Acrobat 9.0 Contribute CS4 They show you the fastest, easiest ways to use each tool and how to put the pieces together for a Web experience with wow. You can: Get a handle on the common commands and similarities among all the programs Edit images with Photoshop, adjust resolution and size, and explore 3D Work with vector tracing, create graphic styles and templates, and learn Illustrator shortcuts Learn how Dreamweaver CS4 lets you create interactive features without coding Create cool rollover effects and great graphics with Fireworks Use Soundbooth to add sound effects, create and edit audio tracks, and more Build Flash animations that allow for user interaction Collaboratively author, review, and publish content with Contributeyou dont even need to know HTML Youll discover whats new in the Photoshop workspace; how to create Web images, rollovers, image maps, and slices; how PDF files can save you money; how to manage your site with Contribute; and more. Adobe Creative Suite 4 Web Premium All-in-One For Dummies helps you get the most from this great software suite.
A scalable parallel algorithm for the direct numerical simulation of three-dimensional incompressible particulate flow
Authors: Shi Jin, Peter Minev, Krishnaswamy Nandakumar
Venue: International Journal of Computational Fluid Dynamics (2009)

Particulate flow is of great importance from both the scientific and engineering points of view. Owing to the complexity of particle-flow interactions, direct numerical simulations (DNS) of inertial particulate flow with finite-size particles have been limited to a very small number of particles, while the industrial applications involve larger numbers with many orders of magnitude. This article presents a parallel implementation of a fictitious domain method for the DNS of particulate flows. The method is thoroughly tested and its parallel performance on distributed memory clusters is evaluated on a large-scale problem. Finally, we present the results for the separation of 21,336 particles of two different densities in a viscous fluid. Although there is still a significant gap between DNS and the industrial applications, the present algorithm allows to simulate significantly large number of particles so that a meaningful statistical analysis can be performed. This will help in the development of new closure relations for the averaged models of multiphase flows.
Integrating co-occurrence statistics with information extraction for robust retrieval of protein interactions from Medline
Authors: Razvan Bunescu, Raymond Mooney, Arun Ramani, Edward Marcotte
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

The task of mining relations from collections of documents is usually approached in two different ways. One type of systems do relation extraction from individual sentences, followed by an aggregation of the results over the entire collection. Other systems follow an entirely different approach, in which co-occurrence counts are used to determine whether the mentioning together of two entities is due to more than simple chance. We show that increased extraction performance can be obtained by combining the two approaches into an integrated relation extraction model.
Expected progress in the field of business intelligence
Authors: Zeljko Panian
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

Through 15 years of evolution, Business Intelligence (BI) has gone a long way. Today's BI solutions are almost non-comparable concerning their functionalities and usefulness to those developed few years earlier. This is, of course, a favorable situation, but it has some drawbacks too. Unfortunately, BI solutions come from different vendors, imply specific philosophies, run on different platforms, and require specific knowledge to operate them efficiently. The result is complex BI environments that are not simply manageable and controllable. Therefore, a methodology and subsequent technologies have been developed with the goal to ease the tasks of complex BI environments management and governance, and make them more useful to business users. The methodology and appropriate technologies are called Business Intelligence Application Management (BIAM). They are not cheap to implement, but the cost of the BIAM technology itself is rapidly justified through the improved efficiency, performance, and user satisfaction.
Detecting the direction of causal time series
Authors: Jonas Peters, Dominik Janzing, Arthur Gretton, Bernhard Schölkopf
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We propose a method that detects the true direction of time series, by fitting an autoregressive moving average model to the data. Whenever the noise is independent of the previous samples for one ordering of the observations, but dependent for the opposite ordering, we infer the former direction to be the true one. We prove that our method works in the population case as long as the noise of the process is not normally distributed (for the latter case, the direction is not identifiable). A new and important implication of our result is that it confirms a fundamental conjecture in causal reasoning --- if after regression the noise is independent of signal for one direction and dependent for the other, then the former represents the true causal direction --- in the case of time series. We test our approach on two types of data: simulated data sets conforming to our modeling assumptions, and real world EEG time series. Our method makes a decision for a significant fraction of both data sets, and these decisions are mostly correct. For real world data, our approach outperforms alternative solutions to the problem of time direction recovery.
End User Computing Challenges and Technologies: Emerging Tools and Applications
Authors: Steve Clarke, Steve Clarke
Venue:  (2007)

Advances in information technologies have allowed end users to become a fundamental element in the development and application of computing technology and digital information. End User Computing Challenges & Technologies: Emerging Tools & Applications examines practical research and case studies on such benchmark topics as biometric and security technology, protection of digital assets and information, multilevel computer self-efficacy, and end-user Web development. This book offers library collections a critical mass of research into the advancement, productivity, and performance of the end user computing domain.