ppxscal/embedding_network huggingface dataset:
Users' View on Context-Sensitive Car Advertisements
Authors: Florian Alt, Christoph Evers, Albrecht Schmidt
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

Cars are ubiquitous and offer large and often highly visible surfaces that can be used as advertising space. Until now, advertising in this domain has focused on commercial vehicles, and advertisements have been painted on and were therefore static, with the exception of car-mounted displays that offer dynamic content. With new display technologies, we expect static displays or uniformly-painted surfaces (e.g. onto car doors or the sides of vans and trucks) to be replaced with embedded dynamic displays. We also see an opportunity for advertisements to be placed on non-commercial cars: results of our online survey with 187 drivers show that more than half of them have an interest in displaying advertising on their cars under two conditions: (1) they will receive financial compensation, and (2) there will be a means for them to influence the type of advertisements shown. Based on these findings, as well as further interviews with car owners and a car fleet manager, we discuss the requirements for a context-aware advertising platform, including a context-advertising editor and contextual content distribution system. We describe an implementation of the system that includes components for car owners to describe their preferences and for advertisers to contextualize their ad content and distribution mechanism.
Navigating Technomedia: Caught in the Web
Authors: Sam Han
Venue:  (2007)

This is an introductory survey of what the author calls the technomedia, the generation of communication technologies after television, cell phones and the first wave of the Internet. Beginning with a history of media, the book explores the nature and effects of technomedia like the blogosphere, Blackberries and related technologies. Because they are transforming the relations of their users to the social environment, the topic is fast becoming an important focus of modern social theory. 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
Stream Clustering Based on Kernel Density Estimation
Authors: Stefano Lodi, Gianluca Moro, Claudio Sartori
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)

We present a novel algorithm for clustering streams of multidimensional points based on kernel density estimates of the data. The algorithm requires only one pass over each data point and a constant amount of space, which depends only on the accuracy of clustering. The algorithm recognizes clusters of nonspherical shapes and handles both inserted and deleted objects in the input stream. Querying the membership of a point in a cluster can be answered in constant time.
A negotiation framework for content distribution in mobile transient networks
Authors: Benjamin Molina, Salvatore F. Pileggi, Manuel Esteve, Carlos E. Palau
Venue: Journal of Network and Computer Applications (2009)

Transient networks are spontaneous networks that appear for a short period of time in order to provide basic services such as connectivity and content distribution among a small community. Nowadays mobile devices are becoming multimode by nature providing multiple connection paths. This paper investigates the efficiency and benefit of a mobile transient network where multiple nodes collaborate, offering a multihomed network with community services by means of intelligent agents. The paper concretely proposes an architecture able to fully support a peer-to-peer transient community during both negotiation and service steps for two different modes: file download and multimedia streaming. The first mode, implemented on intelligent and cooperative agents, provides two negotiation models (fair and dynamic) in order to guarantee wider flexibility for different possible scenarios and community models; the second one implements a content delivery system into transient community, taking advantage of multihomed features of mobile devices.
On bipartite graphs of diameter 3 and defect 2
Authors: Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
Venue: Journal of Graph Theory (2009)

We consider bipartite graphs of degree &Delta;&ge;2, diameter D=3, and defect 2 (having 2 vertices less than the bipartite Moore bound). Such graphs are called bipartite (&Delta;, 3, -2) -graphs. We prove the uniqueness of the known bipartite (3, 3, -2) -graph and bipartite (4, 3, -2)-graph. We also prove several necessary conditions for the existence of bipartite (&Delta;, 3, -2) -graphs. The most general of these conditions is that either &Delta; or &Delta;-2 must be a perfect square. Furthermore, in some cases for which the condition holds, in particular, when &Delta;=6 and &Delta;=9, we prove the non-existence of the corresponding bipartite (&Delta;, 3, -2)-graphs, thus establishing that there are no bipartite (&Delta;, 3, -2)-graphs, for 5&le;&Delta;&le;10. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 61: 271&ndash;288, 2009
Computer simulation technique for the closed die forging process: a modular approach
Authors: Dipakkumar Gohil, Mahendrakumar Maisuria
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

Closed die forging is a very complex process and the measurement of actual forces for real material is difficult and cumbersome. Hence the Computer Simulation modelling technique has been adopted to get the estimated load requirement. The objective of this work is to simulate and analyze the closed die forging process. The main focus is on the load requirement which has been compared to the actual load requirement and the deviation has been reported in the form of percentage error.
Rebuilding debian using distributed computing
Authors: Lucas Nussbaum
Venue: Proceedings of the 7th international workshop on Challenges of large applications in distributed environments (2009)

Doing Quality Assurance work on Debian, a Linux distribution with more than 12000 packages, requires an impressive amount of computing power, which is usually not available for its developers. In this article, we report on the development of an infrastructure to run quality-assurance tasks on Debian using the Grid'5000 experimental platform. In particular, we focus on the problem of rebuilding all packages in Debian from source. We describe the details of this task, and the infrastructure we developed, with scalability and robustness in mind. The results we obtained are then presented, and we discuss possible improvements and lessons we learnt in the process, which might be useful in the context of other large-scale experiments.
The Theory and Practice of Online Learning, 2nd edition
Authors: Terry Anderson
Venue:  (2009)

Neither an academic tome nor a prescriptive 'how to' guide, "The Theory and Practice of Online Learning" is an illuminating collection of essays by practitioners and scholars active in the complex field of distance education.Distance education has evolved significantly in its 150 years of existence. For most of this time, it was an individual pursuit defined by infrequent postal communication. But recently, three more developmental generations have emerged, supported by television and radio, teleconferencing, and computer conferencing. The early 21st century has produced a fifth generation, based on autonomous agents and intelligent, database-assisted learning, that has been referred to as Web 2.0.The second edition of "The Theory and Practice of Online Learning" features updates in each chapter, plus four new chapters on current distance education issues such as connectivism and social software innovations.
Searching a Circular Corridor with Two Flashlights
Authors: Bo Jiang, Xuehou Tan
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

We consider the problem of searching for a mobile intruder in a circular corridor (a polygon with one polygonal hole) by two searchers, who hold a flashlight. Both searchers move on the outer boundary, directing their flashlights at the inner boundary. The objective is to decide whether there exists a search schedule for the searchers to detect the intruder, no matter how fast he moves. We give a characterization of the class of circular corridors, which are searchable with two flashlights. Based on our characterization, an O(n logn) time algorithm is then presented to determine the searchability of a circular corridor with two flashlights, where n denotes the total number of vertices of the outer and inner boundaries. Moreover, a search schedule can be output in time linear in its size, if it exists. Our result gives the first efficient solution to the polygon search problem for two searchers.
NLP Techniques for Term Extraction and Ontology Population
Authors: Diana Maynard, Yaoyong Li, Wim Peters
Venue: Proceeding of the 2008 conference on Ontology Learning and Population: Bridging the Gap between Text and Knowledge (2008)

This chapter investigates NLP techniques for ontology population, using a combination of rule-based approaches and machine learning. We describe a method for term recognition using linguistic and statistical techniques, making use of contextual information to bootstrap learning. We then investigate how term recognition techniques can be useful for the wider task of information extraction, making use of similarity metrics and contextual information. We describe two tools we have developed which make use of contextual information to help the development of rules for named entity recognition. Finally, we evaluate our ontology-based information extraction results using a novel technique we have developed which makes use of similarity-based metrics first developed for term recognition.
Extending the BDI architecture with commitments
Authors: Dorian Gaertner, Pablo Noriega, Carles Sierra
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

In this paper, we describe a novel agent architecture for normative multiagent systems which is based on multi-context systems. It models the three modalities of Rao and Georgeff's BDI agents as individual contexts and adds a fourth one for commitments. This new component is connected to all other mental attitudes via two sets of bridge rules, injecting formulae into it and modifying the BDI components after reasoning about commitments. As with other normative approaches the need for methods to deal with consistency is a key concern. We suggest three forms of dealing with the truth maintenance problem, all of which profit from the use of multi-context systems.
An Argument-Based Approach to Deal with Wastewater Discharges
Authors: Montse Aulinas, Pancho Tolchinsky, Clàudia Turon, Manel Poch, Ulises Cortés
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

In this paper we propose the use of an argument-based model --ProCLAIM --that has the potential to minimize ecological impact of industrial wastewater discharges into water bodies. On the one hand, the diversity and unpredictability of many of industrial wastewater discharges and on the other, the complexity of ecological systems that finally receive the discharge (i.e. fluvial ecosystems) illustrates the difficulty to attain a good ecological status of water bodies as required by one of the main priorities of the European Water Framework Directive (2000/60/EC). ProCLAIM enables agents involved in the wastewater management process deliberate over whether proposed actions (e.g. industrial spills) are environmentally safe, thus, making each undertaken action a more informed decision.
Mixture model POMDPs for efficient handling of uncertainty in dialogue management
Authors: James Henderson, Oliver Lemon
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

In spoken dialogue systems, Partially Observable Markov Decision Processes (POMDPs) provide a formal framework for making dialogue management decisions under uncertainty, but efficiency and interpretability considerations mean that most current statistical dialogue managers are only MDPs. These MDP systems encode uncertainty explicitly in a single state representation. We formalise such MDP states in terms of distributions over POMDP states, and propose a new dialogue system architecture (Mixture Model POMDPs) which uses mixtures of these distributions to efficiently represent uncertainty. We also provide initial evaluation results (with real users) for this architecture.
Managing email overload with an automatic nonparametric clustering system
Authors: Yang Xiang
Venue: The Journal of Supercomputing (2009)

Email overload is a recent problem that there is increasingly difficulty that people have to process the large number of emails received daily. Currently, this problem becomes more and more serious and it has already affected the normal usage of email as a knowledge management tool. It has been recognized that categorizing emails into meaningful groups can greatly save cognitive load to process emails, and thus this is an effective way to manage the email overload problem. However, most current approaches still require significant human input for categorizing emails. In this paper, we develop an automatic email clustering system, underpinned by a new nonparametric text clustering algorithm. This system does not require any predefined input parameters and can automatically generate meaningful email clusters. The evaluation shows our new algorithm outperforms existing text clustering algorithms with higher efficiency and quality in terms of computational time and clustering quality measured by different gauges. The experimental results also well match the labeled human clustering results.
Web 2.0 as Approach for Enterprise Information Technology - How Companies Can Benefit from the Internet of the Second Generation
Authors: Claus Menzel
Venue:  (2007)

Web 2.0 is a common term in the Internet field nowadays. Services like Youtube or MySpace, which stand for the Internet of the second generation, have attracted attention on the consumer market. The company market on the other hand has not been strongly influenced by the new trend. But Web 2.0 could also be used to improve enterprise information technology. Examples are Web 2.0 concepts, which increase the effectiveness of data handling or concepts, which provide new communication methods. Therefore the use of Web 2.0 concepts in an enterprise context seems worth considering. Claus-M. Menzel explains in this book how the Web 2.0 approach could be used in an enterprise context and why the adoption of Web 2.0 could be a benefit for companies. For this objective the essence of Web 2.0 will first be clarified, as well as why and how this concept is working. It will be deduced which Web 2.0 elements can be used within companies and how they need to be adjusted to be used there. Furthermore this book will introduce technologies and applications which can be used for the realisation of web 2.0 in companies and compare these with the common enterprise information technologies. 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
Interface studies of ALD-grown metal oxide insulators on Ge and III-V semiconductors (Invited Paper)
Authors: Paul C. McIntyre, Yasuhiro Oshima, Eunji Kim, Krishna C. Saraswat
Venue: Microelectronic Engineering (2009)

Atomic layer deposited (ALD) HfO"2/GeO"xN"y/Ge(100) and Al"2O"3/In"0"."5"3Ga"0"."4"7As(100)-4x2 gate stacks were analyzed both by MOS capacitor electrical characterization and by advanced physical characterization to correlate the presence of electrically-active defects with chemical bonding across the insulator/channel interface. By controlled in situ plasma nitridation of Ge and post-ALD annealing, the capacitance-derived equivalent oxide thickness was reduced to 1.3nm for 5nm HfO"2 layers, and mid-gap density of interface states, D"i"t=3x10^1^1cm^-^2eV^-^1, was obtained. In contrast to the Ge case, where an engineered interface layer greatly improves electrical characteristics, we show that ALD-Al"2O"3 deposited on the In"0"."5"3Ga"0"."4"7As (100)-4x2 surface after in situ thermal desorption in the ALD chamber of a protective As cap results in an atomically-abrupt and unpinned interface. By avoiding subcutaneous oxidation of the InGaAs channel during Al"2O"3 deposition, a relatively passive gate oxide/III-V interface is formed.
Quantitative security analysis for service-oriented software architectures
Authors: Michael Yanguo Liu
Venue:  (2008)

Due to the dramatic increase in intrusion activities, the definition and evaluation of software security requirements have become important aspects of the development of software services. It is now a well-accepted fact in software engineering that security concerns, like any other quality concerns, should be dealt with in the early stages of software development process. Current practices for software security architecture risk analysis, however, still heavily rely on human expertise. This involves a significant amount of subjective efforts creating a greater potential for inaccuracies. In this dissertation, we propose a framework for quantitative security architecture analysis for service-oriented software systems. In this regard two important contributions are made in the dissertation. First, we identify and define some internal security attributes and related properties based on a generic service-oriented software model, setting up a framework for the definition and formal evaluation of corresponding security metrics. Second, we propose a measurement abstraction paradigm named User System Interaction Effect (USIE) model that can be used to systematically derive and analyze security concerns from service-oriented software architectures. Many aspects of the model derivation and analysis can be automated, which limit the amount of user involvement and, thereby, reduce the subjectivity underlying typical security analysis process. The model can be used as a foundation for quantitative analysis of software services from different security perspectives with respect to the internal security properties introduced. Based on sample metrics derived from the framework, we illustrate empirically the viability of our paradigm by conducting case studies based on existing open source software.
Choice, interoperability, and conformance in interaction protocols and service choreographies
Authors: Matteo Baldoni, Cristina Baroglio, Amit K. Chopra, Nirmit Desai, Viviana Patti, Munindar P. Singh
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Many real-world applications of multiagent systems require independently designed (heterogeneous) and operated (autonomous) agents to interoperate. We consider agents who offer business services and collaborate in interesting business service engagements. We formalize notions of interoperability and conformance, which appropriately support agent heterogeneity and autonomy. With respect to autonomy, our approach considers the choices that each agent has, and how their choices are coordinated so that at any time one agent leads and its counterpart follows, but with initiative fluidly shifting among the participants. With respect to heterogeneity, we characterize the variations in the agents' designs, and show how an agent may conform to a specification or substitute for another agent. Our approach addresses a challenging problem with multi-party interactions that existing approaches cannot solve. Further, we introduce a set of edit operations by which to modify an agent design so as to ensure its conformance with others.
Power and frequency control systems study
Authors: Canureci Gabriela, Maican Camelia Vinatoru Matei, Iancu Eugen
Venue: Proceedings of the 4th WSEAS/IASME international conference on Dynamical systems and control (2008)

In this paper we study the control of the power and the frequency of the turbo generator couple to the power grid. These are developed linear mathematical models for steam turbine and electrical generator, used in power control system design. The dynamic control system was simulated using Matlab Simulink.
Research Note---Social Interactions and the “Digital Divide”: Explaining Variations in Internet Use
Authors: Ritu Agarwal, Animesh Animesh, Kislaya Prasad
Venue: Information Systems Research (2009)

Given the increasingly important role of the Internet in education, healthcare, and other essential services, it is important that we develop an understanding of the “digital divide.” Despite the widespread diffusion of the Web and related technologies, pockets remain where the Internet is used sparingly, if at all. There are large geographic variations, as well as variations across ethnic and racial lines. Prior research suggests that individual, household, and regional differences are responsible for this disparity. We argue for an alternative explanation: Individual choice is subject to social influence (“peer effects”) that emanates from geographic proximity; this influence is the cause of the excess variation. We test this assertion with empirical analysis of a data set compiled from a number of sources. We find, first, that widespread Internet use among people who live in proximity has a direct effect on an individual's propensity to go online. Using data on residential segregation, we test the proposition that the Internet usage patterns of people who live in more ethnically isolated regions will more closely resemble usage patterns of their ethnic group. Finally, we examine the moderating impact of housing density and directly measured social interactions on the relationship between Internet use and peer effects. Results are consistent across analyses and provide strong evidence of peer effects, suggesting that individual Internet use is influenced by local patterns of usage. Implications for public policy and the diffusion of the Internet are discussed.
Advanced algorithms for adaptive filtering
Authors: M. Arezki, D. Berkani
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

In this paper, we evaluate the possibility to develop algorithms of adaptation for the applications system of acoustic echo cancellation, while maintaining equilibrium between its reduced calculation complexity and its adaptive performances. We present new algorithms versions of fast recursive least squares numerically stable (NS-FRLS). They are obtained by means of redundant formulas, available in the fast recursive least squares (FRLS) algorithms, to estimate numerical errors and to retroact them in an unspecified point of the algorithm in order to modify its numerical properties. These algorithms represent a very important load of calculation that needs to be reduced. we propose a new (M-SMFTF) algorithm for adaptive filtering with fast convergence and low complexity. It is the result of a simplified FTF type algorithm, where the adaptation gain is obtained only from the forward prediction variables and using a new recursive method to compute the likelihood variable. This algorithm presents a certain interest, for the adaptation of very long filters, like those used in the problems of echo acoustic cancellation, due to its reduced complexity, its numerical stability and its convergence in the presence of the speech signal. Its calculation complexity is of 6L (L is the finite impulse response filter length) and this is considerably reduced to (2L+4P) when we use a reduced P-size (P≪L) forward predictor.