ppxscal/embedding_network huggingface dataset:
Data aggregation in wireless sensor networks using ant colony algorithm
Authors: Wen-Hwa Liao, Yucheng Kao, Chien-Ming Fan
Venue: Journal of Network and Computer Applications (2008)

Data aggregation is important in energy constraint wireless sensor networks which exploits correlated sensing data and aggregates at the intermediate nodes to reduce the number of messages exchanged network. This paper considers the problem of constructing data aggregation tree in a wireless sensor network for a group of source nodes to send sensory data to a single sink node. The ant colony system provides a natural and intrinsic way of exploring search space in determining data aggregation. Moreover, we propose an ant colony algorithm for data aggregation in wireless sensor networks. Every ant will explore all possible paths from the source node to the sink node. The data aggregation tree is constructed by the accumulated pheromone. Simulations have shown that our algorithm can reduce significant energy costs.
The IS Organization of the Future: Impacts of Global Sourcing
Authors: William R. King
Venue: Information Systems Management (2007)

Global sourcing will continue to have a major impact on IS organizations. Fourteen "new" and traditional skills that IS organizations will need in tomorrow's global sourcing environment are highlighted.
Design and evaluation of prosodically-sensitive concatenative units for a Korean TTS system
Authors: Kyuchul Yoon
Venue: Computer Speech and Language (2008)

This paper describes the design and evaluation of prosodically-sensitive concatenative units for a Korean text-to-speech (TTS) synthesis system. The diphones used are prosodically conditioned in the sense that a single conventional diphone is stored as different versions taken directly from the different prosodic domains of the prosodically labeled, read sentences. The four levels of the Korean prosodic hierarchy were observed in the diphone selection process, thereby selecting four different versions of each diphone: three edge diphones from the prosodic domains of the intonational phrase (IP), accentual phrase (AP) and prosodic word (PW), and a non-edge diphone from the domain of the prosodic word. Due to the size of the corpus that we employed, our system covers only 36.4% of the 6503 possible diphones. A listening experiment designed to evaluate the quality of the diphone database showed that listeners preferred stimuli composed of prosodically appropriate diphones. We interpret this as supporting the view that segments carry prosodic domain information.
DG-Based Active Defense Strategy to Defend against DDoS
Authors: Rui Guo, Guiran Chang, Yuhai Qin, Baojing Sun, An Liu, Bencheng Zhang, Dan Peng
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this paper, it is advocated that defenders should take active action to stop DDoS attacks. We propose a new model based on Differential Games theory. Four main actors are included, Attacker, Defender, Victim, and Botnet. It is our belief that Victims who experience an attack should cooperate with Defender to defend for a DDoS-attack. The model indicates the minimum number of Bots that should blocked by Defender. A Differential Games model is used to determine how a Defender combats an Attacker and protect the servers. The feasibility and effectiveness of our approach is validated by measuring the performance of an experimental prototype against a series of attacks. The advantages of the scheme are discussed and further research directions are given.
Architecture of Wireless Sensor Networks with Mobile Sinks: Multiple Access Case
Authors: Liang Song,  Member,  IEEE, Dimitrios Hatzinakos,  Senior Member,  IEEE
Venue: International Journal of Distributed Sensor Networks (2007)

We propose to develop Wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel in the node-to-sink transmission. By exploiting the tradeoff between the successful information retrieval probability and the nodes energy consumption, a number of multiple nodes transmission scheduling algorithms are proposed. Both optimal and suboptimal algorithms, which exhibit exponential and linear complexity respectively, are discussed under the desired application. Computer simulations show that suboptimal algorithms perform nearly as good as the optimal one. The study leads to the cross-layer Wireless Link layer design for MSSN.
Internet Advertising: Theory and Research, Revised edition edition
Authors: David W. Schumann, Esther Thorson
Venue: Advertising And Consumer Psychology Series (2007)

Building on the research presented in their previous edition, Advertising and the World Wide Web (1999), editors David W. Schumann and Esther Thorson offer the expertise of active scholars in the area of Internet advertising in this new volume, and allow readers to reflect on the ever-changing nature of the Internet. Internet Advertising marks this important point in history, taking into account the state of practice, theoretical conceptualizations, empirical research, creative typologies, and potential considerations. Nearly all chapters are in the form of integrated reviews of theory and research, which provide a source of both previous knowledge, as well as future focus for advertising strategy. The volume is arranged in four sections covering:*the foundations of Internet advertising theory;*consumer response to Internet advertising;*topical areas in which Internet advertising has significant influence on the consumer; and*human needs and trends that will likely have significant impact on the future of Internet advertising. This contemporary analysis of Internet advertising will appeal to all practitioners and students of the Internet, and will effectively suit courses taught in this area.
Consistency of Trace Norm Minimization
Authors: Francis R. Bach
Venue: The Journal of Machine Learning Research (2008)

Regularization by the sum of singular values, also referred to as the trace norm, is a popular technique for estimating low rank rectangular matrices. In this paper, we extend some of the consistency results of the Lasso to provide necessary and sufficient conditions for rank consistency of trace norm minimization with the square loss. We also provide an adaptive version that is rank consistent even when the necessary condition for the non adaptive version is not fulfilled.
An optimal replacement policy for repairable cold standby system with priority in use
Authors: Guan Jun Wang, Yuan Lin Zhang
Venue: International Journal of Systems Science (2007)

In this article, a cold standby repairable system consisting of two nonidentical components and one repairman is studied. It is assumed that component 2 after a repair is "as good as new" while component 1 after a repair is not, but component 1 is given priority in use. Under these assumptions, by using the geometric process repair model, we consider a replacement policy N based on the number of failures of component 1 under which the system is replaced when the number of failures of component 1 reaches N. Our problem is to determine an optimal policy N* such that the long-run average cost per unit time (i.e. the average cost rate) of the system is minimized. The explicit expression of the average cost rate of the system is derived and the corresponding optimal replacement policy N* can be determined numerically. Finally, a special system with Weibull-distributed working time and repair time of component 1 is given to illustrate the theoretical results in this article.
A New Forensic Image Format for High Capacity Disk Storage
Authors: Sang Su Lee, Tae-Sik Park, Sang-Uk Shin, Sung-Kyong Un, Do-Won Hong
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In this paper, we describe a new forensic image format which can handle high capacity computer disk storages like IDE, SATA, USB, or etc. And also, it supports metadata that can be defined and extended by users. Especially, it has flag field in which users set the encryption and digital signature algorithms.
Hopping currents for III-V nanostructures in the tight binding approximation
Authors: Argyrios C. Varonides
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Carrier transport and transport mechanisms are the essence of modern microelectronic devices. Illumination of a special class of optical devices generates free carriers in solid-state devices that eventually become collected electric currents. An important transport mechanism in microelectronic devices is hopping conduction form site to site. In this communication, we calculate Nearest Neighbor Hopping (NNH) current densities for III-V heterostructures embedded in the intrinsic layer of p-i-n geometries. We start from a general formalism that relates the density of states in individual wells with the transition probabilities from a quantum well state to any neighboring one, in a superlattice-geometry. In the process, we point out the fact that there is zero hopping-current without Fermi level splitting for any two consecutive layers. Next, and in the tight binding approximation (TBA), we relate the eigen-energies with the transition probabilities and conclude that NNH-currents seem to be of the order of 1mA/cm2, and depend on (a) device geometry (b) temperature (c) conduction band discontinuity and (d) Fermi level splitting.
Useful clustering outcomes from meaningful time series clustering
Authors: Jason R. Chen
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Clustering time series data using the popular subsequence (STS) technique has been widely used in the data mining and wider communities. Recently the conclusion was made that it is meaningless, based on the findings that it produces (a) clustering outcomes for distinct time series that are not distinguishable from one another, and (b) cluster centroids that are smoothed. More recent work has since showed that (a) could be solved by introducing a lag in the subsequence vector construction process, however we show in this paper that such an approach does not solve (b). Motivating the terminology that a clustering method which overcomes (a) is meaningful, while one which overcomes (a) and (b) is useful, we propose an approach that produces useful time series clustering. The approach is based on restricting the clustering space to extend only over the region visited by the time series in the subsequence vector space. We test the approach on a set of 12 diverse real-world and synthetic data sets and find that (a) one can distinguish between the clusterings of these time series, and (b) that the centroids produced in each case retain the character of the underlying series from which they came.
On decay-nondecay and scattering for schrödinger equations with time dependent complex potentials
Authors: Kiyoshi Mochizuki, Takahiro Motai
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

We consider the Schrödinger equations with time dependent complex potentials. Under suitable space-time decaying conditions on the potential we treat L2 decay-nondecay of solutions and also develop a scattering theory.
Multi-ressources K-M&eacute;dians: un algorithme de placement de services web sur les r&eacute;seaux sans fils municipaux
Authors: Julien Gossa, Nipaul Long
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

Nowadays, numerous municipalities are laying free wireless Internet access infrastructures on. These infrastructures are a natural target for the deployment of Web services, such as mapping or multimedia content providing. Regarding the number of clients, ensuring their performances represents one particularly important challenge. Unfortunately, this challenge is hard because of Web services peculiarities: difficult to migrate and replicate, heterogeneous, and highly interdependent. Our proposal is an algorithm designed to build deployment plans for sets of Web services, according to their interdependency while ensuring performances and load balancing. We have shown the efficiency of this algorithm, called MRKM for Multi-Resources K-Median, on the Grid 5000 experimental platform.
Proof of a conjecture on cycles in a bipartite graph
Authors: Hong Wang
Venue: Journal of Graph Theory (1999)

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k &ge; 2, there exists M(k) such that if G= (V1, V2, E) is a bipartite graph with |V1| = |V2| = n &ge; M(k) and d(x) + d(y) &ge; n + k for each pair of nonadjacent vertices x and y of G with x &epsilon; V1 and y &epsilon; V2, then, for any k independent edges e1, &hellip;, ek of G, there exist k vertex-disjoint cycles C1, &hellip;, Ck in G such that ei &epsilon; E(Ci for all i &epsilon; {1, &hellip;, k} and V(C1 ⊎ &middot;&middot;&middot; &cup; Ck) = V(G). This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n &ge; 3k, i.e., M(k) &le; 3k. We will also show that, if n &ge; 3k, then for any k independent edges e1, &hellip;, ek of G, there exist k vertex-disjoint cycles C1, &hellip;, Ck of length at most 6 in G such that ei &epsilon; E(Ci) for all i &epsilon; {1, &hellip;, k}. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 333343, 1999
A modular approach to user-defined symbolic periodicities
Authors: Lavinia Egidi, Paolo Terenziani
Venue: Data Knowledge Engineering (2008)

Many applications in Artificial Intelligence and Data Bases deal with (domain and/or goal-dependent) temporal patterns that repeat regularly over time (periodicities). Hence the need for formal languages that allow users to define periodicities. Among proposals in the literature, symbolic languages are sets of operators for compositional and incremental definition. We propose a new methodology for designing symbolic languages, based on a preliminary analysis of the required expressiveness. The analysis is guided by a classification of the periodicities according to expressiveness properties that are mutually independent. Each of the properties will be then paired with a language operator such that the addition of that operator to a language adds the capability of defining all periodicities having the corresponding property. A modular family of languages with well-defined expressiveness is the result of this process. Moreover, in this paper we instantiate the general methodology by identifying a specific set of properties which we also use in order to classify the expressiveness of different symbolic approaches in the literature.
Thermal and flow analysis of two-dimensional fully developed flow in an AC magneto-hydrodynamic micropump
Authors: Mustafa Abdullah, Hamzeh M. Duwairi
Venue: Microsystem Technologies (2008)

The effect of fluctuating Lorentz force on the Ac magnetohydrodynamic micropump is studied. A two-dimensional transient fully developed laminar flow and temperature distribution are modeled. The governing Navier&#x2013;Stokes and energy equations are solved numerically by a finite-difference (ADI) method. The effect of different parameters on the transient and steady flow velocity and temperature, such as aspect ratio, Hartman number, Prandtl number, and Eckert number is studied. The results obtained showed that controlling the flow and the temperature can be achieved by controlling the potential difference, the magnetic flux, and by a good choice of the electrical conductivity. The effect of Stanton number and phase angle is also included, and it is found that at high frequency, the pulsed volume is small which yield a continuous flow instead of pulsating flow, and the magnitude and direction of the flow can be controlled by the phase shift between the electrical and magnetic fields.
Should We Stop Trusting Trust?
Authors: Greg Goth
Venue: IEEE Internet Computing (2008)

YouTube's global visibility and the context in which it was blocked — by a state-operated telecommunications provider acting as a censor — combined to greatly increase worldwide attention on interdomain routing and the vulnerabilities inherent in routing protocols, Border Gateway Protocol (BGP) in particular, that can cripple the network.
Exploring true multi-user multimodal interaction over a digital table
Authors: Edward Tse, Saul Greenberg, Chia Shen, Clifton Forlines, Ryo Kodama
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

True multi-user, multimodal interaction over a digital table lets co-located people simultaneously gesture and speak commands to control an application. We explore this design space through a case study, where we implemented an application that supports the KJ creativity method as used by industrial designers. Four key design issues emerged that have a significant impact on how people would use such a multi-user multimodal system. First, parallel work is affected by the design of multimodal commands. Second, individual mode switches can be confusing to collaborators, especially if speech commands are used. Third, establishing personal and group territories can hinder particular tasks that require artefact neutrality. Finally, timing needs to be considered when designing joint multimodal commands. We also describe our model view controller architecture for true multi-user multimodal interaction.
SOPHIA-TCBR: A knowledge discovery framework for textual case-based reasoning
Authors: David Patterson, Niall Rooney, Mykola Galushka, Vladimir Dobrynin, Elena Smirnova
Venue: Knowledge-Based Systems (2008)

In this paper, we present a novel textual case-based reasoning system called SOPHIA-TCBR which provides a means of clustering semantically related textual cases where individual clusters are formed through the discovery of narrow themes which then act as attractors for related cases. During this process, SOPHIA-TCBR automatically discovers appropriate case and similarity knowledge. It then is able to organize the cases within each cluster by forming a minimum spanning tree, based on their semantic similarity. SOPHIA's capability as a case-based text classifier is benchmarked against the well known and widely utilised k-Means approach. Results show that SOPHIA either equals or outperforms k-Means based on 2 different case-bases, and as such is an attractive approach for case-based classification. We demonstrate the quality of the knowledge discovery process by showing the high level of topic similarity between adjacent cases within the minimum spanning tree. We show that the formation of the minimum spanning tree makes it possible to identify a kernel region within the cluster, which has a higher level of similarity between cases than the cluster in its entirety, and that this corresponds directly to a higher level of topic homogeneity. We demonstrate that the topic homogeneity increases as the average semantic similarity between cases in the kernel increases. Finally having empirically demonstrated the quality of the knowledge discovery process in SOPHIA, we show how it can be competently applied to case-based retrieval.
Co-present photo sharing on mobile devices
Authors: Leonard M. Ah Kun, Gary Marsden
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

The paper reports a mobile application that allows users to share photos with other co-present users by synchronizing the display on multiple mobile devices. Various floor control policies (software locks that determine when someone can control the displays) were implemented. The behaviour of groups of users was studied to determine how people would use this application for sharing photos and how various floor control policies affect this behaviour. Explicit policies was shown to be the best strategy for structured presentations, but when all locks were removed, the users created a new form of social interaction which seemed to be a more compelling use of the technology than the original, intended, application.
Personal Autonomic Desktop Manager with a Circulatory Computing Approach
Authors: Alberto Arkader Kopiler, Inês De Castro Dutra, Felipe Maia Galvao França
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

In this paper we present the architecture for the Personal Autonomic Desktop Manager, a self managing application designed to act on behalf of the user in several aspects: protection, healing, optimization and configuration. The overall goal of this research is to improve the correlation of the autonomic self* properties and doing so also enhance the overall self-management capacity of the desktop (autonomicity). We introduce the Circulatory Computing (CC) model, a self-managing system initiative based on the biological metaphor of the cardiovascular system, and use its concepts in the design and implementation of the architecture.
Controlling Control Flow in Web Applications
Authors: Robin Message, Alan Mycroft
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Control flow is often key problem in current web applications. For example, using the back button gives a POSTDATA error, using multiple windows books the wrong hotel, and sending a link to a friend does not work. Previous solutions used continuations as a model for user interaction. However continuations are insufficient as a model of all web interactions. We believe the protocol and browsers themselves are insufficiently powerful to represent the control flow desired in a web application. Our solution is to extend the protocol and browser sufficiently that these problems can be avoided. We seek to be agnostic about how web applications are written and instead recognise that many of the problems stem from underlying weaknesses in the protocol. As an example, the application ought to be able to inform the browser that pressing back on a payment confirmation page is not allowed. Instead, the cached page can be displayed in a read-only, archive fashion to the user, or a new page can be shown instead which is consistent with the global state. We discuss how some of these ideas may be implemented within the existing HTTP/1.1 protocol; and what modest extensions to the protocol would enable full implementation. We also discuss the interaction with Web 2.0 and the security and privacy implications of our extensions.
Integrating cognitive apprenticeship methods in a Web-based educational technology course for P-12 teacher education
Authors: Michele D. Dickey
Venue: Computers Education (2008)

The purpose of this study is to investigate the integration of a cognitive apprenticeship model in a Web-based course. The subject of this study is an educational technology course for pre-service P-12 teacher education students. Specifically, this study presents student reports of how cognitive apprenticeship methods impacted student learning processes of (a) technology skills and (b) technology integration methods for teaching. The methodological framework for this qualitative investigation is an interpretive case study. Student reflections and teacher observations revealed that students found modeling, coaching, scaffolding, and exploration key to fostering skill knowledge, and they found the use of cognitive apprenticeship methods fostered an understanding of integrating technology for teaching and learning.
A characterization of (&gamma;, i)-trees
Authors: E. J. Cockayne, O. Favaron, C. M. Mynhardt, J. Puech
Venue: Journal of Graph Theory (2000)

We characterize trees with equal domination and independent domination numbers in terms of the sets of vertices of the tree which are contained in all its minimum dominating and minimum independent dominating sets. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 277&ndash;292, 2000