ppxscal/embedding_network huggingface dataset:
Principled Hybrids of Generative and Discriminative Models
Authors: Julia A. Lasserre, Christopher M. Bishop, Thomas P. Minka
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

When labelled training data is plentiful, discriminative techniques are widely used since they give excellent generalization performance. However, for large-scale applications such as object recognition, hand labelling of data is expensive, and there is much interest in semi-supervised techniques based on generative models in which the majority of the training data is unlabelled. Although the generalization performance of generative models can often be improved by 'training them discriminatively', they can then no longer make use of unlabelled data. In an attempt to gain the benefit of both generative and discriminative approaches, heuristic procedure have been proposed [2, 3] which interpolate between these two extremes by taking a convex combination of the generative and discriminative objective functions. In this paper we adopt a new perspective which says that there is only one correct way to train a given model, and that a 'discriminatively trained' generative model is fundamentally a new model [7]. From this viewpoint, generative and discriminative models correspond to specific choices for the prior over parameters. As well as giving a principled interpretation of 'discriminative training', this approach opens door to very general ways of interpolating between generative and discriminative extremes through alternative choices of prior. We illustrate this framework using both synthetic data and a practical example in the domain of multi-class object recognition. Our results show that, when the supply of labelled training data is limited, the optimum performance corresponds to a balance between the purely generative and the purely discriminative.
TCP symbiosis: congestion control mechanisms of TCP based on Lotka-Volterra competition model
Authors: Go Hasegawa, Masayuki Murata
Venue: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems (2006)

In this paper, we propose TCP Symbiosis, which has a robust, self-adaptive and scalable congestion control mechanism for TCP. Our method is quite different from existing approaches. We change the window size of a TCP connection in response to information of the physical and available bandwidths of the end-to-end network path. The bandwidth information is obtained by an inline network measurement technique we have previously developed. Using the bandwidth information we can resolve the inherent problems in existing AIMD/MIMD-based algorithms such as periodic packet loss and unfairness caused by the difference in RTT. We borrow algorithms from biophysics to update the window size: the logistic growth model and the Lotka-Volterra competition model. This is because these models describe changes in the population size of a species that depends on the living environment. The population of a species can be viewed as the window size of a TCP connection and the living environment as the bandwidth of the bottleneck link. The greatest advantage of using these models is that we can refer to previous discussions and results for various characteristics of the mathematical models, including scalability, convergence, fairness and stability in these models. Through mathematical analysis and extensive simulation experiments, we compare the proposed mechanism with traditional TCP Reno, HighSpeed TCP, Scalable TCP and FAST TCP, and exhibit its effectiveness in terms of scalability to the network bandwidth and delay, convergence time, fairness among competing connections, and stability.
Field interactions and distinctive features of development of devices for diagnostics and correction of states of biologically active points
Authors: V. Z. Tydnyuk, L. S. Aleev, N. I. Khodakovskii
Venue: Cybernetics and Systems Analysis (2006)

Based on a model of field interactions of thermochemical potentials, the possibility of correlation between the conductance and other parameters of biologically active points (BAPs) is investigated. New methods are described for diagnostics and correction of physiological systems by mild actions on BAPs. These methods can be taken into account in developing new devices for reflexotherapy.
Tight bounds for k-set agreement with limited-scope failure detectors
Authors: Maurice Herlihy, Lucia Draque Penso
Venue: Distributed Computing (2005)

In a system with limited-scope failure detectors, there are q disjoint clusters of processes such that some correct process in each cluster is never suspected by any process in that cluster. The failure detector class Sx,q satisfies this property all the time, while ♦Sx,q satisfies it eventually. This paper gives the first tight bounds for the k-set agreement task in asynchronous message-passing models augmented with failure detectors from either the Sx,q or ♦Sx,q classes. For Sx,q, we show that any k-set agreement protocol that tolerates f failures must satisfy f < k+x-q if q < k and f < x otherwise, where x is the combined size of the q disjoint clusters if q < k (or the k largest, otherwise). This result establishes for the first time that the protocol of Mostéfaoui and Raynal for the Sx = Sx,1 failure detector is optimal.For ♦Sx,q, we show that any k-set agreement protocol that tolerates f failures must satisfy f < min(n+1/2, k+x-q) if q < k and f < min(n+1/2,x) otherwise, where n + 1 is the total number of processes. We give a novel protocol that matches our lower bound, disproving a conjecture of Mostéfaoui and Raynal for the ♦Sx = ♦Sx,1 failure detector.Our lower bounds exploit techniques borrowed from Combinatorial Topology, demonstrating for the first time that this approach is applicable to models that encompass failure detectors.
Water Wave Animation on Mesh Surfaces
Authors: Shengjun Liu, Xiaogang Jin, Charlie C. L. Wang, Jim X. Chen
Venue: Computing in Science and Engineering (2006)

This article proposes a practical approach for simulating the phenomenon of water waves on 3D mesh surfaces. First of all, the geodesic distance map, which will govern the movement of water waves in the simulation, is computed on a given mesh surface. Based on the geodesic distance map, we then simulate the water waves on 3D surfaces using a sinusoidal wave model with damping. Our computing method for the geodesic distance map can process the scenario with multiple sources. Together with the method for superposing multiple water waves, the water waves with various sources can be simulated on the surface of a given mesh model. To demonstrate the performance of our approach, example animations are generated at the end of the paper--all can be updated in an interactive frame rate.
Regularized discriminant analysis for high dimensional, low sample size data
Authors: Jieping Ye, Tie Wang
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear and Quadratic Discriminant Analysis, called Regularized Discriminant Analysis (RDA), which has been shown to be more flexible in dealing with various class distributions. RDA applies the regularization techniques by employing two regularization parameters, which are chosen to jointly maximize the classification performance. The optimal pair of parameters is commonly estimated via cross-validation from a set of candidate pairs. It is computationally prohibitive for high dimensional data, especially when the candidate set is large, which limits the applications of RDA to low dimensional data.In this paper, a novel algorithm for RDA is presented for high dimensional data. It can estimate the optimal regularization parameters from a large set of parameter candidates efficiently. Experiments on a variety of datasets confirm the claimed theoretical estimate of the efficiency, and also show that, for a properly chosen pair of regularization parameters, RDA performs favorably in classification, in comparison with other existing classification methods.
Distance Trisector Curves in Regular Convex Distance Me
Authors: Tetsuo Asano, David Kirkpatrick
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

Given two points A and B in the plane, we are interested in separating them by two curves CA and CB such that CA is equidistant from A and CB, and CB is equidistant from B and CA. Such curves generalize the familiar notion of a bisector curve, and form the basis of a new kind of Voronoi diagram called a Zone diagram. These curves, which are referred to as distance trisector curves, have been studied in the Euclidean metric where they exist, are unique, and admit efficient approximations. Nevertheless, they have no known expression in terms of elementary functions and are conjectured to be non-algebraic. In this paper, we study distance trisector curves with respect to a parameterized family of distance metrics that provide arbitrarily close approximations to the Euclidean distance. The advantage of studying distance trisectors in this setting is that they have a simple piecewise-linear description and an efficient (exact) construction. We show that distance trisectors defined in this way provide a conceptually simple alternative proof of the existence and uniqueness of Euclidean trisector curves.
Formalizing Class Dynamic Software Updating
Authors: Shi Zhang, LinPeng Huang
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Dynamic software updating enables running programs to be updated while executing. In this paper, a simple formal system is established with the goal of understanding the underlying foundations of updating classes, for the purpose of understanding how to best build reliable updatable programs. The update calculus is built for O-O software with a precise mathematical semantics. It is formulated as an extension of a core calculus for Featherweight Java, and supports updating technology similar to that of the programming language Java and C++. The calculus also presents what kind of update can be made dynamically. At the end of the paper, we proof that these update is type safety.
Research and Implementation on Routing Scheme Based on Interest Mining in Unstructured P2P Systems
Authors: Yihong Tan, Yaping Lin, Zhiping Chen, Ting Dong
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

In the environment of unstructured peer-to-peer (P2P), routing scheme is one of the key factors affecting information searches. A routing scheme based on interest indexical table is proposed in this paper. Moreover, on the basis of it, we implement a P2P full text information retrieval prototype system, Isearch. Firstly, we represent local file content of a peer with vector space model. After that, space vector is clustered to obtain interest class of this peer. And then, interest similar degree is computed among peers to build interest indexical table locally. When search occurs, query requests are forwarded to the peers with similar interest directly according to the interest indexical table. Experimental results show that Isearch doesn't have much influence on retrieval results, but also can reduce the number of query peers so that make routing more efficient.
fMRI of Past Tense Processing: The Effects of Phonological Complexity and Task Difficulty
Authors: Rutvik Desai, Lisa L. Conant, Eric Waldron, Jeffrey R. Binder
Venue: Journal of Cognitive Neuroscience (2006)

The generation of regular and irregular past tense verbs has been an important issue in cognitive science and has been used to advance different models of the organization of language in the brain. The dual-system view holds that the regular past tense forms are generated by a rule while irregular forms are retrieved from memory. The single-system view, on the other hand, holds that both forms are generated by a single integrated system and differ only in their reliance on factors such as phonology and semantics. We conducted an event-related fMRI study to examine the activation patterns associated with the generation and reading of regular and irregular past tense forms, in addition to the reading of their stems. Regular and irregular past tense generation activated similar brain regions compared to the reading of their respective stems. The areas activated more for irregular generation compared to regular generation included inferior frontal, precentral, and parietal regions bilaterally. This activation can be interpreted as ref lecting the greater attentional and response selection demands of irregular generation. Compared to irregular generation, regular generation activated a small region in the left superior temporal gyrus when the regular and irregular past tense forms were mismatched on phonological complexity. No areas were more activated for regulars than irregulars when the past tense forms were matched on this variable. This suggests that the activation specific to regulars was related to the higher phonological complexity of their past tense forms rather than to their generation. A contrast of the reading of regular and irregular past tense forms was consistent with this hypothesis. These results support a single-system account of past tense generation.
Application of Computational Redundancy in Dangling Pointers Detection
Authors: Zakarya Alzamil
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Many programmers manipulate dynamic data improperly, which may produce dynamic memory problems, such as dangling pointer. Dangling pointers can occur when a function returns a pointer to an automatic variable, or when trying to access a deleted object. The existence of dangling pointers causes the programs to behave incorrectly. Dangling pointers are common defect that are easy to commit, but are difficult to discover. In this paper we propose a dynamic approach that detects dangling pointers in computer programs. Redundant computation is an execution of a program statement(s) that does not contribute to the program output. The notion of redundant computation is introduced as a potential indicator of defects in programs. We investigate the application of redundant computation in dangling pointers detection. The results of the initial experiment show that, the redundant computation detection can help the debuggers to localize the source(s) of the dangling pointers. During the experiment, we find that, our approach may be capable of detecting other types of dynamic memory problems such as memory leaks and inaccessible objects, which we plan to investigate in our future research.
On Describing, Analyzing, and Executing Complex Behavior of Services
Authors: Dumitru Roman, Ioan Toma, Dieter Fensel
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

This paper gives a high level overview of a framework for describing, analyzing, and executing complex behavior of services in the context of Service Oriented Computing. Having as a starting point the commonly used patterns in workflow specifications, we propose an extension to incorporate temporal constraints, and a way to root them on a logic for transaction composition (Concurrent Transaction Logic) and on a methodology for modelling systems (Abstract State Machines). We motivate our choices and explain the potential benefits of our framework. Finally, we propose concrete steps for future research in this area.
Integrated scenario-based design method for interactive online teaching system
Authors: Yaohua Yu, Zhengjie Liu
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

With the rapid development of Internet, online teaching is booming and is gradually moving into the daily lives of people. More and more interactive online teaching systems are required. Yet the operational interactive online teaching system design and development methods are fewer. On the foundation of the analytical research on scenario, prototype and the participatory design, this paper presents an integrated scenario-based design method. It combines scenario, prototype and participatory design with the interactive online teaching system design and development process. The main steps of the design method are described in detail. And how to make use of scenario, prototype and participatory design in the design and development process is discussed. This method is very conducive to the interactive online teaching system design and development.
On Organizational Knowledge for MultiAgent System Development
Authors: LI Ai-Ping, Jia Yan, WU Quan-Yuan
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Though there are many projects focusing on multiagent systems, there are only a few focusing on systematic design of large-scale multi-agent system. Electronic commerce is an example of such systems. In this project, we introduce a model and devise an implementation for the large-scale knowledge sharing using Bayesian networks, game theory and network security. The agent model for the system components blends the traditional expert systems' reasoning engine with a multi-layer knowledge base, communication and documentation engines. Electronic Commerce (EC) is a potential application for such a system. EC is viewed as a society of software agents, such as customer, search, catalog, manufacturer, dealer, delivery and banker agents, distributed over the Internet and interact and negotiate with each other.
Semantic Event Detection using Conditional Random Fields
Authors: Tao Wang, Jianguo Li, Qian Diao, Wei Hu, Yimin Zhang, Carole Dulong
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Semantic event detection is an active research field of video mining in recent years. One of the challenging problems is how to effectively model temporal and multi-modality characteristics of video. In this paper, we employ Conditional Random Fields (CRFs) to fuse temporal multi-modality cues for event detection. CRFs are undirected probabilistic models designed for segmenting and labeling sequence data. Compared with traditional SVM and Hidden Markov Models (HMMs), CRFs based event detection offers several particular advantages including the abilities to relax strong independence assumptions in the state transition and avoid a fundamental limitation of directed graphical models. To detect event, we use a three-level framework based on multi-modality fusion and mid-level keywords. The first level extracts audiovisual features, the mid-level detects semantic keywords, and the high-level infers semantic events from multiple keyword sequences. The experimental results from soccer highlights detection demonstrate that CRFs achieves better performance particularly in slice level measure.
An Annotation Framework for a Virtual Learning Portfolio
Authors: Michael Verhaart, Prof. Kinshuk
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

As a person learns, a significant amount of information and knowledge is accumulated, and a challenge faced by both instructors and learners is the ability to maintain a personal portfolio that manages this. Traditionally a variety of physical media such as, photocopies, images, and books were collected and personal observations and annotations were added. As electronic technology has advanced particularly on the internet, this has created some interesting opportunities. Web based portfolio systems fulfill some of the requirements and allow for the acquisition, management and retrieval of the information and knowledge. Once the portfolio has been captured, how can the information and knowledge contained within be extended and updated? This paper describes a framework that can be used to enhance a portfolio that allows both the owner and users to add annotations both in and out of context. A prototype system is described that has been developed to demonstrate the feasibility of such a framework.
Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms
Authors: Derek E. Armstrong, Sheldon H. Jacobson
Venue: Journal of Global Optimization (2006)

A drawback to using local search algorithms to address NP-hard discrete optimization problems is that many neighborhood functions have an exponential number of local optima that are not global optima (termed L-locals). A neighborhood function ¿ is said to be stable if the number of L-locals is polynomial. A stable neighborhood function ensures that the number of L-locals does not grow too large as the instance size increases and results in improved performance for many local search algorithms. This paper studies the complexity of stable neighborhood functions for NP-hard discrete optimization problems by introducing neighborhood transformations. Neighborhood transformations between discrete optimization problems consist of a transformation of problem instances and a corresponding transformation of solutions that preserves the ordering imposed by the objective function values. In this paper, MAX Weighted Boolean SAT (MWBS), MAX Clause Weighted SAT (MCWS), and Zero-One Integer Programming (ZOIP) are shown to be NPO-complete with respect to neighborhood transformations. Therefore, if MWBS, MCWS, or ZOIP has a stable neighborhood function, then every problem in NPO has a stable neighborhood function. These results demonstrate the difficulty of finding effective neighborhood functions for NP-hard discrete optimization problems.
Real-Time Visual SLAM with Resilience to Erratic Motion
Authors: Mark Pupilli, Andrew Calway
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Simultaneous localisation and mapping using a single camera becomes difficult when erratic motions violate predictive motion models. This problem needs to be addressed when visual SLAM algorithms are transferred from robots or mobile vehicles onto hand-held or wearable devices. In this paper we describe a novel SLAM extension to a camera localisation algorithm based on particle filtering which provides resilience to erratic motion. The mapping component is based on auxiliary unscented Kalman filters coupled to the main particle filter via measurement covariances. This coupling allows the system to survive unpredictable motions such as camera shake, and enables a return to full SLAM operation once normal motion resumes. We present results demonstrating the effectiveness of the approach when operating within a desktop environment.
Achieving Transparent Integration of Information, Documents and Processes
Authors: Jingzhi Guo
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

While progress is made in the individual integration of business information, documents and processes, the issue of how to vertically integrate these individually integrated results needs to be resolved. This paper proposes a novel TRANSCODE approach to the issue. The approach represents business information, business documents and business processes in three TRANSCODE Structures, which are then implemented, conceptualized and reified in an integrated and flexible 3-layer TRANSCODE Model.