ppxscal/embedding_network huggingface dataset:
Integrating statistics and visualization to improve exploratory social network analysis
Authors: Ben Shneiderman
Venue:  (2008)

Social network analysis is emerging as a key technique to understanding social, cultural and economic phenomena. However, social network analysis is inherently complex since analysts must understand every individual's attributes as well as relationships between individuals. There are many statistical algorithms which reveal nodes that occupy key social positions and form cohesive social groups. However, it is difficult to find outliers and patterns in strictly quantitative output. In these situations, information visualizations can enable users to make sense of their data, but typical network visualizations are often hard to interpret because of overlapping nodes and tangled edges. My first contribution improves the process of exploratory social network analysis. I have designed and implemented a novel social network analysis tool, SocialAction (http://www.cs.umd.edu/hcil/socialaction), that integrates both statistics and visualizations to enable users to quickly derive the benefits of both. Statistics are used to detect important individuals, relationships, and clusters. Instead of tabular display of numbers, the results are integrated with a network visualization in which users can easily and dynamically filter nodes and edges. The visualizations simplify the statistical results, facilitating sensemaking and discovery of features such as distributions, patterns, trends, gaps and outliers. The statistics simplify the comprehension of a sometimes chaotic visualization, allowing users to focus on statistically significant nodes and edges. SocialAction was also designed to help analysts explore non-social networks, such as citation, communication, financial and biological networks. My second contribution extends lessons learned from SocialAction and provides designs guidelines for interactive techniques to improve exploratory data analysis. A taxonomy of seven interactive techniques are augmented with computed attributes from statistics and data mining to improve information visualization exploration. Furthermore, systematic yet flexible design goals are provided to help guide domain experts through complex analysis over days, weeks and months. My third contribution demonstrates the effectiveness of long term case studies with domain experts to measure creative activities of information visualization users. Evaluating information visualization tools is problematic because controlled studies may not effectively represent the workflow of analysts. Discoveries occur over weeks and months, and exploratory tasks may be poorly defined. To capture authentic insights, I designed an evaluation methodology that used structured and replicated long-term case studies. The methodology was implemented on unique domain experts that demonstrated the effectiveness of integrating statistics and visualization.
Method for Building Dictionaries to Extract Reputation Information
Authors: Hiroshi Maruyama, Kennshi Suzuki, Taichi Nakamura
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

This paper proposes the method of building dictionaries for extracting reputation information. We propose a method of building a highly credible dictionary from the staggering volume of information that customers post on Web pages. The principle of our proposed method is based on assigning a certainty factor which represents the probability that extracted words really do express a feature or evaluation expression and registering only words which have a certainty factor greater than a pre-set threshold value. As a result of experiment, the method of building a highly credible dictionary has been established.
Information theoretic regularization for semi-supervised boosting
Authors: Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labeled and unlabeled training data. Our approach is based on extending information regularization framework to boosting, bearing loss functions that combine log loss on labeled data with the information-theoretic measures to encode unlabeled data. Even though the information-theoretic regularization terms make the optimization non-convex, we propose simple sequential gradient descent optimization algorithms, and obtain impressively improved results on synthetic, benchmark and real world tasks over supervised boosting algorithms which use the labeled data alone and a state-of-the-art semi-supervised boosting algorithm.
Decision Support Systems Research: Current State, Problems, and Future Directions
Authors: Sean Eom
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

As the progress in the DSS area continues, periodic evaluations of DSS research are often necessary to examine critical issues in DSS area. This paper examines current state, problems, opportunities, and future research directions of DSS research, and. Using author co-citation analysis approach, this research provides the answers to the several key questions posed by Keen and Kuhn. Kuhn believes that in order for any scientific communities to transit from the pre-to post paradigm period, we need to know who we are as the members of scientific community and what we share between the member of the DSS area and what academics and practitioners in DSS share. Keen addressed three main needs of MIS research to be a coherent field. They are clarification of reference disciplines, defining the dependent variables, and building a cumulative tradition. This research aims to answer those five questions. We suggest that DSS researchers need to look at possible changes of research directions from empirical research emphasis to broaden its scope to take a new approach: the design science paradigm.
Predicting precedence delays in loudspeaker configuration
Authors: Tyson Badders, Swayze Smartt
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Developed by Tyson Badders and Swayze Smartt, under the guidance of Jason Romney and Dr. Jennifer Burg, Loudspeaker Precision Analysis aims to solve the problem of configuring loudspeakers in a variety of performance spaces. The problem stems from finding the necessary delay time so that the audience members hear the loudspeakers at appropriate intervals. When the loudspeakers are delayed correctly, audience members perceive the sound from the loudspeakers as if it is coming from the onstage source. This allows the sound engineer to increase the volume of a performer without losing directionality. Since performance spaces are often equipped with dozens of loudspeakers, ensuring one section of the audience hears the correct sound often means that other sections do not. Examining how changes to the delay, tilt, and aim of the loudspeakers affects audience members is a tedious task best left up to a computer. Loudspeaker Precision Analysis predicts what each section of the audience hears and determines if the delay is in the appropriate range to fool the human ear into thinking the sound came from the source, and not the loudspeaker.
Automatic Verification of Counter Systems With Ranking Function
Authors: Emmanuelle Encrenaz, Alain Finkel
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The verification of final termination for counter systems is undecidable. For non flattable counter systems, the verification of this type of property is generally based on the exhibition of a ranking function. Proving the existence of a ranking function for general counter systems is also undecidable. We provide a framework in which the verification whether a given function is a ranking function is decidable. This framework is applicable to convex counter systems which admit a Presburger or a LPDS ranking function. This extends the results of [A. Bradley, Z. Manna, and B. Sipma. Termination analysis of integer linear loops. In CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, volume 3653 of Lecture Notes in Computer Science, pages 488-502. Springer, 2005]. From this framework, we derive a model-checking algorithm to verify whether a final termination property is satisfied or not. This approach has been successfully applied to the verification of a parametric version of the ZCSP protocol.
About some differential equations of interest in the conical motions
Authors: Nicolae Marcov
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

In this paper we study the problem of determining the streamlines of ideal fluid particles in an uniform supersonic isentropic flow and their potential axisymmetric perturbation produced by the presence of a thin right-circular cone with zero incidence. The steady velocity field was calculated in several previous papers. In this work one obtains the solution of Euler's equations for trajectories of fluid particles.
Online Coding for Reliable Data Transfer in Lossy Wireless Sensor Networks
Authors: Anthony D. Wood, John A. Stankovic
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

Bulk transport underlies data exfiltration and code update facilities in WSNs, but existing approaches are not designed for highly lossy and variable-quality links. We observe that Maymounkov's rateless online codes are asymptotically more efficient, but can perform poorly in the WSN operating region. We analyze and optimize coding parameters and present the design and evaluation of RTOC, a protocol for bulk transport that recovered over 95% of application data despite up to 84% packet loss in a MicaZ network.
Programming Windows Embedded CE 6.0 Developer Reference, 4th Edition, 4th edition
Authors: Douglas Boling
Venue:  (2007)

This practical, authoritative, popular reference now in its fourth edition shows developers how to develop applications for the newest generation of mobile and embedded devices. Focusing on the core operating system of Windows Embedded CE 6.0, this guide covers memory management, files and file systems, registries, databases, notifications, communications, and more. It is based on the author s extensive experience training developers focused on embedded technologies how to use Windows CE to its fullest capabilities, and covers the latest features in Windows Embedded CE 6.0. The book includes a link to a companion Web site with extensive sample applications in Visual C++. 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
GTVS: Boosting the Collection of Application Traffic Ground Truth
Authors: Marco Canini, Wei Li, Andrew W. Moore, Raffaele Bolla
Venue: Proceedings of the First International Workshop on Traffic Monitoring and Analysis (2009)

Interesting research in the areas of traffic classification, network monitoring, and application-oriented analysis can not proceed without real traffic traces, labeled with actual application information. However, hand-labeled traces are an extremely valuable but scarce resource in the traffic monitoring and analysis community, as a result of both privacy concerns and technical difficulties. Hardly any possibility exists for payloaded data to be released, while the impossibility of obtaining certain ground-truth application information from non-payloaded data has severely constrained the value of anonymized public traces.The usual way to obtain the ground truth is fragile, inefficient and not directly comparable from one's work to another. This paper proposes a methodology and details the design of a technical framework that significantly boosts the efficiency in compiling the application traffic ground truth. Further, a case study on a 30 minute real data trace is presented. In contrast with past work, this is an easy hands-on tool suite dedicated to save user's time and labor and is freely available to the public.
IP Design for Mobile Networks, 1st edition
Authors: Mark Grayson, Kevin Shatzkamer, Scott Wainner
Venue: Networking Technology (2009)

As the cellular world and the Internet converge, mobile networks are transitioning from circuit to packet and the Internet Protocol (IP) is now recognized as the fundamental building block for all next-generation communication networks. The all-IP vision provides the flexibility to deliver cost-effective services and applications that meet the evolving needs of mobile users. RF engineers, mobile network designers, and system architects will be expected to have an understanding of IP fundamentals and how their role in delivering the end-to-end system is crucial for delivering the all-IP vision that makes the Internet accessible anytime, anywhere. IP Design for Mobile Networks discusses proper IP design theory to effectively plan and implement your next-generation mobile network so that IP integrates all aspects of the network. The book outlines, from both a standards and a design theory perspective, both the current and target state of mobile networks, and the technology enablers that will assist the migration. This IP transition begins with function-specific migrations of specific network domains and ends with an end-to-end IP network for radio, transport, and service delivery. The book introduces many concepts to give you exposure to the key technology trends and decision points affecting todays mobile operators. The book is divided into three parts: Part I provides an overview of how IP is being integrated into mobile systems, including radio systems and cellular networks. Part II provides an overview of IP, the technologies used for transport and connectivity of todays cellular networks, and how the mobile core is evolving to encompass IP technologies. Part III provides an overview of the end-to-end services network based on IP, including context awareness and services. Presents an overview of what mobile networks look like todayincluding protocols used, transport technologies, and how IP is being used for specific functions in mobile networks Provides an all-inclusive reference manual for IP design theory as related to the broader application of IP for mobile networks Imparts a view of upcoming trends in mobility standards to better prepare a network evolution plan for IP-based mobile networks This book is part of the Networking Technology Series from Cisco Press, which offers networking professionals valuable information for constructing efficient networks, understanding new technologies, and building successful careers. ciscopress.com $60.00 USA / $72.00 CAN
Developing autonomic distributed scientific applications: a case study from history matching using ensemblekalman-filters
Authors: Yaakoub El-Khamra, Shantenu Jha
Venue: Proceedings of the 6th international conference industry session on Grids meets autonomic computing (2009)

The development of a simple effective distributed applications that can utilize multiple distributed resources remains challenging. Therefore, not surprisingly, it is difficult to implement advanced application characteristics - such as autonomic behaviour for distributed applications. Notwithstanding, there exist a large class of applications which could benefit immensely with support for autonomic properties and behaviour. For example, many applications have irregular and highly variable resource requirements which are very difficult to predict in advance. As a consequence of irregular execution characteristics, dynamic resource requirements are difficult to predict a priori thus rendering static resource mapping techniques such as work flows ineffective; in general the resource utilization problem can be addressed more efficiently using autonomic approaches. This paper discusses the design and development of a prototype framework that can support many of the requirements of Autonomic applications that desire to use Computational Grids. We provide here an initial description of the features and the architecture of the Lazarus framework developed using SAGA, integrate it with an Ensemble Kalman Filter application, and demonstrate the advantages - performance and lower development cost, of the framework. As proof of concept we deploy Lazarus on several different machines on the TeraGrid, and show the effective utilization of several heterogeneous resources and distinct performance enhancements that autonomics provides. Careful analysis provides insight into the primary reason underlying the performance improvements, namely a late-binding and an optimal choice of the configuration of resources selected.
Cross-layer resource scheduling for video traffic in the downlink of OFDMA-based wireless 4G networks
Authors: Feroz A. Bokhari, Halim Yanikomeroglu, William K. Wong, Mahmudur Rahman
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

Designing scheduling algorithms at the medium access control (MAC) layer relies on a variety of parameters including quality of service (QoS) requirements, resource allocation mechanisms, and link qualities from the corresponding layers. In this paper, we present an efficient cross-layer scheduling scheme, namely, Adaptive Token Bank Fair Queuing (ATBFQ) algorithm, which is designed for packet scheduling and resource allocation in the downlink of OFDMA-based wireless 4G networks. This algorithm focuses on the mechanisms of efficiency and fairness in multiuser frequency-selective fading environments. We propose an adaptive method for ATBFQ parameter selection which integrates packet scheduling with resource mapping. The performance of the proposed scheme is compared to that of the round-robin (RR) and the score-based (SB) schedulers. It is observed from simulation results that the proposed scheme with adaptive parameter selection provides enhanced performance in terms of queuing delay, packet dropping rate, and cell-edge user performance, while the total sector throughput remains comparable. We further analyze and compare achieved fairness of the schemes in terms of different fairness indices available in literature.
Open-Channel Flow, 2nd edition
Authors: M. Hanif Chaudhry
Venue:  (2007)

Analysis of open-channel flow is essential for the planning, design, and operation of water-resource projects. The use of computers and the availability of efficient computational procedures has simplified such analysis, and made it possible to handle increasingly complex systems. In Open-Channel Flow, Second Edition, author Hanif Chaudhry draws upon years of practical experience and incorporates numerous examples and real life applications, to provide the reader with: A strong emphasis on the application of efficient solution techniques, computational procedures, and numerical methods suitable for computer analyses; Complete coverage of steady and unsteady flow techniques; A new chapter on sediment transport and updated chapters on uniform flow and two dimensional flow techniques; New and updated problem sets and exercises, a solutions manual for instructors, and a CD-ROM with short computer programs in FORTRAN that include the input data for sample problems and the associated computer output. Open-Channel Flow, Second Edition is written for students in senior-level undergraduate and graduate courses on steady and unsteady open-channel flow and for civil engineers needing up-to-date and relevant information on the latest developments and techniques in the field. 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
Towards a logic of agency and actions with duration
Authors: Nicolas Troquard, Laure Vieu
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)

As far as we know, there is no multi-agent system allowing to talk both about choices of agents or groups of agents, strategies, and about sufficiently rich actions. This paper aims at offering a path towards a new more expressive logical framework by mixing a STIT-like logic of agency with a PDL-like logic of action. We present the syntax and ontological motivations, and we highlight the expressivity of the resulting framework on an example.
Extracting Schema from Semistructured Data with Weight Tag
Authors: Jiuzhong Li, Shuo Shi
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

This paper put forward the concept of OEM model with weight on its edges, developes a new approach to extracting schema from semistructured data with weight on its edges, and gives two theorems related to computing taget set of label path and suporting degree of label path. Using wideth-first and top-down traversing strategy ,the algorithm computes target set and supporting degree of every label in a label path, and decides whether the label is retained in schema model according to its magnitude of supporting degree and weight of the label .In the last, we test the validity and efficiency of the algorithm. The schema scale of the semistructured data obtained from the same OEM database in this paper is smaller than that in other paper.
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
Authors: Jens Keiner, Stefan Kunis, Daniel Potts
Venue: ACM Transactions on Mathematical Software (TOMS) (2009)

NFFT 3 is a software library that implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides a survey on the mathematical concepts behind the NFFT and its variants, as well as a general guideline for using the library. Numerical examples for a number of applications are given.
Elucidate: employing information visualisation to aid pedagogy for students
Authors: Andrew Hunter, Christopher Exton
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

Understanding the intricacies behind concurrency within object-oriented programming languages has always been a challenge for undergraduate students. While the lecture is a relatively passive learning experience for the student, the use of software visualisation offers the chance to examine the concepts covered in the lecture in an interactive, visual environment. Students can add further dimensions and greater depth to their understanding previously hindered by the pedagogy of this passive environment. Elucidate makes use of the JDI architecture in the Java language to create its own environment that allows students to execute any program within it. Elucidate utilises several information workspaces, each presenting a different perspective about the information, thus facilitating a students ability to employ it in a manner that best allows them to construct their own understanding. Students are able to navigate around multiple views, and through various levels of abstraction, revealing the inner workings and sequence of events in what would otherwise be a black-box program.