ppxscal/embedding_network huggingface dataset:
What's in Wikipedia?: mapping topics and conflict using socially annotated category structure
Authors: Aniket Kittur, Ed H. Chi, Bongwon Suh
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Wikipedia is an online encyclopedia which has undergone tremendous growth. However, this same growth has made it difficult to characterize its content and coverage. In this paper we develop measures to map Wikipedia using its socially annotated, hierarchical category structure. We introduce a mapping technique that takes advantage of socially-annotated hierarchical categories while dealing with the inconsistencies and noise inherent in the distributed way that they are generated. The technique is demonstrated through two applications: mapping the distribution of topics in Wikipedia and how they have changed over time; and mapping the degree of conflict found in each topic area. We also discuss the utility of the approach for other applications and datasets involving collaboratively annotated category hierarchies.
Easy interactive access to batch image analysis software
Authors: Ronald L. Danielson
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Effective use of batch software requires a relatively high level of knowledge from the end user. Such a threshold can preclude application of existing software by potential users who are unfamiliar with computer use. Image processing is an example of an area with large amounts of existing batch software. An instance of the threshold problem occurs when natural resource management experts, with minimal computer application experience, want to use satellite imagery to aid management decisions in their discipline areas. This paper discusses the design of an interactive system to solve the problem by allowing inexperienced users to employ existing batch image analysis software with minimal supervision. The design provides for online explanation of terms and functions, default values for most parameters, and allocation of necessary computer resources (e.g., disk files). The user-system dialog may be conducted at any of three levels, allowing continued use as experience is gained. The design considerations and techniques used are generally relevant to accessing batch software for any application area. Difficulties of implementation and expansion are also discussed.
Implementation and analysis of multigrid schemes with finite elements for elliptic optimal control problems
Authors: O. Lass, M. Vallejos, A. Borzi, C. C. Douglas
Venue: Computing (2009)

The detailed implementation and analysis of a finite element multigrid scheme for the solution of elliptic optimal control problems is presented. A particular focus is in the definition of smoothing strategies for the case of constrained control problems. For this setting, convergence of the multigrid scheme is discussed based on the BPX framework. Results of numerical experiments are reported to illustrate and validate the optimal efficiency and robustness of the performance of the present multigrid strategy.
Producing for TV and New Media, Second Edition: A Real-World Approach for Producers, 2nd edition
Authors: Cathrine Kellison
Venue:  (2008)

Producing for TV and New Media provides a comprehensive look at the role of the Producer in television and new media. At the core of every media project there is a Producer who provides a wide array of creative, technical, financial, and interpersonal skills. Written especially for new and aspiring producers, this book looks at both the Big Picture and the essential details of this demanding and exhilarating profession.A series of interviews with seasoned TV producers who share their real-world professional practices provides rich insight into the complex billion-dollar industries of television and new media. This type of practical insight is not to be found in other books on producing. This new edition now covers striking developments in new media, delivery systems, the expansion of the global marketplace of media content.* Comprehensive coverage of the nuanced and multi-dimensional role of a Producer presented in a clear and engaging writing style* Traces a project from conception to a finished piece of broadcast quality* Interviews with estabilished industry professionals offers readers real-world insight into the world of television production
A KLD Based Method for Initial Set Selection in Active Learning
Authors: Wei Chen, Gang Liu, Jun Guo
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Speech recognition systems are usually trained using tremendous transcribed samples, and training data preparation is intensively time-consuming and costly. Aiming at achieving better performance of acoustic model with less transcribed samples, active learning is used in acoustic model training. This learning scheme firstly selects and transcribes a small initial training set, then iteratively selects the most informative samples corresponding to a certain criterion from the unlabeled samples, then annotates them and adds the newly transcribed samples to the training set to update the acoustic model. Concerning that the initial set influences the performance and convergence rate of active learning a lot, we proposed a method for initial set selection based on Kullback-Leibler Divergence (KLD). Our experiments show that active learning using initial set selected by our proposed method can achieve better performance.
Analysis of temporal variations of dynamic textures by means of the SGLDM with application to EIT solar images
Authors: Konrad Bojar, Mariusz Nieniewski
Venue: Machine Graphics Vision International Journal (2008)

The paper discusses applicability of texture analysis methods to Extreme-Ultraviolet Imaging Telescope (EIT) images obtained from the SOHO mission, and in particular analyses of the solar texture by means of the Spatial Gray Level Dependence Matrices (SGLDMs). Based on the observations, a theoretical parametric model is proposed for the SGLDM. Subsequently, the Haralick features are computed directly for the time sequence of preprocessed images, as well as and for the proposed model of the SGLDM. Time evolution of model parameters as well as measures of goodness fit of the model to image data for the period of one year is presented. The results obtained confirm the correctness of the model. In view of the simplicity of the model, it gives remarkably good results. A new method for solar limb extraction is described in the Appendix. The method is superior to those presented in the literature since it uses no external parameters, such as thresholds.
A communication architecture for complex runtime reconfigurable systems and its implementation on spartan-3 FPGAs
Authors: Dirk Koch, Christian Beckhoff, Jüergen Teich
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

In this paper, we present and analyze a sophisticated communication architecture that allows to integrate many different modules into a system by FPGA reconfiguration at runtime. Furthermore, we examine how this architecture can be implemented on low-cost Spartan-3 devices. It will be demonstrated that modules can be exchanged in a system without disturbing the communication architecture. The paper points out, that the capabilities of Spartan-3 FPGAs are sufficient to build complex reconfigurable systems.
From x-rays to silly putty via Uranus: serendipity and its role in web search
Authors: Paul André, Jaime Teevan, Susan T. Dumais
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

The act of encountering information unexpectedly has long been identified as valuable, both as a joy in itself and as part of task-focused problem solving. There has been a concern that highly accurate search engines and targeted personalization may reduce opportunities for serendipity on the Web. We examine whether there is the potential for serendipitous encounters during Web search, and whether improving search relevance through personalization reduces this potential. By studying Web search query logs and the results people judge relevant and interesting, we find many of the queries people perform return interesting (potentially serendipitous) results that are not directly relevant. Rather than harming serendipity, personalization appears to identify interesting results in addition to relevant ones.
Introduction to Network Simulator NS2, 1 edition
Authors: Teerawat Issariyakul, Ekram Hossain
Venue:  (2008)

Introduction to Network Simulator NS2 is a primer providing materials for NS2 beginners, whether students, professors, or researchers for understanding the architecture of Network Simulator 2 (NS2) and for incorporating simulation modules into NS2. The authors discuss the simulation architecture and the key components of NS2 including simulation-related objects, network objects, packet-related objects, and helper objects.The NS2 modules included within are nodes, links, SimpleLink objects, packets, agents, and applications. Further, the book covers three helper modules: timers, random number generators, and error models. Also included are chapters on summary of debugging, variable and packet tracing, result compilation, and examples for extending NS2. Two appendices provide the details of scripting language Tcl, OTcl and AWK, as well object oriented programming used extensively in NS2. Introduction to Network Simulator NS2 can be used by researchers, professionals or graduate students studying telecommunication networks.
An online system for sharing image data for cardiac modeling
Authors: Fariza Hanum Nasaruddin, Maryam Zakeryfar
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

This paper discusses the need to make available images of cardiac data that can assist in digital cardiac modeling research. Such researches are increasing in number to assist in the understanding of the heart. In modeling a digital heart, images from MRI, CT scans, and other scans such as PET and SPECT can be used. These images are difficult to come by for researchers who are not in the medical areas. Thus, any of such available data stored in an on-line system can be made available to other researchers. The design and development of this on-line system is discussed in this paper.
High-Level Interaction with Relational Databases in Logic Programming
Authors: António Porto
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Most real-world applications have come to rely on the mature technology of relational databases for persistent storage, interacting through SQL embedded in the host programming language. Using logic programming we present a higher-level alternative to SQL, close in spirit to natural language, yielding much more concise expressions that are easier to understand and promote better code maintenance. This is achieved using the flexible operator syntax and the deductive capabilities, first to compile a clausal representation of the database scheme from a high-level description, and then to interpret queries and commands, through the compiled scheme, into SQL statements.
Business Specific Online Information Extraction from German Websites
Authors: Yeong Su Lee, Michaela Geierhos
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

This paper presents a system that uses the domain name of a German business website to locate its information pages (e.g. company profile, contact page, imprint) and then identifies business specific information. We therefore concentrate on the extraction of characteristic vocabulary like company names, addresses, contact details, CEOs, etc. Above all, we interpret the HTML structure of documents and analyze some contextual facts to transform the unstructured web pages into structured forms. Our approach is quite robust in variability of the DOM, upgradeable and keeps data up-to-date. The evaluation experiments show high efficiency of information access to the generated data. Hence, the developed technique is adaptive to non-German websites with slight language-specific modifications, and experimental results on real-life websites confirm the feasibility of the approach.
Renkan
Authors: Nobuo Takahashi
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

According to the 2005 Benchmark Land Prices for Prefectural and City Governments announced by the Ministry of Land, Infrastructure, Transport and Tourism, Nagoya firmly occupies third place in the national ranking of commercial land price increases.
Schur complements on Hilbert spaces and saddle point systems
Authors: Constantin Bacuta
Venue: Journal of Computational and Applied Mathematics (2009)

For any continuous bilinear form defined on a pair of Hilbert spaces satisfying the compatibility Ladyshenskaya-Babusca-Brezzi condition, symmetric Schur complement operators can be defined on each of the two Hilbert spaces. In this paper, we find bounds for the spectrum of the Schur operators only in terms of the compatibility and continuity constants. In light of the new spectral results for the Schur complements, we review the classical Babusca-Brezzi theory, find sharp stability estimates, and improve a convergence result for the inexact Uzawa algorithm. We prove that for any symmetric saddle point problem, the inexact Uzawa algorithm converges, provided that the inexact process for inverting the residual at each step has the relative error smaller than 1/3. As a consequence, we provide a new type of algorithm for discretizing saddle point problems, which combines the inexact Uzawa iterations with standard a posteriori error analysis and does not require the discrete stability conditions.
A Hierarchical Algorithm for Clustering Uncertain Data via an Information-Theoretic Approach
Authors: Francesco Gullo, Giovanni Ponti, Andrea Tagarelli, Sergio Greco
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In recent years there has been a growing interest in clustering uncertain data. In contrast to traditional, "sharp" data representation models, uncertain data objects can be represented in terms of an uncertainty region over which a probability density function (pdf) is defined. In this context, the focus has been mainly on partitional and density-based approaches, whereas hierarchical clustering schemes have drawn less attention.We propose a centroid-linkage-based agglomerative hierarchical algorithm for clustering uncertain objects, named U-AHC. The cluster merging criterion is based on an information-theoretic measure to compute the distance between cluster prototypes. These prototypes are represented as mixture densities that summarize the pdfs of all the uncertain objects in the clusters. Experiments have shown that our method outperforms state-of-the-art clustering algorithms from an accuracy viewpoint while achieving reasonably good efficiency.
SVC location for TTC enhancement using differential evolution: making the algorithm faster
Authors: Malihe M. Farsangi, Hossein Nezamabadi-pour, Majid Hesari, Jalal Razavi
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

In this paper, a new Differential Evolution (DE) with small population (DESP) comparing to standard DE (SDE) is proposed for maximizing the Total Transfer Capability (TTC) between source and sink area by considering voltage limits and thermal limits in a power system by placing Static Var Compensator (SVC). Different strategies are considered to solve the problem. A comparison is made between the obtained results by SDE and DESP in terms of their success rate. Furthermore, simulation studies on a multi-machine network (IEEE 30-bus system) are presented to illustrate the capability of SDE and DESP algorithms with different strategies to solve the problem.
Innovative remote laboratory in the enhanced E-training of mechatronics
Authors: Matija Pipan, Tanja Arh, Borka Jerman Blažič
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

The main purpose of this paper is to introduce good practices into the areas of vocational training in mechatronics supported with the state-of-the-art ICT - implementation of the innovative on-line remote laboratory for practical experiments into e-course, as well as with the established methodological and didactic approaches, all with the view of improving the quality and efficiency of education. The aim and the goals of this new modern way of training in the field of mechatronics are directly focused on resolving the issue of the current market imbalances of supply and demand of qualified mechatronics staff. This should result in greater recognition and appeal of the profession, and will positively influence on the existing gap on the market.
Social Search: Exploring and Searching Social Architectures in Digital Networks
Authors: Matthias Trier, Annette Bobrik
Venue: IEEE Internet Computing (2009)

Content authors are increasingly using the Internet to network, providing each other with advice, collaboratively filtering important information, and creating virtual networks of trust. To adequately understand this social cyberspace, we must be able to search and explore the patterns and processes of group interaction. A novel software-based approach addresses this objective. The method is built on the concepts of social translucency and social network analysis, extending the latter by including keyword analysis, dynamic network visualization, and additional modeling properties. On the basis of these models, the authors suggest a visualization-based procedure for searching and exploring social corpora using combinable filtering algorithms. They offer two examples—an electronic discussion and a corporate email network—to demonstrate search and retrieval in networks. Their examples further yield novel insights into the actual dynamics of content dissemination and network evolvement among virtual network members.
Dynamic Uplink/Downlink Resource Allocation for TDD OFDMA Access Network
Authors: Mingyan Kou, Yanxiang Zhen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

The next generation communications system intend to develop broadband wireless access networks, which support heteronymous uplink and downlink services with different quality of service (QoS) requirement. In this paper, we address when and how to allocate the resource for uplink and downlink in Time Division Duplex (TDD) OFDMA wireless network. For typical cellular network and mesh-like network, due to variable ratio of uplink/downlink heteronymous services, we proposed resource allocation (RA) scheme with dynamic asymmetry uplink downlink ratio (DAUDR) based on Basic-Capacity-Based admission control (BCBAC). The numerical result show that performance of our scheme outweigh the fix ratio RA in the overall resource utilization.
On comparing two sequences of numbers and its applications to clustering analysis
Authors: R. J. G. B. Campello, E. R. Hruschka
Venue: Information Sciences: an International Journal (2009)

A conceptual problem that appears in different contexts of clustering analysis is that of measuring the degree of compatibility between two sequences of numbers. This problem is usually addressed by means of numerical indexes referred to as sequence correlation indexes. This paper elaborates on why some specific sequence correlation indexes may not be good choices depending on the application scenario in hand. A variant of the Product-Moment correlation coefficient and a weighted formulation for the Goodman-Kruskal and Kendall's indexes are derived that may be more appropriate for some particular application scenarios. The proposed and existing indexes are analyzed from different perspectives, such as their sensitivity to the ranks and magnitudes of the sequences under evaluation, among other relevant aspects of the problem. The results help suggesting scenarios within the context of clustering analysis that are possibly more appropriate for the application of each index.
Quick and Practical Run-Time Evaluation of Multiple Program Optimizations
Authors: Grigori Fursin, Albert Cohen, Michael O'Boyle, Olivier Temam
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a single program optimization, we take advantage of periods of stable performance, called phases. For that purpose, we propose a low-overhead phase detection scheme geared toward fast optimization space pruning, using code instrumentation and versioning implemented in a production compiler.Our approach is driven by simplicity and practicality. We show that a simple phase detection scheme can be sufficient for optimization space pruning. We also show it is possible to search for complex optimizations at run-time without resorting to sophisticated dynamic compilation frameworks. Beyond iterative optimization, our approach also enables one to quickly design self-tuned applications.Considering 5 representative SpecFP2000 benchmarks, our approach speeds up iterative search for the best program optimizations by a factor of 32 to 962. Phase prediction is 99.4% accurate on average, with an overhead of only 2.6%. The resulting self-tuned implementations bring an average speed-up of 1.4.
Dingo: taming device drivers
Authors: Leonid Ryzhyk, Peter Chubb, Ihor Kuz, Gernot Heiser
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Device drivers are notorious for being a major source of failure in operating systems. In analysing a sample of real defects in Linux drivers, we found that a large proportion (39%) of bugs are due to two key shortcomings in the device-driver architecture enforced by current operating systems: poorly-defined communication protocols between drivers and the OS, which confuse developers and lead to protocol violations, and a multithreaded model of computation that leads to numerous race conditions and deadlocks. We claim that a better device driver architecture can help reduce the occurrence of these faults, and present our Dingo framework as constructive proof. Dingo provides a formal, state-machine based, language for describing driver protocols, which avoids confusion and ambiguity, and helps driver writers implement correct behaviour. It also enforces an event-driven model of computation, which eliminates most concurrency-related faults. Our implementation of the Dingo architecture in Linux offers these improvements, while introducing negligible performance overhead. It allows Dingo and native Linux drivers to coexist, providing a gradual migration path to more reliable device drivers.