ppxscal/embedding_network huggingface dataset:
Geocode Matching and Privacy Preservation
Authors: Peter Christen
Venue: Privacy, Security, and Trust in KDD: Second ACM SIGKDD International Workshop, PinKDD 2008, Las Vegas, NV, USA, August 24, 2008, Revised Selected Papers (2009)

Geocoding is the process of matching addresses to geographic locations, such as latitudes and longitudes, or local census areas. In many applications, addresses are the key to geo-spatial data analysis and mining. Privacy and confidentiality are of paramount importance when data from, for example, cancer registries or crime databases is geocoded. Various approaches to privacy-preserving data matching, also called record linkage or entity resolution, have been developed in recent times. However, most of these approaches have not considered the specific privacy issues involved in geocode matching. This paper provides a brief introduction to privacy-preserving data and geocode matching, and using several real-world scenarios the issues involved in privacy and confidentiality for data and geocode matching are illustrated. The challenges of making privacy-preserving matching practical for real-world applications are highlighted, and potential directions for future research are discussed.
Characteristic relational patterns
Authors: Arne Koopman, Arno Siebes
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While relational patterns show how attribute values co-occur in detail, their huge numbers hamper their usage in data analysis. Global models, on the other hand, only provide a summary of how different tables and their attributes relate to each other, lacking detail of what is going on at the local level. In this paper we introduce a new approach that combines the positive properties of both directions: it provides a detailed description of the complete database using a small set of patterns. More in particular, we utilise a rich pattern language and show how a database can be encoded by such patterns. Then, based on the MDLprinciple, the novel RDB-KRIMP algorithm selects the set of patterns that allows for the most succinct encoding of the database. This set, the code table, is a compact description of the database in terms of local relational patterns. We show that this resulting set is very small, both in terms of database size and in number of its local relational patterns: a reduction of up to 4 orders of magnitude is attained.
The WKB Local Discontinuous Galerkin Method for the Simulation of Schrödinger Equation in a Resonant Tunneling Diode
Authors: Wei Wang, Chi-Wang Shu
Venue: Journal of Scientific Computing (2009)

In this paper, we develop a multiscale local discontinuous Galerkin (LDG) method to simulate the one-dimensional stationary Schrödinger-Poisson problem. The stationary Schrödinger equation is discretized by the WKB local discontinuous Galerkin (WKB-LDG) method, and the Poisson potential equation is discretized by the minimal dissipation LDG (MD-LDG) method. The WKB-LDG method we propose provides a significant reduction of both the computational cost and memory in solving the Schrödinger equation. Compared with traditional continuous finite element Galerkin methodology, the WKB-LDG method has the advantages of the DG methods including their flexibility in h-p adaptivity and allowance of complete discontinuity at element interfaces. Although not addressed in this paper, a major advantage of the WKB-LDG method is its feasibility for two-dimensional devices.
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
Authors: Sibylle Fröschle, Sławomir Lasota
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We propose a decision procedure for a general class of normed commutative process rewrite systems and their induced bisimulation equivalences. Our technique is inspired by the polynomial-time algorithm for strong bisimilarity on normed Basic Parallel Processes (BPP), developed by Hirshfeld, Jerrum and Moller. As part of our framework we present a generic unique decomposition result, which we obtain by building on a characterization by Luttik and van Oostrom. We apply our general technique to derive polynomial-time algorithms for strong bisimilarity on normed BPP with communication and for distributed bisimilarity on all BPP with communication. Moreover, our technique yields a PSPACE upper bound for weak and branching bisimilarity on totally normed BPP.
Software architecture: Organizational perspectives
Authors: Paul L. Bannerman
Venue: Proceedings of the 2009 ICSE Workshop on Leadership and Management in Software Architecture (2009)

This position paper examines software architecture through the lenses of four organizational perspectives and identifies opportunities for research to improve the positioning and support of the discipline within organizations. It concludes that while software architecture may rest on solid technical foundations, its position in the organization is not as firm.
BOWL: Design and implementation of a (connectionless) broadcasting system over wireless LAN
Authors: Kartik Muralidharan, Karthikeyan Balaji Dhanapal, Atanu Roy Chowdhury
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

A truly pervasive computing environment can only be created if ubiquitous computation power can collaborate seamlessly to create superior user experience. With the adoption of mobile computing platforms on the rise, we have explored how the IEEE 802.11 wireless access standards can be used to enable a device to be more aware of the capabilities of the infrastructure in its surroundings. Specifically, we have been able to effectively transfer information to these WiFi enabled devices without explicit connections being established and therefore our solution is proven to be much more scalable. We have also showcased a pilot application using the Broadcast over Wireless LAN (BOWL) technology.
Context-Aware Visual Tracking
Authors: Ming Yang, Ying Wu, Gang Hua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Enormous uncertainties in unconstrained environments lead to a fundamental dilemma that many tracking algorithms have to face in practice: Tracking has to be computationally efficient, but verifying whether or not the tracker is following the true target tends to be demanding, especially when the background is cluttered and/or when occlusion occurs. Due to the lack of a good solution to this problem, many existing methods tend to be either effective but computationally intensive by using sophisticated image observation models or efficient but vulnerable to false alarms. This greatly challenges long-duration robust tracking. This paper presents a novel solution to this dilemma by considering the context of the tracking scene. Specifically, we integrate into the tracking process a set of auxiliary objects that are automatically discovered in the video on the fly by data mining. Auxiliary objects have three properties, at least in a short time interval: 1) persistent co-occurrence with the target, 2) consistent motion correlation to the target, and 3) easy to track. Regarding these auxiliary objects as the context of the target, the collaborative tracking of these auxiliary objects leads to efficient computation as well as strong verification. Our extensive experiments have exhibited exciting performance in very challenging real-world testing cases.
On the Existence of Elementary Abelian Cycle Systems
Authors: Anna Benini, Anita Pasotti
Venue: Graphs and Combinatorics (2009)

We present some necessary and/or sufficient conditions for the existence of an elementary abelian cycle system of the complete graph. We propose a construction for some classes of perfect elementary abelian cycle systems. Finally we consider elementary abelian k-cycle systems of the complete multipartite graph.
FARICS: a method of mining spatial association rules and collocations using clustering and Delaunay diagrams
Authors: Robert Bembenik, Henryk Rybiński
Venue: Journal of Intelligent Information Systems (2009)

The paper presents problems pertaining to spatial data mining. Based on the existing solutions a new method of knowledge extraction in the form of spatial association rules and collocations has been worked out and is proposed herein. Delaunay diagram is used for determining neighborhoods. Based on the neighborhood notion, spatial association rules and collocations are defined. A novel algorithm for finding spatial rules and collocations has been presented. The approach allows eliminating the parameters defining neighborhood of objects, thus avoiding multiple "test and trial" repetitions of the process of mining for various parameter values. The presented method has been implemented and tested. The results of the experiments have been discussed.
Analysis of link grammar on biomedical dependency corpus targeted at protein-protein interactions
Authors: Sampo Pyysalo, Filip Ginter, Tapio Pahikkala, Jorma Boberg, Jouni Järvinen, Tapio Salakoski, Jeppe Koivula
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

In this paper, we present an evaluation of the Link Grammar parser on a corpus consisting of sentences describing protein-protein interactions. We introduce the notion of an interaction subgraph, which is the subgraph of a dependency graph expressing a protein-protein interaction. We measure the performance of the parser for recovery of dependencies, fully correct linkages and interaction subgraphs. We analyze the causes of parser failure and report specific causes of error, and identify potential modifications to the grammar to address the identified issues. We also report and discuss the effect of an extension to the dictionary of the parser.
Semi-supervised orthogonal discriminant analysis via label propagation
Authors: Feiping Nie, Shiming Xiang, Yangqing Jia, Changshui Zhang
Venue: Pattern Recognition (2009)

Trace ratio is a natural criterion in discriminant analysis as it directly connects to the Euclidean distances between training data points. This criterion is re-analyzed in this paper and a fast algorithm is developed to find the global optimum for the orthogonal constrained trace ratio problem. Based on this problem, we propose a novel semi-supervised orthogonal discriminant analysis via label propagation. Differing from the existing semi-supervised dimensionality reduction algorithms, our algorithm propagates the label information from the labeled data to the unlabeled data through a specially designed label propagation, and thus the distribution of the unlabeled data can be explored more effectively to learn a better subspace. Extensive experiments on toy examples and real-world applications verify the effectiveness of our algorithm, and demonstrate much improvement over the state-of-the-art algorithms.
Constant-factor approximation algorithms for identifying dynamic communities
Authors: Chayant Tantipathananandh, Tanya Berger-Wolf
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" subsets of a social network. This notion becomes more problematic if the social interactions change over time. Aggregating social networks over time can radically misrepresent the existing and changing community structure. Recently, we have proposed an optimization-based framework for modeling dynamic community structure. Also, we have proposed an algorithm for finding such structure based on maximum weight bipartite matching. In this paper, we analyze its performance guarantee for a special case where all actors can be observed at all times. In such instances, we show that the algorithm is a small constant factor approximation of the optimum. We use a similar idea to design an approximation algorithm for the general case where some individuals are possibly unobserved at times, and to show that the approximation factor increases twofold but remains a constant regardless of the input size. This is the first algorithm for inferring communities in dynamic networks with a provable approximation guarantee. We demonstrate the general algorithm on real data sets. The results confirm the efficiency and effectiveness of the algorithm in identifying dynamic communities.
An investigation of purpose built netbooks for primary school education
Authors: Meg Cramer, Russell Beauregard, Mayank Sharma
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

This paper is a qualitative evaluation of student netbooks used in a classroom setting. Netbooks are thought to be one promising development in the next generation of learning devices, pairing everyday PC capabilities with a purposeful design built for students and schools. The findings suggest that the design is appropriate and engaging for the unique needs of individual primary school students. Nevertheless, the design and specifications of the netbooks do not yet address some classroom-level practices that are crucial to the success of the technology in classrooms. This paper describes some of the key findings of this evaluation, as well as a summary of design considerations for the future design of mobile PCs for education.
A novel watermarking scheme for JPEG images
Authors: Vikas Saxena, J. P. Gupta
Venue: WSEAS Transactions on Signal Processing (2009)

Image watermarking with both insensible detection and high robustness capabilities is still a challenging problem. Even if some of the watermarking areas involve huge financial implication, there are relatively fewer efforts presented, which primarily focus the sustainability against some attacks, which are specific to financial application area particularly. One of such application area is "Fingerprinting" and a major threat for this area is "Collusion Attack". This paper presents an inherently collusion attack resistant (ICAR) scheme for hiding a logo-based watermark in JPEG images. This scheme is based on averaging of low and middle frequency coefficients of block Discrete Cosine Transform (DCT) coefficients of an image. Experimental results show the robustness of the proposed scheme against the JPEG compression and other common image manipulations.
Practical dynamic software updating
Authors: Michael W. Hicks
Venue:  (2008)

This dissertation makes the case that programs can be updated while they run, with modest programmer effort, while providing certain update safety guarantees, and without imposing a significant performance overhead.Few systems are designed with on-the-fly updating in mind. Those systems that permit it support only a very limited class of updates, and generally provide no guarantees that following the update, the system will behave as intended. We tackle the on-the-fly updating problem using a compiler-based approach called dynamic software updating (DSU), in which a program is patched with new code and data while it runs. The challenge is in making DSU practical: it should support changes to programs as they occur in practice, yet be safe, easy to use, and not impose a large overhead.This dissertation makes both theoretical contributions&mdash;formalisms for reasoning about, and ensuring update safety&mdash;and practical contributions&mdash;Ginseng, a DSU implementation for C. Ginseng supports a broad range of changes to C programs, and performs a suite of safety analyses to ensure certain update safety properties. We performed a substantial study of using Ginseng to dynamically update six sizable C server programs, three single-threaded and three multi-threaded. The updates were derived from changes over long periods of time, ranging from 10 months to 4 years-worth of releases. Though the programs changed substantially, the updates were straightforward to generate, and performance measurements show that the overhead of Ginseng is detectable, but modest.In summary, this dissertation shows that DSU can be practical for updating realistic applications as they are written now, and as they evolve in practice.
Cognitive networking of large scale wireless systems
Authors: Liang Song, Dimitrios Hatzinakos
Venue: International Journal of Communication Networks and Distributed Systems (2009)

We propose the concept of cognitive networking for large-scale wireless systems, which opportunistically utilises network resources including both spectrum bandwidth and radio availability. Both types of resources cannot be predetermined in large-scale wireless systems, due to various reasons such as interferences and dynamic traffic load. The proposed technology not only establishes dynamic wireless networks, but also provides for reliable network quality of services (QoS). The supporting network architecture, embedded wireless interconnect (EWI), is proposed to implement the cognitive networking concept and supply an effective application-programming interface for large-scale data management systems. Two example applications are presented, including wireless mesh networks for broadband wireless internet access and wireless sensor networks for target tracking. Major advantages of the technology are further discussed. We suggest that the performance of the proposed system would improve with larger network scale and the implementation complexity could be independent of the network scale.
Memetic: An Infrastructure for Meeting Memory
Authors: Simon Buckingham Shum, Roger Slack, Michael Daw, Ben Juby, Andrew Rowley, Michelle Bachler, Clara Mancini, Danius Michaelides, Rob Procter, David de Roure, Tim Chown, Terry Hewitt
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

This paper introduces the Memetic toolkit for recording the normally ephemeral interactions conducted via internet video conferencing, and making these navigable and manipulable in linear and non-linear ways. We introduce two complementary interaction visualizations: argumentation-based concept maps to elucidate the conceptual structure of the discourse using a visual language, and interactive event timelines generated from the meeting metadata. We discuss in detail the affordances of Memetic's tools, in particular the Compendium hypermedia mapping tool, and the Meeting Replay tool that renders the semantic navigation indices into the videoconference replays. Additionally, with respect to methodology and evaluation, we describe how we are engaging diverse end-user communities in the process of designing and deploying these tools.
Plenary lecture 8: multimedia delivery over mobile ad-hoc wireless networks
Authors: Tarek Saadawi
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

A mobile ad-hoc wireless network is a dynamically changing network of mobile devices that communicate without the support of a fixed infrastructure. There is a direct communications among the neighboring devices, but non-neighboring devices require a robust and intelligent routing strategy to ensure reliable and efficient communications. However, in such networks there is no guaranteed end-to-end quality of service (QoS) and packets may be discarded due to bit errors. On the other hand there has been an increased demand to maintain the video quality over mobile ad-hoc networks. In this talk we will address some of the techniques to enhance quality of services for video delivery over mobile ad-hoc wireless networks. These techniques are implemented either in the MAC layer, in unicast/multicast routing, or in the applications layers. In the first part of the talk, we will present a multipath error recovery technique for video transmission using multipath retransmission scheme. A video demo will highlight the effectiveness of the scheme. In the second part of the Talk, we will address route selection criteria that maintain the video quality under different loss rates and mobility speeds. Route selection is performed based on the expected throughput of the candidate routes. We will demonstrate the effectiveness of this technique by incorporating it into a multi-path routing protocol.
CPATH τεχνη evaluation: background, experiment design and current status
Authors: Robert J. Schalkoff
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

This paper describes the design and implementation of Level 2 and Level 3 evaluation procedures for the NSF CPATH &tau;&epsilon;&chi;&nu;&eta; project. Issues addressed include background, mandated evaluation parameters, cohort identification and selection, experiment design, instruments and evaluation timetables. Preliminary results of a 'dry run' in the Fall 2008 semester are shown. Future efforts are indicated.
Application of the Semantic Learning Approach in the Feasibility Studies Preparation Training Process
Authors: Dimitrios A. Georgakellos, Aristomenis M. Macris
Venue: Information Systems Management (2009)

The present paper is concerned with an ontology-based knowledge network developed for the semantic representation of the feasibility studies preparation procedure. Specifically, a training scenario in feasibility studies and business plan preparing was built, using the CULTOS tools that are based on a self-contained reusable knowledge repository, which combines the ontology constructs with supportive multimedia objects. The proposed approach may have significant impact to enabling users participate actively in the feasibility studies preparing process since they are equipped with an appropriate tool for acquiring a clear and an in depth understanding of this process. Through the present application, it seems that the model could combine any existing multimedia material with ontology constructs, using knowledge-based multimedia authoring tools, in order to build user-training scenarios and satisfy specific training needs.
Facial Comparisons by Subject Matter Experts: Their Role in Biometrics and Their Training
Authors: Nicole A. Spaun
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

The fingerprint biometrics community has accepted the involvement of human examiners as the ultimate verifiers of the output of automated systems, especially in latent fingerprint cases. Likewise, the facial biometrics community should recognize the importance of human experts working in association with the automated process, particularly when analyzing uncontrolled images. As facial biometric systems become more common, more facial image examiners will need to be trained. Currently there are no systematic training programs in place for these examiners. This paper outlines the knowledge needed to conduct facial examinations, and thus should be taught in a successful training program. A facial image comparison expert must be versed in many subjects including: comparative science, image science and processing, bones of the head, muscles of the face, properties of the skin, aging and alteration, legal issues and case law, and the history of facial identifications and photographic comparisons.