OpenRaiser/Intern-Atlas huggingface dataset:
Shifting Role of Customer from Recipient To Partner of Care In Healthcare Organization
Venue: arXiv cs.CY 2013
Year: 2013

Most recent e-health initiatives perceive customers (patients) as recipients of medical care where they do not have a significant role in the process of health decision making. However, the advancement of Web 2.0 offers patients to have a greater role in the decision making process related to their health as they can be empowered with the ability to access and control information that fits with their personalized needs. However, providing patient empowerment in e-health through Web 2.0 is challenging task because the complexity nature of healthcare business processes. Empowerment closely relates to the concept of Customer Relationship Management (CRM) in managing good relationships with the customers. The adoption of Web 2.0 in CRM systems is known as Social CRM or CRM 2.0. Social CRM emerges to accommodate dynamic means of interaction between patients with their healthcare providers. The aim of this paper is to present a model that embeds empowerment of patient through Social CRM intervention that may extend the role of the patient as an individual health actor, a social health agent, and a medical care partner. A survey has been conducted to gain a feedback from customers regarding the proposed model. A prototype derived from the model namely Clinic 2.0 has also been developed. Using the prototype we measure its impact towards customer satisfaction and health literacy. The results show that the system intervention through Clinic 2.0 improves the level of satisfaction and health literacy of participants.
Minimum Latency Broadcast Scheduling in Single-Radio Multi-Channel Wireless Ad-Hoc Networks
Venue: arXiv cs.NI 2013
Year: 2013

We study the minimum latency broadcast scheduling (MLBS) problem in Single-Radio Multi-Channel (SR-MC) wireless ad-hoc networks (WANETs), which are modeled by Unit Disk Graphs. Nodes with this capability have their fixed reception channels, but can switch their transmission channels to communicate with their neighbors. The single-radio and multi-channel model prevents existing algorithms for single-channel networks achieving good performance. First, the common assumption that one transmission reaches all the neighboring nodes does not hold naturally. Second, the multi-channel dimension provides new opportunities to schedule the broadcast transmissions in parallel. We show MLBS problem in SR-MC WANETs is NP-hard, and present a benchmark algorithm: Basic Transmission Scheduling (BTS), which has approximation ratio of 4k + 12. Here k is the number of orthogonal channels in SR-MC WANETs. Then we propose an Enhanced Transmission Scheduling (ETS) algorithm, improving the approximation ratio to k + 23. Simulation results show that ETS achieves better performance over BTS, and the performance of ETS approaches the lower bound.
Legacy Forensics: An Emerging Challenge
Venue: arXiv cs.CR 2013
Year: 2013

With the passage of time and as new types of storage devices are introduced into the marketplace, contemporary devices will slowly lose their compatibility with current operating systems and PC hardware. As a result, such legacy devices will pose an analytical challenge to the field of digital forensics. Dated technology, while still fully functional, is becoming increasingly incompatible with most contemporary computing hardware and software and thus cannot be properly examined in present-day digital forensic environments. This fact will not be lost on those who utilize legacy hardware to commit criminal acts. This paper describes the technical challenge of accessing legacy devices by describing an effort to resuscitate a Bernoulli Drive, a portable storage device manufactured in 1983 by Iomega Corporation. A number of lessons-learned are provided and the implication of legacy devices to digital forensic science is discussed.
Marketplaces for Energy Demand-Side Management based on Future-Internet Technology
Venue: arXiv cs.OH 2013
Year: 2013

Renewable energies become more important, and they contribute to the EU's goals for greenhouse-gas reduction. However, their fluctuating nature calls for demand-side-management techniques, which balance energy generation and consumption. Such techniques are currently not broadly deployed. This paper describes the latest results from the FINSENY project on how Future-Internet enablers and market mechanisms can be used to realise such systems.
Personalized Academic Research Paper Recommendation System
Venue: arXiv cs.IR 2013
Year: 2013

A huge number of academic papers are coming out from a lot of conferences and journals these days. In these circumstances, most researchers rely on key-based search or browsing through proceedings of top conferences and journals to find their related work. To ease this difficulty, we propose a Personalized Academic Research Paper Recommendation System, which recommends related articles, for each researcher, that may be interesting to her/him. In this paper, we first introduce our web crawler to retrieve research papers from the web. Then, we define similarity between two research papers based on the text similarity between them. Finally, we propose our recommender system developed using collaborative filtering methods. Our evaluation results demonstrate that our system recommends good quality research papers.
OntoRich - A Support Tool for Semi-Automatic Ontology Enrichment and Evaluation
Venue: arXiv cs.AI 2013
Year: 2013

This paper presents the OntoRich framework, a support tool for semi-automatic ontology enrichment and evaluation. The WordNet is used to extract candidates for dynamic ontology enrichment from RSS streams. With the integration of OpenNLP the system gains access to syntactic analysis of the RSS news. The enriched ontologies are evaluated against several qualitative metrics.
Color image denoising by chromatic edges based vector valued diffusion
Venue: arXiv cs.CV 2013
Year: 2013

In this letter we propose to denoise digital color images via an improved geometric diffusion scheme. By introducing edges detected from all three color channels into the diffusion the proposed scheme avoids color smearing artifacts. Vector valued diffusion is used to control the smoothing and the geometry of color images are taken into consideration. Color edge strength function computed from different planes is introduced and it stops the diffusion spread across chromatic edges. Experimental results indicate that the scheme achieves good denoising with edge preservation when compared to other related schemes.
La machine α: modèle générique pour les algorithmes naturels
Venue: arXiv cs.CC 2013
Year: 2013

So far, following the works of A.M. Turing, the algorithms were considered as the mathematical abstraction from which we could write programs for computers whose principle was based on the theoretical concept of Turing machine. We start here from the observation that natural algorithms or rather algorithms of the nature which are massively parallel, autoadaptative and reproductible, and for which we do not know how they really work, nor why, are not easily specified by the current theoretical model of Universal Turing machine, or Universal Computer. In particular the aspects of communications, evolutionary rules (rulers), random (unpredictable) events, just like the genetic code, are taken into account only by subtleties which oblige to break the theory. We shall propose one \textit{universal model} of algorithm called machine-alpha which contains and generalizes the existing models. --- Jusqu'ici, suite aux travaux de A.M.Turing [Turing, 1936], les algorithmes ont été vus comme l'abstraction à partir de laquelle on pouvait écrire des programmes pour des ordinateurs dont le principe était lui-même issu du concept théorique de machine de Turing. Nous partons ici du constat que les algorithmes naturels ou plutôt les algorithmes de la nature, massivement parallèles, autoadaptatifs et auto reproductibles, dont on ne sait pas comment ils fonctionnent réellement, ni pourquoi, ne sont pas aisément spécifiés par le modèle théorique actuel de Machine de Turing Universelle, ou de Calculateur Universel ; en particulier les aspects de communications, de règles évolutives, d' événements aléatoires, à l'image du code génétique, ne sont pris en compte que par ajout d'artifices à la théorie. Nous nous proposons ici de montrer comment aborder ces problèmes en repensant le modèle théorique. Nous proposerons un modèle d'algorithme, appelé ici machine-αqui contient et généralise les modèles existants.
Tighter Upper Bounds for the Minimum Number of Calls and Rigorous Minimal Time in Fault-Tolerant Gossip Schemes
Venue: arXiv cs.IT 2013
Year: 2013

The gossip problem (telephone problem) is an information dissemination problem in which each of $n$ nodes of a communication network has a unique piece of information that must be transmitted to all the other nodes using two-way communications (telephone calls) between the pairs of nodes. During a call between the given two nodes, they exchange the whole information known to them at that moment. In this paper we investigate the $k$-fault-tolerant gossip problem, which is a generalization of the gossip problem, where at most $k$ arbitrary faults of calls are allowed. The problem is to find the minimal number of calls $τ(n,k)$ needed to guarantee the $k$-fault-tolerance. We construct two classes of $k$-fault-tolerant gossip schemes (sequences of calls) and found two upper bounds of $τ(n,k)$, which improve the previously known results. The first upper bound for general even $n$ is $τ(n,k) \leq 1/2 n \lceil\log_2 n\rceil + 1/2 n k$. This result is used to obtain the upper bound for general odd $n$. From the expressions for the second upper bound it follows that $τ(n,k) \leq 2/3 n k + O(n)$ for large $n$. Assuming that the calls can take place simultaneously, it is also of interest to find $k$-fault-tolerant gossip schemes, which can spread the full information in minimal time. For even $n$ we showed that the minimal time is $T(n,k)=\lceil\log_2 n\rceil + k$.
Frequency-Domain Group-based Shrinkage Estimators for UWB Systems
Venue: arXiv cs.IT 2013
Year: 2013

In this work, we propose low-complexity adaptive biased estimation algorithms, called group-based shrinkage estimators (GSEs), for parameter estimation and interference suppression scenarios with mechanisms to automatically adjust the shrinkage factors. The proposed estimation algorithms divide the target parameter vector into a number of groups and adaptively calculate one shrinkage factor for each group. GSE schemes improve the performance of the conventional least squares (LS) estimator in terms of the mean-squared error (MSE), while requiring a very modest increase in complexity. An MSE analysis is presented which indicates the lower bounds of the GSE schemes with different group sizes. We prove that our proposed schemes outperform the biased estimation with only one shrinkage factor and the best performance of GSE can be obtained with the maximum number of groups. Then, we consider an application of the proposed algorithms to single-carrier frequency-domain equalization (SC-FDE) of direct-sequence ultra-wideband (DS-UWB) systems, in which the structured channel estimation (SCE) algorithm and the frequency domain receiver employ the GSE. The simulation results show that the proposed algorithms significantly outperform the conventional unbiased estimator in the analyzed scenarios.
Sliding Bloom Filters
Venue: arXiv cs.DS 2013
Year: 2013

A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a \emph{Sliding Bloom Filter}: a data structure that, given a stream of elements, supports membership queries of the set of the last $n$ elements (a sliding window), while allowing a small error probability. We formally define the data structure and its relevant parameters and analyze the time and memory requirements needed to achieve them. We give a low space construction that runs in O(1) time per update with high probability (that is, for all sequences with high probability all operations take constant time) and provide an almost matching lower bound on the space that shows that our construction has the best possible space consumption up to an additive lower order term.
Numerical solving the identification problem for the lower coefficient of parabolic equation
Venue: arXiv cs.NA 2013
Year: 2013

In the theory and practice of inverse problems for partial differential equations (PDEs) much attention is paid to the problem of the identification of coefficients from some additional information. This work deals with the problem of determining in a multidimensional parabolic equation the lower coefficient that depends on time only. To solve numerically a nonlinear inverse problem, linearized approximations in time are constructed using standard finite element procedures in space. The computational algorithm is based on a special decomposition, where the transition to a new time level is implemented via solving two standard elliptic problems. The numerical results presented here for a model 2D problem demonstrate capabilities of the proposed computational algorithms for approximate solving inverse problems.
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
Venue: arXiv cs.IT 2013
Year: 2013

In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-Rényi maximal correlation of a pair of random $(X,Y)$, as well as of the chordal slope of the nontrivial boundary of the hypercontractivity ribbon of $(X,Y)$ at infinity. The new characterizations lead to simple proofs for some of the known facts about these quantities. We also provide a counterexample to a data processing inequality claimed by Erkip and Cover, and find the correct tight constant for this kind of inequality.
A Bag of Visual Words Approach for Symbols-Based Coarse-Grained Ancient Coin Classification
Venue: arXiv cs.CV 2013
Year: 2013

The field of Numismatics provides the names and descriptions of the symbols minted on the ancient coins. Classification of the ancient coins aims at assigning a given coin to its issuer. Various issuers used various symbols for their coins. We propose to use these symbols for a framework that will coarsely classify the ancient coins. Bag of visual words (BoVWs) is a well established visual recognition technique applied to various problems in computer vision like object and scene recognition. Improvements have been made by incorporating the spatial information to this technique. We apply the BoVWs technique to our problem and use three symbols for coarse-grained classification. We use rectangular tiling, log-polar tiling and circular tiling to incorporate spatial information to BoVWs. Experimental results show that the circular tiling proves superior to the rest of the methods for our problem.
L2/L2-foreach sparse recovery with low risk
Venue: arXiv cs.DS 2013
Year: 2013

In this paper, we consider the "foreach" sparse recovery problem with failure probability $p$. The goal of which is to design a distribution over $m \times N$ matrices $Φ$ and a decoding algorithm $\algo$ such that for every $\vx\in\R^N$, we have the following error guarantee with probability at least $1-p$ \[\|\vx-\algo(Φ\vx)\|_2\le C\|\vx-\vx_k\|_2,\] where $C$ is a constant (ideally arbitrarily close to 1) and $\vx_k$ is the best $k$-sparse approximation of $\vx$. Much of the sparse recovery or compressive sensing literature has focused on the case of either $p = 0$ or $p = Ω(1)$. We initiate the study of this problem for the entire range of failure probability. Our two main results are as follows: \begin{enumerate} \item We prove a lower bound on $m$, the number measurements, of $Ω(k\log(n/k)+\log(1/p))$ for $2^{-Θ(N)}\le p <1$. Cohen, Dahmen, and DeVore \cite{CDD2007:NearOptimall2l2} prove that this bound is tight. \item We prove nearly matching upper bounds for \textit{sub-linear} time decoding. Previous such results addressed only $p = Ω(1)$. \end{enumerate} Our results and techniques lead to the following corollaries: (i) the first ever sub-linear time decoding $\lolo$ "forall" sparse recovery system that requires a $\log^γ{N}$ extra factor (for some $γ<1$) over the optimal $O(k\log(N/k))$ number of measurements, and (ii) extensions of Gilbert et al. \cite{GHRSW12:SimpleSignals} results for information-theoretically bounded adversaries.
Epistemic Learning Programs A Calculus for Describing Epistemic Action Models
Venue: arXiv cs.LO 2013
Year: 2013

Dynamic Epistemic Logic makes it possible to model and reason about information change in multi-agent systems. Information change is mathematically modeled through epistemic action Kripke models introduced by Baltag et al. Also, van Ditmarsch interprets the information change as a relation between epistemic states and sets of epistemic states and to describe it formally, he considers a special constructor LB called learning operator. Inspired by this, it seems natural to us that the basic source of information change in a multi-agent system should be learning an announcement by some agents together, privately, concurrently or even wrongly. Hence moving along this path, we introduce the notion of a learning program and prove that all finite K45 action models can be described by our learning programs
On Quasiperiodic Morphisms
Venue: arXiv cs.DM 2013
Year: 2013

Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite words, we get four families of morphisms between which we study relations. We provide algorithms to decide whether a morphism is strongly quasiperiodic on finite words or on infinite words.
Hilbert curves in 2 dimensions generated by L-systems
Venue: arXiv cs.CG 2013
Year: 2013

Generating Hilbert curves in Z^2 using L-systems appears to be efficient and easy
Assessment of Path Reservation in Distributed Real-Time Vehicle Guidance
Venue: arXiv cs.MA 2013
Year: 2013

In this paper we assess the impact of path reservation as an additional feature in our distributed real-time vehicle guidance protocol BeeJamA. Through our microscopic simulations we show that na\"ıve reservation of links without any further measurements is only an improvement in case of complete market penetration, otherwise it even reduces the performance of our approach based on real-time link loads. Moreover, we modified the reservation process to incorporate current travel times and show that this improves the results in our simulations when at least 40% market penetration is possible.
Are elite journals declining?
Venue: arXiv cs.DL 2013
Year: 2013

Previous work indicates that over the past 20 years, the highest quality work have been published in an increasingly diverse and larger group of journals. In this paper we examine whether this diversification has also affected the handful of elite journals that are traditionally considered to be the best. We examine citation patterns over the past 40 years of 7 long-standing traditionally elite journals and 6 journals that have been increasing in importance over the past 20 years. To be among the top 5% or 1% cited papers, papers now need about twice as many citations as they did 40 years ago. Since the late 1980s and early 1990s elite journals have been publishing a decreasing proportion of these top cited papers. This also applies to the two journals that are typically considered as the top venues and often used as bibliometric indicators of "excellence", Science and Nature. On the other hand, several new and established journals are publishing an increasing proportion of most cited papers. These changes bring new challenges and opportunities for all parties. Journals can enact policies to increase or maintain their relative position in the journal hierarchy. Researchers now have the option to publish in more diverse venues knowing that their work can still reach the same audiences. Finally, evaluators and administrators need to know that although there will always be a certain prestige associated with publishing in "elite" journals, journal hierarchies are in constant flux so inclusion of journals into this group is not permanent.
Technical report: Linking the scientific and clinical data with KI2NA-LHC
Venue: arXiv cs.CY 2013
Year: 2013

We introduce a use case and propose a system for data and knowledge integration in life sciences. In particular, we focus on linking clinical resources (electronic patient records) with scientific documents and data (research articles, biomedical ontologies and databases). Our motivation is two-fold. Firstly, we aim to instantly provide scientific context of particular patient cases for clinicians in order for them to propose treatments in a more informed way. Secondly, we want to build a technical infrastructure for researchers that will allow them to semi-automatically formulate and evaluate their hypothesis against longitudinal patient data. This paper describes the proposed system and its typical usage in a broader context of KI2NA, an ongoing collaboration between the DERI research institute and Fujitsu Laboratories. We introduce an architecture of the proposed framework called KI2NA-LHC (for Linked Health Care) and outline the details of its implementation. We also describe typical usage scenarios and propose a methodology for evaluation of the whole framework. The main goal of this paper is to introduce our ongoing work to a broader expert audience. By doing so, we aim to establish an early-adopter community for our work and elicit feedback we could reflect in the development of the prototype so that it is better tailored to the requirements of target users.
The K-modes algorithm for clustering
Venue: arXiv cs.LG 2013
Year: 2013

Many clustering algorithms exist that estimate a cluster centroid, such as K-means, K-medoids or mean-shift, but no algorithm seems to exist that clusters data by returning exactly K meaningful modes. We propose a natural definition of a K-modes objective function by combining the notions of density and cluster assignment. The algorithm becomes K-means and K-medoids in the limit of very large and very small scales. Computationally, it is slightly slower than K-means but much faster than mean-shift or K-medoids. Unlike K-means, it is able to find centroids that are valid patterns, truly representative of a cluster, even with nonconvex clusters, and appears robust to outliers and misspecification of the scale and number of clusters.
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
Venue: arXiv cs.DS 2013
Year: 2013

We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k-1 to k with at most p new edges is fixed-parameter tractable parameterized by p and admits a polynomial kernel. We also prove the fixed-parameter tractability of increasing edge-connectivity from 0 to 2, and increasing node-connectivity from 1 to 2.
Distance-Sensitive Property Testing Lower Bounds
Venue: arXiv cs.CC 2013
Year: 2013

In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter $\eps$. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone and testing whether the function has low Fourier degree. For monotonicity testing, our lower bound matches the recent upper bound of Chakrabarty and Seshadhri.