ppxscal/embedding_network huggingface dataset:
Professional Joomla!
Authors: Dan Rahmel
Venue: Programmer To Programmer (2007)

As a major force in the world of affordable, advanced web site deployment, Joomla! has become the most important noncommercial Content Management System (CMS) in the world. The number of Joomla! downloads and add-ons continues to grow at lightning pace, spurring the need for a resource that explores the diverse needs of professional Joomla! developers. This book fills that void by covering the two main areas of the Joomla! field--development and deployment--with a focus on the new Joomla! version 1.5 and all the features it provides. Seasoned author Dan Rahmel walks you through the process of creating all three types of Joomla! extensions (modules, components, and plug-ins), explains how best to use Ajax technology, and shows you how to adopt design patterns and incorporate source code control. You'll examine the underlying technologies (PHP, Apache, etc.) that can be tuned to offer the best system performance, and you'll explore interfacing with outside content, Lightweight Directory Access Protocol (LDAP) setup, and much more. You'll even delve into the internal structure of the Joomla! framework, and obtain a unique behind-the-scenes education so that you can modify and extend Joomla! to meet the needs of you and your customers. What you will learn from this book * How each server of a Joomla! system can be installed and configured for maximum performance * The process of creating a module from scratch * Ways to use Ajax to add dynamic data retrieval to Joomla! * Techniques for using design patterns to solve common programming problems * How to create and retain a virtual community * Procedures for tuning a Joomla! site for both Search Engine Optimization (SEO) and Search Engine Management (SEM) Who this book is for This book is for web developers, hobbyists, web designers, bloggers, corporate content creators, and support specialists who are looking to build a more robust web site. Basic skills in the area of PHP programming are necessary. Wrox Professional guides are planned and written by working programmers to meet the real-world needs of programmers, developers, and IT professionals. Focused and relevant, they address the issues technology professionals face every day. They provide examples, practical solutions, and expert education in new technologies, all designed to help programmers do a better job. 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
Semantic image annotation via hierarchical classification
Authors: Nicolas Tsapatsoulis, Klimis Ntalianis
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this paper we address some of the issues commonly encountered in automatic image annotation systems such as simultaneous labeling with keywords corresponding to both abstract terms and object classes, multiple keyword assignment, and low accuracy of labeling due to concurrent categorization to multiple classes. We propose a hierarchical classification scheme which is based on predefined XML-dictionaries of tree form. Every node of such a tree defines a particular classification task while the childs of the node correspond to classification categories. The winning class (subnode) defines the subsequent classification task and the process continues until the leafs of the tree are reached. The final classification task is performed at image segment level; that is every image segment is assigned a particular keyword corresponding to a tree leaf. The path followed from the root of the XML tree to the leafs along with the union of labels assigned to the image segments compose the list of annotation keywords for the input image.
Scaffolds for Lecture Comprehension: Video-Jigsaw and Stop-and-Think Using a Video System
Authors: Hajime Shirouzu, Naomi Miyake
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

In this study, we propose two kinds of scaffolds for helping university students to comprehend and learn from lectures. Learning from lectures has to be an active process, where learners need to decompose the linear input into components as factual evidence and claims and integrate them to form a coherent comprehension. In order to support this, we expanded two previously established scaffolds on text comprehension, stop-and-think and the jigsaw method, to be used on lecture video clips. The scaffolds are implemented on a video system for easier collaborative reflection. In a series of design studies comparing three classes using these methods, we have found that the stop-and-think on video clips helped the students to explicate the factual evidence embedded in the lecture and the lecturer's claims, and the video-jigsaw encouraged them to integrate such components. We conclude the paper with implications for further CSCL study on learning from lectures.
View Discovery in OLAP Databases through Statistical Combinatorial Optimization
Authors: Cliff Joslyn, John Burke, Terence Critchlow, Nick Hengartner, Emilie Hogan
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

The capability of OLAP database software systems to handle data complexity comes at a high price for analysts, presenting them a combinatorially vast space of views of a relational database. We respond to the need to deploy technologies sufficient to allow users to guide themselves to areas of local structure by casting the space of "views" of an OLAP database as a combinatorial object of all projections and subsets, and "view discovery" as an search process over that lattice. We equip the view lattice with statistical information theoretical measures sufficient to support a combinatorial optimization process. We outline "hop-chaining" as a particular view discovery algorithm over this object, wherein users are guided across a permutation of the dimensions by searching for successive two-dimensional views, pushing seen dimensions into an increasingly large background filter in a "spiraling" search process. We illustrate this work in the context of data cubes recording summary statistics for radiation portal monitors at US ports.
Discrete event system modeling of demand responsive transportation systems operating in real time
Authors: Ali Yalcin
Venue:  (2008)

Demand responsive transportation is a variable route service of passengers or freight from specific origin(s) to destination(s) in response to the request of users. Operational planning of DRT system encompasses the methods to provide efficient service to the passengers and to the system operators. These methods cover the assignments of vehicles to transportation requests and vehicle routings under various constraints such as environmental conditions, traffic and service limitations. Advances in the information and communication technologies, such as the Internet, mobile communication devices, GIS, GPS, Intelligent Transportation Systems have led to a significantly complex and highly dynamical decision making environment. Recent approaches to DRT operational planning are based on &ldquo;closed information loop&rdquo; to achieve a higher level of automation, increased flexibility and efficiency. Intelligent and effective use of the available information in such a complex decision making environment requires the application of formal modeling and control approaches, which are robust, modular and computationally efficient. In this study, DRT systems are modeled as Discrete Event Systems using Finite Automata formalism and DRT real time control is addressed using Supervisory Control Theory. Two application scenarios are considered; the first is based on air-charter service and illustrates uncontrolled system model and operational specification synthesis. The automatic synthesis of centralized and modular supervisors is demonstrated. The second scenario is a mission critical application based on emergency evacuation problem. Decentralized supervisory control architecture suitable for accommodating the real-time contingencies is presented. Conditions for parallel computation of local supervisors are specified and the computational advantages of alternative supervisory control architectures are discussed. Discrete event system modeling and supervisory control theory are well established and powerful mathematical tools. In this dissertation, they are shown to be suitable for expressing the modeling and control requirements of complex and dynamic applications in DRT. The modeling and control approaches described herein, coupled with the mature body of research literature in Discrete Event Systems and Supervisory Control Theory, facilitate logical analysis of these complex systems and provide the necessary framework for development of intelligent decision making tools for real time operational planning and control in a broad range of DRT applications.
Reasoning about motion patterns
Authors: Björn Gottfried
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)

In order to analyse motion patterns for the purpose of making predictions and to explain the behaviour of systems methods are required for dealing with them. Difficulties in verbalising motion patterns for the purpose of communicating spatiotemporal situations, or in order to index spatiotemporal databases, indicate the importance of means which are simple to handle by human users. This paper proposes a set of sixteen atomic motion patterns which form the basis of a relation algebra. The relations are coarse but crisp, they allow imprecise knowledge about motion patterns to be dealt with, and they are easily accessible from the point of view of the user.
Deciding service composition and substitutability using extended operating guidelines
Authors: Christian Stahl, Karsten Wolf
Venue: Data Knowledge Engineering (2009)

We study the correct interaction between services using the following notion for correctness: there is no deadlock in the interaction of the services, and a given set of activities is not dead, that is, each activity in this set is executed in at least one run. The second condition has not been studied before. An operating guideline of a service P is an operational characterization of all deadlock-free interacting partners of P. In this paper, we present an extension of the concept of an operating guideline to characterize all correctly interacting partners of a service P. This extension can be used for answering at least the following two questions. First, given a service R, does R interact correctly with P? Second, given a service P^', can P be substituted by P^', that is, is every correctly interacting partner of P a correctly interacting partner of P^', too?
Epidemic Spreading with Variant Infection Rates on Scale-Free Network
Authors: Liu Hong, Min Ouyang, Zijun Mao, Xueguang Chen
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

In this paper, we proposed a susceptible-infected model with variant infection rates because different individuals have different resistance to diseases in different periods of real epidemic events. We consider two cases: Case 1, we know every individual's infection rate to a kind of epidemic, satisfy a type of distribution. Case 2, assume all individuals have same initial infection rates, a susceptible individual's infection rate will be less than the initial rate if he is not infected after limited number of contacts with infected ones. For both two cases, at the time tD, preventive and control measures bring into effects, every individual's infection rate would decrease. We implemented this models on scale-free networks, and found that the epidemic process before the time tD in Case 1 is almost the same as that in Standard SI model if the infection rate in Standard SI model equals the mean infection rate in Case 1. Furthermore, using numerical simulation, we analysis the effects of the parameter tD, and find the bimodal distribution of final infection rates. Finally, we conclude what we get in this paper and give our future direction.
Dynamic Capacity Management with Substitution
Authors: Robert A. Shumsky, Fuqiang Zhang
Venue: Operations Research (2009)

We examine a multiperiod capacity allocation model with upgrading. There are multiple product types, corresponding to multiple classes of demand, and the firm purchases capacity of each product before the first period. Within each period, after demand arrives, products are allocated to customers. Customers who arrive to find that their product has been depleted can be upgraded by at most one level. We show that the optimal allocation policy is a simple two-step algorithm: First, use any available capacity to satisfy same-class demand, and then upgrade customers until capacity reaches a protection limit, so that in the second step the higher-level capacity is rationed. We show that these results hold both when all capacity is salvaged at the end of the last demand period as well as when capacity can be replenished (in the latter case, an order-up-to policy is optimal for replenishment). Although finding the optimal protection limits is computationally intensive, we describe bounds for the optimal protection limits that take little effort to compute and can be used to effectively solve large problems. Using these heuristics, we examine numerically the relative value of strictly optimal capacity and dynamic rationing, the value of perfect demand information, and the impact of demand and economic parameters on the value of optimal substitution.
Power in normative systems
Authors: Thomas Ågotnes, Wiebe van der Hoek, Moshe Tennenholtz, Michael Wooldridge
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Power indices such as the Banzhaf index were originally developed within voting theory in an attempt to rigorously characterise the influence that a voter is able to wield in a particular voting game. In this paper, we show how such power indices can be applied to understanding the relative importance of agents when we attempt to devise a coordination mechanism using the paradigm of social laws, or normative systems. Understanding how pivotal an agent is with respect to the success of a particular social law is of benefit when designing such social laws: we might typically aim to ensure that power is distributed evenly amongst the agents in a system, to avoid bottlenecks or single points of failure. After formally defining the framework and illustrating the role of power indices in it, we investigate the complexity of computing these indices, showing that the characteristic complexity result is #P-completeness. We then investigate cases where computing indices is computationally easy.
Uncertainties in adversarial patrol
Authors: Noa Agmon, Sarit Kraus, Gal A. Kaminka
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this work, we study the problem of multi-robot perimeter patrol in adversarial environments, under uncertainty. In this problem, the robots patrol around a closed area, where their goal is to patrol in a way that maximizes their chances of detecting an adversary trying to penetrate into the area. Uncertainties may rise in different aspects in this domain, and herein our focus is twofold. First, uncertainty in the robots' sensing capabilities, and second uncertainty of the adversary's knowledge of the patrol's weak points. In this work we provide an initial discussion and initial results concerning these two aspects of uncertainty in the multi-robot perimeter patrol problem. Specifically, we first consider the case in which the robots have realistic sensors, and thus they are imperfect. These sensors cannot always detect the adversary even if it close to the robot, and their detection capability changes with their range. We then deal with different possible choices of penetration spots by the adversary, and discuss possible optimal solutions for the patrolling robots in each such case.
Data fusion for improved situational understanding
Authors: Ambareen Siraj
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Situational understanding is a difficult problem in cybersecurity where the challenge lies in effective integration of evidence reported by multiple sources or sensors monitoring cyberspace. While sensor diversity contributes to better coverage of attack space, it makes analysis of diverse data more difficult. Our work employs a possibilistic approach to intelligent fusion of data from multiple sources to better understand security situation of information systems. This paper summarizes our previous work in this area and presents goal of our ongoing work.
A framework for incremental construction of real global smart space applications
Authors: René Meier, Anthony Harrington, Kai Beckmann, Vinny Cahill
Venue: Pervasive and Mobile Computing (2009)

This article describes a standardised way to build context-aware global smart space applications using information that is distributed across independent (legacy, sensor-enabled, and embedded) systems by exploiting the overlapping spatial and temporal attributes of the information maintained by these systems. The framework supports a spatial programming model based on a topographical approach to modelling space that enables systems to independently define and use potentially overlapping spatial context in a consistent manner and in contrast to topological approaches, in which geographical relationships between objects are described explicitly. This approach is supported by an extensible data model that implicitly captures the relationships between information provided by separate underlying systems and facilitates the incremental construction of global smart spaces since the underlying systems to be incorporated are largely decoupled. The framework has been evaluated using a prototype that integrates legacy systems and context-aware services for multi-modal urban journey planning and for visualising traffic congestion.
Discovering regression data quality through clustering methods
Authors: Dario Malchiodi, Simone Bassis, Lorenzo Valerio
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

We propose the use of clustering methods in order to discover the quality of each element in a training set to be subsequently fed to a regression algorithm. The paper shows that these methods, used in combination with regression algorithms taking into account the additional information conveyed by this kind of quality, allow the attainment of higher performances than those obtained through standard techniques.
Brief paper: Robust guaranteed cost control for uncertain stochastic systems with multiple decision makers
Authors: Hiroaki Mukaidani
Venue: Automatica (Journal of IFAC) (2009)

The guaranteed cost control (GCC) problem for uncertain stochastic systems with N decision makers is investigated. It is noteworthy that the necessary conditions, which are determined from Karush-Kuhn-Tucker (KKT) conditions, for the existence of a guaranteed cost controller have been derived on the basis of the solutions of cross-coupled stochastic algebraic Riccati equations (CSAREs). It is shown that if CSAREs have an optimal solution, then the closed-loop system is exponentially mean square stable (EMSS) and has a cost bound. In order to simplify computations and attain a global optimum, the linear matrix inequality (LMI) technique is also considered. Finally, a numerical example for a practical megawatt-frequency control problem shows that the proposed methods can help in attaining an adequate cost bound. Furthermore, the features of these methods are characterized.
Language and Compiler Support for Hybrid-Parallel Programming on SMP Clusters
Authors: Siegfried Benkner, Viera Sipkova
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

In this paper we present HPF extensions for clusters of SMPs and their implementation within the VFC compiler. The main goal of these extensions is to optimize HPF for clusters of SMPs by enhancing the functionality of the mapping mechanisms and by providing the user with high-level means for controlling key aspects of distributed-memory and shared-memory parallelization. Based on the proposed language extensions, the VFC compiler adopts a hybrid parallelization strategy which closely reflects the hierarchical structure of SMP clusters by exploiting shared-memory parallelism based on OpenMP within nodes and distributed-memory parallelism utilizing MPI across nodes. We describe the language extensions, outline the hybrid parallelization strategy of VFC and present experimental results which show the effectiveness of these techniques.
The refined process structure tree
Authors: Jussi Vanhatalo, Hagen Völzer, Jana Koehler
Venue: Data Knowledge Engineering (2009)

We consider a workflow graph as a model for the control flow of a business process and study the problem of workflow graph parsing, i.e., finding the structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a process modeled in a graph-based language such as BPMN into a process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modular and as fine as possible, where modular means that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. We call it the refined process structure tree. It is based on and extends similar work for sequential programs by Tarjan and Valdes [ACM POPL '80, 1980, pp. 95-105]. We give two independent characterizations of the refined process structure tree which we prove to be equivalent: (1) a simple descriptive characterization that justifies our particular choice of the decomposition and (2) a constructive characterization that allows us to compute the decomposition in linear time. The latter is based on the tree of triconnected components (elsewhere also known as the SPQR tree) of a biconnected graph.