ppxscal/embedding_network huggingface dataset:
Mechanism of positive charge generation in the bulk of HfAlO/SiO2 stack
Authors: Piyas Samanta, Chin-Lung Cheng, Yao-Jen Lee, Mansun Chan
Venue: Microelectronic Engineering (2009)

We have investigated electrical stress-induced positive charge buildup in a hafnium aluminate (HfAlO)/silicon dioxide (SiO"2) dielectric stack (equivalent oxide thickness=2.63nm) in metal-oxide-semiconductor (MOS) capacitor structures with negative bias on the TaN gate. Various mechanisms of positive charge generation in the dielectric have been theoretically studied. Although, anode hole injection (AHI) and valence band hole tunneling are energetically favorable in the stress voltage range studied, the measurement results can be best explained by the dispersive proton transport model.
Optimal in-place transposition of rectangular matrices
Authors: A. A. Tretyakov, E. E. Tyrtyshnikov
Venue: Journal of Complexity (2009)

Given a rectangular mxn matrix stored as a two-dimensional array, we want to transpose it in place and measure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O(mn) using only min(m,n) auxiliary memory cells.
Is cloud computing essential to the future of pervasive services?
Authors: Julie A. McCann, Manish Parashar, Omer Rana, Luca Foschini, Tim Kindberg
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

Cloud computing is a new paradigm for deploying computing/information services, which is based pervasive and on demand access to computing utilities, an abstraction of unlimited computing resources, and a usage-based payment model made users essentially "rent" virtual resources and service and pay for what they use. Such a paradigm can significantly impact the nature, complexity and scale of pervasive/mobile services as well as their impacts. In fact, many have suggested that pervasive services may be the killer application for Clouds. However, there are also concerns that limitations of current cloud offerings, lack of standards and regulations, and issues such as vendor lock-in may limit pervasiveness and stifle creativity. The goal of this panel is debate that role and impact of cloud computing on pervasive services.
Agile Software Development at Sabre Holdings
Authors: Marek Bukowy, Larry Wilder, Susan Finch, David Nunn
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

A transition to an agile software development methodology in a heavily waterfall-oriented organization is discussed. A collection of agile software development practices implemented at Sabre Holdings is described. A summary of the desired set of practices is given, along with data summarizing the degree of pervasiveness of these practices in real life. Quantitative results on the use of the methodology in day-to-day development are presented. Lessons learned and mitigation ideas are also discussed. The gathered information shows that the habits of the old model can strongly encumber the implementation of an agile methodology, but even implementation of a few practices yields very tangible results.
Third Workshop on Teaching Computational Science (WTCS 2009)
Authors: Alfredo Tirado-Ramos, Angela Shiflet
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

The Third Workshop on Teaching Computational Science, within the International Conference on Computational Science, provides a platform for discussing innovations in teaching computational sciences at all levels and contexts of higher education. This editorial provides an introduction to the work presented during the sessions.
On the Complexity of the Multiple Stack TSP, kSTSP
Authors: Sophie Toulouse, Roberto Wolfler Calvo
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T 1 and a delivery tour T 2 of n items on two distinct graphs. The pickup tour successively stores the items at the top of k containers, whereas the delivery tour successively picks the items at the current top of the containers: thus, the couple of tours are subject to LIFO ("Last In First Out") constraints. This paper aims at finely characterizing the complexity of kSTSP in regards to the complexity of TSP. First, we exhibit tractable sub-problems: on the one hand, given two tours T 1 and T 2, deciding whether T 1 and T 2 are compatible can be done within polynomial time; on the other hand, given an ordering of the n items into the k containers, the optimal tours can also be computed within polynomial time. Note that, to the best of our knowledge, the only family of combinatorial precedence constraints for which constrained TSP has been proven to be in P is the one of PQ-trees, [2]. Finally, in a more prospective way and having in mind the design of approximation algorithms, we study the relationship between optimal value of different TSP problems and the optimal value of kSTSP.
Multi-Agent Reinforcement Learning for Intrusion Detection: A case study and evaluation
Authors: Arturo Servin, Daniel Kudenko
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper we propose a novel approach to train Multi-Agent Reinforcement Learning (MARL) agents to cooperate to detect intrusions in the form of normal and abnormal states in the network. We present an architecture of distributed sensor and decision agents that learn how to identify normal and abnormal states of the network using Reinforcement Learning (RL). Sensor agents extract network-state information using tile-coding as a function approximation technique and send communication signals in the form of actions to decision agents. By means of an on line process, sensor and decision agents learn the semantics of the communication actions. In this paper we detail the learning process and the operation of the agent architecture. We also present tests and results of our research work in an intrusion detection case study, using a realistic network simulation where sensor and decision agents learn to identify normal and abnormal states of the network.
Image stitching with dynamic elements
Authors: Alec Mills, Gregory Dudek
Venue: Image and Vision Computing (2009)

This paper presents a new combination of techniques to create pleasing and physically consistent image mosaics despite the presence of moving objects in the scene. The technique uses heuristic seam selection in the intensity and gradient-domains to choose which pixels to use from each image and then blends them smoothly to create the final mosaic. We demonstrate illustrative results obtained by comparing and contrasting our output with that obtained from four representative existing image mosaic systems. One of these is documented in the academic research literature and three are commercially available products. The present algorithm gives comparable or superior results in all examples.
Principles of Internet Marketing: New Tools and Methods for Web Developers, 1st edition
Authors: Jason I. Miletsky
Venue:  (2009)

PRINCIPLES OF INTERNET MARKETING: NEW TOOLS AND METHODS FOR WEB DEVELOPERS helps readers understand the "why" behind the "how" of Web site development. It teaches the importance of the brand and how that relates to Web site development, the reasons sites are developed, how they build an audience, and most importantly, how companies use the Web to earn revenue and build recognition among their desired market. You will learn the strategies used to drive traffic to a site, the tools that are available to keep audiences coming back (with a focus on social media tools), and the role marketing plays in the building a successful Web site.
BMS revisited
Authors: Guillaume Aucher
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

The insight of the BMS logical framework (proposed by Baltag, Moss and Solecki) is to represent how an event is perceived by several agents very similarly to the way one represents how a static situation is perceived by them: by means of a Kripke model. There are however some differences between the definitions of an epistemic model (representing the static situation) and an event model. In this paper we restore the symmetry. The resulting logical framework allows, unlike any other one, to express statements about ongoing events and to model the fact that our perception of events (and not only of the static situation) can also be updated due to other events. We axiomatize it and prove its decidability. Finally, we show that it embeds the BMS one if we add common belief operators.
The discovery of history using inverse simulation
Authors: Setsuya Kurahashi
Venue: International Journal of Computer Applications in Technology (2009)

We analysed a particular family line, which had so many successful candidates, who passed the very tough examinations of Chinese government officials over 500 years. We investigate what would have happened in a Chinese historical family line. First, we studied the genealogical records Zokufu in China. Second, based on the study, we implemented an agent-based model with the family line network as an adjacency matrix, the personal profile data as an attribution matrix. Third, using 'inverse simulation' technique, we optimised the agent-based model in order to fit the simulation profiles to the real profile data. From the intensive experiments, we have found that both grandfather and mother have a profound impact within a family to transmit cultural capital to children and maintain the system of the norm, system of the family. We conclude that new agent-based models are able to contribute to discover knowledge in the fields of historical sciences.
Learning to fall: Designing low damage fall sequences for humanoid soccer robots
Authors: J. Ruiz-del-Solar, R. Palma-Amestoy, R. Marchant, I. Parra-Tsunekawa, P. Zegers
Venue: Robotics and Autonomous Systems (2009)

A methodology for the analysis and design of fall sequences of robots that minimize joint/articulation injuries, and the damage of valuable body parts is proposed. These fall sequences can be activated/triggered by the robot in case of a detected unintentional fall or an intentional fall, which are common events in humanoid soccer environments. The methodology is human-based and requires the use of a realistic simulator as development tool. The obtained results show that fall sequences designed using the proposed method produce less damage than standard, uncontrolled falls.
Dependency of intentions on i*
Authors: Shuichiro Yamamoto
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

The Strategic Dependency Model (SD model) of i* framework is used to model intentions among actors. However, it is not clear how to validate the equivalence of SD models. In this paper, the dependency matrix of intentions is proposed to formalize equivalence of SD models. We also provide a method to develop SD models from dependency matrices. The proposed method can be used to reduce redundant actors using dependency of intentions.
Cryptanalysis of Twister
Authors: Florian Mendel, Christian Rechberger, Martin Schläffer
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

In this paper, we present a semi-free-start collision attack on the compression function for all Twister variants with negligible complexity. We show how this compression function attack can be extended to construct collisions for Twister-512 slightly faster than brute force search. Furthermore, we present a second-preimage and preimage attack for Twister-512 with complexity of about 2384 and 2456 compression function evaluations, respectively.
Does Learner Control Affect Learning?
Authors: Joseph E. Beck
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Many intelligent tutoring systems permit some degree of learner control. A natural question is whether the increased student engagement and motivation such control provides results in additional student learning. This paper uses a novel approach, learning decomposition, to investigate whether students do in fact learn more from a story they select to read than from a story the tutor selects for them. By analyzing 346 students reading approximately 6.9 million words, we have found that students learn approximately 25% more in stories they choose to read, even though from a purely pedagogical standpoint such stories may not be as appropriate as those chosen by the computer. Furthermore, we found that (for our instantiation of learner control) younger students may derive less benefit from learner control than older students, and girls derive less benefit than boys.
Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs
Authors: M. Vinyals, J. A. Rodriguez-Aguilar, J. Cerquides
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this paper we make three main contributions (fully detailed in [5]). Firstly, we formulate a new algorithm, the so-called Action-GDL, which extends GDL [1] to apply it to Distributed Constraint Optimization Problems (DCOPs). Secondly, we show that Action-GDL generalizes DPOP[4], a low-complexity, state-of-the-art algorithm to solve DCOPs. Finally, we provide empirical evidence showing that Action-GDL can outperform DPOP in terms of the amount of computation, communication and parallelism.
An adaptive latency mitigation scheme for massively multiuser virtual environments
Authors: Behnoosh Hariri, Shervin Shirmohammadi, Mohammad Reza Pakravan, Mohammad Hossein Alavi
Venue: Journal of Network and Computer Applications (2009)

As massively multiuser virtual environments (MMVEs) expand in terms of size and user population, they tend toward using P2P architectures as a way to provide scalability without the need for large centralized resources. Distributed hash table (DHT)-based networks have been introduced as a promising option for overlay-based distributed massively multiuser virtual environment applications. However, overlay latency stretch seriously affects MMVE performance where QoS is crucial for real-time user collaboration. This work includes a series of efforts in the alleviation of such undesired latency. Our approach to latency mitigation consists of two phases. First, we propose a position-based ID assignment approach to minimize message hop-count by exploiting the clustered pattern of traffic exchange among MMVE users. Second, we introduce a new ant-based distributed neighbor selection scheme that can be used by MMVE users to select the best neighbors within their areas of interest. In order to evaluate the performance of this heuristic approach, we model the neighbor selection problem in the form of a network flow problem and use its solution as an optimality bound to compare the results. Simulation results demonstrate that the proposed algorithms will compensate for DHT latency stretch to a high extent and the performance of the resulting system would closely follow the optimal bound while communication overhead is negligible.
Mobility, Data Mining and Privacy the Experience of the GeoPKDD Project
Authors: Fosca Giannotti, Dino Pedreschi, Franco Turini
Venue: Privacy, Security, and Trust in KDD: Second ACM SIGKDD International Workshop, PinKDD 2008, Las Vegas, NV, USA, August 24, 2008, Revised Selected Papers (2009)

Our everyday actions, the way people live and move, leave digital traces in the information systems of the organizations that provide services through the wireless networks for mobile communication. The potential value of these traces in recording the human activities in a territory is becoming real, because of the increasing pervasiveness and positioning accuracy. The number of mobile phone users worldwide was recently estimated as 3 billion, i.e., one mobile phone every two people. On the other hand, the location technologies, such as GSM and UMTS, currently used by wireless phone operators are capable of providing an increasingly better estimate of a user's location, while the integration of various positioning technologies proceeds: GPS-equipped mobile devices can transmit their trajectories to some service provider (and the European satellite positioning system Galileo may improve precision and pervasiveness in the near future), Wi-Fi and Bluetooth devices may be a source of data for indoor positioning, Wi-Max can become an alternative for outdoor positioning, and so on. The consequence of this scenario, where communication and computing devices are ubiquitous and carried everywhere and always by people and vehicles, is that human activity in a territory may be sensed --- not necessarily on purpose, but simply as a side effect of the ubiquitous services provided to mobile users. Thus, the wireless phone network, designed to provide mobile communication, can also be viewed as an infrastructure to gather mobility data, if used to record the location of its users at different times. The wireless networks, whose pervasiveness and localization precision increase while new location-based and context-based services are offered to mobile users, are becoming the nerves of our territory --- in particular, our towns --- capable of sensing and, possibly, recording our movements.
Windows Vista Security: Securing Vista Against Malicious Attacks
Authors: Roger A. Grimes, Jesper M. Johansson
Venue:  (2007)

Written by two veteran Windows security expertsone a Microsoft Security MVP and Foundstone Security Consultant, and the other a former senior member of Microsoft's Security Engineering Teamthis essential resource prepares end users and technical administrators to handle various security problems that exist in Windows Vista as well as possible future threats. Offering in-depth coverage of all significant new security technologies in Windows Vista, this book addresses User Account Control, the new Firewall, Internet Explorer 7.0, Windows Defender, Service Hardening, and BitLocker.
Workspace analysis and design of a 6-DOF parallel robot
Authors: Lapusan Ciprian, Maties Vistrian, Hancu Olimpiu
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

In this paper a workspace analysis for a six degree of freedom parallel robot is outlined. We propose a numerical approach for determining and evaluating the workspace of the 6-UPS robot. The algorithm uses inverse kinematic and a set of two constraints, covering struts length and joint angles, for computing the workspace. The analysis and algorithm are used as a design tool to select the dimensions and actuators for the robot. A computer application was implemented using Matlab, the program allow to change parameters and to visualize the results of the analysis. A case study is presented, of a six-degree of freedom virtual reality simulation platform design by the author.
Jots: reflective learning in scratch
Authors: Eric Rosenbaum
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

This paper presents early work on the "Jots" system, integrated with the Scratch programming environment, which aims to help learners reflect on their learning processes. The design of the software tool and associated pedagogical strategies is presented in the context of a map of reference frames, which are levels of analysis that learners move between as they reflect. The design of a study to evaluate and further develop the system is described.
Computational theories of mind, and Fodor's analysis of neural network behaviour
Authors: Marcello Guarini
Venue: Journal of Experimental Theoretical Artificial Intelligence (2009)

The purpose of this paper is to examine critically Jerry Fodor's views of the limits of computational neural network approaches to understand intelligence. Fodor distinguishes between two different approaches to computationally modelling intelligence, and while he raises problems with both, he is more concerned with the approach taken by those who make use of neural network models of intelligence or cognition. Fodor's claims regarding neural networks are found wanting, and the implications of these shortcomings for computational modelling of cognition are discussed.
The Role of On-line Facilitators: Types of Collaborative Skills for Effective E-learning Activities
Authors: Tengku Putri Norishah Tengku Shariman, Habibah Abdul Jalil
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

Learning is an active process of acquiring knowledge and skills that humans perform quite naturally, but not all learners are equally capable of effective and efficient learning on their own. Indeed, most will benefit from some level of guidance and support. Collaborative learning encourage discussion among learners and support learners to develop critical thinking skills. It is not, however, guaranteed that such high quality discourse will occur between learners, especially in a computer supported environment. Therefore, this research seeks to identify and examine the role of online facilitators in motivating learners to share and exchange knowledge during computer supported collaborative tasks. This study, based on socio-cultural methods of discourse analysis describes the type of collaborative skills practiced by instructors and peers (who are both considered online facilitators) during computer-mediated communication.
Semantics of Alan
Authors: Francesco Pagliarecci
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

This paper presents a formal definition of Alan. Alan is a programming language that aims to integrate both the agent-oriented and the object-oriented programming. The end is to take advantages from both the paradigms. We define the formal specification of Alan in the rewriting logic language Maude. In this respect, this paper represents the first step towards a complete formal definition of the operational semantics of Alan. This opens us the possibilty of using the wide-spectrum of formal modeling and reasoning supported by Maude: analyzing Alan programs by means of model checking, proving properties of particular Alan programs, and proving general properties of the Alan language.
Research Note---How Much Should You Invest in Each Customer Relationship? A Competitive Strategic Approach
Authors: Andrés Musalem, Yogesh V. Joshi
Venue: Marketing Science (2009)

We analyze firms' decisions to invest in customer relationship management (CRM) initiatives such as acquisition and retention in a competitive context, a topic largely ignored in past CRM research. We characterize each customer by her intrinsic preference towards each firm, the contribution margin she generates for each firm, and her responsiveness to each firm's retention and acquisition efforts. We show that a firm should invest most heavily in retaining those customers that exhibit moderate responsiveness to its CRM efforts. Further, a firm should most aggressively seek to attract those customers that exhibit moderate responsiveness to their provider's CRM efforts and those that are moderately profitable for their current provider. Investing more in customers that are more responsive does not always lead to higher firm profits, because stronger competition for such customers tends to erode the effects of higher CRM efforts of an individual firm. When firms develop a customer relationship over time to generate higher contribution margin or customer responsiveness, we show that such developments may not always be desirable, because sometimes these future benefits may lead to more intense competition and hence lower profits for both firms.