ppxscal/embedding_network huggingface dataset:
A Framework for Analyzing the Economics of a Market for Grid Services
Authors: Robin Mason, Costas Courcoubetis, Natalia Miliou
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

This paper provides a single broad model for the analysis of a range of issues underlying a market for Grid services. The demand and the supply sides of such a market are being treated separately and the relation between the two sides is being studied. We provide numerical results in order to derive conclusions about the viability of a market for Grid services. Underlying our model are parameters such as the cost technologies, the random processes driving demand and supply and the size of the market. We study the effect of the model's parameters, such as risk aversion or the durability of resources, on the system's behavior, eg. on the clearing price or volume of trade.
Financial Securitization with Digital Rights Management System
Authors: Hirotsugu Kinoshita, Tetsuya Morizumi, Kazuhiro Suzuki
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Because of complexities of the structured finance, the securitization of the assets, distribution of the securities and the protection of the private information among transactions of secirities on IT enable networks became serious problems. In this paper, we show that the information capsule for the copyright management could be used to the securitization and its concurrency. We propose the method of the securitization with the information capsule which includes mobile agents. By applying this method to the system that a investor could check the uncertainness of the own securities. For example which obligation is contained or how to estimate the value of the securities.
Longest Cycles in 3-connected Graphs with Given Independence Number
Authors: Y. Manoussakis
Venue: Graphs and Combinatorics (2009)

Fouquet and Jolivet conjectured that a k-connected graph of order n and independence number &#x03b1;&#x00a0;&#x2265;&#x00a0;k has a cycle of length at least $$\frac {k(n+\alpha -k)}{\alpha}$$[Fouquet and Jolivet, Probl&#x00e8;mes combinatoires et th&#x00e9;orie des graphes Orsay (1976), Problems, page 438]. Here we prove this conjecture for k=3.
Assessment using peer evaluations, random pair assignment, and collaborative programing in CS1
Authors: Timothy Urness
Venue: Journal of Computing Sciences in Colleges (2009)

In this paper we describe a technique for student assessment that uses peer evaluation and random pair assignment in collaborative programming assignments in CS1. A common concern of professors implementing collaborative (pair) programming is the potential for a student to not actively participate in the programming process. In this case, a student's skills and abilities may not be developed or evaluated. In addition to traditional grading of an assignment, a survey was given to each student following every assignment in order to assess the individual contribution and comprehension of the assignment requirements. The survey asked each student to briefly evaluate his or her teammate's cooperation as well as to project the teammate's ability to re-write the code. The results of this assessment method indicate that the assignment quality greatly increased and exam scores were comparable compared to previous course offerings when assignments were completed individually.
Testing Finitary Probabilistic Processes
Authors: Yuxin Deng, Rob Glabbeek, Matthew Hennessy, Carroll Morgan
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We provide both modal- and relational characterisations of may- and must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological properties, and express divergence in terms of partial distributions.
Towards Cooperative Predictive Data Mining in Competitive Environments
Authors: Viliam Lisý, Michal Jakob, Petr Benda, Štěpán Urban, Michal Pěchouček
Venue: Agents and Data Mining Interaction: 4th International Workshop, ADMI 2009, Budapest, Hungary, May 10-15,2009, Revised Selected Papers (2009)

We study the problem of predictive data mining in a competitive multi-agent setting, in which each agent is assumed to have some partial knowledge required for correctly classifying a set of unlabelled examples. The agents are self-interested and therefore need to reason about the trade-offs between increasing their classification accuracy by collaborating with other agents and disclosing their private classification knowledge to other agents through such collaboration. We analyze the problem and propose a set of components which can enable cooperation in this otherwise competitive task. These components include measures for quantifying private knowledge disclosure, data-mining models suitable for multi-agent predictive data mining, and a set of strategies by which agents can improve their classification accuracy through collaboration. The overall framework and its individual components are validated on a synthetic experimental domain.
A Method to Monitor Operator Overloading
Authors: Dvijesh Shastri, Ioannis Pavlidis, Avinash Wesley
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This paper describes research that aims to quantify stress levels of operators who perform multiple tasks. The proposed method is based on the thermal signature of the face. It measures physiological function from a stand-off distance and therefore, it can unobtrusively monitor a machine operator. The method was tested on 11 participants. The results show that multi-tasking elevates metabolism in the supraorbital area, which is an indirect indication of increased mental load. This local metabolic change alters heat dissipation and thus, it can be measured through thermal imaging. The methodology could serve as a benchmarking tool in scenarios where an operator's divided attention may cause harmful outcomes. A classic example is the case of a vehicle driver who talks on the cell phone. This stress measurement method when combined with user performance metrics can delineate optimal operational envelopes.
Unexploited Resources in Interaction Design for Universal Access: People with Impairments as a Resource for Interaction Designers
Authors: Hans Persson, Kjell Ohlsson, Sigrid Petersén, Anette Jonsäll
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

A challenge to HCI-designers is to create simple, usable, and useful applications. The current paper addresses this problem and presents an innovative possibility to extract useful information from users rarely represented in contemporary participatory design approaches. The study was conducted from a Universal Access point of view.The primary result of the study is that people with well defined intellectual (e.g. understanding and logical reasoning) difficulties provided the designers of web-pages with more valuable and elaborated answers to bottlenecks in the interaction than a more representative group of web-users.With this result in mind Universal Access should not be an unreachable goal. This implies that people with intellectual difficulties can be regarded as an unexploited resource in HCI when using a participatory approach.
McSOM: Minimal Coloring of Self-Organizing Map
Authors: Haytham Elghazel, Khalid Benabdeslem, Hamamache Kheddouci
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

A Self-Organizing Map (SOM) is an artificial neural network tool that is trained using unsupervised learning to produce a low-dimensional representation of the input space, called a map. This map is generally the subject of a clustering analysis step which aims to partition the referents vectors (map neurons) in compact and well-separated groups. In this paper, we consider the problem of clustering self-organizing map using a modified graph minimal coloring algorithm. Unlike the traditional clustering SOM techniques, using k-means or hierarchical classification, our approach has the advantage to provide a partition of self-organizing map by simultaneously using dissimilarities and neighborhood relations provided by SOM. Experimental results on benchmark data sets demonstrate that the proposed clustering algorithm is able to cluster data in a better way than classical ones and indicates the effectiveness of SOM to offer real benefits for the original minimal coloring clustering approach.
Computational Systems Biology, 1st edition
Authors: Jason McDermott, Ram Samudrala, Roger Bumgarner, Kristina Montgomery, Rene Ireton
Venue:  (2009)

The recent confluence of high throughput methodology for biological data gathering, genome-scale sequencing, and computational processing power has driven a reinvention and expansion of the way we identify, infer, model, and store relationships between molecules, pathways, and cells in living organisms. In Computational Systems Biology, expert investigators contribute chapters which bring together biological data and computational and/or mathematical models of the data to aid researchers striving to create a system that provides both predictive and mechanistic information for a model organism. The volume is organized into five major sections involving network components, network inference, network dynamics, function and evolutionary system biology, and computational infrastructure for systems biology. As a volume of the highly successful Methods in Molecular Biology series, this work provides the kind of detailed description and implementation advice that is crucial for getting optimal results. Comprehensive and up-to-date, Computational Systems Biology serves to motivate and inspire all those who wish to develop a complete description of a biological system.
MiniDiver: A Novel Mobile Media Playback Interface for Rich Video Content on an iPhoneTM
Authors: Gregor Miller, Sidney Fels, Matthias Finke, Will Motz, Walker Eagleston, Chris Eagleston
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

We describe our new mobile media content browser called a MiniDiver. MiniDiving considers media browsing as a personal experience that is viewed, personalized, saved, shared and annotated. When placed on a mobile platform, such as the iPhoneTM, consideration of the particular interface elements lead to new ways to experience media content. The MiniDiver interface elements currently supports multi-camera selection, video hyperlinks, history mechanisms and semantic and episodic video search. We compare performance of the MiniDiver on different media streams to illustrate its feasibility.
Access Control in Location-Based Services
Authors: Claudio A. Ardagna, Marco Cremonini, Sabrina Capitani Di Vimercati, Pierangela Samarati
Venue: Privacy in Location-Based Applications: Research Issues and Emerging Trends (2009)

Recent enhancements in location technologies reliability and precision are fostering the development of a new wave of applications that make use of the location information of users. Such applications introduces new aspects of access control which should be addressed. On the one side, precise location information may play an important role and can be used to develop Location-based Access Control (LBAC) systems that integrate traditional access control mechanisms with conditions based on the physical position of users. On the other side, location information of users can be considered sensitive and access control solutions should be developed to protect it against unauthorized accesses and disclosures. In this chapter, we address these two aspects related to the use and protection of location information, discussing existing solutions, open issues, and some research directions.
An investigation into the population abundance distribution of mRNAs, proteins, and metabolites in biological systems
Authors: Chuan Lu, Ross D. King
Venue: Bioinformatics (2009)

Motivation: Distribution analysis is one of the most basic forms of statistical analysis. Thanks to improved analytical methods, accurate and extensive quantitative measurements can now be made of the mRNA, protein and metabolite from biological systems. Here, we report a large-scale analysis of the population abundance distributions of the transcriptomes, proteomes and metabolomes from varied biological systems. Results: We compared the observed empirical distributions with a number of distributions: power law, lognormal, loglogistic, loggamma, right Pareto-lognormal (PLN) and double PLN (dPLN). The best-fit for mRNA, protein and metabolite population abundance distributions was found to be the dPLN. This distribution behaves like a lognormal distribution around the centre, and like a power law distribution in the tails. To better understand the cause of this observed distribution, we explored a simple stochastic model based on geometric Brownian motion. The distribution indicates that multiplicative effects are causally dominant in biological systems. We speculate that these effects arise from chemical reactions: the central-limit theorem then explains the central lognormal, and a number of possible mechanisms could explain the long tails: positive feedback, network topology, etc. Many of the components in the central lognormal parts of the empirical distributions are unidentified and/or have unknown function. This indicates that much more biology awaits discovery. Contact: rdk@aber.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
Reasoning with Uncertain and Conflicting Opinions in Open Reputation Systems
Authors: Andreas Gutscher
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Reputation systems support users to distinguish between trustworthy and malicious or unreliable services. They collect and evaluate available user opinions about services and about other users in order to determine an estimation for the trustworthiness of a specified service. The usefulness of a reputation system highly depends on its underlying trust model, i.e., the representation of trust values and the methods to calculate with these trust vales. Several proposed trust models that allow representing degrees of trust, ignorance and distrust show undesired properties when conflicting opinions are combined. The proposed consensus operators usually eliminate the incurred degree of conflict and perform a re-normalization. We argue that this elimination causes counterintuitive effects and should thus be avoided. Therefore, we propose a new representation of trust values that reflects also the degree of conflict, and we develop a calculus and operators to compute reputation values. Our approach requires no re-normalizations and thus avoids the thereby caused undesired effects.
A Real-World Pointing Device Based on an Optical Communication System
Authors: Yuichi Mitsudo
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

In the present paper, a new augmented reality environment that is based on an optical communication system is described. Optical communication devices have been used in several studies on ubiquitous computing. A novel physical structure of an optical communication system that enables the user to select the optical signal by simply pointing its transmitter with his/her finger is developed. In such an environment, the optical transmitter can be treated as a visual tag, referred to as a GhostTag, that includes continuous data, such as audio files. In addition, the PointSpeech application, which provides the user with audio assistant data via GhostTag, is presented herein. 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
Policy Gradient Learning of Cooperative Interaction with a Robot Using User's Biological Signals
Authors: Tomoya Tamei, Tomohiro Shibata
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

The potential market of robots that can helpfully work at home is increasing, and such robots are required to possess force and tactile sensors achieving dynamic and cooperative interactions with their users. Virtual realization of force/tactile sensors in robots, using user's biological signals such as EMG and postural information, is a versatile solution allowing high spatial resolution and degrees of freedom. In this paper, however, we first show the virtual force sensing approach does not work for a three-dimensional cooperative task in which the user is requested to move a load by an upper-limb of the user cooperatively with the robot, and discuss about inevitable problems. We then propose to apply policy gradient learning to overcome the problems, and demonstrate preliminary but promising learning results.
The Group of Signed Quadratic Residues and Applications
Authors: Dennis Hofheinz, Eike Kiltz
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We consider the cryptographic group of Signed Quadratic Residues. This group is particularly useful for cryptography since it is a "gap-group," in which the computational problem (i.e., computing square roots) is as hard as factoring, while the corresponding decisional problem (i.e., recognizing signed quadratic residues) is easy. We are able to show that under the factoring assumption, the Strong Diffie-Hellman assumption over the signed quadratic residues holds. That is, in this group the Diffie-Hellman problem is hard, even in the presence of a Decisional Diffie-Hellman oracle.We demonstrate the usefulness of our results by applying them to the Hybrid ElGamal encryption scheme (aka Diffie-Hellman integrated encryption scheme - DHIES). Concretely, we consider the security of the scheme when instantiated over the group of signed quadratic residues. It is known that, in the random oracle model, the scheme is chosenciphertext (CCA) secure under the Strong Diffie-Hellman assumption and hence, by our results, under the standard factoring assumption. We show that furthermore, in the standard model, Hybrid ElGamal is CCA secure under the higher residuosity assumption, given that the used hash function is four-wise independent. The latter result is obtained using the recent "randomness extraction framework" for hash proof systems.
Study on Behavior Trust Forecast and Control Based Electronic Commerce System
Authors: Jie Zhao, Zhang Sha-qing, Zhong Jun-rui
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Trust is crucial for ELECTRONIC COMMERCE (EC). Trust in open network setting includes identity trust and behavior trust and the latter provides a new method for network safety problems. This paper designs Bayesian network based behavior trust forecast method and the control strategy. The Ajax application framework is proposed and the distributed multi-layer architecture of EC system is built, through which behavior trust forecast and control is implemented. The practical data have shown that in user behavior trust based EC system multiple performances of the server are enhanced and the trade behaviors of users are restricted.
Evolving predictive visual motion detectors
Authors: Jonas Ruesch, Alexandre Bernardino
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

The geometrical organization of a visual sensor is of major importance for the later processing of sensed stimuli. We present an approach to evolve artificial visual detectors which adapt their size and orientation according to the experienced sensory stimulation. The criterion for the introduced optimization method is given by a Reichardt correlation measure on the input signal. Under the described conditions, the visual receptors organize their spatial arrangement following the average luminance flow recorded by the sensor over time.
A general framework for generating multivariate explanations in Bayesian networks
Authors: Changhe Yuan, Tsai-Ching Lu
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target variables. A priori, the set of target variables is often large, but only a few of them may be most relevant in explaining given evidence. Generating explanations with all the target variables is hence not always desirable. This paper addresses the problem by proposing a new framework called Most Relevant Explanation (MRE), which aims to automatically identify the most relevant target variables. We will also discuss in detail a specific instance of the framework that uses generalized Bayes factor as the relevance measure. Finally we will propose an approximate algorithm based on Reversible Jump MCMC and simulated annealing to solve MRE. Empirical results show that the new approach typically finds much more concise explanations than existing methods.
Animating the Brush-writing Process of Chinese Calligraphy Characters
Authors: Lijie Yang, Xiaoshan Li
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In this paper, a novel approach is proposed to animate the brush-writing process of Chinese calligraphy characters of regular style. It mainly includes three steps: stroke extraction, trajectory extraction and brush-writing animation of strokes. The key idea is, for a given character, to determine the quantitative values of animating parameters for the brush-writing control points on its trajectory, based on the character shape and the qualitative expert knowledge of calligraphy. "Yan Kai"' is used as a case study, which is one of the most famous four classic regular styles, from "Qin Li Tablet". Therefore, this work can help people to learn and appreciate Chinese calligraphy through computers.
UVA: language modeling techniques for web people search
Authors: Krisztian Balog, Leif Azzopardi, Maarten de Rijke
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper we describe our participation in the SemEval 2007 Web People Search task. Our main aim in participating was to adapt language modeling tools for the task, and to experiment with various document representations. Our main finding is that single pass clustering, using title, snippet and body to represent documents, is the most effective setting.