ppxscal/embedding_network huggingface dataset:
Scheduling for information gathering on sensor network
Authors: Hongsik Choi, Ju Wang, Esther A. Hughes
Venue: Wireless Networks (2009)

We investigate a unique wireless sensor network scheduling problem in which all nodes in a cluster send exactly one packet to a designated sink node in an effort to minimize transmission time. However, node transmissions must be sufficiently isolated either in time or in space to avoid collisions. The problem is formulated and solved via graph representation. We prove that an optimal transmission schedule can be obtained efficiently through a pipeline-like schedule when the underlying topology is either line or tree. The minimum time required for a line or tree topology with n nodes is 3(n - 2). We further prove that our scheduling problem is NP-hard for general graphs. We propose a heuristic algorithm for general graphs. Our heuristic tries to schedule as many independent segments as possible to increase the degree of parallel transmissions. This algorithm is compared to an RTS/CTS based distributed algorithm. Preliminary simulated results indicate that our heuristic algorithm outperforms the RTS/CTS based distributed algorithm (up to 30%) and exhibits stable behavior.
Experimental Study of the Impact of WLAN Interference on IEEE 802.15.4 Body Area Networks
Authors: Jan-Hinrich Hauer, Vlado Handziski, Adam Wolisz
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

As the number of wireless devices sharing the unlicensed 2.4 GHz ISM band increases, interference is becoming a problem of paramount importance. We experimentally investigate the effects of controlled 802.11b interference as well as realistic urban RF interference on packet delivery performance in IEEE 802.15.4 body area networks. Our multi-channel measurements, conducted with Tmote Sky sensor nodes, show that in the low-power regime external interference is typically the major cause for substantial packet loss. We report on the empirical correlation between 802.15.4 packet delivery performance and urban WLAN activity and explore 802.15.4 cross-channel quality correlation. Lastly, we examine trends in the noise floor as a potential trigger for channel hopping to detect and mitigate the effects of interference.
An Efficient Viterbi Decoder for Digital Mobile Multimedia Broadcasting Receiver
Authors: Hongli Zhu, Guangchun Gao, Gang Bi
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In the design of Viterbi Decoder of punctured convolutional codes, the SST method is used to reduce power consumption in this paper. Moreover, the punctured vector table is optimized by hard wire logic, thus reducing the area required by the system. Effective operation of adjustment is used to reduce the word length of path metric memory. At the same time, this algorithm can also help reduce operation load by controlling the highest order of path metric memory, thereby reducing the scale of hardware.
Staging life stories on the web: the Small Histories project and performances of reconstruction
Authors: Stefan Schutt
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper discusses the Small Histories website, a work-in-progress that aims to create an online network of interlinked personal narratives by facilitating the creation and sharing of life stories. It investigates ways the Internet can support the urge to tell and share one's personal history, and explores some attendant issues. The question is raised: can personal and communal identity be reconstructed through web-based performances in the form of shared online narratives? In response, this paper poses the proposition that the Internet can be deployed as a performance space, with tools made available for people to gather and unite fragments from the traumatic past, and present them to an online audience.
Web metrics for digital influence measurement
Authors: Ioan Pop
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

The intention of an online visitor, from an online social networking, is to see the most valuable pieces of information. The intention is hidden and can only be partially revealed from implicit indicators in the traces users leave behind while they browse through many social media websites. As a consequence, he either gets the desired information or product, or he gets redirected somewhere else. In general, one part has a concept of the purpose of the visit and the concern of the other part is to resolve this concept as accurately as possible. This paper approaches the question of special Web metrics for the Digital Influence measuring. A survey of the metrics for them is presented in this paper. Also, here we suggest a methodology for researchers in this discourse area.
Average Distance, Diameter, and Clustering in Social Networks with Homophily
Authors: Matthew O. Jackson
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

I examine a random network model where nodes are categorized by type and linking probabilities can differ across types. I show that as homophily increases (so that the probability to link to other nodes of the same type increases and the probability of linking to nodes of some other types decreases) the average distance and diameter of the network are unchanged, while the average clustering in the network increases.
A Novel Approach for Face Recognition Based on Supervised Locality Preserving Projection and Maximum Margin Criterion
Authors: Jun Kong, Shuyan Wang, Jianzhong Wang, Lintian Ma, Baowei Fu, Yinghua Lu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

In this paper, we propose a novel approach for face recognition, that combine Supervised Locality Preserving Projection (SLPP) with Maximum Margin Criterion (MMC) for preserving the within-class neighborhood structure of facial manifold and meanwhile finding an optimal feature space for classification. We also give an effective solution to the eigenvalue problem. Our method can avoid the preprocessing stage of resizing the original image resolution and Principle Component Analysis (PCA) projection, so there is no information lost. Experiment results demonstrate the effectiveness of the proposed approach on the ORL face database.
MATLAB Simulink modeling and simulation of LVI-based primal-dual neural network for solving linear and quadratic programs
Authors: Yunong Zhang, Weimu Ma, Xiao-Dong Li, Hong-Zhou Tan, Ke Chen
Venue: Neurocomputing (2009)

In view of parallel-processing nature and circuit-implementation convenience, recurrent neural networks are often employed to solve optimization problems. Recently, a primal-dual neural network based on linear variational inequalities (LVI) was developed by Zhang et al. for the online solution of linear-programming (LP) and quadratic-programming (QP) problems simultaneously subject to equality, inequality and bound constraints. For the final purpose of field programmable gate array (FPGA) and application-specific integrated circuit (ASIC) realization, we investigate in this paper the MATLAB Simulink modeling and simulative verification of such an LVI-based primal-dual neural network (LVI-PDNN). By using click-and-drag mouse operations in MATLAB Simulink environment, we could quickly model and simulate complicated dynamic systems. Modeling and simulative results substantiate the theoretical analysis and efficacy of the LVI-PDNN for solving online the linear and quadratic programs.
Note: Approximation of the k-batch consolidation problem
Authors: Sung-Pil Hong, Myoung-Ju Park, Soo Y. Chang
Venue: Theoretical Computer Science (2009)

We consider a problem of minimizing the number of batches of a fixed capacity processing the orders of various sizes on a finite set of items. This batch consolidation problem is motivated by the production system typical in raw material industries in which multiple items can be processed in the same batch if they share sufficiently close production parameters. If the number of items processed in a batch is restricted to being up to some fixed integer k, the problem is referred to as the k-batch consolidation problem. We will show that the k-batch consolidation problem admits an approximation whose factor is twice that of the k-set cover problem. In particular, this implies an upper bound on the approximation factor, 2Hk-1, where Hk=1+&frac12;+...+1/k.
The confirmatory factor analysis research in CMC tools
Authors: Su-Sui Lin, Kwo-Ting Fang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

As Information technology continuously grows, the Internet has become a major and popular information technology in general communication for most people. It deeply affects the interactive relationship between people via prevalence of usage. Computer -- mediate communication (CMC), the electronic information exchange using computers via communication links, is naturally becoming an integral part of work and living for moderns. A popular CMC tool "Skype" was selected in this paper. Relevant literature and related research were reviewed in this paper. The sample of 303 usable cases was gathered and Structural Equation Modeling (SEM) was applied to examine the five latent variables (perceived usefulness, perceived ease of use, social influence, media feature and attitude) and 17 observation indicators. The result showed that not only first order confirmatory factor analysis (with correlation between latent variables) and second order confirmatory factor analysis (no correlation between latent variables of first order) had the best goodness-of-fit but also the best goodness-of-fit for the observation data.
High performance parallel numerical methods for Volterra equations with weakly singular kernels
Authors: Giovanni Capobianco, Dajana Conte, Ida Del Prete
Venue: Journal of Computational and Applied Mathematics (2009)

Non-stationary discrete time waveform relaxation methods for Abel systems of Volterra integral equations using fractional linear multistep formulae are introduced. Fully parallel discrete waveform relaxation methods having an optimal convergence rate are constructed. A significant expression of the error is proved, which allows us to estimate the number of iterations needed to satisfy a prescribed tolerance and allows us to identify the problems where the optimal methods offer the best performance. The numerical experiments confirm the theoretical expectations.
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
Authors: Dimitar P. Guelev, Catalin Dima
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

We propose a variant of alternating time temporal logic ( ) with imperfect information, perfect recall, epistemic modalities for the past and strategies which are required to be uniform with respect to distributed knowledge. The model-checking problem about with perfect recall and imperfect information is believed to be unsolvable, whereas in our setting it is solvable because of the uniformity of strategies. We propose a model-checking algorithm for that system, which exploits the interaction between the cooperation modalities and the epistemic modality for the past. This interaction allows every expressible goal φ to be treated as the epistemic goal of (eventually) establishing that φ holds and thus enables the handling of the cooperation modalities in a streamlined way.
Vector hyperinterpolation on the sphere
Authors: Martin Pieper
Venue: Journal of Approximation Theory (2009)

We present new results on hyperinterpolation for spherical vector fields. Especially we consider the operator Ln, which may be described as an approximation to the L2 orthogonal projection Pn. In detail, we prove that Pn is the projection with the least uniform norm and that Ln has the optimal value for its norm in the C&rarr;L2 setting. These results are already known for the scalar case. In the continuous space setting, we could prove only a sub-optimal bound for the Lebesgue constant of the vector hyperinterpolation operator.
A thin client for networked access to a central register and electronic voting terminal
Authors: Craig A. Burton
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Networked terminals for marking the electoral register at poll places has been trialed at a number of sites (most recently [5]) allowing immediate detection of attempted multiple voting even in truly anonymous voting systems. We describe new technology piloted in 2007 in a binding local government election. Our commercial remote voting product eLect [1] was extended to provide new services. Firstly, networked register terminals replaced paper registers. Secondly, the networked register formed the basis of enabling single-vote access for poll-place electronic voting. Finally, poll place electronic voting machines were provided as stateless thin clients who were networked for real-time central aggregation of votes. A central server was charged with the coordination of 400 such voting and register machines at 64 sites. Register terminals also formed the basis of recording the issue of paper votes if the voter so chose, as these were provided to allow voting in the traditional manner. In concert with these systems, votes were also collected via telephone and web-based remote electronic voting services. The pilot has been judged a success by the central government.
Unattended ground sensor for perimetric guarding
Authors: Jaroslav Cechak
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper is directed to the area of the Unattended Ground Sensor - UGS for perimeter guarding use. It has been developed the sample of the new UGS conception. The main characteristics and digital signal processing principles are presented in this article. The proposal method how to localized plenty of UGS are presented too. It is currently more and more evident that passive means of intruder detection within a perimeter using most up-to-date technologies are going to be introduced in the most upto-date military and security systems.
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Authors: Paul Bonsma, Florian Zickfeld
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

We consider the problem of finding a spanning tree that maximizes the number of leaves (MaxLeaf). We provide a 3/2-approximation algorithm for this problem when restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(G), and construct a tree with at least (n ¿ x(G) + 4)/3 leaves, and prove that no tree with more than (n ¿ x(G) + 2)/2 leaves exists. In contrast to previous approximation algorithms for MaxLeaf, our algorithm works with connected dominating sets instead of constructing a tree directly. The algorithm also yields a 4/3-approximation for Minimum Connected Dominating Set in cubic graphs.
Research on the Adoption of Electronic Commerce Based on Customer's Behavior
Authors: Yuantao Jiang, Yuqin Sun
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Since the inception of the Internet in the mid-1990s, e-commerce has grown at a very rapid rate. Firms had realized that they could be pushed to the world stage of the knowledge-based economic by e-commerce. So, most of firms are stepping up to the adoption of those technologies for upgrading their businesses. Regarding the significant role of customers, the study of their behaviors influence on the adoption of e-commerce by the firms becomes a main stream in scholastic path. This paper aims to study the four customer behaviors which influence the adoption of e-commerce technologies by firms. The study results showed that the customer behaviors influence the adoption of e-commerce by firms.
A new method for intrusion detection on hierarchical wireless sensor networks
Authors: Rung-Ching Chen, Chia-Fen Hsieh, Yung-Fa Huang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Wireless Sensor Network (WSN) is a novel technology in wireless field. The main function of this technology is to use sensor nodes to sense important information, just like battlefield data and personal health information, under the limited resources. It is important to avoid malicious damage while information transmits in wireless network. So Wireless Intrusion Detection System (WIDS) becomes one of important topics in wireless sensor networks. The attack behavior of wireless sensor nodes is different to wired attackers. In this paper, we will propose an isolation table to detect intrusion in hierarchical wireless sensor networks and to estimate the effect of intrusion detection effectively. The primary experiment proves the isolation table intrusion detection can prevent attacks effectively.
Implementation and evaluation of a microthread architecture
Authors: K. Bousias, L. Guang, C. R. Jesshope, M. Lankamp
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

Future many-core processor systems require scalable solutions that conventional architectures currently do not provide. This paper presents a novel architecture that demonstrates the required scalability. It is based on a model of computation developed in the AETHER project to provide a safe and composable approach to concurrent programming. The model supports a dynamic approach to concurrency that enables self-adaptivity in any environment so the model is quite general. It is implemented here in the instruction set of a dynamically scheduled RISC processor and many such processors form a microgrid. Binary compatibility over arbitrary clusters of such processors and an inherent scalability in both area and performance with concurrency exploited make this a very promising development for the era of many-core chips. This paper introduces the model, the processor and chip architecture and its emulation on a range of computational kernels. It also estimates the area of the structures required to support this model in silicon.
A countable and time-bound password-based user authentication scheme for the applications of electronic commerce
Authors: Iuon-Chang Lin, Chin-Chen Chang
Venue: Information Sciences: an International Journal (2009)

In this paper, we propose a secure and efficient user authentication scheme with countable and time-bound features. The countable feature is to limit the use to a certain number of times, which means that the users are able to successfully log into the system in a fixed number of times. The feature of the time-bound allows each login ticket to have a period of expiration. In other words, if a login request is overdue, it would not be available anymore. These features make our scheme more reliable for applications in the field of electronic commerce, such as on-line games, pay-TV, and so on. Since our scheme does not require any password or verification table and can avoid replay attacks, it is under firm security. Moreover, our scheme shows a lower computational overhead on the user side. Therefore, it offers an efficient and adequate alternative for the implementations in the mobile environment with limited computing capability.
Synthetic data generation technique in Signer-independent sign language recognition
Authors: Feng Jiang, Wen Gao, Hongxun Yao, Debin Zhao, Xilin Chen
Venue: Pattern Recognition Letters (2009)

The lack of training samples is an important problem in the field of sign language recognition. This paper presents a method of generating synthetic multi-stream samples so as to enlarge the training set of sign. The mean shift algorithm is able to obtain the directions of maximum increase and decrease in the density function, so it is used to control the direction and the intensity of synthetic data generation. The synthetic data generation proposed in this paper satisfies the need of the synthetic samples, which must include a large amount of effective information of unspecific signers. The proposed method is evaluated under different experimental conditions, such as the generating strategy, the capacity of the model, as well as the intensity and direction of the generating process. The results show that in most cases recognition accuracy is improved; and in some, even greatly improved.
Tips for successful practice of simulation
Authors: David T. Sturrock
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Succeeding with a technology as powerful as simulation involves much more than the technical aspects you may have been trained in. The parts of a simulation study that are outside the realm of modeling and analysis can make or break the project. This paper explores the most common pitfalls in performing simulation studies and identifies approaches for avoiding these problems.
HyperSmooth: A System for Interactive Spatial Analysis Via Potential Maps
Authors: Christine Plumejeaud, Jean-Marc Vincent, Claude Grasland, Sandro Bimonte, Hélène Mathian, Serge Guelton, Joël Boulier, Jérôme Gensel
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

This paper presents a new cartographic tool for spatial analysis of social data, using the potential smoothing method [10]. The purpose of this method is to view the spread of a phenomenon (demographic, economical, social, etc.) in a continuous way, at a macroscopic scale, from data sampled on administrative areas. We aim to offer an interactive tool, accessible through the Web, but ensuring the confidentiality of data. The biggest difficulty is induced by the high complexity of the calculus, dealing with a great amount of data. A distributed architecture is proposed: map computation is made on server-side, using particular optimization techniques, whereas map visualization and parameterisation of the analysis are done with a web-based client, the two parts communicating through a Web protocol.
A novel efficient classification algorithm for search engines
Authors: Hanan Ahmed Hosni, Mahmoud Abd Alla
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper a new classification algorithm of Web documents into a set of categories, is proposed. The proposed technique is based on analyzing relationships between different documents and the terms they contain by producing a set of rules relating the category of the document, its terms and their frequencies. Each document is represented by a graph that correlates its most frequent combined words and its category. The relationships among these graphs and the documents' categories are captured. The proposed technique has three phases. The first phase is a training phase where human experts determines the categories of different web pages and articles and the supervised classification algorithm will combine these categories with appropriate weighted index terms according to the highest supported rules among the most frequent words. The second phase is the blind categorization phase where a web crawler will crawl through the World Wide Web to build a database that will be categorized according to the result of the first phase. This data base contains URLs and their categories. The third phase is applying the proposed graph representation technique on the whole set of documents per category to determine its final graph representation. The third phase will produce better classification rules because the sample size is larger with no additional cost of supervised categorization. Experiments using data sets collected from different Web portals are conducted.