ppxscal/embedding_network huggingface dataset:
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Authors: Tammar Shrot, Yonatan Aumann, Sarit Kraus
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Coalition formation is a key topic in multi--agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encourages resource sharing among agents with different goals. A range of previous studies have found that problems in coalitional games tend to be computationally complex. However, such hardness results consider the entire input as one, ignoring any structural information on the instances. In the case of coalition formation problems, this bundles together several distinct elements of the input, e.g. the agent set, the goal set, the resources, etc. In this paper we reexamine the complexity of coalition formation problems in the coalition resources game model, as a function of their distinct input elements, using the theory of parameterized complexity. The analysis shows that not all parts of the input are created equal, and that many instances of the problem are actually tractable. We show that the problems are FPT in the number of goals, implying that if the number of goals is bounded then an efficient algorithm is available. Similarly, the problems are FPT in the combination of the number of agents and resources, again implying that if these parameters are bounded, then an efficient algorithm is available. On the other hand, the problems are para-NP hard in the number of resources, implying that even if we bound the number of resources the problems (probably) remain hard. Additionally, we show that most problems are W[1]-hard in the size of the coalition of interest, indicating that there is (probably) no algorithm polynomial in all but the coalition size. The exact definitions of the parameterized complexity notions FPT, Para-NP and W[1] are provided herein.
Comparing Abductive Theories
Authors: Katsumi Inoue, Chiaki Sakama
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

This paper introduces two methods for comparing explanation power of different abductive theories. One is comparing for observations, and the other is comparing explanation content for observations. Those two measures are represented by generality relations over abductive theories. The generality relations are naturally related to the notion of abductive equivalence introduced by Inoue and Sakama. We also analyze the computational complexity of these relations.
A finite element model for hygrothermal analysis of masonry walls with FRP reinforcement
Authors: Mehran Khoshbakht, Mark W. Lin, Carl A. Feickert
Venue: Finite Elements in Analysis and Design (2009)

Modeling of moisture migration and heat transfer in fiber reinforced polymer (FRP) composite upgraded masonry structures is of great importance, since the interfacial adhesive between the reinforcing FRP laminate and the host masonry is prone to moisture damages. In this paper, a generic theoretical formulation was first developed to model moisture and heat transport in a layered structure consisting of distinct materials. This formulation was based on the framework of the hygrothermal model presented by Philip and De Vries for a monolithic porous medium. Finite element implementation of the formulation was subsequently used to model moisture and heat transport in an FRP reinforced masonry block. Analytical results were then compared with experimental data to validate the model. Parametric studies were then performed for a concrete block with a reinforcing FRP laminate partially covering one surface. The results showed that changing temperature gradient affects the moisture distribution considerably. This effect was found particularly significant at the concrete/FRP interface where a drastic change in local temperature gradient is present.
Automated aiding strategies for decentralized planning with interdependent policies
Authors: Martin J. Kollingbaum, Joseph Giampapa, Katia Sycara, Timoty J. Norman, Chris Burnett, Daniele Masato
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We discuss how agents can support collaborative planning activities within coalitions, where coalition partners plan and act according to given policies. In a set of experiments with human test subjects, we investigate how agents can aid such a collaborative planning effort and how effective they are in the chosen support modes.
Annotated Semantics for Nonmonotonic Reasonings in Artificial Intelligence IV
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 define an annotated logic AL for NF and CWA based on the set of truth values(annotations) in such a way that the structure is the 4-valued complete lattice(Lattice-4) and each annotation corresponds to each state in logic program derivation. We also propose two kinds of annotated completion formulas, which can be the declarative annotated semantics for NF and CWA as well as Clark's completion. Furthermore, we take a multi-agent system having a contradiction between each agent's world as a simple example and show how the annotated completion deals with such inconsistency.
A Novel Thresholding Approach to Background Subtraction
Authors: Lihao Jia, Yikun Liu
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

We propose a novel thresholding approach based on a new color space model and embed it into background subtraction. This model uses each pixel's color distortion and brightness distortion to detect the changes. The color distortion considers the vector's position in color space so that it can assemble the color features effectively. Moreover, this thresholding method also removes the moving shadow to some extent. By applying it to background subtraction, we get a comparative complete foreground object. For relatively complex background, we are motivated by the hysteresis threshold in Canny edge detection algorithm and introduce dual-threshold into background subtraction. It also achieves robust detection for videos containing complex background. We compare our method with other multi-model techniques, and the test results show the feasibility of the proposed algorithm.
LRTA* Works Much Better with Pessimistic Heuristics
Authors: Aleksander Sadikov, Ivan Bratko
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Recently we showed that under very reasonable conditions, incomplete, real-time search methods like RTA* work better with pessimistic heuristic functions than with optimistic, admissible heuristic functions of equal quality. The use of pessimistic heuristic functions results in higher percentage of correct decisions and in shorter solution lengths. We extend this result to learning RTA* (LRTA*) and demonstrate that the use of pessimistic instead of optimistic (or mixed) heuristic functions of equal quality results in much faster learning process at the cost of just marginally worse quality of converged solutions.
Selective harvesting of regional digital libraries and national metadata aggregators
Authors: Cezary Mazurek, Marcin Mielnicki, Marcin Werla
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

The poster presents the concept, implementation and practical application of the OAI-PMH protocol extension which allows OAI-PMH service providers to dynamically create and harvest sets of items from OAI-PMH data providers. The implementation of the presented concept is based on the encoding of dynamic set specifications in OAI-PMH requests with the CQL language. The extension was developed and widely applied in Poland and now it is used in several projects funded by the European Commission.
Towards comprehensive RRM frameworks for heterogeneous wireless networks
Authors: Abd-Elhamid M. Taha
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

Heterogeneous Wireless Networks (HWNs) challenge traditional arguments for designing Radio Resource Management (RRM) frameworks. Current mechanisms risk underutilization and resource mismanagement. The dynamic nature of user demands in HWNs also calls for RRM modules with controlled operational cost. In this paper, we introduce an RRM framework designed to overcome these challenges of HWNs. In doing so, we elaborate on the motivations and review the status quo in both literature and standardization.
Efficient inclusion for a class of XML types with interleaving and counting
Authors: Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
Venue: Information Systems (2009)

Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleaving and counting can be decided in polynomial time in the presence of two important restrictions: no element appears twice in the same content model, and Kleene star is only applied to disjunctions of single elements. Our approach is based on the transformation of each such content model into a set of constraints that completely characterizes the generated language. We then reduce inclusion checking to constraint implication. We exhibit a quadratic algorithm to perform inclusion checking on a RAM machine.
Computer Algebra 2006: Latest Advances in Symbolic Algorithms Proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006
Authors: Ilias Kotsireas, Eugene Zima
Venue:  (2007)

Written by world-renowned experts, the book is a collection of tutorial presentations and research papers catering to the latest advances in symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. The papers were presented at a workshop celebrating the 60th birthday of Sergei Abramov (Russia), whose highly influential contributions to symbolic methods are adopted in many leading computer algebra systems.
Diversification and Firm Performance: Exploring the Moderating Effects of Information Technology Spending
Authors: T. Ravichandran, Yu Liu, Shu Han, Iftekhar Hasan
Venue: Journal of Management Information Systems (2009)

A large body of research has examined the performance effects of diversification. However, these results have been mixed, and scholars have called for examining contingencies under which the effects of different types (related, unrelated, geographic) and levels of diversification on performance vary. This study attempts to fill this gap in the literature by arguing that examining the performance effects of diversification is incomplete without taking into consideration the firm's information technology (IT) spending. We posit that IT, by enabling coordination and control in firms, is likely to moderate the relationship between diversification and performance. Combining arguments from both resource-based view and the organizational controls literature, we theorize about the moderating effects of IT spending under different types and levels of diversification. Using data from large U.S. manufacturing firms, we test our research hypotheses. Our results indicate that while IT spending interacts with related diversification to have a positive effect on firm performance, similar interactions with unrelated diversification do not have any effects on firm performance. Furthermore, the interaction between IT spending and geographic diversification is positively associated with performance only when the level of geographic diversification is low. We interpret and discuss these results and highlight the theoretical and practical implications of our findings.
Generating real-time advanced multimedia for learning communities
Authors: Terry Ryan
Venue:  (2008)

This study had three primary objectives set to overcome the challenges of using multimedia technology efficiently for educational purposes and promote the utilization of this technology in learning environments: (1) Design, develop, and implement an advanced Web-based learning system, called the Multimedia Management and Presentation System (MMPS), with a set of features capable of facilitating multimedia-supported instruction. (2) Evaluate learners' experiences with the MMPS tool and their perceptions on the effectiveness of the tool in supporting their learning activities. (3) Assess the effectiveness of the MMPS tool in facilitating and promoting the use of multimedia in learning communities. In this study, the researcher used design research as the research methodology and analyzed various theories and principles associated with the concepts of learning, instruction, and multimedia. His findings led the researcher to the development of the MMPS application designed to facilitate multimedia-supported instruction by focusing on three important issues: (1) Overcome major technical barriers that are related to the use of physical media products (e.g., DVDs, CDs, videocassettes, or audiotapes) in the classroom. (2) Encourage the use of multimedia in learning environments. (3) Promote active learning and facilitate knowledge construction. The MMPS tool makes it possible for instructors, not only to prepare instructional multimedia projects and integrate them into their curricula, but also to store those projects for future use. Similarly, the tool also allows learners to create individual or team multimedia projects that can be used as part of class exercises or self-learning activities. The researcher evaluated the tool in a graduate-level learning environment. Participants' positive perceptions on the effectiveness of the tool in supporting various learning activities (e.g., self-paced learning, knowledge sharing, and demonstrating what they have learned in class exercises) together with their overall level of satisfaction with the MMPS tool can be given as some of the outcomes of the evaluation process. Finally, participants' opinions on the usefulness and ease of use of the features that came with the MMPS tool helped the researcher determine some potential areas where making improvements can enhance the tool's capabilities and make it serve better in learning communities in the future.
Comparative study between conventional macroscopic IV techniques and advanced AFM based methods for electrical characterization of dielectrics at the nanoscale
Authors: V. Yanev, T. Erlbacher, M. Rommel, A. J. Bauer, L. Frey
Venue: Microelectronic Engineering (2009)

High-k dielectrics exhibit strong variations in their electrical characteristics on the nanometer scale due to morphology alteration. Therefore, electrical measurement techniques with nanometer resolution based on atomic force microscopy (AFM) like conductive AFM (cAFM) and tunneling AFM (TUNA) are essentially very well applicable to complement conventional macroscopic current-voltage (IV) techniques. Comparative experiments between conventional IV, cAFM and TUNA measurements on SiO"2 films and on high-k/SiO"2 stacks prove the capability and the accuracy of cAFM/TUNA as advanced methods for electrical characterization of thin dielectric films. Especially TUNA provides the spatial resolution and the current sensitivity required for the characterization of local electrical properties at the nanoscale allowing for the characterization of dielectric layers at high current densities.
Distributed Orchestration Versus Choreography: The FOCAS Approach
Authors: Gabriel Pedraza, Jacky Estublier
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

Web service orchestration is popular because the application logic is defined from a central and unique point of view, but it suffers from scalability issues. In choreography, the application is expressed as a direct communication between services without any central actor, making it scalable but also difficult to specify and implement. In this paper we present FOCAS, in which the application is described as a classic service orchestration extended by annotations expressing where activities, either atomic or composite, are to be executed. FOCAS analyzes the orchestration model and its distribution annotations and transforms the orchestration into a number of sub-orchestrations to be deployed on a set of distributed choreography servers, and then, deploys and executes the application. This approach seemingly fills the gap between "pure" orchestration (a single control server), and "pure" choreography (a server per service). The paper shows how FOCAS transforms a simple orchestration into a distributed one, fitting the distribution needs of the company, and also shows how choreography servers can be implemented using traditional orchestration engines.
Insertion ant colony optimization for solving the traveling salesman problem
Authors: Jean-Claude Thill
Venue:  (2008)

Inspired from the ant foraging behavior, the ant colony algorithm has provided a new approach for solving discrete optimization problems&mdash;the traveling salesman problem (TSP), for instance, is usually tested as the benchmark. Since the ant colony algorithm was introduced in the 1990's, many refinements have been developed to improve the performance by refining the pheromone updating strategies, which have achieved great success on small- and medium-size of TSP instances. However, refining the pheromone updating strategies only can not further improve the performance of the traditional ant colony algorithms on large scale TSP instances. In this study, a new algorithm, insertion ant colony system (IACS) is proposed in order to overcome drawbacks that traditional ant colony algorithms may encounter while solving large scale TSP instances. By incrementally re-optimizing the initial solution, the IACS performs as well as the LK algorithm on large TSP instances.
Representation of speech in the primary auditory cortex and its implications for robust speech processing
Authors: Shihab Shamma
Venue:  (2008)

Speech has evolved as a primary form of communication between humans. This most used means of communication has been the subject of intense study for years, but there is still a lot that we do not know about it. It is an oft repeated fact, that even the performance of the best speech processing algorithms still lags far behind that of the average human, It seems inescapable that unless we know more about the way the brain performs this task, our machines can not go much further. This thesis focuses on the question of speech representation in the brain, both from a physiological and technological perspective. We explore the representation of speech through the encoding of its smallest elements&mdash;phonemic features&mdash;in the primary auditory cortex. We report on how population of neurons with diverse tuning properties respond discriminately to phonemes resulting in explicit encoding of their parameters. Next, we show that this sparse encoding of the phonemic features is a simple consequence of the linear spectro-temporal properties of the auditory cortical neurons and that a Spectro-Temporal receptive field model can predict similar patterns of activation. This is an important step toward the realization of systems that operate based on the same principles as the cortex. Using an inverse method of reconstruction, we shall also explore the extent to which phonemic features are preserved in the cortical representation of noisy speech. The results suggest that the cortical responses are more robust to noise and that the important features of phonemes are preserved in the cortical representation even in noise. Finally, we explain how a model of this cortical representation can be used for speech processing and enhancement applications to improve their robustness and performance.
Multiagent commitment alignment
Authors: Amit K. Chopra, Munindar P. Singh
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Commitments provide a basis for understanding interactions in multiagent systems. Successful interoperation relies upon the interacting parties being aligned with respect to their commitments. However, alignment is nontrivial in a distributed system where agents communicate asynchronously and make different observations. We propose a formalization for commitments that ensures alignment despite asynchrony. This formalization consists of three elements: (1) a semantics of commitment operations; (2) messaging patterns that implement the commitment operations; and (3) weak constraints on agents' behaviors to ensure the propagation of vital information. We prove that our formalization ensures alignment. We illustrate the generality of our formalization with several real-life scenarios.
Understanding Digital Marketing: Marketing Strategies for Engaging the Digital Generation
Authors: Damian Ryan, Calvin Jones
Venue:  (2009)

The world of digital media is changing at a phenomenal pace. Constantly evolving technologies, and their evolving uses,are transforming how we access informationand how we interact and communicate with one another on a global scale. Understanding Digital Marketing looks at the world of digital marketing: how it got started, how it got to where it is today, and where the thought leaders in the industry believe it is headed in the future. The book shows readers, in a practical and comprehensive way, how to harness the power of digital media and use it to achieve the utmost success fortheir businesses. Itexplains how tochoose online marketing channels in order to get products and services to market.It explores in detail such areas as search marketing, affiliate marketing, e-mail marketing, creative online executions, and digital marketing strategies.Including real-world examples of digital marketing successes and expert opinions, Understanding Digital Marketing will givereaders the tools to utilize the power of the internet to take their businesses whereverthey wantthem to go.