OpenRaiser/Intern-Atlas huggingface dataset:
Recognition and Ranking Critical Success Factors of Business Intelligence in Hospitals -- Case Study: Hasheminejad Hospital
Venue: arXiv cs.OH 2014
Year: 2014

Business Intelligence, not as a tool of a product but as a new approach is propounded in organizations to make tough decisions in business as shortly as possible. Hospital managers often need business intelligence in their fiscal, operational, and clinical reports and indices. The main goal of recognition and ranking CSF is implementation of a business intelligent system in hospitals to increase success factor of application of business intelligence in health and treatment sector. This paper is an application and descriptive-analytical one, in which we use questionnaires to gather data and we used SPSS and LISREL to analyze them. Its statistical society is managers and personnel of Hasheminejad hospital and case studies are selected by Cochran formula. The findings show that all three organizational, process, and technological factors equally affect implementation of business intelligence based on Yeoh & Koronis approach, where the assumptions are based upon it. The proposed model for CSFs of business intelligence in hospitals include: declaring perspective, goals and strategies, development of human and financial resources, clarification of organizational culture, documentation and process mature, management support, etc. Business intelligence implementation is affected by different components. Center of Hasheminejad hospital BI system as a leader in providing quality health care, partially succeeded to take advantage of the benefits the organization in passing the information revolution but the development of this system to achieve intelligent hospital and its certainty is a high priority, thus it can`t be said that the hospital-wide BI system is quite favorable. In this regard, it can be concluded that Hasheminejad hospital requires practical model for business intelligence systems development.
Training-Based SWIPT: Optimal Power Splitting at the Receiver
Venue: arXiv cs.IT 2014
Year: 2014

We consider a point-to-point system with simultaneous wireless information and power transfer (SWIPT) over a block fading channel. Each transmission block consists of a training phase and a data transmission phase. Pilot symbols are transmitted during the training phase for channel estimation at the receiver. To enable SWIPT, the receiver adopts a power-splitting design, such that a portion of the received signal is used for channel estimation or data detection, while the remaining is used for energy harvesting. We optimally design the power-splitting ratios for both training and data phases to achieve the best ergodic capacity performance while maintaining a required energy harvesting rate. Our result shows how a power-splitting receiver can make the best use of the received pilot and data signals to obtain the optimal SWIPT performance.
A Semiblind Two-Way Training Method for Discriminatory Channel Estimation in MIMO Systems
Venue: arXiv cs.IT 2014
Year: 2014

Discriminatory channel estimation (DCE) is a recently developed strategy to enlarge the performance difference between a legitimate receiver (LR) and an unauthorized receiver (UR) in a multiple-input multiple-output (MIMO) wireless system. Specifically, it makes use of properly designed training signals to degrade channel estimation at the UR which in turn limits the UR's eavesdropping capability during data transmission. In this paper, we propose a new two-way training scheme for DCE through exploiting a whitening-rotation (WR) based semiblind method. To characterize the performance of DCE, a closed-form expression of the normalized mean squared error (NMSE) of the channel estimation is derived for both the LR and the UR. Furthermore, the developed analytical results on NMSE are utilized to perform optimal power allocation between the training signal and artificial noise (AN). The advantages of our proposed DCE scheme are two folds: 1) compared to the existing DCE scheme based on the linear minimum mean square error (LMMSE) channel estimator, the proposed scheme adopts a semiblind approach and achieves better DCE performance; 2) the proposed scheme is robust against active eavesdropping with the pilot contamination attack, whereas the existing scheme fails under such an attack.
Containment control of multi-agent systems with measurement noises
Venue: arXiv cs.SY 2014
Year: 2014

In this paper, containment control of multi-agent systems with measurement noises is studied under directed networks. When the leaders are stationary, a stochastic approximation type protocol is employed to solve the containment control of multi-agent systems. By using stochastic analysis tools and algebraic graph theory, some necessary and sufficient criteria are established to ensure the followers converge to the convex hull spanned by the leaders in the sense of mean square and probability 1. When the leasers are dynamic, a stochastic approximation type protocol with distributed estimators is developed and necessary and sufficient conditions are also obtained for solving the containment control problem. Simulations are provided to illustrate the effectiveness of the theoretical results.
Cloud elasticity using probabilistic model checking
Venue: arXiv cs.DC 2014
Year: 2014

Cloud computing has become the leading paradigm for deploying large-scale infrastructures and running big data applications, due to its capacity of achieving economies of scale. In this work, we focus on one of the most prominent advantages of cloud computing, namely the on-demand resource provisioning, which is commonly referred to as elasticity. Although a lot of effort has been invested in developing systems and mechanisms that enable elasticity, the elasticity decision policies tend to be designed without guaranteeing or quantifying the quality of their operation. This work aims to make the development of elasticity policies more formalized and dependable. We make two distinct contributions. First, we propose an extensible approach to enforcing elasticity through the dynamic instantiation and online quantitative verification of Markov Decision Processes (MDP) using probabilistic model checking. Second, we propose concrete elasticity models and related elasticity policies. We evaluate our decision policies using both real and synthetic datasets in clusters of NoSQL databases. According to the experimental results, our approach improves upon the state-of-the-art in significantly increasing user-defined utility values and decreasing user-defined threshold violations.
YouTube QoE Evaluation Tool for Android Wireless Terminals
Venue: arXiv cs.MM 2014
Year: 2014

In this paper, we present an Android application which is able to evaluate and analyze the perceived Quality of Experience (QoE) for YouTube service in wireless terminals. To achieve this goal, the application carries out measurements of objective Quality of Service (QoS) parameters, which are then mapped onto subjective QoE (in terms of Mean Opinion Score, MOS) by means of a utility function. Our application also informs the user about potential causes that lead to a low MOS as well as provides some hints to improve it. After each YouTube session, the users may optionally qualify the session through an online opinion survey. This information has been used in a pilot experience to correlate the theoretical QoE model with real user feedback. Results from such an experience have shown that the theoretical model (taken from the literature) provides slightly more pessimistic results compared to user feedback. Users seem to be more indulgent with wireless connections, increasing the MOS from the opinion survey in about 20% compared to the theoretical model, which was obtained from wired scenarios.
Improved algorithm for computing separating linear forms for bivariate systems
Venue: arXiv cs.CG 2014
Year: 2014

We address the problem of computing a linear separating form of a system of two bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at the distinct solutions of the system. The computation of such linear forms is at the core of most algorithms that solve algebraic systems by computing rational parameterizations of the solutions and this is the bottleneck of these algorithms in terms of worst-case bit complexity. We present for this problem a new algorithm of worst-case bit complexity $\sOB(d^7+d^6τ)$ where $d$ and $τ$ denote respectively the maximum degree and bitsize of the input (and where $\sO$ refers to the complexity where polylogarithmic factors are omitted and $O_B$ refers to the bit complexity). This algorithm simplifies and decreases by a factor $d$ the worst-case bit complexity presented for this problem by Bouzidi et al. \cite{bouzidiJSC2014a}. This algorithm also yields, for this problem, a probabilistic Las-Vegas algorithm of expected bit complexity $\sOB(d^5+d^4τ)$.
Una metodología para realizar Diferenciación Automática Anidada
Venue: arXiv cs.SC 2014
Year: 2014

En este trabajo se presenta una propuesta para realizar Diferenciación Automática Anidada utilizando cualquier biblioteca de Diferenciación Automática que permita sobrecarga de operadores. Para calcular las derivadas anidadas en una misma evaluación de la función, la cual se asume que sea analítica, se trabaja con el modo forward utilizando una nueva estructura llamada SuperAdouble, que garantiza que se aplique correctamente la Diferenciación Automática y se calculen el valor y la derivada que se requiera. This paper proposes a framework to apply Nested Automatic Differentiation using any library of Automatic Differentiation which allows operator overloading. To compute nested derivatives of a function while it is being evaluated, which is assumed to be analytic, a new structure called SuperAdouble is used in the forward mode. This new class guarantees the correct application of Automatic Differentiation to calculate the value and derivative of a function where is required.
Use of Computer Vision to Detect Tangles in Tangled Objects
Venue: arXiv cs.CV 2014
Year: 2014

Untangling of structures like ropes and wires by autonomous robots can be useful in areas such as personal robotics, industries and electrical wiring & repairing by robots. This problem can be tackled by using computer vision system in robot. This paper proposes a computer vision based method for analyzing visual data acquired from camera for perceiving the overlap of wires, ropes, hoses i.e. detecting tangles. Information obtained after processing image according to the proposed method comprises of position of tangles in tangled object and which wire passes over which wire. This information can then be used to guide robot to untangle wire/s. Given an image, preprocessing is done to remove noise. Then edges of wire are detected. After that, the image is divided into smaller blocks and each block is checked for wire overlap/s and finding other relevant information. TANGLED-100 dataset was introduced, which consists of images of tangled linear deformable objects. Method discussed in here was tested on the TANGLED-100 dataset. Accuracy achieved during experiments was found to be 74.9%. Robotic simulations were carried out to demonstrate the use of the proposed method in applications of robot. Proposed method is a general method that can be used by robots working in different situations.
A Reduced Latency List Decoding Algorithm for Polar Codes
Venue: arXiv cs.IT 2014
Year: 2014

Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding performance of the SC decoding algorithm is inferior. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC decoding algorithm for short or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm still suffer from long decoding latency. In this paper, a reduced latency list decoding (RLLD) algorithm for polar codes is proposed. For the proposed RLLD algorithm, all rate-0 nodes and part of rate-1 nodes are decoded instantly without traversing the corresponding subtree. A list maximum-likelihood decoding (LMLD) algorithm is proposed to decode the maximum likelihood (ML) nodes and the remaining rate-1 nodes. Moreover, a simplified LMLD (SLMLD) algorithm is also proposed to reduce the computational complexity of the LMLD algorithm. Suppose a partial parallel list decoder architecture with list size $L=4$ is used, for an (8192, 4096) polar code, the proposed RLLD algorithm can reduce the number of decoding clock cycles and decoding latency by 6.97 and 6.77 times, respectively.
Securing SMS Based One Time Password Technique from Man in the Middle Attack
Venue: arXiv cs.CR 2014
Year: 2014

Security of financial transaction in e-commerce is difficult to implement and there is a risk that users confidential data over the internet may be accessed by hackers. Unfortunately, interacting with an online service such as a banking web application often requires certain degree of technical sophistication that not all Internet users possess. For the last couple of years such naive users have been increasingly targeted by phishing attacks that are launched by miscreants who are aiming to make an easy profit by means of illegal financial transactions. In this paper, we have proposed an idea for securing e-commerce transaction from phishing attack. An approach already exists where phishing attack is prevented using one time password which is sent on users registered mobile via SMS for authentication.But this method can be counter attacked by man in the middle.In our paper, a new idea is proposed which is more secure compared to the existing online payment system using OTP. In this mechanism, OTP is combined with the secure key and is then passed through RSA algorithm to generate the Transaction password. A copy of this password is maintained at the server side and is being generated at the user side using a mobile application.So that it is not transferred over the insecure network leading to a fraudulent transaction.
A Revised Incremental Conductance MPPT Algorithm for Solar PV Generation Systems
Venue: arXiv cs.CE 2014
Year: 2014

A revised Incremental Conductance (IncCond) maximum power point tracking (MPPT) algorithm for PV generation systems is proposed in this paper. The commonly adopted traditional IncCond method uses a constant step size for voltage adjustment and is difficult to achieve both a good tracking performance and quick elimination of the oscillations, especially under the dramatic changes of the environment conditions. For the revised algorithm, the incremental voltage change step size is adaptively adjusted based on the slope of the power-voltage (P-V) curve. An accelerating factor and a decelerating factor are further applied to adjust the voltage step change considering whether the sign of the P-V curve slope remains the same or not in a subsequent tracking step. In addition, the upper bound of the maximum voltage step change is also updated considering the information of sign changes. The revised MPPT algorithm can quickly track the maximum power points (MPPs) and remove the oscillation of the actual operation points around the real MPPs. The effectiveness of the revised algorithm is demonstrated using a simulation.
Alternative Algorithms for Lyndon Factorization
Venue: arXiv cs.DS 2014
Year: 2014

We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet. Experimental results show that it is faster than Duval's original algorithm, more than ten times in the case of long DNA strings. The second algorithm computes, given a run-length encoded string $R$ of length $ρ$, the Lyndon factorization of $R$ in $O(ρ)$ time and constant space.
Reverse Engineering Socialbot Infiltration Strategies in Twitter
Venue: arXiv cs.SI 2014
Year: 2014

Data extracted from social networks like Twitter are increasingly being used to build applications and services that mine and summarize public reactions to events, such as traffic monitoring platforms, identification of epidemic outbreaks, and public perception about people and brands. However, such services are vulnerable to attacks from socialbots $-$ automated accounts that mimic real users $-$ seeking to tamper statistics by posting messages generated automatically and interacting with legitimate users. Potentially, if created in large scale, socialbots could be used to bias or even invalidate many existing services, by infiltrating the social networks and acquiring trust of other users with time. This study aims at understanding infiltration strategies of socialbots in the Twitter microblogging platform. To this end, we create 120 socialbot accounts with different characteristics and strategies (e.g., gender specified in the profile, how active they are, the method used to generate their tweets, and the group of users they interact with), and investigate the extent to which these bots are able to infiltrate the Twitter social network. Our results show that even socialbots employing simple automated mechanisms are able to successfully infiltrate the network. Additionally, using a $2^k$ factorial design, we quantify infiltration effectiveness of different bot strategies. Our analysis unveils findings that are key for the design of detection and counter measurements approaches.
Secure Friend Discovery via Privacy-Preserving and Decentralized Community Detection
Venue: arXiv cs.CR 2014
Year: 2014

The problem of secure friend discovery on a social network has long been proposed and studied. The requirement is that a pair of nodes can make befriending decisions with minimum information exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery. We formulate the first privacy-preserving and decentralized community detection problem as a multi-objective optimization. We design the first protocol to solve this problem, which transforms community detection to a series of Private Set Intersection (PSI) instances using Truncated Random Walk (TRW). Preliminary theoretical results show that our protocol can uncover communities with overwhelming probability and preserve privacy. We also discuss future works, potential extensions and variations.
Indian Premier League (IPL), Cricket, Online Social Media
Venue: arXiv cs.SI 2014
Year: 2014

In recent past online social media has played a pivotal role in sharing of information and opinions on real time events. Events in physical space are reflected in digital world through online social networks. Event based studies for such content have been widely done on Twitter in the computer science community. In this report, we performed a detailed analysis of a sports event called the Indian Premier League (IPL'13) for both Facebook and Twitter. IPL is the most popular cricket league in India with players from across the world. We analysed more than 2.6 million tweets and 700 thousand Facebook posts for temporal activity, text quality, geography of users and the spot-fixing scandal which came up during the league. We were able to draw strong correlations between the brand value of teams and how much they were talked about on social media across Facebook and Twitter. Analysis of geo-tagged data showed major activity from metropolitan suburbs however activity was not restricted to the regions geographically associated with each team. We present a decay calculation methodology, using which we derive that activity died down on both Twitter and Facebook in a very similar manner. Such analysis can be used to model events and study their penetration in social networks. We analysed text for spot-fixing and found that user response to allegations about matches being fixed was cold. The complete analysis presented in this report, can be particularly useful for studying events involving crisis or events of political importance having similar structure.
A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)
Venue: arXiv cs.NE 2014
Year: 2014

The Quadratic Assignment Problem (QAP) is one of the models used for the multi-row layout problem with facilities of equal area. There are a set of n facilities and a set of n locations. For each pair of locations, a distance is specified and for each pair of facilities a weight or flow is specified (e.g., the amount of supplies transported between the two facilities). The problem is to assign all facilities to different locations with the aim of minimizing the sum of the distances multiplied by the corresponding flows. The QAP is among the most difficult NP-hard combinatorial optimization problems. Because of this, this paper presents an efficient Genetic algorithm (GA) to solve this problem in reasonable time. For validation the proposed GA some examples are selected from QAP library. The obtained results in reasonable time show the efficiency of proposed GA.
Finding All Solutions of Equations in Free Groups and Monoids with Involution
Venue: arXiv cs.LO 2014
Year: 2014

The aim of this paper is to present a PSPACE algorithm which yields a finite graph of exponential size and which describes the set of all solutions of equations in free groups as well as the set of all solutions of equations in free monoids with involution in the presence of rational constraints. This became possible due to the recently invented emph{recompression} technique of the second author. He successfully applied the recompression technique for pure word equations without involution or rational constraints. In particular, his method could not be used as a black box for free groups (even without rational constraints). Actually, the presence of an involution (inverse elements) and rational constraints complicates the situation and some additional analysis is necessary. Still, the recompression technique is general enough to accommodate both extensions. In the end, it simplifies proofs that solving word equations is in PSPACE (Plandowski 1999) and the corresponding result for equations in free groups with rational constraints (Diekert, Hagenah and Gutierrez 2001). As a byproduct we obtain a direct proof that it is decidable in PSPACE whether or not the solution set is finite.
An Ordinal Bargaining Solution with Fixed-Point Property
Venue: arXiv cs.GT 2014
Year: 2014

Shapleys impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Although the result is no longer true for bargaining problems with more than two agents, none of the well known bargaining solutions are ordinal. Searching for meaningful ordinal solutions, especially for the bilateral bargaining problem, has been a challenging issue in bargaining theory for more than three decades. This paper proposes a logic-based ordinal solution to the bilateral bargaining problem. We argue that if a bargaining problem is modeled in terms of the logical relation of players physical negotiation items, a meaningful bargaining solution can be constructed based on the ordinal structure of bargainers preferences. We represent bargainers demands in propositional logic and bargainers preferences over their demands in total preorder. We show that the solution satisfies most desirable logical properties, such as individual rationality (logical version), consistency, collective rationality as well as a few typical game-theoretic properties, such as weak Pareto optimality and contraction invariance. In addition, if all players demand sets are logically closed, the solution satisfies a fixed-point condition, which says that the outcome of a negotiation is the result of mutual belief revision. Finally, we define various decision problems in relation to our bargaining model and study their computational complexity.