ppxscal/embedding_network huggingface dataset:
GENESIS: a framework for global engineering of embedded systems
Authors: Catalin Buiu, Mario Zagar, Radu Dobrin, Sylvia Ilieva, Adnan Salihbegovi, Tiberiu Seceleanu, Sasikumar Punnekkat, Ivica Crnkovic, Damir Isovic, Hannu Tenhunen, Ioan Dumitra he, Stefan Stancescu, Vasile Lazarescu Zeljka Car, Igor Cavrak, Ignac Lovrek
Venue: Proceedings of the 2008 international workshop on Software Engineering in east and south europe (2008)

GENESIS is an European initiative involving institutions and persons from older and new EU members, and West Balkan countries. It aims at developing a global network of research and education in embedded systems. The related research will be coordinated in such a way to address hot topics at European and global levels and will concentrate on the fusion of embedded systems and distributed services over the Internet. One of the main objectives of GENESIS is to develop a distributed virtual laboratory to be used in embedded systems research and education and this is described in detail. This paper presents the rationale behind this initiative and the main actions that are proposed to fulfill the educational, and scientific objectives of GENESIS.
A principled approach to teaching OO first
Authors: David Gries
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

There has been debate about whether OO should, or even can, be taught first in CS1 (using Java). We claim that OO can be taught successfully, provided certain principles are followed. These principles lead to the requirement of an appropriate model for classes and objects, which we provide.
Large area arrays of metal nanowires
Authors: V. Auzelyte, H. H. Solak, Y. Ekinci, R. MacKenzie, J. Vörös, S. Olliges, R. Spolenak
Venue: Microelectronic Engineering (2008)

We present novel modified lift-off processes for the fabrication of large-area, uniform metal nanowire arrays. In all processes, dense line arrays with periods in the 50-100nm range were obtained in photoresist films with Extreme Ultraviolet Interference Lithography (EUV-IL). The critical problem of preparing lift-off masks with a negative resist profile is solved by the use of either a bilayer resist stack of HSQ/PMMA or deposition of a metal layer at oblique angles on top of the patterned resist lines. As an added benefit, the metal deposition step enables fine-tuning of the width of the nanowires. Using the developed processes, Au and Cr nanowires with 8nm-70nm linewidth were obtained.
Multispectral image classification: a supervised neural computation approach based on rough-fuzzy membership function and weak fuzzy similarity relation
Authors: A. Agrawal, N. Kumar, M. Radhakrishna
Venue: International Journal of Remote Sensing (2007)

A supervised neural network classification model based on rough-fuzzy membership function, weak fuzzy similarity relation, multilayer perceptron, and back-propagation algorithm is proposed. The described model is capable of dealing with rough uncertainty as well as fuzzy uncertainty associated with the classification of multispectral images. The concept of weak fuzzy similarity relation is used for generation of fuzzy equivalence classes during the calculation of rough-fuzzy membership function. The model allows efficient modelling of indiscernibility and fuzziness between patterns by appropriate weights being assigned using the back-propagated errors depending upon the rough-fuzzy membership values at the corresponding outputs. The effectiveness of the proposed model is demonstrated on classification problem of IRS-P6 LISS IV image of Allahabad area. The results are compared with statistical (minimum distance to means), conventional Multi-Layer Perceptron (MLP) and Fuzzy Multi-Layer Perceptron (FMLP) models. The better overall accuracy, user's and producer's accuracies and kappa coefficient of the proposed classifier in comparison to other considered models demonstrate the effectiveness of this model in multispectral image classification.
Synchronous state frequency in mutually coupled PLL networks
Authors: M. Q. Oliveira, M. V. R. Unzueta, J. R. C. Piqueira
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

We analytically describe how to proceed for estimating the frequency of the synchronous state in a full-connected voltage controlled oscillator network. These oscillators are part of second order phase-locked loops (PLL) widely applied in communication systems in order to distribute the phase and frequency signals. Using dynamical system theory, we obtain an expression for the synchronous state frequency for a network having delays between the nodes.
Enhance Retrieval Efficiency on the Internet
Authors: Wenyu Qu, Keqiu Li, Masaru Kitsuregawa
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Due to the explosive growth of the WWW and the increasing amount of data available via the Internet, how to retrieve desired information from the Internet with high efficiency and good effectiveness is of great importance. In this paper, we propose an information retrieval model for use in large dynamic networks such as the Internet. Firstly, we divide the network into a number of groups. An exceptional handling mechanism is adopted, i.e., a controlled flooding algorithm for intre-group information updating and random walk algorithm for inter-group information retrieval. We also propose an equal representative mechanism to enhance the fault-tolerant ability of the system. Extensive experiments are conducted to evaluate the performance and rationality of our model. The experimental results show that our model outperforms the existing approaches on the retrieval efficiency and the fault-tolerant ability.
A compositional framework for the specification of interaction protocols in multiagent organizations
Authors: Juan Manuel Serrano, Sascha Ossowski
Venue: Web Intelligence and Agent Systems (2007)

This paper addresses the notion of context in multiagent systems from an organisational point of view. Setting out from the RICA metamodel that shapes the agents' space of interaction on the basis of hierarchical organisational and communicative abstractions, we propose Interaction State Machines as a new formalism for the specification and enactment of multiagent interaction protocols. By means of examples from the FIPA interaction protocol library, we show how this formalism allows for a successive refinement of interaction protocols, and how this process is guided by the organisational model underlying a multiagent application.
Characterization of the PHOCITM data integrated video sensor technology
Authors: Douglas R. Hickey, Chris J. Fearing, Fred R. Beyette,  Jr., Philip A. Wilsey
Venue: Analog Integrated Circuits and Signal Processing (2008)

In this article, we report the characterization results of two data integrated video sensors designed by Clifton Labs, Inc. A data integrated video sensor consists of an array of photodetectors that each provide both an analog (video) and digital (data) output based on the amount of incident light on the detector. Video capture occurs using a simple sample-and-hold circuit. In the first sensor, data capture occurs using an externally supplied voltage to provide a threshold that is used to determine if a value is a <1' or <0'. In the second sensor, another sample-and-hold circuit is use to capture data values. The first design is characterized for output response at a given sample frequency for the video portion. The maximum data rate and optical response at a given data threshold are defined for the digital circuitry. Next, the digital and analog output values of the second chip are correlated to the incident optical power and the sample time used to capture the data. The results of these tests provide insight into the operation of the two designs and confirm simulation results used in the design of the circuits.
Budget-Based Clustering with Context-awareness for Sensor Networks
Authors: Jiaxi You, Dominik Lieckfeldt, Matthias Handy, Dirk Timmermann
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

As the scale of modern sensor networks continues to grow, energy consumption, scalability and routing efficiency are becoming key design challenges. Network management plays an important role in achieving these goals. By decomposing a sensor network into smaller groups, clustering and its variants have been presented as efficient ways in network management. In this paper, we propose a dynamic, localized clustering approach derived from generic budget-based clustering techniques. The approach generates dynamic cluster sizes for a hierarchy of cluster heads, with respect to network context such as residual energy and activity rates of sensor nodes. We further refine the local estimated cluster sizes by using additional feedback during clustering process. Simulation results of stochastic deployment are used to demonstrate the performance of our algorithm, as well as the impact of context information as clustering parameters.
Incidental information and mobile search
Authors: David Arter, George Buchanan, Matt Jones, Richard Harper
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

There is much interest in providing effective mobile search tools. Our focus is the value of in-situ sharing of users' mobile search activity. The QnotA prototype displays other people's queries about locations in an attempt to both provide users with an enriched sense of the places they visit, and to accommodate the limited input and output capabilities of many mobile platforms. We present the prototype and user experiences it affords. A study has been performed which allowed us to gather logged usage data and subjective participant information via diary and interview protocols. We report on findings that give insights as to the use and usefulness of the approach.
On the robustness of functional equations
Authors: R. Rubinfeld
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Given a functional equation, such as /spl forall/x, y f(x)+f(y)=f(x+y), we study the following general question: When can the "for all" quantifiers be replaced by "for most" quantifiers without essentially changing the functions that are characterized by the property? When "for most" quantifiers are sufficient, we say that the functional equation is robust. We show conditions on functional equations of the form /spl forall/x, y F[f(x-y), f(x+y), f(x), f(y)]=0, where F is an algebraic function, that imply robustness. We then initiate a general study aimed at characterizing properties of functional equations that determine whether or not they are robust. Our results have applications to the area of self-testing/correcting programs-this paper provides results which show that the concept of self-testing/correcting has much broader applications than we previously understood. We show that self-testers and self-correctors can be found for many functions satisfying robust functional equations, including tan x, 1/1+cot x, Ax/1-Ax', cosh x.
Analysis of EEG Data Using an Adaptive Periodogram Technique
Authors: Qihou Zhou, Matthew Brenneman, Jade Morton
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

We report a time-frequency analysis method for EEG data processing using an adaptive periodogram technique (APT). The time duration of a coherent signal is estimated using a time window that adapts its length and position to locally maximize the periodogram. Since this technique determines a signal’s coherent length, it achieves optimal resolution in both the time and frequency domain. We apply this technique to analyze the EEG data of two seizure events. During the seizures, the dominant frequency evolved continuously from about 8 Hz to 1 Hz. Before the seizures, there existed a weak signal at 8 Hz, which was clearly manifested in the coherent time. These preliminary results suggest that APT is a useful EEG analysis tool.
Fuzzy relevance vector machine for learning from unbalanced data and noise
Authors: Ding-Fang Li, Wen-Chao Hu, Wei Xiong, Jin-Bo Yang
Venue: Pattern Recognition Letters (2008)

Handing unbalanced data and noise are two important issues in the field of machine learning. This paper proposed a complete framework of fuzzy relevance vector machine by weighting the punishment terms of error in Bayesian inference process of relevance vector machine (RVM). Above problems can be learned within this framework with different kinds of fuzzy membership functions. Experiments on both synthetic data and real world data demonstrate that fuzzy relevance vector machine (FRVM) is effective in dealing with unbalanced data and reducing the effects of noises or outliers.
Restoration Mechanism for the N2R Topological Routing Algorithm
Authors: Jose M. Gutierrez, Jens M. Pedersen, Ruben Cuevas, Ole B. Madsen
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The topological routing over N2R structures has been studied and implemented using different techniques. An implemented algorithm achieves good performance and are storation mechanism has been added to the algorithm to obtain higher reliability. This paper introduces the concept of restoration, when failures occurs, being able to reroute the packets to the destination when the main path is not available. The goal is prove that there is an easy and efficient method for restoration in case of a failure of any element.
Λ-operator; a tool for solving ODEs
Authors: Mayumi Ohmiya
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The Λ-operator is applied to solve various kinds of ordinary differential equations. Using the Kuperschmidt-Wilson factorization of the Λ-operator, the operator representation of the Darboux transformation is given. Moreover, the degenerate condition for the nonspectral Darboux transformation is clarified.
Artificial neural network with backpropagation learning to predict mean monthly total ozone in Arosa, Switzerland
Authors: Surajit Chattopadhyay, Goutami Bandyopadhyay
Venue: International Journal of Remote Sensing (2007)

The present study deals with the mean monthly total ozone time series over Arosa, Switzerland. The study period is 1932-1971. First of all, the total ozone time series has been identified as a complex system and then Artificial Neural Network models in the form of Multilayer Perceptron with back propagation learning have been developed. The models are Single-hidden-layer and Two-hidden-layer Perceptrons with sigmoid activation function. After sequential learning with a learning rate of 0.9 the peak total ozone period (February-May) concentrations of mean monthly total ozone have been predicted by the two neural net models. After training and validation, both of the models are found to be skillful. But the Two-hidden-layer Perceptron is found to be more adroit in predicting the mean monthly total ozone concentrations over the aforesaid period.
Singularity-free trajectory planning of platform-type parallel manipulators for minimum actuating effort and reactions
Authors: Chun-ta Chen, Hua-wei Chi
Venue: Robotica (2008)

Due to the existence of singular configurations within the workspace for a platform-type parallel manipulator (PPM), the actuating force demands increase drastically as the PPM approaches or crosses singular points. Therefore, in this report, a numerical technique is presented to plan a singularity-free trajectory of the PPM for minimum actuating effort and reactions. By using the parametric trajectory representation, the singularity-free trajectory planning problem can be cast to the determination of undetermined control points, after which a particle swarm optimization algorithm is employed to find the optimal control points. This algorithm ensures that the obtained trajectories can avoid singular points within the workspace and that the PPM has the minimum actuating effort and reactions. Simulations and discussions are presented to demonstrate the effectiveness of the algorithm.
A Model for Specification and Validation of Security Policies in Communication Networks: The Firewall Case
Authors: Ryma Abbassi, Sihem Guemara El Fatmi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A security policy constitutes one of the major actors in the protection of communication networks. For this, and in order to manage the access grants in accordance with the security constraints, a security policy has to be validated before its deployment. Unfortunately, in the literature, there is no well established validation mechanisms ensuring the wellfounded of such security policies. This paper proposes a validation framework for security policies where: (1) executable specifications are used to build an ‘Executable Security Policy’, (2) a validation model is proposed to support the validation activity, and (3) a validation of the executable security policy is performed. The main contributions provided by this paper concerns the adaptation of some concepts and mechanisms traditionally used in software engineering for validation aims, such as specification, executable specification or reachability graph. All the definitions made in this paper have been proposed in accordance with the firewall case.
Optimal State Allocation for Multicast Communications With Explicit Multicast Forwarding
Authors: De-Nian Yang, Wan-Jiun Liao
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on Explicit Multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and Source-Specific Multicast. Two optimization problems are formulated in this paper. The first one, MINSTATE, is to minimize the total number of routers storing forwarding states in a multicast tree. We design a distributed algorithm that obtains the optimal solution of the problem. The second one, BALANCESTATE, is to minimize the maximum number of forwarding states stored in a router for all multicast groups. We prove that the second problem is NP-hard and propose an approximation algorithm and a distributed algorithm for the problem. We prove that this allocation is a special case of our mechanism. From the simulation results, we show that the forwarding state allocation provided by previous work is concentrated on the backbone routers in the Internet, which may cause the scalability problem. In contrast, our mechanism can balance the forwarding states stored among routers, and also reduce the number of routers storing the forwarding states of a multicast tree. Therefore, our mechanism can improve the scalability of Source-Specific Multicast and traditional IP multicast.
A metric for software readability
Authors: Raymond P.L. Buse, Westley R. Weimer
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from human annotators, we derive associations between a simple set of local code features and human notions of readability. Using those features, we construct an automated readability measure and show that it can be 80% effective, and better than a human on average, at predicting readability judgments. Furthermore, we show that this metric correlates strongly with two traditional measures of software quality, code changes and defect reports. Finally, we discuss the implications of this study on programming language design and engineering practice. For example, our data suggests that comments, in of themselves, are less important than simple blank lines to local judgments of readability.
Non-Uniform Node Deployment for Lifetime Extension in Large-Scale Randomly Distributed Wireless Sensor Networks
Authors: Yuh-Ren Tsai, Kai-Jie Yang, Sz-Yi Yeh
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Network sensing coverage and network lifetime are the two major performance metrics for WSNs. Different data forwarding/routing mechanisms lead to different amounts and different distributions of energy consumption in a network. Moreover, nodes at different locations will suffer from different message forwarding burdens, either due to the amounts of forwarding messages or due to the required transmission power. In this work, we focus on the node deployment problem for large-scale randomly distributed WSNs, and proposed a non-uniform node deployment strategy, the IFA-based deployment strategy, for the multi-hop routing scenario. The sensing coverage, message forwarding and energy consumption issues are well examined and taken into consideration in our proposed deployment strategy. The iterative algorithm that figures out the optimal node density distribution fitting to the energy consumption distribution has been devised. Simulation results show that the proposed IFA-based deployment strategy can significantly improve the sensing coverage performance of a WSN.
Designing Fingerprint-Recognition-Based Access Control for Electronic Medical Records Systems
Authors: YongNyuo Shin, YongJun Lee, Woochang Shin, Jinyoung Choi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

“medical information” implies all information related with treatment of the patient, and is, by its nature, the most sensitive and important information in terms of the privacy of the individual [2]. Recently, laws, policies, and technological standards are rapidly developing to safely protect the medical information of the individual. This paper proposes a model that applies fingerprint recognition technology to the medical information system, to guarantee a reliable electronic medical record system. The proposed model provides an identification and denial prevention function, by applying fingerprint recognition to the access of doctors, nurses, and other medical staff. The EMR authentication system based on the proposed fingerprint recognition technology enables the user to eliminate the inconvenience of private key management, and provides security authentication that is most suitable for private networks, as external communication is not required. In particular, the reliability of the EMR system can be enhanced through disabling delegation of the private key, which is the most serious problem of electronic signature authentication.
Can software routers scale?
Authors: Katerina Argyraki, Salman Baset, Byung-Gon Chun, Kevin Fall, Gianluca Iannaccone, Allan Knies, Eddie Kohler, Maziar Manesh, Sergiu Nedevschi, Sylvia Ratnasamy
Venue: Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow (2008)

Software routers can lead us from a network of special-purpose hardware routers to one of general-purpose extensible infrastructure - if, that is, they can scale to high speeds. We identify the challenges in achieving this scalability and propose a solution: a cluster-based router architecture that uses an interconnect of commodity server platforms to build software routers that are both incrementally scalable and fully programmable.