ppxscal/embedding_network huggingface dataset:
Using scatterplots to understand and improve probabilistic models for text categorization and retrieval
Authors: Giorgio Maria Di Nunzio
Venue: International Journal of Approximate Reasoning (2009)

The two-dimensional representation of documents which allows documents to be represented in a two-dimensional Cartesian plane has proved to be a valid visualization tool for Automated Text Categorization (ATC) for understanding the relationships between categories of textual documents, and to help users to visually audit the classifier and identify suspicious training data. This paper analyzes a specific use of this visualization approach in the case of the Naive Bayes (NB) model for text classification and the Binary Independence Model (BIM) for text retrieval. For text categorization, a reformulation of the equation for the decision of classification has to be written in such a way that each coordinate of a document is the sum of two addends: a variable component P(d|c"i), and a constant component P(c"i), the prior of the category. When plotted in the Cartesian plane according to this formulation, the documents that are constantly shifted along the x-axis and the y-axis can be seen. This effect of shifting is more or less evident according to which NB model, Bernoulli or multinomial, is chosen. For text retrieval, the same reformulation can be applied in the case of the BIM model. The visualization helps to understand the decisions that are taken to order the documents, in particular in the case of relevance feedback.
Information fusion and sparsity promotion using choquet integrals
Authors: Paul Gader
Venue:  (2007)

This dissertation addresses problems encountered in combining information from multiple sources. Novel methods for learning parameters for information aggregation are proposed. In practical applications of pattern classification, multiple algorithms are often developed for the same classification problem. Each algorithm produces confidence values by which each new sample may be classified. We would like to aggregate these confidence values to produce the best possible confidence for the given sample. This can be seen as a particular instance of what is called information fusion. In addition to learning parameters of aggregation operators to assign the best confidence for a given sample, we would also like the aggregation operators to use a subset of the algorithm confidences and achieve the same level of performance as the entire set of confidences. Using a subset of the algorithms implies lower cost for applications. Choquet integrals are nonlinear operators based on fuzzy measures that can represent a wide variety of aggregation operators. Previous research has demonstrated the utility of Choquet integrals for this problem compared to other methods such as neural networks and Bayesian approaches. However, one of the novel results of this research is that the measures learned can be very sensitive to the choice of desired outputs. In response to this problem, we propose an alternative training methodology based on Minimum Classification Error (MCE) training that does not require the use of desired outputs. A problem with this method is that it depends on a constrained type of fuzzy measure, the Sugeno measure. There is a need for additional approaches to learning unconstrained fuzzy measures that are more computationally attractive and provide more robust performance. We propose an approach to learning unconstrained fuzzy measures that relies on Markov Chain/Monte Carlo sampling methods. The use of such approaches for learning measures for Choquet integral fusion is completely novel. In addition, we propose the inclusion of the Bayesian approach of imposing sparsity promoting prior distributions on the measure parameters during sampling as a way of selecting subsets of the algorithms for inclusion in the aggregation. This approach is completely new for learning fuzzy measures.
An Agent-Based Simulation Model for Analysis on Marketing Strategy Considering Promotion Activities
Authors: Hideki Katagiri, Ichiro Nishizaki, Tomohiro Hayashida, Takahiro Daimaru
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

This paper proposes a new agent-based model for simulation analysis on firms' marketing strategy in competitive markets environments. In the previous model proposed by Tay and Lasch, firm agents determine their marketing strategies such as price and product attribute at every period so as to maximize their profit. This paper shows that the firm agents constructed based on the Tay-Lasch model do not learn the preferences of consumer agents under a very simple situation. This article proposes a novel agent-based model based on a learning classifier system so that the firm agents have abilities to learn the preferences of consumer agents. Moreover, in order to construct a more realistic simulation model, promotion activity of firm agents is incorporated in the strategy of firm agents. Some relationship between the strategy the firm and profitable firm are clarified through simulation analysis.
Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions
Authors: Seiko Arita, Koji Tsurudome
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

In this paper, we propose a notion of threshold tag-based encryption schemes that simplifies the notion of threshold identity-based encryption schemes, and we show a conversion from any stag-CCA-secure threshold tag-based encryption schemes to CCA-secure threshold public-key encryption schemes. Moreover, we give two concrete constructions of stag-CCA-secure threshold tag-based encryption schemes, under the decisional bilinear Diffie-Hellman assumption and the decisional linear assumption, respectively. Thus, we obtain two concrete constructions of threshold public-key encryption schemes, both of which are non-interactive, robust and can be proved secure without random oracle model. Our threshold public-key encryption schemes are conceptually more simple and shown to be more efficient than those of Boneh, Boyen and Halevi.
Application of Self Organizing Maps to multi-resolution and multi-spectral remote sensed images
Authors: Ferdinando Giacco, Silvia Scarpetta, Luca Pugliese, Maria Marinaro, Christian Thiel
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

In this paper we investigate the performance of the Kohonen's self organizing map (SOM) as a strategy for the analysis of multi-spectral and multi-resolution remote sensed images. The paper faces the problem of data fusion, by extracting and combining multi-spectral and textural features. Moreover we address the problem of low-quantity and low-quality of labelled pixels in the training set, investigating a two-step strategy: in the first step (unsupervised training) we use a large unlabelled data set to train a SOM, in the second step a limited number of labelled data is used to assign each SOM node to one informative class. Self Organized Maps are shown to be effective way to discover the intrinsic structure of data. When the SOM is used as a classifier, as here, a majority voting technique is usually used to associate nodes with informative classes. This procedure allows to obtain a SOM output grid which contains labelled and unlabelled nodes. Particularly in the framework of remote sensing, the unlabelled nodes may be important, since they are associated with new classes present in the image, or with the so-called mixed pixels, which represent an area on the ground composed of more then one land-cover class. Comparing the results of the proposed SOM-based strategy and the results of a supervised network such as SVM we show that the unlabelled nodes of the SOM are associated with high percentage to mixed pixels.
Developing Mobile Applications Using SAP Netweaver Mobile
Authors: Thomas Pohl, Ramprasadh Kothandaraman, Venkat Srinivas Seshasai
Venue:  (2007)

This unique, comprehensive book teaches developers and IT managers everything that's needed to begin developing mobile applications based on SAP NetWeaver Mobile. What are the biggest mobile application challenges? How does data replication really work? How can one design a user interface that runs on different client platforms? What does the architecture of a complete application look like? These are some of the basic questions, amongst many others, that this book deals with in detail. After learning about the architecture and design principles you'll go on to uncover expert insights on data orchestration, Mobile Applications for Laptop and the Mobile Web Dynpro Online design time environments. Two extensive case studies, as well as an extra chapter on mobile application lifecycle management, plus invaluable best practices for implementing mobile applications, serve to complete this full-length reference guide. Highlights:Mobile Technology - Devices, IDEs and Runtime Environments, Connectivity Data Orchestration - Meta Model, Data Objects, Backend Integration, Modeling Data Objects and Backend Adapters, Modeling Data Distribution Design Time Environments and Case Studies - Mobile Applications for Laptop, Mobile Web Dynpro Online Mobile Application Lifecycle Management - Development Process, Setup, Mass device Administration, Patch Deployment, and more Support of Peripheral Devices - PIOS and PIOS API Core
Media Space 20+ Years of Mediated Life, 1st edition
Authors: Steve Harrison
Venue:  (2009)

Media Space: 20+ Years of Mediated Life is loosely divided into three different, but interconnected, approaches to media space research. Each part opens with an introduction that lays out how readers can best approach the book, and provides a basic guide to the theory and research literature, technological developments and other notable events to help contextualize the book. The social approach uses the rhetoric and methods familiar to a CSCW audience, but moves into actual situations that involve close working bonds, broken trust, shared joy, community building, interpersonal tension, anxiety etc. The section on spatial approaches guides the reader through an intellectual landscape of spatiality, the communications part is a field guide to sense-making in the as-lived mediated condition, demonstrating that media space sense-making combines an understanding of in-the-moment alongside sense made of existence in the world and reflecting upon it.
A graph coloring based service discovery in ad hoc networks
Authors: Mohammed Haddad, Hamamache Kheddouci
Venue: Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing (2009)

Various researches treating of the communication protocols try to define a certain organization over the network to improve its general behavior. The concept of service is frequently used as an abstraction of software and hardware resources. Service discovery offers service advertisement and location mechanisms. So, it represents a real challenge in highly dynamic networks. In this paper, we present a new service discovery protocol for ad hoc network. This protocol is based on strict strong graph coloring concept. Also, we propose the introduction of various mechanisms allowing the improvement of service discovery. In addition, we give some preliminary experiments results.
Discursive usage of six Chinese punctuation marks
Authors: Yue Ming
Venue: Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop (2006)

Both rhetorical structure and punctuation have been helpful in discourse processing. Based on a corpus annotation project, this paper reports the discursive usage of 6 Chinese punctuation marks in news commentary texts: Colon, Dash, Ellipsis, Exclamation Mark, Question Mark, and Semicolon. The rhetorical patterns of these marks are compared against patterns around cue phrases in general. Results show that these Chinese punctuation marks, though fewer in number than cue phrases, are easy to identify, have strong correlation with certain relations, and can be used as distinctive indicators of nuclearity in Chinese texts.
Finding representative landmarks of data on manifolds
Authors: Jun Li, Pengwei Hao
Venue: Pattern Recognition (2009)

Data-driven non-parametric models, such as manifold learning algorithms, are promising data analysis tools. However, to fit an off-training-set data point in a learned model, one must first ''locate'' the point in the training set. This query has a time cost proportional to the problem size, which limits the model's scalability. In this paper, we address the problem of selecting a subset of data points as the landmarks helping locate the novel points on the data manifolds. We propose a new category of landmarks defined with the following property: the way the landmarks represent the data in the ambient Euclidean space should resemble the way they represent the data on the manifold. Given the data points and the subset of landmarks, we provide procedures to test whether the proposed property presents for the choice of landmarks. If the data points are organized with a neighbourhood graph, as it is often conducted in practice, we interpret the proposed property in terms of the graph topology. We also discuss the extent to which the topology is preserved for landmark set passing our test procedure. Another contribution of this work is to develop an optimization based scheme to adjust an existing landmark set, which can improve the reliability for representing the manifold data. Experiments on the synthetic data and the natural data have been done. The results support the proposed properties and algorithms.
Sybilproof transitive trust protocols
Authors: Paul Resnick, Rahul Sami
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between the two parties. In such situations, it is possible to enable the interaction indirectly through a chain of credit or "trust" links. We introduce a model that provides insight into many disparate applications, including open currency systems, network trust aggregation systems, and manipulation-resistant recommender systems. Each party maintains a trust account for each other party. When a principal's trust balance for an agent is high enough to cover potential losses from a bad interaction, direct trust is sufficient to enable the interaction. Allowing indirect trust opens up more interaction opportunities, but also expands the strategy space of an attacker seeking to exploit the community for its own ends. We show that with indirect trust exchange protocols, some friction is unavoidable: any protocol that satisfies a natural strategic safety property that we call sum-sybilproofness can sometimes lead to a reduction in expected overall trust balances even on interactions that are profitable in expectation. Thus, for long-term growth of trust accounts, which are assets enabling risky but valuable interactions, it may be necessary to limit the use of indirect trust. We present the hedged-transitive protocol and show that it achieves the optimal rate of expected growth in trust accounts, among all protocols satisfying the sum-sybilproofness condition.
Different models for model matching: An analysis of approaches to support model differencing
Authors: Dimitrios S. Kolovos, Davide Di Ruscio, Alfonso Pierantonio, Richard F. Paige
Venue: Proceedings of the 2009 ICSE Workshop on Comparison and Versioning of Software Models (2009)

Calculating differences between models is an important and challenging task in Model Driven Engineering. Model differencing involves a number of steps starting with identifying matching model elements, calculating and representing their differences, and finally visualizing them in an appropriate way. In this paper, we provide an overview of the fundamental steps involved in the model differencing process and summarize the advantages and shortcomings of existing approaches for identifying matching model elements. To assist potential users in selecting one of the existing methods for the problem at stake, we investigate the trade-offs these methods impose in terms of accuracy and effort required to implement each one of them.
A Critical Assessment of ISO 13584 Adoption by B2B Data Exchange Specifications
Authors: Joerg Leukel, Volker Schmitz, Martin Hepp
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Recently, the ISO 13584 standard for parts libraries (PLIB) has been widely discussed as a reference model for developing product ontologies, such as product classification systems and standardized property lists. For instance, major industry consortia have announced their intention to incorporate this standard into their product dictionaries and related data exchange specifications. Implementing these PLIB-compliant dictionaries is often regarded as an important step for overcoming heterogeneity in product descriptions and enabling automated cross-industry communication centered on product information. While many industries are aware of PLIB's potential contribution to semantic interoperability (and some have already started providing PLIB-compliant content), the actual degree of support by B2B data exchange specifications may be a limiting factor to wider diffusion. In this paper, we (1) analyze the current degree of ISO 13584 adoption in such specifications, (2) determine how this adoption has changed over time, and (3) identify existing gaps between ISO 13584 and XML-based specifications.
High speed and computationally efficient architecture for recursive interpolation filters
Authors: Umar Farooq, Habibullah Jamal, Shoab Ahmed Khan
Venue: Signal Processing (2009)

The paper presents high speed and computationally efficient architecture for the recursive interpolation filters for digital audio applications. Conversion of anti-imaging IIR filter that is an essential part of an interpolator, into an efficient interpolation filter is based on merged delay transformation. Any higher order filter is required to be implemented in parallel using first order and second order sections. This requirement provides the benefits of high speed processing. The optimal architectures for the first and second order sections are introduced. The computational cost is reduced up to 33.65% as compared to cascaded IIR-based interpolators and cost reduction of 89.48% is achieved as compared to polyphase FIR-based interpolators. A 1-to-4 interpolation filter is implemented on FPGA using Verilog HDL at input sampling frequency of 44.1kHz and its power and critical path delay is compared with known architectures. Smaller critical path delay and lower computational cost are the important characteristics of this architecture which is highly desired in portable digital audio applications.
Skilled in the art of being idle: reducing energy waste in networked systems
Authors: Sergiu Nedevschi, Jaideep Chandrashekar, Junda Liu, Bruce Nordman, Sylvia Ratnasamy, Nina Taft
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Networked end-systems such as desktops and set-top boxes are often left powered-on, but idle, leading to wasted energy consumption. An alternative would be for these idle systems to enter low-power sleep modes. Unfortunately, today, a sleeping system sees degraded functionality: first, a sleeping device loses its network "presence" which is problematic to users and applications that expect to maintain access to a remote machine and, second, sleeping can prevent running tasks scheduled during times of low utilization (e.g., network backups). Various solutions to these problems have been proposed over the years including wake-on-lan (WoL) mechanisms that wake hosts when specific packets arrive, and the use of a proxy that handles idle-time traffic on behalf of a sleeping host. As of yet, however, an in-depth evaluation of the potential for energy savings, and the effectiveness of proposed solutions has not been carried out. To remedy this, in this paper, we collect data directly from 250 enterprise users on their end-host machines capturing network traffic patterns and user presence indicators. With this data, we answer several questions: what is the potential value of proxying or using magic packets? which protocols and applications require proxying? how comprehensive does proxying need to be for energy benefits to be compelling? and so on. We find that, although there is indeed much potential for energy savings, trivial approaches are not effective. We also find that achieving substantial savings requires a careful consideration of the tradeoffs between the proxy complexity and the idle-time functionality available to users, and that these tradeoffs vary with user environment. Based on our findings, we propose and evaluate a proxy architecture that exposes a minimal set of APIs to support different forms of idle-time behavior.
Simple mobile phone-based games to adjust the player's behaviour and social norms
Authors: Hanno Hildmann, Anika Uhlemann, Daniel Livingstone
Venue: International Journal of Mobile Learning and Organisation (2009)

This paper gives an overview of games-based learning and theories from the field of psychology. Two types of games are suggested as the basis for serious games to teach positive behaviour and social norms: a resource management game and a virtual pet. The games are outlined and evaluated by comparison with the key aspects of games-based learning in the literature. To asses the feasibility of the suggested games, their respective prototype implementations are benchmarked and tested and the results are reported.
Quantitative Analysis of Web Services Using SRMC
Authors: Allan Clark, Stephen Gilmore, Mirco Tribastone
Venue: Formal Methods for Web Services: 9th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2009, Bertinoro, Italy, June 1-6, 2009, Advanced Lectures (2009)

In this tutorial paper we present quantitative methods for analysing Web Services with the goal of understanding how they will perform under increased demand, or when asked to serve a larger pool of service subscribers. We use a process calculus called SRMC to model the service. We apply efficient analysis techniques to numerically evaluate our model. The process calculus and the numerical analysis are supported by a set of software tools which relieve the modeller of the burden of generating and evaluating a large family of related models. The methods are illustrated on a classical example of Web Service usage in a business-to-business scenario.
A semi-parametric test based on a quasi-likelihood approach for comparing the estimated spectra of two neural spike trains
Authors: V. G. Vassiliadis, A. G. Rigas
Venue: Neurocomputing (2009)

In this work, we provide a semi-parametric approach for testing the hypothesis that the spectra of two neural spike trains are equal. Estimates of the spectra are obtained by taking the Fourier transforms of the cumulant functions using convergence factors for smoothing. A quasi-likelihood ratio test for comparing different hypotheses is applied since the estimates are asymptotically Normal with constant variances. An illustrative example is presented where the information transferred to the spinal cord from the muscle spindle, under the influence of two stimuli can be separated into two parts 0-19 and 19-120Hz. The dependence on the frequency in both parts is of a quadratic form.