OpenRaiser/Intern-Atlas huggingface dataset:
Tensor Networks for Big Data Analytics and Large-Scale Optimization Problems
Venue: arXiv cs.NA 2014
Year: 2014

In this paper we review basic and emerging models and associated algorithms for large-scale tensor networks, especially Tensor Train (TT) decompositions using novel mathematical and graphical representations. We discus the concept of tensorization (i.e., creating very high-order tensors from lower-order original data) and super compression of data achieved via quantized tensor train (QTT) networks. The purpose of a tensorization and quantization is to achieve, via low-rank tensor approximations "super" compression, and meaningful, compact representation of structured data. The main objective of this paper is to show how tensor networks can be used to solve a wide class of big data optimization problems (that are far from tractable by classical numerical methods) by applying tensorization and performing all operations using relatively small size matrices and tensors and applying iteratively optimized and approximative tensor contractions. Keywords: Tensor networks, tensor train (TT) decompositions, matrix product states (MPS), matrix product operators (MPO), basic tensor operations, tensorization, distributed representation od data optimization problems for very large-scale problems: generalized eigenvalue decomposition (GEVD), PCA/SVD, canonical correlation analysis (CCA).
The Relaxed Square Property
Venue: arXiv cs.DM 2014
Year: 2014

Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with non-trivial RSP-relations in particular includes graph bundles. Furthermore, RSP-relations are intimately related with covering graph constructions. For K_23-free graphs finest RSP-relations can be computed in polynomial-time. In general, however, they are not unique and their number may even grow exponentially. They behave well for graph products, however, in sense that a finest RSP-relations can be obtained easily from finest RSP-relations on the prime factors.
Even faster integer multiplication
Venue: arXiv cs.CC 2014
Year: 2014

We give a new proof of Fürer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike Fürer, our method does not require constructing special coefficient rings with "fast" roots of unity. Moreover, we prove the more explicit bound O(n log n K^(log^* n))$ with K = 8. We show that an optimised variant of Fürer's algorithm achieves only K = 16, suggesting that the new algorithm is faster than Fürer's by a factor of 2^(log^* n). Assuming standard conjectures about the distribution of Mersenne primes, we give yet another algorithm that achieves K = 4.
An improved car-following model considering variable safety headway distance
Venue: arXiv cs.NA 2014
Year: 2014

Considering high speed following on expressway or highway, an improved car-following model is developed in this paper by introducing variable safety headway distance. Stability analysis of the new model is carried out using the control theory method. Finally, numerical simulations are implemented and the results show good consistency with theoretical study.
Listen-and-Talk: Full-duplex Cognitive Radio Networks
Venue: arXiv cs.NI 2014
Year: 2014

In traditional cognitive radio networks, secondary users (SUs) typically access the spectrum of primary users (PUs) by a two-stage "listen-before-talk" (LBT) protocol, i.e., SUs sense the spectrum holes in the first stage before transmit in the second stage. In this paper, we propose a novel "listen-and-talk" (LAT) protocol with the help of the full-duplex (FD) technique that allows SUs to simultaneously sense and access the vacant spectrum. Analysis of sensing performance and SU's throughput are given for the proposed LAT protocol. And we find that due to self-interference caused by FD, increasing transmitting power of SUs does not always benefit to SU's throughput, which implies the existence of a power-throughput tradeoff. Besides, though the LAT protocol suffers from self-interference, it allows longer transmission time, while the performance of the traditional LBT protocol is limited by channel spatial correction and relatively shorter transmission period. To this end, we also present an adaptive scheme to improve SUs' throughput by switching between the LAT and LBT protocols. Numerical results are provided to verify the proposed methods and the theoretical results.
Representations of measurable sets in computable measure theory
Venue: arXiv cs.LO 2014
Year: 2014

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly countably infinite, over some alphabet Σ. As a basic computability structure we consider a computable measure on a computable $σ$-algebra. We introduce and compare w.r.t. reducibility several natural representations of measurable sets. They are admissible and generally form four different equivalence classes. We then compare our representations with those introduced by Y. Wu and D. Ding in 2005 and 2006 and claim that one of our representations is the most useful one for studying computability on measurable functions.
Modeling structural change in spatial system dynamics: A Daisyworld example
Venue: arXiv cs.CE 2014
Year: 2014

System dynamics (SD) is an effective approach for helping reveal the temporal behavior of complex systems. Although there have been recent developments in expanding SD to include systems' spatial dependencies, most applications have been restricted to the simulation of diffusion processes; this is especially true for models on structural change (e.g. LULC modeling). To address this shortcoming, a Python program is proposed to tightly couple SD software to a Geographic Information System (GIS). The approach provides the required capacities for handling bidirectional and synchronized interactions of operations between SD and GIS. In order to illustrate the concept and the techniques proposed for simulating structural changes, a fictitious environment called Daisyworld has been recreated in a spatial system dynamics (SSD) environment. The comparison of spatial and non-spatial simulations emphasizes the importance of considering spatio-temporal feedbacks. Finally, practical applications of structural change models in agriculture and disaster management are proposed.
A New Approach for Super resolution by Using Web Images and FFT Based Image Registration
Venue: arXiv cs.CV 2014
Year: 2014

Preserving accuracy is a challenging issue in super resolution images. In this paper, we propose a new FFT based image registration algorithm and a sparse based super resolution algorithm to improve the accuracy of super resolution image. Given a low resolution image, our approach initially extracts the local descriptors from the input and then the local descriptors from the whole correlated images using the SIFT algorithm. Once this is completed, it will compare the local descriptors on the basis of a threshold value. The retrieved images could be having different focal length, illumination, inclination and size. To overcome the above differences of the retrieved images, we propose a new FFT based image registration algorithm. After the registration stage, we apply a sparse based super resolution on the images for recreating images with better resolution compared to the input. Based on the PSSNR calculation and SSIM comparison, we can see that the new methodology creates a better image than the traditional methods.
Abduction and Dialogical Proof in Argumentation and Logic Programming
Venue: arXiv cs.AI 2014
Year: 2014

We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e., finding hypothe- ses that explain skeptical/credulous support) and we show that our model can be instantiated on the basis of abductive logic programs.
Aggregate channel features for multi-view face detection
Venue: arXiv cs.CV 2014
Year: 2014

Face detection has drawn much attention in recent decades since the seminal work by Viola and Jones. While many subsequences have improved the work with more powerful learning algorithms, the feature representation used for face detection still can't meet the demand for effectively and efficiently handling faces with large appearance variance in the wild. To solve this bottleneck, we borrow the concept of channel features to the face detection domain, which extends the image channel to diverse types like gradient magnitude and oriented gradient histograms and therefore encodes rich information in a simple form. We adopt a novel variant called aggregate channel features, make a full exploration of feature design, and discover a multi-scale version of features with better performance. To deal with poses of faces in the wild, we propose a multi-view detection approach featuring score re-ranking and detection adjustment. Following the learning pipelines in Viola-Jones framework, the multi-view face detector using aggregate channel features shows competitive performance against state-of-the-art algorithms on AFW and FDDB testsets, while runs at 42 FPS on VGA images.
Building Sustainable Software - The CSDMS Approach
Venue: arXiv cs.SE 2014
Year: 2014

CSDMS, The Community Surface Dynamics Modeling System, is an NSF funded project whose focus is to aid a diverse community of earth and ocean system model users and developers to use and create robust software quickly. To this end, CSDMS develops, integrates, archives and disseminates earth-system models and tools to an international (67 country) community with the goal of building the set of tools necessary to model the earth system. Modelers use CSDMS for access to hundreds of open source surface-dynamics models and tools, as well as model metadata. Such a model repository increases model transparency and helps eliminate duplication by presenting the current state of modeling efforts. To increase software sustainability, composability and interoperability, CSDMS promotes standards that define common modeling interfaces, semantic mediation between models, and model metadata. Through online resources and workshops, CSDMS promotes software engineering best practices, which are unfamiliar to many developers within our modeling community. For example, version control, unit testing, continuous integration, test-driven development, and well-written clean code are all topics of the educational mission of CSDMS.
Effective Capacity in Cognitive Radio Broadcast Channels
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations. We initially describe three different cooperative channel sensing strategies with different hard-decision combining algorithms at the ST, namely OR, Majority, and AND rules. Since the channel sensing occurs with possible errors, we consider a combined interference power constraint by which the transmission power of the secondary users (SUs) is bounded when the channel is sensed as both busy and idle. Furthermore, regarding the channel sensing decision and its correctness, there exist possibly four different transmission scenarios. We provide the instantaneous ergodic capacities of the channel between the ST and each SR in all of these scenarios. Granting that transmission outage arises when the instantaneous transmission rate is greater than the instantaneous ergodic capacity, we establish two different transmission rate policies for the SUs when the channel is sensed as idle. One of these policies features a greedy approach disregarding a possible transmission outage, and the other favors a precautious manner to prevent this outage. Subsequently, we determine the effective capacity region of this channel model, and we attain the power allocation policies that maximize this region. Finally, we present the numerical results. We first show the superiority of Majority rule when the channel sensing results are good. Then, we illustrate that a greedy transmission rate approach is more beneficial for the SUs under strict interference power constraints, whereas sending with lower rates will be more advantageous under loose interference constraints.
Probabilistic Opacity for Markov Decision Processes
Venue: arXiv cs.CR 2014
Year: 2014

Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non deterministic choice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and $ω$-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non opaque becomes decidable for a restricted class of $ω$-regular secrets, as well as for all $ω$-regular secrets under finite-memory schedulers.
A Plausibility Semantics for Abstract Argumentation Frameworks
Venue: arXiv cs.AI 2014
Year: 2014

We propose and investigate a simple ranking-measure-based extension semantics for abstract argumentation frameworks based on their generic instantiation by default knowledge bases and the ranking construction semantics for default reasoning. In this context, we consider the path from structured to logical to shallow semantic instantiations. The resulting well-justified JZ-extension semantics diverges from more traditional approaches.
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
Venue: arXiv cs.DS 2014
Year: 2014

We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it can be extended for threshold graphs. In contrast, we give a polynomial-time algorithm to solve the problem for graphs with pathwidth one. Thus, this paper gives precise analyses of the problem with respect to pathwidth.
Corecursive Algebras, Corecursive Monads and Bloom Monads
Venue: arXiv cs.LO 2014
Year: 2014

An algebra is called corecursive if from every coalgebra a unique coalgebra-to-algebra homomorphism exists into it. We prove that free corecursive algebras are obtained as coproducts of the terminal coalgebra (considered as an algebra) and free algebras. The monad of free corecursive algebras is proved to be the free corecursive monad, where the concept of corecursive monad is a generalization of Elgot's iterative monads, analogous to corecursive algebras generalizing completely iterative algebras. We also characterize the Eilenberg-Moore algebras for the free corecursive monad and call them Bloom algebras.
Pre service Teachers Perception of using Mobile Devices in Teaching Climate Change in Primary Schools
Venue: arXiv cs.CY 2014
Year: 2014

The realities of climate change are gradually dawning on everyone including children. The need for a disaster reduction education requires the use of mobile technologies to identify some of the impact of climate change within an environment and create awareness on the dangers associated with climate change. Since the pre service teachers will teach the primary school pupils, it is apt that the use of mobile technologies should constitute part of their preparation while in training. This paper examined pre service teachers perception of using mobile technologies in teaching climate change in the primary school. One hundred and fifty (150) pre service teachers in two Colleges of Education in the erosion disaster zones of Anambra and Imo States in the south eastern state of Nigeria were used for the study. Three research questions guided the study. The study utilized a survey approach to collect and analyze the data. The results from the study show that the pre-service teachers were confident that the use of mobile devices will create significant climate change awareness. However, the pre service teachers saw the need for using mobile devices fin their preparation. Suggestions were made towards ensuring the integration of mobile technology literacy in the pre service teacher education curriculum.
Estimation of phase noise in oscillators with colored noise sources
Venue: arXiv cs.IT 2014
Year: 2014

In this letter we study the design of algorithms for estimation of phase noise (PN) with colored noise sources. A soft-input maximum a posteriori PN estimator and a modified soft-input extended Kalman smoother are proposed. The performance of the proposed algorithms are compared against those studied in the literature, in terms of mean square error of PN estimation, and symbol error rate of the considered communication system. The comparisons show that considerable performance gains can be achieved by designing estimators that employ correct knowledge of the PN statistics.
Structural and Optimization Properties for Joint Selection of Source Rates and Network Flow
Venue: arXiv cs.NI 2014
Year: 2014

We consider the optimal transmission of distributed correlated discrete memoryless sources across a network with capacity constraints. We present several previously undiscussed structural properties of the set of feasible rates and transmission schemes. We extend previous results concerning the intersection of polymatroids and contrapolymatroids to characterize when all of the vertices of the Slepian-Wolf rate region are feasible for the capacity constrained network. An explicit relationship between the conditional independence relationships of the distributed sources and the number of vertices for the Slepian-Wolf rate region are given. These properties are then applied to characterize the optimal transmission rate and scheme and its connection to the corner points of the Slepian-Wolf rate region. In particular, we demonstrate that when the per-source compression costs are in tension with the per-link flow costs the optimal flow/rate point need not coincide with a vertex of the Slepian-Wolf rate region. Finally, we connect results for the single-sink problem to the multi-sink problem by extending structural insights and developing upper and lower bounds on the optimal cost of the multi-sink problem.
Distributed Pricing-Based User Association for Downlink Heterogeneous Cellular Networks
Venue: arXiv cs.NI 2014
Year: 2014

This paper considers the optimization of the user and base-station (BS) association in a wireless downlink heterogeneous cellular network under the proportional fairness criterion. We first consider the case where each BS has a single antenna and transmits at fixed power, and propose a distributed price update strategy for a pricing-based user association scheme, in which the users are assigned to the BS based on the value of a utility function minus a price. The proposed price update algorithm is based on a coordinate descent method for solving the dual of the network utility maximization problem, and it has a rigorous performance guarantee. The main advantage of the proposed algorithm as compared to the existing subgradient method for price update is that the proposed algorithm is independent of parameter choices and can be implemented asynchronously. Further, this paper considers the joint user association and BS power control problem, and proposes an iterative dual coordinate descent and the power optimization algorithm that significantly outperforms existing approaches. Finally, this paper considers the joint user association and BS beamforming problem for the case where the BSs are equipped with multiple antennas and spatially multiplex multiple users. We incorporate dual coordinate descent with the weighted minimum mean-squared error (WMMSE) algorithm, and show that it achieves nearly the same performance as a computationally more complex benchmark algorithm (which applies the WMMSE algorithm on the entire network for BS association), while avoiding excessive BS handover.
Sonification of a Network's Self-Organized Criticality
Venue: arXiv cs.HC 2014
Year: 2014

Communication networks involve the transmission and reception of large volumes of data. Research indicates that network traffic volumes will continue to increase. These traffic volumes will be unprecedented and the behaviour of global information infrastructures when dealing with these data volumes is unknown. It has been shown that complex systems (including computer networks) exhibit self-organized criticality under certain conditions. Given the possibility in such systems of a sudden and spontaneous system reset the development of techniques to inform system administrators of this behaviour could be beneficial. This article focuses on the combination of two dissimilar research concepts, namely sonification (a form of auditory display) and self-organized criticality (SOC). A system is described that sonifies in real time an information infrastructure's self-organized criticality to alert the network administrators of both normal and abnormal network traffic and operation.
Flow for Meta Control
Venue: arXiv cs.AI 2014
Year: 2014

The psychological state of flow has been linked to optimizing human performance. A key condition of flow emergence is a match between the human abilities and complexity of the task. We propose a simple computational model of flow for Artificial Intelligence (AI) agents. The model factors the standard agent-environment state into a self-reflective set of the agent's abilities and a socially learned set of the environmental complexity. Maximizing the flow serves as a meta control for the agent. We show how to apply the meta-control policy to a broad class of AI control policies and illustrate our approach with a specific implementation. Results in a synthetic testbed are promising and open interesting directions for future work.
A Survey of Digital Watermarking Techniques and its Applications
Venue: arXiv cs.MM 2014
Year: 2014

Digital media is the need of a people now a day as the alternate of paper media.As the technology grown up digital media required protection while transferring through internet or others mediums.Watermarking techniques have been developed to fulfill this requirement.This paper aims to provide a detailed survey of all watermarking techniques specially focuses on image watermarking types and its applications in today world.
An landcover fuzzy logic classification by maximumlikelihood
Venue: arXiv cs.CV 2014
Year: 2014

In present days remote sensing is most used application in many sectors. This remote sensing uses different images like multispectral, hyper spectral or ultra spectral. The remote sensing image classification is one of the significant method to classify image. In this state we classify the maximum likelihood classification with fuzzy logic. In this we experimenting fuzzy logic like spatial, spectral texture methods in that different sub methods to be used for image classification.