ppxscal/embedding_network huggingface dataset:
Providing Flexible Queries over Web Databases
Authors: Xiangfu Meng, Z. M. Ma, Li Yan
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper presents a novel approach of the flexible query and ranking (FQR) by relaxing the original query in order to provide approximate answers to the user. FQR extends the categorical query criteria with the most similar values by estimating the similarity of different pairs of values in the query workload. Also FQR expands the numerical query criteria range to the nearby values by using the kernel density estimation technology. FQR speculates the importance of each specified attribute based on the user query and assigns the score of each attribute value according to its "desirableness" to the user. The tuples satisfying the relaxed query are finally ranked according to their satisfaction degree.
Extensible Web Browser Security
Authors: Mike Ter Louw, Jin Soon Lim, V. N. Venkatakrishnan
Venue: Proceedings of the 4th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2007)

In this paper we examine the security issues in functionality extension mechanisms supported by web browsers. Extensions (or "plug-ins") in modern web browsers enjoy unlimited power without restraint and thus are attractive vectors for malware. To solidify the claim, we take on the role of malware writers looking to assume control of a user's browser space. We have taken advantage of the lack of security mechanisms for browser extensions and have implemented a piece of malware for the popular Firefox web browser, which we call browserSpy, that requires no special privileges to be installed. Once installed, browserSpy takes complete control of a user's browser space and can observe all the activity performed through the browser while being undetectable. We then adopt the role of defenders to discuss defense strategies against such malware. Our primary contribution is a mechanism that uses code integrity checking techniques to control the extension installation and loading process. We also discuss techniques for runtime monitoring of extension behavior that provide a foundation for defending threats due to installed extensions.
Prediction of Arm Trajectory from the Neural Activities of the Primary Motor Cortex Using a Modular Artificial Neural Network Model
Authors: Kyuwan Choi, Hideaki Hirose, Yoshio Sakurai, Toshio Iijima, Yasuharu Koike
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

First, we reconstructed 9 muscle tensions (filtered EMG signals) from 105 neurons in the arm region of the primary motor cortex, then estimated arm movement in four degrees of freedom in the shoulder and the elbow from the reconstructed 9 muscle tensions. The reconstructed arm movement showed good correlation with the actual arm movement.
A Formalization of Quantity Based Double Auction Mechanism
Authors: Satoshi Takahashi, Matsuo Tokuro
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Auction researches are promising field of applied autonomous agent technologies. In this paper, we formalize a double auction, which uses non-linear value function including divides items trading. In this trading, the valuation of the item is decided by quantum of the trading. In this regard, we consider multiple situations, because buyers' and sellers' value functions are not uniquely decided. In this paper, we give some feature examples, and suggest an analysis method. To solve the discontinuous function problem, we propose supplementation presumption method.
A Comparative Study of Correlation Measurements for Searching Similar Tags
Authors: Kaikuo Xu, Yu Chen, Yexi Jiang, Rong Tang, Yintian Liu, Jie Gong
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

In recent years, folksonomy becomes a hot topic in many research fields such as complex systems, information retrieval, and recommending systems. It is essential to study the semantic relationships among tags in folksonomy applications. The main contributions of this paper includes: (a) proposes a general framework for the analysis of the semantic relationships among tags based on their co-occurrence. (b)investigates eight correlation measurements from various fields; then appliying these measurements to searching similar tags for a given tag on datasets from del.icio.us. (c) conducts a comparative study on both accuracy and time performance of the eight measurements. From the comparison, a best overall correlation measurement is concluded for similar tags searching in the applications of folksonomy.
Can I Please Drop It? Dialogues About Belief Contraction
Authors: Henk-Jan Lebbink, Cilia Witteman, John-Jules Meyer
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

This paper presents a dialogue game in which agents in a multiagent system try to contract beliefs in agreement with other agents. The dialogue game defines the semantics of the communicative act of asking support to contract beliefs. In addition, a decision game is presented that defines when agents are allowed to contract propositions from their private belief states. These games if combined allow agents to contract beliefs in a distributed fashion.
A Link-Based Rank of Postings in Newsgroup
Authors: Hongbo Liu, Jiahai Yang, Jiaxin Wang, Yu Zhang
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Discussion systems such as Usenet, BBS, Forum are important resources for information sharing, view exchanging, problem solving and product feedback, etc. on Internet. The postings in newsgroups on Usenet represents the judgments and choices of participators. The structure of postings could provide helpful information for the users. In this paper, we present a method called PostRank to rank the postings based on the structure of newsgroup. Its results correspond to the eigenvectors of the transition probability matrix and the stationary vectors of the Markov chains. It could provide useful global information for the newsgroup and it can be used to help the users access information in it more effectively and efficiently. This method can be also applied on other discussion systems. Some experimental results and discussions on real data sets collected by us are also provided.
Test Strategies for Evaluation of Semantic eGovernment Applications
Authors: Ralf Klischewski, Stefan Ukena
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

In this paper we present a framework for identifying the test focus and test objectives based on the assumption that automatic information processing based on encoded meaning is the core of semantic e-government applications to be evaluated. Taking into account test strategies from software engineering and IT project management as well as different stakeholder perspectives, we identify possible test instruments. Several of these instruments have been applied in the Access-eGov project and we discuss the experience gathered in view of the newly developed framework in order to identify lessons learnt as well as to point to future research. The contribution of the paper is a portfolio of test strategies suggesting certain instruments to be applied from a systems view, agent view, and user view. We conclude that improving semantic e-government applications could be supported through applying a test-first approach, e.g. through providing an e-government test agent to be used in test labs or within the development process.
Robust Model Predictive Control Using a Discrete-Time Recurrent Neural Network
Authors: Yunpeng Pan, Jun Wang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Robust model predictive control (MPC) has been investigated widely in the literature. However, for industrial applications, current robust MPC methods are too complex to employ. In this paper, a discrete-time recurrent neural network model is presented to solve the minimax optimization problem involved in robust MPC. The neural network has global exponential convergence property and can be easily implemented using simple hardware. A numerical example is provided to illustrate the effectiveness and efficiency of the proposed approach.
A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2
Authors: Nobuo Nakagawa, Satoshi Yoshiara
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

We construct differentially 4-uniform functions over GF(2 n ) through Albert's finite commutative semifields, if n is even. The key observation there is that for some k with 0 ≤ k ≤ n ¿ 1, the function $f_{k}(x):=(x^{2^{k+1}}+x)/(x^{2}+x)$ is a two to one map on a certain subset D k (n) of GF(2 n ). We conjecture that f k is two to one on D k (n) if and only if (n,k) belongs to a certain list. For (n,k) in this list, f k is proved to be two to one. We also prove that if f 2 is two to one on D 2(n) then (n,2) belongs to the list.
Information Systems Engineering Supported by Cognitive Matchmaking
Authors: S. J. Overbeek, P. Bommel, H. A. Proper
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

In daily practice, discrepancies may exist in the suitability match of actors and the tasks that have been allocated to them. Formal theory and the prototype of a cognitive matchmaker system are introduced as a solution to improve the fit between actors and tasks. A case study has been conducted to clarify how the proposed cognitive matchmaker system can be utilized in information systems engineering. The inductive-hypothetical research strategy has been applied when performing the case study.
DSOSW: A Deleting Strategy in Mining Frequent Itemsets over Sliding Window of Stream
Authors: Haifeng Li, Hong Chen
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Most traditional mining approaches of frequent item sets consider mainly on databases and thus can use the second storage and need multiple scans which are not adapted to mining of stream. Some new algorithms over stream's sliding window are presented recently, which perform addition and deletion over stream independently, so the common deleting strategy which removes the earliest transaction is used when the window slides. This paper considers both operations together to reduce the computation cost, consequently, three deleting strategies are proposed to improve the performance with little precision loss. The experimental results show that these strategies over current method are effective and efficient.
High-Assurance Integrity Techniques for Databases
Authors: Elisa Bertino, Chenyun Dai, Hyo-Sang Lim, Dan Lin
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

With the increased need of data sharing among multiple organizations, such as government organizations, financial corporations, medical hospitals and academic institutions, it is critical to ensure data integrity so that effective decisions can be made based on these data. In this paper, we first present an architecture for a comprehensive integrity control system based on data validation and metadata management. We then discuss an important issue in the data validation, that is, the evaluation of data provenance and propose a trust model for estimating the trustworthiness of data and data providers. By taking into account confidence about data provenance, we introduce an approach for policy observing query evaluation as a complement to the integrity control system.
An Intelligent Analyzer for Supporting Diagnoses of Congenital CMV Infection
Authors: Leonarda Carnimeo
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Cytomegalovirus (CMV), the most important agent of congenital infection in babies, reveals to be the main cause of not genetic sensorineural hearing loss, that is, the most common congenital kind of hypoacusia. In this paper a neural diagnostic support tool able to identify those children who, from anamnestic/clinic/serologic/virologic point of views, present high risks of developing sensorineural sequelae for CMV infection, is proposed. The adoption of this Intelligent Analyzer is believed to provide a valid contribution to an early diagnosis of this deep form of hypoacusia.
Effects of Interaction between Transport and Application Layers on SIP Signaling Performance
Authors: Masataka Ohta
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Session Initiation Protocol (SIP) is an application-layer protocol to handle sessions between two points. SIP is implemented on the top of the transport protocols, such as user datagram protocol (UDP) or transmission control protocol (TCP). SIP messages are transmitted by UDP or TCP. We focus on an interaction between the application layer (SIP) and the transport layer (UDP or TCP). The paper studies how the interaction affects performance of SIP signaling. A significant performance difference was found to exist because of the interaction. In the case of SIP over UDP, retransmissions of SIP messages decrease throughput. On the other hand, in the case of SIP over TCP, a large TCP buffer causes a large call setup delay although TCP improves throughput.
Priority-Based Coverage-Aware Congestion Control for Multihop Wireless Sensor Networks
Authors: Xiaoling Qiu, Dipak Ghosal, Biswanath Mukherjee, Jennifer Yick, Deshi Li
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Congestion in a Wireless Sensor Network (WSN) can lead to buffer overflow, resource waste and delay or loss of critical information from the sensors. In this paper, we propose the Priority-based Coverage-aware Congestion Control(PCC), which is a distributed, priority-distinct, and fair mechanism. PCC provides higher priority to packets with event information, which the sink is more interested in. PCC employs a queue scheduler which can selectively drop any packet in the queue. PCC gives fair chance to all sensors to transmit packets to the sink, irrespective of their specific locations, and therefore enhances the coverage fidelity of WSNs. Based on a detailed simulation analysis, we show that PCC can efficiently relieve congestion and significantly improve the system performance based on multiple metrics such as event throughput and coverage fidelity.
Enterprise Mashup Composite Service in SOA User Profile Use Case Realization
Authors: Fran Yang
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Enterprise mashup composite services in SOA aim to reuse IT resources that can be rapidly assembled to meet changing business requirements. They can provide a universal interface to access a variety of data in data sources in heterogeneous environments and decouple their consumers from these data sources. However implementing an enterprise mashup composite service in SOA is a challenging topic. In this paper, through a use case study, User Profile Use Case realization, we will discuss best practices, challenges, insights and lessons learned in its implementation.
IRMA: An Image Registration Meta-algorithm
Authors: Kelvin T. Leung, D. Stott Parker, Alexandre Cunha, Cornelius Hojatkashani, Ivo Dinov, Arthur W. Toga
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

IRMA is a meta-algorithm for image registration (image alignment), evaluating results under multiple metrics using the LONI Pipeline workflow infrastructure, on the LONI/CCB grid computing facility. IRMA manages these results in a model base implemented with PostgreSQL. It permits scientists to catalog the results such as provenance information, and permits subsequent mining -- exploring the space of alternatives in an organized fashion and building understanding about individual algorithms, and learn about strengths and weaknesses of algorithms over time.
SpreadMash: A Spreadsheet-Based Interactive Browsing and Analysis Tool for Data Services
Authors: Woralak Kongdenfha, Boualem Benatallah, Régis Saint-Paul, Fabio Casati
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Spreadsheets are one of the most popular end-users programming environment. Although spreadsheets provide an interactive interface for data manipulation and analysis, they are mostly used today in data entry mode and not as interactive browsing tool for data stored in underlying data sources. In this paper, we present SpreadMash, a high-level language and tool for interactive data browsing and analysis for data services. The key innovation of SpreadMash is a repository of application building blocks called data widgets that characterize various data importation and presentation patterns in spreadsheets. Data widgets enable the separation of end-users tasks (composing data widgets) from the tasks of data architects (creating data abstractions and data widgets). Through a series of examples we illustrate how tasks that would be challenging in existing environments are facilitated by SpreadMash.
Peer-Based Efficient Content Distribution in Ad Hoc Networks
Authors: Seung-Seok Kang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Mobile devices pay the telecommunication cost of downloading Internet data proportional to the amount of data transferred. This paper introduces a special ad hoc network in which several mobile devices, called peers, to cooperate each other to reduce the overall cost to download Internet content. Each peer downloads a specific portion of the content over 3G connection and exchanges the portion with other peers over the ad hoc connection in order that all participating peers are able to reconstruct the whole content. This paper proposes a peer-based content distribution method, and compares its performance with a similar one named per-packet based distribution method. The simulation results indicate that per-peer based method outperforms the per-packet based method. In addition, approximately 90% of the telecommunication cost is saved with as few as 10 peers.
Multi-finger Prehension Synergy: Exploration with Transcranial Magnetic Stimulation
Authors: Mark L. Latash, Xun Niu, Vladimir M. Zatsiorsky
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We used transcranial magnetic stimulation (TMS) to explore the stability of the three components of the multi-finger prehension synergy during holding a vertically oriented object vertically in the air. TMS led to close to proportional changes in the mechanical variables produced by the digits. These changes violated synergy components that took different times to restore. Patterns of co-variation of the mechanical variables produced by individual digits corresponding to the equation of statics restored first followed by a change in the magnitude of the performance variables such as grip force, total tangential force, and total moment of force. The results support the principle of superposition as applied to the prehension synergy.
Optimization Problems in Service Provisioning Systems
Authors: Isi Mitrani
Venue: Proceedings of the 4th European workshop on Performance Engineering: Formal Methods and Stochastic Models for Performance Evaluation (2007)

A service provisioning system typically contains a number of servers which may be distributed, heterogeneous and intermittently unavailable. They are used by the host in order to offer different services to a community of users. There may or may not be Service-Level Agreements involving Quality of Service constraints. In this context, there are several areas where dynamic optimisation problems arise quite naturally. These are (a) Routing and load-balancing: Where should an incoming request be sent for execution? If some queues grow large while others are short, can something be gained by transferring jobs among them? (b) Resource allocation: If different servers are dedicated to different types of service, how many should be assigned to each? When should a server be switched from one type of service to another? (c) Revenue maximisation:How are resource allocation and job admission policies affected by economic considerations? In particular, if service-level agreements specify payments for serving jobs and penalties for failing to provide a given quality of service, how many servers should be assigned to each type of service and when should jobs of that type be accepted?
On the reification of Java wildcards
Authors: Maurizio Cimadamore, Mirko Viroli
Venue: Science of Computer Programming (2008)

Providing runtime information about generic types-that is, reifying generics-is a challenging problem studied in several research papers in the last years. This problem is not tackled in current version of the Java programming language (Java 6), which consequently suffers from serious safety and coherence problems. The quest for finding effective and efficient solutions to this problem is still open, and is further made more complicated by the new mechanism of wildcards introduced in Java J2SE 5.0: its reification aspects are currently unexplored and pose serious semantics and implementation issues. In this paper, we discuss an implementation support for wildcard types in Java. We first analyse the problem from an abstract viewpoint, discussing the issues that have to be faced in order to extend an existing reification technique so as to support wildcards, namely, subtyping, capture conversion and wildcards capture in method calls. Secondly, we present an implementation in the context of the EGO compiler. EGO is an approach for efficiently supporting runtime generics at compile-time: synthetic code is automatically added to the source code by the extended compiler, so as to create generic runtime type information on a by need basis, store it into object instances, and retrieve it when necessary in type-dependent operations. The solution discussed in this paper makes the EGO compiler the first reification approach entirely dealing with the present version of the Java programming language.
Post Correspondence Problem for short words
Authors: Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki
Venue: Information Processing Letters (2008)

We prove that the generalized Post Correspondence Problem is undecidable for instances where the lengths of the image words are at most 2 and the number of pairs of words is at most 30. The proof uses undecidability of the word problem of the Tzeitin semigroup. We also transform our constructions in order to achieve a proof for the undecidability of the (not generalized) Post Correspondence Problem with image words of length at most 2.