ppxscal/embedding_network huggingface dataset:
A document driven methodology for developing a high quality Parallel Mesh Generation Toolbox
Authors: S. Smith, W. Yu
Venue: Advances in Engineering Software (2009)

This paper motivates the value of using a document driven methodology to improve the quality of scientific computing applications by illustrating the design and documentation of a Parallel Mesh Generation Toolbox (PMGT). Formal mathematical specification is promoted for writing unambiguous requirements, which can be used to judge the correctness and thus the reliability of PMGT. Mathematics is also shown to improve understandability, reusability and maintainability through modelling software modules as finite state machines. The proposed methodology includes explicit traceability between requirements, design, implementation and test cases. Traceability improves the verification of completeness and consistency and it allows for proper change management. To improve the reliability of PMGT, given the challenge that the correct solution is unknown a priori, an automated testing approach is adopted to verify the known properties of a correct solution, such as conformality and counterclockwise vertex numbering.
Evaluation of Hydrological Responses to Land Use Change at Large Scale
Authors: Yang Chuanguo, Yu Zhongbo, Hao Zhenchun, Lin Zhaohui, Liu Shaofeng
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Responses of hydrologic process to human induced land use changes, which have affected a wide portion of China since last century, were evaluated with a coupled land surface-hydrology model. The main land use changes were assessed by the International Satellite Land Surface Climatology Project (ISLSCP) historic (1970) and potential land use types in the Huaihe River basin. The variations of flood peaks due to extensive human activities have been investigated by simulating hydrologic processes at a 10 km grid scale for the two land use scenarios forced by the same meteorological data, initial conditions and other model parameters. Results indicate that the sensitivity of the evapotranspiration, soil moisture and surface runoff to land use changes is remarkable, and demonstrates that present deforestation aggravates local flood risks. Forest planting is promoted to decrease flood damage and to protect the ecological environment.
Implementation of W-CDMA Cell Search on a FPGA Based Multi-Processor System-on-Chip with Power Management
Authors: Roberto Airoldi, Fabio Garzia, Tapani Ahonen, Dragomir Milojevic, Jari Nurmi
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

In this paper we describe a general purpose, homogeneous Multi-Processor System-on-Chip (MPSoC) based on 9 processing clusters using COFFEE RISC processors and a hierarchical Network-on-Chip implemented on an FPGA device. The MPSoC platform integrates a cluster clock gating technique, enabling independent core and memory sleep modes. Low cluster turn-on delay allows frequent use of such technique, resulting in power savings. In order to quantify the performance of the proposed platform and the reduction of power consumption, we implement Target Cell Search part of the WCDMA, a well known SDR application. We show that the proposed MPSoC platform achieves an important speed-up (7.3X) when compared to comparable single processor platform. We also show that a significant reduction in dynamic power consumption can be achieved (50% for the complete application) using the proposed cluster clock-gating technique.
A Secure Cryptographic Token Interface
Authors: Christian Cachin, Nishanth Chandran
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

Cryptographic keys must be protected from exposure.In real-worldapplications, they are often guarded by cryptographic tokens thatemploy sophisticated hardware-security measures.Several logicalattacks on the key management operations of cryptographic tokenshave been reported in the past, which allowed to expose keys merelyby exploiting the token API in unexpected ways.This paper proposes a novel, provably secure, cryptographic tokeninterface that supports multiple users, implements symmetriccryptosystems and public-key schemes, and provides operations forkey generation, encryption, authentication, and key wrapping.Thetoken interface allows only the most important operations found inreal-world token APIs; while flexible to be of practical use, it isrestricted enough so that it does not expose any key to a userwithout sufficient privileges.The security policy can be appliedto the industry-standard PKCS #11 interface.
A Memetic Algorithm for the Multidimensional Assignment Problem
Authors: Gregory Gutin, Daniel Karapetyan
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose a memetic algorithm for MAP that is a combination of a genetic algorithm with a local search procedure. The main contribution of the paper is an idea of dynamically adjusted generation size, that yields an outstanding flexibility of the algorithm to perform well for both small and large fixed running times.
Widgets for Faceted Browsing
Authors: Jan Polowinski
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Faceted Browsing, also known as Faceted Search, recently became a popular interface paradigm and is used as a visual selection mechanism to browse data collections. It is particularly suitable for structured, but heterogeneous data with explicit semantics. As the amount of this data will grow in respect to a rising Semantic Web, it is worth looking at the current state of Faceted Browsers. In this paper we extract characteristics of several browsers from various domains. We then propose the use of advanced widgets for Faceted Browsers and how to select appropriate widgets.
Study on the Benefit Protection of Residents in Ecotourism Area
Authors: Ruihong Sun, Shidong Liu, Jun Gao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Ecotourism is a mode of sustainable tourism development that can bring about good economic benefit to the local place, which has been proved by many successful cases at home and abroad. Economic benefit acquired from domestic ecotourism development is mainly distributed among the local residents, the governments and the developers. The residents can obtain vested income from land acquisition compensation fund on the one hand, and also obtain future income through governmental comprehensive resettlement on the other hand. In the reality, because the residents lack the discourse power, it is difficult to guarantee their political rights, the residents’ benefits are damaged in the land acquisition compensation, follow-up settlement and benefit distribution of ecotourism, and the residents have to bear the negative effect caused by the development of ecotourism. To solve this problem, it is necessary to improve the political position of local residents, stick to the marketing operation of ecotourism development and to consolidate it in legal means.
Improving SCTP retransmission delays for time-dependent thin streams
Authors: Andreas Petlund, Paul Beskow, Jon Pedersen, Espen Søgård Paaby, Carsten Griwodz, Pål Halvorsen
Venue: Multimedia Tools and Applications (2009)

A large number of network services rely on IP and reliable transport protocols. For applications that provide abundant data for transmission, loss is usually handled satisfactorily, even if the application is latency-sensitive (Wang et al. 2004). For data streams where small packets are sent intermittently, however, applications can occasionally experience extreme latencies (Griwodz and Halvorsen 2006). As it is not uncommon that such thin-stream applications are time-dependent, any unnecessarily induced delay can have severe consequences for the service provided. Massively Multiplayer Online Games (MMOGs) are a defining example of thin streams. Many MMOGs (like World of Warcraft and Age of Conan) use TCP for the benefits of reliability, in-order delivery and NAT/firewall traversal. It has been shown that TCP has several shortcomings with respect to the latency requirements of thin streams because of the way it handles retransmissions (Griwodz and Halvorsen 2006). As such, an alternative to TCP may be SCTP (Stewart et al. 2000), which was originally developed to meet the requirements of signaling transport. In this paper, we evaluate the Linux-kernel SCTP implementation in the context of thin streams. To address the identified latency challenges, we propose sender-side only enhancements that reduce the application-layer latency in a manner that is compatible with unmodified receivers. These enhancements can be switched on by applications and are used only when the system identifies the stream as thin. To evaluate the latency performance, we have performed several tests over various real networks and over an emulated network, varying parameters like RTT, packet loss and amount of competing cross traffic. When comparing our modifications with SCTP on Linux and FreeBSD and TCP New Reno, our results show great latency improvements and indicate the need for a separate handling of thin and thick streams.
An Evaluation of the Cost and Energy Consumption of Security Protocols in WSNs
Authors: Kahina Kabri, Dominique Seret
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Recent advances in wireless communications and computing technology are enabling the emergence of small, low-cost devices capable of sensing, processing and communicating. A large number of these devices are deployed in the field to create a wireless sensor network for the monitoring and controlling of physical environments. Security in wireless sensor networks is becoming more significant as new technologies emerge. Key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with others using cryptographic techniques.There are three chief protocols for securing data in wireless sensor networks, namely SPINS, BROSK, and LEAP. This paper describes and evaluates key establishment phase in these protocols and offers measurement results for energy consumption.
The Influence of Gender and Age on the Visual Codes Working Memory and the Display Duration --- A Case Study of Fencers
Authors: Chih-Lin Chang, Kai-Way Li, Yung-Tsan Jou, Hsu-Chang Pan, Tai-Yen Hsu
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

This research discusses the influence of code colors and duration of display to the corrective rate of visual codes working memory and the Critical Fusion Frequency (CFF) value in different gender and two age groups (high school and university). The results showed that gender has a certain effect upon the corrective rate of the visual codes working memory and on the CFF ratios. Moreover, female fencers' CFF ratios were higher than the male fencers'. The high school participants' CFF ratios were obviously higher than the college participants'. The color of display has a significant effect on the corrective rate of visual codes working memory. Evidence showed that the duration time of display affected the corrective rate of the visual codes working memory. The code duration of display of 0.3 second had the highest corrective rate of visual codes working memory.
What Do Users Really Do? Experience Sampling in the 21st Century
Authors: Gavin S. Lew
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

As practitioners we spend a great deal of effort designing and testing products within the confines of usability testing labs when we know that a rich user experience lies outside. What is needed is more research in "the wild" where people use the very interfaces we take so much time to design, test, iterate, and develop. Through innovative advancements in mobile technology, we can expand upon the tried and true "experience sampling" research techniques, such as diary or pager studies, to effectively solicit, monitor and receive data on users' interactions at given points in time. This paper describes various research methodologies and recent advancements in mobile technology that can provide practitioners with improved research techniques to better assess the user experience of a product. The conference presentation will also include results from a pilot experience sampling method study focused on collecting data on usage and satisfaction of a product.
Second Order Spiking Perceptron
Authors: Xuyan Xiang, Yingchun Deng, Xiangqun Yang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

According to the usual approximation scheme, we present a more biologically plausible so-called Second Order Spiking Perceptron with renewal process inputs, which employs both first and second statistics, i.e. the means, variances and correlations of the synaptic input. We show that such perceptron, even a single neuron, is able to perform complex non-linear tasks like the XOR problem, which is impossible to be solved by traditional single-layer perceptrons. Here such perceptron offers a significant advantage over classical models, in that it includes the second order statistics in computations, and that it introduces variance in the error representation. We are to open up the possibility of carrying out a random computation in neuronal networks.
Countermeasure of ECC against Side-Channel Attacks: Balanced Point Addition and Point Doubling Operation Procedure
Authors: Tingding Chen, Huiyun Li, Keke Wu, Fengqi Yu
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Elliptic Curve Cryptography (ECC) has become widely deployed in embedded cryptographic devices. However, power analysis attacks may retrieve secret keys by exploiting the power consumption of ECC devices. This paper proposes a countermeasure with balanced operation procedure of point doubling and addition during the scalar multiplication implementation of ECC algorithms. Experiment results on smart cards demonstrate this balanced method can largely enhance the secure against side-channel attacks.
Planar Graph Isomorphism is in Log-Space
Authors: Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extant lower and upper bounds for planar graphs as well. We bridge the gap for this natural and important special case by presenting an upper bound that matches the known log-space hardness [JKMT03]. In fact, we show the formally stronger result that planar graph canonization is in log-space. This improves the previously known upper bound of AC1 [MR91]. Our algorithm first constructs the biconnected component tree of a connected planar graph and then refines each biconnected component into a triconnected component tree. The next step is to log-space reduce the biconnected planar graph isomorphism and canonization problems to those for 3-connected planar graphs, which are known to be in log-space by [DLN08]. This is achieved by using the above decomposition, and by making significant modifications to Lindell’s algorithm for tree canonization, along with changes in the space complexity analysis. The reduction from the connected case to the biconnected case requires further new ideas, including a non-trivial case analysis and a group theoretic lemma to bound the number of automorphisms of a colored 3-connected planar graph. This lemma is crucial for the reduction to work in log-space.
Study of College Human Resources Data Mining Based on the SOM Algorithm
Authors: Yan Huang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The decisive factor of the comprehensive strength of a college is the integrated intrinsic qualifications of its personnel. Its human resources management needs a technology to discover the valuable knowledge, identify the human developing stratagem and provide the support for decision. Base on the human resources data of two colleges in Tianjin, after data pretreatment, such as data integration, data clean, data transformation and data reduction, this paper finished clustering analysis applying the SOM algorithm, realized information visualization. In the process the algorithm is carefully chosen, the fitting number of input and output layer node is identified. After training and verification, the result is approved by the experts of management. It can represent correspondingly the 4 kinds of personnel—service and other, administration and teaching assistant, teaching and research. It can differentiate the personnel both in teaching and research, which is the distinct character of human resource in colleges. The data mining result presents the correct character and existing problem in college human resources management. The result will be the guidance rule on the employment, training and upgrading of the personnel in the college, providing some support to the decision of human resources management strategy of college as well.
VB-Based Communications and Optimization Design in Beer Fermentation Control System
Authors: Yihu Huang, Genmin Zhang, Jinli Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Along with the beer fermentation production's multiple extension, the beer fermented control system increased the multi-bench industry computers and the programmable controllers, thus it set a higher request of real-time data transmission between PLCs and host computers. The article first divides the communication data into three kinds: communication data between main engines, communication data between PLCs, and communication data between main engine and PLC. Through to the PLC programming, the VB WinSock communication module design and the MPI network programming, the communication data between various equipment transformed through many network transmissions, which could branch off network data. in view of oversized system gathering data quantity and the system refurbishing speed slow question, the unique fixed sampling period union transient operation cycle's communication way is used, a set of reasonable communication procedure is designed, which has satisfied the industry scene operation timeliness and the data prompt refurbishing request. This design method may promote to other industrial field automation control system.
Robot navigation and manipulation based on a predictive associative memory
Authors: Sascha Jockel, Mateus Mendes, Jianwei Zhang, A. Paulo Coimbra, Manuel Crisostomo
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

Proposed in the 1980s, the Sparse Distributed Memory (SDM) is a model of an associative memory based on the properties of a high dimensional binary space. This model has received some attention from researchers of different areas and has been improved over time. However, a few problems have to be solved when using it in practice, due to the non-randomness characteristics of the actual data. We tested an SDM using different forms of encoding the information, and in two different domains: robot navigation and manipulation. Our results show that the performance of the SDM in the two domains is affected by the way the information is actually encoded, and may be improved by some small changes in the model.
Protein structure prediction on the face centered cubic lattice by local search
Authors: Manuel Cebrián, Ivan Dotú, Pascal Van Hentenryck, Peter Clote
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Ab initio protein structure prediction is an important problem for which several algorithms have been developed. Algorithms differ by how they represent 3D protein conformations (on-lattice, off-lattice, coarse-grain or fine-grain model), by the energy model they consider, and whether they are heuristic or exact algorithms. This paper presents a local search algorithm to find the native state for the Hydrophobic-Polar (HP) model on the Face Centered Cubic (FCC) lattice; i.e. a self-avoiding walk on the FCC lattice with maximum number of H-H contacts. The algorithm relies on a randomized, structured initialization, a novel fitness function to guide the search, and efficient data structures to obtain self-avoiding walks. Experimental results on benchmark instances show the efficiency and excellent performance of our algorithm, and illustrate the biological pertinence of the FCC lattice.
On-the-Fly Situation Composition within Smart Spaces
Authors: Prem Prakash Jayaraman, Arkady Zaslavsky, Jerker Delsing
Venue: Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces (2009)

Advances in pervasive computing systems have made smart computing spaces a reality. These smart spaces are sources of large amount of data required for context aware pervasive applications to function autonomously. In this paper we present a situation aware reasoning system that composes situations at runtime based on available information from the smart spaces. Our proposed system R-CS uses situation composition on-the-fly to compute temporal situations that best represent the real world situation (contextual information). Our proposed situation composition algorithm is dependent on underlying sensor data (hardware and software). These sensory data are prone to errors like inaccuracy, old data, data ambiguity etc. R-CS proposes algorithms that incorporate sensor data errors estimation techniques into our proposed dynamic situation composition based reasoning system. R-CS is built as an extension to Context Spaces, a fixed situation set based reasoning system. We implement R-CS dynamic situation composition algorithms over context spaces and validate our proposed R-CS model against context spaces' fixed situation reasoning model.
Considering Unseen States as Impossible in Factored Reinforcement Learning
Authors: Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillemin, Christophe Meyer
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

The Factored Markov Decision Process (fmdp) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a collection of random variables. Factored Reinforcement Learning (frl) is an Model-based Reinforcement Learning approach to fmdps where the transition and reward functions of the problem are learned. In this paper, we show how to model in a theoretically well-founded way the problems where some combinations of state variable values may not occur, giving rise to impossible states. Furthermore, we propose a new heuristics that considers as impossible the states that have not been seen so far. We derive an algorithm whose improvement in performance with respect to the standard approach is illustrated through benchmark experiments.