ppxscal/embedding_network huggingface dataset:
Proceedings of the 3rd international workshop on Adaptive and dependable mobile ubiquitous systems
Venue: ICPS (2009)

Welcome to London and to the 3rd International Workshop on Adaptive and DependAble Mobile Ubiquitous Systems -- ADAMUS'09. Building on the success of the past two years, this edition aims at nurturing the exchange of ideas and lively discussions in order to propose answers to key research questions in this highly interdisciplinary and exciting field. In fact, although adaptability and resilience are widely recognized as fundamental attributes for truly effective mobile and ubiquitous services of today and tomorrow, it is still unclear whether current architectural/technical solutions can satisfy the challenging requirements of new emerging service scenarios, such as mobile commerce, wireless control of robots, healthcare computing, and video-surveillance. It is the ambition of our workshop being able to select valuable contributions in such framework of problems and bring them to the attention of the research and industrial communities. We did our best to achieve that objective also in the current edition. The program of ADAMUS 2009 consists of 5 high-quality papers, covering a variety of topics, including models, algorithms and decision techniques, and engineering aspects of middleware architectures for next generation adaptive and mobile ubiquitous systems. The review process was thorough and selective, conducting to an acceptance rate of 66%. Each paper was selected according to three reviews produced mainly by Program Committee members and for a little percentage by external reviewers. Selected papers come from several countries around the world, with a good balance between academic and industrial research. In addition, the workshop will include a panel among all workshop participants, to discuss the presented topics and to indicate possible future avenues of exploration for this challenging research area.
Distributed Data Reduction through Agent Collaboration
Authors: Ireneusz Czarnowski
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Distributed data mining (DDM) is an important research area. One of the approaches suitable for the DDM is to select relevant local patterns from the distributed databases. Such patterns, often called prototypes, are subsequently merged to create a compact representation of the distributed data repositories. In the paper the local prototype selection is carried out independently at each site where instances and features are selected simultaneously by teams of agents. To assure obtaining homogenous prototypes the feature selection requires collaboration of agents. In the paper two agent collaboration strategies producing a common set of features are proposed and experimentally validated. The paper includes a detailed description of the proposed approach and a discussion of the computational experiment results.
Privacy-Preserving Query Answering in Logic-based Information Systems
Authors: Bernardo Cuenca Grau Ian Horrocks
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other information secret. The privacy guarantees ensure that publishing the new information will not compromise the secret one. We present a framework for describing privacy guarantees that generalises existing probabilistic frameworks in relational databases. We also formulate different flavors of privacy-preserving query answering as novel, purely logic-based reasoning problems and establish general connections between these reasoning problems and the probabilistic privacy guarantees.
Contractor programming
Authors: Gilles Chabert, Luc Jaulin
Venue: Artificial Intelligence (2009)

This paper describes a solver programming method, called contractor programming, that copes with two issues related to constraint processing over the reals. First, continuous constraints involve an inevitable step of solver design. Existing softwares provide an insufficient answer by restricting users to choose among a list of fixed strategies. Our first contribution is to give more freedom in solver design by introducing programming concepts where only configuration parameters were previously available. Programming consists in applying operators (intersection, composition, etc.) on algorithms called contractors that are somehow similar to propagators. Second, many problems with real variables cannot be cast as the search for vectors simultaneously satisfying the set of constraints, but a large variety of different outputs may be demanded from a set of constraints (e.g., a paving with boxes inside and outside of the solution set). These outputs can actually be viewed as the result of different contractors working concurrently on the same search space, with a bisection procedure intervening in case of deadlock. Such algorithms (which are not strictly speaking solvers) will be made easy to build thanks to a new branch & prune system, called paver. Thus, this paper gives a way to deal harmoniously with a larger set of problems while giving a fine control on the solving mechanisms. The contractor formalism and the paver system are the two contributions. The approach is motivated and justified through different cases of study. An implementation of this framework named Quimper is also presented.
Illumination-robust face recognition based on Gabor feature face intrinsic identity PCA model
Authors: Tae In Seol, Sun-Tae Chung, Sunho Ki, Seongwon Cho, Yun-Kwang Hong
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

Robust face recognition under various illumination environments is essential for successful commercialization. Feature-based face recognition relies on a good choice of feature vectors. However, there is no feature vector invariant under illumination changes even though some feature vector such as Gabor feature vector is relatively robust to variations of illumination. Also, illumination normalization techniques cannot eliminate illumination effects completely. In this paper, we propose an illumination-robust face recognition method based on the face Gabor intrinsic identity PCA model. We first analyze face Gabor feature vector space and construct a face Gabor intrinsic identity PCA model which is independent of illumination effects and propose a face recognition method based on it. Through experiments, it is shown that the proposed face recognition based on face Gabor intrinsic identity PCA model performs more reliably under various illuminations and pose environments.
Low voltage chaotic oscillator
Authors: O. Tsakiridis, D. Sklavounos, J. Stonham
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this paper a low voltage Colpitts chaotic oscillator is proposed, based on an Electrically Programmable Analog Device matched Pair Mosfet Array (EPAD). The Oscillator is capable of producing chaotic carriers in very low supply voltages, this feature is very useful in mobile and low power consumption utilities.
Towards an ontology of agency and action From STIT to OntoSTIT+
Authors: Nicolas Troquard, Robert Trypuz, Laure Vieu
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

A variety of disciplines and research areas have separately studied the notions of action, agents and agency, but no integrated and well-developed formal ontology for them is currently available. This paper is a first attempt at bridging this gap, focusing especially on the relationship between agency and action. The departure point is STIT logic, the most expressive among the current logics of agency. Agency is the relationship between an agent and the states of affairs it brings about, without referring to how this is done, i.e., the actions performed. Since ontological investigations are best done in a first-order framework, making explicit at the language level the domain of quantification, we first propose a first-order theory that is proved equivalent to the propositional modal logic STIT. The domain and language of this theory is then extended to cover actions, obtaining the theory we call OntoSTIT+.
The effects of compiler optimisations on embedded system power consumption
Authors: Shuhaizar Daud, R. Badlishah Ahmad, Nukala S. Murthy
Venue: International Journal of Information and Communication Technology (2009)

Power consumption is a subject of serious consideration in embedded systems design because embedded systems are constrained to stringent power and energy requirements. The mission of lowering power consumption and energy usage of such systems is an important task to prolong their usage in real time situations. In this paper, we study the effects of compiler optimisations on embedded systems energy usage and power consumption in real time situations and the importance of running efficient binary codes in realising a more power efficient and better performing embedded system. Compiler optimisations at various levels involving different architectural features have been experimented and it is shown that architecture driven compiler optimisations have a better impact on reducing power consumption and energy usage in embedded system than blind code optimisations.
Annotated Semantics for Nonmonotonic Reasonings in Artificial Intelligence III
Authors: Kazumi Nakamatsu, Atsuyuki Suzuki
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

In this paper, we introduce the annotated semantics for Dressler's nonmonotonic ATMS. We propose a syntactical translation from the Dressler's ATMS into ALPSN(Annotated Logic Program with Strong Negation), and show that the translation preserves their provability and satisfiability, that is to say, if a formula in the ATMS is provable then the translated a-clause is also provable in the corresponding ALPSN. We clarify this relation by showing that there is a one-to-one correspondence between the extension of the original ATMS and the stable model of the translated ALPSN.
Phenomenal Consciousness: Sensorimotor Contingencies and the Constitution of Objects
Authors: Bastian Fischer, Daniel Weiller
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

We justify the need for better accounts of object recognition in artificial and natural intelligent agents and give a critical survey of the computational-postcomputational schism within the sciences of the mind. The enactive, dynamicist account of conscious perception is described as avoiding many problems of cognitivist functionalism, behaviourism, representationalism, emergentism, and dualism. We formalize the basic structure of the enactive, dynamicist theory of phenomenal consciousness and criticize the externalist presupposition of outside-world objects in this kind of theory. As a remedy, we suggest a sensorimotor account of objectual constitution which assigns an epistemic but not necessarily ontic priority to sense data.
Mining Semantic Descriptions of Bioinformatics Web Resources from the Literature
Authors: Hammad Afzal, Robert Stevens, Goran Nenadic
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

A number of projects (myGrid, BioMOBY, etc.) have recently been initiated in order to organise emerging bioinformatics Web Services and provide their semantic descriptions. They typically rely on manual curation efforts. In this paper we focus on a semi-automated approach to mine semantic descriptions from the bioinformatics literature. The method combines terminological processing and dependency parsing of journal articles, and applies information extraction techniques to profile Web services using informative textual passages, related ontological annotations and service descriptors. Service descriptors are terminological phrases reflecting related concepts (e.g. tasks, approaches, data) and/or specific roles (e.g. input/output parameters, etc.) of the associated resource classes (e.g. algorithms, databases, etc.). They can be used to facilitate subsequent manual description of services, but also for providing a semantic synopsis of a service that can be used to locate related services. We present a case-study involving full text articles from the BMC Bioinformatics journal. We illustrate the potential of natural language processing not only for mining descriptions of known services, but also for discovering new services that have been described in the literature.
How efficient is it to communicate customer knowledge with the aid of audio-visual metaphors?
Authors: Mutlaq Alotaibi, Dimitrios Rigas
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

The shift in customer role from a source of revenue to a source of innovation has resulted in an increased demand for a direct interaction with customers, via more advanced and real-time solutions. This may drive organisations to complement Electronic Customer Knowledge Management Systems (E-CKMS) with new interactive multimodal metaphors. There is little known about CKM empirical studies, which investigated whether multimodal metaphors as part of a CKM interface can outperform the text with graphics only metaphors. Thus, this paper describes an investigation about the role of multimodal interaction in improving E-CKMS efficiency compared to text with graphics only metaphors. The examination of this hypothesis was carried out empirically on two E-CKMS experimental platforms (text with graphics only and multimodal) designed for this study. Two independent groups of users (n=20 for each group) evaluated the two interface versions of E-CKMS. Results suggested that the multimodal CKM interface was more efficient than the text with graphics only interface.
A Single Loop EM Algorithm for the Mixture of Experts Architecture
Authors: Yan Yang, Jinwen Ma
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

The mixture of experts (ME) architecture is a powerful neural network model for supervised learning, which contains a number of ``expert''networks plus a gating network. The expectation-maximization (EM) algorithm can be used to learn the parameters of the ME architecture. In fact, there have already existed several methods to implement the EM algorithm, such as the IRLS algorithm, the ECM algorithm, and an approximation to the Newton-Raphson algorithm. The differences among these implementations rely on how to train the gating network, which results in a double-loop training procedure, i.e., there is an inner loop training procedure within the general or outer loop training procedure. In this paper, we propose a least mean square regression method to learn or compute the parameters for the gating network directly, which leads to a single loop (i.e., there is no inner loop training) EM algorithm for the ME architecture. It is demonstrated by the simulation experiments that our proposed EM algorithm outperforms the existing ones on both speed and classification accuracy.
"Mailing it in": email-centric automated assessment
Authors: Joseph A. Sant
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

The automated assessment of student programming assignments is now considered to be in its third generation. Today, these server-based systems use web front-ends and employ sophisticated testing techniques. While automated assessment has proven its benefits over the last 40 years, these systems are simply not feasible for many scenarios because of their infrastructure, support or training requirements. Today's extensible email clients are capable of handling many of the functions performed by these modern assessment systems without requiring extra infrastructure. This paper summarizes experiences using graphical email-clients that were extended to support menu-activated automated processing of a student-submitted program sent as an email message or attachment. The email-client automatically captured the results of the automated assessment in an email window for instructor annotation. This client-based system provides many of the same benefits as those provided by web-based systems.
Towards ubiquitous tourist service coordination and process integration: A collaborative travel agent system architecture with semantic web services
Authors: Dickson K. Chiu, Yves T. Yueh, Ho-Fung Leung, Patrick C. Hung
Venue: Information Systems Frontiers (2009)

With the recent advances in Internet and mobile technologies, there are increasing demands for ubiquitous access to tourist information systems for service coordination and process integration. However, due to disparate tourist information and service resources such as airlines, hotels, tour operators, it is still difficult for tourists to use them effectively during their trips or even in the planning stage. Neither can current tourist portals assist tourists proactively. To overcome this problem, we propose a Collaborative Travel Agent System (CTAS) based on a scalable, flexible, and intelligent Multi-Agent Information System (MAIS) architecture for proactive aids to Internet and mobile users. We also employ Semantic Web technologies for effective organization of information resources and service processes. We formulate our MAIS architecture for CTAS further with agent clusters based on a case study of a large service-oriented travel agency. Agent clusters may comprise several types of agents to achieve the goals involved in the major processes of a tourist's trip. We show how agents can make use of ontology from the Semantic Web to help tourists better plan, understand, and specify their requirements collaboratively with the CTAS. We further illustrate how this can be successfully implemented with Web service technologies to integrate disparate Internet tourist resources. To conclude, we discuss and evaluate our approach from different stakeholders' perspectives.
Heuristic Bidding Strategies for Multiple Heterogeneous Auctions
Authors: David C. K. Yuen, Andrew Byde, Nicholas R. Jennings
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This paper investigates utility maximising bidding heuristics for agents that participate in multiple heterogeneous auctions, in which the auction format and the starting and closing times can be different. Our strategy allows an agent to procure one or more items and to participate in any number of auctions. For this case, forming an optimal bidding strategy by global utility maximisation is computationally intractable, and so we develop two-stage heuristics that first provide reasonable bidding thresholds with simple strategies before deciding which auctions to participate in. The proposed approach leads to an average gain of at least 24% in agent utility over commonly used benchmarks.
Planar maximal covering with ellipses
Authors: Mustafa S. Canbolat, Michael von Massow
Venue: Computers and Industrial Engineering (2009)

We consider a maximal covering location problem on the plane, where the objective is to provide maximal coverage of weighted demand points using a set of ellipses at minimum cost. The problem involves selecting k out of m ellipses. The problem occurs naturally in wireless telecommunications networks as coverage from some transmission towers takes an elliptical shape. A mixed integer nonlinear programming formulation (MINLP) for the problem is presented but MINLP solvers fail to solve it in a reasonable time. We suggest a Simulated Annealing heuristic as an alternate approach for solving the problem. Our computational results employing the heuristic show very good results with efficient processing times. We also discuss an extension to the problem where coverage occurs on a spherical surface and show that it can be solved with the same heuristic.
Object-Oriented Programming with PHP5: Learn to leverage PHP5's OOP features to write manageable applications with ease
Authors: Hasin Hayder
Venue:  (2007)

This book will help you to understand the core object-oriented programming concepts with PHP. PHP is one of the most popular languages for web application development, and PHP5 supports OOP very well. This book will help you to master core OOP features in PHP as well as advanced Topics like Design Patterns including Model-View-Controller (MVC), and Unit Testing. It includes suggestions to help you to write good code. Moreover this book provides comprehensive documentation and working examples on the Standard PHP Library (SPL), which are hard to find elsewhere. It will really help you to leverage PHP's OOP features to write manageable applications with ease. Some basic objected-oriented features were added to PHP3; with PHP5 full support for object-oriented programming was added to PHP. Object-oriented programming was basically introduced to ease the development process as well as reduce the time of development by reducing the amount of code needed. OOP can greatly improve the performance of a properly planned and designed program. This book covers all the general concepts of OOP then shows you how to make use of OOP in PHP5, with the aid of an ample number of examples. General OOP concepts explainedImplement Design Patterns in your applications and solve common OOP ProblemsTake full advantage of native built-in objectsTest your code by writing unit tests with PHPUnit This book explains how to take full advantage of PHP's OOP features in simple language. It contains plentiful examples to help you to understand OOP. From Beginners to Intermediate Users of PHP5 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
Stability of Stochastic Recurrent Neural Networks with Positive Linear Activation Functions
Authors: Wudai Liao, Xuezhao Yang, Zhongsheng Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In view of the character of positive linearity of activation functions of neurons of the recurrent neural networks, the method decomposing the state space to sub-regions is adopted to study almost sure exponential stability on delayed cellular neural networks which are in the noised environment. When perturbed terms in the model of the neural network satisfy Lipschitz condition, some algebraic criteria are obtained. The results obtained in this paper show that if an equilibrium of the neural network is the interior point of a sub-region, and an appropriate matrix related to this equilibrium has some stable degree to stabilize the perturbation, then the equilibrium of the delayed cellular neural network can still remain the property of exponential stability. All results in the paper is only to compute eigenvalues of matrices. All results obtained in this paper include the deterministic neural network as special case.