ppxscal/embedding_network huggingface dataset:
Every Permutation CSP of arity 3 is Approximation Resistant
Authors: Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

A permutation constraint satisfaction problem (permCSP) of arity k is specified by a subset Lambda of permutations on $\{1,2,\dots,k\}$. An instance of such a permCSP consists of a set of variables $V$ and a collection of constraints each of which is an ordered $k$-tuple of $V$. The objective is to find a global ordering $\sigma$ of the variables that maximizes the number of constraint tuples whose ordering (under $\sigma$) follows a permutation in $\Lambda$. This is just the natural extension of constraint satisfaction problems over finite domains (such as Boolean CSPs) to the world of ordering problems. The simplest permCSP corresponds to the case when $\Lambda$ consists of the identity permutation on two variables. This is just the Maximum Acyclic Subgraph (\mas) problem. It was recently shown that the \mas\ problem is Unique-Games hard to approximate within a factor better than the trivial $1/2$ achieved by a random ordering [GMR08]. Building on this work, in this paper we show that for *every* permCSP of arity $3$, beating the random ordering is Unique-Games hard. The result is in fact stronger: we show that for every $\Lambda \subseteq \Pi \subseteq S_3$, given an instance of permCSP$(\Lambda)$ that is almost-satisfiable, it is hard to find an ordering that satisfies more than $\frac{|\Pi|}{6} +\eps$ of the constraints even under the relaxed constraint $\Pi$ (for arbitrary $\eps > 0$). A special case of our result is that the *Betweenness* problem is hard to approximate beyond a factor $1/3$. Interestingly, for *satisfiable* instances of Betweenness, a factor $1/2$ approximation algorithm is known. Thus, every permutation CSP of arity up to $3$ resists approximation beyond the trivial random ordering threshold. In contrast, for Boolean CSPs, there are both approximation resistant and non-trivially approximable CSPs of arity $3$.
A statistical approach for selecting discriminative features of spatial regions of interest
Authors: Despina Kontos, Vasileios Megalooikonomou, Vasileios J. Sobel
Venue: Intelligent Data Analysis (2007)

We propose a statistical approach based on a supervised framework for reducing the dimensionality of the feature space when characterizing and classifying spatial Regions of Interest (ROIs). Our approach employs the statistical techniques of Bootstrapping simulation, Bayesian Inference and Markov Chain Monte Carlo (MCMC), to select the most informative features according to their discriminative power across distinct classes of data. This reduces the dimensionality of the initial feature space and also improves the classification of the ROIs, since features providing irrelevant information with respect to class membership are discarded. We also introduce a weighted Euclidean Distance designed to effectively classify the ROIs. We evaluate the proposed technique using experiments that involve synthetic spatial regions and real ROIs extracted from medical images. We demonstrate its effectiveness in classification experiments (using established classifiers) and in similarity searches. We also test its scalability on large datasets. Our approach is comparable with or better than other major competitors. We achieve an accuracy of 87% on classifying ROIs in brain images. These results are an improvement of previously reported classification experiments, and show the effect of reducing the dimensionality of the initial feature space.
An Agent Negotiation Skill Algorithm Based on Interactive Micro-adjustment of Proposal in Electronic Transactions
Authors: Tiejun Gu, Bingyong Tang, Yi Li
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Negotiation strategy is an important research branch of agent-based automatic negotiation. Under the background of bilateral multi-issues negotiation, a novel negotiation skill algorithm by interactive micro-adjustment and multi-rounds approximation is proposed, which classifies both parties’ proposal issues into two divisions --- interest point set and disinterest point set, and combined with the historical experience data conducts in-depth negotiation process according to the composite relationship of both interest level of consistency proposal issues and difference of issue values. At the same time concern degree of opponent about proposal issues is given and updated by a fuzzy theory-based prediction function, which can realize the purpose of learning negotiation opponent. Finally, the application and analysis of the proposed negotiation skill algorithm are demonstrated by a numerical experiment.
Enhancing Web Document Accessibility by Authoring Texts and Text Comprehension Activities
Authors: Grammatiki Tsaganou, Maria Samarakou, Panagiotis Blitsas, Maria Grigoriadou
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In this paper we discuss recent directions concerning the structural analysis of science documents and cognitive aspects of document elements aiming at document comprehension. Structural analysis of documents, according to text comprehension theory, promotes document understanding and enhances universal accessibility of documents. We outline the process of structuring science documents and activities for comprehension using the authoring tool ReTuDiSAuth. This process improves universal accessibility of document supporting authors to structure text and text activities for students with different abilities, requirements and preferences.
Information Fusion is Used to Multiple Direction-Finder
Authors: Jiasong Cheng, Jiren Xu, Tongli Lian, Xingshen Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Position information often achieves by direction-finder multi-stations in practice. Direction-finder multi-station Data processing is an important problem related to the problem that how to use the data correctly. In this paper we calculate the distance matrix, then analyze the relation matrix and determine the best fusion data in different ways. we know that the supported degree applying ellipse curves will enhance fusion result. Meanwhile extremes theory, maximum likelihood method, bayes principle and synthesis sustainability method are used in the paper, and the result approves that these methods are effective, but we should apply them in different condition.
Automatic identification of English verb particle constructions using linguistic features
Authors: Su Nam Kim, Timothy Baldwin
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

This paper presents a method for identifying token instances of verb particle constructions (VPCs) automatically, based on the output of the RASP parser. The proposed method pools together instances of VPCs and verb-PPs from the parser output and uses the sentential context of each such instance to differentiate VPCs from verb-PPs. We show our technique to perform at an F-score of 97.4% at identifying VPCs in Wall Street Journal and Brown Corpus data taken from the Penn Tree-bank.
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
Authors: Adam Meyerson, Brian Tagiku
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We consider adding k shortcut edges (i.e. edges of small fixed length ¿ ¿ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices. We explore several variations of the problem and give O(1)-approximations for each. We also improve the best known approximation ratio for metric k-median with penalties, as many of our approximations depend upon this bound. We give a $(1+2\frac{(p+1)}{\beta(p+1)-1},\beta)$-approximation with runtime exponential in p. If we set β= 1 (to be exact on the number of medians), this matches the best current k-median (without penalties) result.
Prior Information and the Determination of Event Spaces in Probabilistic Information Retrieval Models
Authors: Corrado Boscarino, Arjen P. Vries
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

A mismatch between different event spaces has been used to argue against rank equivalence of classic probabilistic models of information retrieval and language models. We question the effectiveness of this strategy and we argue that a convincing solution should be sought in a correct procedure to design adequate priors for probabilistic reasoning. Acknowledging our solution of the event space issue invites to rethink the relation between probabilistic models, statistics and logic in the context of IR.
Compositional Abstraction for Stochastic Systems
Authors: Joost-Pieter Katoen, Daniel Klink, Martin R. Neuhäußer
Venue: Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems (2009)

We propose to exploit three-valued abstraction to stochastic systems in a compositional way. This combines the strengths of an aggressive state-based abstraction technique with compositional modeling. Applying this principle to interactive Markov chains yields abstract models that combine interval Markov chains and modal transition systems in a natural and orthogonal way. We prove the correctness of our technique for parallel and symmetric composition and show that it yields lower bounds for minimal and upper bounds for maximal timed reachability probabilities.
The Mathematic Method of Membership Conversion from Degree of Coordinates to Degree of Points
Authors: Kai-di Liu, Jin Wang, Yan-jun Pang, Jin Liu, Jun-hu Ruan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

In any multi-indexes uncertainty decisions, if choosing membership function to describe the uncertainty of every space-index value about some status, it must meet membership degree conversion, which must solve the conversion from membership degree of coordinates to membership degree of points. But the present methods affect the credibility of result of decision because of the redundant data. So, by mining knowledge information about points’ classification hidden in membership degree of every coordinates, affirming the relation between points’ classification and membership degree of coordinates; eliminating the redundant data in coordinates’ membership for points’ classification by defining distinguishable weight; constructing the mathematic method of conversion from membership degree of coordinates to membership degree of points without the interference of redundant data, providing method basis for solving key computation in multi-indexes uncertainty decisions.
Pose-Invariant Face Matching Using MRF Energy Minimization Framework
Authors: Shervin Rahimzadeh Arashloo, Josef Kittler
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

A pose-invariant face verification system based on an image matching method is presented. The method uses the normalized energy of the established match between images as a measure of goodness-of-match. The method can tolerate moderate global spatial transformations between the gallery and the test images and alleviates the need for geometric and photometric normalization of facial images. It requires no training on non-frontal face images. A number of innovations, such as a dynamic block size and block shape adaptation, as well as label pruning and error prewhitening measures have been introduced to increase the effectiveness of the approach. The experimental evaluation of the method is performed on the rotation shots of the XM2VTS database and promising results are obtained.
Design and Implementation of Reconfigurable Security Hash Algorithms Based on FPGA
Authors: Miao Li, Jinfu Xu, Xiaohui Yang, Zhifeng Yang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Today, security is a topic which attacks the greatinterest of researchers. Many encryption algorithms have beeninvestigated, and developed in the last years. Hash functionsare important security primitives used for authentication anddata integrity. The reconfigurable cryptographic chip is anintegrated circuit that is designed by means of the method ofreconfigurable architecture, and is used for encryption anddecryption. It can implement many different cipher algorithmsflexibly and quickly, and be used in many fields. This work isrelated to hash functions FPGA implementation. Five differenthash functions SHA-1, SHA-224, SHA-256, SHA-384 andSHA-512 are studied. A reconfigurable architecture isproposed for the implementation of all of them in the samehardware module. Finally, it gives the implementation resultsbased on the FPGA of the family of Stratix II of AlteraCorporation. The proposed system reaches throughput valuesequal to 727.853Mbps for SHA-1, 909.816Mbps for SHA-224/256, and 1.456Gbps for SHA-384/512 respectively.
Stochastic progressive photon mapping
Authors: Toshiya Hachisuka, Henrik Wann Jensen
Venue: ACM Transactions on Graphics (TOG) (2009)

This paper presents a simple extension of progressive photon mapping for simulating global illumination with effects such as depth-of-field, motion blur, and glossy reflections. Progressive photon mapping is a robust global illumination algorithm that can handle complex illumination settings including specular-diffuse-specular paths. The algorithm can compute the correct radiance value at a point in the limit. However, progressive photon mapping is not effective at rendering distributed ray tracing effects, such as depth-of-field, that requires multiple pixel samples in order to compute the correct average radiance value over a region. In this paper, we introduce a new formulation of progressive photon mapping, called stochastic progressive photon mapping, which makes it possible to compute the correct average radiance value for a region. The key idea is to use shared photon statistics within the region rather than isolated photon statistics at a point. The algorithm is easy to implement, and our results demonstrate how it efficiently handles scenes with distributed ray tracing effects, while maintaining the robustness of progressive photon mapping in scenes with complex lighting.
A Generic Approach to Topic Models
Authors: Gregor Heinrich
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

This article contributes a generic model of topic models. To define the problem space, general characteristics for this class of models are derived, which give rise to a representation of topic models as "mixture networks", a domain-specific compact alternative to Bayesian networks. Besides illustrating the interconnection of mixtures in topic models, the benefit of this representation is its straight-forward mapping to inference equations and algorithms, which is shown with the derivation and implementation of a generic Gibbs sampling algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Improved Density Assisted Particle Filtering for Target Tracking in an Asynchronous Wireless Sensor Netwok
Authors: Gong Jigang, Ji Zhongheng, Peng Jianhua
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Target tracking in a wireless sensor network (WSN) has become a relatively standard problem. In an asynchronous WSN, combined estimation of the target state and static clock offsets is necessary as the local clocks of the sensors are misaligned and the corresponding offsets are unknown. In this paper, a new tracking algorithm based on density assisted particle filtering (DAPF) and a sliding window is proposed. The sliding window calculates the reliability of the estimated sensor offsets and decides when to stop estimating them. Simulation results indicate that the improved DAPF algorithm we proposed can achieve high accuracy as standard DAPF but effectively saves the computing cost.
Ontology-Based Requirements Conflicts Analysis in Activity Diagrams
Authors: Chi-Lun Liu
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Requirements conflicts analysis is one of most crucial activities in successful software engineering projects. Activity diagrams are a useful standard for modeling process behaviors of systems. This paper utilizes ontological approach to analyze conflicts in the requirement specifications of activity diagrams. The proposed conflicts analysis method includes a modeling process and a set of conflicts detection rules. Several scenarios of electronic commerce are also provided for demonstrating the validity of the proposed rules. The benefits of the proposed method are threefold: (1) The method provides systematic steps for modeling requirements and ontologies. (2) This method also offers a set of questions for facilitating requirements elicitation about activity diagrams. (3) The proposed rules can systematically assist in requirements conflicts detection. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Link Analysis Application in Personalized E-learning Environment
Authors: Lianhong Ding, Qi Tao, Peng Shi
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Personalized e-learning is a hot research topic. It can obviously improve the learning efficiency. A perfect e-learning system can recommend right learning content for right learner at right time. In order to find profit contents for different users, a network which describes the relationships among learners is constructed first. Then, the learners owning similar learning interests are found by community detection. At last, right contents are recommended to learners by the collaborative filtering method. This paper also proposes a method to introduce one or several persons to help a learner when he/she meets difficulty by link analysis. With our methods, users belonging to one community can share the proper learning contents and a learner can get valid help as well. E-learning systems can further improve their efficiencies through these methods.
Towards Intelligent Interaction in Classroom
Authors: Pengfei Xu, Guanghui Han, Wen Li, Zhongke Wu, Mingquan Zhou
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In classroom environments, complex and valuable communication takes place. To augment and record these communications effectively, various computer-based systems were deigned in the past decade. In fact, with advancements of multimedia technology and interaction technologies, research in this field has already brought some of these systems into regular usage. The main contribution of this paper is to give an overview of the human-computer interaction technologies and approaches used in intelligent classroom systems. Current challenges in intelligent interaction in classroom are also discussed. Improving these interaction techniques has a significant effect on the overall system performance and user experience.
Leveraging Access Locality for the Efficient Use of Multibit Error-Correcting Codes in L2 Cache
Authors: Hongbin Sun, Nanning Zheng, Tong Zhang
Venue: IEEE Transactions on Computers (2009)

It is almost evident that SRAM-based cache memories will be subject to a significant degree of parametric random defects if one wants to leverage the technology scaling to its full extent. Although strong multibit error-correcting codes (ECC) appear to be a natural choice to handle a large number of random defects, investigation of their applications in cache remains largely missing arguably because it is commonly believed that multibit ECC may incur prohibitive performance degradation and silicon/energy cost. By developing a cost-effective L2 cache architecture using multibit ECC, this paper attempts to show that, with appropriate cache architecture design, this common belief may not necessarily hold true for L2 cache. The basic idea is to supplement a conventional L2 cache core with several special-purpose small caches/buffers, which can greatly reduce the silicon cost and minimize the probability of explicitly executing multibit ECC decoding on the cache read critical path, and meanwhile, maintain soft error tolerance. Experiments show that, at the random defect density of 0.5 percent, this design approach can maintain almost the same instruction per cycle (IPC) performance over a wide spectrum of benchmarks compared with ideal defect-free L2 cache, while only incurring less than 3 percent of silicon area overhead and 36 percent power consumption overhead.
Transmission Protocols for Instruction Streams
Authors: J. A. Bergstra, C. A. Middelburg
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

Sequential programs under execution produce behaviours to be controlled by some execution environment. Threads as considered in basic thread algebra model such behaviours: upon each action performed by a thread, a reply from an execution environment --- which takes the action as an instruction to be processed --- determines how the thread proceeds. In this paper, we are concerned with the case where the execution environment is remote: we study some transmission protocols for passing instructions from a thread to a remote execution environment.
Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles
Authors: R. J. Nowakowski, K. Seyffarth
Venue: Graphs and Combinatorics (2009)

We continue the study of small cycle double covers of products of graphs that began in [7], concentrating here on the categorical product and the strong product. Under the assumption that G has an SCDC, we show that G &#x00d7;&#x00a0;P m has an SCDC for all m &#x2260;&#x00a0;3, and that G &#x00d7;&#x00a0;C m has an SCDC for all m &#x2265;&#x00a0;3. For the strong product we use results about the categorical product and the Cartesian product [7] to show that if G has an SCDC, then so does G &#x22a0; C m , m&#x00a0;&#x2265;&#x00a0;5. Some results are also given for G &#x22a0; P m , but require additional assumptions about the SCDC of G.
A Multidimensional Data Model for Analysis of Agricultural Soil Characteristics
Authors: Constanta Zoie Radulescu
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

A multidimensional data model for the analysis of soil properties is built. An analysis of it is performed using OLAP (On-Line Analytical Processing) operations. A risk measure for soil quality assessment (based on the upper partial moment) is introduced in the multidimensional data model.