OpenRaiser/Intern-Atlas huggingface dataset:
Previous Messages Provide the Key to Achieve Shannon Capacity in a Wiretap Channel
Venue: arXiv cs.IT 2014
Year: 2014

We consider a wiretap channel and use previously transmitted messages to generate a secret key which increases the secrecy capacity. This can be bootstrapped to increase the secrecy capacity to the Shannon capacity without using any feedback or extra channel while retaining the strong secrecy of the wiretap channel.
Degrees of Freedom of Uplink-Downlink Multiantenna Cellular Networks
Venue: arXiv cs.IT 2014
Year: 2014

An uplink-downlink two-cell cellular network is studied in which the first base station (BS) with $M_1$ antennas receives independent messages from its $N_1$ serving users, while the second BS with $M_2$ antennas transmits independent messages to its $N_2$ serving users. That is, the first and second cells operate as uplink and downlink, respectively. Each user is assumed to have a single antenna. Under this uplink-downlink setting, the sum degrees of freedom (DoF) is completely characterized as the minimum of $(N_1N_2+\min(M_1,N_1)(N_1-N_2)^++\min(M_2,N_2)(N_2-N_1)^+)/\max(N_1,N_2)$, $M_1+N_2,M_2+N_1$, $\max(M_1,M_2)$, and $\max(N_1,N_2)$, where $a^+$ denotes $\max(0,a)$. The result demonstrates that, for a broad class of network configurations, operating one of the two cells as uplink and the other cell as downlink can strictly improve the sum DoF compared to the conventional uplink or downlink operation, in which both cells operate as either uplink or downlink. The DoF gain from such uplink-downlink operation is further shown to be achievable for heterogeneous cellular networks having hotspots and with delayed channel state information.
Development of an open source software module for enhanced visualization during MR-guided interstitial gynecologic brachytherapy
Venue: arXiv cs.SY 2014
Year: 2014

In 2010, gynecologic malignancies were the 4th leading cause of death in U.S. women and for patients with extensive primary or recurrent disease, treatment with interstitial brachytherapy may be an option. However, brachytherapy requires precise insertion of hollow catheters with introducers into the tumor in order to eradicate the cancer. In this study, a software solution to assist interstitial gynecologic brachytherapy has been investigated and the software has been realized as an own module under (3D) Slicer, which is a free open source software platform for (translational) biomedical research. The developed research module allows on-time processing of intra-operative magnetic resonance imaging (iMRI) data over a direct DICOM connection to a MR scanner. Afterwards follows a multi-stage registration of CAD models of the medical brachytherapy devices (template, obturator) to the patient's MR images, enabling the virtual placement of interstitial needles to assist the physician during the intervention.
Improved Approximation Algorithms for Earth-Mover Distance in Data Streams
Venue: arXiv cs.DS 2014
Year: 2014

For two multisets $S$ and $T$ of points in $[Δ]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e., $EMD(S,T) = \min_{π:S\rightarrow T}\sum_{a\in S}||a-π(a)||_1$, where $π$ ranges over all one-to-one mappings. The sketching complexity of approximating earth-mover distance in the two-dimensional grid is mentioned as one of the open problems in the literature. We give two algorithms for computing EMD between two multi-sets when the number of distinct points in one set is a small value $k=\log^{O(1)}(Δn)$. Our first algorithm gives a $(1+ε)$-approximation using $O(kε^{-2}\log^{4}n)$ space and works only in the insertion-only model. The second algorithm gives a $O(\min(k^3,\logΔ))$-approximation using $O(\log^{3}Δ\cdot\log\logΔ\cdot\log n)$-space in the turnstile model.
Reconstructing Native Language Typology from Foreign Language Usage
Venue: arXiv cs.CL 2014
Year: 2014

Linguists and psychologists have long been studying cross-linguistic transfer, the influence of native language properties on linguistic performance in a foreign language. In this work we provide empirical evidence for this process in the form of a strong correlation between language similarities derived from structural features in English as Second Language (ESL) texts and equivalent similarities obtained from the typological features of the native languages. We leverage this finding to recover native language typological similarity structure directly from ESL text, and perform prediction of typological features in an unsupervised fashion with respect to the target languages. Our method achieves 72.2% accuracy on the typology prediction task, a result that is highly competitive with equivalent methods that rely on typological resources.
Inference in the FO(C) Modelling Language
Venue: arXiv cs.LO 2014
Year: 2014

Recently, FO(C), the integration of C-Log with classical logic, was introduced as a knowledge representation language. Up to this point, no systems exist that perform inference on FO(C), and very little is known about properties of inference in FO(C). In this paper, we study both of the above problems. We define normal forms for FO(C), one of which corresponds to FO(ID). We define transformations between these normal forms, and show that, using these transformations, several inference tasks for FO(C) can be reduced to inference tasks for FO(ID), for which solvers exist. We implemented a prototype of this transformation, and thus present the first system to perform inference in FO(C). We also provide results about the complexity of reasoning in FO(C).
JyNI - Using native CPython-Extensions in Jython
Venue: arXiv cs.PL 2014
Year: 2014

Jython is a Java based Python implementation and the most seamless way to integrate Python and Java. However, it does not support native extensions written for CPython like NumPy or SciPy. Since most scientific Python code fundamentally depends on exactly such native extensions directly or indirectly, it usually cannot be run with Jython. JyNI (Jython Native Interface) aims to close this gap. It is a layer that enables Jython users to load native CPython extensions and access them from Jython the same way as they would do in CPython. In order to leverage the JyNI functionality, you just have to put it on the Java classpath when Jython is launched. It neither requires you to recompile the extension code, nor to build a customized Jython fork. That means, it is binary compatible with existing extension builds. At the time of writing, JyNI does not fully implement the Python C-API and it is only capable of loading simple examples that only involve most basic built-in types. The concept is rather complete though and our goal is to provide the C-API needed to load NumPy as soon as possible. After that we will focus on SciPy and others. We expect that our work will also enable Java developers to use CPython extensions like NumPy in their Java code.
SfePy - Write Your Own FE Application
Venue: arXiv cs.CE 2014
Year: 2014

SfePy (Simple Finite Elements in Python) is a framework for solving various kinds of problems (mechanics, physics, biology, ...) described by partial differential equations in two or three space dimensions by the finite element method. The paper illustrates its use in an interactive environment or as a framework for building custom finite-element based solvers.
On an Algorithm for Isomorphism-Free Generations of Combinatorial Objects
Venue: arXiv cs.DS 2014
Year: 2014

In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set Λ_n^k consisting of all n\times n binary matrices having exactly k 1's in every row and every column without perambulating all elements. In the described algorithm bitwise operations are substantially used. In this way it becomes easier to find the solution to the problem for receiving one representative from every equivalence class regarding the introduced in the article equivalence relation in the set Λ_n^k . The last problem is equivalent to the problem for finding all canonical matrices in Λ_n^k .
Computability of 1-manifolds
Venue: arXiv cs.LO 2014
Year: 2014

A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact manifold with boundary, then the computability of \deltaS implies the computability of S. In this paper we examine the case when S is a 1-manifold with boundary, not necessarily compact. We show that a similar result holds in this case under assumption that S has finitely many components.
Big Spectrum Data: The New Resource for Cognitive Wireless Networking
Venue: arXiv cs.OH 2014
Year: 2014

The era of Big Data is here now, which has brought both unprecedented opportunities and critical challenges. In this article, from a perspective of cognitive wireless networking, we start with a definition of Big Spectrum Data by analyzing its characteristics in terms of six Vs, i.e., volume, variety, velocity, veracity, viability, and value. We then present a high-level tutorial on research frontiers in Big Spectrum Data analytics to guide the development of practical algorithms. We also highlight Big Spectrum Data as the new resource for cognitive wireless networking by presenting the emerging use cases.
Similar Part Rearrangement With Pebble Graphs
Venue: arXiv cs.RO 2014
Year: 2014

This work proposes a method for effectively computing manipulation paths to rearrange similar objects in a cluttered space. The solution can be used to place similar products in a factory floor in a desirable arrangement or for retrieving a particular object from a shelf blocked by similarly sized objects. These are challenging problems as they involve combinatorially large, continuous configuration spaces due to the presence of multiple moving bodies and kinematically complex manipulators. This work leverages ideas from algorithmic theory, multi-robot motion planning and manipulation planning to propose appropriate graphical representations for this challenge. These representations allow to quickly reason whether manipulation paths allow the transition between entire sets of objects arrangements without having to explicitly enumerate the path for each pair of arrangements. The proposed method also allows to take advantage of precomputation given a manipulation roadmap for transferring a single object in the same cluttered space. The resulting approach is evaluated in simulation for a realistic model of a Baxter robot and executed in open-loop on the real system, showing that the approach solves complex instances and is promising in terms of scalability and success ratio.
The Dafny Integrated Development Environment
Venue: arXiv cs.PL 2014
Year: 2014

In recent years, program verifiers and interactive theorem provers have become more powerful and more suitable for verifying large programs or proofs. This has demonstrated the need for improving the user experience of these tools to increase productivity and to make them more accessible to non-experts. This paper presents an integrated development environment for Dafny-a programming language, verifier, and proof assistant-that addresses issues present in most state-of-the-art verifiers: low responsiveness and lack of support for understanding non-obvious verification failures. The paper demonstrates several new features that move the state-of-the-art closer towards a verification environment that can provide verification feedback as the user types and can present more helpful information about the program or failed verifications in a demand-driven and unobtrusive way.
The assertive profile of the Bulgarian students in computer science and computer engineering
Venue: arXiv cs.CY 2014
Year: 2014

Different points of view on the nature and content of the assertiveness are followed in this paper. The main purpose is to study the assertive profile of Bulgarian students in computer science and computer engineering by analyzing the components of assertiveness. Research was performed using testing methods. It was found that the level of expressivity of this personal quality among subjects were above-average level.
Implementation of Sensor Network using Efficient CAN Interface
Venue: arXiv cs.OH 2014
Year: 2014

Sensors monitored by centralized system, that may be used for controlling and monitoring industrial parameters (Temp, Pressure, Speed, Torque) by using CAN interface. In this paper we presents a comprehensive overview of controller area networks, their architecture, protocol, and standards. Also, this paper gives an overview of CAN applications, in both the industrial and nonindustrial fields. Due to CAN reliability, efficiency and robustness, we also propose the extension of CAN applications to sensor network. In this paper, a framework of sensor network for monitoring industrial parameters is explained where sensors are physically distributed and CAN is used to exchange system information. CAN (Controller Area Network) is a high integrity serial bus protocol that is designed to operate at high speeds ranging from 20kbit/s to 1Mbit/s which provide an efficient, reliable and very economical link
A Comparison of First-order Algorithms for Machine Learning
Venue: arXiv cs.LG 2014
Year: 2014

Using an optimization algorithm to solve a machine learning problem is one of mainstreams in the field of science. In this work, we demonstrate a comprehensive comparison of some state-of-the-art first-order optimization algorithms for convex optimization problems in machine learning. We concentrate on several smooth and non-smooth machine learning problems with a loss function plus a regularizer. The overall experimental results show the superiority of primal-dual algorithms in solving a machine learning problem from the perspectives of the ease to construct, running time and accuracy.
Power Management Techniques for Data Centers: A Survey
Venue: arXiv cs.DC 2014
Year: 2014

With growing use of internet and exponential growth in amount of data to be stored and processed (known as 'big data'), the size of data centers has greatly increased. This, however, has resulted in significant increase in the power consumption of the data centers. For this reason, managing power consumption of data centers has become essential. In this paper, we highlight the need of achieving energy efficiency in data centers and survey several recent architectural techniques designed for power management of data centers. We also present a classification of these techniques based on their characteristics. This paper aims to provide insights into the techniques for improving energy efficiency of data centers and encourage the designers to invent novel solutions for managing the large power dissipation of data centers.
When Queueing Meets Coding: Optimal-Latency Data Retrieving Scheme in Storage Clouds
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we study the problem of reducing the delay of downloading data from cloud storage systems by leveraging multiple parallel threads, assuming that the data has been encoded and stored in the clouds using fixed rate forward error correction (FEC) codes with parameters (n, k). That is, each file is divided into k equal-sized chunks, which are then expanded into n chunks such that any k chunks out of the n are sufficient to successfully restore the original file. The model can be depicted as a multiple-server queue with arrivals of data retrieving requests and a server corresponding to a thread. However, this is not a typical queueing model because a server can terminate its operation, depending on when other servers complete their service (due to the redundancy that is spread across the threads). Hence, to the best of our knowledge, the analysis of this queueing model remains quite uncharted. Recent traces from Amazon S3 show that the time to retrieve a fixed size chunk is random and can be approximated as a constant delay plus an i.i.d. exponentially distributed random variable. For the tractability of the theoretical analysis, we assume that the chunk downloading time is i.i.d. exponentially distributed. Under this assumption, we show that any work-conserving scheme is delay-optimal among all on-line scheduling schemes when k = 1. When k > 1, we find that a simple greedy scheme, which allocates all available threads to the head of line request, is delay optimal among all on-line scheduling schemes. We also provide some numerical results that point to the limitations of the exponential assumption, and suggest further research directions.
A Formal Approach to System Integration Testing
Venue: arXiv cs.SE 2014
Year: 2014

System integration testing is the process of testing a system by the stepwise integration of sub-components. Usually these sub-components are already verified to guarantee their correct functional behavior. By integration of these verified subcomponents into the overall system, emergent behavior may occur, i.e. behavior that evolves by the assembling of the subcomponents. For system integration testing, both, the correct functional behavior of the overall system, and, the proper functioning of the sub-components in their system environment, have to be verified. In this work we present the idea of an approach for system integration testing based on formal verification. The system components are modeled in SystemC. In a first step these components are formally verified. Then a model of the overall system is built. In a second step this system model is formally verified. The novelty of this approach is given by two aspects: First, up to now the available verification frameworks for SystemC-models are more a proof of concept than really applicable to real industrial case studies. Secondly, although formal verification techniques are a common technique for the verification of software and hardware, by now they have only marginally considered for system integration testing.
Inventions on dialog boxes used in GUI
Venue: arXiv cs.HC 2014
Year: 2014

The dialog boxes are useful in case of displaying warnings, errors, confirmations etc. in special situations. A typical dialog box is displayed in a small window with some text message along with a few options for the user to select. However, there are certain difficulties associated in programming and implementing a conventional dialog box, such as, severe programming effort, rigidity of the hard coded message, obscuring screen space and so on. There is a need to overcome these difficulties of the dialog box to make them more efficient and useful. The modality of the dialog boxes also creates some limitations. While modal dialog boxes needs to be closed explicitly by the user, modeless dialog boxes can grow in number and become difficult to control. Thus, an ideal dialog box should be deprived of all the above-mentioned drawbacks. The dialog box should not obscure the screen. The user should be able open multiple dialog boxes but without obscuring the screen. This article analyses 5 interesting inventions on dialog boxes selected from US Patent database. Each invention tries to overcome some limitations of a conventional dialog box and provides some innovative features. Each solution is also analyzed from a TRIZ perspective.
Inventions on presenting textual items in Graphical User Interface
Venue: arXiv cs.HC 2014
Year: 2014

Although a GUI largely replaces textual descriptions by graphical icons, the textual items are not completely removed. The textual items are inevitably used in window titles, message boxes, help items, menu items and popup items. Textual items are necessary for communicating messages that are beyond the limitation of graphical messages. However, it is necessary to harness the textual items on the graphical interface in such a way that they complement each other to produce the best effect. One has to keep various considerations in mind while applying textual items in Graphical User Interface. This article illustrates a few inventions on presenting textual items in a Graphical user Interface.
Inventions on Displaying and Resizing Windows
Venue: arXiv cs.HC 2014
Year: 2014

Windows are used quite frequently in a GUI environment. The greatest advantage of using windows is that each window creates a virtual screen space. Hence, although the physical screen space is limited to a few inches, use of windows can create unlimited screen space to display innumerable items. The use of windows facilitates the user to open and interact with multiple programs or documents simultaneously in different windows. Sometimes a single program may also open multiple windows to display various items. The user can resize the windows and move their location time to time as desired. However, there are several concerns of a window relating to its size, appearance, positioning, color, visibility, resizability etc. For example, the window should have a minimum and a maximum size, dragging and resizing the window should be easy, one window should not be obscured by another window, windows should adjust their size and location in order to match with the changes in the resolution and display environment etc. This article illustrates six patents from US Patent database solving problems relating to displaying and resizing of windows. The inventions include automatic resizing and relocating of windows, alternative modes of displaying windows to accommodate within the limited display area, combining both spatial and temporal methods to resize the window, locking and minimizing windows and making the windows invisible on specific situations.
On Strong and Default Negation in Logic Program Updates (Extended Version)
Venue: arXiv cs.AI 2014
Year: 2014

Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong negation by means of a syntactic transformation. In this paper we pinpoint the limitations of both these approaches and argue that both types of negation should be first-class citizens in the context of updates. We identify principles that plausibly constrain their interaction but are not simultaneously satisfied by any existing rule update semantics. Then we extend one of the most advanced semantics with direct support for strong negation and show that it satisfies the outlined principles as well as a variety of other desirable properties.
Characterizing the Power of Moving Target Defense via Cyber Epidemic Dynamics
Venue: arXiv cs.SY 2014
Year: 2014

Moving Target Defense (MTD) can enhance the resilience of cyber systems against attacks. Although there have been many MTD techniques, there is no systematic understanding and {\em quantitative} characterization of the power of MTD. In this paper, we propose to use a cyber epidemic dynamics approach to characterize the power of MTD. We define and investigate two complementary measures that are applicable when the defender aims to deploy MTD to achieve a certain security goal. One measure emphasizes the maximum portion of time during which the system can afford to stay in an undesired configuration (or posture), without considering the cost of deploying MTD. The other measure emphasizes the minimum cost of deploying MTD, while accommodating that the system has to stay in an undesired configuration (or posture) for a given portion of time. Our analytic studies lead to algorithms for optimally deploying MTD.