ppxscal/embedding_network huggingface dataset:
Guaranteed cost control for an overhead crane with practical constraints: Fuzzy descriptor system approach
Authors: Ying-Jen Chen, Wen-June Wang, Chun-Lung Chang
Venue: Engineering Applications of Artificial Intelligence (2009)

This study considers a practical overhead crane control problem of designing a fuzzy control to ensure that the trolley arrives precisely at its destination; the load swing angle approaches to zero, and the energy of input and states is minimized. Furthermore, the constraints for the overhead crane operation are also considered and satisfied. Those constraints are that when the crane is moving, the swing angle has to be small; the swing speed has to be slow, and the moving force is limited. The fuzzy descriptor system is chosen to represent the dynamics of the overhead crane, and a guaranteed cost fuzzy control design is proposed for the fuzzy descriptor system. Moreover, this study also illustrates why the fuzzy descriptor system instead of traditional T-S fuzzy system is selected here as the model of the overhead crane. The simulation results demonstrate the effectiveness of the proposed control design scheme.
Splitting touching cells based on concave points and ellipse fitting
Authors: Xiangzhi Bai, Changming Sun, Fugen Zhou
Venue: Pattern Recognition (2009)

A new touching cells splitting algorithm based on concave points and ellipse fitting is proposed in this paper. The algorithm includes two parts: contour pre-processing and ellipse processing. The purpose of contour pre-processing is to smooth fluctuations of the contour, find concave points of the contour and divide the contour into different segments via the concave points. The purpose of ellipse processing is to process the different segments of the contour into possible single cells by using the properties of the fitted ellipses. Because concave points divide the whole contour of touching cells into different segments and different segments of one single cell have similar properties, the ellipse processing can separate the touching cells through ellipse fitting. This paper demonstrates a new way of using ellipse fitting to split the binary contour of touching cells. Experimental results show that our algorithm is efficient.
Computing and evaluating view-normalized body part trajectories
Authors: Frédéric Jean, Robert Bergevin, Alexandra Branzan Albu
Venue: Image and Vision Computing (2009)

This paper proposes an approach to compute and evaluate view-normalized body part trajectories of pedestrians from monocular video sequences. The proposed approach uses the 2D trajectories of both feet and of the head extracted from the tracked silhouettes. On that basis, it segments the walking trajectory into piecewise linear segments. Finally, a normalization process is applied to head and feet trajectories over each obtained straight walking segment. View normalization makes head and feet trajectories appear as if seen from a fronto-parallel viewpoint. The latter is assumed to be optimal for gait modeling and identification purposes. The proposed approach is fully automatic as it requires neither manual initialization nor camera calibration. An extensive experimental evaluation of the proposed approach confirms the validity of the normalization process.
Component Based Approach for Composing Adaptive Mobile Agents
Authors: Kutila Gunasekera, Arkady Zaslavsky, Shonali Krishnaswamy, Seng Wai Loke
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Mobile software agents are increasingly identified as suitable for developing pervasive applications. This paper presents a novel approach to compose adaptive mobile agents. The proposed agents are context-driven, adaptive, component-based and are able to exchange their capabilities with peer agents. The approach requires a flexible, lightweight and standardized component model. We describe the proposed agent system, issues related to selection of a component model, implementation and future research issues.
Mechanism design and analysis using simulation-based game models
Authors: Michael P. Wellman
Venue:  (2008)

As agent technology matures, it becomes easier to envision electronic marketplaces teeming with autonomous agents. Since agents are explicitly programmed to optimally compete in these marketplaces (within bounds of computational tractability), and markets themselves are designed with specific objectives in mind, tools are necessary for systematic analyses of strategic interactions among autonomous agents. While traditional game-theoretic approaches to the analysis of multi-agent systems can provide much insight, they are often inadequate, as they rely heavily on analytic tractability of the problem at hand; however, even mildly realistic models of electronic marketplaces contain enough complexity to render a fully analytic approach hopeless. To address questions not amenable to traditional theoretical approaches, I develop methods that allow systematic computational analysis of game-theoretic models in which the players' payoff functions are represented using simulations (i.e., simulation-based games). I develop a globally convergent algorithm for Nash equilibrium approximation in infinite simulation-based games, which I instantiate in the context of infinite games of incomplete information. Additionally, I use statistical learning techniques to improve the quality of Nash equilibrium approximation based on data collected from a game simulator. I also derive probabilistic confidence bounds and present convergence results about solutions of finite games modeled using simulations. The former allow an analyst to make statistically-founded statements about results based on game-theoretic simulations, while the latter provide formal justification for approximating game-theoretic solutions using simulation experiments. To address the broader mechanism design problem, I introduce an iterative algorithm for search in the design space, which requires a game solver as a subroutine. As a result, I enable computational mechanism design using simulation-based models of games by availing the designer of a set of solution tools geared specifically towards games modeled using simulations. I apply the developed computational techniques to analyze strategic procurement and answer design questions in a supply-chain simulation, as well as to analyze dynamic bidding strategies in sponsored search auctions. Indeed, the techniques I develop have broad potential applicability beyond electronic marketplaces; they are geared towards any system that features competing strategic players who respond to incentives in a way that can be reasonably predicted via a game-theoretic analysis.
Lyndon + Christoffel = digitally convex
Authors: S. Brlek, J. -O. Lachaud, X. Provençal, C. Reutenauer
Venue: Pattern Recognition (2009)

Discrete geometry redefines notions borrowed from Euclidean geometry creating a need for new algorithmical tools. The notion of convexity does not translate trivially, and detecting if a discrete region of the plane is convex requires a deeper analysis. To the many different approaches of digital convexity, we propose the combinatorics on words point of view, unnoticed until recently in the pattern recognition community. In this paper, we provide first a fast optimal algorithm checking digital convexity of polyominoes coded by their contour word. The result is based on linear time algorithms for both computing the Lyndon factorization of the contour word and the recognition of Christoffel factors that are approximations of digital lines. By avoiding arithmetical computations the algorithm is much simpler to implement and much faster in practice. We also consider the convex hull computation and relate previous work in combinatorics on words with the classical Melkman algorithm.
Conflict management
Authors: Kresimir Popovic, Zeljko Hocenski
Venue: Proceedings of the 2009 ICSE Workshop on Leadership and Management in Software Architecture (2009)

Project managers must learn to recognize the signs and symptoms of disruptive conflict. Such signs would include poor communication among team members, a lack of openness, a lack of respect, unclear requirements, change between managers and employees, broken boundaries of social norms or groups, different backgrounds (educational, economic, cultural, political, etc.). The worst cases can disintegrate into personal stress, burnout, and workplace travesties. Once conflict has reached this stage, it will require a large amount of management time in order to deal with it. This will cause an additional decrease in productivity and efficiency rates, along with the accompanying added costs, risks, and duration delays. If left unmanaged, this type of conflict can even lead to employee sabotage and sometimes workplace violence. This position paper provides insight into qualities and social role that project manager as mediator and leader must possess because sometimes team members can't resolve conflicts collectively.
Electronic structure of memory traps in silicon nitride
Authors: V. A. Gritsenko, S. S. Nekrashevich, V. V. Vasilev, A. V. Shaposhnikov
Venue: Microelectronic Engineering (2009)

From experiments on photoluminescence in Si"3N"4 the polaron energy of 1.4eV was determined. This value is in agreement with the energy of thermal ionization determined from electron and hole transport. Quantum-chemical simulation showed that Si-Si bond is able to capture holes and electrons in Si"3N"4.
Linguistic Knowledge for Search Relevance Improvement
Authors: Gennady Osipov, Ivan Smirnov, Ilya Tikhomirov, Olga Vybornova, Olga Zavjalova
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

The paper presents methods and software implementation for semantically relevant search. We mainly focus on the usage of linguistic knowledge for improvement of semantic relevance in search engines. We state the effectiveness of information retrieval systems based on semantic search involving refined linguistic processing tools. Advantages of semantic search in comparison with traditional search engines are discussed.
Accelarated publication: Chemical modification of carbon nanotube for improvement of field emission property
Authors: Sunwoo Lee, Tetsuji Oda, Paik-Kyun Shin, Boong-Joo Lee
Venue: Microelectronic Engineering (2009)

In the present work, chemical modification of carbon nanotube was proposed for improvement of field emission property. Multi-wall carbon nanotubes (MWCNTs) were grown vertically on silicon substrate using catalytic chemical vapor deposition. Tips of grown MWCNTs were chemically modified using oxygen plasma, nitric acid, and hydrofluoric acid. Surface state and morphology of the chemically modified CNTs were investigated. CNT tips were opened and defects working as trap sites were generated on the CNT surface by the chemical modification process leading to improvement of field emission property. We suggest that two main factors determining the field enhancement factor are geometric factor and surface state of the CNT tips.
Acquiring Unobtrusive Relevance Feedback through Eye-Tracking in Ambient Recommender Systems
Authors: Gustavo González, Beatriz López, Cecilio Angulo, Josep Lluís de la Rosa
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

Acquiring relevant information to keep user's preferences up-to-date is crucial in recommender systems in order to close the cycle of recommendations. Ambient Intelligence is a suitable approach for non-intrusively closing the loop in recommender systems using ambient eye-trackers. We combine a method for acquiring relevance feedback through eye-tracking with the functionalities of an extractor agent. We describe the results of experiments conducted in a recommender system to obtain implicit feedback using eye fixations. Finally, we obtain a ranking of user's most relevant preferences and behaviours.
BlackBerry Enterprise Server for Microsoft Exchange: Installation and Administration
Authors: Dan Renfroe
Venue:  (2007)

This book describes the installation, configuration, and administration of BlackBerry Enterprise Server for Microsoft Exchange, with background information on the BlackBerry architecture, security, and disaster recovery planning. Written by mobile and wireless technology experts, this book provides a straightforward approach to setting up your first BlackBerry Enterprise Server, provisioning users and devices, and implementing administrative techniques. BlackBerry Enterprise Server is a platform that extends corporate messaging and collaboration services to BlackBerry devices, supports management and administration of those devices, and also supports deployment of third-party applications on the BlackBerry device platform. BlackBerry Enterprise Server supports a variety of messaging platforms, including Microsoft Exchange, IBM Lotus Domino, and Novell GroupWise. This book focuses on BlackBerry Enterprise Server for Microsoft Exchange, providing detailed information on planning and implementing a BlackBerry Enterprise Server deployment. The basics of installing BlackBerry Enterprise Server are familiar for most administrators, but the server is infinitely configurable and contains extended administration features. This book contains background information on these features to help you get the most out of your environment, picking up where the manufacturer's documentation leaves off. If you are new to BlackBerry Enterprise Server, this is the perfect guide to help with your planning and deployment. Understand BlackBerry Enterprise Server architectureInstall and configure a BlackBerry Enterprise ServerImplement administrative policies for BlackBerry devicesSecure and plan for disaster recovery of your server The book combines a clear factual information with easy-to-use step-by-step instructions. There are chapters with background information on the architecture and features of the BlackBerry Enterprise Server, and chapters with specific installation and configuration instructions. This combined approach gives you the knowledge to make the best implementation decisions for your environment. 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 empirical study of the factors that reduce the effectiveness of coverage-based fault localization
Authors: Wes Masri, Rawad Abou-Assi, Marwa El-Ghali, Nour Al-Fatairi
Venue: Proceedings of the 2nd International Workshop on Defects in Large Software Systems: Held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2009) (2009)

Coverage-based fault localization techniques typically assign a suspiciousness rank to the statements in a program following an analysis of the coverage of certain types of program elements by the failing and passing runs. The effectiveness of existing techniques has been limited despite the fact that researchers have explored various suspiciousness metrics, ranking strategies, and types of program elements. This work aims at identifying the factors that impair coverage-based fault localization. Specifically, we conducted an empirical study in which we assessed the prevalence of the following scenarios: 1) the condition for failure is met but the program does not fail; 2) the faulty statement is executed but the program does not fail; 3) the failure is correlated with a combination of more than one program element possibly of different types; 4) a large number of program elements occurred in all failing runs but in no passing runs. The study was conducted using 148 seeded versions of ten Java programs which included three releases of NanoXML, and seven programs from the Siemens test suite that were converted to Java. The results showed that most of the above scenarios occur frequently.
Removed Sets Fusion: Performing Off The Shelf
Authors: Julien Hué, Eric Würbel, Odile Papini
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Merging multiple sources of information is a rising subject in artificial intelligence. Most of the proposals are model-based approaches with very high computational complexity, moreover few experimentations are available. This paper proposes a framework for performing Removed Sets Fusion (RSF) of belief bases consisting of prepositional formulae. It then describes the implementation of RSF which stems from Answer Set Programming (ASP) and can be performed with any ASP solver supporting the minimize statement. It finally presents an experimental study and a comparison.
The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory
Authors: Dan Gusfield
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

The Multi-State Perfect Phylogeny Problem is an extension of the Binary Perfect Phylogeny Problem, allowing characters to take on more than two states. In this paper we consider three problems that extend the utility of the multi-state perfect phylogeny model: The Missing Data (MD) Problem where some entries in the input are missing and the question is whether (bounded) values for the missing data can be imputed so that the resulting data has a multi-state perfect phylogeny; The Character-Removal (CR) Problem where we want to minimize the number of characters to remove from the data so that the resulting data has a multi-state perfect phylogeny; and The Missing-Data Character-Removal (MDCR) Problem where the input has missing data and we want to impute values for the missing data to minimize the solution to the resulting Character-Removal Problem.We detail Integer Linear Programming (ILP) solutions to these problems for the special case of three permitted states per character and report on extensive empirical testing of these solutions. Then we develop a general theory to solve the MD problem for an arbitrary number of permitted states, using chordal graph theory and results on minimal triangulation of non-chordal graphs. This establishes new necessary and sufficient conditions for the existence of a perfect phylogeny with (or without) missing data. We implement the general theory using integer linear programming, although other optimization methods are possible. We extensively explore the empirical behavior of the general solution, showing that the methods are very practical for data of size and complexity that is characteristic of many current applications in phylogenetics. Some of the empirical results for the MD problem with an arbitrary number of permitted states are very surprising, suggesting the existence of additional combinatorial structure in multi-state perfect phylogenies.
Mathematical modeling of forest fire initiation
Authors: Valeriy Perminov
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

This paper is devoted a problem of development of a mathematical model for description of heat and mass transfer processes at crown forest fire initiation, taking into account the mutual influence of differences strata of forest. Mathematical model of forest fire was based on an analysis of experimental data and using concept and methods from reactive media mechanics. In the context of the general mathematical model of forest fires, this study gives a new three dimensional mathematical setting and method of numerical solution of a problem of a forest fire modeling. The boundary-value problem is solved numerically using the method of splitting according to physical processes. In this paper the assignment and theoretical investigations of the problems of forest fire initiation are carried out. Fields of temperature, velocity, component mass fractions, and volume fractions of phases were obtained numerically.
Robust control for uncertain nonlinear systems with unknown and changing control direction
Authors: Zaiyue Yang, S. C. P. Yam, L. K. Li, Yiwen Wang
Venue: Proceedings of the 2009 17th Mediterranean Conference on Control and Automation (2009)

This paper studies the robust control problem for uncertain nonlinear systems with unknown and changing control direction. The control direction is the multiplier of the control term, and is allowed to cross zero and change its sign for unlimited number of times. Based on the analysis of system dynamics at the points where the control direction is zero, a robust controller is proposed by integrating with a Nussbaum-type gain. Under the proposed controller, the system converges to zero if zero is accessible, or to the accessible point closest to zero if zero is not accessible by any control. The control performance is illustrated by the simulated example.
Fast detection of specific information in voice signal over internet protocol
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

The world Telecommunications industry caters to both Wireline and Wireless business. In the present Fourth Generation (4G) wireless world rapid change is the only constant factor. The biggest paradigm change being the move from Circuit Switched to Packet Switched technologies. Voice over Packet (VoP) is transforming telephony by rapidly replacing the legacy circuit-switched technology. The VoP technology unites the telephony and data worlds allowing voice, facsimile, and video traffics to be relayed over managed IP networks or corporate intranets around the world. In this paper, various aspects of Voice over Internet Protocol (VoIP) are discussed, including the architecture for the NGMN, challenges, standards and the application areas. In addition a new approach for fast detecting certain information in VOIP is presented. The entire data are collected together in a long vector and then tested as a one input pattern. Proposed fast time delay neural networks (FTDNNs) use cross correlation in the frequency domain between the tested data and the input weights of neural networks. It is proved mathematically and practically that the number of computation steps required for the presented time delay neural networks is less than that needed by conventional time delay neural networks (CTDNNs). Simulation results using MATLAB confirm the theoretical computations.
Design of timeout-based wireless microsensor network protocols: energy and latency considerations
Authors: Wootae Jeong, Shimon Y. Nof
Venue: International Journal of Sensor Networks (2009)

Recent wireless networked sensors revolutionise information gathering and processing for emerging industrial applications. Dynamically managed network topologies and protocols, especially, provide more flexible leverage to the networking applications constrained by limited energy and system latency. For example, increase in number of hops in ad hoc sensor network, in general, can reduce the network energy consumption, but it also increases network latency. In order to reduce the overall network energy consumption and end-to-end response latency, this research proposes a new sensor network protocol based on Timeout-based Information Forwarding (TIF) protocol. The TIF protocol is based on a geometry-specific data forwarding logic with a multi-hop communication method. Communication energy consumption and network latency of the TIF protocol are analysed to provide design guidelines for the emerging sensor network systems. The performance of TIF has been evaluated through specific simulations, applying the Teamwork Integration Evaluator (TIE).