Query: Dimensional inconsistencies in code and ROS messages: A study of 5.9M lines of code

Relevant passages:
Types for Units-of-Measure: Theory and Practice <=SEP=> Units-of-measure are to science what types are to programming. In science and engineering, dimensional and unit consistency provides a first check on the correctness of an equation or formula, just as in programming the passing of a program by the type-checker eliminates one possible reason for failure. Units-of-measure errors can have catastrophic consequences, the most famous of which was the loss in September 1999 of NASA’s Mars Climate Orbiter probe, caused by a confusion between newtons (the SI unit of force) and lbf (poundforce, a unit of force sometimes used in the US). The report into the disaster made many recommendations [14]. Notably absent, though, was any suggestion that programming languages might assist in the prevention of such errors, either through static analysis tools, or through type-checking. Over the years, many people have suggested ways of extending programming languages with support for static checking of units-of-measure. It’s even possible to abuse the rich type systems of existing languages such as C++ and Haskell to achieve it, but at some cost in usability [18, 6]. More recently, Sun’s design for its Fortress programming language has included type system support for dimensions and units [2]. In this short course, we’ll look at the design supported by the F# programming language, the internals of its type system, and the theoretical basis for units safety. The tutorial splits into three parts:

ROS: an open-source Robot Operating System <=SEP=> This paper gives an overview of ROS, an opensource robot operating system. ROS is not an operating system in the traditional sense of process management and scheduling; rather, it provides a structured communications layer above the host operating systems of a heterogenous compute cluster. In this paper, we discuss how ROS relates to existing robot software frameworks, and briefly overview some of the available application software which uses ROS.

Programming languages and dimensions <=SEP=> Scientists and engineers must ensure that the equations and formulae which they use are dimensionally consistent, but existing programming languages treat all numeric values as dimensionless. This thesis investigates the extension of programming languages to support the notion of physical dimension. A type system is presented similar to that of the programming language ML but extended with polymorphic dimension types. An algorithm which infers most general dimension types automatically is then described and proved correct. The semantics of the language is given by a translation into an explicitlytyped language in which dimensions are passed as arguments to functions. The operational semantics of this language is specified in the usual way by an evaluation relation defined by a set of rules. This is used to show that if a program is well-typed then no dimension errors can occur during its evaluation. More abstract properties of the language are investigated using a denotational semantics: these include a notion of invariance under changes in the units of measure used, analogous to parametricity in the polymorphic lambda calculus. Finally the dissertation is summarised and many possible directions for future research in dimension types and related type systems are described.

Development environments for autonomous mobile robots: A survey <=SEP=> Robotic Development Environments (RDEs) have come to play an increasingly important role in robotics research in general, and for the development of architectures for mobile robots in particular. Yet, no systematic evaluation of available RDEs has been performed; establishing a comprehensive list of evaluation criteria targeted at robotics applications is desirable that can subsequently be used to compare their strengths and weaknesses. Moreover, there are no practical evaluations of the usability and impact of a large selection of RDEs that provides researchers with the information necessary to select an RDE most suited to their needs, nor identifies trends in RDE research that suggest directions for future RDE development. This survey addresses the above by selecting and describing nine open source, freely available RDEs for mobile robots, evaluating and comparing them from various points of view. First, based on previous work concerning agent systems, a conceptual framework of four broad categories is established, encompassing the characteristics and capabilities that an RDE supports. Then, a practical evaluation of RDE usability in designing, implementing, and executing robot architectures is presented. Finally, the impact of specific RDEs on the field of robotics is addressed by providing a list of published applications and research projects that give concrete examples of areas in which systems have been used. The comprehensive evaluation and comparison of the nine RDEs concludes with suggestions of how to use the results of this survey and a brief discussion of future trends in RDE design.

Term rewriting and all that <=SEP=> 

VQM-based QoS/QoE mapping for streaming video <=SEP=> Numerous new broadband and multimedia applications have emerged in recent years, in which streaming video services are particularly of interest. Unlike data communication, streaming video requires a subjective measure of quality referred to as the Quality of Experience (QoE), but the subjective evaluation is very time consuming and complex. We are proposing an objective approach to provide mapping between QoE and Quality of Service (QoS), in which Video Quality Metric (VQM) is utilized to indicate QoE. We have analyzed the emulation results and derived a simple formula to estimate QoE from QoS parameters for streaming video under certain conditions. This method is non-intrusive and quick to use.

Biologically Plausible, Human-Scale Knowledge Representation <=SEP=> Several approaches to implementing symbol-like representations in neurally plausible models have been proposed. These approaches include binding through synchrony (Shastri & Ajjanagadde, ), "mesh" binding (van der Velde & de Kamps, ), and conjunctive binding (Smolensky, ). Recent theoretical work has suggested that most of these methods will not scale well, that is, that they cannot encode structured representations using any of the tens of thousands of terms in the adult lexicon without making implausible resource assumptions. Here, we empirically demonstrate that the biologically plausible structured representations employed in the Semantic Pointer Architecture (SPA) approach to modeling cognition (Eliasmith, ) do scale appropriately. Specifically, we construct a spiking neural network of about 2.5 million neurons that employs semantic pointers to successfully encode and decode the main lexical relations in WordNet, which has over 100,000 terms. In addition, we show that the same representations can be employed to construct recursively structured sentences consisting of arbitrary WordNet concepts, while preserving the original lexical structure. We argue that these results suggest that semantic pointers are uniquely well-suited to providing a biologically plausible account of the structured representations that underwrite human cognition.

Nanoconnectomic upper bound on the variability of synaptic plasticity <=SEP=> Information in a computer is quantified by the number of bits that can be stored and recovered. An important question about the brain is how much information can be stored at a synapse through synaptic plasticity, which depends on the history of probabilistic synaptic activity. The strong correlation between size and efficacy of a synapse allowed us to estimate the variability of synaptic plasticity. In an EM reconstruction of hippocampal neuropil we found single axons making two or more synaptic contacts onto the same dendrites, having shared histories of presynaptic and postsynaptic activity. The spine heads and neck diameters, but not neck lengths, of these pairs were nearly identical in size. We found that there is a minimum of 26 distinguishable synaptic strengths, corresponding to storing 4.7 bits of information at each synapse. Because of stochastic variability of synaptic activation the observed precision requires averaging activity over several minutes.

Online Attendance Management System Using RFID with Object Counter <=SEP=> Educational institutions’ administrators in our country and the whole world are concerned about regularity of student attendance. Student overall academic performance is affected by it. The conventional method of taking attendance by calling names or signing on paper is very time consuming, and hence inefficient. Radio Frequency Identification (RFID) based attendance system is one of the solutions to address this problem. A system that can automatically capture student’s attendance by flashing their student card at the RFID reader and save all the mentioned troubles was given by T.S.Lim et al. [1].The RFID system using web-based applications such as ASP.NET and IIS server to cater the recording and reporting of the students’ attendances was given by Abdul Aziz Mohammed et.al. [2]. Arulogun O. T. et al made an attempt to solve recurrent lecture attendance monitoring problem in developing countries using RFID technology [3]. Rajan Patel et al [4] presents the integration of ubiquitous computing systems into classroom for managing the students’ attendance using RFID technology. H.B. Hamid et al [5] gave a system that has been built using the web-based applications such as JSP, MySQL and Apache to cater the recording and reporting of the students’ attendances. NetBeans IDE 6.1 is used for developing the overall system. We have proposed the system in this paper using C#. Microsoft Visual Studio is used for the system designing. Also, the issue related to fake /false attendance through the RFID system has been addressed, we eliminate it by using a special object counter for the head count. Ankita Agrawal & Ashish Bansal 132

Model-based evaluation: from dependability to security <=SEP=> The development of techniques for quantitative, model-based evaluation of computer system dependability has a long and rich history. A wide array of model-based evaluation techniques is now available, ranging from combinatorial methods, which are useful for quick, rough-cut analyses, to state-based methods, such as Markov reward models, and detailed, discrete-event simulation. The use of quantitative techniques for security evaluation is much less common, and has typically taken the form of formal analysis of small parts of an overall design, or experimental red team-based approaches. Alone, neither of these approaches is fully satisfactory, and we argue that there is much to be gained through the development of a sound model-based methodology for quantifying the security one can expect from a particular design. In this work, we survey existing model-based techniques for evaluating system dependability, and summarize how they are now being extended to evaluate system security. We find that many techniques from dependability evaluation can be applied in the security domain, but that significant challenges remain, largely due to fundamental differences between the accidental nature of the faults commonly assumed in dependability evaluation, and the intentional, human nature of cyber attacks.

The use of socially assistive robots in the design of intelligent cognitive therapies for people with dementia <=SEP=> Currently the 2 percent growth rate for the world's older population exceeds the 1.2 rate for the world's population as a whole. By 2050, the number of individuals over the age 85 is projected to be three times more than there is today. Most of these individuals will need physical, emotional, and cognitive assistance. In this paper, we present a new adaptive robotic system based on the socially assistive robotics (SAR) technology that tries to provide a customized help protocol through motivation, encouragements, and companionship to users suffering from cognitive changes related to aging and/or Alzheimer's disease. Our results show that this approach can engage the patients and keep them interested in interacting with the robot, which, in turn, increases their positive behavior.

3D deep convolutional neural networks for amino acid environment similarity analysis <=SEP=> Central to protein biology is the understanding of how structural elements give rise to observed function. The surfeit of protein structural data enables development of computational methods to systematically derive rules governing structural-functional relationships. However, performance of these methods depends critically on the choice of protein structural representation. Most current methods rely on features that are manually selected based on knowledge about protein structures. These are often general-purpose but not optimized for the specific application of interest. In this paper, we present a general framework that applies 3D convolutional neural network (3DCNN) technology to structure-based protein analysis. The framework automatically extracts task-specific features from the raw atom distribution, driven by supervised labels. As a pilot study, we use our network to analyze local protein microenvironments surrounding the 20 amino acids, and predict the amino acids most compatible with environments within a protein structure. To further validate the power of our method, we construct two amino acid substitution matrices from the prediction statistics and use them to predict effects of mutations in T4 lysozyme structures. Our deep 3DCNN achieves a two-fold increase in prediction accuracy compared to models that employ conventional hand-engineered features and successfully recapitulates known information about similar and different microenvironments. Models built from our predictions and substitution matrices achieve an 85% accuracy predicting outcomes of the T4 lysozyme mutation variants. Our substitution matrices contain rich information relevant to mutation analysis compared to well-established substitution matrices. Finally, we present a visualization method to inspect the individual contributions of each atom to the classification decisions. End-to-end trained deep learning networks consistently outperform methods using hand-engineered features, suggesting that the 3DCNN framework is well suited for analysis of protein microenvironments and may be useful for other protein structural analyses.

Wireless Technologies for IoT in Smart Cities <=SEP=> As cities continue to grow, numerous initiatives for Smart Cities are being conducted. The concept of Smart City encompasses several concepts being governance, economy, management, infrastructure, technology and people. This means that a Smart City can have different communication needs. Wireless technologies such as WiFi, ZigBee, Bluetooth, WiMax, 4G or LTE (Long Term Evolution) have presented themselves as solutions to the communication needs of Smart City initiatives. However, as most of them employ unlicensed bands, interference and coexistence problems are increasing. In this paper, the wireless technologies available nowadays for IoT (Internet of Things) in Smart Cities are presented. Our contribution is a review of wireless technologies, their comparison and the problems that difficult coexistence among them. In order to do so, the characteristics and adequacy of wireless technologies to each domain are considered. The problems derived of over-crowded unlicensed spectrum and coexistence difficulties among each technology are discussed as well. Finally, power consumption concerns are addressed.

Chinese Image Text Recognition on grayscale pixels <=SEP=> This paper presents a novel scheme for Chinese text recognition in images and videos. It's different from traditional paradigms that binarize text images, fed the binarized text to an OCR engine and get the recognized results. The proposed scheme, named grayscale based Chinese Image Text Recognition (gCITR), implements the recognition directly on grayscale pixels via the following steps: image text over-segmentation, building recognition graph, Chinese character recognition and beam search determination. The advantages of gCITR lie in: (1) it does not heavily rely on the performance of binarization, which is not robust in practical and thus severely affects the performance of OCR, (2) grayscale image retains more information of the text thus facilitates the recognition. Experimental results on text from 13 TV news videos demonstrate the effectiveness of the proposed gCITR, from which significant performance gains are observed.

Applying Stochastic Integer Programming to Optimization of Resource Scheduling in Cloud Computing <=SEP=> Resource scheduling based on SLA(Service Level Agreement) in cloud computing is NP-hard problem. There is no efficient method to solve it. This paper proposes an optimal model for the problem and give an algorithm by applying stochastic integer programming technique. Applying Gröbner bases theory for solving the stochastic integer programming problem and the experimental results of the implementation are also presented.

An efficient Bayesian inference framework for coalescent-based nonparametric phylodynamics <=SEP=> MOTIVATION
The field of phylodynamics focuses on the problem of reconstructing population size dynamics over time using current genetic samples taken from the population of interest. This technique has been extensively used in many areas of biology but is particularly useful for studying the spread of quickly evolving infectious diseases agents, e.g. influenza virus. Phylodynamic inference uses a coalescent model that defines a probability density for the genealogy of randomly sampled individuals from the population. When we assume that such a genealogy is known, the coalescent model, equipped with a Gaussian process prior on population size trajectory, allows for nonparametric Bayesian estimation of population size dynamics. Although this approach is quite powerful, large datasets collected during infectious disease surveillance challenge the state-of-the-art of Bayesian phylodynamics and demand inferential methods with relatively low computational cost.


RESULTS
To satisfy this demand, we provide a computationally efficient Bayesian inference framework based on Hamiltonian Monte Carlo for coalescent process models. Moreover, we show that by splitting the Hamiltonian function, we can further improve the efficiency of this approach. Using several simulated and real datasets, we show that our method provides accurate estimates of population size dynamics and is substantially faster than alternative methods based on elliptical slice sampler and Metropolis-adjusted Langevin algorithm.


AVAILABILITY AND IMPLEMENTATION
The R code for all simulation studies and real data analysis conducted in this article are publicly available at http://www.ics.uci.edu/∼slan/lanzi/CODES.html and in the R package phylodyn available at https://github.com/mdkarcher/phylodyn.


CONTACT
S.Lan@warwick.ac.uk or babaks@uci.edu


SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.

ZooKeeper: Wait-free Coordination for Internet-scale Systems <=SEP=> In this paper, we describe ZooKeeper, a service for coordinating processes of distributed applications. Since ZooKeeper is part of critical infrastructure, ZooKeeper aims to provide a simple and high performance kernel for building more complex coordination primitives at the client. It incorporates elements from group messaging, shared registers, and distributed lock services in a replicated, centralized service. The interface exposed by ZooKeeper has the wait-free aspects of shared registers with an event-driven mechanism similar to cache invalidations of distributed file systems to provide a simple, yet powerful coordination service. The ZooKeeper interface enables a high-performance service implementation. In addition to the wait-free property, ZooKeeper provides a per client guarantee of FIFO execution of requests and linearizability for all requests that change the ZooKeeper state. These design decisions enable the implementation of a high performance processing pipeline with read requests being satisfied by local servers. We show for the target workloads, 2:1 to 100:1 read to write ratio, that ZooKeeper can handle tens to hundreds of thousands of transactions per second. This performance allows ZooKeeper to be used extensively by client applications.

Performance Analysis of Enhanced SPECK Algorithm <=SEP=> A secure lightweight block cipher is an effective security solution for applications running on resource-constrained devices. The SPECK family of lightweight block ciphers is designed for low-end devices that need data security. The randomness of the keystream produced by this algorithm is a good indicator of its security strength. Nevertheless, the computed proportion of sequences based on empirical test results falls beyond the range of acceptable interval, an evidence of non-randomness to each algorithm. In this study, the researchers enhanced SPECK (k-SPECK) through the addition of a key derivation function in its processes. Both SPECK and k - SPECK were evaluated with the two sophisticated statistical test suite. The result shows that k - SPECK outperformed SPECK in terms of randomness as its three variations successfully passed all the test of statistical packages NIST and DieHarder, making it more cryptographically secured. Similarly, software implementation was also evaluated showing that k - SPECK 128/192 and 128/256 performed faster in encryption cycle compared to SPECK.

Macro process of knowledge management for continuous innovation <=SEP=> Purpose The purpose of this research is to understand the mechanisms of knowledge management (KM) for innovation and provide an approach for enterprises to leverage KM activities into continuous innovation. Design/methodology/approach – By reviewing the literature from multidisciplinary fields, the concepts of knowledge, KM and innovation are investigated. The physical, human and technological perspectives of KM are distinguished with the identification of two core activities for innovation: knowledge creation and knowledge usage. Then an essential requirement for continuous innovation –an internalization phase is defined. The systems thinking and human-centred perspectives are adopted for providing a comprehensive understanding about the mechanisms of KM for innovation. Findings – A networking process of continuous innovation based on KM is proposed by incorporating the phase of internalization. According to the three perspectives of KM, three sources of organizational knowledge assets in innovation are identified. Then based on the two core activities of innovation, a meta-model and a macro process of KM are proposed to model the mechanisms of KM for continuous innovation. Then, in order to operationalize the KM mechanisms, a hierarchical model is constructed by integrating three sources of knowledge assets, the meta-model and the macro process into the process of continuous innovation. This model decomposes the complex relationships between knowledge and innovation into four layers. Practical implications – According to the lessons learned about KM practices in previous research, the three perspectives of KM should collaborate with each other for successful implementation of KM projects for innovation; and the hierarchical model provides a suitable architecture to implement systems of KM for innovation. Originality/value – The meta-model and macro process of KM explain how the next generation of KM can help the value creation and support the continuous innovation from the systems thinking perspective. The hierarchical model illustrates the complicate knowledge dynamics in the process of continuous innovation.

FPGA Implementations of the Round Two SHA-3 Candidates <=SEP=> The second round of the NIST-run public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). This paper presents the full implementations of all of the second round candidates in hardware with all of their variants. In order to determine their computational efficiency, an important aspect in NIST's round two evaluation criteria, this paper gives an area/speed comparison of each design both with and without a hardware interface, thereby giving an overall impression of their performance in resource constrained and resource abundant environments. The implementation results are provided for a Virtex-5 FPGA device. The efficiency of the architectures for the hash functions are compared in terms of throughput per unit area.

PC-01: Introduction to computational thinking: Educational technology in primary and secondary education <=SEP=> This article describes the design and implementation of the course Introduction to Computational Thinking (PC-01) for primary and secondary education. The course introduces the “concepts” and core “processes” of Computational Thinking using a visual programming environment. The design of the course PC-01 includes a set of multimedia content, learning tools and technologies that help teachers and students in the teaching-learning process. These tools allow the teacher the successful delivery of the course content as well as the individual/collective monitoring of students' progress in the course. Students have access to their progress throughout the course and participate in creative and collaborative tasks. This course also serves to introduce transversely educational technologies to many students of primary and secondary education. The technological environment integrates the online teaching resources and the methodological tools of the course. The course uses Scratch 2.0 as the programming environment and Moodle as the learning platform. At present the course is being implemented in public schools in the Dominican Republic.

A Questionnaire Approach based on the Technology Acceptance Model for Mobile tracking on Patient progress Applications <=SEP=> Healthcare professionals spend much of their time wandering between patients and offices, while the supportive technology stays stationary. Therefore, mobile applications has adapted for healthcare industry. In spite of the advancement and variety of available mobile based applications, there is an eminent need to investigate the current position of the acceptance of those mobile health applications that are tailored towards the tracking patients condition, share patients information and access. Consequently, in this study Technology Acceptance Model has designed to investigate the user acceptance of mobile technology application within healthcare industry. The purpose of this study is to design a quantitative approach based on the technology acceptance model questionnaire as its primary research methodology. It utilized a quantitative approach based a Technology Acceptance Model (TAM) to evaluate the system mobile tracking Model. The related constructs for evaluation are: Perceived of Usefulness, Perceived Ease of Use, User Satisfaction and Attribute of Usability. All these constructs are modified to suit the context of the study. Moreover, this study outlines the details of each construct and its relevance toward the research issue. The outcome of the study represents series of approaches that will apply for checking the suitability of a mobile tracking on patient progress application for health care industry and how well it achieves the aims and objectives of the design.

Soft Switching Circuit for Interleaved Boost Converters <=SEP=> A zero-voltage switching-zero-current switching interleaved boost converter is proposed in this paper. An active circuit branch in parallel with the main switches is added and it is composed of an auxiliary switch and a snubber capacitor. By using this interleaved converter topology, zero current turn-on and zero voltage turn-off of the main switches can be achieved and the reverse-recovery loss of boost diode can be reduced. In addition, the auxiliary switches are zero-voltage transmission during the whole switching transition. A prototype of boost converter rated at 1.2kW has been built to confirm the effectiveness of the converter

Automatic artifact removal from EEG - a mixed approach based on double blind source separation and support vector machine <=SEP=> Electroencephalography (EEG) recordings are often obscured by physiological artifacts that can render huge amounts of data useless and thus constitute a key challenge in current brain-computer interface research. This paper presents a new algorithm that automatically and reliably removes artifacts from EEG based on blind source separation and support vector machine. Performance on a motor imagery task is compared for artifact-contaminated and preprocessed signals to verify the accuracy of the proposed approach. The results showed improved results over all datasets. Furthermore, the online applicability of the algorithm is investigated.

Static and dynamic 3D facial expression recognition: A comprehensive survey <=SEP=> a r t i c l e i n f o Keywords: Facial behaviour analysis Facial expression recognition 3D facial surface 3D facial surface sequences (4D faces) Automatic facial expression recognition constitutes an active research field due to the latest advances in computing technology that make the user's experience a clear priority. The majority of work conducted in this area involves 2D imagery, despite the problems this presents due to inherent pose and illumination variations. In order to deal with these problems, 3D and 4D (dynamic 3D) recordings are increasingly used in expression analysis research. In this paper we survey the recent advances in 3D and 4D facial expression recognition. We discuss developments in 3D facial data acquisition and tracking, and present currently available 3D/4D face databases suitable for 3D/4D facial expressions analysis as well as the existing facial expression recognition systems that exploit either 3D or 4D data in detail. Finally, challenges that have to be addressed if 3D facial expression recognition systems are to become a part of future applications are extensively discussed. Automatic human behaviour understanding has attracted a great deal of interest over the past two decades, mainly because of its many applications spanning various fields such as psychology, computer technology , medicine and security. It can be regarded as the essence of next-generation computing systems as it plays a crucial role in affective computing technologies (i.e. proactive and affective user interfaces), learner-adaptive tutoring systems, patient-profiled personal wellbeing technologies, etc. [1]. Facial expression is the most cogent, naturally preeminent means for humans to communicate emotions, to clarify and give emphasis, to signal comprehension disagreement, to express intentions and, more generally, to regulate interactions with the environment and other people [2]. These facts highlight the importance of automatic facial behaviour analysis, including facial expression of emotion and facial action unit (AU) recognition, and justify the interest this research area has attracted, in the past twenty years [3,4]. Until recently, most of the available data sets of expressive faces were of limited size containing only deliberately posed affective displays, mainly of the prototypical expressions of six basic emotions (i.e. anger, disgust, fear, happiness, sadness and surprise), recorded under highly controlled conditions. Recent efforts focus on the recognition of complex and spontaneous emotional phenomena (e.g. boredom or lack of attention, frustration , stress, etc.) rather than on the recognition of deliberately displayed prototypical expressions of emotions [5,4,6,7]. However, most …

An End-to-End Multitask Learning Model for Fact Checking <=SEP=> With huge amount of information generated every day on the web, fact checking is an important and challenging task which can help people identify the authenticity of most claims as well as providing evidences selected from knowledge source like Wikipedia. Here we decompose this problem into two parts: an entity linking task (retrieving relative Wikipedia pages) and recognizing textual entailment between the claim and selected pages. In this paper, we present an end-to-end multi-task learning with bi-direction attention (EMBA) model to classify the claim as “supports”, “refutes” or “not enough info” with respect to the pages retrieved and detect sentences as evidence at the same time. We conduct experiments on the FEVER (Fact Extraction and VERification) paper test dataset and shared task test dataset, a new public dataset for verification against textual sources. Experimental results show that our method achieves comparable performance compared with the baseline system.

OctoMap : A Probabilistic , Flexible , and Compact 3 D Map Representation for Robotic Systems <=SEP=> In this paper, we present an approach for modeling 3D environments based on octrees using a probabilistic occupancy estimation. Our technique is able to represent full 3D models including free and unknown areas. It is available as an open-source library to facilitate the development of 3D mapping systems. We also provide a detailed review of existing approaches to 3D modeling. Our approach was thoroughly evaluated using different real-world and simulated datasets. The results demonstrate that our approach is able to model the data probabilistically while, at the same time, keeping the memory requirement at a minimum.

Proximal Tibiofibular Joint Instability and Treatment Approaches: A Systematic Review of the Literature. <=SEP=> PURPOSE
To evaluate the treatment options, outcomes, and complications associated with proximal tibiofibular joint (PTFJ) instability, which will aim to improve surgical treatment of PTFJ instability and aid surgeons in their decision making and treatment selection.


METHODS
A systematic review was performed according to Preferred Reporting Items for Systematic Review and Meta-Analysis guidelines. Inclusion criteria were as follows: PTFJ instability treatment techniques, PTFJ surgical outcomes, English language, and human studies. Exclusion criteria were cadaveric studies, animal studies, basic science articles, editorial articles, review articles, and surveys. Furthermore, we excluded studies that did not report patient follow-up time and studies without any patient-reported, clinical or radiographic outcomes at the final follow-up.


RESULTS
The systematic review identified 44 studies (96 patients) after inclusion and exclusion criteria application. For the treatment of PTFJ instability, there were 18 studies (35 patients) describing nonoperative management, 3 studies (4 patients) reported on open reduction, 11 studies (25 patients) reported on fixation, 4 studies (10 patients) that described proximal fibula resection, 3 studies (11 patients) reported on adjustable cortical button repair, 2 studies (3 patients) reported on ligament reconstructions, and 5 (8 patients) studies reported on biceps femoris tendon rerouting. The most (77% to 90%) PTFJ dislocations and instability were anterolateral/unspecified anterior dislocation or instability. Improved outcomes after all forms of PTFJ instability treatment were reported; however, high complication rates were associated with both PTFJ fixation (28%) and fibular head resection (20%).


CONCLUSIONS
Improved outcomes can be expected after surgical treatment of PTFJ instability. Proximal tibiofibular ligament reconstruction, specifically biceps rerouting and anatomic graft reconstruction, leads to improved outcomes with low complication rates. Nonoperative treatment is associated with persistent symptoms, whereas both fixation and fibular head resection are associated with high complication rates.


LEVEL OF EVIDENCE
Level IV, systematic review of level IV studies.

Knowledge Graph Embedding with Numeric Attributes of Entities <=SEP=> Knowledge Graph (KG) embedding projects entities and relations into low dimensional vector space, which has been successfully applied in KG completion task. The previous embedding approaches only model entities and their relations, ignoring a large number of entities’ numeric attributes in KGs. In this paper, we propose a new KG embedding model which jointly model entity relations and numeric attributes. Our approach combines an attribute embedding model with a translation-based structure embedding model, which learns the embeddings of entities, relations, and attributes simultaneously. Experiments of link prediction on YAGO and Freebase show that the performance is effectively improved by adding entities’ numeric attributes in the embedding model.

Improving Distributional Similarity with Lessons Learned from Word Embeddings <=SEP=> Recent trends suggest that neural-network-inspired word embedding models outperform traditional count-based distributional models on word similarity and analogy detection tasks. We reveal that much of the performance gains of word embeddings are due to certain system design choices and hyperparameter optimizations, rather than the embedding algorithms themselves. Furthermore, we show that these modifications can be transferred to traditional distributional models, yielding similar gains. In contrast to prior reports, we observe mostly local or insignificant performance differences between the methods, with no global advantage to any single approach over the others.