OpenRaiser/Intern-Atlas huggingface dataset:
Automatic Mammogram image Breast Region Extraction and Removal of Pectoral Muscle
Venue: arXiv cs.CV 2013
Year: 2013

Currently Mammography is a most effective imaging modality used by radiologists for the screening of breast cancer. Finding an accurate, robust and efficient breast region segmentation technique still remains a challenging problem in digital mammography. Extraction of the breast profile region and the removal of pectoral muscle are essential pre-processing steps in Computer Aided Diagnosis (CAD) system for the diagnosis of breast cancer. Primarily it allows the search for abnormalities to be limited to the region of the breast tissue without undue influence from the background of the mammogram. The presence of pectoral muscle in mammograms biases detection procedures, which recommends removing the pectoral muscle during mammogram image pre-processing. The presence of pectoral muscle in mammograms may disturb or influence the detection of breast cancer as the pectoral muscle and mammographic parenchymas appear similar. The goal of breast region extraction is reducing the image size without losing anatomic information, it improve the accuracy of the overall CAD system. The main objective of this study is to propose an automated method to identify the pectoral muscle in Medio-Lateral Oblique (MLO) view mammograms. In this paper, we proposed histogram based 8-neighborhood connected component labelling method for breast region extraction and removal of pectoral muscle. The proposed method is evaluated by using the mean values of accuracy and error. The comparative analysis shows that the proposed method identifies the breast region more accurately.
The normalization of citation counts based on classification systems
Venue: arXiv cs.DL 2013
Year: 2013

If we want to assess whether the paper in question has had a particularly high or low citation impact compared to other papers, the standard practice in bibliometrics is to normalize citations in respect of the subject category and publication year. A number of proposals for an improved procedure in the normalization of citation impact have been put forward in recent years. Against the background of these proposals this study describes an ideal solution for the normalization of citation impact: in a first step, the reference set for the publication in question is collated by means of a classification scheme, where every publication is associated with a single principal research field or subfield entry (e. g. via Chemical Abstracts sections) and a publication year. In a second step, percentiles of citation counts are calculated for this set and used to assign the normalized citation impact score to the publications (and also to the publication in question).
Survey on Positioning System: Sampling methods
Venue: arXiv cs.IT 2013
Year: 2013

Millimeter-accuracy Ultra-Wideband (UWB) positioning systems using the Time Difference Of Arrival (TDOA) algorithm are able to be utilized in military and many other important applications. Previous research on UWB positioning system has achieved up to mm or sub-mm accuracy. However, one bottleneck in UWB system is at sampling high resolution UWB signals, as well as high resolution timing information. In this paper, UWB positioning systems are surveyed and we focus on sampling methods for handling UWB signals. Among different sampling methods, one traditional way is the sequential sampling method, which is not a real time sampling method and blocks UWB positioning system to achieve higher precision. Another way is by applying Compressed Sensing (CS) to UWB system for achieving sub-mm positioning accuracy. In this paper, we compare different TDOA-based UWB systems with different sampling methods. In particular, several CS-UWB algorithms for UWB signal reconstruction are compared in terms of positioning accuracy. Simulation results in 2D and 3D experiments demonstrate performance of different algorithms including typical BCS, OMP and BP algorithms. CS-UWB is also compared with UWB positioning system based on the sequential sampling method.
Policy as Types
Venue: arXiv cs.CR 2013
Year: 2013

Drossopoulou and Noble argue persuasively for the need for a means to express policy in object-capability-based systems. We investigate a practical means to realize their aim via the Curry-Howard isomorphism. Specifically, we investigate representing policy as types in a behavioral type system for the RHO-calculus, a reflective higher-order variant of the pi-calculus.
A Hybrid Cryptosystem Based On Vigenere Cipher and Columnar Transposition Cipher
Venue: arXiv cs.CR 2013
Year: 2013

Privacy is one of the key issues addressed by information Security. Through cryptographic encryption methods, one can prevent a third party from understanding transmitted raw data over unsecured channel during signal transmission. The cryptographic methods for enhancing the security of digital contents have gained high significance in the current era. Breach of security and misuse of confidential information that has been intercepted by unauthorized parties are key problems that information security tries to solve. This paper sets out to contribute to the general body of knowledge in the area of classical cryptography by develop- ing a new hybrid way of encryption of plaintext. The cryptosystem performs its encryption by encrypting the plaintext using columnar transposition cipher and further using the ciphertext to encrypt the plaintext again using Vigenère ci- pher. At the end, cryptanalysis was performed on the ciphertext. The implementation will be done using java program- ming.
Using SOA with Web Services for effective Integration of Hospital Information Systems via an Enterprise Service Bus
Venue: arXiv cs.SE 2013
Year: 2013

Hospitals are distributed across geographical areas and it is important for all hospitals to share information as well as integrate their systems for effective researching and health delivery. Health personals and institutions in need of information from hospitals with respect to geographical areas can easily do researches on patients, treatments, disease outbreaks, and effects of drugs. This research work is aimed at integrating of database systems of hospital across geographical areas via a service bus. A centralized service bus was used to facilitate interoperability of applications across platforms and enhance communication within the hospital infrastructure as well as creating enabling environment for new layer of abstractions to be added without modification of the entire system. Concept of Service Oriented Architecture with web services was used for rapid integration solution in solving the challenges faced during integration of multiple incompatible applications.
Efficient Energy Minimization for Enforcing Statistics
Venue: arXiv cs.CV 2013
Year: 2013

Energy minimization algorithms, such as graph cuts, enable the computation of the MAP solution under certain probabilistic models such as Markov random fields. However, for many computer vision problems, the MAP solution under the model is not the ground truth solution. In many problem scenarios, the system has access to certain statistics of the ground truth. For instance, in image segmentation, the area and boundary length of the object may be known. In these cases, we want to estimate the most probable solution that is consistent with such statistics, i.e., satisfies certain equality or inequality constraints. The above constrained energy minimization problem is NP-hard in general, and is usually solved using Linear Programming formulations, which relax the integrality constraints. This paper proposes a novel method that finds the discrete optimal solution of such problems by maximizing the corresponding Lagrangian dual. This method can be applied to any constrained energy minimization problem whose unconstrained version is polynomial time solvable, and can handle multiple, equality or inequality, and linear or non-linear constraints. We demonstrate the efficacy of our method on the foreground/background image segmentation problem, and show that it produces impressive segmentation results with less error, and runs more than 20 times faster than the state-of-the-art LP relaxation based approaches.
An Integrated System for 3D Gaze Recovery and Semantic Analysis of Human Attention
Venue: arXiv cs.CV 2013
Year: 2013

This work describes a computer vision system that enables pervasive mapping and monitoring of human attention. The key contribution is that our methodology enables full 3D recovery of the gaze pointer, human view frustum and associated human centered measurements directly into an automatically computed 3D model in real-time. We apply RGB-D SLAM and descriptor matching methodologies for the 3D modeling, localization and fully automated annotation of ROIs (regions of interest) within the acquired 3D model. This innovative methodology will open new avenues for attention studies in real world environments, bringing new potential into automated processing for human factors technologies.
The chromatic class and the chromatic number of the planar conjugated triangulation
Venue: arXiv cs.DM 2013
Year: 2013

This material is dedicated to the estimation of the chromatic number and chromatic class of the conjugated triangulation (first conversion) and also of the second conversion of the planar triangulation. Also this paper introduces some new hypotheses, which are equivalent to Four Color Problem.
Fast Algorithms for Refined Parameterized Telescoping in Difference Fields
Venue: arXiv cs.SC 2013
Year: 2013

Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $ΠΣ$-fields, a general class of difference fields, that enables one to consider this problem for indefinite nested sums and products covering as special cases, e.g., the ($q$--)hypergeometric case and their mixed versions. This survey article presents the available algorithms in the framework of $ΠΣ$-extensions and elaborates new results concerning efficiency.
Energy Distribution of EEG Signals: EEG Signal Wavelet-Neural Network Classifier
Venue: arXiv cs.NE 2013
Year: 2013

In this paper, a wavelet-based neural network (WNN) classifier for recognizing EEG signals is implemented and tested under three sets EEG signals (healthy subjects, patients with epilepsy and patients with epileptic syndrome during the seizure). First, the Discrete Wavelet Transform (DWT) with the Multi-Resolution Analysis (MRA) is applied to decompose EEG signal at resolution levels of the components of the EEG signal (delta, theta, alpha, beta and gamma) and the Parsevals theorem are employed to extract the percentage distribution of energy features of the EEG signal at different resolution levels. Second, the neural network (NN) classifies these extracted features to identify the EEGs type according to the percentage distribution of energy features. The performance of the proposed algorithm has been evaluated using in total 300 EEG signals. The results showed that the proposed classifier has the ability of recognizing and classifying EEG signals efficiently.
Node-Initiated Byzantine Consensus Without a Common Clock
Venue: arXiv cs.DC 2013
Year: 2013

The majority of the literature on consensus assumes that protocols are jointly started at all nodes of the distributed system. We show how to remove this problematic assumption in semi-synchronous systems, where messages delays and relative drifts of local clocks may vary arbitrarily within known bounds. Our framework is self-stabilizing and efficient both in terms of communication and time; more concretely, compared to a synchronous start in a synchronous model of a non-self-stabilizing protocol, we achieve a constant-factor increase in the time and communicated bits to complete an instance, plus an additive communication overhead of O(n log n) broadcasted bits per time unit and node. The latter can be further reduced, at an additive increase in time complexity.
Combining Answer Set Programming and POMDPs for Knowledge Representation and Reasoning on Mobile Robots
Venue: arXiv cs.AI 2013
Year: 2013

For widespread deployment in domains characterized by partial observability, non-deterministic actions and unforeseen changes, robots need to adapt sensing, processing and interaction with humans to the tasks at hand. While robots typically cannot process all sensor inputs or operate without substantial domain knowledge, it is a challenge to provide accurate domain knowledge and humans may not have the time and expertise to provide elaborate and accurate feedback. The architecture described in this paper combines declarative programming and probabilistic reasoning to address these challenges, enabling robots to: (a) represent and reason with incomplete domain knowledge, resolving ambiguities and revising existing knowledge using sensor inputs and minimal human feedback; and (b) probabilistically model the uncertainty in sensor input processing and navigation. Specifically, Answer Set Programming (ASP), a declarative programming paradigm, is combined with hierarchical partially observable Markov decision processes (POMDPs), using domain knowledge to revise probabilistic beliefs, and using positive and negative observations for early termination of tasks that can no longer be pursued. All algorithms are evaluated in simulation and on mobile robots locating target objects in indoor domains.
Using SOA with Web Services for effective data integration of Enterprise Pharmaceutical Information Systems
Venue: arXiv cs.SE 2013
Year: 2013

Medicines exist for combating illnesses and drug stores provide an outlet for consumers to gain access to these drugs. However, due to various factors such as cost of production, accessibility and legal issues as well as distribution factors, availability of these drugs at any location cannot be guaranteed at all times. There is need for individuals and organizations such as hospitals to be able to locate required drugs within given geographical vicinity. This is of immense importance especially during emergencies, travel, and in cases where the drugs are uncommon. This research work is aimed at solving this problem by designing a system that integrates all drugstores. The integration of the drug stores will be based on SOA concepts with web services via a central service bus. The database systems of the drug stores will be integrated via a service bus such that drugs can easily be searched for and the results will be displayed based on its availability. Drugs can easily be searched for within geographically distributed pharmaceutical databases as well as consumption of drugs with relation to geographical locations can easily be monitored and tracked. This will make it easy for health institutions to research on drug consumption patterns across geographical areas and also control their usage.
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis
Venue: arXiv cs.SE 2013
Year: 2013

We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection types. The idea is that components are modeled as typed combinators, and an algorithm for inhabitation {\textemdash} is there a combinatory term e with type tau relative to an environment Gamma? {\textemdash} can be used to synthesize compositions. Here, Gamma represents the repository in the form of typed combinators, tau specifies the synthesis goal, and e is the synthesized program. We illustrate our approach by examples, including an application to synthesis from GUI-components.
Annotations for Intersection Typechecking
Venue: arXiv cs.PL 2013
Year: 2013

In functional programming languages, the classic form of annotation is a single type constraint on a term. Intersection types add complications: a single term may have to be checked several times against different types, in different contexts, requiring annotation with several types. Moreover, it is useful (in some systems, necessary) to indicate the context in which each such type is to be used. This paper explores the technical design space of annotations in systems with intersection types. Earlier work (Dunfield and Pfenning 2004) introduced contextual typing annotations, which we now tease apart into more elementary mechanisms: a "right hand" annotation (the standard form), a "left hand" annotation (the context in which a right-hand annotation is to be used), a merge that allows for multiple annotations, and an existential binder for index variables. The most novel element is the left-hand annotation, which guards terms (and right-hand annotations) with a judgment that must follow from the current context.
Formal Analysis of Soft Errors using Theorem Proving
Venue: arXiv cs.LO 2013
Year: 2013

Modeling and analysis of soft errors in electronic circuits has traditionally been done using computer simulations. Computer simulations cannot guarantee correctness of analysis because they utilize approximate real number representations and pseudo random numbers in the analysis and thus are not well suited for analyzing safety-critical applications. In this paper, we present a higher-order logic theorem proving based method for modeling and analysis of soft errors in electronic circuits. Our developed infrastructure includes formalized continuous random variable pairs, their Cumulative Distribution Function (CDF) properties and independent standard uniform and Gaussian random variables. We illustrate the usefulness of our approach by modeling and analyzing soft errors in commonly used dynamic random access memory sense amplifier circuits.
Addressing Security Challenges in Cloud Computing
Venue: arXiv cs.DC 2013
Year: 2013

Cloud computing is a new computing paradigm which allows sharing of resources on remote server such as hardware, network, storage using internet and provides the way through which application, computing power, computing infrastructure can be delivered to the user as a service. Cloud computing unique attribute promise cost effective Information Technology Solution (IT Solution) to the user. All computing needs are provided by the Cloud Service Provider (CSP) and they can be increased or decreased dynamically as required by the user. As data and Application are located at the server and may be beyond geographical boundary, this leads a number of concern from the user prospective. The objective of this paper is to explore the key issues of cloud computing which is delaying its adoption.
A Prototyping Environment for Integrated Artificial Attention Systems
Venue: arXiv cs.CV 2013
Year: 2013

Artificial visual attention systems aim to support technical systems in visual tasks by applying the concepts of selective attention observed in humans and other animals. Such systems are typically evaluated against ground truth obtained from human gaze-data or manually annotated test images. When applied to robotics, the systems are required to be adaptable to the target system. Here, we describe a flexible environment based on a robotic middleware layer allowing the development and testing of attention-guided vision systems. In such a framework, the systems can be tested with input from various sources, different attention algorithms at the core, and diverse subsequent tasks.
Detecting the historical roots of research fields by reference publication year spectroscopy (RPYS)
Venue: arXiv cs.DL 2013
Year: 2013

We introduce the quantitative method named "reference publication year spectroscopy" (RPYS). With this method one can determine the historical roots of research fields and quantify their impact on current research. RPYS is based on the analysis of the frequency with which references are cited in the publications of a specific research field in terms of the publication years of these cited references. The origins show up in the form of more or less pronounced peaks mostly caused by individual publications which are cited particularly frequently. In this study, we use research on graphene and on solar cells to illustrate how RPYS functions, and what results it can deliver.
Helly-Type Theorems in Property Testing
Venue: arXiv cs.CG 2013
Year: 2013

Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If $S$ is a set of $n$ points in $R^d$, we say that $S$ is $(k,G)$-clusterable if it can be partitioned into $k$ clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object $G$. In this paper, as an application of Helly's theorem, by taking a constant size sample from $S$, we present a testing algorithm for $(k,G)$-clustering, i.e., to distinguish between two cases: when $S$ is $(k,G)$-clusterable, and when it is $ε$-far from being $(k,G)$-clusterable. A set $S$ is $ε$-far $(0<ε\leq1)$ from being $(k,G)$-clusterable if at least $εn$ points need to be removed from $S$ to make it $(k,G)$-clusterable. We solve this problem for $k=1$ and when $G$ is a symmetric convex object. For $k>1$, we solve a weaker version of this problem. Finally, as an application of our testing result, in clustering with outliers, we show that one can find the approximate clusters by querying a constant size sample, with high probability.
Delegation Management Modeling in a Security Policy based Environment
Venue: arXiv cs.CR 2013
Year: 2013

Security Policies (SP) constitute the core of communication networks protection infrastructures. It offers a set of rules allowing differentiating between legitimate actions and prohibited ones and consequently, associates each entity in the network with a set of permissions and privileges. Moreover, in today's technological society and to allow applications perpetuity, communication networks must support the collaboration between entities to face up any unavailability or flinching. This collaboration must be governed by security mechanisms according to the established permissions and privileges. Delegation is a common practice that is used to simplify the sharing of responsibilities and privileges. The delegation process in a SP environment can be implanted through the use of adequate formalisms and modeling. The main contribution of this paper is then, the proposition of a generic and formal modeling of delegation process. This modeling is based on three steps composing the delegation life cycle: negotiation used for delegation initiation, verification of the SP respect while delegating and revocation of an established delegation. Hence, we propose to deal with each step according to the main delegation characteristics and extend them by some new specificities.
An Intelligent Fire Alert System using Wireless Mobile Communication
Venue: arXiv cs.HC 2013
Year: 2013

The system has come to light through the way of inspiration to develop a compact system, based on the fundamental ideas of safety, security and control. Once this system is installed to operation specifying temperature and smoke threshold, in case of any emergency situation due to increasing temperature and/or smoke at place surpassing the threshold, the system immediately sends automatic alert-notifications to the users, concerned with the situations. The user gets total control over the system through mobile SMS, even from the distant location, that to change the threshold, turn on/off the feature of sending 'alert notification' and also to reset the system after the emergency situation is overcome. Before executing any command (through SMS) from the user, the system asks for the preset password to verify an authorized user. The security issues have been considered with utter attention in this system to ensure its applicability in industries and business organizations, where security is an important concern. Hence, the fundamental ideas of safety, security and control have been entirely ensured through the system, which have definitely worked as the gear moving factor to look for a new dimension of an 'Intelligent Fire Alert System'.