ppxscal/embedding_network huggingface dataset:
Employees' attitudes towards Telecommuting. An empirical investigation in the Egyptian Governorate of Dakahlia
Authors: Ahmed Gad Abdel-Wahab
Venue: Behaviour & Information Technology (2007)

Thousands of companies today, in a wide variety of industries, are experiencing the benefits of allowing employees to work from their homes. Telecommuting has become a recognized and accepted work alternative for millions of Americans that has exponentially grown during the past 20 years. The main purpose of this paper is to explore the attitude of the Egyptian information workers towards the concept of telecommuting, and to examine the relationships between such an attitude and workers' expectation of their productivity and job satisfaction if participating in a telecommuting program. Original data were collected using a self-administered questionnaire. A national sample of 228 Egyptian information workers in Dakahlia Governorate in Egypt completed the questionnaires with usable data. The results revealed that more respondents are in favor of telecommuting than those who are not in favor of the concept, and that the increase in the attitude score towards telecommuting tends to be paired with higher expectations about telecommuting productivity and satisfaction.
E&F Chaos: A User Friendly Software Package for Nonlinear Economic Dynamics
Authors: Cees Diks, Cars Hommes, Valentyn Panchenko, Roy Weide
Venue: Computational Economics (2008)

The use of nonlinear dynamic models in economics and finance has expanded rapidly in the last two decades. Numerical simulation is crucial in the investigation of nonlinear systems. E F Chaos is an easy-to-use and freely available software package for simulation of nonlinear dynamic models to investigate stability of steady states and the presence of periodic orbits and chaos by standard numerical simulation techniques such as time series, phase plots, bifurcation diagrams, Lyapunov exponent plots, basin boundary plots and graphical analysis. The package contains many well-known nonlinear models, including applications in economics and finance, and is easy to use for non-specialists. New models and extensions or variations are easy to implement within the software package without the use of a compiler or other software. The software is demonstrated by investigating the dynamical behavior of some simple examples of the familiar cobweb model, including an extension with heterogeneous agents and asynchronous updating of strategies. Simulations with the E F Chaos software quickly provide information about local and global dynamics and easily lead to challenging questions for further mathematical analysis.
Automatic High-Dynamic Range Image Generation for Dynamic Scenes
Authors: Katrien Jacobs, Celine Loscos, Greg Ward
Venue: IEEE Computer Graphics and Applications (2008)

Automatic high-dynamic range image (HDRI) generation from low-dynamic range images (LDRIs) offers a solution to conventional methods, which require a static scene. The method consists of two modules: a camera-alignment module and a movement detector, which removes the ghosting effects in the HDRI created by moving objects.
Numerical quadrature for Bessel transformations
Authors: Shuhuang Xiang, Weihua Gui, Pinghua Mo
Venue: Applied Numerical Mathematics (2008)

In this paper we explore higher order numerical quadratures for the integration of systems containing Bessel functions. Two families of methods are presented. One is based on a truncation of the asymptotic series and the other is extending an approach in the work of Levin. The decay of the error drastically improves as frequency grows. The effectiveness and accuracy of the quadrature is tested for large arguments of Bessel functions.
Multi year satellite remote sensing of particulate matter air quality over Sydney, Australia
Authors: P. Gupta, S. A. Christopher, M. A. Box, G. P. Box
Venue: International Journal of Remote Sensing (2007)

Particulate matter (PM) air-quality information is usually derived from ground-based instruments. These measurements, while valuable, are not well suited to provide air-quality information over large spatial scales. In this study, using 4 years of satellite aerosol optical thickness (AOT) at 0.55 µm derived from the Moderate Resolution Imaging Spectroradiometer (MODIS) on board NASA's Terra and Aqua satellites, we present a multi-year air analysis of PM air quality over Sydney, Australia. We then compare the satellite data with PM2.5 mass concentration measurements from six ground-based stations in the area. Our results indicate significant diurnal variations and an overall increase in PM2.5 during Southern Hemisphere spring and summer seasons due to bush fires. The air quality in Sydney, Australia is good throughout the year except during major bushfires when PM2.5 mass loading can increase from normal (
swissPIT
Authors: Andreas Quandt, Patricia Hernandez, Alexandre Masselot, Céline Hernandez, Sergio Maffioletti, Cesare Pautasso, Ron D. Appel, Frederique Lisacek
Venue: Bioinformatics (2008)

The identification and characterization of peptides from tandem mass spectrometry (MS/MS) data represents a critical aspect of proteomics. Today, tandem MS analysis is often performed by only using a single identification program achieving identification rates between 10–50% (Elias and Gygi, 2007). Beside the development of new analysis tools, recent publications describe also the pipelining of different search programs to increase the identification rate (Hartler et al., 2007; Keller et al., 2005). The Swiss Protein Identification Toolbox (swissPIT) follows this approach, but goes a step further by providing the user an expandable multi-tool platform capable of executing workflows to analyze tandem MS-based data. One of the major problems in proteomics is the absent of standardized workflows to analyze the produced data. This includes the pre-processing part as well as the final identification of peptides and proteins. The main idea of swissPIT is not only the usage of different identification tool in parallel, but also the meaningful concatenation of different identification strategies at the same time. The swissPIT is open source software but we also provide a user-friendly web platform, which demonstrates the capabilities of our software and which is available at http://swisspit.cscs.ch upon request for account. Contact: andreas.quandt@isb-sib.ch
Development of Precise-temperature-controlled Cooling Apparatus for Medical Application by Using Peltier Effect
Authors: Shigenao Maruyama, Atsuki Komiya, Hiroki Takeda, Setsuya Aiba
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper describes precise temperature controlled cooling apparatuses for medical application. A Peltier cryoprobe for dermis treatment and flexible cryoprobe for cryosurgery for deep region of human body were developed by utilizing the Peltier effect. The evaluation experiment of the Peltier cryoprobe was conducted. The proposed apparatus has enough performance to necrotize target diseased cells precisely. The proposed flexible cryoprobe is composed of a flexible resin tube enough to treat the deeper parts of the human body with a catheter. A Peltier element is attached at the top of the probe for active heat-transfer control of the cooling tip. The cooling experiments are carried out and the performance of the cryoprobe is evaluated. The achieved minimum temperature at the tip is -43 ˚C.
Quantum Genetic Algorithm for Multiple RNA Structural Alignment
Authors: Abdesslem Layeb, Souham Meshoul, Mohamed Batouche
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

RNA structural alignment is one of key issues in bioinformatics. It aims to elucidate conserved structural regions among a set of sequences. Finding an accurate conserved structure is still difficult and a time consuming task that involves structural alignment as a prerequisite. In this work, structural alignment is viewed as an optimization process. A quantum based genetic algorithm is proposed to carry out this process. The main features of this algorithm consist in the quantum structure used to represent alignments and the quantum operators defining the overall evolutionary dynamic of the genetic algorithm. The quantum structure relies on the concept of qubit and allows efficient encoding of individuals. Experiments on a wide range of data sets have shown the effectiveness of the proposed framework and its ability to achieve good quality solutions.
Modelling by Petri nets of the hybrid systems in electrical engineering
Authors: Belkacem Sait, Hassane Alla
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

Petri nets enable a discrete event system of any kind whatsoever to be modeled. They present two interesting characteristics. Firstly they make it possible to model and visualize behaviors comprising concurrency, synchronization and resource sharing. Secondly the theoretical results concerning them are plentiful. The aim of this paper is to present a new approach of modelling of the Hybrid Dynamic Systems HDS in the field of the electrical engineering systems. The modelling tool is the Hybrid Petri net HPN, an extension of the Petri nets PN. The HPN unify within the same formalism the modelling of the continuous and discontinuous phenomena basically non dissociable in an electrical engineering unit. It integrates two types of PN: The continuous Petri net CPN models the part continues HDS; traditional PN models the discrete part of the SDH. We represent in this article in the first time the tool of modelling the hybrid Petri net. Then the methodology of representation by HPN of the static inverters, these constituting of the real examples of the hybrid dynamic systems the discrete aspects of these systems are due to operations and the order of the semiconductors (on/off) and the aspects continuous are due to the electrical and mechanical variables of system. The designed model can be uses at the same time for simulation, the control and the monitoring of the system.
Using synchronized atoms to check distributed programs
Authors: H. F. Li, Eslam Al Maghayreh
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The execution of a distributed program generates a large state space which needs to be checked in testing and debugging. Atoms are useful abstractions in reducing the state lattice of a distributed computation; we refer to the reduced lattice as the atomic state lattice. However, general predicates remain difficult to check if they are asserted over all states. This paper presents a formulation to attack this problem involving separation of two different concerns: (a) order/synchronization requirement, and (b) computational dependency among atoms. Order requirement is modeled by the serialization of the global states reached by a synchronized set of atoms. Synchrony among atoms is specified by a synchronization predicate. Computational dependency among synchronized states is modeled by a general predicate. With this modeling assumption, the number of the states where a general predicate needs to be checked will be bounded by the number of atoms executed. Two efficient algorithms for checking a general predicate, in the cases where the synchronization predicate is conjunctive or disjunctive, are presented along with their proof of correctness.
Closed form solution for dynamic fund protection under CEV
Authors: Hoi Ying Wong
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This paper studies the pricing of dynamic fund protection (DFP) in insurance contracts under the constant elasticity of variance (CEV) model. As empirical studies document that stock price volatility is not a constant but changes randomly, CEV model has been a propular alternative to model stock price movements in practice. We derive the first closed form solution to DFP under CEV in terms of Laplace transform.
Proceedings of the 1st international workshop on Multicore software engineering
Venue: International Conference on Software Engineering (2008)

Welcome to the International Workshop on Multicore Software Engineering (IWMSE 2008), the first workshop to focus on the software engineering challenges of chip-multiprocessors, or multi/manycore computers. With the emergence of multi/manycore, parallelism has become affordable at all levels, and software engineers now face the challenge of parallelizing performance-critical applications of all sorts, not just numeric applications. The workshop is intended to bring together researchers and practitioners with diverse backgrounds to advance the state of the art in software engineering for multi/manycore parallel applications. It aims to establish a community interested in advancing tools and methods for the cost-effective development of a broad spectrum of parallel applications, to start and extend a significant research dialog, and to push the boundaries of multicore software. The call for papers attracted 14 submissions from Australia, Canada, China, France, Germany, India, Russia, Sweden, United Kingdom, and the United States. The program committee accepted eight papers that cover a variety of topics, including parallel libraries, programming models and fault detection, multicore applications, and experience reports. In addition, the program includes a tutorial on Intel® Threading Building Blocks -- an open source library that was designed to simplify programming for multi-core platforms -- and a tutorial on parallel computing with X10, a language that supports a variety of concurrent programming idioms. Capturing an initial state of research and practice, we hope that these proceedings serve as a valuable reference for researchers and developers.
A Context Transfer Mechanism for IEEE 802.11r in the Centralized Wireless LAN Architecture
Authors: Chung-Ming Huang, Jian-Wei Li
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

A station (STA) has the demand of the basic service set (BSS) transition in the emergence of centralized Wireless LAN (WLAN)architecture. The centralized WLAN architecture is a centralized hierarchical network and is suitable for large scale deployment. In this paper, we propose a context transfer mechanism using cluster-chain to reduce the BSS transition delay in the centralized WLAN architecture. Comparing with the existing context transfer schemes in terms of BSS transition, the proposed mechanism can have (i) lower signaling cost for context transfer and (ii) higher hit rate in term of STA's context.
A shortest path algorithm with novel heuristics for dynamic transportation networks
Authors: B. Huang, Q. Wu, F. B. Zhan
Venue: International Journal of Geographical Information Science (2007)

Finding an optimal route in dynamic real-time transportation networks is a critical problem for vehicle navigation. Existing approaches are either too complex or incapable of managing complex circumstances where both the location of a mobile object and traffic conditions change over time. In this paper, we propose an incremental search approach with novel heuristics based on a variation of the A* algorithm-Lifelong Planning A*. In addition, we suggest using an ellipse to prune the unnecessary nodes to be scanned in order to speed up the dynamic search process. The proposed algorithm determines the shortest-cost path between a moving object and its destination by continually adapting to the dynamic traffic conditions, while making use of the previous search results. Experimental results evince that the proposed algorithm performs significantly better than the well-known A* algorithm.
GlycoVault: A Bioinformatics Infrastructure for Glycan Pathway Visualization, Analysis and Modeling
Authors: Shravya Nimmagadda, Amrita Basu, Matthew Eavenson, Jun Han, Maciej Janik, Rajesh Narra, Kishore Nimmagadda, Arpan Sharma, Krys J. Kochut, John A. Miller, William S. York
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Glycan biosynthesis is the process by which glycans are built in the cells. Information about the process is available from several Web accessible databases, published papers, experimental data produced at the Complex Carbohydrates Research Center (CCRC) as well as the knowledge accumulated by the biologists working at CCRC. The principal purpose of Glyco-Vault is to support the research of glycobiologists in collecting and analyzing data about glycans, such as the changes in their abundance level over a cell’s lifecycle as well as their correlation with gene expression levels for proteins that serve as enzymes in the biosynthetic process. In order to support glycan biosynthesis pathway visualization, analysis and modeling, GlycoVault has been collecting data and knowledge from a variety of sources. Traditional, bioinformatics resources have been provided by relational databases. Some new research efforts have proposed replacing relational databases with ontologies. In GlycoVault, we are utilizing both technologies to supply an integrated bioinformatics infrastructure that can serve as a resource to both end users as well as other programs and applications.
Applying passive RFID system to wireless headphones for extreme low power consumption
Authors: Joon Goo Lee, Dongha Jung, Jiho Chu, Seok Joong Hwang, Jong Kook Kim, Janam Ku, Seon Wook Kim
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

One of major design concerns about wireless headphone is power consumption. In this paper, we propose a novel design for extreme low power headphone implementation by extending the EPC Class-1 Generation 2 RFID protocol for delivering stream data. We prototyped a reader as a stream generator, and a passive tag as an audio receiver to consume less power than any other protocols for wireless headphones.
A Parametric Algorithm for Long-Short Portfolio Optimization
Authors: Yanwu Liu, Zhongzhen Zhang, Feng Xiong, Liu Fang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

A parametric algorithm is proposed to calculate efficient frontier of long-short portfolio.The key to the algorithm is to introduce parametric technique into the pivoting algorithm. The numerical results show that the algorithm has high computing efficiency. Keywords long-short portfolio; pivoting algorithm; parametric technique
Privacy preserving set intersection based on bilinear groups
Authors: Yingpeng Sang, Hong Shen
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication complexities (N is the number of parties in the protocol). Our protocol is obtained in the malicious model, in which we assume a probabilistic polynomial-time bounded adversary actively controls a fixed set of t (t < N/2) parties. We use a (t + 1,N)-threshold version of the Boneh-Goh-Nissim (BGN) cryptosystem whose underlying group supports bilinear maps. The BGN cryptosystem is generally used in applications where the plaintext space should be small, because there is still a Discrete Logarithm (DL) problem after the decryption. In our protocol the plaintext space can be as large as bounded by the security parameter &tau;, and the intractability of DL problem is utilized to protect the private datasets. Based on the bilinear map, we also construct some efficient non-interactive proofs. The security of our protocol can be reduced to the common intractable problems including the random oracle, subgroup decision and discrete logarithm problems. The computation complexity of our protocol is O(NS2&tau;3) (S is the cardinality of each party's dataset), and the communication complexity is O(NS2&tau;) bits. A similar work by Kissner et al. (2006) needs O(N2S2&tau;3) computation complexity and O(N2S2&tau;) communication complexity for the same level of correctness as ours.
Algebraic approach to absorbing boundary conditions for the Helmholtz equation
Authors: F. Magoulès, F. -X. Roux, L. Series
Venue: International Journal of Computer Mathematics (2007)

Recent work has shown that designing absorbing boundary conditions through algebraic approaches may be a nice alternative to the continuous approaches based on a Fourier analysis. In this paper, an original algebraic technique based on the computation of small patches is presented for the Helmholtz equation. This new technique is not directly linked to the continuous equations of the problem, nor to the numerical scheme. These properties make this technique very convenient to implement in a domain decomposition context. The proposed algebraic absorbing boundary conditions are used in a non-overlapping domain decomposition method and are defined on the interface between the subdomains. An additional coarse grid correction is then applied to ensure full scalability of the domain decomposition method upon the number of subdomains. This coarse grid correction involves trigonometric functions defined on the interface between the subdomains. Numerical experiments are presented and illustrate the robustness and parallel efficiency of the proposed method for acoustics applications.
Instruction Reuse in SPEC, media and packet processing benchmarks: A comparative study of power, performance and related microarchitectural optimizations
Authors: G. Surendra, Subhasis Banerjee, S. K. Nandy
Venue: Journal of Embedded Computing (2006)

The effectiveness of Instruction Reuse (IR) - a technique to eliminate redundant computations at run time - is limited by the fact that performance gain seldom exceeds 3% and is dependent on the criticality of instructions being "reused". In this paper, we focus on the power aspect of IR and propose a "resultbus optimization" that exploits communication reuse to reduce the power dissipated over a high capacitance resultbus. The effectiveness of this optimization depends on the number of result producing instructions that are reused and improves overall power and Energy-Delay Product (EDP) by 3% over a base IR policy for a 1024 entry "Reuse Buffer" (RB). As a domain specific study, we examine the impact of multithreading on IR in the context of packet header processing applications. Specifically, sharing the RB among threads can lead to either constructive or destructive interference, thereby increasing or decreasing the amount of IR that can be uncovered. Further, packet header processing applications are unique in the sense that repetition in data values within "flows" are quite prevalent which can be exploited to improve IR. We find that an architecture that uses this "flow" information to govern accesses to the RB improves IR by as much as 4.6% for header processing kernels.
A Reach and Bound algorithm for acyclic dynamic-programming networks
Authors: Matthew D. Bailey, Robert L. Smith, Jeffrey M. Alden
Venue: Networks (2008)

Node pruning is a commonly used technique for solution acceleration in a dynamic-programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined not to lie on an optimal path. We introduce an ε-pruning condition that extends pruning to include a possible error in the pruning step. This results in a greater reduction of the computation time; however, as a result of the inclusion of this error, the solution can be suboptimal or possibly infeasible. This condition requires the ability to compare the costs of an optimal path from a node to a terminal node. Therefore, we focus on the class of acyclic dynamic programming networks with monotonically decreasing optimal costs-to-go. We provide an easily implementable algorithm, Reach and Bound, which maintains feasibility and bounds the solution's error. We conclude by illustrating the applicability of Reach and Bound on a problem of single location capacity expansion. &copy; 2007 Wiley Periodicals, Inc. NETWORKS, 2008