ppxscal/embedding_network huggingface dataset:
Face alignment based on statistical models and Gabor wavelets
Authors: M.-S. Yu, S.-F. Li
Venue: International Journal of Robotics and Automation (2008)

This paper presents a novel face alignment method for image sequences that integrates Gabor wavelets with the statistical AAM (Active Appearance Model). First, feature points are characterized using Gabor wavelets and can be individually tracked. A disadvantage of this kind of purely feature-based tracking is that errors accumulate and the feature points loose lock on their corresponding features. To overcome this problem, a face affine transform is used to obtain the initial shape of the AAM model. Finally, the AAM is used to impose global constraints upon the local feature points and to produce an exact alignment. Experimental results demonstrate the ability of the proposed algorithm to accurately align and locate facial features.
An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
Authors: Lixin Tang, Yang Yang, Jiyin Liu
Venue: Computers and Operations Research (2010)

This paper studies a coil sequencing problem that arises from electro-galvanizing line in steel industry. The problem is to find a processing sequence of steel coils such that the switching costs between consecutive coils are minimized while satisfying technical restrictions. The problem can be decomposed into several independent sub-problems, each corresponding to a turn which is a sequence of continuously processed coils with the same post-processing requirement. The coils in each turn can be further divided into several families each consisting of the coils with the same width. Based on analysis of the problem properties, a two-phase polynomial algorithm is developed to obtain an optimal turn. The sequence of coils in a family with given boundary coils (first and last coils) is determined in the first phase using a polynomial dynamic programming algorithm. In the second phase, the optimal turn is formed by another polynomial dynamic programming algorithm which takes the boundary coils for each family as state variables. The efficiency of the proposed algorithm is demonstrated through computational experiments.
Twisted p-adic (h,q)-L-functions
Authors: Yilmaz Simsek
Venue: Computers Mathematics with Applications (2010)

By using the q-Volkenborn integral on Z"p, in Simsek (2006) [33] and Simsek (2007) [34], generating functions for the (h,q)-Bernoulli polynomials and numbers were defined. By using these functions, we define a new twisted (h,q)-partial zeta function which interpolates the twisted (h,q)-Bernoulli polynomials and generalized twisted (h,q)-Bernoulli numbers at negative integers. We give a relation between twisted (h,q)-partial zeta functions and the twisted (h,q)-two-variable L-function. We find the value of this function at s=0. We also find the residue of this function at s=1. We construct a p-adic twisted (h,q)-L-function which interpolates the twisted (h,q)-Bernoulli polynomials: L"@x","p","q^(^h^)(1-n,t,@g)=-B"n","@g"""n","@x^(^h^)(p^*t,q)-@g"n(p)p^n^-^1B"n","@g"""n","1^(^h^)(p^-^1p^*t,q^p)n. Furthermore, we construct an integral representation of the twisted (h,q)-two-variable L-function. We give some applications related to the p-adic twisted (h,q)-L-function and the twisted (h,q)-Bernoulli polynomials.
A Partition-Based Approach for XPath Testing
Authors: Claudio de la Riva, Jose Garcia-Fanjul, Javier Tuya
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

The XML language is becoming the preferred means of data interchange and representation in web based applications. Usually, XML data is stored in XML repositories, which can be accessed efficiently using the standard XPath as query language. However, the specific techniques for testing these queries often ignore the functional testing. This work addresses this problem by introducing a technique based on the category-partition method for the systematic design of test input data for an XPath query. The method permits the automatic identification of categories and choices in the XPath and XML Schema implementations and the construction of constraints in order to obtain complete and valid test cases. The technique is illustrated over a practical example.
One-way Authentication Protocol to Mobile Node in MIPv6
Authors: Hoon Ko, Seonho Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Recently there are a number of problems with security in the internet when mobile IP environment is using. There are tampering unlawfully, overhearing, identity camouflage, re-transmission and etc what are the serious minatory factors in internet communication. Confidentiality, integrity and authentication service is one of the most important information protection service among these minatory factors. Hereupon in this thesis an effective and fast authentication method be proposed by proposing a one-way authentication for a mobile host in mobile environment.
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Authors: Shuicheng Yan, Dong Xu Benyu Zhang Hong-Jiang Zhang, Qiang Yang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called Marginal Fisher Analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional Linear Discriminant Analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions.
On document relevance and lexical cohesion between query terms
Authors: Olga Vechtomova, Murat Karamuftuoglu, Stephen E. Robertson
Venue: Information Processing and Management: an International Journal (2006)

Lexical cohesion is a property of text, achieved through lexical-semantic relations between words in text. Most information retrieval systems make use of lexical relations in text only to a limited extent. In this paper we empirically investigate whether the degree of lexical cohesion between the contexts of query terms' occurrences in a document is related to its relevance to the query. Lexical cohesion between distinct query terms in a document is estimated on the basis of the lexical-semantic relations (repetition, synonymy, hyponymy and sibling) that exist between there collocates - words that co-occur with them in the same windows of text. Experiments suggest significant differences between the lexical cohesion in relevant and non-relevant document sets exist. A document ranking method based on lexical cohesion shows some performance improvements.
Impact of Bluetooth MAC layer on the performance of TCP traffic: Research Articles
Authors: Jelena Mišić, Ka Lok Chan, Vojislav B. Mišić
Venue: Wireless Communications Mobile Computing (2006)

Recent updates of the Bluetooth specification have introduced significant changes in the Bluetooth protocol stack, including optional flow control. When the Bluetooth piconet is used to carry TCP traffic, complex interactions between TCP congestion control mechanisms and data link layer controls of Bluetooth will occur. In this paper, we model the performance of the piconet with TCP traffic, expressed through segment loss probability, round-trip time, and goodput, through both probabilistic analysis and discrete-event simulations. We show that satisfactory performance for TCP traffic may be obtained through proper dimensioning of the Bluetooth architecture parameters. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Fuzzy Linguistic Approach to Matchmaking in E-Commerce
Authors: Ananta Charan Ojha, Sateesh Kumar Pradhan
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Searching and comparing products satisfying buyer's preferences is one of the essential activities in ecommerce. It is difficult when product space is large and multiple criteria on the product features are to be considered. Furthermore, the matchmaking becomes a challenging problem if buyer's preferences are fuzzy. In this paper, we present a linguistic approach to compare and rank products based on fuzzy preferences, thus making e-commerce more pleasurable for both the buyer and the seller in a marketplace. Our experimental results show the approach approximates human reasoning and is very encouraging.
Di-algebraic semantics of logics
Authors: A. Mani
Venue: Fundamenta Informaticae (2005)

In [22] the problem of the logics corresponding to topological quasi-boolean algebras [27, 1] has been recently solved by the present author. The semantics provided involved convex amalgams of boolean algebras with additional total and partial operations. Canonical extensions of the structure was also investigated. In the present research, this semantics is generalized to a wide class of logics including distributive logics. It is also shown that the semantics is a proper generalization of the general theory of algebraizable logics due to Blok-Pigozzi [5] and Czelakowski [7].
Supporting Decentralized, Security Focused Dynamic Virtual Organizations across the Grid
Authors: R. O. Sinnott, D. W. Chadwick, J. Koetsier, O. Otenko, J. Watt, T. A. Nguyen
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The ability to dynamically create and subsequently manage secure virtual organisations (VO) is one of the key challenges facing the Grid community. Existing approaches for establishing and managing VOs typically suffer from lack of fine grained security since they largely focus on public key infrastructures with statically defined access control lists, or they are based upon a centralised site for storage of VO specific security information. What is really needed is a federated model of security where sites are able to manage their own security information for their own institutional members, delegating where necessary to trusted local or remote entities, as well as defining and enforcing authorisation policies for their own resources. In this paper we present tools that support such capabilities and highlight how they have been applied to dynamically create and manage security focused VOs in the education domain. We believe that this federated VO security model for fine grained access to Grid services and resources should be the future model upon which security focused Grids are based.
Bayesian Communication under Rough Sets Information
Authors: Takashi Matsuhisa
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

A Bayesian communication in the p-belief system is presented which leads to a Nash equilibrium of a strategic form game through messages as a Bayesian updating process. In the communication process each player is an expectations maximiser, and he/she predicts the other players' actions under his/her private information with the conditional probability at least his/her belief. Each player communicates privately his/her conjecture through message according to the communication graph, where the player receiving the message learns and revises his/her conjecture. We show that the players' conjectures regarding the future beliefs converge to a mixed strategy Nash equilibrium of a game in the long run communication. The emphasis is on that each player predicts the others' actions under his/her private information consisting of rough sets.
Bridging the Gap - Towards a Graphical Modeling Language for Learning Designs and Collaboration Scripts of Various Granularities
Authors: Andreas Harrer, Nils Malzahn
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Learning Processes in technology enhanced learning are utilized at very different granularity. This is especially striking in the field of Collaboration Scripts, where we find both the description of whole scenarios as well as very specific procedures for acquiring knowledge of a skill under the same term: a CSCL script (Computer Supported Collaborative Learning). This poses the problem that CSCL scripts are perceived very differently in the literature and that they are consequently represented very heterogeneously. The conceptual and computational integration of these different levels of granularity has been elaborated on only marginally up to now. In this contribution we present our conclusions on the properties a representational system should have to overcomes the gap between the different levels of learning processes. After a discussion and comparison of different notations for process modelling, both educational and technical approaches, we establish a uniform representation technique for the description of various levels of granularity. This will result in less effort for the designers of learning activities and provides the opportunity to combine scripts of the different levels opening up a large potential of supporting students in their learning processes much more flexibly. This is demonstrated in a practical example of combining CSCL scripts of macro and micro level.
The role of PASTA in network measurement
Authors: Francçois Baccelli, Sridhar Machiraju, Darryl Veitch, Jean C. Bolot
Venue: ACM SIGCOMM Computer Communication Review (2006)

Poisson Arrivals See Time Averages (PASTA) is a well known property applicable to many stochastic systems. In active probing, PASTA is invoked to justify the sending of probe packets (or trains) at Poisson times in a variety of contexts. However, due to the diversity of aims and analysis techniques used in active probing, the benefits of Poisson based measurement, and the utility and role of PASTA, are unclear. Using a combination of rigorous results and carefully constructed examples and counter-examples, we map out the issues involved, and argue that PASTA is of very limited use in active probing. In particular, Poisson probes are not unique in their ability to sample without bias. Furthermore, PASTA ignores the issue of estimation variance, and the central need for an inversion phase to estimate the quantity of interest ased on what is directly observable. We give concrete examples of when Poisson probes should not be used, and explain why, and offer initial guidelines on suitable alternative sending processes.
Recognition of Off-Line Handwritten Arabic Words Using Neural Network
Authors: Somaya Alma'adeed
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Neural network (NN) have been used with some success in recognizing printed Arabic words. In this paper, a complete scheme for unconstrained Arabic handwritten word recognition based on a Neural network is proposed and discussed. The overall engine of this combination of a global feature scheme with a NN, is a system able to classify Arabic-Handwritten words of one hundred different writers. The system first attempts to remove some of the variation in the images that do not affect the identity of the handwritten word. Next, the system codes the skeleton and edge of the word so that feature information about the strokes in the skeleton is extracted. Then, a classification process based on the artificial NN classifier is used as global recognition engine, to classify the Arabic words. The output is a word in the dictionary. A detailed experiment is carried out, and successful recognition results are reported.
On-demand computation of policy based routes for large-scale network simulation
Authors: Michael Liljenstam, David M. Nicol
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not require representation of routing dynamics. However, policy based routes, as used at the interdomain level of the Internet through the BGP protocol, are significantly more difficult to compute on-demand than shortest path intradomain routes due to the semantics of policy based routing and the possibility of routing divergence. We exploit recent theoretical results on BGP routing convergence and measurement results on typical use of BGP routing policies to formulate a model of typical use and an algorithm for on-demand computation of routes that is guaranteed to terminate and produces the same routes as BGP. We show empirically that this scheme can reduce memory usage by orders of magnitude and simultaneously reduce the route computation time compared to a detailed model of the BGP protocol.
Qualitative Verification of Multi-Agents Reactive Decisional System Using Business Process Modeling Notation
Authors: Mohammed Berrada, Bouchaib Bounabat, Mostafa Harti
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

A Reactive system is one that is in continual interaction with its environment, and executes at a pace determined by that environment. Due to their complex nature, reactive systems are extremely difficult to specify and validate. In this paper, we propose a new formal model for verification of such systems using Business Process Modeling Notation (BPMN). This approach considers a Reactive System as a Reactive Multi-Agent System consisting of concurrent reactive agents that cooperate with each other to achieve the desired functionality. BPMN is used as a verification tool in order to verify the systems behaviors.
Modeling Organisational Frameworks for Integrated E-Learning: The Experience of the TrustDR Project
Authors: John Casey, Jackie Proven, David Dripps
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper discusses the need for a way to model the organisational frameworks required to integrate elearning into institutions and the potential benefits of doing so. A shareable and adaptable general-purpose model of integrated e-learning is introduced based on recent research. An example of the model being applied is given in a real-life context: the TrustDR project funded by the JISC (Joint Information Services Committee), which is examining practical ways of introducing digital rights management (DRM) systems into the UK educational sector for learning object repositories. Finally, some ideas for further development are presented.
Examining DCSP coordination tradeoffs
Authors: Michael Benisch, Norman Sadeh
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally proposed two different sets of approaches for solving DCSPs, backtracking based approaches, such as Asynchronous Backtracking (ABT), and mediation based approaches, such as Asynchronous Partial Overlay (APO). These sets of approaches differ in the levels of coordination employed during conflict resolution. While the computational and communication complexity of the backtracking based approaches is well understood, the tradeoffs in complexity involved in moving toward mediation based approaches are not. In this paper we comprehensively reexamine the space of mediation based approaches for DCSP and fill gaps in existing frameworks with new strategies. We present different mediation session selection rules, including a rule that favors smaller mediation sessions, and different mediation strategies, including a decentralized hybrid strategy based on ABT. We present empirical results on solvable 3-coloring and random binary DCSP problems, that accurately capture the computational and communication tradeoffs between ABT and various mediation based approaches. Our results confirm that under some circumstances the newly presented strategies dominate previously proposed techniques.
Surface Geometric Constraints for Stereo in Belief Propagation
Authors: Gang Li, Steven W. Zucker
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Belief propagation has been shown to be a powerful inference mechanism for stereo correspondence. However the classical formulation of belief propagation implicitly imposes the frontal parallel plane assumption in the compatibility matrix for exploiting contextual information, since the priors perfer no depth (disparity) change in surrounding neighborhoods. This results in systematic errors for slanted or curved surfaces. To eliminate these errors we propose to use contextual information geometrically, and show how to encode surface differential geometric properties in the compatibility matrix for stereo correspondence. This enforces consistency for both depth and surface normal, extending the traditional formulation beyond consistency for (constant) depth. With such geometric contextual information, the belief propagation algorithm shows dramatic improvement on generic non-frontal parallel scenes. Several such examples are provided.
Neural Networks Applied to Gait Control of Physically Based Simulated Robots
Authors: Milton Roberto Heinen, Fernando Santos Osorio
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

This paper describes our experiments with autonomous robots, in which we use neural networks to generate and control stable gaits of simulated legged robots into a physically based simulation environment. In our approach, the gait is accomplished using an Elman network trained using a gradient descend method, more specifically, the RPROP algorithm, a improvement of the traditional Back-propagation. The model validation was performed by several experiments realized with a simulated four legged robot using the ODE physical simulation engine. The results showed that it is possible to generate stable gaits using neural networks in an efficient manner.