ppxscal/embedding_network huggingface dataset:
Rule based synonyms for entity extraction from noisy text
Authors: Rema Ananthanarayanan, Vijil Chenthamarakshan, Prasad M Deshpande, Raghuram Krishnapuram
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

Identification of named entities such as person, organization and product names from text is an important task in information extraction. In many domains, the same entity could be referred to in multiple ways due to variations introduced by different user groups, variations of spellings across regions or cultures, usage of abbreviations, typographical errors and other reasons associated with conventional usage. Identifying a piece of text as a mention of an entity in such noisy data is difficult, even if we have a dictionary of possible entities. Previous approaches treat the synonym problem as part entity disambiguation and use learning-based methods that use the context of the words to identify synonyms. In this paper, we show that existing domain knowledge, encoded as rules, can be used effectively to address the synonym problem to a considerable extent. This makes the disambiguation task simpler, without the need for much training data. We look at a subset of application scenarios in named entity extraction, categorize the possible variations in entity names, and define rules for each category. Using these rules, we generate synonyms for the canonical list and match these synonyms to the actual occurrence in the data sets. In particular, we describe the rule categories that we developed for several named entities and report the results of applying our technique of extracting named entities by generating synonyms for two different domains.
DHPA: A New Distributed High Performance Architecture for Space Environment Modeling and Simulation
Authors: Shanshan Li, Qun Wang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Space environment is an indispensable part of the earth environment, but the extreme space weather can bring disasters to human life. The simulation and prediction of complex space environment system using high performance computer is a promising way to solve the problem. Hardware platform is not adequate, a robust software platform is necessary in that it can deal with the complexity of simulation, reduce the cost, and finally avoid software crisis. The Center for Space Environment Modeling (CSEM) at the University of Michigan has developed the SWMF (Space Weather Modeling Framework), but it still has some limitations on interoperation of models, reuse of legacy codes, code maintenance, and distributed computing. This paper presents a new space environment system modeling framework, DHPA (Distributed High Performance Architecture for Space Environment Modeling and Simulation). Adopting CCA(Common Component Architecture) specifications , newly proposed by a consortium of university and national laboratory researchers to introduce software engineering into large-scale scientific computing field, combining service-oriented design ideas, DHPA may be a solution to the problems existed in SWMF, and thus provide scientists with a virtual platform to conduct the collaborative working on physical modeling, model integration, code reuse, management, and visualization, and to realize prediction for space weather.
Modeling "Just-in-Time" Communication in Distributed Real-Time Multimedia Applications
Authors: R. Yang, R. D. van der Mei, D. Roubos, F. J. Seinstra, G. M. Koole, H. E. Bal
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and archives. In recent years, there has been a tremendous growth (in data and computational demands) in the MMCA domain, and this growth is likely to continue in the near future. Multimedia applications operating in real-time environments must run under very strict time constraints, e.g., to analyze video frames at the same rate as a camera produces them. To adhere to such constraints, large-scale multimedia applications typically are being executed on Grid systems consisting of large collections of compute clusters.In services-based scenarios, where video content analysis is being performed by a set of remote multimedia servers, results on aparticular video frame are obtained quickest if a server is unoccupied (i.e., not working on previously submitted frames). Keeping a server unoccupied, however, is a waste~of available compute resources. Therefore, it is important to tune the transmission of newly generated video frames to the occupation of remote servers. However, due to variations in transmission latencies, it is difficult to accurately tune the sending of video frames such that resource utilization is optimized. In this paper we refer to this issue as the problem of "just-in-time" communication. In this paper we address this issue by introducing an adaptive control method that reacts to the continuously changing circumstances in Grid systems so as to obtain the highest service utilization possible, and to minimize service response time for individual video frames. Extensive experimental validation on a real distributed system, in combination with a trace-driven simulation, show that our control method indeed is highly effective.
Secure software development: Why the development world awoke to the challenge
Authors: Mason Brown, Alan Paller
Venue: Information Security Tech. Report (2008)

From the beginning of the information security age 20 years ago, CIOs have asked over and over, ''when will programmers stop making security mistakes?'' But other than highly visible efforts by a few large software vendors, the software development community has not heard the question. At least they have not responded until now. More than 40 large organizations, from Tata Consulting Services (the largest outsourcer in India) to Intel, from Boeing to Siemens, have joined together to raise the visibility of secure software development - and they are having an impact. This article chronicles the forces that brought the consortium together and the steps that they have taken to improve the practice of secure coding throughout the development lifecycle.
Learning with support vector machines for query-by-multiple-examples
Authors: Dell Zhang, Wee Sun Lee
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We explore an alternative Information Retrieval paradigm called Query-By-Multiple-Examples (QBME) where the information need is described not by a set of terms but by a set of documents. Intuitive ideas for QBME include using the centroid of these documents or the well-known Rocchio algorithm to construct the query vector. We consider this problem from the perspective of text classification, and find that a better query vector can be obtained through learning with Support Vector Machines (SVMs). For online queries, we show how SVMs can be learned from one-class examples in linear time. For offline queries, we show how SVMs can be learned from positive and unlabeled examples together in linear or polynomial time. The effectiveness and efficiency of the proposed approaches have been confirmed by our experiments on four real-world datasets.
Changing paradigm in journals based current awareness services in libraries
Authors: G. Mahesh, Dinesh Kumar Gupta
Venue: Information Services and Use (2008)

Current awareness services have been an important service provided by libraries and information centres. With the advent of electronic journals and databases, the current awareness services provided by libraries and information centres are undergoing a shift from being a library centred service to a publisher centred service. The article explores this shift highlighting the different kinds of current awareness services and challenges ahead.
A general framework for statistical performance comparison of evolutionary computation algorithms
Authors: David Shilane, Jarno Martikainen, Sandrine Dudoit, Seppo J. Ovaska
Venue: Information Sciences: an International Journal (2008)

This paper proposes a statistical methodology for comparing the performance of evolutionary computation algorithms. A twofold sampling scheme for collecting performance data is introduced, and these data are analyzed using bootstrap-based multiple hypothesis testing procedures. The proposed method is sufficiently flexible to allow the researcher to choose how performance is measured, does not rely upon distributional assumptions, and can be extended to analyze many other randomized numeric optimization routines. As a result, this approach offers a convenient, flexible, and reliable technique for comparing algorithms in a wide variety of applications.
FPGA-based Ultra-Low Latency HIL Fault Testing of a Permanent Magnet Motor Drive using RT-LAB-XSG
Authors: Christian Dufour, Jean Bélanger, Vincent Lapointe
Venue: Simulation (2008)

Presented is a real-time simulator of a permanent magnet synchronous motor (PMSM) drive implemented on an FPGA card. Real-time simulation of PMSM drives enables thorough testing of control strategies and software protection routines and therefore allows rapid deployment of vehicular or industrial applications. The proposed PMSM model is a phase domain model with sinusoidal flux induction. A 3-phase IGBT inverter drives the PMSM machine. Both models are implemented on an FPGA chip, without any VHDL coding, with the RT-LAB real-time simulation platform of Opal-RT Technologies using a Simulink blockset called Xilinx System Generator (XSG). The paper explains various aspects of the design of the motor drive models in fixed-point representation in XSG, as well as simulation validation against a standard PMSM drive model built in Simulink. The PMSM drive, along with a open-loop test source for the pulse width modulation, is coded for an FPGA card. The model has user-selectable dead time, modulation index, source angle offset, and frequency. The PMSM drive is completed with various encoder models (quadrature, Hall effects and resolver). The overall model compilation and simulation is entirely automated by RT-LAB. The drive can also run in a closed loop with a controller executing on a CPU of a real-time simulator. The phase-domain PMSM drive model runs with an equivalent 10 nanosecond time step (100 MHz FPGA card) and has a latency of 300 nanoseconds (PMSM machine and inverter). The motor drive is directly connected to digital inputs and analog outputs with 1 microsecond settling time on the FPGA card and has a resulting total hardware-in-the-loop latency of 1.3 microseconds.
Vortex dynamics in complex domains on a spherical surface
Authors: Amit Surana, Darren Crowdy
Venue: Journal of Computational Physics (2008)

We consider the motion of both point vortices and uniform vortex patches in arbitrary, possibly multiply connected, regions bounded by impenetrable walls on the surface of a sphere. By exploiting knowledge of the functional form of the relevant Green's function in a pre-image circular domain that is conformally equivalent to a stereographic projection of the fluid domain on the spherical surface, we first generalize Kirchhoff-Routh theory for point vortex motion in the plane to point vortex motion on a spherical shell. Next, we study vortex patch motion and show that there is a contour dynamics formulation for the evolution of uniform vortex patches in any finitely connected domain on a spherical shell bounded by impenetrable walls. We describe a novel numerical scheme whereby this motion can be computed. Some illustrative calculations are shown.
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
Authors: Frédéric Havet, Stéphan Thomassé
Venue: Journal of Graph Theory (2000)

We give a short constructive proof of a theorem of Fisher: every tournament contains a vertex whose second outneighborhood is as large as its first outneighborhood. Moreover, we exhibit two such vertices provided that the tournament has no dominated vertex. The proof makes use of median orders. A second application of median orders is that every tournament of order 2n&thinsp;-&thinsp;2 contains every arborescence of order n&thinsp;>&thinsp;1. This is a particular case of Sumner's conjecture: every tournament of order 2n&thinsp;-&thinsp;2 contains every oriented tree of order n&thinsp;>&thinsp;1. Using our method, we prove that every tournament of order (7n&thinsp;-&thinsp;5)-2 contains every oriented tree of order n. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 244&ndash;256, 2000
Abnormal Gait Detection Using Discrete Fourier Transform
Authors: Ahmed Mostayed, Mohammad Mynuddin Gani Mazumder, Sikyung Kim, Se Jin Park
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Detection of gait characteristics has found considerable interest in fields of biomechanics and rehabilitation sciences. In this paper an approach for abnormal gait detection employing Discrete Fourier Transform (DFT) analysis has been presented. The joint angle characteristics in frequency domain have been analyzed and using the harmonic coefficients, recognition for abnormal gait has been performed. The experimental results and analysis represent that the proposed algorithm based on DFT can not only reduce the gait data dimensionality effectively, but also lightens the computation cost, with a satisfactory distinction. In order to make the algorithm more generic, a Mean Square Error (MSE) analysis is also presented. Future work will be the expansion of the detection introduced in this system to include abnormality detection instead of just an abnormal or normal detection that would prove to be a valuable addition for use in a variety of applications, including unobtrusive clinical gait analysis, automated surveillance etc.
Cyberbullying and Cyberthreats: Responding to the Challenge of Online Social Aggression, Threats, and Distress, 2nd edition
Authors: Nancy E. Willard
Venue:  (2007)

Online communications can be cruel and vicious. They take place 24/7. Damaging text and images can be widely disseminated and impossible to fully remove. There are emerging reports of youth suicide, violence, and abduction related to cyberbullying and cyberthreats. In this book,the author provides school counselors, administrators, teachers and parents with cutting-edge information on how to prevent and respond to cyberbullying and cyberthreats. It covers challenging issues that occur as students embrace the Internet and other digital technologies such as: *Sending offensive, harassing messages *dissing someone or spreading nasty rumors online *Disclosing someone's intimate personal information *Breaking into someone's e-mail account and sending damaging messages under that person's name *Excluding someone from an online group *Using the Internet to intimidate The book includes detailed guidelines for managing in-school use of the Internet and personal devices, including cell phones. Appendices contain reproducible assessment and program forms, as well as parent and student handouts.
CiteWiz: a tool for the visualization of scientific citation networks
Authors: Niklas Elmqvist, Philippas Tsigas
Venue: Information Visualization (2007)

We present CiteWiz, an extensible framework for visualization of scientific citation networks. The system is based on a taxonomy of citation database usage for researchers, and provides a timeline visualization for overviews and an influence visualization for detailed views. The timeline displays the general chronology and importance of authors and articles in a citation database, whereas the influence visualization is implemented using the Growing Polygons technique, suitably modified to the context of browsing citation data. Using the latter technique, hierarchies of articles with potentially very long citation chains can be graphically represented. The visualization is augmented with mechanisms for parent-child visualization and suitable interaction techniques for interacting with the view hierarchy and the individual articles in the dataset. We also provide an interactive concept map for keywords and co-authorship using a basic force-directed graph layout scheme. A formal user study indicates that CiteWiz is significantly more efficient than traditional database interfaces for high-level analysis tasks relating to influence and overviews, and equally efficient for low-level tasks such as finding a paper and correlating bibliographical data.
Sparse adaptive finite elements for radiative transfer
Authors: G. Widmer, R. Hiptmair, Ch. Schwab
Venue: Journal of Computational Physics (2008)

The linear radiative transfer equation, a partial differential equation for the radiation intensity u(x,s), with independent variables x@?D@?R^n in the physical domain D of dimension n=2,3, and angular variable s@?S^2:={y@?R^3:|y|=1}, is solved in the n+2-dimensional computational domain DxS^2. We propose an adaptive multilevel Galerkin finite element method (FEM) for its numerical solution. Our approach is based on (a) a stabilized variational formulation of the transport operator, (b) on so-called sparse tensor products of two hierarchic families of finite element spaces in H^1(D) and in L^2(S^2), respectively, and (c) on wavelet thresholding techniques to adapt the discretization to the underlying problem. An a priori error analysis shows, under strong regularity assumptions on the solution, that the sparse tensor product method is clearly superior to a discrete ordinates method, as it converges with essentially optimal asymptotic rates while its complexity grows essentially only as that for a linear transport problem in R^n. Numerical experiments for n=2 on a set of example problems agree with the convergence and complexity analysis of the method and show that introducing adaptivity can improve performance in terms of accuracy vs. number of degrees even further.
A theory of system behaviour in the presence of node and link failure
Authors: Adrian Francalanza, Matthew Hennessy
Venue: Information and Computation (2008)

We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D@p, a language in which located processes, or agents, may migrate between dynamically created locations. In our extended framework, these processes run on a distributed network, in which individual nodes may crash in fail-stop fashion or the links between these nodes may become permanently broken. The original language, D@p, is also extended by a ping construct for detecting and reacting to these failures. We define a bisimulation equivalence between these systems, based on labelled actions which record, in addition to the effect actions have on the processes, the effect on the actual state of the underlying network and the view of this state known to observers. We prove that the equivalence is fully abstract, in the sense that two systems will be differentiated if and only if, in some sense, there is a computational context, consisting of a surrounding network and an observer, which can see the difference.
Photo-based authentication using social networks
Authors: Sarita Yardi, Nick Feamster, Amy Bruckman
Venue: Proceedings of the first workshop on Online social networks (2008)

We present Lineup, a system that uses the social network graph in Facebook and auxiliary information (e.g., "tagged" user photos) to build a photo-based Web site authentication framework. Lineup's underlying mechanism leverages the concept of CAPTCHAs, programs that are designed to distinguish bots from human users. Lineup extends this functionality to help a Web site ascertain a user's identity or membership in a certain group (e.g., an interest group, invitees to a certain event) in order to infer some level of trust. Lineup works by presenting a user with photographs and asking the user to identify subjects in the photo whom a user with the appropriate identity or group membership should know. We present the design and implementation for Lineup, describe a preliminary prototype implementation, and discuss Lineup's security properties, including possible guarantees and threats.
Efficient streaming of 3D scenes with complex geometry and complex lighting
Authors: Romain Pacanowski, Mickaël Raynaud, Xavier Granier, Patrick Reuter, Christophe Schlick, Pierre Poulin
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

Streaming data to efficiently render complex 3D scenes in presence of global illumination is still a challenging task. In this paper, we introduce a new data structure based on a 3D grid of irradiance vectors to store the indirect illumination appearing on complex and detailed objects: the Irradiance Vector Grid (IVG). This representation is independent of the geometric complexity and is suitable for quantization to different quantization schemes. Moreover, its streaming over network involves only a small overhead compared to detailed geometry, and can be achieved independently of the geometry. Furthermore, it can be efficiently rendered using modern graphics hardwar. We demonstrate our new data structure in a new remote 3D visualization system, that integrates indirect lighting streaming and progressive transmission of the geometry, and study the impact of different strategies on data transfer.
Can You Hear Me Now?
Venue: Queue (2006)

The ultimate alternative human computer interface is speech. Mastering the development skills to integrate speech into applications, however, has never been simple. But as time goes on, significant strides are being made, particularly in applications that leverage embedded processors. In an interview with ACM Queuecast host Mike Vizard, Roberto Sicconi, manager for mobile conversational computing at IBM, explains how and why speech technologies will become a standard element of most mainstream applications. 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
Cyclic Data Synchronization through Reusing SyncML
Authors: Alexander Traud, Jürgen Nagler-Ihlein, Frank Kargl, Michael Weber
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Most techniques for personal data synchronization only allow one-to-one or star network topologies. Enkel DS presented in this paper extends OMA SyncML DS, an open industry standard for optimistic data synchronization. Enkel DS allows many-to-many topologies including cycles enabling a human user to synchronize each personal device with another.
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Authors: Chung-Meng Lee, Jimmy J. M. Tan, Lih-Hsing Hsu
Venue: Information Processing Letters (2008)

Assume that n is a positive integer with n>=2. It is proved that between any two different vertices x and y of Q"n there exists a path P"l(x,y) of length l for any l with h(x,y)=