OpenRaiser/Intern-Atlas huggingface dataset:
Resource Allocation in a Network-Based Cloud Computing Environment: Design Challenges
Venue: arXiv cs.NI 2013
Year: 2013

Cloud computing is an increasingly popular computing paradigm, now proving a necessity for utility computing services. Each provider offers a unique service portfolio with a range of resource configurations. Resource provisioning for cloud services in a comprehensive way is crucial to any resource allocation model. Any model should consider both computational resources and network resources to accurately represent and serve practical needs. Another aspect that should be considered while provisioning resources is energy consumption. This aspect is getting more attention from industry and governments parties. Calls of support for the green clouds are gaining momentum. With that in mind, resource allocation algorithms aim to accomplish the task of scheduling virtual machines on data center servers and then scheduling connection requests on the network paths available while complying with the problem constraints. Several external and internal factors that affect the performance of resource allocation models are introduced in this paper. These factors are discussed in detail and research gaps are pointed out. Design challenges are discussed with the aim of providing a reference to be used when designing a comprehensive energy aware resource allocation model for cloud computing data centers.
Weighted regret-based likelihood: a new approach to describing uncertainty
Venue: arXiv cs.AI 2013
Year: 2013

Recently, Halpern and Leung suggested representing uncertainty by a weighted set of probability measures, and suggested a way of making decisions based on this representation of uncertainty: maximizing weighted regret. Their paper does not answer an apparently simpler question: what it means, according to this representation of uncertainty, for an event E to be more likely than an event E'. In this paper, a notion of comparative likelihood when uncertainty is represented by a weighted set of probability measures is defined. It generalizes the ordering defined by probability (and by lower probability) in a natural way; a generalization of upper probability can also be defined. A complete axiomatic characterization of this notion of regret-based likelihood is given.
Bug Tracking and Reporting System
Venue: arXiv cs.SE 2013
Year: 2013

This is the world of information. The ever growing field Information Technology has its many advanced notable features which made it what it was now today. In this world, the information has to be processed, clearly distributed and must be efficiently reachable to the end users intended for that. Otherwise we know it lead to disastrous situations. The other coin of the same phase is it is absolutely necessary to know any bugs that are hither to faced by the end users. The project Bug Tracking and Reporting System aims to provide the solution for that. The Bug Tracker can be made from any two types. The first one being the system side, the other being the services side. Our project deals with the second one. The paper is wholly dedicated to tracking the bugs that are hither by arise. The administrator maintains the master details regarding to the bugs id, bugs type, bugs description, bugs severity, bugs status, user details. The administrator too has the authority to update the master details of severity level, status level, etc, modules of the paper. The administrator adds the users and assign them responsibility of completing the paper. Finally on analyzing the paper assigned to the particular user, the administrator can track the bugs, and it is automatically added to the tables containing the bugs, by order of severity and status. The administrator can know the information in tact the various paper s assigned to various users, their bug tracking status, their description etc in the form of reports from time to time.
Interpreting a Classical Geometric Proof with Interactive Realizability
Venue: arXiv cs.LO 2013
Year: 2013

We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the existence of a convex angle including a finite collections of points in the real plane and it is related to the existence of a convex hull. We define real numbers as Cauchy sequences of rational numbers, therefore equality and ordering are not decidable. While the proof looks superficially constructive, it employs classical reasoning to handle undecidable comparisons between real numbers, making the underlying algorithm non-effective. The interactive realizability interpretation transforms the non-effective linear algorithm described by the proof into an effective one that uses backtracking to learn from its mistakes. The effective algorithm exhibits a "smart" behavior, performing comparisons only up to the precision required to prove the final statement. This behavior is not explicitly planned but arises from the interactive interpretation of comparisons between Cauchy sequences.
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
Venue: arXiv cs.CC 2013
Year: 2013

Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one reduction by polynomial-time Turing machines) for this class. We exhibit a new one based on questions about expressions built from cross products only.
Intrinsic Universality of Causal Graph Dynamics
Venue: arXiv cs.DM 2013
Year: 2013

Causal graph dynamics are transformations over graphs that capture two important symmetries of physics, namely causality and homogeneity. They can be equivalently defined as continuous and translation invariant transformations or functions induced by a local rule applied simultaneously on every vertex of the graph. Intrinsic universality is the ability of an instance of a model to simulate every other instance of the model while preserving the structure of the computation at every step of the simulation. In this work we present the construction of a family of intrinsically universal instances of causal graphs dynamics, each instance being able to simulate a subset of instances.
On the Equivalence of Cellular Automata and the Tile Assembly Model
Venue: arXiv cs.ET 2013
Year: 2013

In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While sharing several similarities, the models have fundamental differences, most notably the dynamic nature of CA (in which every cell location is allowed to change state an infinite number of times) versus the static nature of the aTAM (in which tiles are static components that can never change or be removed once they attach to a growing assembly). We work with 2-dimensional systems in both models, and for our results we first define what it means for CA systems to simulate aTAM systems, and then for aTAM systems to simulate CA systems. We use notions of simulate which are similar to those used in the study of intrinsic universality since they are in some sense strict, but also intuitively natural notions of simulation. We then demonstrate a particular nondeterministic CA which can be configured so that it can simulate any arbitrary aTAM system, and finally an aTAM tile set which can be configured so that it can be used to simulate any arbitrary nondeterministic CA system which begins with a finite initial configuration.
A Small Universal Petri Net
Venue: arXiv cs.FL 2013
Year: 2013

A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the running time of their weak machine. To simulate the blank words of the weakly universal Turing machine, a couple of dedicated transitions insert their codes when reaching edges of the working zone. To complete a chain of a given Petri net encoding to be executed by the universal Petri net, a translation of a bi-tag system into a Turing machine was constructed. The constructed Petri net is universal in the standard sense; a weaker form of universality for Petri nets was not introduced in this work.
C++11 -- idea r-wartości i przenoszenia
Venue: arXiv cs.PL 2013
Year: 2013

This paper presents a review of some new futures introduced to C++ language by ISO/IEC 14882:2011 standard (known as C++11). It describes the ideas of r-values and move constructors. ---- Niniejszy artykuł jest jednym z serii artykułów w których zawarto przegl{\ka}d nowych elementów j{\ke}zyka C++ wprowadzonych przez standard ISO/IEC 14882:2011, znany pod nazw{\ka} C++11. W artykule przedstawiono nowe możliwości zwi{\ka}zane z przekazywaniem parametrów i pisaniem konstruktorów. Zawarto w nim dokładne omówienie idei r-wartości i przenoszenia obiektów.
Clarification on the Mapping of Reversible Circuits to the NCV-v1 Library
Venue: arXiv cs.ET 2013
Year: 2013

In previous work and motivated by a theoretical discussion on physical realizations, a new quantum gate library (the NCV-v1 library) for electronic design automation of quantum circuits has been proposed. Here, qudits instead of qubits are assumed, i.e. a basic building block which does not rely on a two level quantum system but a (multiple-valued) d-level quantum system is assumed. However, the descriptions on the foundation of this new library remained brief. This technical report provides an extended description of the applied ideas and concepts.
Ubiquitous healthcare monitoring system using integrated triaxial accelerometer,spo2 and location sensors
Venue: arXiv cs.NI 2013
Year: 2013

Ubiquitous healthcare has become one of the prominent areas of research inorder to address the challenges encountered in healthcare environment. In contribution to this area, this study developed a system prototype that recommends diagonostic services based on physiological data collected in real time from a distant patient. The prototype uses WBAN body sensors to be worn by the individual and an android smart phone as a personal server. Physiological data is collected and uploaded to a Medical Health Server (MHS) via GPRS/internet to be analysed. Our implemented prototype monitors the activity, location and physiological data such as SpO2 and Heart Rate (HR) of the elderly and patients in rehabilitation. The uploaded information can be accessed in real time by medical practitioners through a web application.
SimGrid: a Sustained Effort for the Versatile Simulation of Large Scale Distributed Systems
Venue: arXiv cs.DC 2013
Year: 2013

In this paper we present Simgrid, a toolkit for the versatile simulation of large scale distributed systems, whose development effort has been sustained for the last fifteen years. Over this time period SimGrid has evolved from a one-laboratory project in the U.S. into a scientific instrument developed by an international collaboration. The keys to making this evolution possible have been securing of funding, improving the quality of the software, and increasing the user base. In this paper we describe how we have been able to make advances on all three fronts, on which we plan to intensify our efforts over the upcoming years.
Software Abstractions and Methodologies for HPC Simulation Codes on Future Architectures
Venue: arXiv cs.CE 2013
Year: 2013

Large, complex, multi-scale, multi-physics simulation codes, running on high performance com-puting (HPC) platforms, have become essential to advancing science and engineering. These codes simulate multi-scale, multi-physics phenomena with unprecedented fidelity on petascale platforms, and are used by large communities. Continued ability of these codes to run on future platforms is as crucial to their communities as continued improvements in instruments and facilities are to experimental scientists. However, the ability of code developers to do these things faces a serious challenge with the paradigm shift underway in platform architecture. The complexity and uncertainty of the future platforms makes it essential to approach this challenge cooperatively as a community. We need to develop common abstractions, frameworks, programming models and software development methodologies that can be applied across a broad range of complex simulation codes, and common software infrastructure to support them. In this position paper we express and discuss our belief that such an infrastructure is critical to the deployment of existing and new large, multi-scale, multi-physics codes on future HPC platforms.
VisIt: Experiences with Sustainable Software
Venue: arXiv cs.SE 2013
Year: 2013

The success of the VisIt visualization system has been wholly dependent upon the culture and practices of software development that have fostered its welcome by users and embrace by developers and researchers. In the following paper, we, the founding developers and designers of VisIt, summarize some of the major efforts, both successful and unsuccessful, that we have undertaken in the last thirteen years to foster community, encourage research, create a sustainable open-source development model, measure impact, and support production software. We also provide commentary about the career paths that our development work has engendered.
Niche Modeling: Ecological Metaphors for Sustainable Software in Science
Venue: arXiv cs.SE 2013
Year: 2013

This position paper is aimed at providing some history and provocations for the use of an ecological metaphor to describe software development environments. We do not claim that the ecological metaphor is the best or only way of looking at software - rather we want to ask if it can indeed be a productive and thought provoking one.
Information Sharing in Networks of Strategic Agents
Venue: arXiv cs.GT 2013
Year: 2013

To ensure that social networks (e.g. opinion consensus, cooperative estimation, distributed learning and adaptation etc.) proliferate and efficiently operate, the participating agents need to collaborate with each other by repeatedly sharing information. However, sharing information is often costly for the agents while resulting in no direct immediate benefit for them. Hence, lacking incentives to collaborate, strategic agents who aim to maximize their own individual utilities will withhold rather than share information, leading to inefficient operation or even collapse of networks. In this paper, we develop a systematic framework for designing distributed rating protocols aimed at incentivizing the strategic agents to collaborate with each other by sharing information. The proposed incentive protocols exploit the ongoing nature of the agents' interactions to assign ratings and through them, determine future rewards and punishments: agents that have behaved as directed enjoy high ratings -- and hence greater future access to the information of others; agents that have not behaved as directed enjoy low ratings -- and hence less future access to the information of others. Unlike existing rating protocols, the proposed protocol operates in a distributed manner, online, and takes into consideration the underlying interconnectivity of agents as well as their heterogeneity. We prove that in many deployment scenarios the price of anarchy (PoA) obtained by adopting the proposed rating protocols is one. In settings in which the PoA is larger than one, we show that the proposed rating protocol still significantly outperforms existing incentive mechanisms such as Tit-for-Tat. Importantly, the proposed rating protocols can also operate efficiently in deployment scenarios where the strategic agents interact over time-varying network topologies where new agents join the network over time.
Error-Rate Performance Analysis of Wireless Sensor Networks over Fading Channels
Venue: arXiv cs.NI 2013
Year: 2013

In this paper, we analyze the bit-error-rate (BER) performance of wireless sensor networks. A wireless sensor node with a single transmitter antenna and multiple receiver antennas is considered here. We consider M (M greater or equal ro 1) receiver antennas to mitigate channel fading effects. BER performance is analyzed in the presence of a co-channel interference source. Wireless channel is assumed to follow independently Nakagami fading for the wireless sensor network and Rayleigh fading for the interference signal. Based on the derived analytical expressions, the effects of different fading channel and co-channel interference parameters on the BER performance of wireless sensor networks are assessed.
Social Interactive Media Tools and Knowledge Sharing: A Case Study
Venue: arXiv cs.DL 2013
Year: 2013

Purpose: Social Media Tools (SMT) have provided new opportunities for libraries and librarians in the world. In academic libraries, we can use of them as a powerful tool for communication. This study is to determine the use of the social interactive media tools [Social Networking Tools (SNT), Social Bookmarking Tools (SBT), Image or Video Sharing Tools (IVShT), and Mashup Tools (MT)] in disseminating knowledge and information among librarians in the Limerick University, Ireland. Methodology: The study was a descriptive survey. The research population included all librarians in Glucksman library. A questionnaire survey was done to collect data. Statistical software, SPSS16 was used at two levels (descriptive and inferential statistics) for data analyzing. Findings: The findings show that the mean (out of 5.00) of using each of SMT in sharing knowledge by the librarians of Glucksman library is as the following: SNT (2.49), SBT (2.92), IVShT (2.99) and MT (2.5). It shows that most of their interaction related to share of image or video. Originality: SMT provides an excellent platform for the exchange information between students, faculty members, and the librarians themselves. The Glucksman library at the University of Limerick is using this technology. This paper gives an example of how using these tools in the field of Library and Information Science in Ireland. The issues expressed could be beneficial for the development of library services in general and knowledge sharing among librarians in particular.
On the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory
Venue: arXiv cs.CR 2013
Year: 2013

The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and $k$-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable $k$-error linear complexity is proposed to study sequences with stable and large $k$-error linear complexity. In order to study k-error linear complexity of binary sequences with period $2^n$, a new tool called cube theory is developed. By using the cube theory, one can easily construct sequences with the maximum stable $k$-error linear complexity. For such purpose, we first prove that a binary sequence with period $2^n$ can be decomposed into some disjoint cubes and further give a general decomposition approach. Second, it is proved that the maximum $k$-error linear complexity is $2^n-(2^l-1)$ over all $2^n$-periodic binary sequences, where $2^{l-1}\le k<2^{l}$. Thirdly, a characterization is presented about the $t$th ($t>1$) decrease in the $k$-error linear complexity for a $2^n$-periodic binary sequence $s$ and this is a continuation of Kurosawa et al. recent work for the first decrease of k-error linear complexity. Finally, A counting formula for $m$-cubes with the same linear complexity is derived, which is equivalent to the counting formula for $k$-error vectors. The counting formula of $2^n$-periodic binary sequences which can be decomposed into more than one cube is also investigated, which extends an important result by Etzion et al..
Radar shadow detection in SAR images using DEM and projections
Venue: arXiv cs.CV 2013
Year: 2013

Synthetic aperture radar (SAR) images are widely used in target recognition tasks nowadays. In this letter, we propose an automatic approach for radar shadow detection and extraction from SAR images utilizing geometric projections along with the digital elevation model (DEM) which corresponds to the given geo-referenced SAR image. First, the DEM is rotated into the radar geometry so that each row would match that of a radar line of sight. Next, we extract the shadow regions by processing row by row until the image is covered fully. We test the proposed shadow detection approach on different DEMs and a simulated 1D signals and 2D hills and volleys modeled by various variance based Gaussian functions. Experimental results indicate the proposed algorithm produces good results in detecting shadows in SAR images with high resolution.
Graphs that do not contain a cycle with a node that has at least two neighbors on it
Venue: arXiv cs.DM 2013
Year: 2013

We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes of graphs that do not contain as a subgraph and as an induced subgraph, a cycle with a node that has at least two neighbors on the cycle. From these characterizations we get polynomial time recognition algorithms for these classes, as well as polynomial time algorithms for vertex-coloring and edge-coloring.
Integration of the OpenIGTLink Network Protocol for Image-Guided Therapy with the Medical Platform MeVisLab
Venue: arXiv cs.SE 2013
Year: 2013

We present the integration of the OpenIGTLink network protocol for image-guided therapy (IGT) with the medical prototyping platform MeVisLab. OpenIGTLink is a new, open, simple and extensible network communication protocol for IGT. The protocol provides a standardized mechanism to connect hardware and software by the transfer of coordinate transforms, images, and status messages. MeVisLab is a framework for the development of image processing algorithms and visualization and interaction methods, with a focus on medical imaging. The integration of OpenIGTLink into MeVisLab has been realized by developing a software module using the C++ programming language. As a result, researchers using MeVisLab can interface their software to hardware devices that already support the OpenIGTLink protocol, such as the NDI Aurora magnetic tracking system. In addition, the OpenIGTLink module can also be used to communicate directly with Slicer, a free, open source software package for visualization and image analysis. The integration has been tested with tracker clients available online and a real tracking system.
Condition-Based Maintenance using Sensor Arrays and Telematics
Venue: arXiv cs.OH 2013
Year: 2013

Emergence of uniquely addressable embeddable devices has raised the bar on Telematics capabilities. Though the technology itself is not new, its application has been quite limited until now. Sensor based telematics technologies generate volumes of data that are orders of magnitude larger than what operators have dealt with previously. Real-time big data computation capabilities have opened the flood gates for creating new predictive analytics capabilities into an otherwise simple data log systems, enabling real-time control and monitoring to take preventive action in case of any anomalies. Condition-based-maintenance, usage-based-insurance, smart metering and demand-based load generation etc. are some of the predictive analytics use cases for Telematics. This paper presents the approach of condition-based maintenance using real-time sensor monitoring, Telematics and predictive data analytics.