ppxscal/embedding_network huggingface dataset:
Study on Reverse Logistics Based on Supply Chain Management
Authors: Chenghua Shi, Zhanping Hou, Junhu Ruan
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The paper firstly described the significance of implementing reverse logistics, then analyzed the difficulties of implementing of reverse logistics from the external and internal conditions of supply chains, and, lastly, proposed the countermeasures for the implementation of reverse logistics management from the perspective of SCM.
Brief paper: Adaptive control of robot contact tasks with on-line learning of planar surfaces
Authors: Yiannis Karayiannidis, Zoe Doulgeri
Venue: Automatica (Journal of IFAC) (2009)

In robot constrained motion problems on planar surfaces with frictional contacts, uncertainties on the contacted surface not only affect the control system performance but also distort control targets. The surface normal direction cosines are in this case uncertain parameters that are involved in both the control law and the control targets. This work proposes an adaptive learning controller that uses force and joint position/velocity measurements to simultaneously learn the surface orientation and achieve the desired goal. Simulation examples for a 6 dof robot are used to illustrate the theoretical results and the performance of the proposed controller in practical cases.
The Improved Nonsingularity on the Scaled Factor Circulant Matrices
Authors: Xuetting Liu, Peiyu Wei
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Circulant matrices are one of the most important and active research field of applied mathematic and computation mathematic increasingly . Scaled factor circulant matrices have applied in numerical computation, signal processing, coding theory and oil investigation in recent years, and so on. In this paper, motivated by [1] and [6], we give some discriminations by using only the elements in the first row of the scaled factor circulant matrix in the diagonal matrix on non singularity, and give an example at last.
A Method for Rough Relational Database Transformed into Relational Database
Authors: Ling-ling Wei, Wei Zhang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

It is decomposed the data of rough relational database and transformed into relational database according to the characteristic of rough relational database and relational database and in virtue of multiplication principle and Descartes of basic operation of relational algebra. Then deleted redundant data and optimized RDB. Finally, it is designed translation arithmetic and applied in soil example, then proved the arithmetic validity.
An information layout method for an optical see-through head mounted display focusing on the viewability
Authors: Kohei Tanaka, Yasue Kishino, Masakazu Miyamae, Tsutomu Terada, Shojiro Nishio
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

Accessing information when we are on the move is a key feature if mobile computing environments, and using an optical see-through head mounted display (HMD) is one of the most suitable ways to do this. Although the HMD can display information without interfering with the user’s view, when the sight behind the display is too complex or too bright, the information displayed can bee very difficult to see. To solve this problem, we have created a way of laying out information for the optical see-through HMD. The ideal area for displaying information is determined by evaluating the sight image behind the HMD captured by a pantoscopic camera mounted on it. Moreover, if there is no suitable area for displaying information, our method select involves using the sight image around users use to the ideal direction and instructing them to face the direction. Our method displays information to ideal areas.
Choosing an optimal architecture for segmentation and POS-tagging of modern Hebrew
Authors: Roy Bar-Haim, Khalil Sima'an, Yoad Winter
Venue: Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages (2005)

A major architectural decision in designing a disambiguation model for segmentation and Part-of-Speech (POS) tagging in Semitic languages concerns the choice of the input-output terminal symbols over which the probability distributions are defined. In this paper we develop a segmenter and a tagger for Hebrew based on Hidden Markov Models (HMMs). We start out from a morphological analyzer and a very small morphologically annotated corpus. We show that a model whose terminal symbols are word segments (=morphemes), is advantageous over a word-level model for the task of POS tagging. However, for segmentation alone, the morpheme-level model has no significant advantage over the word-level model. Error analysis shows that both models are not adequate for resolving a common type of segmentation ambiguity in Hebrew -- whether or not a word in a written text is prefixed by a definiteness marker. Hence, we propose a morpheme-level model where the definiteness morpheme is treated as a possible feature of morpheme terminals. This model exhibits the best overall performance, both in POS tagging and in segmentation. Despite the small size of the annotated corpus available for Hebrew, the results achieved using our best model are on par with recent results on Modern Standard Arabic.
Interval valued $$(\in,\in\!\vee\,q)$$-fuzzy filters of pseudo BL-algebras
Authors: Jianming Zhan, Wies&#x0142;aw A. Dudek, Young Bae Jun
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued $$(\in,\in\!\vee\,q)$$-fuzzy filters of pseudo BL-algebras and investigate some of their related properties. Some characterization theorems of these generalized interval valued fuzzy filters are derived. The relationship among these generalized interval valued fuzzy filters of pseudo BL-algebras is considered. Finally, we consider the concept of implication-based interval valued fuzzy implicative filters of pseudo BL-algebras, in particular, the implication operators in Lukasiewicz system of continuous-valued logic are discussed.
A Minimized Assumption Generation Method for Component-Based Software Verification
Authors: Pham Ngoc Hung, Toshiaki Aoki, Takuya Katayama
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

An assume-guarantee verification method has been recognized as a promising approach to verify component-based software with model checking. The method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. This method allows us to decompose a verification target into components so that we can model check each of them separately. In this method, assumptions which are environments of the components are generated. The number of states of the assumptions should be minimized because the computational cost of model checking is influenced by that number. Thus, we propose a method for generating minimal assumptions for the assume-guarantee verification of component-based software. The key idea of this method is finding the minimal assumptions in the search spaces of the candidate assumptions. These assumptions are seen as the environments needed for the components to satisfy a property and for the rest of the system to be satisfied. The minimal assumptions generated by the proposed method can be used to recheck the whole system at much lower computational cost. We have implemented a tool for generating the minimal assumptions. Experimental results are also presented and discussed.
The Research of 3PLs Provider Selection Based on Rough Set and PSO
Authors: Jie Zhang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In this paper, according to the characteristics of the third-party logistics (3PLs) provider selection, we put forward a new method for third-party logistics provider selection. A new evaluation model with Rough set and particle swarm optimization(PSO) neural network is founded based on the comprehensive evaluation index system of 3PL provider selection environment, A neural network model to the problem is trained by particle swarm optimization technique, which is a new adaptive algorithm based on a social-psychological metaphor. Rough Set is introduced to reduce numbers of evaluation indicators, thus reducing the dimensions of the input space of neural network model, when treating the reduced data as the input space of neural network model, we find that both the convergence speed and the evaluation accuracy are enhanced in comparison with the traditional neural network model.
A Stereo Depth Recovery Method Using Layered Representation of the Scene
Authors: Tarkan Aydin, Yusuf Sinan Akgul
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Recent progresses in stereo research imply that performance of the disparity estimation depends on the discontinuity localization in the disparity space which is generally predicated on discontinuities in the image intensities. However, these approaches have known limitations at highly textured and occluded regions. In this paper, we propose to employ a layered representation of the scene as an approximation of the scene structure. The layered representation of the scenes was obtained by using partially focused image set of the scene. Although self occlusions are still present in real aperture imaging systems, our approach does not suffer from the occlusion problems as much as stereo and focus/defocus based methods. Our disparity estimation method is based on synchronously optimized two interdependent processes which are regularized with a nonlinear diffusion operator. The amount of diffusion between the neighbors is adjusted adaptively according to information in the layered scene representation and temporal positions of the processes. The system is initialization insensitive and very robust against local minima. In addition, it accurately handles the depth discontinuities. The performance of the presented method has been verified through experiments on real and synthetic scenes.
Improving the Relevance of Search Results: Search-term Disambiguation and Ontological Filtering
Authors: Dengya Zhu
Venue:  (2009)

Synonymy & polysemy of natural languages together with information overload are two main factors that affect the relevance of Web hits. When users submit a query, search engines usually return a long list of hits with syntactic similarity. Users are confronted with choosing a needle from a haystack ? relevant items from long lists of hits. This book proposes an improved strategy for increasing the relevance of Web search results via search term disambiguation and ontological filtering. Results are classified into an ontology, such as Open Directory Project. Semantic characteristics of ontology categories are represented by a category-document and similarities of this and search results are evaluated using a Vector Space Model. Users choose a category to obtain only the search results classified under the selected category. Experimental data show the approach boosts the Web hits precision by more than 20%. The book should help shed some light on Web searching and word sense disambiguation, and should be useful to students and researchers in the fields of information retrieval, text classification, and data mining; or anyone else interested in Web searching. 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
An Axiomatic Approach to Hyperconnectivity
Authors: Michael H. Wilkinson
Venue: Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing (2009)

In this paper the notion of hyperconnectivity, first put forward by Serra as an extension of the notion of connectivity is explored theoretically. Hyperconnectivity operators, which are the hyperconnected equivalents of connectivity openings are defined, which supports both hyperconnected reconstruction and attribute filters. The new axiomatics yield insight into the relationship between hyperconnectivity and structural morphology. The latter turns out to be a special case of the former, which means a continuum of filters between connected and structural exists, all of which falls into the category of hyperconnected filters.
Topological mapping with weak sensory data
Authors: Gregory Dudek, Dimitri Marinakis
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a vertex, and can assign a cyclic ordering to the edges leaving a vertex with reference to the edge it arrived from. Given this limited sensing capability, and without the use of any markers or additional information, we will show that the construction of a topological map is still feasible. This is accomplished through both the exploration strategy which is designed to reveal model inconsistencies and by a search process that maintains a bounded set of believable world models throughout the exploration process. Plausible models are selected through the use of a ranking heuristic function based on the principle of Occam's Razor. We conclude with numerical simulations demonstrating the performance of the algorithm.
Interpretation of compound nominalisations using corpus and web statistics
Authors: Jeremy Nicholson, Timothy Baldwin
Venue: Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties (2006)

We present two novel paraphrase tests for automatically predicting the inherent semantic relation of a given compound nominalisation as one of subject, direct object, or prepositional object. We compare these to the usual verb-argument paraphrase test using corpus statistics, and frequencies obtained by scraping the Google search engine interface. We also implemented a more robust statistical measure than maximum likelihood estimation --- the confidence interval. A significant reduction in data sparseness was achieved, but this alone is insufficient to provide a substantial performance improvement.
Brief paper: Control under quantization, saturation and delay: An LMI approach
Authors: Emilia Fridman, Michel Dambrine
Venue: Automatica (Journal of IFAC) (2009)

This paper studies quantized and delayed state-feedback control of linear systems with given constant bounds on the quantization error and on the time-varying delay. The quantizer is supposed to be saturated. We consider two types of quantizations: quantized control input and quantized state. The controller is designed with the following property: all the states of the closed-loop system starting from a neighborhood of the origin exponentially converge to some bounded region (both, in R^n and in some infinite-dimensional state space). Under suitable conditions the attractive region is inside the initial one. We propose decomposition of the quantization into a sum of a saturation and of a uniformly bounded (by the quantization error bound) disturbance. A Linear Matrix Inequalities (LMIs) approach via Lyapunov-Krasovskii method originating in the earlier work [Fridman, E., Dambrine, M., & Yeganefar, N. (2008). On input-to-state stability of systems with time-delay: A matrix inequalities approach. Automatica, 44, 2364-2369] is extended to the case of saturated quantizer and of quantized state and is based on the simplified and improved Lyapunov-Krasovskii technique.
A DHT Key-Value Storage System with Carrier Grade Performance
Authors: Guangyu Shi, Jian Chen, Hao Gong, Lingyuan Fan, Haiqiang Xue, Qingming Lu, Liang Liang
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The Peer-to-Peer (P2P) technology being widely adopted in today's both academic research and practical service providing, has many potential advantages and achieves a great success in Information Technology scope. Recently some researchers have proposed that P2P inspired architecture also might be one choice for the telecom network evolution. Most of such works adopted structured P2P (DHT) as the basic solutions, but they seldom discussed how to eliminate the huge gap between the telecom underlay performance requirement and the performance of existed DHT which mainly originated from the Internet applications. This paper presents the design and implementation of SandStone, a DHT based key-value storage system with carrier grade performance, such as good scalability, strong consistency and high reliability, which could be deployed as the cornerstone in such new P2P inspired networking architectures.
Incremental local linear fuzzy classifier in fisher space
Authors: Armin Eftekhari, Hamid Abrishami Moghaddam, Mohamad Forouzanfar, Javad Alirezaie
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Optimizing the antecedent part of neurofuzzy system is an active research topic, for which different approaches have been developed. However, current approaches typically suffer from high computational complexity or lack of ability to extract knowledge from a given set of training data. In this paper, we introduce a novel incremental training algorithm for the class of neurofuzzy systems that are structured based on local linear classifiers. Linear discriminant analysis is utilized to transform the data into a space in which linear discriminancy of training samples is maximized. The neurofuzzy classifier is then built in the transformed space, starting from the simplest form (a global linear classifier). If the overall performance of the classifier was not satisfactory, it would be iteratively refined by incorporating additional local classifiers. In addition, rule consequent parameters are optimized using a local least square approach. Our refinement strategy is motivated by LOLIMOT, which is a greedy partition algorithm for structure training and has been successfully applied in a number of identification problems. The proposed classifier is compared to several benchmark classifiers on a number of well-known datasets. The results prove the efficacy of the proposed classifier in achieving high performance while incurring low computational effort.
Fixed-Polynomial Size Circuit Bounds
Authors: Lance Fortnow, Rahul Santhanam, Ryan Williams
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

In 1982, Kannan showed that $\Sigma^\P_2$ does not have $n^k$-sized circuits for any $k$. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan's result, we still cannot prove that $\P^\NP$ does not have linear size circuits. Work of Aaronson and Wigderson provides strong evidence -- the ``algebrization'' barrier -- that current techniques have inherent limitations in this respect. We explore questions about fixed-polynomial size circuit lower bounds around and beyond the algebrization barrier. We find several connections, including \begin{itemize} \item The following are equivalent: \begin{itemize} \item $\NP$ is in $\SIZE(n^k)$ (has $O(n^k)$-size circuit families) for some $k$ \item For each $c$, $\P^{\NP[n^c]}$ is in $\SIZE(n^k)$ for some $k$ \item $\ONP/1$ is in $\SIZE(n^k)$ for some $k$, where $\ONP$ is the class of languages accepted {\it obliviously} by $\NP$ machines, with witnesses for ``yes'' instances depending only on the input length. \end{itemize} \item For a large number of natural classes ${\cal C}$ and all $k \geq 1$, ${\cal C}$ is in $\SIZE(n^k)$ if and only if ${\cal C}/1\cap\P/\poly$ is in $\SIZE(n^k)$. \item If there is a $d$ such that $\MATIME(n) \subseteq \NTIME(n^d)$, then $\P^{\NP}$ does not have $O(n^k)$ size circuits for any $k > 0$. \item One cannot show $n^2$-size circuit lower bounds for $\oplus \P$ without new nonrelativizing techniques. In particular, the proof that $\PP \not\subseteq \SIZE(n^k)$ for all $k$ relies on the (relativizing) result that $\P^{\PP} \subseteq \MA \Longrightarrow \PP \not\subseteq \SIZE(n^k)$, and we give an oracle relative to which $\P^{\oplus \P} \subseteq \MA$ and $\oplus \P \subseteq \SIZE(n^2)$ both hold. \end{itemize}
Referring to displays in multimodal interfaces
Authors: Daqing He, Graeme Ritchie, John Lee
Venue: Referring Phenomena in a Multimedia Context and their Computational Treatment (1997)

A system which displays information graphically, and also allows natural language queries, should allow these queries to interrogate the displayed (visual) information. Ideally this would use some uniform method for processing queries both about the display and about the world model. Such a system would have to cope with ambiguities introduced by these two sources of information. These ambiguities, and a preliminary proposal for a system to deal with it, are the main topics of this paper.
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
Authors: Marco Gavanelli, Marco Alberti, Evelina Lamma
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP constraints. These two frameworks have been merged in works by various authors, who developed efficient abductive proof-procedures empowered with constraint satisfaction techniques. However, while almost all CLP languages provide algorithms for finding an optimal solution with respect to some objective function (and not just any solution), the issue has received little attention in ALP.In this paper we show how optimisation meta-predicates can be included in abductive proof-procedures, achieving in this way a significant improvement to research and practical applications of abductive reasoning.In the paper, we give the declarative and operational semantics of an abductive proof-procedure that encloses constraint optimization meta-predicates, and we prove soundness in the three-valued completion semantics. In the proof-procedure, the abductive logic program can invoke optimisation meta-predicates, which can invoke abductive predicates, in a recursive way.
Considerations for Believable Emotional Facial Expression Animation
Authors: Robin James Stuart Sloan, Malcolm Cook, Brian Robinson
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

Facial expressions can be used to communicate emotional states through the use of universal signifiers within key regions of the face. Psychology research has identified what these signifiers are and how different combinations and variations can be interpreted. Research into expressions has informed animation practice, but as yet very little is known about the movement within and between emotional expressions. A better understanding of sequence, timing, and duration could better inform the production of believable animation. This paper introduces the idea of expression choreography, and how tests of observer perception might enhance our understanding of moving emotional expressions.
Pomset mcfgs
Authors: Michael J. Pan
Venue: Proceedings of the 10th International Conference on Parsing Technologies (2007)

This paper identifies two orthogonal dimensions of context sensitivity, the first being context sensitivity in concurrency and the second being structural context sensitivity. We present an example from natural language which seems to require both types of context sensitivity, and introduce partially ordered multisets (pomsets) mcfgs as a formalism which succintly expresses both.