ppxscal/embedding_network huggingface dataset:
Online Auctions: There Can Be Only One
Authors: Charu C. Aggarwal, Philip S. Yu
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

In recent years, the proliferation of the world wide web has lead toan increase in the number of public auctions on the internet. One ofthe characteristics of online auctions is that a successfulimplementation requires a high volume of buyers and sellersat itswebsite. Consequently, auction sites which have a high volume oftraffic have an advantage over those in which the volume is limited.This results in even greater polarization of buyers and sellerstowardsa particular site.This is often referred to as the``network effect'' in a variety of web and telecommunicationapplications involving interactions among a large number ofentities. Whilethis effect has qualitatively beenknown toincrease the value of the overall network, its effect has never beenmodeled or studied rigorously. In this paper, we construct a MarkovModel to analyze the network effect in the case of web auctions. Weshow that the network effect is very powerful for the case of webauctions and can result in a situation in which one auction canquickly overwhelm its competing sites. This results in a situationin which the natural stable equilibrium is that of a single onlineauction seller for a given product and geographical locality. Whilea single player structure is unlikely because of some approximationassumptions in the model, the trend seems to show the likelyexistence of single dominant player in the web auction space.
Rich bitext projection features for parse reranking
Authors: Alexander Fraser, Renjing Wang, Hinrich Schütze
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Many different types of features have been shown to improve accuracy in parse reranking. A class of features that thus far has not been considered is based on a projection of the syntactic structure of a translation of the text to be parsed. The intuition for using this type of bitext projection feature is that ambiguous structures in one language often correspond to unambiguous structures in another. We show that reranking based on bitext projection features increases parsing accuracy significantly.
Bayesian Solutions to the Label Switching Problem
Authors: Kai Puolamäki, Samuel Kaski
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC sampling difficult. We introduce a fully Bayesian treatment of the permutations which performs better than alternatives. The method can even be used to compute summaries of the posterior samples for nonparametric Bayesian methods, for which no good solutions exist so far. Although being approximative in that case, the results are very promising. The summaries are intuitively appealing: A summarized cluster is defined as a set of points for which the likelihood of being in the same cluster is maximized.
Grey-relation Based Approach to Uncertain Multiple Attribute Decision Making
Authors: Quan Zhang, YanFeng Tian, Yang Liu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

This paper proposes a new approach to the uncertain multiple attribute decision making problems based on the grey-relation theory, where the attribute values in decision matrix is expressed in the form of intervals and definite values. In the approach, the attributes are classified into two categories: the definite and the interval. Based on the grey relation theory, the attribute values are normalized firstly; Then, with respect to the interval attributes, by calculating the grey relation coefficients between the interval attribute values and the positive ideal one, the normalized interval attribute values are further transformed into single-point ones; In addition, the attribute weights are determined based on the definite decision matrix obtained; By calculating the overall values of the alternatives, they can be ranked descendingly. An example is used to illustrate the proposed approach in the end.
A New Class of Pseudo-random Functions
Authors: Huawei Huang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This paper proposes a new construction ofpseudo-random functions based on an extended decisional Diffie-Hellman (EDDH) problem proposed by Huang et al. The new construction is pseudo-random if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new pseudo-random function is a good replacement for Naor-Reingold pseudo-random function when bilinear group is adopted as construction platform.
Bargaining Agents in Wireless Contexts: An Alternating-Offers Protocol for Multi-issue Bilateral Negotiation in Mobile Marketplaces
Authors: Azzurra Ragone, Michele Ruta, Eugenio Sciascio, Francesco M. Donini
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

We present an approach to multi-issue bilateral negotiation for mobile commerce scenarios. The negotiation mechanism has been integrated in a semantic-based application layer enhancing both RFID and Bluetooth wireless standards. OWL DL has been used to model advertisements and relationships among issues within a shared common ontology. Finally, non standard inference services integrated with utility theory help in finding suitable agreements. We illustrate and motivate the provided theoretical framework in a wireless commerce case study.
Probabilistic characteristics of the nonlinear dynamic parabolic system with random coefficients
Authors: A. N. Katulev, A. N. Kudinov, M. F. Malevinskii
Venue: Automation and Remote Control (2009)

A method to calculate the probabilistic characteristics of a nonlinear stochastic dynamic system by approximation of the solution of nonlinear stochastic system of parabolic equations by a segment of a uniformly converging generalized Kotel'nikov series was presented. It is applicable to any probability distributions of the random coefficients of equations for which expectations exist and provides precise solutions while considering a smaller number of the interpolation nodes as compared with the existing methods.
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Authors: Florian Raudies, Heiko Neumann
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of the main problems for ego-motion estimation is the segregation of the translational and rotational component of ego-motion in order to utilize the translation component, e.g. for computing spatial navigation direction. Most of the existing methods solve this segregation task by means of formulating a nonlinear optimization problem. One exception is the subspace method, a well-known linear method, which applies a computationally high-cost singular value decomposition (SVD). In order to be computationally efficient a novel linear method for the segregation of translation and rotation is introduced. For robust estimation of ego-motion the new method is integrated into the Random Sample Consensus (RANSAC) algorithm. Different scenarios show perspectives of the new method compared to existing approaches.
The Asymmetric Learning Trait
Authors: John N. Warfield
Venue: Journal of Integrated Design Process Science (2008)

A paired human learning trait is described as "symmetric" if (1) It describes an aspect of human learning efficacy, (2) It has two opposite components and, (3) It is equally effective with respect to those opposites. If it is substantially different in effectiveness with respect to those opposites, it is described as "asymmetric". Hence the terms "symmetric" and "asymmetric" refer to learning efficacy with respect to the two components of the paired learning trait. Higher education has long been animated by an overriding goal of developing individuals with a talent for critical thinking; i.e., analysis. This goal undoubtedly was set without regard for the nature of the opposite component of the paired human learning trait; i.e., synthesis or design. The opposites of concern here are analysis and synthesis. The principal educational consequence of devoting virtually all resources to developing critical thinking is to fail to develop as a collateral outcome the other component of the asymmetric learning trait. What should be sought, in the interest of developing a balanced human persona is a symmetric learning trait, equally balanced between analysis and synthesis. Until that is achieved, the educational system will continue to develop future politicians and public intellectuals who operate under the illusion that they possess synthesis skills in equal proportion to their analysis skills, when no belief could be much further from the truth. The principal political consequences of failure to seek the symmetric learning trait are the promotion and foisting of dysfunctional systems upon a defenseless public.
Vertex fault tolerance of optimal-κ graphs and super-κ graphs
Authors: Yanmei Hong, Zhao Zhang
Venue: Information Processing Letters (2009)

A connected graph G is optimal-@k if @k(G)=@d(G). It is super-@k if every minimum vertex cut isolates a vertex. An optimal-@k graph G is m-optimal-@k if for any vertex set S@?V(G) with |S|=
Parallel belief revision
Authors: James Delgrande, Yi Jin
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all information in the original formula is lost. As noted by various researchers, this phenomenon is made explicit in the second postulate (C2) of the well-known Darwiche-Pearl framework, and so this postulate has been a point of criticism of this and related approaches. In contrast, we argue that the true culprit of this problem arises from a basic assumption of the AGM framework, that new information is represented by a single formula. We propose a more general framework for belief revision (called parallel belief revision) in which individual items of new information are represented by a set of formulas. In this framework, if one revises by a set of formulas, and then by the negation of some members of this set, then other members of the set are still believed after the revision. Hence the aforecited problem is discharged. We present first a basic approach to parallel belief revision, and next an approach that combines the basic approach with that of Jin and Thielscher. Postulates and semantic conditions characterizing these approaches are given, and representation results provided.
Adaptive Operator Selection for Iterated Local Search
Authors: Dirk Thierens
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

Iterated local search is a simple yet powerful metaheuristic. It is only drawback is that it is quite sensitive to its only parameter: the perturbation step size. Adaptive operator selection methods are on-line adaptive algorithms that adjust the probability of applying the search operators to the current solutions. In this short note, we show the use of the adaptive pursuit algorithm to automatically select the perturbation step size for ILS when optimizing a blind, single-constraint knapsack problem. The resulting adaptive ILS achieves almost the same performance as the ILS with the best perturbation step size but without the need to determine the optimal parameter setting.
Innovation through Customers' Eyes
Authors: Yanxia Yang, Mayuresh Ektare
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

The User Centered Design (UCD) process is well established and used extensively in the industry, except with varying results. Upon engaging the customers in the iterative design process why it is that in some cases the UCD process results in a less than stellar outcome needs to be discussed. A thorough analysis of one scenario reveals that the design innovation means different things to various stakeholders. This paper is a case study illustrating ways of enhancing the UCD process while providing insight into varying viewpoints on the product innovation.
Simulation-based two-phase genetic algorithm for the capacitated re-entrant line scheduling problem
Authors: Jin Young Choi, Sung-Seok Ko
Venue: Computers and Industrial Engineering (2009)

In this paper, we develop a simulation-based two-phase genetic algorithm for the capacitated re-entrant line scheduling problem. The structure of a chromosome consists of two sub-chromosomes for buffer allocation and server allocation, respectively, while considering all possible states of the system in terms of buffer levels of workstations and assigning a preferred job stage to each component of the chromosome. As an implementation of the suggested algorithm, a job priority-based randomized policy is defined, which reflects the job priority and the properness of local non-idling in allocating buffering and processing capacity to available job instances. The algorithm is combined with a polynomial time sub-optimal deadlock avoidance policy, namely, Bankers algorithm, and the fitness of a chromosome was evaluated based on simulation. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that the suggested approach holds considerable promise for providing effective and computationally efficient approximations to the optimal scheduling policy that consistently outperforms the typically employed heuristics.
On the Expressiveness of Forwarding in Higher-Order Communication
Authors: Cinzia Giusto, Jorge A. Pérez, Gianluigi Zavattaro
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwarding. Here we propose a limited form of forwarding: output actions can only communicate the parallel composition of statically known closed processes and processes received through previously executed input actions. We study the expressiveness of a higher-order process calculus featuring this style of communication. Our main result shows that in this calculus termination is decidable while convergence is undecidable.
Development of an Emotional Interface for Sustainable Water Consumption in the Home
Authors: Mehdi Ravandi, Jon Mok, Mark Chignell
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

The design of an application to monitor, analyze and report individual water consumption within a household is introduced. An interface design incorporating just-in-time feedback, positive and negative reinforcement, ecological contextualization, and social validation is used to promote behavior change. Reducing water consumption behavior in the shower is targeted, as it is the leading source of discretionary indoor water use in a typical home. In both in-shower and out-of-shower scenarios, interface designs aim to address user needs for information, context, control, reward, and convenience to reduce water consumption.
Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases
Authors: Yangjun Chen
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Since the extensible markup language XML emerged as a new standard for information representation and exchange on the Internet, the problem of storing, indexing, and querying XML documents has been among the major issues of database research. In this paper, we study the twig pattern matching and discuss a new algorithm for processing ordered twig pattern queries. The time complexity of the algorithmis bounded by O(|D|·|Q| + |T|·leaf Q ) and its space overhead is by O(leaf T ·leaf Q ), where T stands for a document tree, Q for a twig pattern and D is a largest data stream associated with a node q of Q, which contains the database nodes that match the node predicate at q. leaf T (leaf Q ) represents the number of the leaf nodes of T (resp. Q). In addition, the algorithm can be adapted to an indexing environment with XB-trees being used.
Automatic identification of non-compositional multi-word expressions using latent semantic analysis
Authors: Graham Katz, Eugenie Giesbrecht
Venue: Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties (2006)

Making use of latent semantic analysis, we explore the hypothesis that local linguistic context can serve to identify multi-word expressions that have non-compositional meanings. We propose that vector-similarity between distribution vectors associated with an MWE as a whole and those associated with its constituent parts can serve as a good measure of the degree to which the MWE is compositional. We present experiments that show that low (cosine) similarity does, in fact, correlate with non-compositionality.
An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks
Authors: Qinghua Zhu, Deying Li
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

A network of many sensors and a base station that are deployed over a region is considered. Each sensor has a transmission range, a interference range, and a carrier sensing range, which is r, ¿r, and βr, respectively. In this paper, we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem: Given locations of sensors along with a base station, a subset of sensors, and parameters r,¿, and β, find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts, such that the latency is minimized. We designed an nearly a constant ratio approximation algorithm and a heuristic algorithm for the problem. Extensive simulations have been done to show the performances of the two algorithms.
Processing Information Extracting and Machining Process Simulation of the Revolving Model Parts
Authors: Ting-ting Liu, Shu-lin Hou, Yi-dong Tao, Ye Kong
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

This paper bases on the feature of the lathe processing ,by analyzing the related technology of numerical control machining simulation in virtual manufacturing, a numerical control machining simulation system is studied through modeling the 3D geometry model and machining process simulation model. Based on OpenGL Displaying Mechanism, the system is developed taking the example of some Turning part to imitate numerical control machining process of Revolving Model Parts in real-time on Visual C++6.0 environment. It can examine the NC program with this software to decrease the inconvenience and material waste of other methods.
Learning Through Rare Events: Significant Interruptions at the Baltimore & Ohio Railroad Museum
Authors: Marlys K. Christianson, Maria T. Farkas, Kathleen M. Sutcliffe, Karl E. Weick
Venue: Organization Science (2009)

The collapse of the roof of the Baltimore & Ohio (B&O) Railroad Museum Roundhouse onto its collections during a snowstorm in 2003 provides a starting point for our exploration of the link between learning and rare events. The collapse occurred as the museum was preparing for another rare event: the Fair of the Iron Horse, an event planned to celebrate the 175th anniversary of American railroading. Our analysis of these rare events, grounded in data collected through interviews and archival materials, reveals that the issue is not so much what organizations learn “from” rare events but what they learn “through” rare events. Rare events are interruptions that trigger learning because they expose weaknesses and reveal unrealized behavioral potential. Moreover, we find that three organizing routines---interpreting, relating, and re-structuring---are strengthened and broadened across a series of interruptions. These organizing routines are critical to both learning and responding because they update understanding and reduce the ambiguity generated during a rare event. Ultimately, rare events provoke a reconsideration of organizational identity as the organization learns what it knows and who it is when it sees what it can do. In the case of the B&O Railroad Museum, we find that the roof collapse offered an opportunity for the organization to transform its identity from that of a museum to that of an attraction.
TKS: a transition key management scheme for secure application level multicast
Authors: Hatem Bettahar, Mothanna Alkubeily, Abdelmadjid Bouabdallah
Venue: International Journal of Security and Networks (2009)

The Application Level Multicast (ALM) simplifies the implementation of group communication. However, it still suffer from the same management overhead in case of highly dynamic sessions. In this paper, we propose an efficient key management protocol, called Transition Key Scheme (TKS), for ALM communication. TKS aims to reduce the key management overhead in case of highly dynamic membership sessions by using a unique Traffic Encryption Key (TEK), for the group, and a small number of individual transition keys to temporally manage members who recently joined the group. Simulation results confirm that TKS reduces significantly key management overhead, compared to other existing ALM key management protocols. In addition, we validated our scheme using AVISPA validation tool, and the results show that TKS is safe against intruder attacks.
Study on the Network Service Status's Detection and Recovery Strategy Based on Cloud Model
Authors: Chen Lin, Zhang Shi-bin, Li Li
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

In this paper, taking the survivability of trusted network as the background, the key issues of network survivability are researched. Taking into account the uncertainty, randomness of network services, by introducing cloud model, the status of network service is described in this paper. Based on cloud model, this paper proposes the strategy of status detection for network service, the evaluation of network survivability and recovery strategy, and the associated theory analysis and confirmation are given. At the same time, this model proposed in this paper also enlightens a new way for study on the survivability of current complex network system.
Lycos Retriever: an information fusion engine
Authors: Brian Ulicny
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper describes the Lycos Retriever system, a deployed system for automatically generating coherent topical summaries of popular web query topics.