ppxscal/embedding_network huggingface dataset:
Foundations and Applications of Sensor Management, 1st edition
Authors: Alfred O. Hero, David A. Castan, Douglas Cochran, Keith Kastella
Venue:  (2007)

Foundations and Applications of Sensor Management presents the emerging theory of sensor management with applications to real-world examples such as landmine detection, adaptive signal and image sampling, multi-target tracking, and radar waveform scheduling. It is written by leading experts in the field for a diverse engineering audience ranging from signal processing, to automatic control, statistics, and machine learning. The level of treatment of the book is tutorial and self-contained. The chapters of the book follow a logical development from theoretical foundations to approximate approaches and ending with applications. The coverage includes the following topics: stochastic control foundations of sensor management; multi-armed bandits and their connections to sensor management; information-theoretic approaches; managed sensing for multi-target tracking; approximation methods based on embedded simulation; active learning for classification and sampling; and waveform scheduling for radar. An appendix is included to provide essential background on topics the reader may not have encountered as a first-year graduate student: Markov decision processes; information theory; and stopping times. Foundations and Applications of Sensor Management is an important reference for signal processing and control engineers and researchers as well as machine learning application developers.
A closed-form expression for the quantile function of the Gompertz-Makeham distribution
Authors: P. Jodrá
Venue: Mathematics and Computers in Simulation (2009)

In this note, we give a closed-form expression in terms of the Lambert W function for the quantile function of the Gompertz-Makeham distribution. This probability distribution has frequently been used to describe human mortality and to establish actuarial tables. The analytical expression provided for the quantile function is helpful to generate random samples drawn from the Gompertz-Makeham distribution by means of the inverse transform method.
Partial Key Exposure Attack on CRT-RSA
Authors: Santanu Sarkar, Subhamoy Maitra
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

Consider CRT-RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponents d p , d q . Jochemsz and May (Crypto 2007) presented that CRT-RSA is weak when d p , d q are smaller than N 0.073. As a follow-up work of that paper, we study the partial key exposure attack on CRT-RSA when some Most Significant Bits (MSBs) of d p , d q are exposed. Further, better results are obtained when a few MSBs of p (or q) are available too. We present theoretical results as well as experimental evidences to justify our claim. We also analyze the case when the decryption exponents are of different bit sizes and it is shown that CRT-RSA is more insecure in this case (than the case of d p , d q having the same bit size) considering the total bit size of d p , d q .
A multivariate comparison of computer anxiety levels between candidate and tenured school principals
Authors: Mustafa Baloğlu, Vildan Çevik
Venue: Computers in Human Behavior (2009)

School administrators should be able to follow technological advancements and promote the role of leadership with regard to technology in their institutions. However, affective factors such as computer anxiety might hinder administrators' roles in this process. Therefore, this study investigated multivariate differences between candidate and tenured administrators on computer anxiety levels, after accounting for differences in age. The sample of the study included 216 candidates and 368 tenured school principals. The Computer Anxiety Scale and a set of demographic questions were used to collect the data. One-way multivariate analysis of covariance (MANCOVA) was performed on three dependent variables that are the three dimensions of computer anxiety (i.e., Affective Anxiety, Damaging Anxiety, and Learning Anxiety). Independent variable had two levels (i.e., candidate versus tenured administrators) and age was used as a covariate. Results showed multivariate significant differences. Candidate administrators reported higher levels of affective and learning anxiety compared to their tenured colleagues. We conclude that the sample of the study had accessibility and familiarity with computers; yet, showed different experiences. Finally, refinement is still needed in the area of computer anxiety and its relationships with other variables among educational administrators.
Object Configuration Reconstruction from Descriptions using Relative and Intrinsic Reference Frames
Authors: H. Joe Steinhauer
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We provide a technique to reconstruct an object configuration that has been described on site by only using intrinsic and relative frames of reference into an absolute frame of reference, as seen from the survey perspective.
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices
Authors: Allan Frendrup, Preben Dahl Vestergaard, Anders Yeo
Venue: Graphs and Combinatorics (2009)

Let G be a 2-edge-connected simple graph with girth g, independence number &#x03b1;(G), and if one of the following two conditions holds &#x03b1;(G)&#x00a0;&#x2264;&#x00a0;2; &#x03b1;(G)&#x00a0;&#x2265;&#x00a0;3, and for any three nonadjacent vertices v i &#x00a0;(i&#x00a0;=&#x00a0;1,2,3), it has $$\sum\limits_{i=1}^{3}d_{G}(v_i) \geq \nu - 3g +7$$, k &#x2265; 2, of V, let &#x03b3; t (G; V i ) be the cardinality of a smallest subset of V such that every vertex of V i has a neighbour in it and define the following $$\begin{array}{l} f_t(G; V_1, V_2, \ldots , V_k) = \gamma_t(G) + \gamma_t(G; V_1) + \gamma_t(G; V_2) +\cdots +\gamma_{t}(G;V_k) \\ f_t(G; k) = \max \{ f_{t}(G; V_1, V_2,\ldots , V_k) \mid V_1, V_2, \ldots , V_k {\rm is a partition of } V\} \\ g_t(G; k) = \max\{ \Sigma _{i=1}^{k}\gamma_t(G; V_i) \mid V_1, V_2, \ldots, V_k {\rm is a partition of } V \} \end{array}$$ We summarize known bounds on &#x03b3;t (G) and for graphs with all degrees at least &#x03b4; we derive the following bounds for f t (G; k) and g t (G; k). For &#x03b4;&#x00a0;&#x2265;&#x00a0;2 and k &#x2265; 3 we prove f t (G; k)&#x00a0;&#x2264;&#x00a0;11|V|/7 and this inequality is best possible. for &#x03b4;&#x00a0;&#x2265;&#x00a0;3 we prove that f t (G; 2)&#x00a0;&#x2264;&#x00a0;(5/4&#x00a0;&#x2212;&#x00a0;1/372)|V|. That inequality may not be best possible, but we conjecture that f t (G; 2) &#x2264; 7|V|/6 is. for &#x03b4;&#x00a0;&#x2265;&#x00a0;3 we prove f t (G; k)&#x00a0;&#x2264;&#x00a0; 3|V|/2 and this inequality is best possible. for &#x03b4;&#x00a0;&#x2265; 3 the inequality g t (G; k) &#x2264; 3|V|/4 holds and is best possible.
Event Correlations in Sensor Networks
Authors: Ping Ni, Li Wan, Yang Cai
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

In this paper we present a novel method to mine the correlations of events in sensor networks to extract correlation patterns of sensors' behaviors by using an unsupervised algorithm based on a hash table. The goal is to discover anomalous events in a large sensor network where its structure is unknown. Our algorithm enables users to select the correlation confidence level and only display the significant event correlations. Our experiment results show that it can discover significant event correlations in both continuous and discrete signals from heterogeneous sensor networks. The applications include smart building design and large network data mining.
Sustaining Innovations in Singapore Schools: Implications for Research Work
Authors: Chee-Kit Looi, Wei-Ying Lim, David Hung
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper explores the broad issues of why the meaningful use of ICT to engage in deep learning has not been widespread in K-12 schools. We argue a critical reason is the lack of sustainability in the implementation of ICT-enabled pedagogies in schools, arising from a failure to understand the conditions for systemic innovations. We describe the key issues related to sustainability from literature, and contextualized some of these issues using 2 examples of innovations that have been implemented in the Singapore schools. Implications are then drawn with respect to how research work should be conducted with a view of sustainability, how to build up capacity of researchers and teacher implementers to push innovations, and new methods of analysis for studying sustainability.
Catching the drift: learning broad matches from clickthrough data
Authors: Sonal Gupta, Mikhail Bilenko, Matthew Richardson
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Effective broad matching leads to improvements in both relevance and monetization, while increasing advertisers' reach and making campaign management easier. In this paper, we present a learning-based approach to broad matching that is based on exploiting implicit feedback in the form of advertisement clickthrough logs. Our method can utilize arbitrary similarity functions by incorporating them as features. We present an online learning algorithm, Amnesiac Averaged Perceptron, that is highly efficient yet able to quickly adjust to the rapidly-changing distributions of bidded keywords, advertisements and user behavior. Experimental results obtained from (1) historical logs and (2) live trials on a large-scale advertising platform demonstrate the effectiveness of the proposed algorithm and the overall success of our approach in identifying high-quality broad match mappings.
A Programmatic Approach to Applying Sympathetic and Parasympathetic Autonomic Systems to Software Design
Authors: Philip Miseldine, Azzelarabe Taleb-Bendiab
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

Research into solving the problems that the recent rapid evolution of hardware and software technology and increasing consumer requirements has yielded, produced several Autonomic Computing initiatives, spearheaded by IBM. This paper contends that whilst this research is inspired by the Autonomic Nervous System (ANS), current implementations have treated the ANS as a single system, rather than as two disparate, competing systems: the sympathetic and parasympathetic nervous systems. In this paper, the authors show how the current limitations in state-of-the-art autonomic system implementations that hinder the successful representation of such sub systems and their conflicts can be overcome through the specification, design and development of a runtime introspective programming language, Neptune. An introduction to the Neptune specific CA-SPA (Concept Aided Situation-Prediction-Action) methodology for policy definition is given, as is the Cloud framework that hosts Neptune objects in an autonomic grid framework An evaluation of the language is given using illustrative examples based on sympathetic and parasympathetic scenarios, concluding with a summary of the further aims of the research.
Cooperative media streaming using adaptive network compression
Authors: Janus Heide, Jesper H. Sorensen, Rasmus Krigslund, Petar Popovski, Torben Larsen, Jacob Chakareski
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Media content distribution constitutes a growing share of the services on the Internet. Two distinct distribution approaches used today are Layered Coding (LC) and Multiple Description Coding (MDC). Current wireless connection technologies, e.g. Wimax, have properties which make them unsuitable for media distribution using traditional approaches. In particular, the asymmetric relationship between the uplink and the downlink bandwidth makes the cooperative distribution difficult. A promising concept, termed MDC with Conditional Compression (MDC-CC), has been proposed [11], which essentially acts as an adaptive hybrid between LC and MDC. In order to facilitate the use of MDC-CC, a new overlay network approach is proposed, using tree of meshes. A control system for managing description distribution and compression in a small mesh is implemented in the discrete event simulator NS-2. The two traditional approaches, MDC and LC, are used as references for the performance evaluation of the proposed scheme. The system is simulated in a heterogeneous network environment, where packet errors are introduced. Moreover, a test is performed at different network loads. Performance gain is shown over both LC and MDC.
The DSML4MAS development environment
Authors: Stefan Warwas, Christian Hahn
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This paper presents the Dsml4mas Development Environment (DDE) which is a model-driven framework for the development of multiagent systems based on the Domain Specific Modeling Language for Multiagent Systems (Dsml4-mas).
On Devaney's definition of chaos for discontinuous dynamical systems
Authors: Byungik Kahng
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

One of the most widely accepted definition of chaos is the one by Devaney, which we will call Devaneychaos. It consists of three conditions, (1) the sensitive dependence upon the initial condition, (2) the topological transitivity, and (3) the dense distribution of the periodic orbits. The third condition is often omitted for being too stringent. The purpose of our research is to investigate how the first two characteristic properties of Devaneychaos are affected by the presence of the discontinuity, and subsequently, what kind of adjustments must be made to improve Devaney-chaos so that it can be applied to discontinuous dynamical systems as well as continuous systems. Under the afore-mentioned adjustments, we prove that the first two conditions of Devaney-chaos can be successfully used to characterize the complex orbit behavior of general 2-dimensional discontinuous dynamical systems. Also, we show that the straightforward application of unadjusted Devaney-chaos is too inclusive when the system is discontinuous, consequently necessitating the afore-mentioned adjustments. We use the classification theorems of the singularities of the piecewise isometric dynamical systems as the main tools.
Plenary lecture I: direct and time reverse problems for hyperbolic heat equation - new models for intensive steel quenching processes
Authors: Andris Buikis
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

Intensive quenching processes are important branches of modern metallurgical technologies. In new ecologically clean steel quenching processes important aspect is the heat exchange with the surrounding cold water. But the type of heat exchange is mostly defined by initial heat flux densities: if initial heat flux density is higher as first critical heat flux density, then the full film boiling is observed. If the initial heat flux density is lower, then the nucleate boiling establishes on the sample's surface. This is the preferable type of heat exchange process, because it provides the intensity of the process and defines the quality of the obtained material. In 2005 we proposed the hyperbolic heat equation as mathematical model for intensive steel quenching process. In several papers during 2005-2008 we have developed some approaches (Green function method, original conservative averaging method) for the solving of ill-posed time reverse problems for the parabolic part of the hyperbolic heat equation. These ideas gave quite good compatibility of theoretical and experimental initial heat flux densities. In this lecture we develop some new ideas for the solving of time reverse problems for the hyperbolic heat equation. They lead us to well-posed statements for determination of initial heat fluxes instead of ill-posed statements as it was in our previous papers.
Simulating the behaviour of older versus younger users when interacting with spoken dialogue systems
Authors: Kallirroi Georgila, Maria Wolters, Johanna D. Moore
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

In this paper we build user simulations of older and younger adults using a corpus of interactions with a Wizard-of-Oz appointment scheduling system. We measure the quality of these models with standard metrics proposed in the literature. Our results agree with predictions based on statistical analysis of the corpus and previous findings about the diversity of older people's behaviour. Furthermore, our results show that these metrics can be a good predictor of the behaviour of different types of users, which provides evidence for the validity of current user simulation evaluation metrics.
Putting interference to work in the design of a whole-class learning activity
Authors: Tom Moher
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

Who's Who is a single-display groupware application designed for use by an entire class of young students. Utilizing a shared display, each user controls the state of discrete display elements using a simple interface on a handheld device; however, the semantics of user operations are left unspecified and become the subjects of guided student discovery. Interference among users is leveraged in support of student learning about the scientific principle of "control of variables," in particular, the strategy of varying one independent variable at a time in multivariate systems. We present the experience of a third-grade classroom that used Who's Who, including both an account of learning outcomes and a description of the technology and social interactions that led to those outcomes.
Processing data for colored noise using a dynamic state estimator
Authors: Marius-Constantin Popescu, Onisifor Olaru, Nikos Mastorakis
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

This paper treats data reduction in array processing for the spatially colored noise case. The purpose is to reduce the computational complexity of the applied signal processing algorithms by mapping the data into a space of lower dimension by means of a linear transformation. We discuss ways to implement the transformation and show that it suffices to estimate the array covariance matrix instead of the noise covariance matrix in the design process of the optimal transformation. Computer simulations are given that illustrate the problem of interference from out-of-band-sources that result when a beamspace transformation is designed to focus on a particular sector. The presents an dynamic state estimator. The method uses ANN based bus load prediction for the prediction step in the DSE.
Towards reliable reputations for distributed applications
Authors: Ben Y. Zhao, Kevin C. Almeroth
Venue:  (2008)

The Internet today is experiencing a rapid growth in popularity of online communities like P2P file sharing networks, Wikis, and distributed web applications like Flickr and YouTube. The open and anonymous nature that makes interacting in these applications so popular also makes them vulnerable to attacks from malicious and self-interested users. A large amount of research proves that digital reputations are an effective solution to the problem of user maliciousness in such networks. A reputation is a statistical estimate of a user's trustworthiness computed from feedback given by previous transaction partners to the user. There are some fundamental "reliability" concerns, however, that limit the effectiveness of existing reputations mechanisms and their potential impact in network protocols and distributed applications today. Current reputation schemes are still highly vulnerable to false ratings attacks posed by malicious individuals, Sybils, and colluders. Furthermore, high churn rates in dynamic networks pose a serious challenge to the adoption of reputation systems that depend on long-term participation for accuracy. We believe that, when building distributed applications, trust should be as important a consideration as traditional issues like latency and fault-tolerance. In this dissertation, therefore, we address the critical reliability concerns that limit the effectiveness of reputations. We develop a scalable and globally decoupled reputations approach that disassociates every user's service provider reputation from its service referral reputation, thereby making reputations robust to feedback tampering. We also design a statistical metric that estimates reputation inflation via collusion, and demonstrate its effectiveness on eBay.com reputation profiles. To address the challenge posed by network churn, we develop proactive reputations, an approach that establishes quick and accurate reputations for unknown peers or newcomers in reputation systems. Finally, this dissertation compares feedback-based reputations with a new and increasingly popular paradigm to establish digital trust, one presented by social networks.In summary, this dissertation significantly improves the state-of-the-art in reputation systems and advances the growth of next-generation distributed applications by improving their resistance to trust-based vulnerabilities.
Why a collaborative approach is needed in innovation adoption: the case of ERP
Authors: David Sammon, Frederic Adam
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

There is an abundant literature on IS adoption, aimed at both the individual and organizational levels of analysis. This literature highlights the complexity of the process of IT adoption and implementation and the importance of carrying out relevant and applicable research in this area. The area of ERP adoption has been particularly rich in the last 15 years, as increasing numbers of companies acquired ERP with comparatively low success rates. In this paper, we hypothesise that the high failure rate of ERP implementations is related to the failure to adopt a truly collaborative approach in the ERP project. In order to verify our ideas, we carried out four case studies of firms having implemented ERP, seeking to confirm if there was a relation between the level of collaboration they had achieved and their level of success with the application. Our findings confirm the importance and core value of the People factor in the success of an ERP project --the Best Personnel Factor, as we labeled it, and of all the sub-factors connected to it, upstream and downstream, We conclude that, when these aspects of the collaborative process followed by organizations coherently fall into place, the probability of success with ERP is higher.
A Proof of Plotkin's Conjecture
Authors: Lei Yinbin, Luo Maokang
Venue: Fundamenta Informaticae (2009)

In 1978, G. Plotkin [7] conjectured that for the three-element truthvalue dcpo T, if &kappa; > &omega; then the function space [T$^{&kappa;}$ &rarr; T$^{&kappa;}$] is not a retract of T$^{&kappa;}$. In this short paper, we constructively prove a stronger result that if &kappa; > &omega; then the function space [T$^{&kappa;}$ &rarr; T$^{&kappa;}$] is not a retract of the Cartesian product of any family of finite posets. Thus Plotkin's Conjecture is proved to be correct.