OpenRaiser/Intern-Atlas huggingface dataset:
Fuzzy Logic Approach for Threat Prioritization in Agile Security Framework using DREAD Model
Venue: arXiv cs.SE 2013
Year: 2013

For a qualitative system sound security practices must be a crucial part throughout the entire software lifecycle. Furthermore, agile software development has paved the way for overcoming the problems faced by developers during traditional development process. In the given paper we are using an Agile Security Framework that is compatible with practices of agile processes and inherit in it the benefits of security engineering activities in the form of risk assessment and threat prioritization. One of the most popular techniques to deal with ever growing risks associated with security threats is DREAD model. It is used for rating risk of threats identified in the abuser stories. In this model threats needs to be defined by sharp cutoffs. However, such precise distribution is not suitable for risk categorization as risks are vague in nature and deals with high level of uncertainty. In view of these risk factors, our paper proposes a novel fuzzy approach using DREAD model for computing risk level that ensures better evaluation of imprecise concepts. Thus it provides the capacity to include subjectivity and uncertainty during risk ranking. A case study has been presented to illustrate and compare the proposed approach with the existing one using Matlab.
Application of polynomial texture mapping in process of digitalization of cultural heritage
Venue: arXiv cs.GR 2013
Year: 2013

In this paper we present modern texture mapping techniques and several applications of polynomial texture mapping in cultural heritage programs. We also consider some well-known and some new methods for mathematical procedure that is involved in generation of polynomial texture maps.
Joint Phase Tracking and Channel Decoding for OFDM Physical-Layer Network Coding
Venue: arXiv cs.IT 2013
Year: 2013

This paper investigates the problem of joint phase tracking and channel decoding in OFDM based Physical-layer Network Coding (PNC) systems. OFDM signaling can obviate the need for tight time synchronization among multiple simultaneous transmissions in the uplink of PNC systems. However, OFDM PNC systems are susceptible to phase drifts caused by residual carrier frequency offsets (CFOs). In the traditional OFDM system in which a receiver receives from only one transmitter, pilot tones are employed to aid phase tracking. In OFDM PNC systems, multiple transmitters transmit to a receiver, and these pilot tones must be shared among the multiple transmitters. This reduces the number of pilots that can be used by each transmitting node. Phase tracking in OFDM PNC is more challenging as a result. To overcome the degradation due to the reduced number of per-node pilots, this work supplements the pilots with the channel information contained in the data. In particular, we propose to solve the problems of phase tracking and channel decoding jointly. Our solution consists of the use of the expectation-maximization (EM) algorithm for phase tracking and the use of the belief propagation (BP) algorithm for channel decoding. The two problems are solved jointly through iterative processing between the EM and BP algorithms. Simulations and real experiments based on software-defined radio show that the proposed method can improve phase tracking as well as channel decoding performance.
The Development of Educational Quality Administration: a Case of Technical College in Southern Thailand
Venue: arXiv cs.CY 2013
Year: 2013

The purpose of this research were: to survey the needs of using the information system for educational quality administration; to develop Information System for Educational quality Administration (ISEs) in accordance with quality assessment standard; to study the qualification of ISEs; and to study satisfaction level of ISEs user. Subsequently, the tools of study have been employed that there were the collection of 47 questionnaires and 5 interviews to specialist by responsible officers for Information center of Technical colleges in Southern Thailand. The analysis of quantitative data has employed descriptive statistics using mean and standard deviation as the tool of measurement.
Special values of Kloosterman sums and binomial bent functions
Venue: arXiv cs.IT 2013
Year: 2013

Let $p\ge 7$, $q=p^m$. $K_q(a)=\sum_{x\in \mathbb{F}_{p^m}} ζ^{\mathrm{Tr}^m_1(x^{p^m-2}+ax)}$ is the Kloosterman sum of $a$ on $\mathbb{F}_{p^m}$, where $ζ=e^{\frac{2π\sqrt{-1}}{p}}$. The value $1-\frac{2}{ζ+ζ^{-1}}$ of $K_q(a)$ and its conjugate have close relationship with a class of binomial function with Dillon exponent. This paper first presents some necessary conditions for $a$ such that $K_q(a)=1-\frac{2}{ζ+ζ^{-1}}$. Further, we prove that if $p=11$, for any $a$, $K_q(a)\neq 1-\frac{2}{ζ+ζ^{-1}}$. And for $p\ge 13$, if $a\in \mathbb{F}_{p^s}$ and $s=\mathrm{gcd}(2,m)$, $K_q(a)\neq 1-\frac{2}{ζ+ζ^{-1}}$. In application, these results explains some class of binomial regular bent functions does not exits.
End-to-End Delay Modeling for Mobile Ad Hoc Networks: A Quasi-Birth-and-Death Approach
Venue: arXiv cs.NI 2013
Year: 2013

Understanding the fundamental end-to-end delay performance in mobile ad hoc networks (MANETs) is of great importance for supporting Quality of Service (QoS) guaranteed applications in such networks. While upper bounds and approximations for end-to-end delay in MANETs have been developed in literature, which usually introduce significant errors in delay analysis, the modeling of exact end-to-end delay in MANETs remains a technical challenge. This is partially due to the highly dynamical behaviors of MANETs, but also due to the lack of an efficient theoretical framework to capture such dynamics. This paper demonstrates the potential application of the powerful Quasi-Birth-and-Death (QBD) theory in tackling the challenging issue of exact end-to-end delay modeling in MANETs. We first apply the QBD theory to develop an efficient theoretical framework for capturing the complex dynamics in MANETs. We then show that with the help of this framework, closed form models can be derived for the analysis of exact end-to-end delay and also per node throughput capacity in MANETs. Simulation and numerical results are further provided to illustrate the efficiency of these QBD theory-based models as well as our theoretical findings.
Replica Exchange using q-Gaussian Swarm Quantum Particle Intelligence Method
Venue: arXiv cs.AI 2013
Year: 2013

We present a newly developed Replica Exchange algorithm using q -Gaussian Swarm Quantum Particle Optimization (REX@q-GSQPO) method for solving the problem of finding the global optimum. The basis of the algorithm is to run multiple copies of independent swarms at different values of q parameter. Based on an energy criterion, chosen to satisfy the detailed balance, we are swapping the particle coordinates of neighboring swarms at regular iteration intervals. The swarm replicas with high q values are characterized by high diversity of particles allowing escaping local minima faster, while the low q replicas, characterized by low diversity of particles, are used to sample more efficiently the local basins. We compare the new algorithm with the standard Gaussian Swarm Quantum Particle Optimization (GSQPO) and q-Gaussian Swarm Quantum Particle Optimization (q-GSQPO) algorithms, and we found that the new algorithm is more robust in terms of the number of fitness function calls, and more efficient in terms ability convergence to the global minimum. In additional, we also provide a method of optimally allocating the swarm replicas among different q values. Our algorithm is tested for three benchmark functions, which are known to be multimodal problems, at different dimensionalities. In addition, we considered a polyalanine peptide of 12 residues modeled using a Gō coarse-graining potential energy function.
A note on sparse least-squares regression
Venue: arXiv cs.DS 2013
Year: 2013

We compute a \emph{sparse} solution to the classical least-squares problem $\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from $A$, and then solves a least-squares problem only with the selected columns. The column selection algorithm that we use is known to perform well for the well studied column subset selection problem. The contribution of this article is to show that it gives favorable results for sparse least-squares as well. Specifically, we prove that the solution vector obtained by our algorithm is close to the solution vector obtained via what is known as the "SVD-truncated regularization approach".
Learning Temporal Logical Properties Discriminating ECG models of Cardiac Arrhytmias
Venue: arXiv cs.LO 2013
Year: 2013

We present a novel approach to learn the formulae characterising the emergent behaviour of a dynamical system from system observations. At a high level, the approach starts by devising a statistical dynamical model of the system which optimally fits the observations. We then propose general optimisation strategies for selecting high support formulae (under the learnt model of the system) either within a discrete set of formulae of bounded complexity, or a parametric family of formulae. We illustrate and apply the methodology on an in-depth case study of characterising cardiac malfunction from electro-cardiogram data, where our approach enables us to quantitatively determine the diagnostic power of a formula in discriminating between different cardiac conditions.
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
Venue: arXiv cs.CC 2013
Year: 2013

The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we consider consist of cooperating systems the communication structure of which forms a line respectively a star.
Evolutionary Design of Numerical Methods: Generating Finite Difference and Integration Schemes by Differential Evolution
Venue: arXiv cs.NE 2013
Year: 2013

Classical and new numerical schemes are generated using evolutionary computing. Differential Evolution is used to find the coefficients of finite difference approximations of function derivatives, and of single and multi-step integration methods. The coefficients are reverse engineered based on samples from a target function and its derivative used for training. The Runge-Kutta schemes are trained using the order condition equations. An appealing feature of the evolutionary method is the low number of model parameters. The population size, termination criterion and number of training points are determined in a sensitivity analysis. Computational results show good agreement between evolved and analytical coefficients. In particular, a new fifth-order Runge-Kutta scheme is computed which adheres to the order conditions with a sum of absolute errors of order 10^-14. Execution of the evolved schemes proved the intended orders of accuracy. The outcome of this study is valuable for future developments in the design of complex numerical methods that are out of reach by conventional means.
Internames: a name-to-name principle for the future Internet
Venue: arXiv cs.NI 2013
Year: 2013

We propose Internames, an architectural framework in which names are used to identify all entities involved in communication: contents, users, devices, logical as well as physical points involved in the communication, and services. By not having a static binding between the name of a communication entity and its current location, we allow entities to be mobile, enable them to be reached by any of a number of basic communication primitives, enable communication to span networks with different technologies and allow for disconnected operation. Furthermore, with the ability to communicate between names, the communication path can be dynamically bound to any of a number of end-points, and the end-points themselves could change as needed. A key benefit of our architecture is its ability to accommodate gradual migration from the current IP infrastructure to a future that may be a ubiquitous Information Centric Network. Basic building blocks of Internames are: i) a name-based Application Programming Interface; ii) a separation of identifiers (names) and locators; iii) a powerful Name Resolution Service (NRS) that dynamically maps names to locators, as a function of time/location/context/service; iv) a built-in capacity of evolution, allowing a transparent migration from current networks and the ability to include as particular cases current specific architectures. To achieve this vision, shared by many other researchers, we exploit and expand on Information Centric Networking principles, extending ICN functionality beyond content retrieval, easing send-to-name and push services, and allowing to use names also to route data in the return path. A key role in this architecture is played by the NRS, which allows for the co-existence of multiple network "realms", including current IP and non-IP networks, glued together by a name-to-name overarching communication primitive.
Expected time complexity of the auction algorithm and the push relabel algorithm for maximal bipartite matching on random graphs
Venue: arXiv cs.DS 2013
Year: 2013

In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of the auction algorithm for bipartite matching is $O\left(\frac{N\log^2(N)}{\log\left(Np\right)}\right)$ on sequential machines. This is equivalent to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with $O(\log(N))$ processors and shared memory with an expected time complexity of $O(N\log(N))$.
DASS: Distributed Adaptive Sparse Sensing
Venue: arXiv cs.IT 2013
Year: 2013

Wireless sensor networks are often designed to perform two tasks: sensing a physical field and transmitting the data to end-users. A crucial aspect of the design of a WSN is the minimization of the overall energy consumption. Previous researchers aim at optimizing the energy spent for the communication, while mostly ignoring the energy cost due to sensing. Recently, it has been shown that considering the sensing energy cost can be beneficial for further improving the overall energy efficiency. More precisely, sparse sensing techniques were proposed to reduce the amount of collected samples and recover the missing data by using data statistics. While the majority of these techniques use fixed or random sampling patterns, we propose to adaptively learn the signal model from the measurements and use the model to schedule when and where to sample the physical field. The proposed method requires minimal on-board computation, no inter-node communications and still achieves appealing reconstruction performance. With experiments on real-world datasets, we demonstrate significant improvements over both traditional sensing schemes and the state-of-the-art sparse sensing schemes, particularly when the measured data is characterized by a strong intra-sensor (temporal) or inter-sensors (spatial) correlation.
An Alternate Approach for Designing a Domain Specific Image Search Prototype Using Histogram
Venue: arXiv cs.CV 2013
Year: 2013

Everyone knows that thousand of words are represented by a single image. As a result image search has become a very popular mechanism for the Web searchers. Image search means, the search results are produced by the search engine should be a set of images along with their Web page Unified Resource Locator. Now Web searcher can perform two types of image search, they are Text to Image and Image to Image search. In Text to Image search, search query should be a text. Based on the input text data system will generate a set of images along with their Web page URL as an output. On the other hand, in Image to Image search, search query should be an image and based on this image system will generate a set of images along with their Web page URL as an output. According to the current scenarios, Text to Image search mechanism always not returns perfect result. It matches the text data and then displays the corresponding images as an output, which is not always perfect. To resolve this problem, Web researchers have introduced the Image to Image search mechanism. In this paper, we have also proposed an alternate approach of Image to Image search mechanism using Histogram.
Experiments of Distance Measurements in a Foliage Plant Retrieval System
Venue: arXiv cs.CV 2013
Year: 2013

One of important components in an image retrieval system is selecting a distance measure to compute rank between two objects. In this paper, several distance measures were researched to implement a foliage plant retrieval system. Sixty kinds of foliage plants with various leaf color and shape were used to test the performance of 7 different kinds of distance measures: city block distance, Euclidean distance, Canberra distance, Bray-Curtis distance, x2 statistics, Jensen Shannon divergence and Kullback Leibler divergence. The results show that city block and Euclidean distance measures gave the best performance among the others.
Performance Engineering for a Medical Imaging Application on the Intel Xeon Phi Accelerator
Venue: arXiv cs.DC 2013
Year: 2013

We examine the Xeon Phi, which is based on Intel's Many Integrated Cores architecture, for its suitability to run the FDK algorithm--the most commonly used algorithm to perform the 3D image reconstruction in cone-beam computed tomography. We study the challenges of efficiently parallelizing the application and means to enable sensible data sharing between threads despite the lack of a shared last level cache. Apart from parallelization, SIMD vectorization is critical for good performance on the Xeon Phi; we perform various micro-benchmarks to investigate the platform's new set of vector instructions and put a special emphasis on the newly introduced vector gather capability. We refine a previous performance model for the application and adapt it for the Xeon Phi to validate the performance of our optimized hand-written assembly implementation, as well as the performance of several different auto-vectorization approaches.
Maximizing Energy-Efficiency in Multi-Relay OFDMA Cellular Networks
Venue: arXiv cs.IT 2013
Year: 2013

This contribution presents a method of obtaining the optimal power and subcarrier allocations that maximize the energy-efficiency (EE) of a multi-user, multi-relay, orthogonal frequency division multiple access (OFDMA) cellular network. Initially, the objective function (OF) is formulated as the ratio of the spectral-efficiency (SE) over the power consumption of the network. This OF is shown to be quasi-concave, thus Dinkelbach's method can be employed for solving it as a series of parameterized concave problems. We characterize the performance of the aforementioned method by comparing the optimal solutions obtained to those found using an exhaustive search. Additionally, we explore the relationship between the achievable SE and EE in the cellular network upon increasing the number of active users. In general, increasing the number of users supported by the system benefits both the SE and EE, and higher SE values may be obtained at the cost of EE, when an increased power may be allocated.
Opti{c,m}al: Optical/Optimal Routing in Massively Dense Wireless Networks
Venue: arXiv cs.NI 2013
Year: 2013

We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a novel macroscopic description becomes possible. The macroscopic description is not detailed, but nevertheless contains enough information to permit a meaningful study and performance optimization of the network. Within this context, we continue and significantly expand previous work on the analogy between optimal routing and the propagation of light according to the laws of Geometrical Optics. Firstly, we pose the analogy in a more general framework than previously, notably showing how the eikonal equation, which is the central equation of Geometrical Optics, also appears in the networking context. Secondly, we develop a methodology for calculating the cost function, which is the function describing the network at the macroscopic level. We apply this methodology for two important types of networks: bandwidth limited and energy limited.
Logics for XML
Venue: arXiv cs.PL 2014
Year: 2014

This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages. The system relies on a fixpoint temporal logic with converse, derived from the mu-calculus, where models are finite trees. This calculus is expressive enough to capture regular tree types along with multi-directional navigation in trees, while having a single exponential time complexity. Specifically the decidability of the logic is proved in time 2^O(n) where n is the size of the input formula. Major XML concepts are linearly translated into the logic: XPath navigation and node selection semantics, and regular tree languages (which include DTDs and XML Schemas). Based on these embeddings, several problems of major importance in XML applications are reduced to satisfiability of the logic. These problems include XPath containment, emptiness, equivalence, overlap, coverage, in the presence or absence of regular tree type constraints, and the static type-checking of an annotated query. The focus is then given to a sound and complete algorithm for deciding the logic, along with a detailed complexity analysis, and crucial implementation techniques for building an effective solver. Practical experiments using a full implementation of the system are presented. The system appears to be efficient in practice for several realistic scenarios. The main application of this work is a new class of static analyzers for programming languages using both XPath expressions and XML type annotations (input and output). Such analyzers allow to ensure at compile-time valuable properties such as type-safety and optimizations, for safer and more efficient XML processing.
Finite-size effects in the dependency networks of free and open-source software
Venue: arXiv cs.OH 2014
Year: 2014

We propose a continuum model for the degree distribution of directed networks in free and open-source software. The degree distributions of links in both the in-directed and out-directed dependency networks follow Zipf's law for the intermediate nodes, but the heavily linked nodes and the poorly linked nodes deviate from this trend and exhibit finite-size effects. The finite-size parameters make a quantitative distinction between the in-directed and out-directed networks. For the out-degree distribution, the initial condition for a dynamic evolution corresponds to the limiting count of the most heavily liked nodes that the out-directed network can finally have. The number of nodes contributing out-directed links grows with every generation of software release, but this growth ultimately saturates towards a terminal value due to the finiteness of semantic possibilities in the network.