Query: MDU-Net: Multi-scale Densely Connected U-Net for biomedical image segmentation

Relevant passages:
Deep Residual Learning for Image Recognition <=SEP=> Deeper neural networks are more difficult to train. We present a residual learning framework to ease the training of networks that are substantially deeper than those used previously. We explicitly reformulate the layers as learning residual functions with reference to the layer inputs, instead of learning unreferenced functions. We provide comprehensive empirical evidence showing that these residual networks are easier to optimize, and can gain accuracy from considerably increased depth. On the ImageNet dataset we evaluate residual nets with a depth of up to 152 layers - 8× deeper than VGG nets [40] but still having lower complexity. An ensemble of these residual nets achieves 3.57% error on the ImageNet test set. This result won the 1st place on the ILSVRC 2015 classification task. We also present analysis on CIFAR-10 with 100 and 1000 layers. The depth of representations is of central importance for many visual recognition tasks. Solely due to our extremely deep representations, we obtain a 28% relative improvement on the COCO object detection dataset. Deep residual nets are foundations of our submissions to ILSVRC & COCO 2015 competitions1, where we also won the 1st places on the tasks of ImageNet detection, ImageNet localization, COCO detection, and COCO segmentation.

Multi-Scale Context Aggregation by Dilated Convolutions <=SEP=> State-of-the-art models for semantic segmentation are based on adaptations of convolutional networks that had originally been designed for image classification. However, dense prediction problems such as semantic segmentation are structurally different from image classification. In this work, we develop a new convolutional network module that is specifically designed for dense prediction. The presented module uses dilated convolutions to systematically aggregate multiscale contextual information without losing resolution. The architecture is based on the fact that dilated convolutions support exponential expansion of the receptive field without loss of resolution or coverage. We show that the presented context module increases the accuracy of state-of-the-art semantic segmentation systems. In addition, we examine the adaptation of image classification networks to dense prediction and show that simplifying the adapted network can increase accuracy.

Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weights <=SEP=> This paper presents incremental network quantization (INQ), a novel method, targeting to efficiently convert any pre-trained full-precision convolutional neural network (CNN) model into a low-precision version whose weights are constrained to be either powers of two or zero. Unlike existing methods which are struggled in noticeable accuracy loss, our INQ has the potential to resolve this issue, as benefiting from two innovations. On one hand, we introduce three interdependent operations, namely weight partition, group-wise quantization and re-training. A wellproven measure is employed to divide the weights in each layer of a pre-trained CNN model into two disjoint groups. The weights in the first group are responsible to form a low-precision base, thus they are quantized by a variable-length encoding method. The weights in the other group are responsible to compensate for the accuracy loss from the quantization, thus they are the ones to be re-trained. On the other hand, these three operations are repeated on the latest re-trained group in an iterative manner until all the weights are converted into low-precision ones, acting as an incremental network quantization and accuracy enhancement procedure. Extensive experiments on the ImageNet classification task using almost all known deep CNN architectures including AlexNet, VGG-16, GoogleNet and ResNets well testify the efficacy of the proposed method. Specifically, at 5-bit quantization (a variable-length encoding: 1 bit for representing zero value, and the remaining 4 bits represent at most 16 different values for the powers of two) , our models have improved accuracy than the 32-bit floating-point references. Taking ResNet-18 as an example, we further show that our quantized models with 4-bit, 3-bit and 2-bit ternary weights have improved or very similar accuracy against its 32-bit floating-point baseline. Besides, impressive results with the combination of network pruning and INQ are also reported. We believe that our method sheds new insights on how to make deep CNNs to be applicable on mobile or embedded devices. The code is available at https://github.com/Zhouaojun/IncrementalNetwork-Quantization.

MIMO-Net: A multi-input multi-output convolutional neural network for cell segmentation in fluorescence microscopy images <=SEP=> We propose a novel multiple-input multiple-output convolution neural network (MIMO-Net) for cell segmentation in fluorescence microscopy images. The proposed network trains the network parameters using multiple resolutions of the input image, connects the intermediate layers for better localization and context and generates the output using multi-resolution deconvolution filters. The MIMO-Net allows us to deal with variable intensity cell boundaries and highly variable cell size in the mouse pancreatic tissue by adding extra convolutional layers which bypass the max-pooling operation. The results show that our method outperforms state-of-the-art deep learning based approaches for segmentation.

Semantic Image Segmentation with Deep Convolutional Nets and Fully Connected CRFs <=SEP=> Deep Convolutional Neural Networks (DCNNs) have recently shown state of the art performance in high level vision tasks, such as image classification and object detection. This work brings together methods from DCNNs and probabilistic graphical models for addressing the task of pixel-level classification (also called ”semantic image segmentation”). We show that responses at the final layer of DCNNs are not sufficiently localized for accurate object segmentation. This is due to the very invariance properties that make DCNNs good for high level tasks. We overcome this poor localization property of deep networks by combining the responses at the final DCNN layer with a fully connected Conditional Random Field (CRF). Qualitatively, our “DeepLab” system is able to localize segment boundaries at a level of accuracy which is beyond previous methods. Quantitatively, our method sets the new state-of-art at the PASCAL VOC-2012 semantic image segmentation task, reaching 71.6% IOU accuracy in the test set. We show how these results can be obtained efficiently: Careful network re-purposing and a novel application of the ’hole’ algorithm from the wavelet community allow dense computation of neural net responses at 8 frames per second on a modern GPU.

Machine Learning for Performance Prediction in Mobile Cellular Networks <=SEP=> In this paper, we discuss the application of machine learning techniques for performance prediction problems in wireless networks. These problems often involve using existing measurement data to predict network performance where direct measurements are not available. We explore the performance of existing machine learning algorithms for these problems and propose a simple taxonomy of main problem categories. As an example, we use an extensive real-world drive test data set to show that classical machine learning methods such as Gaussian process regression, exponential smoothing of time series, and random forests can yield excellent prediction results. Applying these methods to the management of wireless mobile networks has the potential to significantly reduce operational costs while simultaneously improving user experience. We also discuss key challenges for future work, especially with the focus on practical deployment of machine learning techniques for performance prediction in mobile wireless networks.

Algorithmic Authority: the Ethics, Politics, and Economics of Algorithms that Interpret, Decide, and Manage <=SEP=> This panel will explore algorithmic authority as it manifests and plays out across multiple domains. Algorithmic authority refers to the power of algorithms to manage human action and influence what information is accessible to users. Algorithms increasingly have the ability to affect everyday life, work practices, and economic systems through automated decision-making and interpretation of "big data". Cases of algorithmic authority include algorithmically curating news and social media feeds, evaluating job performance, matching dates, and hiring and firing employees. This panel will bring together researchers of quantified self, healthcare, digital labor, social media, and the sharing economy to deepen the emerging discourses on the ethics, politics, and economics of algorithmic authority in multiple domains.

Joint pose estimation and action recognition in image graphs <=SEP=> Human analysis in images and video is a hard problem due to the large variation in human pose, clothing, camera view-points, lighting and other factors. While the explicit modeling of this variability is difficult, the huge amount of available person images motivates for the implicit, data-driven approach to human analysis. In this work we aim to explore this approach using the large amount of images spanning a subspace of human appearance. We model this subspace by connecting images into a graph and propagating information through such a graph using a discriminatively-trained graphical model. We particularly address the problems of human pose estimation and action recognition and demonstrate how image graphs help solving these problems jointly. We report results on still images with human actions from the KTH dataset.

Function points as a universal software metric <=SEP=> Function point metrics are the most accurate and effective metrics yet developed for software sizing and also for studying software productivity, quality, costs, risks, and economic value. Unlike the older "lines of code" metric function points can be used to study requirements, design, and in fact all software activities from development through maintenance. In the future function point metrics can easily become a universal metric used for all software applications and for all software contracts in all countries. The government of Brazil already requires function points for all software contracts, and South Korea and Italy may soon follow. However, there are some logistical problems with function point metrics that need to be understood and overcome in order for function point metrics to become the primary metric for software economic analysis. Manual function point counting is too slow and costly to be used on large software projects above 10,000 function points in size. Also, application size is not constant but grows at about 2% per calendar month during development and 8% or more per calendar year for as long as software is in active use. This paper discusses a method of high-speed function point counting that can size any application in less than two minutes, and which can predict application growth during development and for five years after release. This new method is based on pattern matching and is covered by U.S. utility patent application and hence is patent pending.

Security and Privacy Challenges in Smart Cities <=SEP=> The construction of smart cities will bring about a higher quality of life to the masses through digital interconnectivity, leading to increased efficiency and accessibility in cities. Smart cities must ensure individual privacy and security in order to ensure that its citizens will participate. If citizens are reluctant to participate, the core advantages of a smart city will dissolve. This article will identify and offer possible solutions to five smart city challenges, in hopes of anticipating destabilizing and costly disruptions. The challenges include privacy preservation with high dimensional data, securing a network with a large attack surface, establishing trustworthy data sharing practices, properly utilizing artificial intelligence, and mitigating failures cascading through the smart network. Finally, further research directions are provided to encourage further exploration of smart city challenges before their construction.

SRT 除算に基づくスケーラブル剰余乗算回路 A Scalable Modular Multiplication Hardware Based on High-radix SRT Division Algorithm <=SEP=> べき剰余演算は RSA暗号 [1]を始めとする公開鍵暗 号の基本演算である.このべき剰余演算は剰余乗算に分 解できる.演算のビット数が非常に大きく,処理時間が 長いことから,高速化のために多くの回路構成法が研究 されている.剰余乗算アルゴリズム [2]の中で,回路化 に有効なものとして,乗/除算をインタリーブする SRT 除算に基づく方法 [3]と,モンゴメリ乗算に基づく方法 [4]がある.後者は幾つかの前処理と後処理が必要にな るが,法の倍数の選択が容易になる.そのため,基本的 な基数 2の構成同士の比較では前者に比べて 2倍程度高 速であるとされる [5].このことから,近年は,モンゴ メリ乗算に基づく回路構成の研究が多い. また,近年は,モンゴメリ乗算に基づくスケーラブル な回路構成に関する研究が多い [6, 7, 8].これらは,ワー ド単位に処理することで,以前のものに比べてバス幅を 小さくして,より小さな回路量で実現できる.スマート カードなどの小型の装置では,従来の構成法では回路が 比較的大きいため,このような回路規模の小さい構成が 多少速度は劣るが有効となる. 本論文では,モンゴメリ乗算ではなく,高基数 SRT除 算 [9]に基づくスケーラブルな回路構成法を提案し,こ の構成の面積/速度の性能がモンゴメリ乗算に基づく構 成に匹敵することを示す.また,法の倍数選択には,高

Depth-Dependent Halos: Illustrative Rendering of Dense Line Data <=SEP=> We present a technique for the illustrative rendering of 3D line data at interactive frame rates. We create depth-dependent halos around lines to emphasize tight line bundles while less structured lines are de-emphasized. Moreover, the depth-dependent halos combined with depth cueing via line width attenuation increase depth perception, extending techniques from sparse line rendering to the illustrative visualization of dense line data. We demonstrate how the technique can be used, in particular, for illustrating DTI fiber tracts but also show examples from gas and fluid flow simulations and mathematics as well as describe how the technique extends to point data. We report on an informal evaluation of the illustrative DTI fiber tract visualizations with domain experts in neurosurgery and tractography who commented positively about the results and suggested a number of directions for future work.

OpenSky: A swiss army knife for air traffic security research <=SEP=> The Automatic Dependent Surveillance - Broadcast (ADS-B) protocol is one of the key components of the next generation air transportation system. Since ADS-B will become mandatory by 2017 in the European airspace, it is crucial that aspects such as its security and privacy are promptly investigated by the research community. However, as expensive specialized equipment was previously necessary to collect real-world data on a large scale, such data has not been freely accessible until now. To enable researchers around the world to conduct experimental studies based on real air traffic data, we have created OpenSky, a participatory sensor network for air traffic research. In this paper, we describe the setup and capabilities of OpenSky, and detail some of the research into air traffic security that we have conducted using OpenSky.

Introduction to the Special Issue on Machine Learning for Multiple Modalities in Interactive Systems and Robots <=SEP=> This special issue highlights research articles that apply machine learning to robots and other systems that interact with users through more than one modality, such as speech, gestures, and vision. For example, a robot may coordinate its speech with its actions, taking into account (audio-)visual feedback during their execution. Machine learning provides interactive systems with opportunities to improve performance not only of individual components but also of the system as a whole. However, machine learning methods that encompass multiple modalities of an interactive system are still relatively hard to find. The articles in this special issue represent examples that contribute to filling this gap.

Antibacterial drug discovery in the resistance era <=SEP=> The looming antibiotic-resistance crisis has penetrated the consciousness of clinicians, researchers, policymakers, politicians and the public at large. The evolution and widespread distribution of antibiotic-resistance elements in bacterial pathogens has made diseases that were once easily treatable deadly again. Unfortunately, accompanying the rise in global resistance is a failure in antibacterial drug discovery. Lessons from the history of antibiotic discovery and fresh understanding of antibiotic action and the cell biology of microorganisms have the potential to deliver twenty-first century medicines that are able to control infection in the resistance era.

Hunting ELFs : An investigation into Android malware detection <=SEP=> Hunting ELFs: An Investigation Into Android Malware Detection by Thomas Sheridan Atkinson Master of Science in Information Security Royal Holloway, University of London 2015/2016 Android has risen to become the de facto operating system for mobile technologies. Its huge success and ubiquity has made it a target for malware writers. It has been found that recently sampled Android malware apps make use of repackaged malicious ELF binaries. The research carried out by this project has found a previously unknown technique used by malicious ELF binaries to hide calls to external packed binaries. An original and robust method for detecting ELF binaries that make calls to a packed binary has been developed and implemented into a state of the art framework with an aim to improving how the framework detects malicious APKs. When trained and tested on 84,979 benign samples and 16,132 malware samples, an accuracy of 96.50% was maintained using XGBoost as the classifier algorithm. The accuracy achieved using the Extra Trees algorithm was improved by 0.01% to 95.79% and the accuracy achieved when using the Random Forest algorithm was increased by 0.05% to 95.34%.

Generalized vulnerability extrapolation using abstract syntax trees <=SEP=> The discovery of vulnerabilities in source code is a key for securing computer systems. While specific types of security flaws can be identified automatically, in the general case the process of finding vulnerabilities cannot be automated and vulnerabilities are mainly discovered by manual analysis. In this paper, we propose a method for assisting a security analyst during auditing of source code. Our method proceeds by extracting abstract syntax trees from the code and determining structural patterns in these trees, such that each function in the code can be described as a mixture of these patterns. This representation enables us to decompose a known vulnerability and extrapolate it to a code base, such that functions potentially suffering from the same flaw can be suggested to the analyst. We evaluate our method on the source code of four popular open-source projects: LibTIFF, FFmpeg, Pidgin and Asterisk. For three of these projects, we are able to identify zero-day vulnerabilities by inspecting only a small fraction of the code bases.

A unified framework for generalized Linear Discriminant Analysis <=SEP=> Linear discriminant analysis (LDA) is one of the well- known methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope with the curse of dimensionality. In essence, most of these algorithms employ various techniques to deal with the singularity problem, which occurs when the data dimensionality is larger than the sample size. They have been applied successfully in various applications. However, there is a lack of a systematic study of the commonalities and differences of these algorithms, as well as their intrinsic relationships. In this paper, a unified framework for generalized LDA is proposed via a transfer function. The proposed framework elucidates the properties of various algorithms and their relationships. Based on the presented analysis, we propose an efficient model selection algorithm for LDA. We conduct extensive experiments using a collection of high-dimensional data, including text documents, face images, gene expression data, and gene expression pattern images, to evaluate the proposed theories and algorithms.

You can't always get what you want: educational attainment, agency, and choice. <=SEP=> Using educational attainment to indicate socioeconomic status, the authors examined models of agency and effects of choice among European American adults of different educational backgrounds in 3 studies. Whereas college-educated (BA) participants and their preferred cultural products (i.e., rock music lyrics) emphasized expressing uniqueness, controlling environments, and influencing others, less educated (HS) participants and their preferred cultural products (i.e., country music lyrics) emphasized maintaining integrity, adjusting selves, and resisting influence. Reflecting these models of agency, HS and BA participants differently responded to choice in dissonance and reactance paradigms: BA participants liked chosen objects more than unchosen objects, but choice did not affect HS participants' preferences. Results suggest that HS and BA models of agency qualitatively differ, despite overlap between HS and BA worlds.

Implicit Discourse Relation Classification via Multi-Task Neural Networks <=SEP=> Without discourse connectives, classifying implicit discourse relations is a challenging task and a bottleneck for building a practical discourse parser. Previous research usually makes use of one kind of discourse framework such as PDTB or RST to improve the classification performance on discourse relations. Actually, under different discourse annotation frameworks, there exist multiple corpora which have internal connections. To exploit the combination of different discourse corpora, we design related discourse classification tasks specific to a corpus, and propose a novel Convolutional Neural Network embedded multi-task learning system to synthesize these tasks by learning both unique and shared representations for each task. The experimental results on the PDTB implicit discourse relation classification task demonstrate that our model achieves significant gains over baseline systems.

Multi-level bootstrap analysis of stable clusters in resting-state fMRI <=SEP=> A variety of methods have been developed to identify brain networks with spontaneous, coherent activity in resting-state functional magnetic resonance imaging (fMRI). We propose here a generic statistical framework to quantify the stability of such resting-state networks (RSNs), which was implemented with k-means clustering. The core of the method consists in bootstrapping the available datasets to replicate the clustering process a large number of times and quantify the stable features across all replications. This bootstrap analysis of stable clusters (BASC) has several benefits: (1) it can be implemented in a multi-level fashion to investigate stable RSNs at the level of individual subjects and at the level of a group; (2) it provides a principled measure of RSN stability; and (3) the maximization of the stability measure can be used as a natural criterion to select the number of RSNs. A simulation study validated the good performance of the multi-level BASC on purely synthetic data. Stable networks were also derived from a real resting-state study for 43 subjects. At the group level, seven RSNs were identified which exhibited a good agreement with the previous findings from the literature. The comparison between the individual and group-level stability maps demonstrated the capacity of BASC to establish successful correspondences between these two levels of analysis and at the same time retain some interesting subject-specific characteristics, e.g. the specific involvement of subcortical regions in the visual and fronto-parietal networks for some subjects.

Haptic identification of objects using a modular soft robotic gripper <=SEP=> This work presents a soft hand capable of robustly grasping and identifying objects based on internal state measurements. A highly compliant hand allows for intrinsic robustness to grasping uncertainty, but the specific configuration of the hand and object is not known, leaving undetermined if a grasp was successful in picking up the right object. A soft finger was adapted and combined to form a three finger gripper that can easily be attached to existing robots, for example, to the wrist of the Baxter robot. Resistive bend sensors were added within each finger to provide a configuration estimate sufficient for distinguishing between a set of objects. With one data point from each finger, the object grasped by the gripper can be identified. A clustering algorithm to find the correspondence for each grasped object is presented for both enveloping grasps and pinch grasps. This hand is a first step towards robust proprioceptive soft grasping.

Onboard Reconfigurable Battery Charger for Electric Vehicles With Traction-to-Auxiliary Mode <=SEP=> This paper proposes a single-phase reconfigurable battery charger for an electric vehicle (EV) that operates in three different modes: grid-to-vehicle (G2V) mode, in which the traction batteries are charged from the power grid; vehicle-to-grid (V2G) mode, in which the traction batteries deliver part of the stored energy back to the power grid; and traction-to-auxiliary (T2A) mode, in which the auxiliary battery is charged from the traction batteries. When connected to the power grid, the battery charger works with a sinusoidal current in the ac side, for both G2V and V2G modes, and regulates the reactive power. When the EV is disconnected from the power grid, the control algorithms are modified, and the full-bridge ac-dc bidirectional converter works as a full-bridge isolated dc-dc converter that is used to charge the auxiliary battery of the EV, avoiding the use of an additional charger to accomplish this task. To assess the behavior of the proposed reconfigurable battery charger under different operation scenarios, a 3.6-kW laboratory prototype has been developed, and experimental results are presented.

AutoISES: Automatically Inferring Security Specification and Detecting Violations <=SEP=> The importance of software security cannot be overstated. In the past, researchers have applied program analysis techniques to automatically detect security vulnerabilities and verify security properties. However, such techniques have limited success in reality because they require manually provided code-level security specifications. Manually writing and generating these code-level security specifications are tedious and error-prone. Additionally, they seldom exist in production software. In this paper, we propose a novel method and tool, called AutoISES, which Automatically Infers Security Specifications by statically analyzing source code, and then directly use these specifications to automatically detect security violations. Our experiments with the Linux kernel and Xen demonstrated the effectiveness of this approach – AutoISES automatically generated 84 security specifications and detected 8 vulnerabilities in the Linux kernel and Xen, 7 of which have already been confirmed by the corresponding developers.

Cultural capital or relative risk aversion? Two mechanisms for educational inequality compared. <=SEP=> In this paper we empirically examined two explanatory mechanisms for educational inequality: cultural reproduction and relative risk aversion, using survey data taken from secondary school pupils in Amsterdam. Cultural reproduction theory seeks to explain class variations in schooling by cultural differences between social classes. Relative risk aversion theory argues that educational inequalities can be understood by between-class variation in the necessity of pursuing education at branching points in order to avoid downward mobility. We showed that class variations in early demonstrated ability are for a substantial part cultural: cultural capital - measured by parental involvement in highbrow culture - affected school performance at the primary and secondary level. However, relative risk aversion - operationalized by being concerned with downward mobility - strongly affects schooling ambitions, whereas cultural capital had no effect. Thus, we conclude that 'primary effects' of social origin on schooling outcomes are manifested through cultural capital and not through relative risk aversion (in addition to other potential sources of class variations such as genetics). Relative risk aversion, and not cultural capital, affects schooling ambitions, which is relevant for our understanding of secondary effects.

Entropy-Based Subword Mining with an Application to Word Embeddings <=SEP=> Recent literature has shown a wide variety of benefits to mapping traditional onehot representations of words and phrases to lower-dimensional real-valued vectors known as word embeddings. Traditionally, most word embedding algorithms treat each word as the finest meaningful semantic granularity and perform embedding by learning distinct embedding vectors for each word. Contrary to this line of thought, technical domains such as scientific and medical literature compose words from subword structures such as prefixes, suffixes, and root-words as well as compound words. Treating individual words as the finest-granularity unit discards meaningful shared semantic structure between words sharing substructures. This not only leads to poor embeddings for text corpora that have longtail distributions, but also heuristic methods for handling out-of-vocabulary words. In this paper we propose SubwordMine, an entropybased subword mining algorithm that is fast, unsupervised, and fully data-driven. We show that this allows for great cross-domain performance in identifying semantically meaningful subwords. We then investigate utilizing the mined subwords within the FastText embedding model and compare performance of the learned representations in a downstream language modeling task.

Reinforcement Learning and Approximate Dynamic Programming for Feedback Control <=SEP=> reinforcement learning and approximate dynamic programming for feedback control are a good way to achieve details about operating certainproducts. Many products that you buy can be obtained using instruction manuals. These user guides are clearlybuilt to give step-by-step information about how you ought to go ahead in operating certain equipments. Ahandbook is really a user's guide to operating the equipments. Should you loose your best guide or even the productwould not provide an instructions, you can easily obtain one on the net. You can search for the manual of yourchoice online. Here, it is possible to work with google to browse through the available user guide and find the mainone you'll need. On the net, you'll be able to discover the manual that you might want with great ease andsimplicity

High throughput ultralong (20 cm) nanowire fabrication using a wafer-scale nanograting template. <=SEP=> Nanowires are being actively explored as promising nanostructured materials for high performance flexible electronics, biochemical sensors, photonic applications, solar cells, and secondary batteries. In particular, ultralong (centimeter-long) nanowires are highly attractive from the perspective of electronic performance, device throughput (or productivity), and the possibility of novel applications. However, most previous works on ultralong nanowires have issues related to limited length, productivity, difficult alignment, and deploying onto the planar substrate complying with well-matured device fabrication technologies. Here, we demonstrate a highly ordered ultralong (up to 20 cm) nanowire array, with a diameter of 50 nm (aspect ratio of up to 4,000,000:1), in an unprecedented large (8 in.) scale (2,000,000 strands on a wafer). We first devised a perfectly connected ultralong nanograting master template on the whole area of an 8 in. substrate using a top-down approach, with a density equivalent to that achieved with e-beam lithography (100 nm). Using this large-area, ultralong, high-density nanograting template, we developed a fast and effective method for fabricating up to 20 cm long nanowire arrays on a plastic substrate, composed of metal, dielectric, oxide, and ferroelectric materials. As a suggestion of practical application, a prototype of a large-area aluminum wire grid polarizer was demonstrated.

A Low-Profile Wideband Substrate-Integrated Waveguide Cavity-Backed E-Shaped Patch Antenna for the Q-LINKPAN Applications <=SEP=> A low-profile substrate-integrated waveguide cavity-backed E-shaped patch antenna is proposed for the Q-LINKPAN application in this paper. In order to expand the operating bandwidth, a co-planar waveguide (CPW) is used to feed the proposed antenna with a metallized via for generating one more resonant mode. In addition, a substrate-integrated cavity is employed to suppress the surface wave and improve the radiation efficiency. A differential feeding network is used in the design to improve the symmetry of the E-plane radiation pattern and the H-plane cross polarization. A  $2 \times 2$  prototype is designed, fabricated, and measured for a demonstration. The measured results show that the prototype has a 10 dB impedance bandwidth of 34.4%, a gain of around 12.5 dBi with a narrow E-plane radiation beam within 37.5–46 GHz for long distance applications, and a gain of around 8 dBi with a broad E-plane radiation beam within 47–53 GHz for short distance applications. The proposed technique can be used to develop compact planar antenna for meeting both the short- and long-rang communication requirements of the emerging Q-LINKPAN wireless system.

pubmed.mineR: An R package with text-mining algorithms to analyse PubMed abstracts <=SEP=> The PubMed literature database is a valuable source of information for scientific research. It is rich in biomedical literature with more than 24 million citations. Data-mining of voluminous literature is a challenging task. Although several text-mining algorithms have been developed in recent years with focus on data visualization, they have limitations such as speed, are rigid and are not available in the open source. We have developed an R package, pubmed.mineR, wherein we have combined the advantages of existing algorithms, overcome their limitations, and offer user flexibility and link with other packages in Bioconductor and the Comprehensive R Network (CRAN) in order to expand the user capabilities for executing multifaceted approaches. Three case studies are presented, namely, ‘Evolving role of diabetes educators’, ‘Cancer risk assessment’ and ‘Dynamic concepts on disease and comorbidity’ to illustrate the use of pubmed.mineR. The package generally runs fast with small elapsed times in regular workstations even on large corpus sizes and with compute intensive functions. The pubmed.mineR is available at http://cran.r-project.org/web/packages/pubmed.mineR .