Studying Online Social Networks

What is Social Network Analysis? The Social Network Approach Units of Analysis Relations Ties Multiplexity Composition Beyond the Tie Social Networks Two Views: Ego-Centered and Whole Networks Network Characteristics Partitioning Networks Groups STUDYING ONLINE SOCIAL NETWORKS, by Laura Garton... http://jcmc.indiana.edu/vol3/issue1/garton.html 1 of 32 9/21/11 11:24 AM Positional Analysis Networks of Networks Placing CMC in Context Collecting Network Data for CMC Studies Selecting a Sample Collecting Data How are Network Data Analyzed? Ego-Centered Analysis Whole Network Analysis Conclusions References About the Authors


MAPLSC: A novel multi-class classifier for medical diagnosis

Analysis of clinical records contributes to the Traditional Chinese Medicine (TCM) experience expansion and techniques promotion. More than two diagnostic classes (diagnostic syndromes) in the clinical records raise a popular data mining problem: multi-value classification. In this paper, we propose a novel multi-class classifier, named Multiple Asymmetric Partial Least Squares Classifier (MAPLSC). MAPLSC attempts to be robust facing imbalanced data distribution in the multi-value classification. Elaborated comparisons with other seven state-of-the-art methods on two TCM clinical datasets and four public microarray datasets demonstrate MAPLSC's remarkable improvements.


Template-Based Information Extraction without the Templates

Standard algorithms for template-based information extraction (IE) require predefined template schemas, and often labeled data, to learn to extract their slot fillers (e.g., an embassy is the Target of a Bombing template). This paper describes an approach to template-based IE that removes this requirement and performs extraction without knowing the template structure in advance. Our algorithm instead learns the template structure automatically from raw text, inducing template schemas as sets of linked events (e.g., bombings include detonate, set off, and destroy events) associated with semantic roles. We also solve the standard IE task, using the induced syntactic patterns to extract role fillers from specific documents. We evaluate on the MUC-4 terrorism dataset and show that we induce template structure very similar to handcreated gold structure, and we extract role fillers with an F1 score of .40, approaching the performance of algorithms that require full knowledge of the templates.


Emerging Trends in Smart Home Security, Privacy, and Digital Forensics

Technology integration is becoming an impetus to everyday lives. This new interconnected world can be found from our most private spaces to the public ones. Smart homes, which is the use of Internet of Things (IoT) within a home, has become the utmost concern in the security and privacy domain. In this paper, we review the current literature from both research and practice and offer five research trends for security and privacy in smart homes: potential for remote security breaches, risks for smart home devices, privacy violations, infrastructure vulnerabilities, and digital forensics challenges. We integrated these five trends in a conceptual model showcasing their roles in the rapidly changing IoT landscape. Combining the trends and smart forensics, we elucidate the bimodal lenses in security and privacy: preventive and investigative. These discussions offer research directions and practitioners’ implications for further development of a safe and secured smart home.


COA: finding novel patents through text analysis

In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge discovery in patent data. One important task in this regard is to employ data mining techniques to rank patents in terms of their potential to earn money through licensing. Availability of such ranking can substantially reduce enterprise IP (Intellectual Property) management costs. Unfortunately, the existing software systems in the IP domain do not address this task directly. Through our research, we build a patent ranking software, named COA (Claim Originality Analysis) that rates a patent based on its value by measuring the recency and the impact of the important phrases that appear in the "claims" section of a patent. Experiments show that COA produces meaningful ranking when comparing it with other indirect patent evaluation metrics--citation count, patent status, and attorney's rating. In reallife settings, this tool was used by beta-testers in the IBM IP department. Lawyers found it very useful in patent rating, specifically, in highlighting potentially valuable patents in a patent cluster. In this article, we describe the ranking techniques and system architecture of COA. We also present the results that validate its effectiveness.


Honey: A Biologic Wound Dressing.

Honey has been used as a wound dressing for thousands of years, but only in more recent times has a scientific explanation become available for its effectiveness. It is now realized that honey is a biologic wound dressing with multiple bioactivities that work in concert to expedite the healing process. The physical properties of honey also expedite the healing process: its acidity increases the release of oxygen from hemoglobin thereby making the wound environment less favorable for the activity of destructive proteases, and the high osmolarity of honey draws fluid out of the wound bed to create an outflow of lymph as occurs with negative pressure wound therapy. Honey has a broad-spectrum antibacterial activity, but there is much variation in potency between different honeys. There are 2 types of antibacterial activity. In most honeys the activity is due to hydrogen peroxide, but much of this is inactivated by the enzyme catalase that is present in blood, serum, and wound tissues. In manuka honey, the activity is due to methylglyoxal which is not inactivated. The manuka honey used in wound-care products can withstand dilution with substantial amounts of wound exudate and still maintain enough activity to inhibit the growth of bacteria. There is good evidence for honey also having bioactivities that stimulate the immune response (thus promoting the growth of tissues for wound repair), suppress inflammation, and bring about rapid autolytic debridement. There is clinical evidence for these actions, and research is providing scientific explanations for them.


Fast Component-Based QR Code Detection in Arbitrarily Acquired Images

Quick Response (QR) codes are a type of 2D barcode that is becoming very popular, with several application possibilities. Since they can encode alphanumeric characters, a rich set of information can be made available through encoded URL addresses. In particular, QR codes could be used to aid visually impaired and blind people to access web based voice information systems and services, and autonomous robots to acquire context-relevant information. However, in order to be decoded, QR codes need to be properly framed, something that robots, visually impaired and blind people will not be able to do easily without guidance. Therefore, any application that aims assisting robots or visually impaired people must have the capability to detect QR codes and guide them to properly frame the code. A fast component-based two-stage approach for detecting QR codes in arbitrarily acquired images is proposed in this work. In the first stage, regular components present at three corners of the code are detected, and in the second stage geometrical restrictions among detected components are verified to confirm the presence of a code. Experimental results show a high detection rate, superior to 90 %, at a fast speed compatible with real-time applications.


Detection and Analysis of 2016 US Presidential Election Related Rumors on Twitter

The 2016 U.S. presidential election has witnessed the major role of Twitter in the year’s most important political event. Candidates used this social media platform extensively for online campaigns. Meanwhile, social media has been filled with rumors, which might have had huge impacts on voters’ decisions. In this paper, we present a thorough analysis of rumor tweets from the followers of two presidential candidates: Hillary Clinton and Donald Trump. To overcome the difficulty of labeling a large amount of tweets as training data, we detect rumor tweets by matching them with verified rumor articles. We analyze over 8 million tweets collected from the followers of the two candidates. Our results provide answers to several primary concerns about rumors in this election, including: which side of the followers posted the most rumors, who posted these rumors, what rumors they posted, and when they posted these rumors. The insights of this paper can help us understand the online rumor behaviors in American politics.


Static hand gesture recognition based on HOG characters and support vector machines

Gesture recognition technology has important significance in the field of human-computer interaction (HCI), the gesture recognition technology which is based on visual is sensitive to the impact of the experimental environment lighting, and so, the recognition result will produce a greater change; it makes this technology one of the most challenging topics. HOG feature which is successfully applied to pedestrian detection is operating on the local grid unit of image, so it can maintain a good invariance on geometric and optical deformation. In this paper, we extracted the gradient direction histogram (HOG) features of gestures, then, a Support Vector Machines is used to train these feature vectors, at testing time, a decision is taken using the previously learned SVMs, and compared the same gesture recognition rate in different light conditions. Experimental results show that the HOG feature extraction and multivariate SVM classification methods has a high recognition rate, and the system has a better robustness for the illumination.


A Surface-Growing Approach to Multi-View Stereo Reconstruction

We present a new approach to reconstruct the shape of a 3D object or scene from a set of calibrated images. The central idea of our method is to combine the topological flexibility of a point-based geometry representation with the robust reconstruction properties of scene-aligned planar primitives. This can be achieved by approximating the shape with a set of surface elements (surfels) in the form of planar disks which are independently fitted such that their footprint in the input images matches. Instead of using an artificial energy functional to promote the smoothness of the recovered surface during fitting, we use the smoothness assumption only to initialize planar primitives and to check the feasibility of the fitting result. After an initial disk has been found, the recovered region is iteratively expanded by growing further disks in tangent direction. The expansion stops when a disk rotates by more than a given threshold during the fitting step. A global sampling strategy guarantees that eventually the whole surface is covered. Our technique does not depend on a shape prior or silhouette information for the initialization and it can automatically and simultaneously recover the geometry, topology, and visibility information which makes it superior to other state-of-the-art techniques. We demonstrate with several high-quality reconstruction examples that our algorithm performs highly robustly and is tolerant to a wide range of image capture modalities.


Neural evidence for the interplay between language, gesture, and action: A review

Co-speech gestures embody a form of manual action that is tightly coupled to the language system. As such, the co-occurrence of speech and co-speech gestures is an excellent example of the interplay between language and action. There are, however, other ways in which language and action can be thought of as closely related. In this paper we will give an overview of studies in cognitive neuroscience that examine the neural underpinnings of links between language and action. Topics include neurocognitive studies of motor representations of speech sounds, action-related language, sign language and co-speech gestures. It will be concluded that there is strong evidence on the interaction between speech and gestures in the brain. This interaction however shares general properties with other domains in which there is interplay between language and action.


Rubinstein Taybi Syndrome in an Indian Child due to EP300 Gene Mutation.

To the Editor : A 10-y-old girl was diagnosed with Rubinstein Taybi Syndrome (RTS) based on distinctive facial features (low hanging columella, high palate, grimacing smile, talon cusps), broad, angulated thumbs and great toes, short stature and moderate intellectual disability (Fig. 1). Her younger sister, who died at 11 mo of age due to acute myeloid leukemia, did not have clinical features of RTS. Complete sequencing of CREBBP and EP300 genes was done for the proband as previously described [1, 2]. No pathogenic mutation was noted in CREBBP gene. She was found to be heterozygous for c.1282C > T or p.P428S mutation in exon five of EP300 gene (Fig. 1). The mutation is predicted to affect the donor splicing [3]. The patient’s mother was heterozygous for the same mutation. Prenatal diagnosis was offered to the couple and the fetus did not carry this mutation, and was confirmed to be unaffected postnatally. This mutation was not identified in 100 normal unrelated individuals. Deletion/duplication analysis of CREBBP and EP300 gene was not available. Our patient had horizontal palpebral fissures as described with EP300 related RTS, compared with CREBBP related RTS, who have anti-mongoloid slant [4]. Although patients with EP300 mutation have broad thumbs or toes, radial deviation has not been reported [2] (Fig. 1). This mutation was inherited from her mother who had mild hypertelorism, broad nasal bridge, normal intelligence and hands/feet. Negri et al. reported a patient with mutation in EP300 gene (p.N1511T) that was inherited from a healthy mother. Low penetrance in EP300 related RTS may present a challenge during genetic counseling and prenatal diagnosis [2]. EP300 gene somatic mutations are reported in acute leukemia and RTS patients have an increased incidence of cancer [2, 5]. Thus, we report an Indian child with Rubinstein Taybi Syndrome with familial EP300 gene mutation.


Optimized Edge Detection Algorithm for Face Recognition

Face recognition is one of the most challenging tasks in the field of image processing. This paper presents an optimized edge detection algorithm for the task of face recognition. In this method a gradient based filter using a wide convolution kernel is applied on the image to extract the edges. Later a thinning algorithm optimized for the wide convolution kernel is applied on the extracted edges. The advantages of this method over other gradient based methods is its ability to find the missing edges more successfully and boost the significant edges of the overall facial contour.


Modeling and control strategy for the transition of a convertible tail-sitter UAV

This paper addresses the problem of the transition between rotary-wing and fixed-wing flight of a tail-sitter unmanned aerial vehicle (UAV). A nonlinear control design is presented to regulate the vertical-flight dynamics of the vehicle. We present the dynamic and aerodynamic equations that model the behavior of the vehicle before (vertical flight), during and after (forward flight) the transition. A low-cost embedded system, including an homemade inertial measurement unit (IMU), is used to perform autonomous attitude-stabilized flight in vertical mode.


Towards Knowledge-Driven Annotation

While the Web of data is attracting increasing interest and rapidly growing in size, the major support of information on the surface Web are still multimedia documents. Semantic annotation of texts is one of the main processes that are intended to facilitate meaning-based information exchange between computational agents. However, such annotation faces several challenges such as the heterogeneity of natural language expressions, the heterogeneity of documents structure and context dependencies. While a broad range of annotation approaches rely mainly or partly on the target textual context to disambiguate the extracted entities, in this paper we present an approach that relies mainly on formalized-knowledge expressed in RDF datasets to categorize and disambiguate noun phrases. In the proposed method, we represent the reference knowledge bases as co-occurrence matrices and the disambiguation problem as a 0-1 Integer Linear Programming (ILP) problem. The proposed approach is unsupervised and can be ported to any RDF knowledge base. The system implementing this approach, called KODA, shows very promising results w.r.t. state-of-the-art annotation tools in cross-domain experimentations.


Time - motion analysis of professional rugby union players during match-play.

The aim of this study was to quantify the movement patterns of various playing positions during professional rugby union match-play, such that the relative importance of aerobic and anaerobic energy pathways to performance could be estimated. Video analysis was conducted of individual players (n=29) from the Otago Highlanders during six "Super 12" representative fixtures. Each movement was coded as one of six speeds of locomotion (standing still, walking, jogging, cruising, sprinting, and utility), three states of non-running intensive exertion (rucking/mauling, tackling, and scrummaging), and three discrete activities (kicking, jumping, passing). The results indicated significant demands on all energy systems in all playing positions, yet implied a greater reliance on anaerobic glycolytic metabolism in forwards, due primarily to their regular involvement in non-running intense activities such as rucking, mauling, scrummaging, and tackling. Positional group comparisons indicated that while the greatest differences existed between forwards and backs, each positional group had its own unique demands. Front row forwards were mostly involved in activities involving gaining/retaining possession, back row forwards tended to play more of a pseudo back-line role, performing less rucking/mauling than front row forwards, yet being more involved in aspects of broken play such as sprinting and tackling. While outside backs tended to specialize in the running aspects of play, inside backs tended to show greater involvement in confrontational aspects of play such as rucking/mauling and tackling. These results suggest that rugby training and fitness testing should be tailored specifically to positional groups rather than simply differentiating between forwards and backs.


The motivations and experiences of the on-demand mobile workforce

On-demand mobile workforce applications match physical world tasks and willing workers. These systems offer to help conserve resources, streamline courses of action, and increase market efficiency for micro- and mid-level tasks, from verifying the existence of a pothole to walking a neighbor's dog. This study reports on the motivations and experiences of individuals who regularly complete physical world tasks posted in on-demand mobile workforce marketplaces. Data collection included semi-structured interviews with members (workers) of two different services. The analysis revealed the main drivers for participating in an on-demand mobile workforce, including desires for monetary compensation and control over schedules and task selection. We also reveal main reasons for task selection, which involve situational factors, convenient physical locations, and task requester profile information. Finally, we discuss the key characteristics of the most worthwhile tasks and offer implications for novel crowdsourcing systems for physical world tasks.


Properties of cutaneous mechanoreceptors in the human hand-related to touch sensation

Recordings from single peripheral nerve fibres made it possible to analyse the functional properties of tactile afferent units supplying the glabrous skin of the human hand and to assess directly the relation between impulse discharge and perceptive experiences. The 17,000 tactile units in this skin area of the human hand are of four different types: two fast adapting types, FA I and FA I1 (formerly RA and PC), and two slowly adapting types, SA I and SA 11. The receptive field characteristics and the densities in the skin of the type I units (FA I and SA I) indicate that these account for the detailed spatial resolution that is of paramount importance for the motor skill and the explorative role of the hand. The relationship between the stimulus amplitude and perceived intensity during sustained skin indentations did not match the corresponding stimulus response functions of SA units suggesting non-linear transformations within the central nervous system. These transformations, in turn, appear to vary between subjects. A single impulse in a single FA I unit may be felt when originating from the most important tactile regions of the hand, indicating that the psychophysical detection may be set by the threshold of the sense organs. Moreover, no significant noise seems to be superimposed in the respective central sensory pathways.


A functional imaging study of translation and language switching.

The neural systems underlying translation and language switching were investigated using PET. Proficient German-English adult bilinguals were scanned whilst either translating or reading visually presented words in German (L1), English (L2) or alternating L1/L2. We refer to alternating L1/L2 as 'switching'. The results revealed contrasting patterns of activation for translation and switching, suggesting at least partially independent mechanisms. Translation, but not switching, increased activity in the anterior cingulate and subcortical structures whilst decreasing activation in several other temporal and parietal language areas associated with the meaning of words. Translation also increased activation in regions associated with articulation (the anterior insula, cerebellum and supplementary motor area) arguably because the reading response to the stimulus must be inhibited whilst a response in a different language is activated. In contrast, switching the input language resulted in activation of Broca's area and the supramarginal gyri, areas associated with phonological recoding. The results are discussed in terms of the cognitive control of language processes.


The comparability of measurements of attitudes toward immigration in the European Social Survey : exact versus approximate measurement equivalence

International survey datasets are analyzed with increasing frequency to investigate and compare attitudes toward immigration and to examine the contextual factors that shape these attitudes. However, international comparisons of abstract, psychological constructs require the measurements to be equivalent–i.e., they should measure the same concept on the same measurement scale. Traditional approaches to assessing measurement equivalence quite often lead to the conclusion that measurements are cross-nationally incomparable but have been criticized for being overly strict. In the current study, we present an alternative Bayesian approach that assesses whether measurements are approximately (rather than exactly) equivalent. This approach allows small variations in measurement parameters across groups. Taking a multiple group confirmatory factor analysis framework as a starting point, this study applies approximate and exact equivalence tests to the anti-immigration attitudes scale that was implemented in the European Social Survey (ESS). Measurement equivalence is tested across the full set of 271,220 individuals in 35 ESS countries over six rounds. The results of the exact and the approximate approaches are quite different. Approximate scalar measurement equivalence is established in all ESS rounds, thus allowing researchers to meaningfully compare these mean scores and their relationships with other theoretical constructs of interest. The exact approach, however, eventually proves to be overly strict and leads to the conclusion that measurements are incomparable for a large number of countries and time points. DOI: https://doi.org/10.1093/poq/nfv008 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-110767 Published Version Originally published at: Davidov, Eldad; Cieciuch, Jan; Meuleman, Bart; Schmidt, Peter; Algesheimer, René; Hausherr, Mirjam (2015). The comparability of measurements of attitudes toward immigration in the European Social Survey: exact versus approximate measurement equivalence. Public Opinion Quarterly, 79(S1):244-266. DOI: https://doi.org/10.1093/poq/nfv008 © The Author 2015. Published by Oxford University Press on behalf of the American Association for Public Opinion Research. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com THE COMPARABILITY OF MEASUREMENTS OF ATTITUDES TOWARD IMMIGRATION IN THE EUROPEAN SOCIAL SURVEY EXACT VERSUS APPROXIMATE MEASUREMENT EQUIVALENCE


Mining Invariants from Console Logs for System Problem Detection

Detecting execution anomalies is very important to the maintenance and monitoring of large-scale distributed systems. People often use console logs that are produced by distributed systems for troubleshooting and problem diagnosis. However, manually inspecting console logs for the detection of anomalies is unfeasible due to the increasing scale and complexity of distributed systems. Therefore, there is great demand for automatic anomaly detection techniques based on log analysis. In this paper, we propose an unstructured log analysis technique for anomaly detection, with a novel algorithm to automatically discover program invariants in logs. At first, a log parser is used to convert the unstructured logs to structured logs. Then, the structured log messages are further grouped to log message groups according to the relationship among log parameters. After that, the program invariants are automatically mined from the log message groups. The mined invariants can reveal the inherent linear characteristics of program work flows. With these learned invariants, our technique can automatically detect anomalies in logs. Experiments on Hadoop show that the technique can effectively detect execution anomalies. Compared with the state of art, our approach can not only detect numerous real problems with high accuracy but also provide intuitive insight into the problems.


Deep analysis for development of RDF, RDFS and OWL ontologies with protege

In SW (SW), Ontology is an important layer architecture that is develop with the help of web ontology language (OWL) and makes the web semantic. OWL is designs and creates metadata that required for developing SW applications. It is an essential part of SW. In this paper we design an education and non-education domain ontology framework which is developed by using protégé an ontology editor tool developed by Stanford University. We also show the output for both ontologies by using pellet reasoner based on the proposed ontology frameworks. We analyze from our result that OWL improves the inference compare to Resource Description Framework (RDF) and Resource Description Framework Schema (RDFS). OWL also provides more relevant information compare to RDF and RDFS and OWL precision and recall is better compare to RDF and RDFS. In our paper we used Pellet reasoner that retrieve relevant information from the education and non education ontology and protégé 4.3 alpha tool for the construction of education and non education domain ontology.


Teleoperation control of Baxter robot using body motion tracking

In this paper, we use Kinect Xbox 360 sensor to implement the motion control of Baxter robot, a semi humanoid robot with limbs of 7 DOF joints with collision avoidance capabilities. Two different methods using vector approach and inverse kinematics approach have been designed to achieve a given task. Primitive experiments have been carried out to verify the effectiveness of the developed methods. Human motions is captured by Kinect sensor and calculated with Processing Software using SimpleOpenNI wrapper for OpenNI and NITE. UDP protocol is adopted to send reference motion to Baxter robot. Python and RosPy script programming kit is used to calculate joint angles of Baxter robot based on vector approach and inverse kinematics approach. The experimental results demonstrate that both of our proposed approaches have achieved satisfactory performance.


PFID: Pittsburgh fast-food image dataset

We introduce the first visual dataset of fast foods with a total of 4,545 still images, 606 stereo pairs, 303 360° videos for structure from motion, and 27 privacy-preserving videos of eating events of volunteers. This work was motivated by research on fast food recognition for dietary assessment. The data was collected by obtaining three instances of 101 foods from 11 popular fast food chains, and capturing images and videos in both restaurant conditions and a controlled lab setting. We benchmark the dataset using two standard approaches, color histogram and bag of SIFT features in conjunction with a discriminative classifier. Our dataset and the benchmarks are designed to stimulate research in this area and will be released freely to the research community.


ImageNet: A large-scale hierarchical image database


Food image recognition with deep convolutional features

In this paper, we report the feature obtained from the Deep Convolutional Neural Network boosts food recognition accuracy greatly by integrating it with conventional hand-crafted image features, Fisher Vectors with HoG and Color patches. In the experiments, we have achieved 72.26% as the top-1 accuracy and 92.00% as the top-5 accuracy for the 100-class food dataset, UEC-FOOD100, which outperforms the best classification accuracy of this dataset reported so far, 59.6%, greatly.


Graphical Models and Belief Propagation-hierarchy for Optimal Physics-Constrained Network Flows

In this manuscript we review new ideas and first results on application of the Graphical Models approach, originated from Statistical Physics, Information Theory, Computer Science and Machine Learning, to optimization problems of network flow type with additional constraints related to the physics of the flow. We illustrate the general concepts on a number of enabling examples from power system and natural gas transmission (continental scale) and distribution (district scale) systems. 1.1 Introductory remarks In this chapter we discuss optimization problems which appears naturally in the classical settings describing flows over networks constrained by the physical nature Michael Chertkov Theoretical Division, T-4 & CNLS, Los Alamos National Laboratory Los Alamos, NM 87545, USA and Energy System Center, Skoltech, Moscow, 143026, Russia, e-mail: chertkov@lanl. gov Sidhant Misra Theoretical Division, T-5, Los Alamos National Laboratory Los Alamos, NM 87545, USA, e-mail: sidhant@lanl.gov Marc Vuffray Theoretical Division, T-4, Los Alamos National Laboratory Los Alamos, NM 87545, USA, e-mail: sidhant@lanl.gov Krishnamurthy Dvijotham Pacific Northwest National Laboratory, PO Box 999, Richland, WA 99352, USA e-mail: krishnamurthy.dvijotham@pnnl.gov Pascal Van Hentenryck University of Michigan, Department of Industrial & Operations Engineering Ann Arbor, MI 48109, USA, e-mail: pvanhent@umich.edu 1 ar X iv :1 70 2. 01 89 0v 1 [ cs .S Y ] 7 F eb 2 01 7 2 M. Chertkov, S. Misra, M. Vuffray, D. Krishnamurthy, and P. Van Hentenryck of the flows which appear in the context of electric power systems, see e.g. [27, 44], and natural gas application, see e.g. [13] and references there in. Other examples of physical flows where similar optimization problem arise include pipe-flow systems, such as district heating [75, 1] and water [54], as well as traffic systems [40]. We aim to show that the network flow optimization problem can be stated naturally in terms of the so-called Graphical Models (GM). In general, GMs for optimization and inference are wide spread in statistical disciplines such as Applied Probability, Machine Learning and Artificial Intelligence [53, 29, 16, 12, 32, 50], Information Theory [55] and Statistical Physics [47]. Main benefit of adopting GM methodology to the physics-constrained network flows is in modularity and flexibility of the approach – any new constraints, set of new variables, and any modification of the optimization objective can be incorporated in the GM formulation with an ease. Besides, if all (or at least majority of) constraints and modifications are factorized, i.e. can be stated in terms of a small subset of variables, underlying GM optimization or GM statistical inference problems can be solved exactly or approximately with the help of an emerging set of techniques, algorithms and computational approaches coined collectively Belief Propagation (BP), see e.g. an important original paper [74] and recent reviews [47, 55, 66]. It is also important to emphasize that an additional benefit of the GM formulation is in its principal readiness for generalization. Even though we limit our discussion to application of the GM and BP framework to deterministic optimizations, many probabilistic and/or mixed generalizations (largely not discussed in this paper) fit very naturally in this universal framework as well. We will focus on optimization problems associated with Physics-Constrained Newtork Flow (PCNF) problems. Structure of the networks will obviously be inherited in the GM formulation, however indirectly through graphand variabletransformations and modifications. Specifically, next Section 1.2 is devoted solely to stating a number of exemplary energy system formulations in GM terms. Thus, in Section 1.2.1 and Section 1.2.2 we consider dissipation optimal and respectively general physics-constrained network flow problems. In particular, Section 1.2.2 includes discussion of power flow problems in both power-voltage, Section 1.2.2.1, and current-voltage, Section 1.2.2.2, formats, as well as discussion of the gas flow formulation in Section 1.2.2.3 and general k-component physics-constrained network flow problem in Section 1.2.2.4. Section 1.2.3 describes problems of the next level of complexity – these including optimization over resources. In particular, general optimal physics-controlled network flow problem is discussed in Section 1.2.3.1 and more specific cases of optimal flows, involving optimal power flow (in both power-flow and current-voltage formulations) and gas flows are discussed in Sections 1.2.3.2,1.2.3.3,1.2.2.3, respectively. Section 1.2.4 introduces a number of feasibility problems, all stated as special kinds of optimizations. Here we discuss the so-called instanton, Section 1.2.4.1, containment Section 1.2.4.2, and state estimation, Section 1.2.4.3, formulation. The long introductory section concludes with a discussion in Section 1.2.5 of an exemplary (and even more) complex optimization involving split of resources between participants/aggregators. 1 Graphical Models for Optimal Flows 3 In Section 1.3 we describe how any of the aforementioned PCNF and optimal PCNF problems can be re-stated in the universal Graphical Model format. Then, in Section 1.4, we take advantage of the factorized form of the PCNF GM and illustrate how BP methodology can be used to solve the optimization problems exactly and/or approximately. Specifically, in Section 1.4.1 we restate the optimization (Maximum Likelihood) GM problem as a Linear Programming (LP) in the space of beliefs (proxies for probabilities). The resulting LP is generally difficult as working with all variables in a combination. We take advantage of the GM factorization and introduce in Section 1.4.2 the so-called Linear Programming Belief Propagation (LP-BP) relaxation, providing a provable lower bound for the optimal. Finally, in Section 1.4.3 we construct a tractable relaxation of LP-BP based on an interval partitioning of the underlying space. Section 1.5 discuss hierarchies which allow to generalize, and thus improve LPBP. The so-called LP-BP hierarchies, related to earlier papers on the subject [65, 30, 63] are discussed in Section 1.5.1. Then, relation between the LP-BP hierarchies and classic LP-based Sherali-Adams [59] and Semi-Definite-Programming based Lasserre hierarchies [41, 36, 52, 37] are discussed in Section 1.5.2. Section 1.6 discuss the special case of a GM defined over a tree (graph without loops). In this case LP-BP is exac, equivalent to the so-called Dynamic Programming approach, and as such it provides a distributed alternative to the global optimization through a sequence of graph-element-local optimizations. However, even in the tree case the exact LP-BP and/or DP are not tractable for GM stated in terms of physical variables, such as flows, voltages and/or pressures, drawn from a continuous set. Following, [18] we discuss here how the problem can be resolved with a proper interval-partitioning (discretization). We conclude the manuscript presenting summary and discussing path forward in Section 1.7. 1.2 Problems of Interest: Formulations In this Section we formulate a number of physics-constrained network flow problems which we will then attempt to analyze and solve with the help of Graphical Model (GM)/Belief Propagation (BP) approaches/techniques in the following Sections. 1.2.1 Dissipation-Optimal Network Flow We start introducing/discussing Network Flows constrained by a minimum dissipation principle, i.e. one which can be expressed as an unconstrained optimization/minimization of an energy function (potential). 4 M. Chertkov, S. Misra, M. Vuffray, D. Krishnamurthy, and P. Van Hentenryck Consider a static flow of a commodity over an undirected graph, G = (V ,E ) described through the following network flow equations i ∈ V : qi = ∑ j:(i, j)∈E φi j, (1.1) where qi stand for injection, qi > 0, or consumption, qi < 0, of the flow at the node i and φi j =−φ ji stands for the value of the flow through the directed edge (i, j) – in the direction from i to j 1. We consider a balanced network, ∑i∈V qi = 0. We constraint the flow requiring that the minimum dissipation principle is obeyed min φ ∑ {i, j}∈E Ei j(φi j) ∣∣∣∣ Eq. (1.1) , (1.2) where φ . = (φi j = −φ ji|{i, j} ∈ E ), and Ei j(x) are local (energy) functions of their arguments for all {i, j} ∈ E . The local energy functions Ei j(x) are required to be convex at least on a restricted domain. We call the sum of local energy functions E(φ) = ∑{i, j}∈E Ei j(φi j) the global energy function or simply the energy function. Versions of this problem appear in the context of the feasibility analysis of the dissipative network flows, that is flows whose redistribution over the network is constrained by potentials, e.g. voltages or pressures in the context of resistive electric networks and gas flow networks, respectively [22, 48, 64]. Note, that the formulation (1.2) can also be supplemented by additional flow or potential constraints. Requiring Karush-Kuhn-Tucker (KKT) stationary point conditions on the optimization problem stated in Eq. (1.2) leads to the following set of equations ∀{i, j} ∈ E : E ′ i j(φi j) = λi−λ j, (1.3) where λi is a Lagrangian multiplier corresponding to the i’s equation (1.1). The problem becomes fully defined by the pair of Eqs. (1.1,1.3), which can also be restated solely in terms of the λ -variables i ∈ V : qi = ∑ j:{i, j}∈E ( E ′ i j )−1 (λi−λ j). (1.4) 1.2.2 General Physics-Constrained Network Flows We call “unconstrained” a network flow for which only conservation of flow(s), described by Eq. (1.1), is enforced. Contrariwise we call “Physics-constrained” a 1 In the following we will use notation {i, j} for the undirected graph and (i, j) for the respective directed graph. When the meaning is clear we slightly abuse notations denoting by E both the set of undirected and directed edges. 1 Graphical Models for Optimal Flows 5 network flow t


Improved direct back EMF detection for sensorless brushless DC (BLDC) motor drives

Improved back EMF detection circuits for low voltage/low speed and high voltage sensorless BLDC motor drives are presented in this paper. The improvements are based on the direct back EMF sensing method from our previous research work described in reference, which describes a technique for directly extracting phase back EMF information without the need to sense or re-construct the motor neutral. The reference method is not sensitive to switching noise and requires no filtering, achieving much better performance than traditional back EMF sensing scheme. A complementary PWM (synchronous rectification) is proposed to reduce the power dissipation in power devices for low voltage applications. In order to further extend the sensorless BLDC system to lower speed, a pre-conditioning circuit is proposed to amplify the back EMFs at very low speed. As a result, the brushless DC motor can run at lower speed with the improved back EMF sensing scheme. On the other hand, another improved detection circuit is presented for high voltage applications to overcome the delaying problem caused by large sensing resistors. The detailed circuit models are analyzed and experimental results verify the analysis.


Alignment of continuous video onto 3D point clouds

We propose a general framework for aligning continuous (oblique) video onto 3D sensor data. We align a point cloud computed from the video onto the point cloud directly obtained from a 3D sensor. This is in contrast to existing techniques where the 2D images are aligned to a 3D model derived from the 3D sensor data. Using point clouds enables the alignment for scenes full of objects that are difficult to model; for example, trees. To compute 3D point clouds from video, motion stereo is used along with a state-of-the-art algorithm for camera pose estimation. Our experiments with real data demonstrate the advantages of the proposed registration algorithm for texturing models in large-scale semi-urban environments. The capability to align video before a 3D model is built from the 3D sensor data offers new practical opportunities for 3D modeling. We introduce a novel modeling-through-registration approach that fuses 3D information from both the 3D sensor and the video. Initial experiments with real data illustrate the potential of the proposed approach.


Neuronal Circuits for Fear Expression and Recovery: Recent Advances and Potential Therapeutic Strategies

Recent technological developments, such as single unit recordings coupled to optogenetic approaches, have provided unprecedented knowledge about the precise neuronal circuits contributing to the expression and recovery of conditioned fear behavior. These data have provided an understanding of the contributions of distinct brain regions such as the amygdala, prefrontal cortex, hippocampus, and periaqueductal gray matter to the control of conditioned fear behavior. Notably, the precise manipulation and identification of specific cell types by optogenetic techniques have provided novel avenues to establish causal links between changes in neuronal activity that develop in dedicated neuronal structures and the short and long-lasting expression of conditioned fear memories. In this review, we provide an update on the key neuronal circuits and cell types mediating conditioned fear expression and recovery and how these new discoveries might refine therapeutic approaches for psychiatric conditions such as anxiety disorders and posttraumatic stress disorder.


In-situ vehicular antenna integration and design aspects for vehicle-to-vehicle communications

Vehicle-to-vehicle (V2V) communications aim to enhance driver safety and traffic efficiency by using the recently designated frequency bands in the 5.9 GHz range in Europe. Due to the time-frequency selective fading behavior of the vehicular communication channel, multi-antenna techniques can provide enhanced link conditions by means of diversity processing. This paper highlights the integration of a four-element (N =4) linear array antenna into the roof-top compartment of a vehicle to conduct Multiple-Input Multiple-Output (MIMO) high-resolution mobile-to-mobile channel measurements.


Musicmapper: interactive 2d representations of music samples for in-browser remixing and exploration

Much of the challenge and appeal in remixing music comes from manipulating samples. Typically, identifying distinct samples of a song requires expertise in music production software. Additionally, it is di cult to visualize similarities and di↵erences between all samples of a song simultaneously and use this to select samples. MusicMapper is a web application that allows nonexpert users to find and visualize distinctive samples from a song without any manual intervention, and enables remixing by having users play back clusterings of such samples. This is accomplished by splitting audio from the Soundcloud API into appropriately-sized spectrograms, and applying the tSNE algorithm to visualize these spectrograms in two dimensions. Next, we apply k-means to guide the user’s eye toward related clusters and set k = 26 to enable playback of the clusters by pressing keys on an ordinary keyboard. We present the source code and a demo video of the MusicMapper web application that can be run in most modern browsers.


Power without wires

This article presents the history of WPT and the various technologies and applications of this exciting technology. In the near future, standardization and regulation will be of importance to realizing WPT based products for commercial applications. The WPC has defined a standard for inductive coupling and members of this group have released conforming products. There are, as yet, no standards or regulation for resonant coupling and MPT technologies. In Japan, a technical forum known as Broadband Wireless Forum has been established to discuss the future of WPT. SPS researchers have also submitted a proposal for WPT to the International Telecommunication Union (ITU). In the IEEE MTT Society, the Technical Committee MTT-26 Wireless Energy Transfer and Conversion was established in June, 2011 to discuss the future of WPT.


How Not to Do a Mindset Intervention: Learning from a Mindset Intervention among Students with Good Grades

The present study examined the effectiveness of a Growth Mindset intervention based on Dweck et al.'s (1995) theory in the Hungarian educational context. A cluster randomized controlled trial classroom experiment was carried out within the framework of a train-the-trainer intervention among 55 Hungarian 10th grade students with high Grade Point Average (GPA). The results suggest that students' IQ and personality mindset beliefs were more incremental in the intervention group than in the control group 3 weeks after the intervention. Furthermore, compared to both the baseline measure and the control group, students' amotivation decreased. However, no intrinsic and extrinsic motivation change was found. Students with low grit scores reported lower amotivation following the intervention. However, in the second follow-up measurement-the end of the semester-all positive changes disappeared; and students' GPA did not change compared to the previous semester. These results show that mindset beliefs are temporarily malleable and in given circumstances, they can change back to their pre-intervention state. The potential explanation is discussed in the light of previous mindset intervention studies and recent findings on wise social psychological interventions.


Adults and children processing music: An fMRI study

The present study investigates the functional neuroanatomy of music perception with functional magnetic resonance imaging (fMRI). Three different subject groups were investigated to examine developmental aspects and effects of musical training: 10-year-old children with varying degrees of musical training, adults without formal musical training (nonmusicians), and adult musicians. Subjects made judgements on sequences that ended on chords that were music-syntactically either regular or irregular. In adults, irregular chords activated the inferior frontal gyrus, orbital frontolateral cortex, the anterior insula, ventrolateral premotor cortex, anterior and posterior areas of the superior temporal gyrus, the superior temporal sulcus, and the supramarginal gyrus. These structures presumably form different networks mediating cognitive aspects of music processing (such as processing of musical syntax and musical meaning, as well as auditory working memory), and possibly emotional aspects of music processing. In the right hemisphere, the activation pattern of children was similar to that of adults. In the left hemisphere, adults showed larger activations than children in prefrontal areas, in the supramarginal gyrus, and in temporal areas. In both adults and children, musical training was correlated with stronger activations in the frontal operculum and the anterior portion of the superior temporal gyrus.


Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case

This paper presents a new approach to the multi-robot map-alignment problem that enables teams of robots to build joint maps without initial knowledge of their relative poses. The key contribution of this work is an optimal algorithm for merging (not necessarily overlapping) maps that are created by different robots independently. Relative pose measurements between pairs of robots are processed to compute the coordinate transformation between any two maps. Noise in the robot-to-robot observations, propagated through the map-alignment process, increases the error in the position estimates of the transformed landmarks, and reduces the overall accuracy of the merged map. When there is overlap between the two maps, landmarks that appear twice provide additional information, in the form of constraints, which increases the alignment accuracy. Landmark duplicates are identified through a fast nearest-neighbor matching algorithm. In order to reduce the computational complexity of this search process, a kd-tree is used to represent the landmarks in the original map. The criterion employed for matching any two landmarks is the Mahalanobis distance. As a means of validation, we present experimental results obtained from two robots mapping an area of 4,800 m2


Improved lossless intra coding for H.264/MPEG-4 AVC

A new lossless intra coding method based on sample-by-sample differential pulse code modulation (DPCM) is presented as an enhancement of the H.264/MPEG-4 AVC standard. The H.264/AVC design includes a multidirectional spatial prediction method to reduce spatial redundancy by using neighboring samples as a prediction for the samples in a block of data to be encoded. In the new lossless intra coding method, the spatial prediction is performed based on samplewise DPCM instead of in the block-based manner used in the current H.264/AVC standard, while the block structure is retained for the residual difference entropy coding process. We show that the new method, based on samplewise DPCM, does not have a major complexity penalty, despite its apparent pipeline dependencies. Experiments show that the new lossless intra coding method reduces the bit rate by approximately 12% in comparison with the lossless intra coding method previously included in the H.264/AVC standard. As a result, the new method is currently being adopted into the H.264/AVC standard in a new enhancement project


Facial recognition with PCA and machine learning methods

Facial recognition is a challenging problem in image processing and machine learning areas. Since widespread applications of facial recognition make it a valuable research topic, this work tries to develop some new facial recognition systems that have both high recognition accuracy and fast running speed. Efforts are made to design facial recognition systems by combining different algorithms. Comparisons and evaluations of recognition accuracy and running speed show that PCA + SVM achieves the best recognition result, which is over 95% for certain training data and eigenface sizes. Also, PCA + KNN achieves the balance between recognition accuracy and running speed.


The description–experience gap in risky choice

According to a common conception in behavioral decision research, two cognitive processes-overestimation and overweighting-operate to increase the impact of rare events on people's choices. Supportive findings stem primarily from investigations in which people learn about options via descriptions thereof. Recently, a number of researchers have begun to investigate risky choice in settings in which people learn about options by experiential sampling over time. This article reviews work across three experiential paradigms. Converging findings show that when people make decisions based on experience, rare events tend to have less impact than they deserve according to their objective probabilities. Striking similarities in human and animal experience-based choices, ways of modeling these choices, and their implications for risk and precautionary behavior are discussed.


Machine learning for neural decoding

Despite rapid advances in machine learning tools, the majority of neural decoding approaches still use traditional methods. Improving the performance of neural decoding algorithms allows us to better understand the information contained in a neural population, and can help advance engineering applications such as brain machine interfaces. Here, we apply modern machine learning techniques, including neural networks and gradient boosting, to decode from spiking activity in 1) motor cortex, 2) somatosensory cortex, and 3) hippocampus. We compare the predictive ability of these modern methods with traditional decoding methods such as Wiener and Kalman filters. Modern methods, in particular neural networks and ensembles, significantly outperformed the traditional approaches. For instance, for all of the three brain areas, an LSTM decoder explained over 40% of the unexplained variance from a Wiener filter. These results suggest that modern machine learning techniques should become the standard methodology for neural decoding. We provide a tutorial and code to facilitate wider implementation of these methods. Introduction: Neural decoding uses activity recorded from the brain to make predictions about variables in the outside world. For example, researchers predict movements based on activity in motor cortex [1, 2], predict decisions based on activity in prefrontal and parietal cortices [3, 4], and predict locations based on activity in the hippocampus [5, 6]. There are two primary purposes of decoding. First, it is an increasingly critical tool for understanding how neural signals relate to the outside world. It can be used to determine how much information the brain contains about an external variable (e.g., sensation or movement) [7-9], and how this information differs across brain areas [10-12], experimental conditions [13, 14], disease states [15], and more. Second, it is useful in engineering contexts, such as for brain machine interfaces (BMIs), where signals from motor cortex are used to control computer cursors [1], robotic arms [16], and muscles [2]. Decoding is a central tool for neural data analysis. When predicting a continuous variable, decoding is simply a regression problem and when predicting a discrete variable, decoding is simply a classification problem. Thus, there are many methods that can be used for neural decoding. However, despite the recent advances in machine learning techniques, it is still common to use traditional methods such as linear regression. Using modern machine learning tools for neural decoding would likely significantly boost performance, and might allow deeper insights into neural function. Here, we first give a brief tutorial so that readers can get started with using standard machine learning methods for decoding. We provide companion code so that readers can easily use a variety of decoding methods. Next, we compare the performance of many different machine learning methods to decode information from neural spiking activity. We predict movement velocities from macaque motor cortex and sensorimotor cortex, and locations in space from rat hippocampus. In all brain regions, modern methods, in particular neural networks and ensembles, led to the highest accuracy decoding, even for limited amounts of data. Tutorial for getting started with using machine learning for decoding: Code We have made Python code available at https://github.com/KordingLab/Neural_Decoding, which accompanies the tutorial below. This includes code that will correctly format the neural and output data for decoding, a tutorial for hyperparameter optimization, and examples of using many different decoders. We go into more detail on these topics below. General framework for decoding The decoding problem we are considering can be summarized as follows. We have N neurons whose spiking activity is recorded for a period of time, T (Fig. 1a). While we focus here on spiking neurons, the same methods could be used with other forms of neural data, such as the BOLD activity of N voxels, or the power in particular frequency bands of N LFP or EEG signals. We have also recorded outputs that we are trying to predict over that same time period (Fig. 1a). Here, we focus on output variables that are continuous (e.g., velocity, position), rather than discrete (e.g., choice). However, the general framework is very similar for discrete output variables. The first choice we need to make is to decide the temporal resolution, R, for decoding. That is, do we want to make a prediction every 50ms, 100ms, etc? We need to put the input and output into bins of length R (Fig. 1a). It is common (although not necessary) to use the same bin size for the neural data and output data, and we do so here. Thus, we will have approximately T/R total bins of neural activity and outputs. Within each bin, we compute the average activity of all neurons and the average value of the output. Next, we need to choose the time period of neural activity used to predict a given output. In the simplest case, the activity from all neurons in a given time bin would be used to predict the output in that same time bin. However, it is often the case that we want the neural data to precede the output (e.g., in the case of movements) or follow the decoder output (e.g., in the case of sensation). Plus, we often want to use neural data from more than one bin (e.g., using 500 ms of preceding neural data to predict a movement in the current 50 ms bin). In the following, we use the nomenclature that B time bins of neural activity are being used to predict a given output. For example, if we use one bin preceding the output, one concurrent bin, and one following bin, then B=3 (Fig. 1a). Note that when multiple bins of neural data are used to predict an output (B>1), then overlapping neural data will be used to predict different output times (Fig. 1a). When multiple bins of neural data are used to predict an output, then we will need to exclude some output bins. For instance, if we are using one bin of neural data preceding the output, then we cannot predict the first output bin, and if we are using one bin of neural data following the output, then we cannot predict the final output bin (Fig. 1a). Thus, we will be predicting K total output bins, where K is less than the total number of bins (T/R). To summarize, our decoders will be predicting each of these K outputs using B surrounding bins of activity from N neurons. Below, we describe how to format the neural data and output variables for use in different types of decoders. Non-recurrent decoders: For many “non-recurrent” decoders, we are just solving a standard machine learning regression problem. We have N x B features (the firing rates of each neuron in each relevant time bin) that are used to predict each output (Fig. 1b). If there is a single output that is being predicted, it can be put in a vector, Y, of length K. Note that for many decoders, if there are multiple outputs, each is independently decoded. If multiple outputs are being simultaneously predicted, which can occur with neural network decoders, the outputs can be put in a matrix Y, that has K rows and d columns, where d is the number of outputs being predicted. The input covariate matrix, X, has N x B columns (one for each feature) and K rows (corresponding to each output being predicted). This is now the format of a standard regression problem. Linear regression simply finds a linear combination of these features that predicts the output. More sophisticated forms of regression use nonlinear combinations of features for predictions. In general, this format is beneficial because there are many machine learning regression techniques that can easily be substituted for one another. We provide code for a Wiener filter (linear regression), a Wiener cascade (a linear-nonlinear model), support vector regression, XGBoost (gradient boosted trees), and feedforward neural networks (see Methods). We test the performance of these decoders in Results. Recurrent neural network decoders: When using recurrent neural networks (RNNs) for decoding, we need to put the inputs in a different format. Recurrent neural networks explicitly model temporal transitions across time (Fig. 1c). In the non-recurrent decoders, there were N x B features that were equivalently used for prediction, regardless of the time bin they came from. However, with a recurrent decoder, at each time bin, N features (the firing rates of all neurons in that time bin) are used for predicting the hidden state of the system at that time. Along with being a function of the N features, the hidden state at a time bin is also a function of the hidden state at the previous time bin (Fig. 1c). After transitioning through all B bins, the hidden state in this final bin is used to predict the output. This architecture allows the decoder to take advantage of temporal structure in the data, and allowing it (via its hidden state) to integrate the effect of neural inputs over an extended period of time. For use in this type of decoder, the input can be formatted as a 3-dimensional matrix of size K x N x B (Fig. 1c). That is, for each row (corresponding to the output that is predicted), there will be N features (2nd matrix dimension) over B bins (3rd matrix dimension) used for prediction. Within this format, different types of RNNs, including those more sophisticated than the standard RNN shown in Fig. 1c, can be easily switched for one another. We provide code for a standard recurrent network, a gated recurrent unit (GRU) network, and a long short-term memory (LSTM) network. In Results, we test the performance of these decoders. Decoders with additional information: While the focus of this tutorial is on decoders that fit into standard machine learning frameworks, we want to briefly mention two other commonly used decoders. The Kalman filter and its variants have frequently been used in the brain computer interface field fo


OF A NOVEL SUPER WIDE BAND CIRCULAR-HEXAGONAL FRACTAL ANTENNA

In this paper, a novel circular-hexagonal Fractal antenna is investigated for super wide band applications. The proposed antenna is made of iterations of a hexagonal slot inside a circular metallic patch with a transmission line. A partial ground plane and asymmetrical patch toward the substrate are used for designing the antenna to achieve a super wide bandwidth ranging from 2.18 GHz to 44.5GHz with a bandwidth ratio of 20.4 : 1. The impedance bandwidth and gain of the proposed antenna are much better than the recently reported super wideband antennas which make it appropriate for many wireless communications systems such as ISM, Wi-Fi, GPS, Bluetooth, WLAN and UWB. Details of the proposed antenna design are presented and discussed.


SphereFlow: 6 DoF Scene Flow from RGB-D Pairs

We take a new approach to computing dense scene flow between a pair of consecutive RGB-D frames. We exploit the availability of depth data by seeking correspondences with respect to patches specified not as the pixels inside square windows, but as the 3D points that are the inliers of spheres in world space. Our primary contribution is to show that by reasoning in terms of such patches under 6 DoF rigid body motions in 3D, we succeed in obtaining compelling results at displacements large and small without relying on either of two simplifying assumptions that pervade much of the earlier literature: brightness constancy or local surface planarity. As a consequence of our approach, our output is a dense field of 3D rigid body motions, in contrast to the 3D translations that are the norm in scene flow. Reasoning in our manner additionally allows us to carry out occlusion handling using a 6 DoF consistency check for the flow computed in both directions and a patchwise silhouette check to help reason about alignments in occlusion areas, and to promote smoothness of the flow fields using an intuitive local rigidity prior. We carry out our optimization in two steps, obtaining a first correspondence field using an adaptation of PatchMatch, and subsequently using alpha-expansion to jointly handle occlusions and perform regularization. We show attractive flow results on challenging synthetic and real-world scenes that push the practical limits of the aforementioned assumptions.


Fast and Robust High Dynamic Range Image Generation with Camera and Object Movement

High dynamic range (HDR) images play an important role in todays computer graphics: Typical applications are the improved display of a photograph with a tone mapper and the relighting of a virtual object in a natural environment using an HDR environment map. Generating an HDR image usually requires a sequence of photographs with different exposure times which are combined to a single image. In practice two problems occur when taking an image sequence: The camera is moving or objects are moving during the sequence. This results in a blurry HDR image due to the camera movement and moving objects appear multiple times as ghost images in the combined image. In this paper, we present a simple and fast algorithm for a robust HDR generation that removes these artifacts without prior knowledge of the camera response function.


What storytelling can do for information visualization

A well-told story conveys great quantities of information in relatively few words in a format that is easily assimilated by the listener or viewer. People usually find it easier to understand information integrated into stories than information spelled out in serial lists (such as bulleted items in an overhead slide). Stories are also just more compelling. For example, despite its sketchiness, the story fragment in Figure 1 is loaded with information, following an analysis similar to that of John Thomas of IBM Research [5]. We find that Jim uses technology (a pager and the Internet) and is dedicated to his job. Many other pieces of information can be deduced about Jim and his work, as well as about his relationships with his coworkers, as noted in the right side of the figure. The story does not express all this information explicitly; some is only implied; for example, we can surmise that Jim is probably not at the gym and his attendance at the meeting is important to his boss and coworkers, as well as to his company’s business performance. As in most stories, this one involves uncerFor as long as people have been around, they have used stories to convey information, cultural values, and experiences. Since the invention of writing and the printing press until today, technology and culture have constantly provided new and increasingly sophisticated means to tell stories. More recently, technology, entertainment, and art have converged in the computer. The ancient art of storytelling and its adaptation in film and video can now be used to efficiently convey information in our increasingly computerized world. What Storytelling Can Do for Information Visualization


[Internet- and computer game addiction: phenomenology, comorbidity, etiology, diagnostics and therapeutic implications for the addictives and their relatives].

OBJECTIVE
Excessive and addictive internet use and computer game playing is reported as an increasing problem in outpatient care. The aim of this paper is to give an overview about the current scientific discussion of the overuse and addiction of internet and computer game playing.

METHODS
Pubmed was used for a systematic literature research considering original papers and review articles dealing with Internet/computer game addiction.

RESULTS
Recent epidemiological data from Germany suggest that 1.5-3.5 % of adolescent computer and internet users show signs of an overuse or addictive use of computer and video games. Moreover there is evidence that the disorder is associated with higher rates of depression, anxiety, as well as lower achievements e. g. at school. Although the nosological assignment still remains unclear there is some evidence from neurobiological data that the disorder can be conceptualized as behavioral addiction. As treatment strategy CBT-techniques have been proposed, but there is still a lack of controlled clinical trials concerning their efficacy.

CONCLUSIONS
Since the addicted persons often show little motivation for a behavioural change we consider it a promising approach to treat and train their relatives with the aim of increasing the motivation for a behavioural change of the addicted person.


SOCIAL DIALOGUE WITH EMBODIED CONVERSATIONAL AGENTS

The functions of social dialogue between people in the context of performing a task is discussed, as well as approaches to modelling such dialogue in embodied conversational agents. A study of an agent’s use of social dialogue is presented, comparing embodied interactions with similar interactions conducted over the phone, assessing the impact these media have on a wide range of behavioural, task and subjective measures. Results indicate that subjects’ perceptions of the agent are sensitive to both interaction style (social vs. task-only dialogue) and


A Random-Finite-Set Approach to Bayesian SLAM

This paper proposes an integrated Bayesian frame work for feature-based simultaneous localization and map building (SLAM) in the general case of uncertain feature number and data association. By modeling the measurements and feature map as random finite sets (RFSs), a formulation of the feature-based SLAM problem is presented that jointly estimates the number and location of the features, as well as the vehicle trajectory. More concisely, the joint posterior distribution of the set-valued map and vehicle trajectory is propagated forward in time as measurements arrive, thereby incorporating both data association and feature management into a single recursion. Furthermore, the Bayes optimality of the proposed approach is established. A first-order solution, which is coined as the probability hypothesis density (PHD) SLAM filter, is derived, which jointly propagates the posterior PHD of the map and the posterior distribution of the vehicle trajectory. A Rao-Blackwellized (RB) implementation of the PHD-SLAM filter is proposed based on the Gaussian-mixture PHD filter (for the map) and a particle filter (for the vehicle trajectory). Simulated and experimental results demonstrate the merits of the proposed approach, particularly in situations of high clutter and data association ambiguity.


Anisotropic Ambient Volume Shading

We present a novel method to compute anisotropic shading for direct volume rendering to improve the perception of the orientation and shape of surface-like structures. We determine the scale-aware anisotropy of a shading point by analyzing its ambient region. We sample adjacent points with similar scalar values to perform a principal component analysis by computing the eigenvectors and eigenvalues of the covariance matrix. In particular, we estimate the tangent directions, which serve as the tangent frame for anisotropic bidirectional reflectance distribution functions. Moreover, we exploit the ratio of the eigenvalues to measure the magnitude of the anisotropy at each shading point. Altogether, this allows us to model a data-driven, smooth transition from isotropic to strongly anisotropic volume shading. In this way, the shape of volumetric features can be enhanced significantly by aligning specular highlights along the principal direction of anisotropy. Our algorithm is independent of the transfer function, which allows us to compute all shading parameters once and store them with the data set. We integrated our method in a GPU-based volume renderer, which offers interactive control of the transfer function, light source positions, and viewpoint. Our results demonstrate the benefit of anisotropic shading for visualization to achieve data-driven local illumination for improved perception compared to isotropic shading.


Variants of travelling salesman problem: A survey

The Travelling Salesman Problem (TSP) is a well-known NP-hard problem exceedingly studied in the fields of operations research and computer science. In TSP, a salesman wants to visit each of a set of cities exactly once and return to the starting city with minimal distance travelled. The significance of the TSP is that it can be pertained on many practical applications in real life scenario. But, it is not always possible to apply TSP for all the real world applications because of different constraints and also variations of TSP might be desired in such real-life scenarios. Therefore, several variants of TSP have been proposed to manage with the application specific constraints. In this work, a comprehensive study on various categories of TSP variants such as Profit Based, Time Windows based, Maximal Based and Kinetic Based has been studied with respect to the problem formulation and applications.


Detection of and compensation for shadows in colored urban aerial images

A new method for shadow detection in colored urban aerial images is proposed. First, a new imaging model of shadows is presented, which indicates that hue values of shadowed image areas are larger than those of these areas non-shadowed. Based on this model, a thresholding technique is employed to detect shadowed areas. After detection, the Retinex technique is applied to shadowed and non-shadowed areas individually to compensate for shadows. Experiment results show the effectiveness of the proposed method.


A framework of sensor-cloud integration opportunities and challenges

In the past few years, wireless sensor networks (WSNs) have been gaining increasing attention because of their potential of enabling of novel and attractive solutions in areas such as industrial automation, environmental monitoring, transportation business, health-care etc. If we add this collection of sensor derived data to various Web-based social networks or virtual communities, blogs etc., we can have a remarkable transformation in our ability to "see" ourselves and our planet. Our primary goal is to facilitate connecting sensors, people and software objects to build community-centric sensing applications. However, the computational tools needed to launch this exploration may be more appropriately built from the data center "Cloud" computing model than the traditional HPC approaches. In this paper, we propose a framework to enable this exploration by integrating sensor networks to the emerging data center "cloud" model of computing. But there are many challenges to enable this framework. We propose a pub-sub based model which simplifies the integration of sensor networks with cloud based community-centric applications. Also there is a need for internetworking cloud providers in case of violation of service level agreement with users. We discussed these issues and proposed reasonable solutions.


Activity Recognition in the Home Using Simple and Ubiquitous Sensors

In this work, a system for recognizing activities in the home setting using a set of small and simple state-change sensors is introduced. The sensors are designed to be “tape on and forget” devices that can be quickly and ubiquitously installed in home environments. The proposed sensing system presents an alternative to sensors that are sometimes perceived as invasive, such as cameras and microphones. Unlike prior work, the system has been deployed in multiple residential environments with non-researcher occupants. Preliminary results on a small dataset show that it is possible to recognize activities of interest to medical professionals such as toileting, bathing, and grooming with detection accuracies ranging from 25% to 89% depending on the evaluation criteria used .


TWO-WAY COMMUNICATION CHANNELS

input at terminal 2 and Y2 the corresponding output. Once each second, say, new inputs xi and x2 may be chosen from corresponding input alphabets and put into the channel; outputs yi and Y2 may then be observed. These outputs will be related statistically to the inputs and perhaps historically to previous inputs and outputs if the channel has memory. The problem is to communicate in both directions through the channel as effectively as possible. Particularly, we wish to determine what pairs of signalling rates R1 and R2 for the two directions can be approached with arbitrarily small error probabilities.


Apprenticeship learning via inverse reinforcement learning

We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we want to learn to perform. This setting is useful in applications (such as the task of driving) where it may be difficult to write down an explicit reward function specifying exactly how different desiderata should be traded off. We think of the expert as trying to maximize a reward function that is expressible as a linear combination of known features, and give an algorithm for learning the task demonstrated by the expert. Our algorithm is based on using "inverse reinforcement learning" to try to recover the unknown reward function. We show that our algorithm terminates in a small number of iterations, and that even though we may never recover the expert's reward function, the policy output by the algorithm will attain performance close to that of the expert, where here performance is measured with respect to the expert's unknown reward function.


A simple procedure for pruning back-propagation trained neural networks

The sensitivity of the global error (cost) function to the inclusion/exclusion of each synapse in the artificial neural network is estimated. Introduced are shadow arrays which keep track of the incremental changes to the synaptic weights during a single pass of back-propagating learning. The synapses are then ordered by decreasing sensitivity numbers so that the network can be efficiently pruned by discarding the last items of the sorted list. Unlike previous approaches, this simple procedure does not require a modification of the cost function, does not interfere with the learning process, and demands a negligible computational overhead.


A MAV that flies like an airplane and hovers like a helicopter

Near-earth environments, such as forests, caves, tunnels, and urban structures make reconnaissance, surveillance and search-and-rescue missions difficult and dangerous to accomplish. Micro-air-vehicles (MAVs), equipped with wireless cameras, can assist in such missions by providing real-time situational awareness. This paper describes an additional flight modality enabling fixed-wing MAVs to supplement existing endurance superiority with hovering capabilities. This secondary flight mode can also be used to avoid imminent collisions by quickly transitioning from cruise to hover flight. A sensor suite which allows for autonomous hovering by regulating the aircraft's yaw. pitch and roll angles is also described


Conversion of Natural Language Query to SQL Query

This paper present an approach to automate the conversion of Natural Language Query to SQL Query effectively. Structured Query Language is a powerful tool for managing data held in a relational database management system. To retrieve or manage data user have to enter the correct SQL Query. But the users who don't have any knowledge about SQL are unable to retrieve the required data. To overcome this we proposed a model in Natural Language Processing for converting the Natural Language Query to SQL query. This helps novice user to get required content without knowing any complex details about SQL. This system can also deal with complex queries. This system is designed for Training and Placement cell officers who work on student database but don't have any knowledge about SQL. In this system, user can also enter the query using speech. System will convert speech into the text format. This query will get transformed to SQL query. System will execute the query and gives output to the user.


Secure Multiparty Computation and Secret Sharing

In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. How can parties handle confidential data if they do not trust everyone involved? This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing. In a secure MPC, each party possesses some private data, whereas secret sharing provides a way for one party to spread information on a secret such that all parties together hold full information, yet no single party has all the information. The authors present basic feasibility results from the last thirty years, generalizations to arbitrary access structures using linear secret sharing, some recent techniques for efficiency improvements, and a general treatment of the theory of secret sharing, focusing on asymptotic results with interesting applications related to MPC.


Improved Performance of Serially Connected Li-Ion Batteries With Active Cell Balancing in Electric Vehicles

This paper presents an active cell balancing method for lithium-ion battery stacks using a flyback dc/dc converter topology. The method is described in detail, and a simulation is performed to estimate the energy gain for ten serially connected cells during one discharging cycle. The simulation is validated with measurements on a balancing prototype with ten cells. It is then shown how the active balancing method with respect to the cell voltages can be improved using the capacity and the state of charge rather than the voltage as the balancing criterion. For both charging and discharging, an improvement in performance is gained when having the state of charge and the capacity of the cells as information. A battery stack with three single cells is modeled, and a realistic driving cycle is applied to compare the difference between both methods in terms of usable energy. Simulations are also validated with measurements.


Adaptive Optimal Control of Highly Dissipative Nonlinear Spatially Distributed Processes With Neuro-Dynamic Programming

Highly dissipative nonlinear partial differential equations (PDEs) are widely employed to describe the system dynamics of industrial spatially distributed processes (SDPs). In this paper, we consider the optimal control problem of the general highly dissipative SDPs, and propose an adaptive optimal control approach based on neuro-dynamic programming (NDP). Initially, Karhunen-Loève decomposition is employed to compute empirical eigenfunctions (EEFs) of the SDP based on the method of snapshots. These EEFs together with singular perturbation technique are then used to obtain a finite-dimensional slow subsystem of ordinary differential equations that accurately describes the dominant dynamics of the PDE system. Subsequently, the optimal control problem is reformulated on the basis of the slow subsystem, which is further converted to solve a Hamilton-Jacobi-Bellman (HJB) equation. HJB equation is a nonlinear PDE that has proven to be impossible to solve analytically. Thus, an adaptive optimal control method is developed via NDP that solves the HJB equation online using neural network (NN) for approximating the value function; and an online NN weight tuning law is proposed without requiring an initial stabilizing control policy. Moreover, by involving the NN estimation error, we prove that the original closed-loop PDE system with the adaptive optimal control policy is semiglobally uniformly ultimately bounded. Finally, the developed method is tested on a nonlinear diffusion-convection-reaction process and applied to a temperature cooling fin of high-speed aerospace vehicle, and the achieved results show its effectiveness.


Test-cost optimization in a scan-compression architecture using support-vector regression

Scan compression is widely used in high-volume testing of complex integrated circuits. With an increase in design complexity, the increased density of unknown (X) values from output responses reduces compression efficiency. In order to effectively block X values and maximize the effectiveness of test compression, a scan-compression architecture has recently been proposed, in which deterministic test patterns can be loaded into selected scan cells by controlling the initial state of the pseudo-random pattern generator (PRPG). A careful selection of the PRPG length is however essential to reduce test cost. We propose an optimization method based on support-vector regression to determine the PRPG length for test-cost reduction in a given scan-compression architecture. A correlation-based feature selection methodology is also proposed to reduce the amount of data needed for the accurate selection of the PRPG length. Experimental results on industrial designs highlight the effectiveness of the proposed method.


3D Soft Body Simulation Using Mass-spring System with Internal Pressure Force and Simplified Implicit Integration

In this paper, we propose a method to simulate soft bodies by using gravitational force, spring and damping forces between surface points, and internal molecular pressure forces. We consider a 3D soft body model composed of mesh points that define the body’s surface such that the points are connected by springs and influenced by internal molecular pressure forces. These pressure forces have been modeled on gaseous molecular interactions. Simulation of soft body with internal pressure forces is known to become unstable when high constants are used and is averted using an implicit integration method. We propose an approximation to this implicit integration method that considerably reduces the number of computations in the algorithm. Our results show that the proposed method realistically simulates soft bodies and improves performance of the implicit integration method.


Generating Notifications for Missing Actions: Don't Forget to Turn the Lights Off!

We all have experienced forgetting habitual actions among our daily activities. For example, we probably have forgotten to turn the lights off before leaving a room or turn the stove off after cooking. In this paper, we propose a solution to the problem of issuing notifications on actions that may be missed. This involves learning about interdependencies between actions and being able to predict an ongoing action while segmenting the input video stream. In order to show a proof of concept, we collected a new egocentric dataset, in which people wear a camera while making lattes. We show promising results on the extremely challenging task of issuing correct and timely reminders. We also show that our model reliably segments the actions, while predicting the ongoing one when only a few frames from the beginning of the action are observed. The overall prediction accuracy is 46.2% when only 10 frames of an action are seen (2/3 of a sec). Moreover, the overall recognition and segmentation accuracy is shown to be 72.7% when the whole activity sequence is observed. Finally, the online prediction and segmentation accuracy is 68.3% when the prediction is made at every time step.


Grammatical Error Correction

Grammatical error correction (GEC) is the task of automatically correcting grammatical errors in written text. Earlier attempts to grammatical error correction involve rule-based and classifier approaches which are limited to correcting only some particular type of errors in a sentence. As sentences may contain multiple errors of different types, a practical error correction system should be able to detect and correct all errors. In this report, we investigate GEC as a translation task from incorrect to correct English and explore some machine translation approaches for developing end-to-end GEC systems for all error types. We apply Statistical Machine Translation (SMT) and Neural Machine Translation (NMT) approaches to GEC and show that they can correct multiple errors of different types in a sentence when compared to the earlier methods which focus on individual errors. We also discuss some of the weakness of machine translation approaches. Finally, we also experiment on a candidate re-ranking technique to re-rank the hypotheses generated by machine translation systems. With regression models, we try to predict a grammaticality score for each candidate hypothesis and re-rank them according to the score.


Stacked Convolutional Denoising Auto-Encoders for Feature Representation

Deep networks have achieved excellent performance in learning representation from visual data. However, the supervised deep models like convolutional neural network require large quantities of labeled data, which are very expensive to obtain. To solve this problem, this paper proposes an unsupervised deep network, called the stacked convolutional denoising auto-encoders, which can map images to hierarchical representations without any label information. The network, optimized by layer-wise training, is constructed by stacking layers of denoising auto-encoders in a convolutional way. In each layer, high dimensional feature maps are generated by convolving features of the lower layer with kernels learned by a denoising auto-encoder. The auto-encoder is trained on patches extracted from feature maps in the lower layer to learn robust feature detectors. To better train the large network, a layer-wise whitening technique is introduced into the model. Before each convolutional layer, a whitening layer is embedded to sphere the input data. By layers of mapping, raw images are transformed into high-level feature representations which would boost the performance of the subsequent support vector machine classifier. The proposed algorithm is evaluated by extensive experimentations and demonstrates superior classification performance to state-of-the-art unsupervised networks.


Moving from syntactic to semantic organizations using JXML2OWL

Today’s enterprises face critical needs in integrating disparate information spread over several data sources inside and even outside the organization. Most organizations already rely on XML standard to define their data models. Unfortunately, even when using XML to represent data, problems arise when it is necessary to integrate different data sources. Emerging Semantic Web technologies, such as ontologies, RDF, RDFS, and OWL, can play an important role in the semantic definition and integration of data. The purpose of our study is to present a framework to assist organizations to move from a syntactic data infrastructure defined in XML to a semantic data infrastructure using OWL. The framework supports mappings and fully automated instance transformation from syntactic data sources in XML format to a common shared global model defined by an ontology using Semantic Web technologies. The presented framework, JXML2OWL, allows organizations to automatically convert their XML data sources to a semantic model defined in OWL.


Towards Frequent Subgraph Mining on Single Large Uncertain Graphs

Uncertainty is intrinsic to a wide spectrum of real-life applications, which inevitably applies to graph data. Representative uncertain graphs are seen in bio-informatics, social networks, etc. This paper motivates the problem of frequent subgraph mining on single uncertain graphs. We present an enumeration-evaluation algorithm to solve the problem. By showing support computation on an uncertain graph is #P-hard, we develop an approximation algorithm with accuracy guarantee for this purpose. To enhance the solution, we devise optimization techniques to achieve better mining performance. Experiment results on real-life data confirm the usability of the algorithm.


Use of RFID Based Real Time Location Tracking System to Curb Diversion of Transit Goods in East Africa

In this paper, RFID based Real Time Location Tracking System (RTLS) for tracking transit goods is discussed. The system was designed to address the problem of diversions of transit wet cargo destined for hinterland countries into the local markets, so as to evade payment of duties and taxes. Transit goods are currently tracked manually and by use of manual physical escorts. Reliance on manual methods has rendered the system open to abuse by unscrupulous traders and clearing agents; at times in collusion with government officers. To be effective in tracking wet cargo, the required solution was established to be one that not only provides information in real time but also with features for intervention when cargo is perceived to be at risk. This paper discusses the design and implementation of RTLS for tracking wet cargo, and points out the strenghts, benefits, weaknesses and limitations of the solution. The effectiveness of the solution was demonstrated in addressing the weaknesses of the current manual tracking system in curbing diversion for wet cargo. In addition, the use of RTLS led to a reduction in turn around times by between thirty to forty percent compared to those which are manualy tracked. KeywordsElectronic Seals, RFID, Transit goods, Tanker Tracking, Real Time Location Tracking Systems, Cargo Tracking


Review of Face Recognition Techniques

Use of Biometrics and widespread acceptability for person authentication has instigated several techniques. Now a day’s security is very important. Biometrics has received a great attention. Face biometrics, is useful person’s authentication that recognizes face. In this paper first we represent an overview of face recognition and discuss the methodology and functioning. Thereafter we represent face recognition techniques which are recently used including their advantages and disadvantages. A large number of face recognition algorithms have been developed. In this paper an attempt is made to review a wide range of methods including PCA, Eigen face, LDA for recognition and hybrid combination if this techniques. Under the various illumination and expression condition of face images some techniques specified here also improves the efficiency of face recognition. Keywords— Face Recognition, Principal Component Analysis, Eigen Face, Linear Discriminant Analysis


Experiences of System-Level Model-Based GUI Testing of an Android Application

This paper presents experiences in model-based graphical user interface testing of Android applications. We present how model-based testing and test automation was implemented with Android, including how applications were modeled, how tests were designed and executed, and what kind of problems were found in the tested application during the whole process. The main focus is on a case study that was performed with an Android application, the BBC News Widget. Our goal is to present actual data on the experiences and to discuss if advantages can be gained using model-based testing when compared with traditional graphical user interface testing. Another contribution of this paper is a description of a keyword-based test automation tool that was implemented for the Android emulator during the case study. All the models and the tools created or used in this case study are available as open source.


Network Slicing in 5G Mobile Communication Architecture, Profit Modeling, and Challenges

Efficient flexibility and higher system scalability call for enhanced network performance, better energy consumption, lower infrastructure cost, and effective resource utilization. To accomplish this, an architectural optimization and reconstruction of existing cellular network is required. Network slicing is considered to be one of the key enablers and an architectural answer of communication system of 2020 and beyond. Traditional mobile operators provide all types of services to various kinds of customers through a single network, however, with the deployment of network slicing operators are now able to divide entire network into different slices each with its own configuration and specific Quality of Service (QoS) requirements. In a slice-based network, each slice will be considered as a separate logical network. In this way, the infrastructure utilization and resource allocation will be much more energy and cost efficient in comparison to traditional network. In this paper, we provided a comprehensive discussion on concept and system architecture of network slicing with particular focus on its business aspect and profit modeling. We throughly discussed two different dimensions of profit modeling, so called Own-Slice Implementation and Resource Leasing for Outsourced Slices. We further addressed open research directions and existing challenges with the purpose of motivating new advances and adding realistic solutions to this emerging technology.


A 0.8V, 560fJ/bit, 14Gb/s injection-locked receiver with input duty-cycle distortion tolerable edge-rotating 5/4X sub-rate CDR in 65nm CMOS

A quarter-rate forwarded-clock receiver utilizes an edge-rotating 5/4X sub-rate CDR for improved jitter tolerance with low power overhead relative to conventional 2X oversampling CDR systems. Low-voltage operation is achieved with efficient quarter-rate clock generation from an injection-locked oscillator (ILO) and through automatic independent phase rotator control that optimizes timing margin of each input quantizer in the presence of receive-side clock static phase errors and transmitter duty-cycle distortion (DCD). Fabricated in GP 65nm CMOS, the receiver operates up to 16Gb/s with a BER<;10-12, achieves a 1MHz phase tracking bandwidth, tolerates ±50%UIpp DCD on input data, and has 14Gb/s energy efficiency of 560fJ/bit at VDD=0.8V.