ppxscal/embedding_network huggingface dataset:
Homogeneous Interference Game in Wireless Networks
Authors: Joseph (Seffi) Naor, Danny Raz, Gabriel Scalosub
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We consider the problem of joint usage of a shared wireless channel in a an interference-bound environment, and focus on a distributed setting where there is no central entity managing the various transmissions. In such systems, unlike other multiple access environments, several transmissions may succeed simultaneously, depending on spatial interferences between the different stations. We use a game theoretic view to model the problem, where the stations are selfish agents aiming at maximizing their success probability. We show that when interferences are homogeneous, system performance suffers an exponential degradation in performance at an equilibrium, due to the selfishness of the stations. However, when using a proper penalization scheme for aggressive stations, we can ensure the system's performance value is at least 1/e of the optimal value, while still being at equilibrium.
Superconnectivity of regular graphs with small diameter
Authors: Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin
Venue: Discrete Applied Mathematics (2009)

A graph is superconnected, for short super-@k, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D@?g-2, then the graph is super-@k when g>=5 and a complete graph otherwise.
On the Sign-Stability of Finite Difference Solutions of Semilinear Parabolic Problems
Authors: Róbert Horváth
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The sign-stability property is one of the important qualitative properties of the one-dimensional heat conduction equation, or more generally, of one-dimensional parabolic problems. This property means that the number of the spatial sign-changes of the solution function cannot increase in time. In this paper, sufficient conditions will be given that guarantee the fulfillment of a numerical analogue of the sign-stability for the finite difference solution of a semilinear parabolic problem. The results are demonstrated on a numerical test problem.
Note: A quadratic algorithm for the 2-cyclic robotic scheduling problem
Authors: Pablo Sáez
Venue: Theoretical Computer Science (2009)

We improve on an O(n5logn) algorithm by Kats and Levner [V. Kats, E. Levner, A polynomial algorithm for 2-cyclic robotic scheduling, in: Gelbukh, Reyes-Garcia (Eds.), Proceedings of MICAI'06, in: LNAI, vol. 4293, Springer Verlag, 2006, pp. 439-449] for 2-cyclic robotic scheduling. We provide in this work an O(n2logn) algorithm for this problem.
Painting robot with multi-fingered hands and stereo vision
Authors: Shunsuke Kudoh, Koichi Ogawara, Miti Ruchanurucks, Katsushi Ikeuchi
Venue: Robotics and Autonomous Systems (2009)

In this paper, we describe a painting robot with multi-fingered hands and stereo vision. The goal of this study is for the robot to reproduce the whole procedure involved in human painting. A painting action is divided into three phases: obtaining a 3D model, composing a picture model, and painting by a robot. In this system, various feedback techniques including computer vision and force sensors are used. As experiments, an apple and a human silhouette are painted on a canvas using this system.
A Framework for Mutant Genetic Generation for WS-BPEL
Authors: Juan José Domínguez-Jiménez, Antonia Estero-Botaro, Inmaculada Medina-Bulo
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

The rise of Web Services and their WS-BPEL compositions in recent years makes necessary to pay special attention to testing in this context. Mutation testing is a white box testing technique that has been applied successfully to programs written in different languages. In order to apply it we need a set of mutation operators and a system for mutant generation. This paper introduces a set of mutation operators for the WS-BPEL 2.0 language and a framework, based in genetic algorithms, for automatic mutant generation without rendering all possible mutants. This framework can also detect potentially equivalent mutants.
Adaptable architectural middleware for programming-in-the-small-and-many
Authors: Marija Mikic-Rakic, Nenad Medvidovic
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

A recent emergence of small, resource-constrained, and highly-mobile computing platforms presents numerous new challenges for software developers. We refer to development in this new setting as programming-in-the-small-and-many (Prism). This paper provides a description and evaluation of a middleware intended to support software architecture-based development in the Prism setting. The middleware, called Prism-MW, provides highly efficient and scalable implementation-level support for the key aspects of Prism application architectures. Additionally, Prism-MW is easily extensible to support different application requirements suitable for the Prism setting. Prism-MW is accompanied with design, analysis, deployment, and run-time monitoring tool support. It has been applied in a number of applications and used as an educational tool in a graduate-level embedded systems course. Recently, Prism-MW has been successfully evaluated by a major industrial organization for use in one of their key distributed embedded systems. Our experience with the middleware indicates that the principles of architecture-based software development can be successfully, and flexibly, applied in the Prism setting.
TOFA: Trace Oriented Feature Analysis in Text Categorization
Authors: Jun Yan, Ning Liu, Qiang Yang, Weiguo Fan, Zheng Chen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Dimension reduction for large-scale text data is attracting much attention lately due to the rapid growth of World Wide Web. We can consider dimension reduction algorithms in two categories: feature extraction and feature selection. An important problem remains: it has been difficult to integrate these two algorithm categories into a single framework, making it difficult to reap the benefit of both. In this paper, we formulate the two algorithm categories through a unified optimization framework. Under this framework, we develop a novel feature selection algorithm called Trace Oriented Feature Analysis (TOFA). The novel objective function of TOFA is a unified framework that integrates many prominent feature extraction algorithms such as unsupervised Principal Component Analysis and supervised Maximum Margin Criterion are special cases of it. Thus TOFA can process not only supervised problem but also unsupervised and semi-supervised problems. Experimental results on real text datasets demonstrate the effectiveness and efficiency of TOFA.
Architecting parallel programs
Authors: Joel Phillips, Kurt Keutzer, Michael Wrinn
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The current shift from sequential to multicore and manycore processors presents serious challenges to software developers. A significant part of the industrial and research communities believes that either a) they can squeak by or b) the right compiler, parallel language etc will save them. Such ad hoc responses are likely to prove neither correct nor sustainable. To systematically find and exploit parallelism, and to achieve forward scalability --- that is, designs which efficiently scale to much larger numbers of cores --- will require re-architecting software applications such as EDA. We believe that the key to re-architecting software is the use of design patterns and a pattern language. Furthermore, structural patterns (aka architectural styles) and computational patterns (aka the thirteen dwarfs) are the key high-level design patterns. The patterns are then used to create programming frameworks that can be used to facilitate implementation of the software architecture. This tutorial presents the most recent research results by UC Berkeley and Intel. We will present our working pattern language and give examples on its use in EDA and other application areas.
A moderate constructivist e-learning instructional model evaluated on computer specialists
Authors: Fernando Alonso, Daniel Manrique, José M. Viñes
Venue: Computers Education (2009)

This paper presents a novel instructional model for e-learning and an evaluation study to determine the effectiveness of this model for teaching Java language programming to information technology specialists working for the Spanish Public Administration. This is a general-purpose model that combines objectivist and constructivist learning theories and is based on the concept of learning objective. The purpose of the evaluation study is to find out whether the results of using this distance learning instructional model to teach this subject are comparable to learning in a traditional face-to-face classroom, with the plus of eliminating travel and maintenance expenses of the public servants attending the course and also saving time. The learners, selected at random to participate in this study, were divided into three groups depending on the type of teaching/learning they received: traditional classroom, distance learning with virtualized course contents and distance learning based on the proposed instructional model. The results indicate that the grades and satisfaction levels were similar for learners taught using the proposed instructional model and learners taught in the traditional classroom. Moreover, they were substantially better than for distance learning with virtualized contents, although the mean course learning time is greater.
Probo: a testbed for human robot interaction
Authors: Kristof Goris, Jelle Saldien, Dirk Lefeber
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The concept of the huggable robot Probo is a result of the desire to improve the living conditions of children in hospital environment. These children need distraction and lots of information. In this paper the concept of a new social robot is presented. This robot can be used in hospitals, as a tele-interface for entertainment, communication and medical assistance. Besides the prototype of the real robot, a virtual model has been developed. With user friendly software these models can be used as an interface between an operator and a child. That way, Probo becomes a platform for experiments concerning human robot interaction with great opportunities in different disciplines.
Vibration analysis of plane elasticity problems by the C0-continuous time stepping finite element method
Authors: Junjiang Lai, Jianguo Huang, Chuanmiao Chen
Venue: Applied Numerical Mathematics (2009)

This paper proposes a C^0-continuous time stepping finite element method to solve vibration problems of plane elasticity. In the time direction, unlike the existing methods [F. Costanzo, H. Huang, Proof of unconditional stability for a single-field discontinuous Galerkin finite element formulation for linear elasto-dynamics, Comput. Methods Appl. Mech. Engrg. 194 (2005) 2059-2076; D.A. French, A space-time finite element method for the wave equation, Comput. Methods Appl. Mech. Engrg. 107 (1993) 145-157; H. Huang, F. Costanzo, On the use of space-time finite elements in the solution of elasto-dynamic problems with strain discontinuities, Comput. Methods Appl. Mech. Engrg. 191 (2002) 5315-5343; T.J.R. Hughes, G. Hulbert, Space-time finite element methods for elastodynamics: Formulations and error estimates, Comput. Methods Appl. Mech. Engrg. 66 (1988) 339-363; G. Hulbert, T.J.R. Hughes, Space-time finite element methods for second-order hyperbolic equations, Comput. Methods Appl. Mech. Engrg. 84 (1990) 327-348; C. Johnson, Discontinuous Galerkin finite element methods for second order hyperbolic problems, Comput. Methods Appl. Mech. Engrg. 107 (1993) 117-129; X.D. Li, N.E. Wiberg, Structural dynamic analysis by a time-discontinous Galerkin finite element method, Int. J. Numer. Methods Engrg. 39 (1996) 2131-2152; X.D. Li, N.E. Wiberg, Implementation and adaptivity of a space-time finite element method for structural dynamics, Comput. Methods Appl. Mech. Engrg. 156 (1998) 211-229], this method does not use the discontinuous Galerkin (DG) method to simultaneously discretize the displacement and velocity fields, but only use the C^0-continuous Galerkin method to discretize the displacement field instead. This greatly reduces the size of the linear system to be solved at each time step. The finite element in the space directions is taken as the usual P"r"-"1-conforming element with r>=2. It is proved that the error of the method in the energy norm is O(h^r^-^1+k^3), where h and k denote the mesh sizes of the subdivisions in the space and time directions, respectively. Some numerical tests are included to show the computational performance of the method.
Reducing Complexity Assumptions for&#x00a0;Statistically-Hiding Commitment
Authors: Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
Venue: Journal of Cryptology (2009)

We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et&#x00a0;al. show how to construct such schemes based on any one-way permutation. We improve upon this by showing a construction based on any approximable preimage-size one-way function. These are one-way functions for which it is possible to efficiently approximate the number of pre-images of a given output. A&#x00a0;special case is the class of regular one-way functions where all points in the image of the function have the same (known) number of pre-images. We also prove two additional results related to statistically-hiding commitment. First, we prove a (folklore) parallel composition theorem showing, roughly speaking, that the statistical hiding property of any such commitment scheme is amplified exponentially when multiple independent parallel executions of the scheme are carried out. Second, we show a compiler which transforms any commitment scheme which is statistically hiding against an honest-but-curious receiver into one which is statistically hiding even against a malicious receiver.
Performance evaluation of polarization diversity and space diversity under 3GPP channel model
Authors: Qing Wang, Chunping Hou, Yilong Lu, Zhenghang Yan, Ning Liu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The polarized antenna is widely used in modern cellular installations as it reduces spacing needs and tower loads on BSs. In this paper, polarization diversity and space diversity performance under 3GPP channel model is evaluated through simulation. Polarization diversity was found to be more significant than spatial diversity at improving diversity gain, and hence MIMO system capacity.
Modelling the population density of China at the pixel level based on DMSP/OLS non-radiance-calibrated night-time light images
Authors: L. Zhuo, T. Ichinose, J. Zheng, J. Chen, P. J. Shi, X. Li
Venue: International Journal of Remote Sensing (2009)

The spatial distribution of population density is crucial for analysing the relationships among economic growth, environmental protection and resource use. In this study we simulated China's population density in 1998 at 1 km×1 km resolution by integrating DMSP/OLS non-radiance-calibrated night-time images, SPOT/VGT 10-day maximum NDVI composite, population census data and vector county boundaries. Population density, both inside and outside of light patches, was estimated for four types of counties, which were classified according to their light characteristics. The model for estimating population density inside the light patches was developed based on a significant correlation between light intensity and population, while the model for estimating population density outside of light patches was constructed by combining Coulomb's law with electric field superposition principle. Our method was simpler and less expensive than existing methods for spatializing population density. The results were consistent with other estimates but exhibited more spatial heterogeneity and richer information.
Settling-Optimization-Based Design Approach for Three-Stage Nested-Miller Amplifiers
Authors: Andrea Pugliese, Francesco A. Amoroso, Gregorio Cappuccino, Giuseppe Cocorullo
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

A new design approach for three-stage operational transconductance amplifiers with nested Miller compensation is presented in this paper. By systematically optimizing the amplifier settling behavior, the proposed methodology allows the required speed performances to be reached, avoiding power wasting and blind efforts for trial-and-error design procedures. To demonstrate the effectiveness of the strategy, a three-stage nested-Miller amplifier in voltage follower configuration is simulated in a commercial 0.35 μm CMOS technology. As shown by simulation results, the proposed approach comes in useful to develop fast-settling three-stage amplifiers which are badly needed in many modern applications.
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Authors: Zhao Zhang, Xiaofeng Gao, Weili Wu
Venue: Theoretical Computer Science (2009)

Given a set V of elements, S a family of subsets of V, and G a connected graph on vertex set S,a connected set cover (CSC) is a subfamily R of S such that every element in V is covered by at least one set of R, and the subgraph G[R] of G induced by R is connected. If furthermore G[R] is k-connected and every element in V is covered by at least m sets in R, then R is a (k,m)-CSC. In this paper, we present two approximation algorithms for the minimum CSC problem, and one approximation algorithm for the minimum (2,m)-CSC problem. Performance ratios are analyzed. These are the first approximation algorithms for CSC problems in general graphs with guaranteed performance ratios.
Architecture-aware optimization targeting multithreaded stream computing
Authors: Byunghyun Jang, Synho Do, Homer Pien, David Kaeli
Venue: Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units (2009)

Optimizing program execution targeted for Graphics Processing Units (GPUs) can be very challenging. Our ability to efficiently map serial code to a GPU or stream processing platform is a time consuming task and is greatly hampered by a lack of detail about the underlying hardware. Programmers are left to attempt trial and error to produce optimized codes. Recent publication of the underlying instruction set architecture (ISA) of the AMD/ATI GPU has allowed researchers to begin to propose aggressive optimizations. In this work, we present an optimization methodology that utilizes this information to accelerate programs on AMD/ATI GPUs. We start by defining optimization spaces that guide our work. We begin with disassembled machine code and collect program statistics provided by the AMD Graphics Shader Analyzer (GSA) profiling toolset. We explore optimizations targeting three different computing resources: 1) ALUs, 2) fetch bandwidth, and 3) thread usage, and present optimization techniques that consider how to better utilize each resource. We demonstrate the effectiveness of our proposed optimization approach on an AMD Radeon HD3870 GPU using the Brook+ stream programming language. We describe our optimizations using two commonly-used GPGPU applications that present very different program characteristics and optimization spaces: matrix multiplication and back-projection for medical image reconstruction. Our results show that optimized code can improve performance by 1.45x--6.7x as compared to unoptimized code run on the same GPU platform. The speedup obtained with our optimized implementations are 882x (matrix multiply) and 19x (back-projection) faster as compared with serial implementations run on an Intel 2.66 GHz Core 2 Duo with a 2 GB main memory.
Mobile robot coordination and navigation with directional antennas in positionless wireless sensor networks
Authors: Jehn-Ruey Jiang, Yung-Liang Lai, Fu-Cheng Deng
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In this paper, we propose a suite of three schemes for mobile robot coordination and navigation in positionless wireless sensor networks with the help of directional antennas. When a specific node, called waiting-for-rescue (WFR) node, detects the occurrence of an event, it broadcasts an event notification packet to the entire network for asking a mobile robot to come to help. In many existent schemes, the broadcast is achieved by the flooding scheme and thus incurs redundant forwarding packets. We propose an energy efficient broadcast scheme called farthest node forwarding (FNF), which utilizes received signal strength for a node to determine the backoff time to forward the broadcast packet. Thus, farther nodes have shorter backoff times and higher probabilities to forwarding. As we will show, this can reduce a lot of redundant forwarding packets to save energy, while achieving high reachability. The FNF scheme can also help construct a navigation tree which is rooted at the WFR node and contains only packet forwarding nodes. Under the consideration of multiple WFR nodes and multiple mobile robots, we also develop energy- and time-efficient mobile robot coordination and navigation schemes based on the navigation tree for the mobile robot equipped with a directional antenna. The effectiveness of the proposed schemes is verified in simulations by the ns-2 simulator.
Stationarity tests and MSER-5: exploring the intuition behind mean-squared-error-reduction in detecting and correcting initialization bias
Authors: William W. Franklin, K. Preston White,  Jr.
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We explore the reasoning behind MSER-5, an efficient and effective truncation heuristic for reducing initialization bias in steady-state simulation. We also compare MSER-5 with the KPSS stationarity test as one means of investigating the possibility that MSER's effectiveness is the result of its utility as a stationarity measure. Conversely, this comparison also lets us explore whether or not a stationarity test from the time-series literature can be used as an effective initialization bias-control heuristic. Finally, we investigate the use of an alternative form of MSER-5 that uses a variance estimator that adjusts for serial correlation.
A method based on the improved Kepner-Tregoe program for risk identification: proposals and evaluation of the method
Authors: Takeo Nagashima, Keiichi Nakamura, Kiyomi Shirakawa, Seiichi Komiya
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Recently, project risk management attracts all the attention in order to raise success probability of a project. The authors take up the risk management of a project, above all, risk identification, and show a concrete implementation method based on the improved Kepner-Tregoe Program. They perform laboratory experiments on risk identification using the proposed method. Moreover, they compare the proposed method with the widely known method based on the brainstorming and the original Kepner-Tregoe Program.