ppxscal/embedding_network huggingface dataset:
Measuring social networks with digital photograph collections
Authors: Scott Golder
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

The ease and lack of cost associated with taking digital photographs have allowed people to amass large personal photograph collections. These collections contain valuable information about their owners' social relationships. This paper is a preliminary investigation into how digital photo collections can provide useful data for the study of social networks. Results from an analysis of 23 subjects' photo collections demonstrate the feasibility of this approach. The relationship between perceived closeness and network position, as well as future questions, are also discussed.
Natural Actor-Critic
Authors: Jan Peters, Stefan Schaal
Venue: Neurocomputing (2008)

In this paper, we suggest a novel reinforcement learning architecture, the Natural Actor-Critic. The actor updates are achieved using stochastic policy gradients employing Amari's natural gradient approach, while the critic obtains both the natural policy gradient and additional parameters of a value function simultaneously by linear regression. We show that actor improvements with natural policy gradients are particularly appealing as these are independent of coordinate frame of the chosen policy representation, and can be estimated more efficiently than regular policy gradients. The critic makes use of a special basis function parameterization motivated by the policy-gradient compatible function approximation. We show that several well-known reinforcement learning methods such as the original Actor-Critic and Bradtke's Linear Quadratic Q-Learning are in fact Natural Actor-Critic algorithms. Empirical evaluations illustrate the effectiveness of our techniques in comparison to previous methods, and also demonstrate their applicability for learning control on an anthropomorphic robot arm.
Deep intellisense: a tool for rehydrating evaporated information
Authors: Reid Holmes, Andrew Begel
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Software engineers working in large teams on large, long-lived code-bases have trouble understanding why the source code looks the way does. Often, they answer their questions by looking at past revisions of the source code, bug reports, code checkins, mailing list messages, and other documentation. This process of inquiry can be quite inefficient, especially when the answers they seek are located in isolated repositories accessed by multiple independent investigation tools. Prior mining approaches have focused on linking various data repositories together; in this paper we investigate techniques for displaying information extracted from the repositories in a way that helps developers to build a cohesive mental model of the rationale behind the code. After interviewing several developers and testers about how they investigate source code, we created a Visual Studio plugin called Deep Intellisense that summarizes and displays historical information about source code. We designed Deep Intellisense to address many of the hurdles engineers face with their current techniques, and help them spend less time gathering information and more time getting their work done.
RIP-MTI: A New Way to Cope with Routing Loops
Authors: Ch. Steigner, H. Dickel, T. Keupen
Venue: Proceedings of the Seventh International Conference on Networking (2008)

We introduce a new downward compatible routing protocol called Routing Information Protocol with Minimal Topology Information (RIP-MTI) which is based on the simple Routing Information Protocol (RIP). We exploit the distance vector updates more thoroughly than common RIP-protocols, and therefore, need not alter the interactive behavior of the Routing Information Protocol. With this approach, we are able to recognize loops and avoid the well known Counting to Infinity problem of distance vector routing. This new protocol can recognize and reject updates which have made their way along loops by evaluating simple metric-based equations.
Complete fairness in secure two-party computation
Authors: Dov S. Gordon, Hazay Carmit, Jonathan Katz, Yehuda Lindell
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable property is fairness, which guarantees that if either party receives its output, then the other party does too. Cleve (STOC 1986) showed that complete fairness cannot be achieved in general in the two-party setting; specifically, he showed (essentially) that it is impossible to compute Boolean XOR with complete fairness. Since his work, the accepted folklore has been that nothing non-trivial can be computed with complete fairness, and the question of complete fairness in secure two-party computation has been treated as closed since the late '80s. In this paper, we demonstrate that this widely held folklore belief is false by showing completely-fair secure protocols for various non-trivial two-party functions including Boolean AND/OR as well as Yao's "millionaires' problem". Surprisingly, we show that it is even possible to construct completely-fair protocols for certain functions containing an "embedded XOR", although in this case we also prove a lower bound showing that a super-logarithmic number of rounds are necessary. Our results demonstrate that the question of completely-fair secure computation without an honest majority is far from closed.
Different Approaches for Linear and Non-linear ECG Generation
Authors: Saeedeh Lotfi Mohammad Abad, Nader Jafarnia Dabanloo, Mohammadreza Mohagheghi
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Developing a mathematical model for the artificial generation of electrocardiogram (ECG) signals is a subject that has been widely investigated. One of the challenges is to generate ECG signals with a wide range of waveforms, power spectra and variations in heart rate variability (HRV)—all of which are important indexes of human heart functions. In this paper we present a comprehensive model for generating such artificial ECG signals. In the first model, the operator can specify the mean and standard deviation of the heart rate, the morphology of the PQRST cycle, and the power spectrum of the RR tachogram. In the second one, we use a new modified Zeeman model for generating the time series for HRV, and a single cycle of ECG is produced by using a simple neural network. The importance of the work is the model’s ability to produce artificial ECG signals that resemble experimental recordings under various physiological conditions.In one of these models, IPFM box was used to generate the R-R intervals. On the other hand, we use A dynamical model based on three coupled ordinary differential equations is introduced which is capable of generating realistic synthetic electrocardiogram (ECG) signals. In this paper we focus on clustering data derived from Autoregressive moving Average (ARMA) models using k-means and k-medoids algorithms with the Euclidean distance between estimated model parameter. These models employed to assess biomedical signal processing techniques which are used to compute clinical statistics from the ECG.
Efficient EMD-based similarity search in multimedia databases via flexible dimensionality reduction
Authors: Marc Wichterich, Ira Assent, Philipp Kranen, Thomas Seidl
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The Earth Mover's Distance (EMD) was developed in computer vision as a flexible similarity model that utilizes similarities in feature space to define a high quality similarity measure in feature representation space. It has been successfully adopted in a multitude of applications with low to medium dimensionality. However, multimedia applications commonly exhibit high-dimensional feature representations for which the computational complexity of the EMD hinders its adoption. An efficient query processing approach that mitigates and overcomes this effect is crucial. We propose novel dimensionality reduction techniques for the EMD in a filter-and-refine architecture for efficient lossless retrieval. Thorough experimental evaluation on real world data sets demonstrates a substantial reduction of the number of expensive high-dimensional EMD computations and thus remarkably faster response times. Our techniques are fully flexible in the number of reduced dimensions, which is a novel feature in approximation techniques for the EMD.
On the solvability for parabolic equations with one space variable
Authors: Martín López Morales
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In the present work we consider the higher order linear parabolic equation in a rectangle with initial and boundary conditions. We establish new a priori estimates for the solutions to this problem in general Hölder anisotropic norms, under the assumption that the coefficients and the independent term are continuous functions in the rectangle, they satisfy the general Hölder condition in the rectangle of exponent a(l), with respect to the space variable only and they satisfy the general Hölder condition on the boundary of exponent b(l, with respect to all variables. In this connection, however, we also obtain an estimate for the modulus of continuity with respect to the time of the higher derivatives with respect to x of the corresponding solutions. On the basis of our new a priori estimates for the solution to this problem, we establish the corresponding theorem on the solvability in general Hölder anisotropic spaces. We apply our results in the linear theory to establish the local solvability with respect to the time, in general Hölder anisotropic spaces, for the nonlinear parabolic equation, with the same type of initial and boundary conditions.
Finding Friend Groups in Blogosphere
Authors: Shih-Ta Kuan, Bang-Ye Wu, Wan-Jui Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this work, we propose an algorithm based on transitive extension for finding friend groups in blogosphere to perform social network analysis. In today's blog service environment, the establishments of friend relationships are always unidirectional, and the recognition of both ends is not necessary. Therefore, general methods will find either too small or too few cliques from friend groups. This isbecause the bidirectional link is built incompletely in the social network under such circumstances. To solve this problem, we propose the 1.5-clique extension method to derive better social network structures for finding friend groups, and we use Wretch (www.wretch.cc) as a case for analysis. We further make a comparison among the results of finding groups in the original social network, and its 1-clique extension, 1.5-clique extension, and 2-cliqueextension. The experimental results suggest that our proposed method is effective and promising.
Authorship attribution
Authors: Patrick Juola
Venue: Foundations and Trends in Information Retrieval (2006)

Authorship attribution, the science of inferring characteristics of the author from the characteristics of documents written by that author, is a problem with a long history and a wide range of application. Recent work in "non-traditional" authorship attribution demonstrates the practicality of automatically analyzing documents based on authorial style, but the state of the art is confusing. Analyses are difficult to apply, little is known about type or rate of errors, and few "best practices" are available. In part because of this confusion, the field has perhaps had less uptake and general acceptance than is its due. This review surveys the history and present state of the discipline, presenting some comparative results when available. It shows, first, that the discipline is quite successful, even in difficult cases involving small documents in unfamiliar and less studied languages; it further analyzes the types of analysis and features used and tries to determine characteristics of well-performing systems, finally formulating these in a set of recommendations for best practices.
Computing the multiplicity structure from geometric involutive form
Authors: Xiaoli Wu, Lihong Zhi
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

We present a method based on symbolic-numeric reduction to geometric involutive form to compute the primary component and the differential operators f solution of a polynomial ideal. The singular solution can be exact or approximate. If the singular solution is known with limited accuracy, then we propose a new method to refine it to high accuracy.
Semantics through language sharing
Authors: Jessica Rubart
Venue: Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence (2008)

This paper discusses how existing approaches in the hypermedia and software engineering fields support web semantics. Web semantics is an important issue in the context of Web Science. Both directions, the Semantic Web and Folksonomies, focus on language sharing. It is argued that to build holistic hypermedia systems these language kinds need to be integrated or mapped. A web semantics space is proposed that supports comparison of approaches with respect to language sharing.
Admission Control in a Computational Market
Authors: Thomas Sandholm, Kevin Lai, Scott Clearwater
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

We propose, implement and evaluate three admission models for computational Grids. The model stake the expected demand into account and offer a specific performance guarantee. The main issue addressed is how users and providers should make the tradeoff between a best effort (low guarantee) spot market and an admission controlled (high guarantee) reservation market. Using a realistically modeled high performance computing workload and utility models of user preferences, we run experiments highlighting the conditions under which different markets and admission models are efficient. The experimental results show that providers can make large efficiency gains if the admission model is chosen dynamically based on the current load, likewise we show that users have an opportunity to optimize their job performance by carefully picking the right market based on the state of the system, and the characteristics of the application to be run. Finally, we provide simple functional expressions that can guide both users and providers when making decisions about guarantee levels to request or offer.
On a conjecture of Thomassen and Toft
Authors: Matthias Kriesell
Venue: Journal of Graph Theory (1999)

This article is motivated by a conjecture of Thomassen and Toft on the number s2(G) of separating vertex sets of cardinality 2 and the number &nu;2(G) of vertices of degree 2 in a graph G belonging to the class 풢 of all 2-connected graphs without nonseparating induced cycles. Let ‖G‖ denote the number of edges of the graph G. Thomassen and Toft conjectured in [C. Thomassen B. Toft, J. Combin. Theory B 31 (1981), 199224] the existence of a positive constant c satisfying s2(G) + &nu;2(G) > c &middot; ‖G‖ for all G &epsilon; 풢. We shall see that this is not true in general. Restricting ourselves to planar graphs, we obtain s2(G) + &nu;2(G) > $$1\over5$$ &middot; ‖G‖ for all planar G &epsilon; 풢, where $$1\over5$$ is best-possible. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 32: 118122, 1999
A Novel Anomaly Detection Algorithm Based on Real-Valued Negative Selection System
Authors: Hu Zhengbing, Zhou Ji, Ma Ping
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In this paper, a new method of detector generation and matching mechanism for Negative Selection Algorithm(NSA )is introduced with variable properties, which are called the Nsa-Vs-Detector. The detectors can be variable in different ways using this concept, the paper describes an algorithm when the variable parameter is the size of the detectors in real-valued space. The algorithm is tested with a synthetic datasets, the new method improves the NSA's efficiency and reliability without significant increase in complexity.
Expertise identification and visualization from CVS
Authors: Omar Alonso, Premkumar T. Devanbu, Michael Gertz
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

As software evolves over time, the identification of expertise becomes an important problem. Component ownership and team awareness of such ownership are signals of solid project. Ownership and ownership awareness are also issues in open-source software (OSS) projects. Indeed, the membership in OSS projects is dynamic with team members arriving and leaving. In large open source projects, specialists who know the system very well are considered experts. How can one identify the experts in a project by mining a particular repository like the source code? Have they gotten help from other people? We provide an approach using classification of the source code tree as a path to derive the expertise of the committers. Because committers may get help from other people, we also retrieve their contributors. We also provide a visualization that helps to further explore the repository via committers and categories. We present a prototype implementation that describes our research using the Apache HTTP Web server project as a case study.
Enhancing web search by promoting multiple search engine use
Authors: Ryen W. White, Matthew Richardson, Mikhail Bilenko, Allison P. Heath
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Any given Web search engine may provide higher quality results than others for certain queries. Therefore, it is in users' best interest to utilize multiple search engines. In this paper, we propose and evaluate a framework that maximizes users' search effective-ness by directing them to the engine that yields the best results for the current query. In contrast to prior work on meta-search, we do not advocate for replacement of multiple engines with an aggregate one, but rather facilitate simultaneous use of individual engines. We describe a machine learning approach to supporting switching between search engines and demonstrate its viability at tolerable interruption levels. Our findings have implications for fluid competition between search engines.
Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups
Authors: Jung-Sik Cho, Sang-Soo Yeo, Suchul Hwang, Sang-Yong Rhee, Sung Kwon Kim
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The RFID system is a contactless automatic identification system that identifies tags attached on goods through radio frequency communication. This system is expected to supplant barcode systems, the contact reading technique that is most widely used at present. The RFID system can be applied in a variety of areas. Among those, Ari Juels proposed an environment to prove that a pair of tags has been scanned simultaneously. And he presented a "yoking proof" protocol for this. But the yoking-proof protocol is vulnerable to replay attack. Although modified yoking-proof protocols for alleviating this drawback have been proposed, they are not immune to replay attack, either. In this paper, we analyze problems of existing yoking-proof protocols and present a new protocol, which will make replay attack difficult, based on this analysis. We have also extend this protocol so that it can provide yoking proofs for a tag group, including a multiple number of tags.
Single-electron tunnelling via quantum dot cavities built on a silicon suspension nanobridge
Authors: Jun Ogi, Yoshishige Tsuchiya, Shunri Oda, Hiroshi Mizuta
Venue: Microelectronic Engineering (2008)

This paper presents fabrication and characterization of novel nanoscale Si transistors with a suspended quantum dot cavity formed on a nanobridge channel. A 300-nm-long and 50-nm-wide nanobridge channel and quantum dot cavities were successfully fabricated on silicon-on-insulator (SOI) substrates and nanocrystalline silicon films by using the electron beam lithography combined with isotropic and anisotropic etching. We observed clear Coulomb oscillation for the fabricated nanobridge transistors at higher temperatures compared with transistors with a non-suspended channel.
CrossSketch: freeform surface modeling with details
Authors: Alexis Andre, Suguru Saito, Masayuki Nakajima
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

This paper presents a novel technique to model a three dimensional freeform surface, in its global shape and small details, using a sketching interface, from a single point of view. In the past, most modeling systems that used sketches as input reconstructed the shape from the silhouette, and the user had few control on the inner parts of the result. In our system, we generate a grid of co-planar lines from a small number of strokes that the user drew, then we estimate the normal vector where it is constrained, and we form the surface by propagating this information to the whole grid. As a result, smaller strokes act locally to add detail, while longer strokes modify the whole surface. Our system gives a new approach to the modeling from sketches problem, and is intended to be a part of a more complex modeling system.
Certificates of Resource Usage on Mobile Telephones
Authors: Thomas Jensen
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Resources on Java-enabled mobile telephones are controlled by permissions that grant an applet a certain number of accesses to are source. Such permissions can be given by the operator or can be obtained dynamically during execution by querying the user interactively. In this talk, we describe a formal model of such interactive access control with an emphasis on how to handle permissions with multiplicities. Based on this model, we present a proof system in which it is possible to engineer a formal proof that an applet will not consume resources for which it does not have permissions. Such proofs will then serve as a basis for constructing compact certificates attesting the correct behaviour of a down-loaded applet. 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