ppxscal/embedding_network huggingface dataset:
Ranking Entities Using Comparative Relations
Authors: Takeshi Kurashima, Katsuji Bessho, Hiroyuki Toda, Toshio Uchiyama, Ryoji Kataoka
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

This paper proposes a method for ranking entities (e.g. products, people, etc.) that uses the comparative sentences described in text such as reviews, blogs, etc. as an indicator of an individual entity's value. A comparative sentence expresses a relation between two entities. The comparative sentence "The quality of A is better than that of B" is expressed by the comparative relation {A,B,quality,better}. Given a query (set of queries), the proposed method automatically finds the competitive entities and extracts the comparative relations among them. From the vast amount of comparative relations so extracted, the proposed method then generates a graph modeling the behavior of a "potential customer" to assess the relative importance of every entity against its competitors. These ranking results help potential customers to know the position of the entity among related entities and decide which one to choose.
Data Quality in Web Information Systems
Authors: Xiaofang Zhou, Shazia Sadiq, Ke Deng
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

The World Wide Web has brought a wave of revolutionary changes for people and organizations to generate, disseminate and use data. With unprecedented access to massive amount of data and powerful information gathering capabilities enabled by Web-based technologies, the traditional closed world assumption for database systems has been challenged. More and more data from the Web are used today as essential information sources, directly or indirectly, for all types of decision making purposes in not only just personal, but also many business and scientific applications. A user of such Web data, however, has to constantly rely on their own judgement on data quality, such as correctness, currency, consistency and completeness. This is an unreliable and often very difficult process, as the quality of this judgement itself often relies on the quality of other information obtained from the Web, and the relationship among the data used can be very complex and sometime hidden from the user.While the issue of data quality is as old as data itself, it is now exposed at a much higher, broader and more critical level due to the scale, diversity and ubiquitousness of Web Information Systems. The intrinsic mismatch between the intended use and actual use of the data on the Web is a fundamental cause of poor data quality for Web-based applications. In this talk, we will introduce the notion of data quality, from its root in management information systems research to new issues and challenges in the context of large-scale Web Information Systems. After a brief introduction to organizational and architectural solutions to the data quality problem, this talk will focus on the current research activities and results on computational solutions form the database community in data profiling, record linking, conditional functional constraints, data provenance and data uncertainty. These technical solutions will be examined for their promises and limitations to the problem of data quality in Web Information Systems. Finally, we will discuss a list of open research problems.
Program equivalence and context-free grammars
Authors: Barry K. Rosen
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

This note defines a new equivalence relation among systems of recursion equations and a method for assigning context-free grammars to these systems, such that (1) The new equivalence implies strong equivalence; (2) Systems are equivalent in the new sense iff their grammars generate the same language; (3) There is a nontrivial decidable class of systems whose grammars have the decidability properties of LL(k) grammars. Thus, the decidability of generative equivalence for LL(k) grammars mitigates the general undecidability of strong equivalence between arbitrary systems of recursion equations.
Improved Garbled Circuit: Free XOR Gates and Applications
Authors: Vladimir Kolesnikov, Thomas Schneider
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We present a new garbled circuit construction for two-party secure function evaluation (SFE). In our one-round protocol, XOR gates are evaluated "for free", which results in the corresponding improvement over the best garbled circuit implementations (e.g. Fairplay [19]).We build permutation networks [26] and Universal Circuits (UC) [25] almost exclusively of XOR gates; this results in a factor of up to 4 improvement (in both computation and communication) of their SFE. We also improve integer addition and equality testing by factor of up to 2.We rely on the Random Oracle (RO) assumption. Our constructions are proven secure in the semi-honest model.
Optimizing customer's selection for configurable product in B2C e-commerce application
Authors: Xinggang Luo, Yiliu Tu, Jiafu Tang, C. K. Kwong
Venue: Computers in Industry (2008)

Many companies provide configurable products on Internet to satisfy customers' diversified requirements. Most of business-to-consumer (B2C) e-commerce software systems use tree- or wizard-like approaches to guide customers in configuring a customized product on Internet web pages. However, customers may feel confused while they are selecting components of a product from option lists, since they are usually not familiar with the technical details of these components. A few e-commerce sites use recommendation systems to provide suggested products for customers, but they have to maintain user profiles and have limitations such as new user problem and complexity. Therefore, they may not be suitable for small and medium-sized enterprises. This research proposes a new approach to help customers configure their expected products. By using this approach, once a customer inputs the levels of importance of requirements, total budget of the expected product, the software system can figure out a customized product which maximally meets the customer's expectations, and can also provide the suboptimal solutions for further selections. A mathematical model to formulate this optimization problem is established. A case study is used to demonstrate the feasibility and effectiveness of this approach.
Towards an Interdisciplinary Framework for Automated Negotiation
Authors: Fernando Lopes, A. Q. Novais, Helder Coelho
Venue: Proceedings of the 9th international conference on E-Commerce and Web Technologies (2008)

Negotiation is an important and pervasive form of social interaction. The design of autonomous negotiating agents involves the consideration of insights from multiple relevant research areas to integrate different perspectives on negotiation. As a starting point for an interdisciplinary research effort, this paper presents a model that handles bilateral multi-issue negotiation, employs game-theoretic techniques to define equilibrium strategies for the bargaining game of alternating offers, and formalizes a set of negotiation strategies and tactics studied in the social sciences. Autonomous agents equipped with the model are currently being developed using the Jade framework. The agents are able to negotiate under both complete and incomplete information, thereby making the model in particular and the agents in general very compelling for automated negotiation.
Optimizing the Target-Filter Combination in Digital Mammography in the Sense of Image Quality and Average Glandular Dose
Authors: Mari Varjonen, Pekka Strömmer
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

This paper presents the optimized target --- filter combinations to meet with the high image quality and the lowest possible average glandular dose in digital mammography based on amorphous selenium (a-Se) detector technology. Study also provides recommendations for target-filter combinations in digital mammography for different breast thicknesses. The full field digital mammography (FFDM) system based on a-Se technology, which is also a platform of tomosynthesis prototype, was used in this study. X-ray target --- filter combinations, which we studied, were tungsten (W) --- rhodium (Rh), W --- silver (Ag), W--- molybdenum (Mo), and W --- tin (Sn). The average glandular doses (AGD) were calculated using a specific program, which automates the method described by Dance et al. Image quality was evaluated technically; contrast and noise analysis. By using W---Rh, W---Ag, W---Sn, W---Mo target-filter combinations it is possible to achieve a significantly lower average glandular dose compared to Mo---Mo or Mo---Rh. The average glandular dose reduction was achieved from 40 % to 60 % depending, which were the selected target-filter combination and the breast thickness. In the future, the evaluation will concentrate to study the effect of higher kV (> 35 kV) values, which might be useful when optimizing the dose in digital mammography.
Integrating Z into Large Projects Tools and Techniques
Authors: Anthony Hall
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

If we want to use Z to write an overall system specification, we need to integrate it into a rich set of documents written in natural language and domain-specific notations. These documents must be easy to write and read by non-mathematicians.On a purely practical level, this implies that we want Z to be part of the ordinary documents that are used every day on the project. That means, in practice, that it has to be integrated into Microsoft Word. I describe a tool for writing and checking Z within the Word environment and some progress towards a process for writing the specification and guidelines for its structure.
On Convergence of a Simple Genetic Algorithm
Authors: Jolanta Socała, Witold Kosiński
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The simple genetic algorithm (SGA) and its convergence analysis are main subjects of the article. The SGA is defined on a finite multi-set of potential problem solutions (individuals) together with mutation and selection operators, and appearing with some prescribed probabilities. The selection operation acts on the basis of the fitness function defined on individuals, and is fundamental for the problem considered. Generation of new population is realized by iterative actions of those operators written in the form of a transition operator acting on probability vectors. The transition operator is a Markov one. Conditions for convergence and asymptotic stability of the transition operator are formulated.
A Language for Reliable Service Composition
Authors: Qingjun Xiao, Ruonan Rao, Jinyuan You
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Service Composition is one of the pillars under Service Oriented Architecture. BPEL becomes the de-facto standard within this area. A key aspect when aggregating business processes using BPEL is to realize a compensation-based reliable service composition, often referred to as BPEL LRT(Long Running Transaction). But there lacks precise modeling on how to combine BPEL control flow with long running transactions. The paper presents a formal language named BPTX, which is a simplified version of BPEL at syntactic level and offers effective directions to underlying transaction coordinator as semantics. The paper also proposes an optimization not contained in traditional transaction processing: detect the failure destiny of a branch and react to it as early as possible.
Constructing random polygons
Authors: David Dailey, Deborah Whitfield
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

The construction of random polygons has been used in psychological research and for the testing of algorithms. With the increased popularity of client-side vector based graphics in the web browser such as seen in Flash and SVG, as well as the newly introduced 2logn) time. Our algorithm differs from other approaches in that the vertices are generated randomly, the algorithm is inclusive (i.e. each polygon has a non-zero probability to be constructed), and it runs efficiently in polynomial time.
Ontology-Based Fraud Detection
Authors: Liu Fang, Ming Cai, Hao Fu, Jinxiang Dong
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

One method for detecting fraud is to check for suspicious changes in user behavior. This paper proposes a novel method, built upon ontology and ontology instance similarity. Ontology is now widely used to enable knowledge sharing and reuse, so some personality ontologies can be easily used to present user behavior. By measure the similarity of ontology instances, we can determine whether an account is defrauded. This method lows the data model cost and make the system very adaptive to different applications.
Design Principles and Constraints Underlying the Construction of Brain-Based Devices
Authors: Jeffrey L. Krichmar, Gerald M. Edelman
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Without a doubt the most sophisticated behavior seen in biological agents is demonstrated by organisms whose behavior is guided by a nervous system. Thus, the construction of behaving devices based on principles of nervous systems may have much to offer. Our group has built series of brain-based devices (BBDs) over the last fifteen years to provide a heuristic for studying brain function by embedding neurobiological principles on a physical platform capable of interacting with the real world. These BBDs have been used to study perception, operant conditioning, episodic and spatial memory, and motor control through the simulation of brain regions such as the visual cortex, the dopaminergic reward system, the hippocampus, and the cerebellum. Following the brain-based model, we argue that an intelligent machine should be constrained by the following design principles: (i) it should incorporate a simulated brain with detailed neuroanatomy and neural dynamics that controls behavior and shapes memory, (ii) it should organize the unlabeled signals it receives from the environment into categories without a priori knowledge or instruction, (iii) it should have a physical instantiation, which allows for active sensing and autonomous movement in the environment, (iv) it should engage in a task that is initially constrained by minimal set of innate behaviors or reflexes, (v) it should have a means to adapt the device's behavior, called value systems, when an important environmental event occurs, and (vi) it should allow comparisons with experimental data acquired from animal nervous systems. Like the brain, these devices operate according to selectional principles through which they form categorical memory, associate categories with innate value, and adapt to the environment. This approach may provide the groundwork for the development of intelligent machines that follow neurobiological rather than computational principles in their construction.
Inter-domain routing for mobile ad hoc networks
Authors: Chi-Kin Chau, Jon Crowcroft, Kang-Won Lee, Starsky H.Y. Wong
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

Inter-domain routing is an important component to allow interoperation among heterogeneous network domains operated by different organizations. Although inter-domain routing has been well supported in the Internet, there has been relatively little support to the Mobile Ad Hoc Networks (MANETs) space. In MANETs, the inter-domain routing problem is challenged by: (1) dynamic network topology due to mobility, and (2) diverse intra-domain ad hoc routing protocols. In this paper, we discuss how to enable inter-domain routing among MANETs, and to handle the dynamic nature of MANETs. We first present the design challenges for inter-domain routing in MANETs, and then propose a framework for inter-domain routing in MANETs.
A Genetic Approach to the Automatic Generation of Fuzzy Control Systems from Numerical Controllers
Authors: Giuseppe Penna, Francesca Fallucchi, Benedetto Intrigila, Daniele Magazzeni
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Control systems are small components that control the behavior of larger systems. In the last years, sophisticated controllers have been widely used in the hardware/software embedded systems contained in a growing number of everyday products and appliances. Therefore, the problem of the automatic synthesis of controllers is extremely important. To this aim, several techniques have been applied, like cell-to-cell mapping, dynamic programming and, more recently, model checking. The controllers generated using these techniques are typically numerical controllers that, however, often have a huge size and not enough robustness. In this paper we present an automatic iterative process, based on genetic algorithms, that can be used to compress the huge information contained in such numerical controllers into smaller and more robust fuzzy control systems.
Experimental and Numerical Dye Washout Flow Visualization: Flow analysis in the realistic model of pathologic artery enlargement (aneurysm)
Authors: L. Goubergrits, Ch. Petz, D. Stalling, A. Spuler, K. Affeld
Venue: Journal of Visualization (2004)

Flow visualization in realistic models is very important for the study of pathological vessel enlargements (aneurysms). Furthermore, flow visualization may help in treatment decisions. However, the most interesting parameter, the wall shear stress, is difficult to measure in vivo. This parameter can be provided by computational fluid dynamics. However, the numerical methods don't visualize the results as does of the dye washout method - a method often used in flow studies. This experimental method simulates the cine angiograms acquired during contrast agent injection used in medicine. In this paper we present the dye washout visualization of CFD results and compare these results with the conventional dye washout experiments in the same aneurysm model under steady flow conditions.
On Expressiveness and Complexity in Real-Time Model Checking
Authors: Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Metric Interval Temporal Logic (MITL) is a popular formalism for expressing real-time specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning so-called punctual specifications. In this paper we introduce a significantly more expressive logic that can express a wide variety of punctual specifications, but whose model-checking problem has the same complexity as that of MITL. We conclude that for model checking the most commonly occurring specifications, such as invariance and bounded response, punctuality can be accommodated at no cost.
A Groebner Bases Based Many-Valued Modal Logic Implementation in Maple
Authors: Eugenio Roanes-Lozano, Luis M. Laita, Eugenio Roanes-Macías
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

The authors developed in the nineties a Groebner bases based polynomial model for classic Boolean algebra and many-valued modal logics and for rule based expert systems (RBES) based on these logics. Following this approach, they have designed and developed RBES in different fields. Now two Maple packages that can perform knowledge extraction and consistency checking in RBES which underlying logic is either classic Boolean or Kleene's or Lukasiewicz's many-valued modal have been developed and can be freely obtained from the authors. They extend the possibilities of Maple's built-in "Logic" package.
Product Line Based Reuse Methodology for Developing Generic ECU
Authors: Si Won Choi, Jin Sun Her, Hyun Koo Kang, Soo Dong Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

As an important application domain of embedded software, auto-motive software is playing a more important role within automotive industry. There are some essential issues to be resolved; managing software complexity, reducing software cost, and shortening time-to-market. An effective solution to these issues is to reuse generic Electronic Control Units (ECUs) in building various ECUs rather than building every piece from scratch. Generic ECU is an ECU level reuse unit which consists of automotive components and embeds variability. Among the reuse approaches, Product Line Engineering (PLE) can be effectively applied in developing generic ECUs. However, current PLE methodologies do not effectively support developing generic ECUs. Hence, in this paper, we first define a meta-model of generic ECUs. Then, we define variability types and variation points for generic ECUs. Based on the meta-model and variability types, we propose a product line process for developing ECUs. To assess the applicability of the proposed meta-model and the PLE process, we present the case study of developing an automotive ECU for Window Control System (WCS).
On Feasibility of P2P On-Demand Streaming via Empirical VoD User Behavior Analysis
Authors: Bin Chang, Liang Dai, Yi Cui, Yuan Xue
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In its current art, peer-to-peer streaming solution has been mainly employed in the domain of live event broadcasting. In such a paradigm, users are required to simultaneously participate the streaming, which yields tremendous bandwidth pool to alleviate the server load. However, little effort has been paid to study the performance gain when peer-to-peer solution is deployed into the domain of Video-on-Demand (VoD) applications, when users have the freedom to access a large pool of media files at their preferred times. Users of VoD applications exhibit file-dependent and time-varying access patterns, which are hard to simulate without realistic guidance from the operational system observation. In this paper, we present an empirical study on the traces collected by the Vanderbilt University media streaming service over a period of 8 months. We pay special attention to peer aggregation around one media file, in which peer-to-peer streaming is able to play an essential role. With this regard, we investigate three key factors: file popularity, request inter-arrival time, and user online duration. Our analysis proves the existence of skewed file popularity, concentrated user requests, and long enough online duration. Furthermore, through replaying the trace via simulation, we show that peer-to-peer streaming could reduce the server load by as high as 90% over popular files.