egoSlider: Visual Analysis of Egocentric Network Evolution

Ego-network, which represents relationships between a specific individual, i.e., the ego, and people connected to it, i.e., alters, is a critical target to study in social network analysis. Evolutionary patterns of ego-networks along time provide huge insights to many domains such as sociology, anthropology, and psychology. However, the analysis of dynamic ego-networks remains challenging due to its complicated time-varying graph structures, for example: alters come and leave, ties grow stronger and fade away, and alter communities merge and split. Most of the existing dynamic graph visualization techniques mainly focus on topological changes of the entire network, which is not adequate for egocentric analytical tasks. In this paper, we present egoSlider, a visual analysis system for exploring and comparing dynamic ego-networks. egoSlider provides a holistic picture of the data through multiple interactively coordinated views, revealing ego-network evolutionary patterns at three different layers: a macroscopic level for summarizing the entire ego-network data, a mesoscopic level for overviewing specific individuals' ego-network evolutions, and a microscopic level for displaying detailed temporal information of egos and their alters. We demonstrate the effectiveness of egoSlider with a usage scenario with the DBLP publication records. Also, a controlled user study indicates that in general egoSlider outperforms a baseline visualization of dynamic networks for completing egocentric analytical tasks.


Has the Internet become indispensable?

As was empirically demonstrated in [3], “the adoption rate of the Internet has exceeded that of earlier mass communication technologies by several magnitudes,” making it an “irreversible” innovation. Studies have also shown that for the generation of U.S.-based youth that grew up with the Internet, it is gradually displacing television as their main source of entertainment, communication, and education [6]. Here, we explore how the Internet has become indispensable to people in their daily lives and develop a conceptual model allowing us to address the associated research questions. The idea is that the Internet has become so embedded in the daily fabric of people’s lives that they simply cannot live without it. How is the Internet indispensable and in what ways? For which groups of people is it indispensable, for what tasks, and how has BY DONNA L. HOFFMAN, THOMAS P. NOVAK, AND ALLADI VENKATESH


Improved Microaneurysm Detection using Deep Neural Networks

In this work, we propose a novel microaneurysm (MA) detection for early dieabetic ratinopathy screening using color fundus images. Since MA usually the first lesions to appear as a indicator of diabetic retinopathy, accurate detection of MA is necessary for treatment. Each pixel of the image is classified as either MA or non-MA using deep neural network with dropout training procedure using maxout activation function. No preprocessing step or manual feature extraction is required. Substantial improvements over standard MA detection method based on pipeline of preprocessing, feature extraction, classification followed by postprocessing is achieved. The presented method is evaluated in publicly available Retinopathy Online Challenge (ROC) and Diaretdb1v2 database and achieved state-of-the-art accuracy.


Orthogonal nonnegative matrix t-factorizations for clustering

Currently, most research on nonnegative matrix factorization (NMF)focus on 2-factor $X=FG^T$ factorization. We provide a systematicanalysis of 3-factor $X=FSG^T$ NMF. While it unconstrained 3-factor NMF is equivalent to it unconstrained 2-factor NMF, itconstrained 3-factor NMF brings new features to it constrained 2-factor NMF. We study the orthogonality constraint because it leadsto rigorous clustering interpretation. We provide new rules for updating $F,S, G$ and prove the convergenceof these algorithms. Experiments on 5 datasets and a real world casestudy are performed to show the capability of bi-orthogonal 3-factorNMF on simultaneously clustering rows and columns of the input datamatrix. We provide a new approach of evaluating the quality ofclustering on words using class aggregate distribution andmulti-peak distribution. We also provide an overview of various NMF extensions andexamine their relationships.


Continuous deployment of software intensive products and services: A systematic mapping study

BACKGROUND The software intensive industry is moving towards the adoption of a value-driven and adaptive real-time business paradigm. The traditional view of software as an item that evolves through releases every few months is being replaced by continuous evolution of software functionality. OBJECTIVE This study aims to classify and analyse literature related to continuous deployment in the software domain in order to scope the phenomenon, provide an overview of its state-of-the-art, investigate the scientific evidence in the reported results and identify areas that are suitable for further research. METHOD We conducted a systematic mapping study and classified the continuous deployment literature. The benefits and challenges related to continuous deployment were also analyzed. RESULTS The systematic mapping study includes 50 primary studies published between 2001 and 2014. An in-depth analysis of the primary studies revealed ten recurrent themes that characterize continuous deployment and provide researchers with directions for future work. In addition, a set of benefits and challenges of which practitioners may take advantage were identified. CONCLUSION Overall, although the topic area is very promising, it is still in its infancy, thus offering a plethora of new opportunities for both researchers and software intensive companies.


On the journey to continuous deployment: Technical and social challenges along the way

Context: Continuous deployment (CD) is an emerging software development process with organisations such as Facebook, Microsoft, and IBM successfully implementing and using the process. The CD process aims to immediately deploy software to customers as soon as new code is developed, and can result in a number of benefits for organizations, such as: new business opportunities, reduced risk for each release, and prevent development of wasted software. There is little academic literature on the challenges organisations face when adopting the CD process, however there are many anecdotal challenges that organisations have voiced on their online blogs. Objective: The aim of this research is to examine the challenges faced by organisations when adopting CD as well as the strategies to mitigate these challenges. Method: An explorative case study technique that involves in-depth interviews with software practitioners in an organisation that has adopted CD was conducted to identify these challenges. Results: This study found a total of 20 technical and social adoption challenges that organisations may face when adopting the CD process. The results are discussed to gain a deeper understanding of the strategies employed by organisations to mitigate the impacts of these challenges. Conclusion: While a number of individual technical and social adoption challenges were uncovered by the case study in this research, most challenges were not faced in isolation. The severity of these challenges were reduced by a number of mitigation strategies employed by the case study organization. It is concluded that organisations need to be well prepared to handle technical and social adoption challenges with their existing expertise, processes and tools before adopting the CD


Using thematic analysis in psychology

Thematic analysis is a poorly demarcated, rarely acknowledged, yet widely used qualitative analytic method within psychology. In this paper, we argue that it offers an accessible and theoretically flexible approach to analysing qualitative data. We outline what thematic analysis is, locating it in relation to other qualitative analytic methods that search for themes or patterns, and in relation to different epistemological and ontological positions. We then provide clear guidelines to those wanting to start thematic analysis, or conduct it in a more deliberate and rigorous way, and consider potential pitfalls in conducting thematic analysis. Finally, we outline the disadvantages and advantages of thematic analysis. We conclude by advocating thematic analysis as a useful and flexible method for qualitative research in and beyond psychology. Qualitative Research in Psychology 2006; 3: 77 /101


The qualitative interview in IS research: Examining the craft

The qualitative interview is one of the most important data gathering tools in qualitative research, yet it has remained an unexamined craft in IS research. This paper discusses the potential difficulties, pitfalls and problems of the qualitative interview in IS research. Building on Goffman’s seminal work on social life, the paper proposes a dramaturgical model as a useful way of conceptualizing the qualitative interview. Based on this model the authors suggest guidelines for the conduct of qualitative interviews. 2006 Elsevier Ltd. All rights reserved.


Recommendations without user preferences: a natural language processing approach

We examine the problems with automated recommendation systems when information about user preferences is limited. We equate the problem to one of content similarity measurement and apply techniques from Natural Language Processing to the domain of movie recommendation. We describe two algorithms, a naïve word-space approach and a more sophisticated approach using topic signatures, and evaluate their performance compared to baseline, gold standard, and commercial systems.


Development of Inchworm In-Pipe Robot Based on Self-Locking Mechanism

In-pipe robots are used to carry sensors and some other repairing instruments to perform inspection and maintenance jobs inside pipelines. In this paper, a self-locking mechanism is presented to improve the traction ability of in-pipe robots and avoid their traditional limitations. The structure of this type of in-pipe robot is presented and some critical design issues on the principle of self-locking mechanism are discussed. Prototypes of 19 mm diameter were produced, and related experiments were performed on specially designed test platform. The traction ability of the proposed in-pipe robot was measured experimentally to be 15.2 N, far beyond its maximum static friction of 0.35 N with the inner surface of pipeline. It means that this development has broken the traditional limitation of in-pipe robot whose traction ability was smaller than its maximum static friction with the pipeline.


StyleCheck : An Automated Stylistic Analysis Tool

StyleCheck is a user-friendly tool with multiple functions designed to aid in the production of quality writing. Its features include stylistic analysis (on both documentwide and individual-sentence scales) and spelling and grammar check, as well as generating suggested replacements for all types of errors. In addition, StyleCheck includes the capability to identify the famous author (out of a limited corpus) with the style most similar to the user’s. The source code for StyleCheck is available online at: https://github.com/alexpwelton/StyleCheck Dartmouth Computer Science Technical Report TR2014-754


Capacitive coupling for power and data telemetry to implantable biomedical microsystems

This paper proposes a new method for power telemetry and wireless data transfer to biomedical implants. Confinement of the transferred energy within a predefined area, hence not influencing the neighboring sensitive circuitry on the microsystem, and also allowing for more than one telemetry link on the same platform and even operating at the same carrier frequency are among the advantages of the proposed method over the traditional approaches for power and data telemetry.


Document classification through image-based character embedding and wildcard training

Languages such as Chinese and Japanese have a significantly large number (several thousands) of alphabets as compared to other languages, and each of their sentences consists of several concatenated words with wide varieties of inflected forms; thus appropriate word segmentation is quite difficult. Therefore, recently proposed sophisticated language-processing methods designed for languages such as English cannot be applied. In this paper, we address those issues and propose a new and efficient document classification technique for such languages. The proposed method is characterized into a new “image-based character embedding” method and character-level convolutional neural networks method with “wildcard training.” The first method encodes each character based on its pictorial structures and preserves them. Further, the second method treats some of the input characters as wildcards in the classification stage and functions as efficient data augmentation. We confirmed that our proposed method showed superior performance when compared conventional methods for Japanese document classification problems.


Depth inpainting by tensor voting.

Depth maps captured by range scanning devices or by using optical cameras often suffer from missing regions due to occlusions, reflectivity, limited scanning area, sensor imperfections, etc. In this paper, we propose a fast and reliable algorithm for depth map inpainting using the tensor voting (TV) framework. For less complex missing regions, local edge and depth information is utilized for synthesizing missing values. The depth variations are modeled by local planes using 3D TV, and missing values are estimated using plane equations. For large and complex missing regions, we collect and evaluate depth estimates from self-similar (training) datasets. We align the depth maps of the training set with the target (defective) depth map and evaluate the goodness of depth estimates among candidate values using 3D TV. We demonstrate the effectiveness of the proposed approaches on real as well as synthetic data.


A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

The Hamiltonian cycle problem is one of the most popular NP-complete problems, and remains NP-complete even if we restrict ourselves to a class of (3-connected cubic) planar graphs [5,9]. Therefore, there seems to be no polynomial-time algorithm for the Hamiltonian cycle problem. However, for certain (nontrivial) classes of restricted graphs, there exist polynomial-time algorithms [3,4,6]. In fact, employing the proof technique used by Tutte [lo], Gouyou-Beauchamps has given an 0(n3) time algorithm for finding a Hamiltonian cycle in a 4-connected planar graph G, where n is the number of vertices of G [6]. Although such a graph G always has a Hamiltonian cycle [lo], it is not an easy matter to actually find a Hamiltonian cycle of G. However, for a little more restricted class of graphs, i.e., the class of 4-connected maximal planar graphs, we can construct an efficient algorithm. One can easily design an O(n*) time algorithm to find a Hamiltonian cycle in a 4-connetted maximal planar graph G with n vertices, entirely based on Whitney’s proof of his theorem [l 11. In this paper, we present an efficient algorithm for the problem, based on our simplified version of Whitney’s proof of his result. We employ ‘divide and conquer’ and some other techniques in the algorithm. The computational complexity of our algorithm is linear, thus optimal to within a constant factor.


Improving Vector Space Word Representations Via Kernel Canonical Correlation Analysis

Cross-lingual word embeddings are representations for vocabularies of two or more languages in one common continuous vector space and are widely used in various natural language processing tasks. A state-of-the-art way to generate cross-lingual word embeddings is to learn a linear mapping, with an assumption that the vector representations of similar words in different languages are related by a linear relationship. However, this assumption does not always hold true, especially for substantially different languages. We therefore propose to use kernel canonical correlation analysis to capture a non-linear relationship between word embeddings of two languages. By extensively evaluating the learned word embeddings on three tasks (word similarity, cross-lingual dictionary induction, and cross-lingual document classification) across five language pairs, we demonstrate that our proposed approach achieves essentially better performances than previous linear methods on all of the three tasks, especially for language pairs with substantial typological difference.


Data integration with uncertainty

This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels and do so in a principled fashion. First, the semantic mappings between the data sources and the mediated schema may be approximate because there may be too many of them to be created and maintained or because in some domains (e.g., bioinformatics) it is not clear what the mappings should be. Second, the data from the sources may be extracted using information extraction techniques and so may yield erroneous data. Third, queries to the system may be posed with keywords rather than in a structured form. As a first step to building such a system, we introduce the concept of probabilistic schema mappings and analyze their formal foundations. We show that there are two possible semantics for such mappings: by-table semantics assumes that there exists a correct mapping but we do not know what it is; by-tuple semantics assumes that the correct mapping may depend on the particular tuple in the source data. We present the query complexity and algorithms for answering queries in the presence of probabilistic schema mappings, and we describe an algorithm for efficiently computing the top-k answers to queries in such a setting. Finally, we consider using probabilistic mappings in the scenario of data exchange.


SLAM-based Pseudo-GNSS/INS localization system for indoor LiDAR mobile mapping systems

The emergence of Mobile Mapping Systems (MMS) has set a marked paradigm in the photogrammetric and mapping community that has not only facilitated comprehensive 3D mapping of different environments but has also paved way for new aspects of applied research in this direction. Out of the many essential blocks that make these MMS a viable tool for mapping, the positioning and orientation module is considered to be a crucial yet an expensive component. The integration of such a module with mapping sensors has allowed for the extensive implementation of such systems to provide high-quality maps. However, while such systems do not lack in system robustness and performance in general, the deployment of these systems is restricted to applications and environments where a consistent availability of GNSS signals is assured. Extending these MMS to GNSS-denied areas, such as indoor environments, is therefore quite challenging and necessitates the development of an alternative module that can act as a viable substitute to GNSS/INS for system operation without having to resort to an exhaustive modification of the same to function in GNSS-denied locations. In this research, such a case has been considered for the implementation of an indoor MMS using an Unmanned Ground Vehicle (UGV) and a 3D laser scanner for the task of generating high density maps of GNSS-denied indoor areas. To mitigate the absence of GNSS data, this paper proposes a Pseudo-GNSS/INS module integrated framework which utilizes probabilistic Simultaneous Localization and Mapping (SLAM) techniques to estimate the platform pose and heading from 3D laser scanner data. This proposed framework has been implemented based on three major notions: (i) using geometric methods for sparse point cloud extraction to carry out real-time SLAM, (ii) generating position data and geo-referencing signals from these real-time SLAM pose estimates, and (iii) carrying out the entire operation through use of a single 3D mapping sensor. The final geo-referenced point cloud can then be generated through post-processing by the Iterative Closest Projected Point (ICPP) registration technique which also diminishes the effect of sensor measurement noise. The implementation, performance and results of the proposed MMS framework for an indoor mapping system have been presented in this paper that demonstrate the ability of this Pseudo-GNSS/INS framework to operate flexibly in GNSS-denied areas.


Semantic Lexicon Induction from Twitter with Pattern Relatedness and Flexible Term Length

With the rise of social media, learning from informal text has become increasingly important. We present a novel semantic lexicon induction approach that is able to learn new vocabulary from social media. Our method is robust to the idiosyncrasies of informal and open-domain text corpora. Unlike previous work, it does not impose restrictions on the lexical features of candidate terms – e.g. by restricting entries to nouns or noun phrases – while still being able to accurately learn multiword phrases of variable length. Starting with a few seed terms for a semantic category, our method first explores the context around seed terms in a corpus, and identifies context patterns that are relevant to the category. These patterns are used to extract candidate terms – i.e. multiword segments that are further analyzed to ensure meaningful term boundary segmentation. We show that our approach is able to learn high quality semantic lexicons from informally written social media text of Twitter, and can achieve accuracy as high as 92% in the top 100 learned category members.


1 USES OF TECHNOLOGY THAT SUPPORT PUPILS WITH SPECIAL EDUCATIONAL NEEDS


Cell-Balancing Techniques: Theory and Implementation

In the safety chapter we briefly discussed the issue that when multiple cells are connected in series, the cell voltage is not always equal to the pack voltage divided by the number of cells. How does this happen? This chapter explores that question in detail, but the first question to answer is this: Why do we care? The first reason is safety. Remember, when lithium ion cell voltage exceeds 4.2V by a few hundred millivolts, it can undergo thermal runaway, melting the battery pack and device it is powering. It can even blow up as a big ball of fire. Although a well-designed pack has an overvoltage protection circuit that will prevent such an event (usually even two independent circuits!), it is better not to tempt fate by triggering this protection unnecessarily. The second reason is longevity. If the maximal recommended charging voltage is exceeded even a little, it will cause very accelerated degradation. Just increasing the charging voltage from 4.2 to 4.25V causes the degradation rate to increase by 30%. For this reason, the misbehaving cell that has higher than its due share of voltage will degrade faster. The third reason is incomplete charging of the pack. Let's assume the protector circuit does its job and that charging stops when just one cell gets close to unsafe conditions. Now we have successfully prevented thermal runaway, but all of the other cells now have lower voltages and are not fully charged. If we look at the pack voltage, it will be much less than 4.2V multiplied by the


Concepts for dynamic obstacle avoidance and their extended application in underground navigation

An effective approach to dynamic obstacle avoidance for mobile robots is described in this paper. The main concepts in this approach include local Polar Object Chart (POC) for defining possible ways out, obstacle definition, detour mode, anchor for preventing getting lost, steering delimiting and velocity delimiting. The presented concepts and methods were tested and verified both by simulations and experiments on a developed prototype industrial Automated Guided Vehicle (AGV). This paper also presents the extended application of some of the concepts in underground navigation. © 2002 Elsevier Science B.V. All rights reserved.


Design Principles for Industrie 4.0 Scenarios

The increasing integration of the Internet of Everything into the industrial value chain has built the foundation for the next industrial revolution called Industrie 4.0. Although Industrie 4.0 is currently a top priority for many companies, research centers, and universities, a generally accepted understanding of the term does not exist. As a result, discussing the topic on an academic level is difficult, and so is implementing Industrie 4.0 scenarios. Based on a quantitative text analysis and a qualitative literature review, the paper identifies design principles of Industrie 4.0. Taking into account these principles, academics may be enabled to further investigate on the topic, while practitioners may find assistance in identifying appropriate scenarios. A case study illustrates how the identified design principles support practitioners in identifying Industrie 4.0 scenarios.


Improved Forms for Controlling the Acrobot with Motors of Atypical Size Using Artificial Intelligence Techniques

An acrobot is a planar robot with a passive actuator in its first joint. The control problem of the acrobot tries to make it rise from the rest position to the inverted pendulum position. This control problem can be divided in the swing-up problem, when the robot has to rise itself through swinging up as a human acrobat does, and the balancing problem, when the robot has to maintain itself on the inverted pendulum position. We have developed three controllers for the swing-up problem applied to two types of motors: small and big. For small motors, we used the SARSA controller and the PD with a trajectory generator. For big motors, we propose a new controller to control the acrobot, a PWM controller. All controllers except SARSA are tuned using a Genetic Algorithm.


Learning Depth from Single Monocular Images

We consider the task of depth estimation from a single monocular image. We take a supervised learning approach to this problem, in which we begin by collecting a training set of monocular images (of unstructured outdoor environments which include forests, trees, buildings, etc.) and their corresponding ground-truth depthmaps. Then, we apply supervised learning to predict the depthmap as a function of the image. Depth estimation is a challenging problem, since local features alone are insufficient to estimate depth at a point, and one needs to consider the global context of the image. Our model uses a discriminatively-trained Markov Random Field (MRF) that incorporates multiscale localand global-image features, and models both depths at individual points as well as the relation between depths at different points. We show that, even on unstructured scenes, our algorithm is frequently able to recover fairly accurate depthmaps.


HW/SW Codesign and FPGA Acceleration of Visual Odometry Algorithms for Rover Navigation on Mars

Future Mars exploration missions rely heavily on high-mobility autonomous rovers equipped with sophisticated scientific instruments and possessing advanced navigational capabilities. Increasing their navigation velocity and localization accuracy is essential for enabling these rovers to explore large areas on Mars. Contemporary Mars rovers move slowly, partially due to the long execution time of complex computer vision algorithms running on their slow space-grade CPUs. This paper exploits the advent of high-performance space-grade field-programmable gate arrays (FPGAs) to accelerate the navigation of future rovers. Specifically, it focuses on visual odometry (VO) and performs HW/SW codesign to achieve one order of magnitude faster execution and improved accuracy. Conforming to the specifications of the European Space Agency, we build a proof-of-concept system on an HW/SW platform with processing power resembling that to be available onboard future rovers. We develop a codesign methodology adapted to the rover's specifications, design parallel architectures, and customize several feature extraction, matching, and motion estimation algorithms. We implement and evaluate five distinct HW/SW pipelines on a Virtex6 FPGA and a 150 MIPS CPU. We provide a detailed analysis of their cost-time-accuracy tradeoffs and quantify the benefits of employing FPGAs for implementing VO. Our solution achieves a speedup factor of 16× over a CPU-only implementation, handling a stereo image pair in less than 1 s, with a 1.25% mean positional error after a 100 m traverse and an FPGA cost of 54 K LUTs and 1.46-MB RAM.


Automatic Detection of Malware-Generated Domains with Recurrent Neural Models

Modern malware families often rely on domain-generation algorithms (DGAs) to determine rendezvous points to their command-and-control server. Traditional defence strategies (such as blacklisting domains or IP addresses) are inadequate against such techniques due to the large and continuously changing list of domains produced by these algorithms. This paper demonstrates that a machine learning approach based on recurrent neural networks is able to detect domain names generated by DGAs with high precision. The neural models are estimated on a large training set of domains generated by various malwares. Experimental results show that this data-driven approach can detect malware-generated domain names with a F1 score of 0.971. To put it differently, the model can automatically detect 93 % of malware-generated domain names for a false positive rate of 1:100.


Microstrip Rectangular 4x1 Patch Array Antenna at 2.5GHz for WiMax Application

This paper presents the design of microstrip rectangular patch antenna with center frequency at 2.5GHz for WiMAX application. The array of four by one (4x1) patch array microstrip rectangular antenna with microstrip line feeding based on quarter wave impedance matching technique was designed and simulated using Computer Simulation Tool (CST) Microwave Environment software. The performance of the designed antenna was than compared with the single patch rectangle antenna in term of return loss, Voltage Standing Wave Ratio (VSWR), bandwidth, directivity, radiation pattern and gain. The array antenna was then fabricated on the substrate type FR-4 with dielectric constant of 4.9 and thickness of 1.6mm respectively. The array antenna was measured in the laboratory using Vector Network Analyzer (VNA) and the results show good agreement with the array antenna simulated performances.


A comparison of the performance of latent Dirichlet allocation and the Dirichlet multinomial mixture model on short text

The expansion of the World Wide Web and the increasing popularity of microblogging websites such as Twitter and Facebook has created massive stores of textual data that is short in length. Although traditional topic models have proven to work successfully on collections of long texts such as books and news articles, they tend to produce results that are less coherent when applied to short text, such as status messages and product reviews. Over the last few decades it has become of greater relevance to analyse short texts due to the realisation that such bodies of text could potentially hold useful information. Latent Dirichlet allocation (LDA) is one of the most popular topic models and it makes the generative assumption that each document contains multiple topics in varying proportions, which is a sensible assumption about long text. On the other hand, the Dirichlet multinomial mixture model (GSDMM), a seemingly less popular topic model, assumes that a document can only belong to a single topic, which seems to be a more appropriate assumption for short text. The objective of this paper is to investigate the hypothesis that GSDMM will outperform LDA on short text, using topic coherence and stability as performance measures.


A Four-Plate Compact Capacitive Coupler Design and LCL-Compensated Topology for Capacitive Power Transfer in Electric Vehicle Charging Application

This paper proposes a four-plate compact capacitive coupler and its circuit model for large air-gap distance capacitive power transfer (CPT). The four plates are arranged vertically, instead of horizontally, to save space in the electric vehicle charging application. The two plates that are on the same side are placed close to each other to maintain a large coupling capacitance, and they are of different sizes to maintain the coupling between the primary and secondary sides. The circuit model of the coupler is presented, considering all six coupling capacitors. The LCL compensation topology is used to resonate with the coupler and provide high voltage on the plates to transfer high power. The circuit model of the coupler is simplified to design the parameters of the compensation circuit. Finite-element analysis is employed to simulate the coupling capacitance and design the dimensions of the coupler. The circuit performance is simulated in LTspice to design the specific parameter values. A prototype of the CPT system was designed and constructed with the proposed vertical plate structure. The prototype achieved an efficiency of 85.87% at 1.88-kW output power with a 150-mm air-gap distance.


Bundle Adjustment - A Modern Synthesis

This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics covered include: the choice of cost function and robustness; numerical optimization including sparse Newton methods, linearly convergent approximations, updating and recursive methods; gauge (datum) invariance; and quality control. The theory is developed for general robust cost functions rather than restricting attention to traditional nonlinear least squares.


Design, modeling and control of a 5-DoF light-weight robot arm for aerial manipulation

The design, modeling and control of a 5 degrees-of-freedom light-weight robot manipulator is presented in this paper. The proposed robot arm, named Prisma Ultra-Lightweight 5 ARm (PUL5AR), is employed to execute manipulation tasks equipped on board of a vertical take-off and landing unmanned aerial vehicle. The arm is compact and light-weight. Its mechanics is designed such that it can fold on itself during landing manoeuvres. Moreover, the design is conceived to constrain the center of gravity of the arm as close as possible to vehicle base, thus reducing the total inertia and static unbalancing of the system. Experimental tests have been carried out in order to validate the dynamic model, the communication library, the developed electronics, and the control schemes implemented for the designed robot arm.


A Unified Passivity Based Control Framework for Position, Torque and Impedance Control of Flexible Joint Robots

In this paper we describe a general passivity based framework for the control of flexible joint robots. Herein the recent DLR results on torque-, position-, as well as impedance control of flexible joint robots are summarized, and the relations between the individual contributions are highlighted. It is shown that an inner torque feedback loop can be incorporated into a passivity based analysis by interpreting torque feedback in terms of shaping of the motor inertia. This result, which implicitly was already included in our earlier works on torqueand position control, can also be seized for the design of impedance controllers. For impedance control, furthermore, potential shaping is of special interest. It is shown how, based only on the motor angles, a potential function can be designed which simultaneously incorporates gravity compensation and a desired Cartesian stiffness relation for the link angles. All the presented controllers were experimentally evaluated on the DLR light-weight robots and proved their performance and robustness with respect to uncertain model parameters. Herein, an impact experiment is presented briefly, and an overview of several applications is given in which the controllers have been applied.


Modeling and Control of MM-UAV: Mobile Manipulating Unmanned Aerial Vehicle

Compared to autonomous ground vehicles, UAVs (unmanned aerial vehicles) have significant mobility advantages and the potential to operate in otherwise unreachable locations. Micro UAVs still suffer from one major drawback: they do not have the necessary payload capabilities to support high performance arms. This paper, however, investigates the key challenges in controlling a mobile manipulating UAV using a commercially available aircraft and a light-weight prototype 3arm manipulator. Because of the overall instability of rotorcraft, we use a motion capture system to build an efficient autopilot. Our results indicate that we can accurately model and control our prototype system given significant disturbances when both moving the manipulators and interacting with the ground.


Construction of Cubic Structures with Quadrotor Teams

We propose and investigate a system in which teams of quadrotor helicopters assemble 2.5-D structures from simple structural nodes and members equipped with magnets. The structures, called Special Cubic Structures (SCS), are a class of 2.5-D truss-like structures free of overhangs and holes. Grippers attached to the bottom of each quadrotor enable them to pick up, transport, and assemble the structural elements. The design of the nodes and members imposes constraints on assembly which are incorporated into the design of the algorithms used for assembly. We show that any SCS can be built using only the feasible assembly modes for individual structural elements and present simulation and experimental results with a team of quadrotors performing automated assembly. The paper includes a theoretical analysis of the SCS construction algorithm, the rationale for the design of the structural nodes, members and quadrotor gripper, a description of the quadrotor control methods for part pickup, transport and assembly, and an empirical analysis of system performance.


Impact of FinFET Technology Introduction in the 3T1D-DRAM Memory Cell

In this paper, the 3T1D-DRAM cell based on FinFET devices is studied as an alternative to the bulk one. We observe an improvement in its behavior when IG and SG FinFETs are properly mixed, since together they provide a relevant increase in the memory circuit retention time. Moreover, our FinFET cell shows larger variability robustness, better performance at low supply voltage, and higher tolerance to elevated temperatures.


IoT security attacks using reverse engineering methods on WSN applications

With the rapid technological advancements of sensors, Wireless Sensor Networks (WSNs) have become a popular technology for the Internet of Things (IoT). We investigated the security of WSNs in an environmental monitoring application with the goal to demonstrate the overall security. We implemented a Secure Temperature Monitoring System (STMS), which served as our WSN application. Our results revealed a security flaw found in the bootstrap loader (BSL) password used to protect MSP430 micro-controller units (MCUs). We demonstrated how the BSL password could be brute forced in a matter of days. Furthermore, we illustrate how an attacker can reverse engineer WSN applications to obtain critical security information such as encryption keys. We contribute a solution to patch the weak BSL password security flaw and improve the security of MSP430 MCU chips. The Secure-BSL patch we contribute allows the randomization of the BSL password. Our solution increases the brute force time to decades. The impractical brute force time enhances the security of the MSP430 and prevents future reverse engineering tactics. Our research serves as proof that the security of WSNs and the overall IoT technology is broken if we cannot protect these everyday objects at the physical layer.


Cybersecurity Through Secure Software Development

Reports about serious vulnerabilities in critical IT components have triggered increased focus on cybersecurity worldwide. Among the man y initiatives to strengthen cybersecurity it is common to see the establishment and stre gthening of CERTs and other centers for cybersecurity. On the other hand , strengthening education in IT security and applying methods for secure systems d velopment are methods that receive much less attention. In this paper we expla in how the lack of focus on security in IT education programs worldwide is a signifi cant contributor to security vulnerabilities, and we propose an agile method for s ecure software design that requires team members to have received adequa te security education and training.


Identifying Important Places in People's Lives from Cellular Network Data

People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is crucial for a range of technology and policy decisions in areas such as telecommunications and transportation infrastructure deployment. In this paper, we propose new techniques based on clustering and regression for analyzing anonymized cellular network data to identify generally important locations, and to discern semantically meaningful locations such as home and work. Starting with temporally sparse and spatially coarse location information, we propose a new algorithm to identify important locations. We test this algorithm on arbitrary cellphone users, including those with low call rates, and find that we are within 3 miles of ground truth for 88% of volunteer users. Further, after locating home and work, we achieve commute distance estimates that are within 1 mile of equivalent estimates derived from government census data. Finally, we perform carbon footprint analyses on hundreds of thousands of anonymous users as an example of how our data and algorithms can form an accurate and efficient underpinning for policy and infrastructure studies.


ExerLink: enabling pervasive social exergames with heterogeneous exercise devices

We envision that diverse social exercising games, or exergames, will emerge, featuring much richer interactivity with immersive game play experiences. Further, the recent advances of mobile devices and wireless networking will make such social engagement more pervasive - people carry portable exergame devices (e.g., jump ropes) and interact with remote users anytime, anywhere. Towards this goal, we explore the potential of using heterogeneous exercise devices as game controllers for a multi-player social exergame; e.g., playing a boat paddling game with two remote exercisers (one with a jump rope, and the other with a treadmill). In this paper, we propose a novel platform called ExerLink that converts exercise intensity to game inputs and intelligently balances intensity/delay variations for fair game play experiences. We report the design considerations and guidelines obtained from the design and development processes of game controllers. We validate the efficacy of game controllers and demonstrate the feasibility of social exergames with heterogeneous exercise devices via extensive human subject studies.


WNGrad: Learn the Learning Rate in Gradient Descent

Adjusting the learning rate schedule in stochastic gradient methods is an important unresolved problem which requires tuning in practice. If certain parameters of the loss function such as smoothness or strong convexity constants are known, theoretical learning rate schedules can be applied. However, in practice, such parameters are not known, and the loss function of interest is not convex in any case. The recently proposed batch normalization reparametrization is widely adopted in most neural network architectures today because, among other advantages, it is robust to the choice of Lipschitz constant of the gradient in loss function, allowing one to set a large learning rate without worry. Inspired by batch normalization, we propose a general nonlinear update rule for the learning rate in batch and stochastic gradient descent so that the learning rate can be initialized at a high value, and is subsequently decreased according to gradient observations along the way. The proposed method is shown to achieve robustness to the relationship between the learning rate and the Lipschitz constant, and near-optimal convergence rates in both the batch and stochastic settings (O(1/T ) for smooth loss in the batch setting, and O(1/ √ T ) for convex loss in the stochastic setting). We also show through numerical evidence that such robustness of the proposed method extends to highly nonconvex and possibly non-smooth loss function in deep learning problems. Our analysis establishes some first theoretical understanding into the observed robustness for batch normalization and weight normalization.


Hierarchical Committee of Deep CNNs with Exponentially-Weighted Decision Fusion for Static Facial Expression Recognition

We present a pattern recognition framework to improve committee machines of deep convolutional neural networks (deep CNNs) and its application to static facial expression recognition in the wild (SFEW). In order to generate enough diversity of decisions, we trained multiple deep CNNs by varying network architectures, input normalization, and weight initialization as well as by adopting several learning strategies to use large external databases. Moreover, with these deep models, we formed hierarchical committees using the validation-accuracy-based exponentially-weighted average (VA-Expo-WA) rule. Through extensive experiments, the great strengths of our committee machines were demonstrated in both structural and decisional ways. On the SFEW2.0 dataset released for the 3rd Emotion Recognition in the Wild (EmotiW) sub-challenge, a test accuracy of 57.3% was obtained from the best single deep CNN, while the single-level committees yielded 58.3% and 60.5% with the simple average rule and with the VA-Expo-WA rule, respectively. Our final submission based on the 3-level hierarchy using the VA-Expo-WA achieved 61.6%, significantly higher than the SFEW baseline of 39.1%.


Communicating neuronal ensembles between neuromorphic chips

I describe an interchip communication system that reads out pulse trains from a 64 64 array of neurons on one chip, and transmits them to corresponding locations in a 64 64 array of neurons on a second chip. It uses a random-access, time-multiplexed, asynchronous digital bus to transmit log2N -bit addresses that uniquely identify each of theN neurons in the sending population. A peak transmission rate of 2.5MSpikes/s is achieved by pipelining the operation of the channel. I discuss how the communication channel design is optimized for sporadic stimulus-triggered activity which causes some small subpopulation to re in synchrony, by adopting an arbitered, event-driven architecture. I derive the bandwidth required to transmit this neuronal ensemble, without temporal dispersion, in terms of the number of neurons, the probability that a neuron is part of the ensemble, and the degree of synchrony.


Intent Mining for the Good , Bad & Ugly Use of Social Web : Concepts , Methods , and Challenges

The social web has empowered us to easily share information, express opinions, and engage in discussions on events around the world. While users of social media platforms often o↵er help and emotional support to others (the good), they also spam (the bad) and harass others as well as even manipulate others via fake news (the ugly). In order to both leverage the positive e↵ects and mitigate the negative e↵ects of using social media, intent mining provides a computational approach to proactively analyze social media data. This chapter introduces an intent taxonomy of social media usage with examples and describes methods and future challenges to mine the intentional uses of social media.


K-nearest correlated neighbor classification for Indian sign language gesture recognition using feature fusion

A sign language recognition system is an attempt to bring the speech and the hearing impaired community closer to more regular and convenient forms of communication. Thus, this system requires to recognize the gestures from a sign language and convert them to a form easily understood by the hearing. The model that has been proposed in this paper recognizes static images of the signed alphabets in the Indian Sign Language. Unlike the alphabets in other sign languages like the American Sign Language and the Chinese Sign language, the ISL alphabet are both single-handed and double-handed. Hence, to make recognition easier the model first categorizes them as single-handed or double-handed. For both categories two kinds of features, namely HOG and SIFT, are extracted for a set of training images and are combined in a single matrix. After which, HOG and SIFT features for the input test image are combined with the HOG and SIFT feature matrices of the training set. Correlation is computed for these matrices and is fed to a K-Nearest Neighbor Classifier to obtain the resultant classification of the test image.


Decentralized Edge Clouds

Cloud computing services are traditionally deployed on centralized computing infrastructures confined to a few data centers, while cloud applications run in a single data center. However, the cloud's centralized nature can be limiting in terms of performance and cost for applications where users, data, and computation are distributed. The authors present an overview of distributed clouds that might be better suited for such applications. They briefly describe the distributed cloud landscape and introduce Nebula, a highly decentralized cloud that uses volunteer edge resources. The authors provide insights into some of its key properties and design issues, and describe a distributed MapReduce application scenario to illustrate the benefits and trade-offs of using distributed and decentralized clouds for distributed data-intensive computing applications.


A 5-Gbps CMOS Burst-Mode CDR Circuit With an Analog Phase Interpolator for PONs

This paper presents a 5-Gb/s low-power burst-mode clock and data recovery circuit based on analog phase interpolator for passive optical network applications. The proposed clock recovery unit consists of two double-edge triggered sample-and-holds (DTSHs) and a phase interpolator. The PI instantaneously locks the recovered clock to incoming burst-mode data by coefficients generated at the DT-SHs’ outputs. To reduce power dissipation in clock recovery unit, instead of two buffers, only one is utilized for the DT-SH. The proposed PI-based BM-CDR has been designed and simulated in 0.18-μm standard CMOS technology. The Results show that reduction in power dissipation of 40% for the clock recovery unit has been achieved. The proposed BM-CDR circuit retimes data at 5Gb/s for a 210-1 pseudo-random binary sequence within the first UI. The recovered data shows jitter at 14ps (pp). The circuit, including 1:2 data demux, draws 29mW power from a 1.8-V supply.


User Requirements Analysis: A Review of Supporting Methods

Understanding user requirements is an integral part of information systems design and is critical to the success of interactive systems. However specifying these requirements is not so simple to achieve. This paper describes general methods to support user requirements analysis that can be adapted to a range of situations. Some brief case studies are described to illustrate how these methods have been applied in practice.


Shape from shading for the digitization of curved documents

Document digitization is faster and more affordable using digital cameras than scanners. On the other hand, if we aim at extending the basic digital camera functionalities for such a purpose, post-processings will be of first importance, at least to improve the text legibility. In this paper, we address the specific problem of the virtual flattening of curved documents, as for example the pages of an opened book lying on its spine. In order to compute the document shape, we use the shape from shading technique and discuss why, in some cases, it is more suitable than other 3D single-view reconstruction techniques. We extend the seminal work by Wada et al. (Proceedings of the IAPR Workshop on machine vision and applications, Tokyo, Japan, pp. 591–594, 1992) and consecutive papers, reformulating the problem in terms of perspective shape from shading. Finally, we design a complete post-processing algorithm and test it on real images. Even if the documents are much curved, it is shown that the restored images are almost identical to scanned images of the flattened documents.


Direct Synthesis of Complex Loaded Chebyshev Filters in a Complex Filtering Network

In this paper, a direct synthesis approach is proposed for designing a Chebyshev filter that matches the frequency variant complex loads at both the ports. The approach is based on the power wave renormalization theory and two practical assumptions: 1) the prescribed transmission zeros are stationary and 2) the reflection zeros are located along an imaginary axis. Three conditions are derived to stipulate the characteristic polynomials of the filter's responses through the renormalization of reference load impedances. These conditions are sequentially applied to ensure that the filter is physically realizable and well matched to the complex loads. It has been shown that the optimally synthesized filtering network that consists of an ideal filter cascaded with a piece of transmission line of an optimal length at each port can match the complex loads over a given frequency band with the best effort. By incorporating with an adjustment of the junction parameters, the approach provides an analytical yet flexible way to synthesize advanced microwave circuits composed of multiple filters connected together through some generalized junctions. The effectiveness of the method is demonstrated through three synthesis examples.


Analyze your Scratch projects with Dr . Scratch and assess your Computational Thinking skills

In this paper we present the feature of Dr. Scratch that allows to automatically assessing the Computational Thinking skills of Scratch projects. The paper reviews similar initiatives, like Hairball, and investigates the literature with proposals for assessment of Scratch projects that we have studied and remixed in order to develop the Computational Thinking analysis. Then it introduces the various aspects that Dr. Scratch takes into consideration to compute a Computational Thinking score for a Scratch project and presents some preliminary findings of the analysis of over 100 investigated Scratch projects. Finally, future directions and limitations are presented and discussed.


Hatha yoga: improved vital capacity of college students.

CONTEXT
The vital capacity of the lungs is a critical component of good health. Vital capacity is an important concern for those with asthma, heart conditions, and lung ailments; those who smoke; and those who have no known lung problems.

OBJECTIVE
To determine the effects of yoga postures and breathing exercises on vital capacity.

DESIGN
Using the Spiropet spirometer, researchers measured vital capacity. Vital capacity determinants were taken near the beginning and end of two 17-week semesters. No control group was used.

SETTING
Midwestern university yoga classes taken for college credit.

PARTICIPANTS
A total of 287 college students, 89 men and 198 women.

INTERVENTION
Subjects were taught yoga poses, breathing techniques, and relaxation in two 50-minute class meetings for 15 weeks.

MAIN OUTCOME MEASURES
Vital capacity over time for smokers, asthmatics, and those with no known lung disease.

RESULTS
The study showed a statistically significant (P < .001) improvement in vital capacity across all categories over time.

CONCLUSIONS
It is not known whether these findings were the result of yoga poses, breathing techniques, relaxation, or other aspects of exercise in the subjects' life. The subjects' adherence to attending class was 99.96%. The large number of 287 subjects is considered to be a valid number for a study of this type. These findings are consistent with other research studies reporting the positive effect of yoga on the vital capacity of the lungs.


PinPoint: Localizing Interfering Radios

This paper presents PinPoint, a technique for localizing rogue interfering radios that adhere to standard protocols in the inhospitable ISM band without any cooperation from the interfering radio. PinPoint is designed to be incrementally deployed on top of existing 802.11 WLAN infrastructure, and used by network administrators to identify and troubleshoot sources of interference which may be disrupting the network. PinPoint’s key contribution is a novel algorithm that accurately computes the line of sight angle of arrival (AoA) and cyclic signal strength indicator (CSSI) of the target interfering signal at all APs, even when the line of sight (LoS) component is buried by stronger multipath components, interference and noise. PinPoint leverages this algorithm to design an optimization technique, which can localize interfering radios and simultaneously identify the type of interference. Unlike several localization techniques which require extensive pre-deployment calibration (e.g. RFFingerprinting), PinPoint requires very little calibration by the network administrator, and uses a novel algorithm to self-initialize its bearings, even if the locations of some AP are initially unknown and are oriented randomly. We implement PinPoint on WARP software radios and deploy in an indoor testbed spanning an entire floor of our department. We compare PinPoint with the best known prior RSSI [8, 11] and MUSIC-AoA based approaches and show that PinPoint achieves a median localization error of 0.97 meters, which is around three times lower compared to the RSSI [8, 11] and MUSIC-AoA based approaches.


Simultaneous Localization and Mapping for Forest Harvesters

A real-time SLAM (simultaneous localization and mapping) approach to harvester localization and tree map generation in forest environments is presented in this paper. The method combines 2D laser localization and mapping with GPS information to form global tree maps. Building an incremental map while also using it for localization is the only way a mobile robot can navigate in large outdoor environments. Until recently SLAM has only been confined to small-scale, mostly indoor, environments. We try to addresses the issues of scale for practical implementations of SLAM in extensive outdoor environments. Presented algorithms are tested in real outdoor environments using an all-terrain vehicle equipped with the navigation sensors and a DGPS receiver.


Platform Competition in Two-Sided Markets : The Case of Payment Networks

In this article, we construct a model to study competing payment networks, where networks offer differentiated products in terms of benefits to consumers and merchants. We study market equilibria for a variety of market structures: duopolistic competition and cartel, symmetric and asymmetric networks, and alternative assumptions about multihoming and consumer preferences. We find that competition unambiguously increases consumer and merchant welfare. We extend this analysis to competition among payment networks providing different payment instruments and find similar results. JEL Classifications: D43, G21, L13


Forecasting Intraday stock price trends with text mining techniques

In this paper, we describe NewsCATS (news categorization and trading system), a system implemented to predict stock price trends for the time immediately after the publication of press releases. NewsCATS consists mainly of three components. The first component retrieves relevant information from press releases through the application of text preprocessing techniques. The second component sorts the press releases into predefined categories. Finally, appropriate trading strategies are derived by the third component by means of the earlier categorization. The findings indicate that a categorization of press releases is able to provide additional information that can be used to forecast stock price trends, but that an adequate trading strategy is essential for the results of the categorization to be fully exploited.


Use alone or in Combination of Red and Infrared Laser in Skin Wounds.

A systematic review was conducted covering the action of red laser, infrared and combination of both, with emphasis on cutaneous wound therapy, showing the different settings on parameters such as fluency, power, energy density, time of application, frequency mode and even the type of low-power lasers and their wavelengths. It was observed that in general, the lasers brings good clinical and histological results mainly, but there is not a protocol that defines a dosage of use that has predictability of therapeutic success in repairing these wounds.


Ultra-stretchable and skin-mountable strain sensors using carbon nanotubes-Ecoflex nanocomposites.

Super-stretchable, skin-mountable, and ultra-soft strain sensors are presented by using carbon nanotube percolation network-silicone rubber nanocomposite thin films. The applicability of the strain sensors as epidermal electronic systems, in which mechanical compliance like human skin and high stretchability (ϵ > 100%) are required, has been explored. The sensitivity of the strain sensors can be tuned by the number density of the carbon nanotube percolation network. The strain sensors show excellent hysteresis performance at different strain levels and rates with high linearity and small drift. We found that the carbon nanotube-silicone rubber based strain sensors possess super-stretchability and high reliability for strains as large as 500%. The nanocomposite thin films exhibit high robustness and excellent resistance-strain dependency for over ~1380% mechanical strain. Finally, we performed skin motion detection by mounting the strain sensors on different parts of the body. The maximum induced strain by the bending of the finger, wrist, and elbow was measured to be ~ 42%, 45% and 63%, respectively.


Improv: A System for Scripting Interactive Actors in Virtual Worlds

Improv is a system for the creation of real−time behavior−based animated actors. There have been seve recent efforts to build network distributed autonomous agent But in general these efforts do not focus on the author’s view To create rich interactive worlds inhabited by believable animated actors, authors need the proper tools. Im prov provides tools to create actors that respond to users and each other in real−time, with personalities and mood consistent with the author’s goals and intentions. Improv consists of two subsystems. The first subsystem is an Animation Engine that uses procedur techniques to enable authors to create layered, continuo non−repetitive motions and smooth transitions between the The second subsystem is a Behavior Engine that enab authors to create sophisticated rules governing how acto communicate, change, and make decisions. The combin system provides an integrated set of tools for authoring th "minds" and "bodies" of interactive actors. The system uses a english−style scripting language so that creative experts wh are not primarily programmers can create powerful interactiv applications.


The EMOTE model for effort and shape

Human movements include limb gestures and postural attitude. Although many computer animation researchers have studied these classes of movements, procedurally generated movements still lack naturalness. We argue that looking only at the psychological notion of gesture is insufficient to capture movement qualities needed by animated charactes. We advocate that the domain of movement observation science, specifically Laban Movement Analysis (LMA) and its Effort and Shape components, provides us with valuable parameters for the form and execution of qualitative aspects of movements. Inspired by some tenets shared among LMA proponents, we also point out that Effort and Shape phrasing across movements and the engagement of the whole body are essential aspects to be considered in the search for naturalness in procedurally generated gestures. Finally, we present EMOTE (Expressive MOTion Engine), a 3D character animation system that applies Effort and Shape qualities to independently defined underlying movements and thereby generates more natural synthetic gestures.


An Application of Inverse Reinforcement Learning to Medical Records of Diabetes Treatment

It is an important issue to utilize large amount of medical records which are being accumulated on medical information systems to improve the quality of medical treatment. The process of medical treatment can be considered as a sequential interaction process between doctors and patients. From this viewpoint, we have been modeling medical records using Markov decision processes (MDPs). Using our model, we can simulate the future of each patient and evaluate each treatment. In order to do so, the reward function of the MDP should be specified. However, there is no explicit information regarding the reward value in medical records. In this study we report our results of applying an inverse reinforcement learning (IRL) algorithm to medical records of diabetes treatment to explore the reward function that doctors have in mind during their treatments.


Design of compact circular disc circularly polarized antenna with Koch curve fractal defected ground structure

A circularly polarized microstrip patch antenna with Koch curve fractal defected ground structure (DGS) for mobile applications is presented. Asymmetric `+' shape slots are incorporated on circular patch for getting circular polarization. The advantages of incorporation of Koch curve fractal DGS for improvement of performance parameters of circular polarized antenna presented. It is shown that with every progressive stage of fractal DGS iteration, in addition to reduction in size of the patch, other performance parameters of the antenna such as 3 dB axial ratio bandwidth, 10 dB impedance bandwidth and radiation efficiency also show significant improvement in their values at cost of marginal reduction of the gain. The design, evaluation and comparison of the proposed antenna with conventional simple circular disc circular polarized antenna without DGS along with intermediate and final iterations of Koch curve fractal DGS are illustrated.


Project Success Prediction in Crowdfunding Environments

Crowdfunding has gained widespread attention in recent years. Despite the huge success of crowdfunding platforms, the percentage of projects that succeed in achieving their desired goal amount is only around 40%. Moreover, many of these crowdfunding platforms follow "all-or-nothing" policy which means the pledged amount is collected only if the goal is reached within a certain predefined time duration. Hence, estimating the probability of success for a project is one of the most important research challenges in the crowdfunding domain. To predict the project success, there is a need for new prediction models that can potentially combine the power of both classification (which incorporate both successful and failed projects) and regression (for estimating the time for success). In this paper, we formulate the project success prediction as a survival analysis problem and apply the censored regression approach where one can perform regression in the presence of partial information. We rigorously study the project success time distribution of crowdfunding data and show that the logistic and log-logistic distributions are a natural choice for learning from such data. We investigate various censored regression models using comprehensive data of 18K Kickstarter (a popular crowdfunding platform) projects and 116K corresponding tweets collected from Twitter. We show that the models that take complete advantage of both the successful and failed projects during the training phase will perform significantly better at predicting the success of future projects compared to the ones that only use the successful projects. We provide a rigorous evaluation on many sets of relevant features and show that adding few temporal features that are obtained at the project's early stages can dramatically improve the performance.


Groute: An Asynchronous Multi-GPU Programming Model for Irregular Computations

Nodes with multiple GPUs are becoming the platform of choice for high-performance computing. However, most applications are written using bulk-synchronous programming models, which may not be optimal for irregular algorithms that benefit from low-latency, asynchronous communication. This paper proposes constructs for asynchronous multi-GPU programming, and describes their implementation in a thin runtime environment called Groute. Groute also implements common collective operations and distributed work-lists, enabling the development of irregular applications without substantial programming effort. We demonstrate that this approach achieves state-of-the-art performance and exhibits strong scaling for a suite of irregular applications on 8-GPU and heterogeneous systems, yielding over 7x speedup for some algorithms.


Microfabricated adhesive mimicking gecko foot-hair.

The amazing climbing ability of geckos has attracted the interest of philosophers and scientists alike for centuries. However, only in the past few years has progress been made in understanding the mechanism behind this ability, which relies on submicrometre keratin hairs covering the soles of geckos. Each hair produces a miniscule force approximately 10(-7) N (due to van der Waals and/or capillary interactions) but millions of hairs acting together create a formidable adhesion of approximately 10 N x cm(-2): sufficient to keep geckos firmly on their feet, even when upside down on a glass ceiling. It is very tempting to create a new type of adhesive by mimicking the gecko mechanism. Here we report on a prototype of such 'gecko tape' made by microfabrication of dense arrays of flexible plastic pillars, the geometry of which is optimized to ensure their collective adhesion. Our approach shows a way to manufacture self-cleaning, re-attachable dry adhesives, although problems related to their durability and mass production are yet to be resolved.


Adaptive Filtering for Color Image Sharpening and Denoising

Both tasks of sharpening and denoising color images are eternity problems for improving image quality. This paper proposes a filtering algorithm which brings a dramatic improvement in sharpening effects and reducing flat-area noises for natural color images. First, we generate a luminance slope map, which classifies a color image into the edge areas and the flat areas with uniform color. Second, the Gaussian derivative filter is applied to sharpening each segmented edge area. In order to keep color balance, the edge-sharpening filter is applied only to the luminance component of the color image. In the flat areas, a filter based on the SUSAN algorithm is applied to reducing the background noises with preserving sharpened edges. The performance of the proposed method is verified for natural image with Gaussian noise and impulse noise.


Algorithmic Trading Using Intelligent Agents

Trading in financial markets is undergoing a radical transformation, one in which algorithmic methods are becoming increasingly more important. The development of intelligent agents that can act as autonomous traders seems like a logical step forward in this “algorithms arms race”. In this paper we describe an infrastructure for implementing hybrid intelligent agents with the ability to trade financial instruments without requiring human supervision. We used this infrastructure, which relies heavily on artificial intelligence models and problem solving methodologies, to implement two currency trading agents. So far these agents have been able to profit from inefficiencies in the currency market, which lead us to believe our infrastructure can be of practical interest to the investment industry.


Neural Taylor Approximations: Convergence and Exploration in Rectifier Networks

Modern convolutional networks, incorporating rectifiers and max-pooling, are neither smooth nor convex; standard guarantees therefore do not apply. Nevertheless, methods from convex optimization such as gradient descent and Adam are widely used as building blocks for deep learning algorithms. This paper provides the first convergence guarantee applicable to modern convnets, which furthermore matches a lower bound for convex nonsmooth functions. The key technical tool is the neural Taylor approximation – a straightforward application of Taylor expansions to neural networks – and the associated Taylor loss. Experiments on a range of optimizers, layers, and tasks provide evidence that the analysis accurately captures the dynamics of neural optimization. The second half of the paper applies the Taylor approximation to isolate the main difficulty in training rectifier nets – that gradients are shattered – and investigates the hypothesis that, by exploring the space of activation configurations more thoroughly, adaptive optimizers such as RMSProp and Adam are able to converge to better solutions.


A Visual Analytics Approach for Understanding Reasons behind Snowballing and Comeback in MOBA Games

To design a successful Multiplayer Online Battle Arena (MOBA) game, the ratio of snowballing and comeback occurrences to all matches played must be maintained at a certain level to ensure its fairness and engagement. Although it is easy to identify these two types of occurrences, game developers often find it difficult to determine their causes and triggers with so many game design choices and game parameters involved. In addition, the huge amounts of MOBA game data are often heterogeneous, multi-dimensional and highly dynamic in terms of space and time, which poses special challenges for analysts. In this paper, we present a visual analytics system to help game designers find key events and game parameters resulting in snowballing or comeback occurrences in MOBA game data. We follow a user-centered design process developing the system with game analysts and testing with real data of a trial version MOBA game from NetEase Inc. We apply novel visualization techniques in conjunction with well-established ones to depict the evolution of players' positions, status and the occurrences of events. Our system can reveal players' strategies and performance throughout a single match and suggest patterns, e.g., specific player' actions and game events, that have led to the final occurrences. We further demonstrate a workflow of leveraging human analyzed patterns to improve the scalability and generality of match data analysis. Finally, we validate the usability of our system by proving the identified patterns are representative in snowballing or comeback matches in a one-month-long MOBA tournament dataset.


The neural basis of intuitive best next-move generation in board game experts.

The superior capability of cognitive experts largely depends on quick automatic processes. To reveal their neural bases, we used functional magnetic resonance imaging to study brain activity of professional and amateur players in a board game named shogi. We found two activations specific to professionals: one in the precuneus of the parietal lobe during perception of board patterns, and the other in the caudate nucleus of the basal ganglia during quick generation of the best next move. Activities at these two sites covaried in relevant tasks. These results suggest that the precuneus-caudate circuit implements the automatic, yet complicated, processes of board-pattern perception and next-move generation in board game experts.


Depression and memory impairment: a meta-analysis of the association, its pattern, and specificity.

The existing evidence paints an unclear picture of whether an association exists between depression and memory impairment. The purpose of this investigation was to determine whether depression is associated with memory impairment, whether moderator variables determine the extent of this association, and whether any obtained association is unique to depression. Meta-analytic techniques were used to synthesize data from 99 studies on recall and 48 studies on recognition in clinically depressed and nondepressed samples. Associations between memory impairment and other psychiatric disorders (e.g., schizophrenia, dementia) were also examined. A significant, stable association between depression and memory impairment was revealed. Further analyses indicated, however, that it is likely that depression is linked to particular aspects of memory, the linkage is found in particular subsets of depressed individuals, and memory impairment is not unique to depression.


Information Privacy Awareness (IPA): A Review of the Use, Definition and Measurement of IPA

Despite the acknowledged importance of awareness in the information privacy (IP) literature, we lack a consistent and thorough understanding of information privacy awareness (IPA). Drawing on Endsley’s model of Situation Awareness, we propose a multidimensional model of IPA and define each of its dimensions. We then conducted a thorough review of the IP literature’s use of awareness and synthesize our findings using our proposed model. This paper makes significant contributions by 1) distinguishing between IP knowledge, literacy and awareness 2) consolidating the IP literature’s definitions of awareness and providing a new detailed definition 3) proposing a new IPA model that future authors can reference when using or measuring IPA.


Detection and prevention system against cyber attacks and botnet malware for information systems and Internet of Things

The explosion of interconnected devices and the Internet of Things has triggered new important challenges in the area of internet security, due to the various device vulnerabilities and increased potential for cyber-attacks. This paper touches on the areas of Cybersecurity, intrusion detection, prevention systems and artificial intelligence. Our aim is to create a system capable of understanding, detecting and preventing malicious connections using applied concepts of machine learning. We emphasize the importance of selecting and extracting features that can lead to an accurate decision of classification for malware and intrusion attacks. We propose a solution that combines features that extract correlations from the packet history for the same and different services and hosts, based on the rate of REJ, SYN and ACK flags and connection states, with HTTP features extracted from URI and RESTful methods. Our proposed solution is able to detect network intrusions and botnet communications with a precision of 98.4% on the binary classification problem.


Umbrella wheel — A stair-climbing and obstacle-handling wheel design concept

This paper proposes a new design for stair-climbing using a wheel that can split into segments and walk up stairs or surmount other obstacles often found where humans traverse, while still being able to retain a perfectly round shape for traveling on smooth ground. Using this change of configuration, staircases with a wide range of dimensions can be covered efficiently and safely. The design, named Umbrella Wheel, can consist of as many wheel segments as desired, and as few as two. A smaller or higher number of wheel segments has advantages and disadvantages depending on the specific situation. Modeling the trajectory of the wheel when as it ascends or descends stairs is given and the results are analyzed.


ERP Projects: Key Success Factors and Risk of Failure A Proposed Model of Governance of Enterprise Resource Planning

The ERP (Enterprise Resource Planning) is a major innovation in the Field of Information Systems and Organization Management. Including their ability to make the organization more integrated and consistent, and absolute control of information. But the implementation of these projects remains a disturbing adventure that may lead to success or deadly failure of the organization that is embarking on this project. The aims of this article are to determine the necessary critical success factors for the ERP and causes of failures,through a comparative study of large organizations that have adopted ERP , for addressing the convergence and divergence points in implementation ERP. Such a study will allow us to develop a governance model for ERP


Cross-View People Tracking by Scene-Centered Spatio-Temporal Parsing

In this paper, we propose a Spatio-temporal Attributed Parse Graph (ST-APG) to integrate semantic attributes with trajectories for cross-view people tracking. Given videos from multiple cameras with overlapping field of view (FOV), our goal is to parse the videos and organize the trajectories of all targets into a scene-centered representation. We leverage rich semantic attributes of human, e.g., facing directions, postures and actions, to enhance cross-view tracklet associations, besides frequently used appearance and geometry features in the literature. In particular, the facing direction of a human in 3D, once detected, often coincides with his/her moving direction or trajectory. Similarly, the actions of humans, once recognized, provide strong cues for distinguishing one subject from the others. The inference is solved by iteratively grouping tracklets with cluster sampling and estimating people semantic attributes by dynamic programming. In experiments, we validate our method on one public dataset and create another new dataset that records people’s daily life in public, e.g., food court, office reception and plaza, each of which includes 3-4 cameras. We evaluate the proposed method on these challenging videos and achieve promising multi-view tracking results.


SPARK: A New VANET-Based Smart Parking Scheme for Large Parking Lots

Searching for a vacant parking space in a congested area or a large parking lot and preventing auto theft are major concerns to our daily lives. In this paper, we propose a new smart parking scheme for large parking lots through vehicular communication. The proposed scheme can provide the drivers with real-time parking navigation service, intelligent antitheft protection, and friendly parking information dissemination. Performance analysis via extensive simulations demonstrates its efficiency and practicality. Keywords— Vehicular communications; smart parking; navigation; anti-theft; information dissemination; security & privacy


Time-of-Flight Sensors in Computer Graphics

A growing number of applications depend on accurate and fast 3D scene analysis. Examples are model and lightfield acquisition, collision prevention, mixed reality, and gesture recognition. The estimation of a range map by image analysis or laser scan techniques is still a time-consuming and expensive part of such systems. A lower-priced, fast and robust alternative for distance measurements are Time-of-Flight (ToF) cameras. Recently, significant advances have been made in producing low-cost and compact ToF-devices, which have the potential to revolutionize many fields of research, including Computer Graphics, Computer Vision and Human Machine Interaction (HMI). These technologies are starting to have an impact on research and commercial applications. The upcoming generation of ToF sensors, however, will be even more powerful and will have the potential to become “ubiquitous real-time geometry devices” for gaming, web-conferencing, and numerous other applications. This STAR gives an account of recent developments in ToF-technology and discusses the current state of the integration of this technology into various graphics-related applications.


WCP-RNN: a novel RNN-based approach for Bio-NER in Chinese EMRs

Deep learning has achieved remarkable success in a wide range of domains. However, it has not been comprehensively evaluated as a solution for the task of Chinese biomedical named entity recognition (Bio-NER). The traditional deep-learning approach for the Bio-NER task is usually based on the structure of recurrent neural networks (RNN) and only takes word embeddings into consideration, ignoring the value of character-level embeddings to encode the morphological and shape information. We propose an RNN-based approach, WCP-RNN, for the Chinese Bio-NER problem. Our method combines word embeddings and character embeddings to capture orthographic and lexicosemantic features. In addition, POS tags are involved as a priori word information to improve the final performance. The experimental results show our proposed approach outperforms the baseline method; the highest F-scores for subject and lesion detection tasks reach 90.36 and 90.48% with an increase of 3.10 and 2.60% compared with the baseline methods, respectively.


Exploiting Matrix Dependency for Efficient Distributed Matrix Computation

Distributed matrix computation is a popular approach for many large-scale data analysis and machine learning tasks. However existing distributed matrix computation systems generally incur heavy communication cost during the runtime, which degrades the overall performance. In this paper, we propose a novel matrix computation system, named DMac, which exploits the matrix dependencies in matrix programs for efficient matrix computation in the distributed environment. We decompose each matrix program into a sequence of operations, and reveal the matrix dependencies between operations in the program. We next design a dependency-oriented cost model to select an optimal execution strategy for each operation, and generate a communication efficient execution plan for the matrix computation program. To facilitate the matrix computation in distributed systems, we further divide the execution plan into multiple un-interleaved stages which can run in a distributed cluster with efficient local execution strategy on each worker. The DMac system has been implemented on a popular general-purpose data processing framework, Spark. The experimental results demonstrate that our techniques can significantly improve the performance of a wide range of matrix programs.


A di/dt Feedback-Based Active Gate Driver for Smart Switching and Fast Overcurrent Protection of IGBT Modules

This paper presents an active gate driver (AGD) for IGBT modules to improve their overall performance under normal condition as well as fault condition. Specifically, during normal switching transients, a di/dt feedback controlled current source and current sink is introduced together with a push-pull buffer for dynamic gate current control. Compared to a conventional gate drive strategy, the proposed one has the capability of reducing the switching loss, delay time, and Miller plateau duration during turn-on and turn-off transient without sacrificing current and voltage stress. Under overcurrent condition, it provides a fast protection function for IGBT modules based on the evaluation of fault current level through the di/dt feedback signal. Moreover, the AGD features flexible protection modes, which overcomes the interruption of converter operation in the event of momentary short circuits. A step-down converter is built to evaluate the performance of the proposed driving schemes under various conditions, considering variation of turn-on/off gate resistance, current levels, and short-circuit fault types. Experimental results and detailed analysis are presented to verify the feasibility of the proposed approach.


High Switching Performance of 1700-V, 50-A SiC Power MOSFET Over Si IGBT/BiMOSFET for Advanced Power Conversion Applications

Due to wider band gap of silicon carbide (SiC) compared to silicon (Si), MOSFET made in SiC has considerably lower drift region resistance, which is a significant resistive component in high-voltage power devices. With low on-state resistance and its inherently low switching loss, SiC MOSFETs can offer much improved efficiency and compact size for the converter compared to those using Si devices. In this paper, we report switching performance of a new 1700-V, 50-A SiC MOSFET designed and developed by Cree, Inc. Hard-switching losses of the SiC MOSFETs with different circuit parameters and operating conditions are measured and compared with the 1700-V Si BiMOSFET and 1700-V Si IGBT, using same test set-up. Based on switching and conduction losses, the operating boundary of output power and switching frequency of these devices are found out in a dc-dc boost converter and compared. The switching dv/dts and di/dts of SiC MOSFET are captured and discussed in the perspective of converter design. To validate the continuous operation, three dc-dc boost converters using these devices, are designed and tested at 10 kW of power with 1 kV of output voltage and 10 kHz of switching frequency. 1700V SiC Schottky diode is used as the blocking diode in each case. Corresponding converter efficiencies are evaluated and the junction temperature of each device is estimated. To demonstrate high switching frequency operation, the SiC MOSFET is switched upto 150 kHz within permissible junction temperature rise. A switch combination of the 1700-V SiC MOSFET and 1700-V SiC Schottky diode connected in series is also evaluated for zero voltage switching turn-ON behavior and compared with those of bipolar Si devices. Results show substantial power loss saving with the use of SiC MOSFET.


Turn-on Performance of Reverse Blocking IGBT (RB IGBT) and Optimization Using Advanced Gate Driver

Turn-on performance of a reverse blocking insulated gate bipolar transistor (RB IGBT) is discussed in this paper. The RB IGBT is a specially designed IGBT having ability to sustain blocking voltage of both the polarities. Such a switch shows superior conduction but much worst switching (turn- on) performances compared to a combination of an ordinary IGBT and blocking diode. Because of that, optimization of the switching performance is a key issue that makes the RB IGB not well accepted in the real applications. In this paper, the RB IGBT turn-on losses and reverse recovery current are analyzed for different gate driver techniques, and a new gate driver is proposed. Commonly used conventional gate drivers do not have capability for the switching dynamics optimization. In contrast to this, the new proposed gate driver provides robust and simple way to control and optimize the reverse recovery current and turn-on losses. The collector current slope and reverse recovery current are controlled by the means of the gate emitter voltage control in feedforward manner. In addition, the collector emitter voltage slope is controlled during the voltage falling phase by the means of inherent increase of the gate current. Therefore, the collector emitter voltage tail and the total turn- on losses are reduced, independently on the reverse recovery current. The proposed gate driver was experimentally verified and the results presented and discussed.


High performance active gate drive for high power IGBTs

This paper deals with an active gate drive (AGD) technology for high power IGBTs. It is based on an optimal combination of several requirements necessary for good switching performance under hard switching conditions. The scheme specifically combines together the slow drive requirements for low noise and switching stress and the fast drive requirements for high speed switching and low switching energy loss. The gate drive can also effectively dampen oscillations during low current turn-on transients in the IGBT. This paper looks at the conflicting requirements of the conventional gate drive circuit design and demonstrates, using experimental results, that the proposed three-stage active gate drive technique can be an effective solution.


A Novel Driving and Protection Circuit for Reverse-Blocking IGBT Used in Matrix Converter

A novel drive and protection circuit for reverse-blocking insulated gate bipolar transistor (RB-IGBT) is proposed in this paper. For the drive circuit, a dynamic current source is introduced to reduce the turn-on and turn-off transients. Meanwhile, the di/dt of the collector current and the dv/dt of the collector-emitter voltage are strictly restricted, so do the respective stresses. The drive circuit consists of a conventional push-pull driver and two controllable current sources-a current generator and a current sink. These two current sources work in switching transitions. For the protection circuit, a novel collector current detecting circuit suitable for RB-IGBT is proposed. This method detects the collector current by sensing collector-emitter voltage of the device. Further study shows that this method can be used to acquire the current signs in commutation transitions of matrix converter. A series of experiments has been carried out concerning the proposed drive and protection circuit and the experimental setup; results as well as detailed analysis are presented


EL-GAN: Embedding Loss Driven Generative Adversarial Networks for Lane Detection

Convolutional neural networks have been successfully applied to semantic segmentation problems. However, there are many problems that are inherently not pixel-wise classification problems but are nevertheless frequently formulated as semantic segmentation. This ill-posed formulation consequently necessitates hand-crafted scenario-specific and computationally expensive post-processing methods to convert the per pixel probability maps to final desired outputs. Generative adversarial networks (GANs) can be used to make the semantic segmentation network output to be more realistic or better structure-preserving, decreasing the dependency on potentially complex post-processing. In this work, we propose EL-GAN: a GAN framework to mitigate the discussed problem using an embedding loss. With EL-GAN, we discriminate based on learned embeddings of both the labels and the prediction at the same time. This results in much more stable training due to having better discriminative information, benefiting from seeing both ‘fake’ and ‘real’ predictions at the same time. This substantially stabilizes the adversarial training process. We use the TuSimple lane marking challenge to demonstrate that with our proposed framework it is viable to overcome the inherent anomalies of posing it as a semantic segmentation problem. Not only is the output considerably more similar to the labels when compared to conventional methods, the subsequent post-processing is also simpler and crosses the competitive 96% accuracy threshold.


A single nutrient feed supports both chemically defined NS0 and CHO fed-batch processes: Improved productivity and lactate metabolism.

A chemically defined nutrient feed (CDF) coupled with basal medium preloading was developed to replace a hydrolysate-containing feed (HCF) for a fed-batch NS0 process. The CDF not only enabled a completely chemically defined process but also increased recombinant monoclonal antibody titer by 115%. Subsequent tests of CDF in a CHO process indicated that it could also replace the hydrolysate-containing nutrient feed in this expression system as well as providing an 80% increase in product titer. In both CDF NS0 and CHO processes, the peak lactate concentrations were lower and, more interestingly, lactate metabolism shifted markedly from net production to net consumption when cells transitioned from exponential to stationary growth phase. Subsequent investigations of the lactate metabolic shift in the CHO CDF process were carried out to identify the cause(s) of the metabolic shift. These investigations revealed several metabolic features of the CHO cell line that we studied. First, glucose consumption and lactate consumption are strictly complementary to each other. The combined cell specific glucose and lactate consumption rate was a constant across exponential and stationary growth phases. Second, Lactate dehydrogenase (LDH) activity fluctuated during the fed-batch process. LDH activity was at the lowest when lactate concentration started to decrease. Third, a steep cross plasma membrane glucose gradient exists. Intracellular glucose concentration was more than two orders of magnitude lower than that in the medium. Fourth, a large quantity of citrate was diverted out of mitochondria to the medium, suggesting a partially truncated tricarboxylic acid (TCA) cycle in CHO cells. Finally, other intermediates in or linked to the glycolytic pathway and the TCA cycle, which include alanine, citrate, isocitrate, and succinate, demonstrated a metabolic shift similar to that of lactate. Interestingly, all these metabolites are either in or linked to the pathway downstream of pyruvate, but upstream of fumarate in glucose metabolism. Although the specific mechanisms for the metabolic shift of lactate and other metabolites remain to be elucidated, the increased understanding of the metabolism of CHO cultures could lead to future improvements in medium and process development.


Learning to Pinpoint Singing Voice from Weakly Labeled Examples

Building an instrument detector usually requires temporally accurate ground truth that is expensive to create. However, song-wise information on the presence of instruments is often easily available. In this work, we investigate how well we can train a singing voice detection system merely from song-wise annotations of vocal presence. Using convolutional neural networks, multipleinstance learning and saliency maps, we can not only detect singing voice in a test signal with a temporal accuracy close to the state-of-the-art, but also localize the spectral bins with precision and recall close to a recent source separation method. Our recipe may provide a basis for other sequence labeling tasks, for improving source separation or for inspecting neural networks trained on auditory spectrograms.


High-Dimensional Single-Cell Mapping of Central Nervous System Immune Cells Reveals Distinct Myeloid Subsets in Health, Aging, and Disease.

Individual reports suggest that the central nervous system (CNS) contains multiple immune cell types with diverse roles in tissue homeostasis, immune defense, and neurological diseases. It has been challenging to map leukocytes across the entire brain, and in particular in pathology, where phenotypic changes and influx of blood-derived cells prevent a clear distinction between reactive leukocyte populations. Here, we applied high-dimensional single-cell mass and fluorescence cytometry, in parallel with genetic fate mapping systems, to identify, locate, and characterize multiple distinct immune populations within the mammalian CNS. Using this approach, we revealed that microglia, several subsets of border-associated macrophages and dendritic cells coexist in the CNS at steady state and exhibit disease-specific transformations in the immune microenvironment during aging and in models of Alzheimer's disease and multiple sclerosis. Together, these data and the described framework provide a resource for the study of disease mechanisms, potential biomarkers, and therapeutic targets in CNS disease.