ppxscal/embedding_network huggingface dataset:
A novel centralised clustering algorithm for energy efficient wireless sensor networks
Authors: Stefano Colombo, Naveen Chilamkurti, Sherali Zeadally
Venue: International Journal of Autonomous and Adaptive Communications Systems (2008)

Wireless Sensor Networks (WSNs) consist of a large number of low-power nodes sensing data from the environment. The sensor nodes are equipped with small and often irreplaceable batteries with limited power capacity. One of the areas of sensor networking that has attracted a lot of attention recently is the prolonging of the life span of sensor networks by exploiting energy-efficient routing schemes. We propose a novel energy-efficient centralised clustering algorithm for WSN. The proposed algorithm generates a set of possible clustering alternatives from which it selects the optimal clustering. We also present a performance evaluation of the proposed algorithm using two performance metrics Max-min and Max-sum. We found that Max-sum yields superior performance. In addition, our proposed algorithm improves the system lifetime performance over Low Energy Adaptive Clustering Hierarchy-C by almost 15%. We also compare performance results obtained with the chosen metric (Max-sum) with those obtained using other strategies (such as random and configuration 0). The Max-sum metric outperforms the random and configuration 0 strategies by almost 8.5 and 11%;, respectively, for system lifetime. Moreover, we found that the total amount of data collected using the Max-sum metric is at least 9% higher than with random and configuration 0 strategies.
Messaging design and beyond: learning from a user study on holiday greeting messages
Authors: Yanqing Cui
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

The design of text messaging keeps the same ever since invented. However, the relevant user practice has already diverted from its intended use. The latest example is that through it people send holiday greetings to friends or acquaintances. In this study, we gathered and analyzed the message logs of twenty-two participants during a holiday week. The user data demonstrated that holiday greeting messages were different from everyday messages in terms of message size, character content, and contact circles. Greeting messages were likely to be "singles" - the messages that did not solicit a response. Based on the findings, we propose a message classification framework and discuss design implications for messaging, and mobile interaction design in general.
Sensor movement simulation techniques in 3D finite element modelling of eddy current non destructive testing
Authors: M. Rachek, M. Feliachi, M. Zaouia
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This paper presents numerical modelling of eddy currents non destructive testing in three dimensional plate work piece. The three dimensional governing field's equations are expressed in terms of coupled magnetic vector and electric scalar potentials AV in conducting media and simply magnetic vector potential in non conducting regions. The problem is solved by 3D finite element discretisation implemented in Matlab software. The displacement of the sensor operating in differential mode is simulated without remeshing the study domain. The proposed method is based on one of a Geometrical Band Technique (GBT) using the physical properties assignment and the Nodal Interpolation Technique (NIT) based on the connection between separately homogeneous fixed and moving meshes. The impedance change at each position of the sensor is then computed, which permits to keep the presence of defect and its influence on the eddy current distribution.
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Authors: Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph. Minimum Spanning Tree Heuristic (MSTH) is a heuristic for solving the Steiner problem in graphs. In this paper we first review existing algorithms for solving the Steiner problem in graphs. We then introduce a new parallel version of MSTH on three dimensional mesh of trees architecture. We describe our algorithm and analyze its time complexity. The time complexity analysis shows that the algorithm&#x2019;s running time is O(lg2 n) which is comparable with other existing parallel solutions.
CPOP: Cryptography Process Offloading Proxy for Resource Constrained Devices
Authors: Yu-Shu They, Seong-Yee Phang, Sanggon Lee, HoonJae Lee, Hyotaek Lim
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Feasibility study on implementing a strong cryptographic function for resource constrained devices such as embedded devices has been carry out over the past. These studies found that it is not efficient to run an extensive security solution to those devices. For that reason, we tense to provide a security offloading approach to minimize the computing resources involved but maximizing the security functionality. The resource constrained devices will communicate to a centralize security server which we named it CPOP before sending or receiving packets from a not trusted network entity. CPOP is a Cryptography Process Offloading Proxy which will offload the cryptography processes such as encryption, decryption and etc to provide secure communication across the network. A prototype of CPOP has been developed and performance analyses results are obtained to justify the feasibility of our approach in providing security services to embedded devices with only limited processing capabilities.
Computerised data acquisition and processing in measurement of raster scales
Authors: Mindaugas Rybokas
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

The development and implementation of computerised control of measurements and the simulation and calculation of measurement of raster scales and transducers are discussed. The number of strokes in circular raster scales exceeds hundreds or thousands, so it is impossible to calibrate the scales and calculate the results using conventional methods without computer interaction. An example of the new approach to computer simulation of the circular scales calibration process with the reference measure is given, creating the model of measurement and simulating the instrumental steps performed on the object, the comparison with reference measure and the evaluation of systematic error, uncertainty, numerical and graphical presentation of the results.
Dimensioning and optimization of push-to-talk over cellular server
Authors: M. T. Alam, Z. D. Wu
Venue: International Journal of Network Management (2008)

The PoC (push-to-talk over cellular) application allows point-to-point or point-to-multipoint voice communication between mobile network users. The related work over PoC focuses on the performance analysis only and is ignorant about dimensioning a PoC controller to optimize revenue for service providers. In this paper, we dimension a PoC service with the assumption that the network grade of service is provided. The on-demand sessions should have access priority over pre-established sessions. A PoC controller should be able to terminate a PoC session based on an optimal timer. Moreover, the number of simultaneous session initiations by a PoC client is also a configurable parameter. We derived relations to provide access priority to special PoC sessions based on available transmit/receive units (TRU) and threshold level. Load sharing expressions are reported for a PoC controller using the Lagrange multiplier technique. A simple relation to control the PoC session timer is proposed. Finally, the derivation of maximum number of allowable simultaneous sessions is depicted using two-state Markov models. Numerical results have been computed with the corresponding derivation to provide a useful insight into the system behaviour. A PoC service can benefit from these optimal values of our work during the busy hour.
Estimation of the parameters of multichannel autoregressive signals from noisy observations
Authors: Alimorad Mahmoudi, Mahmood Karimi
Venue: Signal Processing (2008)

This paper is concerned with estimation of multichannel autoregressive (MAR) model parameters using noisy observations. The NILS method proposed in W.X. Zheng [A new estimation algorithm for AR signals measured in noise, in: Proceedings of the ICSP Conference 1, 2002, pp. 186-189] for estimation of the parameters of noisy scalar autoregressive (AR) signals is generalized to the multichannel case. An improved least-squares-based parameter estimator is introduced so that the variance-covariance matrix of the multichannel noise can be estimated in an iterative manner. With this, the noise-induced estimation bias can be removed to yield the unbiased estimate of the MAR parameters. In a simulation study, the performance of the proposed unbiased estimation algorithm is evaluated and compared with that of the existing parameter estimation methods.
A new efficient privacy-preserving scalar product protocol
Authors: Artak Amirbekyan, Vladimir Estivill-Castro
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Recently, privacy issues have become important in data analysis, especially when data is horizontally partitioned over several parties. In data mining, the data is typically represented as attribute-vectors and, for many applications, the scalar (dot) product is one of the fundamental operations that is repeatedly used. In privacy-preserving data mining, data is distributed across several parties. The efficiency of secure scalar products is important, not only because they can cause overhead in communication cost, but dot product operations also serve as one of the basic building blocks for many other secure protocols. Although several solutions exist in the relevant literature for this problem, the need for more efficient and more practical solutions still remains. In this paper, we present a very efficient and very practical secure scalar product protocol. We compare it to the most common scalar product protocols. We not only show that our protocol is much more efficient than the existing ones, we also provide experimental results by using a real life dataset.
Semantic validation for XML updates
Authors: Wei Ni, Tok Wang Ling
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

For data centric XML data, updates bring the problem of validation that the updated data must conform to both structural and semantic constraints according to XML schemas. Most existing XML validation works today are concentrated on structural constraints with respect to DTD and XML. Schema (XSD). However, because DTD/XSD schema is too limited to express complex data semantics, they cannot be used to validate semantic constraints in XML. Meanwhile, there are few works concentrated on how to validate semantic constraints. In this paper, we investigate ORA-SS [16], a rich semantic data model, for XML data. We derive a set of important semantic constraints with respect to the data semantics in ORA-SS model including nary relationship types (n&ge;2), relationship attributes, object IDs and ID references, and semantic dependencies, etc, which cannot be captured by DTD/XSD schema. Then, we discuss how to validate these semantic constraints in XML updates with the help of ORASS.
Determining the Impact of Software Engineering Research on Practice
Authors: Leon J. Osterweil, Carlo Ghezzi, Jeff Kramer, Alexander L. Wolf
Venue: Computer (2008)

The Impact Project provides a solid and scholarly assessment of the impact software engineering research has had on software engineering practice. The assessment takes the form of a series of studies and briefings, each involving literature searches and, where possible, personal interviews.
An optimal multimedia object allocation solution in transcoding-enabled wide-area storage systems
Authors: Wenyu Qu, Kazuo Goda, Masaru Kitsuregawa
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Together with the information explosion era comes the problem of high energy consumption in data centers. Among the various components of a data center, storage is one of the biggest energy consumers. Many efforts have been put on reducing energy consumptions of data centers/storage systems, from server workflow management to storage data allocation. However, most works focus on local storage systems and pay no attention to other structures of storage systems. With the exponential expanding on both the depth and width of the Internet, wide-area storage systems attract more and more attention as they are reliable, load-balancing, and easy to collaborate. In this paper, we study the energy consumption in wide-area storage systems by using multimedia objects as our special application area. We develop a multimedia object distributing algorithm based on the access pattern to multimedia objects and the topology of storage systems. We also present an in-depth analysis that provides valuable insight into the characteristics of multimedia object distribution strategies and leads to precision guarantees.
Verifying policy-based web services security
Authors: Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract language for specifying secure links between web services and their clients. We present the architecture and implementation of tools that (1) compile policy files from link specifications, and (2) verify by invoking a theorem prover whether a set of policy files run by any number of senders and receivers correctly implements the goals of a link specification, in spite of active attackers. Policy-driven web services implementations are prone to the usual subtle vulnerabilities associated with cryptographic protocols; our tools help prevent such vulnerabilities. We can verify policies when first compiled from link specifications, and also re-verify policies against their original goals after any modifications during deployment. Moreover, we present general security theorems for all configurations that rely on compiled policies.
The Tools for Successful Online Teaching
Authors: Lisa Dawley
Venue:  (2007)

Online education continues to grow exponentially, and the majority of universities now offer online courses. However, the unprecedented explosion of online learning courses has resulted in increased demands for online teachers, and regular classroom teachers are often asked to teach in an online environment. Tools for Successful Online Teaching introduces teachers to the tools of the learning management system (LMS), or the online learning environment. These tools, including chat, threaded discussion, e-mail, surveys, exam builders, and more, are explored to show the strengths and weaknesses of each tool. Multiple examples of objectives and activities are provided to instill a deep understanding, and the reader will gain a long-term ability to create a unique curriculum.
Prenex normal form in linguistic quantifiers modeled by Sugeno integrals
Authors: Wang San-min, Zhao Bin
Venue: Fuzzy Sets and Systems (2008)

In this paper, Ying's prenex normal form theorem for linguistic quantifiers is strengthened so that it behaves like the one in the classical logic. This result further shows elegant logical properties of Ying's framework.
Automated design of a lightweight block cipher with Genetic Programming
Authors: Javier Polimón, Julio C. Hernández-Castro, Juan M. Estévez-Tapiador, Arturo Ribagorda
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

In this paper, we present a general framework for the automated design of cryptographic block ciphers by using Genetic Programming. We evolve highly nonlinear and extremely efficient functions that can be used as core components of any cryptographic construction. As an example, a new block cipher named Raiden is proposed. We present a preliminary security analysis of our proposal and a comparison in terms of performance with similar block ciphers such as TEA. The results show that automatically-obtained schemes, such as the one presented here, could be competitive both in security and speed.
Collaborative Privacy Management System
Authors: In Joo Jang, Wenbo Shi, Hyeong Seon Yoo
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In this paper, we consider a problem of monopolistic information management technologies. Most service providers have an access to any information. Even though the information is really a personal data, service providers can access with it merely with the user’s first subscription. A Collaborative Privacy Management System (Co-PMS) is suggested to satisfy the requirement. In this scheme, each user will provide ones own privacy policy by using a policy creation interface. The policy negotiation engine performs collaborative process with the certain service’s data disclosure policy. This architecture provides more powerful right to each user to access ones own privacy policy and personal information. It also reinforces the security because of diverse privacy policy. It will develop the privacy policy based on security systems. We also expect the encrypted privacy policy to be used as an authentication certification
One-Up, One-Back ERM in the Food Supply Chain
Authors: Guy H. Gessner, Linda Volonino, Lynn A. Fish
Venue: Information Systems Management (2007)

Repeated outbreaks of E. coli and other food poisonings call attention to the need for fast, accurate tracing capabilities to identify sources of contamination and track contaminated foods to their destinations. Concerns about biological agents contaminating food or beverages led to the U.S. Bioterrorism Act of 2002. This Act requires those in the food supply chain to identify the immediate previous source ("one-back") of all food received and the immediate subsequent recipient ("one-up") of all food released, but recordkeeping remains seriously inadequate. In this article, we examine the role of radio frequency identification (RFID) in electronic record management (ERM) to improve supply chain operations and responses to public health crises.
Ambient Intelligence Applications: Introducing the Campus Framework
Authors: Amal El Fallah Seghrouchni, Karin Breitman, Nicolas Sabouret, Markus Endler, Yasmine Charif, Jean-Pierre Briot
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

A challenge for pervasive computing is the seamless integration of computer support with users’ activities in a very dynamic setting, with deep human and resource mobility. Portable devices such as notebooks, PDAs and smartphones are becoming more and more popular, as their computational power increases and their prices fall. Moreover, the quick spread of wireless networks has permitted the exchange of data in places as diverse as university campi, airports, coffee houses and family homes. In this paper we introduce CAMPUS, a framework that supports the development of multi- agent, context aware, pervasive computing applications. Campus is designed to provide the necessary infrastructure for ambience intelligence applications.
Intrusion Detection Systems, 1 edition
Authors: Roberto Di Pietro, Luigi V. Mancini
Venue:  (2008)

In our world of ever-increasing Internet connectivity, there is an on-going threat of intrusion, denial of service attacks, or countless other abuses of computer and network resources. In particular, these threats continue to persistdue to the flaws ofcurrent commercial intrusion detection systems (IDSs).Intrusion Detection Systems is an edited volume by world class leaders in this field.This edited volume sheds new light on defense alert systems against computer and network intrusions. It also covers integrating intrusion alerts within security policy framework for intrusion response, related case studies and much more. This volumeis presented in an easy-to-follow style while including a rigorous treatment of the issues, solutions, and technologies tied to the field. Intrusion Detection Systems is designed for a professional audience composed of researchers and practitioners within the computer network and information security industry. It is also suitable as a reference or secondary textbook for advanced-level students in computer science.
Partially defined computer instructions and guards
Authors: Ward Douglas Maurer
Venue: Science of Computer Programming (2008)

We here extend our earlier work on the theory of computer instructions to consider instructions which are only partially defined. For every such instruction, we assume that it is defined whenever a certain Boolean expression is true; we refer to such a Boolean expression as a guard, following Dijkstra. This is a special case of a more general function on the set of states of a computer, representing an expression in a programming language. Many constructs for instructions now generalize to partially defined instructions; in particular, we define the notion of conditional input and output regions, as well as the relevant region of a more general expression. Fundamental theorems about instructions generalize to theorems about guards and about partially defined instructions. We also define the parallel execution of such instructions, which is useful in validating a generalized instruction commutativity criterion.
Search space pruning techniques in ATPG for VLSI circuits
Authors: Michael Dimopoulos, Panagiotis Linardis
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This paper presents a, common, unified approach to solve either the test sequence compaction problem or the power minimization problem during circuit testing. This approach is based on an exact Branch and Bound algorithm that exploits information from the respective problems. In particular decision making during the Branch and Bound method follows some rules devised so as to avoid unnecessary choices and thus reducing the search space. Experimental results that are presented, comparing the proposed algorithm with other solvers from literature, show the effectiveness of the proposed method.