OpenRaiser/Intern-Atlas huggingface dataset:
Distributed Space-Time Coding for Full-Duplex Asynchronous Cooperative Communications
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation, which achieves the full asynchronous cooperative diversity. The DLC-STC Scheme 2 is for the case of the partial loop channel cancellation and amplifying, where some loop signals are used as the self-coding instead of treated as interference to be directly cancelled. We show this scheme can achieve full asynchronous cooperative diversity. We then evaluate the performance of the two schemes when loop channel information is not accurate and present an amplifying factor control method for the DLC-STC Scheme 2 to improve its performance with inaccurate loop channel information. Simulation results show that the DLC-STC Scheme 1 outperforms the DLC-STC Scheme 2 and the delay diversity scheme if perfect or high quality loop channel information is available at the relay, while the DLC-STC Scheme 2 achieves better performance if the loop channel information is imperfect.
A Simplified Approach for Quality Management in Data Warehouse
Venue: arXiv cs.DB 2013
Year: 2013

Data warehousing is continuously gaining importance as organizations are realizing the benefits of decision oriented data bases. However, the stumbling block to this rapid development is data quality issues at various stages of data warehousing. Quality can be defined as a measure of excellence or a state free from defects. Users appreciate quality products and available literature suggests that many organization`s have significant data quality problems that have substantial social and economic impacts. A metadata based quality system is introduced to manage quality of data in data warehouse. The approach is used to analyze the quality of data warehouse system by checking the expected value of quality parameters with that of actual values. The proposed approach is supported with a metadata framework that can store additional information to analyze the quality parameters, whenever required.
Mining The Relationship Between Demographic Variables And Brand Associations
Venue: arXiv cs.CY 2013
Year: 2013

This research aims to mine the relationship between demographic variables and brand associations, and study the relative importance of these variables. The study is conducted on fast-food restaurant brands chains in Jordan. The result ranks and evaluates the demographic variables in relation with the brand associations for the selected sample. Discovering brand associations according to demographic variables reveals many facts and linkages in the context of Jordanian culture. Suggestions are given accordingly for marketers to benefits from to build their strategies and direct their decisions. Also, data mining technique used in this study reflects a new trend for studying and analyzing marketing samples.
A Robust Variational Model for Positive Image Deconvolution
Venue: arXiv cs.CV 2013
Year: 2013

In this paper, an iterative method for robust deconvolution with positivity constraints is discussed. It is based on the known variational interpretation of the Richardson-Lucy iterative deconvolution as fixed-point iteration for the minimisation of an information divergence functional under a multiplicative perturbation model. The asymmetric penaliser function involved in this functional is then modified into a robust penaliser, and complemented with a regulariser. The resulting functional gives rise to a fixed point iteration that we call robust and regularised Richardson-Lucy deconvolution. It achieves an image restoration quality comparable to state-of-the-art robust variational deconvolution with a computational efficiency similar to that of the original Richardson-Lucy method. Experiments on synthetic and real-world image data demonstrate the performance of the proposed method.
Computation of Summaries Using Net Unfoldings
Venue: arXiv cs.LO 2013
Year: 2013

We study the following summarization problem: given a parallel composition A=A1||...||An of labelled transition systems communicating with the environment through a distinguished component Ai, efficiently compute a summary Si such that E||A and E||Si are trace-equivalent for every environment E. While Si can be computed using elementary automata theory, the resulting algorithm suffers from the state-explosion problem. We present a new, simple but subtle algorithm based on net unfoldings, a partial-order semantics, give some experimental results using an implementation on top of MOLE, and show that our algorithm can handle divergences and compute weighted summaries with minor modifications.
Interactive Relay Assisted Source Coding
Venue: arXiv cs.IT 2013
Year: 2013

This paper investigates a source coding problem in which two terminals communicating through a relay wish to estimate one another's source within some distortion constraint. The relay has access to side information that is correlated with the sources. Two different schemes based on the order of communication, \emph{distributed source coding/delivery} and \emph{two cascaded rounds}, are proposed and inner and outer bounds for the resulting rate-distortion regions are provided. Examples are provided to show that neither rate-distortion region includes the other one.
Semi Symmetric Method Of SAN Storage Virtualization
Venue: arXiv cs.SE 2013
Year: 2013

Virtualization is one of the biggest buzzwords of the technology industry right at this moment. The fast growth in storage capacity and processing power in enterprise installations coupled with the need for high availability, requires Storage Area Network (SAN) architecture to provide seamless addition of storage and performance elements without downtime. The usual goal of virtualization is to centralize administrative tasks while improving scalability and work loads. This paper, describing about new proposed method for virtualization, which would be overcome limitations of existed methods for storage virtualization
Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter
Venue: arXiv cs.DS 2013
Year: 2013

The state of the art in approximation algorithms for facility location problems are complicated combinations of various techniques. In particular, the currently best 1.488-approximation algorithm for the uncapacitated facility location (UFL) problem by Shi Li is presented as a result of a non-trivial randomization of a certain scaling parameter in the LP-rounding algorithm by Chudak and Shmoys combined with a primal-dual algorithm of Jain et al. In this paper we first give a simple interpretation of this randomization process in terms of solving an aux- iliary (factor revealing) LP. Then, armed with this simple view point, Abstract. we exercise the randomization on a more complicated algorithm for the k-level version of the problem with penalties in which the planner has the option to pay a penalty instead of connecting chosen clients, which results in an improved approximation algorithm.
Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
Venue: arXiv cs.DM 2013
Year: 2013

In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some generalizations. These methodology uses weighted automata, equations of ordinary generating functions and continued fractions. It is a variation of the one proposed by J. Rutten.
Eclipse-IT 2013: Proceedings of VIII Workshop of the Italian Eclipse Community
Venue: arXiv cs.SE 2013
Year: 2013

This volume contains the extended abstracts of the contributions presented at EclipseIT 2013, the 8th workshop of the Italian Eclipse Community, hosted by the Computer Science Department of the University of Milan (Crema Campus) on September 19-20, 2013. Although Eclipse was initially designed as an integrated development environment (IDE) for object-oriented application development, today it represents an open development platform comprised of extensible frameworks, tools and runtimes for building, deploying and managing software. Around Eclipse, an international live community continuously works on improving the framework and on promoting the use of Eclipse. That happens also in Italy. This workshop is, indeed, the eighth yearly meeting of the Italian Eclipse Community which includes universities, public institutions and industries, researchers and practitioners, students and professionals, all joined by the interest in experimenting, extending, and supporting the Eclipse platform. The special topic of this edition is the Software cooperative development for mobile applications. Two tutorials are offered on this theme: (1) Sviluppo di applicazioni enterprise per il mobile con IBM Jazz, Eclipse e Worklight by Ferdinando Gorga from IBM, and (2) Uso di Eclipse per lo sviluppo cooperativo del software, by Paolo Maresca of the University of Naples, Federico II.
Practical Reduction of Edge Flip Sequences in Two-Dimensional Triangulations
Venue: arXiv cs.CG 2013
Year: 2013

The development of laser scanning techniques has popularized the representation of 3D shapes by triangular meshes with a large number of vertices. Compression techniques dedicated to such meshes have emerged, which exploit the idea that the connectivity of a dense mesh does not deviate much from the connectivity that can be constructed automatically from the vertex positions (while possibly being guided by additional codes). The edge flip is one of the tools that can encode the differences between two meshes, and it is important to control the length of a sequence of flips that transform one triangulation into another. This paper provides a practical solution to this problem. Indeed, the problem of determining a minimal sequence of edge flips between two triangulations is NP-complete for some types of triangulations including manifold triangulations of surfaces, so that it is necessary to develop heuristics. Moreover, it is sometimes difficult to establish a first sequence of flips between two meshes, and we advocate a solution based on the reduction of an existing sequence. The new approach we propose is founded on the assignment of labels to identify the edges, with a property of label transfer during a flip. This gives a meaning to the tracking of an edge in a sequence of flips and offers the exploitation of very simple combinatorial properties. All the operations are performed directly on the sequence of labels denoting the edges to be flipped, almost regardless of the underlying surface, since only local temporary connectivity is involved.
Max-Min Energy Efficient Beamforming for Multicell Multiuser Joint Transmission Systems
Venue: arXiv cs.IT 2013
Year: 2013

Energy efficient communication technology has attracted much attention due to the explosive growth of energy consumption in current wireless communication systems. In this letter we focus on fairness-based energy efficiency and aim to maximize the minimum user energy efficiency in the multicell multiuser joint beamforming system, taking both dynamic and static power consumptions into account. This optimization problem is a non-convex fractional programming problem and hard to tackle. In order to find its solution, the original problem is transformed into a parameterized polynomial subtractive form by exploiting the relationship between the user rate and the minimum mean square error, and using the fractional programming theorem. Furthermore, an iterative algorithm with proved convergence is developed to achieve a near-optimal performance. Numerical results validate the effectiveness of the proposed solution and show that our algorithm significantly outperforms the max-min rate optimization algorithm in terms of maximizing the minimum energy efficiency.
MIT App Inventor: Enabling Personal Mobile Computing
Venue: arXiv cs.CY 2013
Year: 2013

MIT App Inventor is a drag-and-drop visual programming tool for designing and building fully functional mobile apps for Android. App Inventor promotes a new era of personal mobile computing in which people are empowered to design, create, and use personally meaningful mobile technology solutions for their daily lives, in endlessly unique situations. App Inventor's intuitive programming metaphor and incremental development capabilities allow the developer to focus on the logic for programming an app rather than the syntax of the coding language, fostering digital literacy for all. Since it was moved from Google to MIT, a number of improvements have been added, and research projects are underway.
An approach for a business-driven cloudcompliance analysis covering public sector process improvement requirements
Venue: arXiv cs.CY 2013
Year: 2013

The need for process improvement is an important target that does affect as well the government processes. Specifically in the public sector there are specific challenges to face.New technology approaches within government processes such as cloud services are necessary to address these challenges. Following the current discussion of cloudification of business processes all processes are considered similar in regards to their usability within the cloud. The truth is, that neither all processes have the same usability for cloud services not do they have the same importance for a specific company.The most comprehensive process within a company is the corporate value chain. In this article one key proposition is to use the corporate value chain as the fundamental structuring backbone for all business process analysis and improvement activities. It is a pre-requisite to identify the core elements of the value chain that are essential for the individual companys business and the root cause for any company success. In this paper we propose to use the company-specific value-creation for the cloud-affinity and the cloud-usability of a business process in public sector considering the specific challenges of addressing processes in cloud services. Therefor it is necessary to formalize the way the processes with its interdependencies are documented in context of their company-specific value chain (as part of the various deployment- and governance alternatives. Moreover, it is essential in the public sector to describe in detail the environmental and external restrictions of processes. With the use of this proposed methodology it becomes relatively easy to identify cloud-suitable processes within the public sector and thus optimize the public companies value generation tightly focused with the use of this new technology.
Spontaneous Analogy by Piggybacking on a Perceptual System
Venue: arXiv cs.AI 2013
Year: 2013

Most computational models of analogy assume they are given a delineated source domain and often a specified target domain. These systems do not address how analogs can be isolated from large domains and spontaneously retrieved from long-term memory, a process we call spontaneous analogy. We present a system that represents relational structures as feature bags. Using this representation, our system leverages perceptual algorithms to automatically create an ontology of relational structures and to efficiently retrieve analogs for new relational structures from long-term memory. We provide a demonstration of our approach that takes a set of unsegmented stories, constructs an ontology of analogical schemas (corresponding to plot devices), and uses this ontology to efficiently find analogs within new stories, yielding significant time-savings over linear analog retrieval at a small accuracy cost.
Bandits with Switching Costs: T^{2/3} Regret
Venue: arXiv cs.LG 2013
Year: 2013

We study the adversarial multi-armed bandit problem in a setting where the player incurs a unit cost each time he switches actions. We prove that the player's $T$-round minimax regret in this setting is $\widetildeΘ(T^{2/3})$, thereby closing a fundamental gap in our understanding of learning with bandit feedback. In the corresponding full-information version of the problem, the minimax regret is known to grow at a much slower rate of $Θ(\sqrt{T})$. The difference between these two rates provides the \emph{first} indication that learning with bandit feedback can be significantly harder than learning with full-information feedback (previous results only showed a different dependence on the number of actions, but not on $T$.) In addition to characterizing the inherent difficulty of the multi-armed bandit problem with switching costs, our results also resolve several other open problems in online learning. One direct implication is that learning with bandit feedback against bounded-memory adaptive adversaries has a minimax regret of $\widetildeΘ(T^{2/3})$. Another implication is that the minimax regret of online learning in adversarial Markov decision processes (MDPs) is $\widetildeΘ(T^{2/3})$. The key to all of our results is a new randomized construction of a multi-scale random walk, which is of independent interest and likely to prove useful in additional settings.
Solvency Markov Decision Processes with Interest
Venue: arXiv cs.CE 2013
Year: 2013

Solvency games, introduced by Berger et al., provide an abstract framework for modelling decisions of a risk-averse investor, whose goal is to avoid ever going broke. We study a new variant of this model, where, in addition to stochastic environment and fixed increments and decrements to the investor's wealth, we introduce interest, which is earned or paid on the current level of savings or debt, respectively. We study problems related to the minimum initial wealth sufficient to avoid bankruptcy (i.e. steady decrease of the wealth) with probability at least p. We present an exponential time algorithm which approximates this minimum initial wealth, and show that a polynomial time approximation is not possible unless P = NP. For the qualitative case, i.e. p=1, we show that the problem whether a given number is larger than or equal to the minimum initial wealth belongs to both NP and coNP, and show that a polynomial time algorithm would yield a polynomial time algorithm for mean-payoff games, existence of which is a longstanding open problem. We also identify some classes of solvency MDPs for which this problem is in P. In all above cases the algorithms also give corresponding bankruptcy avoiding strategies.
10 Inventions on Keyboard Key Switch Mechanism
Venue: arXiv cs.HC 2013
Year: 2013

The key switches of the keyboard of a computer system are generally comprised of a key cap having a plunger, conductive rubber disposed above a membrane circuit and compressed by the plunger to trigger the membrane circuit causing it to produce an electric signal to the computer. Some key switches use springs. Some other keyboards use rubber domes or a dome sheet, which do the function of springs. When the user depresses the key button the spring or domes collapse. The key switch depresses the key stem, which actuates the button on the membrane circuit. When the user releases the button the springs or rubber domes push the button up to the rest position. This article illustrates 10 inventions on different key switch mechanism. The inventions are selected from US patent database. The inventions try to simplify the mechanism, reduce manufacturing cost, increase accuracy and reliability, and increase strength and robustness of the keys.
Towards (1+ε)-Approximate Flow Sparsifiers
Venue: arXiv cs.DS 2013
Year: 2013

A useful approach to "compress" a large network $G$ is to represent it with a {\em flow-sparsifier}, i.e., a small network $H$ that supports the same flows as $G$, up to a factor $q \geq 1$ called the quality of sparsifier. Specifically, we assume the network $G$ contains a set of $k$ terminals $T$, shared with the network $H$, i.e., $T\subseteq V(G)\cap V(H)$, and we want $H$ to preserve all multicommodity flows that can be routed between the terminals $T$. The challenge is to construct $H$ that is small. These questions have received a lot of attention in recent years, leading to some known tradeoffs between the sparsifier's quality $q$ and its size $|V(H)|$. Nevertheless, it remains an outstanding question whether every $G$ admits a flow-sparsifier $H$ with quality $q=1+ε$, or even $q=O(1)$, and size $|V(H)|\leq f(k,ε)$ (in particular, independent of $|V(G)|$ and the edge capacities). Making a first step in this direction, we present new constructions for several scenarios: * Our main result is that for quasi-bipartite networks $G$, one can construct a $(1+ε)$-flow-sparsifier of size $\poly(k/\eps)$. In contrast, exact ($q=1$) sparsifiers for this family of networks are known to require size $2^{Ω(k)}$. * For networks $G$ of bounded treewidth $w$, we construct a flow-sparsifier with quality $q=O(\log w / \log\log w)$ and size $O(w\cdot \poly(k))$. * For general networks $G$, we construct a {\em sketch} $sk(G)$, that stores all the feasible multicommodity flows up to factor $q=1+\eps$, and its size (storage requirement) is $f(k,ε)$.
10 Inventions on collapsible keyboards: A TRIZ based analysis
Venue: arXiv cs.HC 2013
Year: 2013

Although a bigger keyboard is often comfortable to work with, they cannot be fit into laptop and small size computer boxes. The portable and handheld computers need small size keyboards. So there is a need to reduce the size of the keyboard to fit into the laptop box. There are various mechanisms to reduce the size of the keyboard; collapsible keyboard is one of them. Although different inventions intend to achieve the same objective of reducing the keyboard size, they all differ in their mechanism. For example, some invention uses a compression mechanism, some invention uses a folding mechanism, and some invention uses a collapsing mechanism and so on. This article illustrates 10 inventions on collapsible keyboards from US patent database. Each case is analyzed from a TRIZ perspective.
Dynamic Resource Management using Operating System-Level Virtualization
Venue: arXiv cs.DC 2013
Year: 2013

This thesis expands upon an existing system called Golondrina that performs autonomic workload management among a cluster of hardware nodes running operating system-level virtualization. Golondrina works by identifying localized resource stress situations and attempting to dissipate them by reallocating system resources and, if necessary, migrating or replicating virtual machines. It is predicted that, using Golondrina, efficiency of similar systems can be further improved by achieving greater resource utilization on the hardware nodes while maintaining resource availability for each virtual machine. The following topics are discussed: virtualization technologies and associated challenges relating to resource management, the architecture and design of Golondrina, intelligent resource reallocation based on predefined policies, and preliminary results demonstrating the effects of a memory resource management policy on the performance of a web application hosted in a virtual environment. This research makes a significant contribution to the study of virtualized data centres since currently no other system considers virtual machine replication and dynamic memory reallocation as an approach to workload management.
Visualizing Bags of Vectors
Venue: arXiv cs.IR 2013
Year: 2013

The motivation of this work is two-fold - a) to compare between two different modes of visualizing data that exists in a bag of vectors format b) to propose a theoretical model that supports a new mode of visualizing data. Visualizing high dimensional data can be achieved using Minimum Volume Embedding, but the data has to exist in a format suitable for computing similarities while preserving local distances. This paper compares the visualization between two methods of representing data and also proposes a new method providing sample visualizations for that method.