ppxscal/embedding_network huggingface dataset:
Multi-face Location on Embedded DSP Image Processing System
Authors: Linsheng Li, Yongliang Zhang, Qichuan Tian
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

This paper is devoted to the problem of Multi-face localization on embedded DSP image processing system. The application of face localization is becoming important in machine vision, systems video monitoring and security access system. Skin color acts as an important cue for segmentation, localization and tracking of face. We capture face image on DSP image processing system and build a skin-color model for face detection using the three components original data on YUV color space. Combining the character of the embedded DSP image processing system, a multi-face locating method based on the improved connected components labeling algorithm is presented in this paper. The experimental results show that the proposed approach not only has the features of high speed and high efficiency, but also has the ability to locate human faces regardless of the size, number, orientation and viewpoint of the faces. It can still get an ideal location effect in the inadequate lighting complicated background.
Identification of MIMO Hammerstein Models Using Support Vector Machine
Authors: Hua Liang, Bolin Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

The least squares support vector machines (LS-SVMs) regression is presented for the purpose of nonlinear dynamic system identification. LS-SVMs are used for system identification of Hammerstein models with memoryless nonlinear blocks and linear dynamical blocks. LS-SVMs achieves higher generalization performance than a hybrid neural network (HNN) which consist of a multi-layer feed-forward neural network (MFNN) in cascade with a linear neural network (LNN). The identification procedure is illustrated using two simulated examples. The results indicate that this approach is effective even in the case of additive noise to the system.
Atanassov's Intuitionistic Fuzzy Sets as a Classification Model
Authors: J. Montero, D. Gómez, H. Bustince
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In this paper we show that Atanassov's Intuitionistic Fuzzy sets can be viewed as a classification model, that can be generalized in order to take into account more classes than the three classes considered by Atanassov's (membership, non-membership and non-determinacy). This approach will imply, on one hand, to change the meaning of these classes, so each one will have a positive definition. On the other hand, this approach implies the possibility of a direct generalization for alternative logics and additional valuation states, being consistent with Atanassov's focuss. From this approach we shall stress the absence of any structure within those three valuation states in Atanassov's model. In particular, we consider this is the main cause of the dispute about Atanassov's model: acknowledging that the name intuitionistic is not appropriate, once we consider that a crisp direct graph is defined in the valuation space, formal differences with other three-state models will appear.
A Query-Sensitive Graph-Based Sentence Ranking Algorithm for Query-Oriented Multi-document Summarization
Authors: Furu Wei, Yanxiang He, Wenjie Li, Qin Lu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Graph-based models and ranking algorithms have been drawn considerable attentions from the document summarization community in the recent years. However, in regard to query-oriented summarization, the influence of the query has been limited to the sentence nodes in the previous graph models. We argue that other than the sentence nodes the sentence-sentence edges should also be measured in accordance with the given query. In this paper, we develop a query-sensitive similarity measure that incorporates the query influence into the evaluation of sentence-sentence edges for graph-based query-oriented summarization. Furthermore, in order to cope with the multi-document summarization task, we explicitly distinguish the inter-document sentence relations from the intra-document sentence relations and emphasize the influence of global information from the document set on local sentence evaluation. Experimental results on DUC 2005 dataset are quite promising and motivate us to further investigate query-sensitive similarity measures.
Personalized Recommendation Service System in E-Learning Using Web Intelligence
Authors: Xinye Li, Qi Luo, Jinsha Yuan
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Personalized education is a very hot topic in distant research. To realize personalized E-learning, a personalized recommendation service system was proposed and realized. Web technologies of personality and adaptive filtering were applied in the system. The structure of system, workflow and key technologies of realizing feature selection module, user interest module, personalized teaching resources filtering module were introduced in the paper.
Labelled Clauses
Authors: Tal Lev-Ami, Christoph Weidenbach, Thomas Reps, Mooly Sagiv
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies a variety of deduction modes. These include different strategies such as set of support, as well as explicit case analysis, e.g., splitting. From a practical perspective, labelled clauses offer advantages in the case of related proof obligations resulting from multiple conjectures over the same axiom set or from a single conjecture that is a large conjunction. Here we can share clauses (e.g., the axioms and clauses deduced from them, share Skolem symbols), share deduced clause variants, and transfer lemmas between the different obligations. Motivated by software verification, we have created a prototype implementation of labelled clauses that supports multiple conjectures, and we provide convincing experiments for the benefits.
Relation Identification between Name Entities Based on Community Structure Mining
Authors: Gang Li, Huijuan Hu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The co-occurrence of the name entities in sentences and documents usually implies some important relationships among them. This paper addresses relation extraction problem and proposes an unsupervised method of automatic discovering relations among entities based on community structure mining. After distilling all named entities pairs, a network is constructed to represent the semantic relationship among name entity pairs and a mining strategy is employed to adaptively analyze the network and detect the different relation communities. Finally, each community is labeled by an indicative word. Experiments show that our method performs well on both high-frequent and less frequent entity pairs, at the same time appropriate labels could be automatically provided for the relations.
Face Pose Estimation and Synthesis by 2D Morphable Model
Authors: Li Yingchun, Su Guangda
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In this paper, we present face pose estimate and multi-pose synthesis technique. Through combining composite principal component analysis (CPCA) of the shape feature and texture feature respectively in eigenspace, we can get new eigenvectors to represent the human face pose. Support vector machine (SVM) has the optimal hyperplane that the expected classification error for unseen test samples is minimized. We utilize CPCA-SVM technology to get face pose discrimination. As for pose synthesis, the face shape model and the texture model are established through statistical learning. Using these two models and Delaunay triangular, we can match a face image with parameter vectors, the shape model, and the texture model. The synthesized image contains much more personal details, which improve its reality. Accurate pose discrimination and multi-pose synthesis helps to get optimal face and improve recognition rate.
Domain-Specific IR for German, English and Russian Languages
Authors: Claire Fautsch, Ljiljana Dolamic, Samir Abdou, Jacques Savoy
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

In participating in this domain-specific track, our first objective is to propose and evaluate a light stemmer for the Russian language. Our second objective is to measure the relative merit of various search engines used for the German and to a lesser extent the English languages. To do so we evaluated the tf ·idf, Okapi, IR models derived from the Divergence from Randomness (DFR) paradigm, and also a language model (LM). For the Russian language, we find that word-based indexing using our light stemming procedure results in better retrieval effectiveness than does the 4-gram indexing strategy (relative difference around 30%). Using the German corpus, we examine certain variations in retrieval effectiveness after applying the specialized thesaurus to automatically enlarge topic descriptions. In this case, the performance variations were relatively small and usually non significant.
Towards General Temporal Aggregation
Authors: Michael H. Böhlen, Johann Gamper, Christian S. Jensen
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

Most database applications manage time-referenced, or temporal, data. Temporal data management is difficult when using conventional database technology, and many contributions have been made for how to better model, store, and query temporal data. Temporal aggregation illustrates well the problems associated with the management of temporal data. Indeed, temporal aggregation is complex and among the most difficult, and thus interesting, temporal functionality to support. This paper presents a general framework for temporal aggregation that accommodates existing kinds of aggregation, and it identifies open challenges within temporal aggregation.
Coupling Atomistic and Continuum Models for Multi-scale Simulations of Gas Flows
Authors: Vladimir Kolobov, Robert Arslanbekov, Alex Vasenkov
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper describes two computational tools linking atomistic and continuum models of gaseous systems. The first one, a Unified Flow Solver (UFS), is based on a direct Boltzmann solver and kinetic CFD schemes. The UFS uses an adaptive mesh and algorithm refinement procedure for automatic decomposition of computational domain into kinetic and continuum parts. The UFS has been used for a variety of flow problems in a wide range of Knudsen and Mach numbers. The second tool is a Multi-Scale Computational Environment (MSCE) integrating CFD tools with Kinetic Monte Carlo (KMC) and Molecular Dynamics (MD). The MSCE was applied for analysis of catalytic growth of vertically aligned carbon nanotubes (CNT) in a C2H2/H2 inductively coupled plasma. The MSCE is capable of predicting paths for delivering carbon onto catalyst/CNT interface, formation of single wall or multi-wall CNTs depending on the shape of catalyst, and transition from nucleation to the steady growth of CNTs.
An Event-Based Approach to Reducing Coupling in Large-Scale Applications
Authors: Bartosz Kowalewski, Marian Bubak, Bartosz Baliś
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Large-scale distributed applications tend to become more and more complex and hard to develop, and execute. Approaches used when building such systems have to be revised, in order to decrease coupling within the code and increase productivity during the development process. Especially event-based programming applied to Web services should gain much attention. In this paper, we present an experimental publish/subscribe infrastructure, which introduces robust event-based mechanisms to be used with Web services-enabled applications. The concept of this solution is built upon the extensibility and configurability principles. We show that performance gap between traditional distributed event-based technologies and the Web also services-based approach is not necessarily as significant as most people tend to think.
Finer Is Better: Abstraction Refinement for Rewriting Approximations
Authors: Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

Term rewriting systems are now commonly used as a modeling language for programs or systems. On those rewriting based models, reachability analysis, i.e. proving or disproving that a given term is reachable from a set of input terms, provides an efficient verification technique. For disproving reachability (i.e. proving non reachability of a term) on non terminating and non confluent rewriting models, Knuth-Bendix completion and other usual rewriting techniques do not apply. Using the tree automaton completion technique, it has been shown that the non reachability of a term t can be shown by computing an over-approximation of the set of reachable terms and prove that t is not in the over-approximation. However, when the term t is in the approximation, nothing can be said.In this paper, we improve this approach as follows: given a term t, we try to compute an over-approximation which does not contain t by using an approximation refinement that we propose. If the approximation refinement fails then t is a reachable term. This semi-algorithm has been prototyped in the Timbuk tool. We present some experiments with this prototype showing the interest of such an approach w.r.t. verification on rewriting models.
Measuring Sequence Similarity Trough Many-to-Many Frequent Correlations
Authors: Gianluigi Greco, Giorgio Terracina
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Comparing pairs of sequences is a problem emerging in several application areas (ranging from molecular biology, to signal processing, text retrieval, and intrusion detection, just to cite a few) and important results have been achieved through the years. In fact, most of the algorithms in the literature rely on the assumption that matching symbols (or at least a substitution schema among them) are known in advance. This paper opens the way to a more involved mechanism for sequence comparison, where determining the best substitution schema is also part of the matching problem. The basic idea is that any symbol of one sequence can be correlated with many symbols of the other sequence, provided each correlation frequently occurs over the various positions. The approach fits a variety of problems difficult to be handled with classical techniques, particularly where strings to be matched are defined over different alphabets.
A Robot Vision System for Collision Avoidance Using a Bio-inspired Algorithm
Authors: Hirotsugu Okuno, Tetsuya Yagi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Locusts have a remarkable ability of visual guidance that includes collision avoidance exploiting the limited nervous networks in their small cephalon. We have designed and tested a real-time intelligent visual system for collision avoidance inspired by the visual nervous system of a locust. The system was implemented with mixed analog-digital integrated circuits consisting of an analog resistive network and field-programmable gate array (FPGA) circuits so as to take advantage of the real-time analog computation and programmable digital processing. The response properties of the system were examined by using simulated movie images, and the system was tested also in real-world situations by loading it on a motorized miniature car. The system was confirmed to respond selectively to colliding objects even in complex real-world situations.
On reduced time fault tolerant paths for multiple UAVs covering a hostile terrain
Authors: Rahul Sawhney, K. Madhava Krishna, Kannan Srinathan, Mahesh Mohan
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We present a method for finding reduced time coverage paths of multiple UAVs (Unmanned Air Vehicles) monitoring a 3D terrain represented as height fields. A novel metric based on per time visibility is used that couples visibility gained at a terrain point with the time spent to reach the point. This coupled metric is utilized to form reduced time paths by maximizing the visibility gained per unit time at every step. We compare the results of this approach with an approach that covers the terrain based on a per distance visibility metric, which reduces the sum, over distances covered by each UAV path. The comparisons show that the current method gives substantially time reduced paths albeit with an expected increase in sum over distances of UAV paths. We also show that time taken to cover the terrain based on the current metric is far less than prevalent methods that try to decompose the terrain based on visibility followed by time or time followed by visibility in a decoupled fashion. The method is further extended to provide for fault tolerance on a hostile terrain. Each terrain point is guaranteed to be seen by at-least one UAV that has not been damaged due to any calamity, shot or otherwise.
Analysis of an education knowledge management website
Authors: Rong-Jyue Fang, Sheng-Jen Yang, Hua-Lin Tsai, Kuo-Cheng Wu
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

For institutional support, the website "Smart Creative teachers net, Sctnet, http://sctnet.edu.tw" was established. It is a network community for teachers to discuss and share instruction knowledge and experiences. SCTNet means smart, creative and teachers. This is a case study. The study attempts to analyze the communication intension of the network platform, and to understand what the educators concern about, and the knowledge management of teachers. Reasearchers select one of the workshops to analyze the discussion board issues and contents. The analysis indicates that there is less creative knowledge, and 42% of discussion didn't care about education. But the unprofessional dialogues stretch the relationship of the wetwork. Additionally, the unprofessional discussion will be treated in the feature.
On the usefulness of opponent modeling: the Kuhn Poker case study
Authors: Alessandro Lazaric, Mario Quaresimale, Marcello Restelli
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state information and, in case of concurrent learners, the environment has non-stationary dynamics. These problems could be partially overcome if the policies followed by the other agents were known, and, for this reason, many approaches try to estimate them through the so-called opponent modeling techniques. Although many researches have been devoted to the study of the accuracy of the estimation of opponents' policies, still little attention has been deserved to understand in which situations these model estimations can be actually useful to improve the agent's performance. This paper presents a preliminary study about the impact of using opponent modeling techniques to learn the solution of a POSG. Our main purpose is to provide a measure of the gain in performance that can be obtained by exploiting information about the policy of other agents, and how this gain is affected by the accuracy of the estimated models. Our analysis focus on a small two-agent POSG: the Kuhn Poker, a simplified version of classical poker. Three cases will be considered according to the agent knowledge about the opponent's policy: no knowledge, perfect knowledge, and imperfect knowledge. The aim is to identify which is the maximum error that can affect the model estimate without leading to a performance lower than that reachable without using opponent-modeling information. Finally, we will show how the results of this analysis can be used to improve the performance of a reinforcement-learning algorithm coped with a simple opponent modeling technique.
Measurement and Influence of the Skin Moisture in Dexterous Manipulation
Authors: Thibaut André, Philippe Lefèvre, Jean-Louis Thonnard
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Frictional properties at the interface finger/object influence forces exerted on the object during dexterous manipulation. Furthermore, the coefficient of friction (CF) of the skin at fingertip is influenced by moisture. In this study, we propose to assess the influence of moisture at fingertip on grip force (GF) during a horizontal pointing task. We developed a specific device to measure the skin hydration (Moisture Evaluator) and we show that the changes in moisture are taken into account by the GF controller.
Model Checking: Back and Forth between Hardware and Software
Authors: Edmund Clarke, Anubhav Gupta, Himanshu Jain, Helmut Veith
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, model checking was first used in hardware verification. The abstraction methods developed for hardware verification however have been a stepping stone for the new generation of software verification tools including SLAM, BLAST, and MAGIC which focus on control-intensive software in C. Most recently, the experience with software verification is providing new leverage for verifying hardware designs in high level languages.
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Authors: Haiming Chen, Lei Chen
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

One-unambiguous regular expressions are used in DTD. It is known that inclusion for one-unambiguous regular expressions is in PTIME. However, there has been no study on algorithms for the inclusion. In this paper we present algorithms for checking inclusion of one-unambiguous regular expressions. A classical way is based on automata, following which one algorithm is provided and improvements are given. The other algorithm is based on derivatives, utilizing a property introduced here that the number of derivatives of a one-unambiguous regular expression is finite. We conducted preliminary experiments by implementing typechecking of XML using the algorithms. The results show that typechecking using the new algorithms is more efficient than the typechecking used for XDuce.