ppxscal/embedding_network huggingface dataset:
The Composite OLAP-Object Data Model: Removing an Unnecessary Barrier
Authors: Elaheh Pourabbas, Arie Shoshani
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

OLAP and object data models represent different logical concepts and structures, and therefore separate database systems with different query languages were developed based on these models. We show in this paper that it is desirable and possible to combine these models to represent realistic modeling requirements. We define in this paper an OLAP-Object data model that combines the main characteristics of OLAP and Object data models in order to represent their functionalities in a common framework. We use three different types of object classes: primitive, regular and composite. In the OLAP-Object data model, primitive and regular classes which represent object structures can be used for form composite classes that represent OLAP structures. We define a query language that uses path structures to facilitate data navigation and data manipulation. The proposed language uses the concept of an anchor. An anchor is an object class (primitive, regular or composite) that is selected as a starting node from which paths structures can be formed to express queries. The power of the proposed query language is illustrated through numerous examples. The syntax and semantics of the proposed language are developed.
A New VPN Solution Based on Asymmetrical SSL Tunnels
Authors: Jingli Zhou, Hongtao Xia, Xiaofeng Wang, Jifeng Yu
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Conventional SSL tunnel of SSL-based Virtual Private Network is symmetric, in which the data must be encrypted at one end and decrypted at the other end, or contrariwise for the reverse direction. Because all data flows of VPN are relayed by VPN server via SSL tunnels, those symmetric SSL tunnels cause a lot of computational load concentrated in VPN server, and make it the bottleneck of VPN. This paper proposes a cheap solution to eliminate that bottleneck for larger scale SSL VPNs: The VPN based on Asymmetric SSL Tunnels (AST). It is coupled with two algorithms: IP packet engrafting and UDP diffusing. In this solution, portion of computational load is distributed to disengaged internal application servers. Experiment shows that the overall throughput of VPN can be greatly improved by adopting AST solution.
Implicit and Explicit Evaluation: fMRI Correlates of Valence, Emotional Intensity, and Control in the Processing of Attitudes
Authors: William A. Cunningham
Venue: Journal of Cognitive Neuroscience (2004)

Previous work suggests that explicit and implicit evaluations (good&ndash;bad) involve somewhat different neural circuits that process different dimensions such as valence, emotional intensity, and complexity. To better understand these differences, we used functional magnetic resonance imaging to identify brain regions that respond differentially to such dimensions depending on whether or not an explicit evaluation is required. Participants made either good&ndash;bad judgments (evaluative) or abstract&ndash;concrete judgments (not explicitly evaluative) about socially relevant concepts (e. g., ''murder,'' ''happiness,'' ''abortion,'' ''welfare''). After scanning, participants rated the concepts for goodness, badness, emotional intensity, and how much they tried to control their evaluation of the concept. Amygdala activation correlated with emotional intensity and right insula activation correlated with valence in both tasks, indicating that these aspects of stimuli were processed by these areas regardless of intention. In contrast, for the explicitly evaluative good&ndash;bad task only, activity in the anterior cingulate, frontal pole, and lateral areas of the orbital frontal cortex correlated with ratings of control, which in turn were correlated with a measure of ambivalence. These results highlight that evaluations are the consequence of complex circuits that vary depending on task demands.
Autonomic Data Placement Strategies for Update-intensiveWeb applications
Authors: Swaminathan Sivasubramanian, Guillaume Pierre, Maarten van Steen
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

Edge computing infrastructures have become the leading platform for hosting Web applications. One of the key challenges in these infrastructures is the replication of application data. In our earlier research, we presented GlobeDB, a middleware for edge computing infrastructures that performs autonomic replication of application data. In this paper, we study the problem of data unit placement for updateintensive Web applications in the context of GlobeDB. Our hypothesis is that there exists a continuous spectrum of placement choices between complete partitioning of sets of data units across edge servers and full replication of data units to all servers. We propose and evaluate different families of heuristics for this problem of replica placement. As we show in our experiments, a heuristic that takes into account both the individual characteristics of data units and the overall system load performs best.
Efficient Indexing, Color Descriptors and Browsing in Image Databases
Authors: Nikos Batalas, Christos Diou, Anastasios Delopoulos
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

This work provides an experimental evaluation of various existing approaches for some of the major problems content based image retrieval applications are faced with. More specifically, global color representation, indexing and navigation methods are analyzed and insight is provided regarding their efficiency and applicability. Furthermore this paper proposes and evaluates the combined use of FastMap and kd-trees to enable accurate and fast retrieval in image databases.
On privacy preservation against adversarial data mining
Authors: Charu C. Aggarwal, Jian Pei, Bo Zhang
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Privacy preserving data processing has become an important topic recently because of advances in hardware technology which have lead to widespread proliferation of demographic and sensitive data. A rudimentary way to preserve privacy is to simply hide the information in some of the sensitive fields picked by a user. However, such a method is far from satisfactory in its ability to prevent adversarial data mining. Real data records are not randomly distributed. As a result, some fields in the records may be correlated with one another. If the correlation is sufficiently high, it may be possible for an adversary to predict some of the sensitive fields using other fields.In this paper, we study the problem of privacy preservation against adversarial data mining, which is to hide a minimal set of entries so that the privacy of the sensitive fields are satisfactorily preserved. In other words, even by data mining, an adversary still cannot accurately recover the hidden data entries. We model the problem concisely and develop an efficient heuristic algorithm which can find good solutions in practice. An extensive performance study is conducted on both synthetic and real data sets to examine the effectiveness of our approach.
Knowledge representation for conceptual simulation modeling
Authors: Ming Zhou, Young Jun Son, Zhimin Chen
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation is a powerful tool that helps decision makers in business and industry to solve difficult and complex problems, reduce cost, improve quality and productivity, and shorten time-to-market. However the technology is still underutilized in many applications due to several reasons. In this study we address these issues using a knowledge engineering approach, i.e. develop efficient and robust models and formats to capture, represent and organize the knowledge for developing conceptual simulation models that can be generalized and interfaced with different applications and implementation tools. The research fits into a larger project effort that aims to create a sustained research program on knowledge-based simulation.
Evolutionary feature synthesis for facial expression recognition
Authors: Jiangang Yu, Bir Bhanu
Venue: Pattern Recognition Letters (2006)

Feature extraction is one of the key steps in object recognition. In this paper we propose a novel genetically inspired learning method for facial expression recognition (FER). Unlike current research on facial expression recognition that generally selects visually meaningful feature by hands, our learning method can discover the features automatically in a genetic programming-based approach that uses Gabor wavelet representation for primitive features and linear/nonlinear operators to synthesize new features. These new features are used to train a support vector machine classifier that is used for recognizing the facial expressions. The learned operator and classifier are used on unseen testing images. To make use of random nature of a genetic program, we design a multi-agent scheme to boost the performance. We compare the performance of our approach with several approaches in the literature and show that our approach can perform the task of facial expression recognition effectively.
Controlled sequential factorial design for simulation factor screening
Authors: Hua Shen, Hong Wan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Screening experiments are performed to eliminate unimportant factors so that the remaining important factors can be more thoroughly studied in later experiments. Sequential screening methods are specifically fit for simulation experiments. They are usually more efficient than one-step procedures. The challenge is to prove the "correctness" of the result.This paper proposes Controlled Sequential Factorial Design (CSFD) for discrete-event simulations. It combines sequential hypothesis-testing procedures with the traditional factorial design to control the Type I Error and power for each factor under heterogeneous variances conditions. CSFD requires minimum assumptions and demonstrates robust performance with different system conditions.
Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments
Authors: Ruggiero Cavallo
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Mechanisms for coordinating group decision-making among self-interested agents often employ a trusted center, capable of enforcing the prescribed outcome. Typically such mechanisms, including the ubiquitous Vickrey Clarke Groves (VCG), require significant transfer payments from agents to the center. While this is sought after in some settings, it is often an unwanted cost of implementation. We propose a modification of the VCG framework that---by using domain information regarding agent valuation spaces---is often able to achieve redistribution of much of the required transfer payments back among the agents, thus coming closer to budget-balance. The proposed mechanism is strategyproof, ex post individual rational, no-deficit, and leads to an efficient outcome; we prove that among all mechanisms with these qualities and an anonymity property it is optimally balanced, in that no mechanism ever yields greater payoff to the agents. We provide a general characterization of when strategyproof redistribution is possible, and demonstrate specifically that substantial redistribution can be achieved in allocation problems.
MI-Winnow: A New Multiple-Instance Learning Algorithm
Authors: Sharath R. Cholleti, Sally A. Goldman, Rouhollah Rahmani
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

We present MI-Winnow, a new multiple-instance learning (MIL) algorithm that provides a new technique to convert MIL data into standard supervised data. In MIL each example is a collection (or bag) of d-dimensional points where each dimension corresponds to a feature. A label is provided for the bag, but not for the individual points within the bag. MI-Winnow is different from existing multipleinstance learning algorithms in several key ways. First, MI-Winnow allows each image to be converted into a bag in multiple ways to create training (and test) data that varies in both the number of dimensions per point, and in the kind of features used. Second, instead of learning a concept defined by a single point-and-scaling hypothesis, MI-Winnow allows the underlying concept to be described by combining a set of separators learned by Winnow. For content-based image retrieval applications, such a generalized hypothesis is important since there may be different ways to recognize which images are of interest.
On Clustering Validity Measures and the Rough Set Theory
Authors: Leticia Arco, Rafael Bello, Maria M. Garcia
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Document clustering has been investigated for use in different areas of text mining and information retrieval. A clustering depends on the chosen clustering algorithm as well as on the algorithm's parameter settings; for that reason it is necessary to find the best among several clustering techniques. However, it is very difficult to evaluate a given clustering of documents. There are external, internal and relative measures. The disadvantage of external measures is the necessity of a human reference classification to evaluate the clustering. In this paper we propose the use of rough-set-based measures for document clustering evaluation, basing our calculations solely on the clustering that has to be evaluated. Thus, two advantages of rough set theory are used: it does not need any preliminary or additional information about data, and it is a tool for use in computer applications in circumstances which are characterized by vagueness and uncertainty (this is the case of document clustering). We illustrate the use of the novel measures.
Semantic 3D object manipulation using object ontology in multimodal interaction framework
Authors: Sylvia Irawati, Daniela Calderón, Heedong Ko
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents a multimodal interaction framework for semantic 3D object manipulation in the virtual reality. In our framework, interaction devices such as keyboard, mouse, joystick, tracker, can be combined with speech utterance to give a command to the system. We define an object ontology based on common sense knowledge which defines relationships between virtual objects. By taking into account the current user context and the object ontology, semantic integration component integrates the interpretation result from input manager, and then sends the result to the interaction manager. That result will be mapped into a proper object manipulation. Thus, the system can understand the user intention and assist him for achieving his goal in the handling process, instead of relying entirely on the user's control upon the interaction device and the object, avoiding nonsensical manipulations.
Context Optimization of AI planning for Services Composition
Authors: Lirong Qiu, Zhongzhi Shi, Fen Lin
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Web services composition techniques are gaining momentum as the opportunity to establish reusable and versatile inter-operability applications. Many researchers propose their composition approach based on planning techniques. We propose our context aware planning method which comprises global planning and local optimization based on context information. The major technical contributions of this paper are: (1)We propose an ontology-based framework for the context-aware composition of Web services. Context model, which are structured based on OWLS, captures the Service-related, Environment-related, and User-related context and can be used in an unambiguous, machine interpretable form. (2) We propose context-aware plan architecture and thus is more scalability and flexibility for the planning process, and thereby improving the efficiency and precision. (3) We propose a hybrid approach to build a plan corresponding to a context-aware service composition, based on global planning and local optimization, considering both the usability and adoption. We test our approach on a simple, yet realistic example, and the preliminary results demonstrate that our implementation provides a practical solution.
Minimum Spanning Tree Based Clustering Algorithms
Authors: Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

The minimum spanning tree clustering algorithm is known to be capable of detecting clusters with irregular boundaries. In this paper, we propose two minimum spanning tree based clustering algorithms. The first algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of the point set and removes edges that satisfy a predefined criterion. The process is repeated until k clusters are produced. The second algorithm partitions a point set into a group of clusters by maximizing the overall standard deviation reduction, without a given k value. We present our experimental results comparing our proposed algorithms to k-means and EM. We also apply our algorithms to image color clustering and compare our algorithms to the standard minimum spanning tree clustering algorithm.
An Integration of Web Service and Workflow to a Wealth Management Order Placement System: A Case Study of International Brokerages
Authors: Brenda Y. Hon, Dickson K. W. Chiu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

With the increase in personal wealth and organization sizes, there is also an increase in their assets. So, there is a great demand of professionals to manage these assets and coordinate investment activities in order to maintain the growth. Wealth Management Services are now widely offered by banks, trusts companies, and brokerages. As the financial market becomes well-developed worldwide, the variety of financial products also increases: equities, mutual funds, bonds, securities, foreign currencies, and derivatives (like options, futures, forwards, and swaps). As a Wealth Management System (WMS) plays the role of an order placement hub, it becomes more and more complicated during each enhancement to support order placement of additional kinds of financial products. This is because a WMS requires different channels to communicate with different Instrument Markets. For an international investment company, the problem comes more complicated because the order placement processes are heterogeneous in different countries and locations. In fact, trading systems for different instrument markets of different countries and even different cities are different. Workflows are also hard to coincide with different sites. Therefore, we propose the use of Web services to implement the workflow of order placement process.
A Web Services Shopping Mall for Mobile Users
Authors: John A. MacDonald, Kalid Elmufti, Dasun Weerasinghe, M Rajarajan, Veselin Rakocevic, Sanowar Khan
Venue: Proceedings of the European Conference on Web Services (2006)

In this paper we present a platform for the direct consumption of web services by a Mobile Station. We give an architectural solution where Mobile Operators play the role of Trusted Third Parties supplying service credentials that allow a co-located 3GPP Network Application Function and Liberty-enabled Identity Provider entity to implement a controlled Shopping Mall service to Mobile Stations from multiple trust domains. We consider both the protocol and the structure and syntax of the various tokens required to minimise service latency over the bandwidth and performance constrained mobile system, whilst providing adequate security services to protect against the perceived threat model. To validate our proposal we have developed code to create a Web Service test scenario utilising readily available J2ME, Java Card, J2SE and J2EE platforms, Web Services tools from Apache, the KTool- Bar emulator from Sun, and the JCOPS suite of tools for Java Card applet development.
View Independent Gait Identification Using a Particle Filter
Authors: Mitsuharu Emoto, Akira Hayashi, Nobuo Suematsu, Kazunori Iwata
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

We challenge the human identification problem from the perspective of gait and body shape. Conventional methods depend on the camera viewing direction, and since they are based on matching image silhouettes or features their identification accuracy is low when there is a big difference between the camera viewing direction of the test and training data. Thus, if a person is walking in an arbitrary direction, they may not be accurately identified. In this paper, we propose a novel method that does not depend on the camera viewing direction. We develop a state space model called a "cyclic motion model" whose state variables are not only the phase of the motions but also the camera viewing direction. We learn model parameters for each candidate person, and represent their walking with the cyclic motion model. To identify a person from the observed image sequence, we first compute the model likelihoods for the sequence using a particle filter that represents a probability distribution by a set of weighted samples, We then identify the person from model likelihoods.
Switching control for multi-scroll chaos generation: an overview
Authors: Jinhu Lu, Xinghuo Yu, Guanrong Chen
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

This paper reviews and meanwhile introduces several new switching piecewise-linear controllers, which can generate multi-scroll chaotic attractors from some simple two-dimensional (2D) or three-dimensional (3D) linear autonomous systems. The mechanism for generating multi-scroll chaotic attractors via switching control is discussed.
Anything You Want to Ask About Software Reliability Engineering
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

The panel was a repeat of a panel we have had at every ISSRE since ISSRE97 (of course, the content was different). There were no presentations, only questions. The audience was invited to ask questions on anything: theory, details of application, research needed, solutions to problems on development projects, research issues.