‘Internet Addiction’: A Critical Review

It has been alleged by some academics that excessive Internet use can be pathological and addictive. This paper reviews what is known from the empirical literature on ‘Internet addiction’ and its derivatives (e.g., Internet Addiction Disorder, Pathological Internet Use, etc.) and assesses to what extent it exists. Empirical research into ‘Internet addiction’ can roughly be divided into five areas: (1) survey studies that compare excessive Internet users with non-excessive users, (2) survey studies that have examined vulnerable groups of excessive Internet use, most notably students, (3) studies that examine the psychometric properties of excessive Internet use, (4) case studies of excessive Internet users and treatment case studies, and (5) correlational studies examining the relationship of excessive Internet use with other behaviours (e.g., psychiatric problems, depression, self-esteem, etc.). Each of these areas is reviewed. It is concluded that if ‘Internet addiction’ does indeed exist, it affects a relatively small percentage of the online population. However, exactly what it is on the Internet that they are addicted to still remains unclear.


Title Design and realization of a smart battery management system

Battery management system (BMS) emerges a decisive system component in battery-powered applications, such as (hybrid) electric vehicles and portable devices. However, due to the inaccurate parameter estimation of aged battery cells and multi-cell batteries, current BMSs cannot control batteries optimally, and therefore affect the usability of products. In this paper, we proposed a smart management system for multi-cell batteries, and discussed the development of our research study in three directions: i) improving the effectiveness of battery monitoring and current sensing, ii) modeling the battery aging process, and iii) designing a self-healing circuit system to compensate performance variations due to aging and other variations.


ModSpec: An open, flexible specification framework for multi-domain device modelling

We describe ModSpec, a MATLAB/Octave based specification format suitable for modelling devices across a wide variety of application domains, including circuits, optics, fluidics and biology. The ModSpec format and associated API are centered around describing the nonlinear differential equations at the core of any device model. The format is open, general and easy to use, and is supported by toolchains that translate and automatically differentiate models, set up equations for systems of interacting devices, and provide simulation facilities. We illustrate the use of ModSpec for modelling semiconductor, photovoltaic, fluidic and neuronal devices and systems.


An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions. Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1–40]. However, it creates duplicate prefixes, thus expanding the search tree. This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search. 2011 Elsevier B.V. All rights reserved. . All rights reserved. x: +82 2 313 8053.


Happiness Runs in a Circular Motion : Evidence for a Positive Feedback Loop between Prosocial Spending and Happiness

We examine whether a positive feedback loop exists between spending money on others (i.e. prosocial spending) and happiness. Participants recalled a previous purchase made for either themselves or someone else and then reported their happiness. Afterward, participants chose whether to spend a monetary windfall on themselves or someone else. Participants assigned to recall a purchase made for someone else reported feeling significantly happier immediately after this recollection; most importantly, the happier participants felt, the more likely they were to choose to spend a windfall on someone else in the near future. Thus, by providing initial evidence for a positive feedback loop between prosocial spending and well-being, these data offer one potential path to sustainable happiness: prosocial spending increases happiness which in turn encourages prosocial spending.


Accessory Axillary Breast Tissues

Dr. Emsen recently published a case report describing a patient with accessory axillary breast tissue treated with ultrasound-guided liposuction [3]. We recently treated a similar case of bilateral axillary breast tissue, and we offer our contribution to the debate (Figs. 1, 2). Accessory axillary breast tissues are common embriogenic alterations found in 1% to 6% of women that often manifest bilaterally [1,2]. Ectopic breast tissue is at risk for benign and malignant breast disease with reported diagnoses of fibrocystic disease, mastitis, fibroadenoma, atypical hyperplasia, and carcinoma [4 6]. In a review of 82 ectopic breast cancer cases, Marshall et al. [5] found an increased incidence of cancer in aberrant breast tissue. Ectopic cancers located in the axilla seemed to present with more extensive disease at an earlier age, suggesting that aberrant breast tissue may be at increased risk for malignant change. According to this view, as for any ectopic mass, tissue diagnosis is required and mandatory [4]. We recently treated a 43-year-old woman who was asymptomatic until her second pregnancy (2004), when two bilateral masses appeared in axillae and began to increase in size. Six months after parturition, a clear fluid was continuously secreted throughout few small pores on the skin. Ultrasounddiagnosed breast tissue and excision with histologic examination confirmed the radiologic findings. In this case, we preoperatively contemplated, as Dr. Emsen did, less invasive and aesthetic methods such as liposuction. However, a collegial discussion with our pathologist and an analysis of literature data suggested en bloc removal for a more precise analysis not only of cellular, but also of histologic characteristics of suspected mammary ducts. We believe that liposuction, more traumatic on tissues than simple excision, does not allow for this. Furthermore, although liposuction leaves minimal incision scars, the Fig. 1. A 43-year-old woman. Right axilla with accessory breast tissue.


2D ear classification based on unsupervised clustering

Ear classification refers to the process by which an input ear image is assigned to one of several pre-defined classes based on a set of features extracted from the image. In the context of large-scale ear identification, where the input probe image has to be compared against a large set of gallery images in order to locate a matching identity, classification can be used to restrict the matching process to only those images in the gallery that belong to the same class as the probe. In this work, we utilize an unsupervised clustering scheme to partition ear images into multiple classes (i.e., clusters), with each class being denoted by a prototype or a centroid. A given ear image is assigned class labels (i.e., cluster indices) that correspond to the clusters whose centroids are closest to it. We compare the classification performance of three different texture descriptors, viz. Histograms of Oriented Gradients, uniform Local Binary Patterns and Local Phase Quantization. Extensive experiments using three different ear datasets suggest that the Local Phase Quantization texture descriptor scheme along with PCA for dimensionality reduction results in a 96.89% hit rate (i.e., 3.11% pre-selection error rate) with a penetration rate of 32.08%. Further, we demonstrate that the hit rate improves to 99.01% with a penetration rate of 47.10% when a multi-cluster search strategy is employed.


Beyond the PDP-11: Architectural Support for a Memory-Safe C Abstract Machine

We propose a new memory-safe interpretation of the C abstract machine that provides stronger protection to benefit security and debugging. Despite ambiguities in the specification intended to provide implementation flexibility, contemporary implementations of C have converged on a memory model similar to the PDP-11, the original target for C. This model lacks support for memory safety despite well-documented impacts on security and reliability.
 Attempts to change this model are often hampered by assumptions embedded in a large body of existing C code, dating back to the memory model exposed by the original C compiler for the PDP-11. Our experience with attempting to implement a memory-safe variant of C on the CHERI experimental microprocessor led us to identify a number of problematic idioms. We describe these as well as their interaction with existing memory safety schemes and the assumptions that they make beyond the requirements of the C specification. Finally, we refine the CHERI ISA and abstract model for C, by combining elements of the CHERI capability model and fat pointers, and present a softcore CPU that implements a C abstract machine that can run legacy C code with strong memory protection guarantees.


Design principles for sensemaking support systems in environmental sustainability transformations

Correspondence: Stefan Seidel, University of Liechtenstein, Fuerst-Franz-Josef-Strasse 23, 9490 Vaduz, Liechtenstein. Tel: +423 265 1303; E-mail: stefan.seidel@uni.li Abstract This paper reports on the results of a design science research (DSR) study that develops design principles for information systems (IS) that support organisational sensemaking in environmental sustainability transformations. We identify initial design principles based on salient affordances required in organisational sensemaking and revise them through three rounds of developing, demonstrating and evaluating a prototypical implementation. Through our analysis, we learn how IS can support essential sensemaking practices in environmental sustainability transformations, including experiencing disruptive ambiguity through the provision of environmental data, noticing and bracketing, engaging in an open and inclusive communication and presuming potential alternative environmentally responsible actions. We make two key contributions: First, we provide a set of theory-inspired design principles for IS that support sensemaking in sustainability transformations, and revise them empirically using a DSR method. Second, we show how the concept of affordances can be used in DSR to investigate how IS can support organisational practices. While our findings are based on the investigation of the substantive context of environmental sustainability transformation, we suggest that they might be applicable in a broader set of contexts of organisational sensemaking and thus for a broader class of sensemaking support systems. European Journal of Information Systems (2017). doi:10.1057/s41303-017-0039-0


Transforming Web Tables to a Relational Database

HTML tables represent a significant fraction of web data. The often complex headers of such tables are determined accurately using their indexing property. Isolated headers are factored to extract category hierarchies. Web tables are then transformed into a canonical form and imported into a relational database. The proposed processing allows for the formulation of arbitrary SQL queries over the collection of induced relational tables. Keywords—table segmentation; Wang categories; header paths; relational table SQL queries


MULTIPLE-ATTRIBUTE TEXT REWRITING

The dominant approach to unsupervised “style transfer” in text is based on the idea of learning a latent representation, which is independent of the attributes specifying its “style”. In this paper, we show that this condition is not necessary and is not always met in practice, even with domain adversarial training that explicitly aims at learning such disentangled representations. We thus propose a new model that controls several factors of variation in textual data where this condition on disentanglement is replaced with a simpler mechanism based on back-translation. Our method allows control over multiple attributes, like gender, sentiment, product type, etc., and a more fine-grained control on the trade-off between content preservation and change of style with a pooling operator in the latent space. Our experiments demonstrate that the fully entangled model produces better generations, even when tested on new and more challenging benchmarks comprising reviews with multiple sentences and multiple attributes.


Activity Recognition and Abnormal Behaviour Detection with Recurrent Neural Networks

In this paper, we study the problem of activity recognition and abnormal behaviour detection for elderly people with dementia. Very few studies have attempted to address this problem presumably because of the lack of experimental data in the context of dementia care. In particular, the paper investigates three variants of Recurrent Neural Networks (RNNs): Vanilla RNNs (VRNN), Long Short Term RNNs (LSTM) and Gated Recurrent Unit RNNs (GRU). Here activity recognition is considered as a sequence labelling problem, while abnormal behaviour is flagged based on the deviation from normal patterns. To provide an adequate discussion of the performance of RNNs in this context, we compare them against the state-of-art methods such as Support Vector Machines (SVMs), Naı̈ve Bayes (NB), Hidden Markov Models (HMMs), Hidden Semi-Markov Models (HSMM) and Conditional Random Fields (CRFs). The results obtained indicate that RNNs are competitive with those state-of-art methods. Moreover, the paper presents a methodology for generating synthetic data reflecting on some behaviours of people with dementia given the difficulty of obtaining real-world data. c 6 t r . ublis e ls i r . . i ilit f t f re ce r ra hairs.


Community Evaluation and Exchange of Word Vectors at wordvectors.org

Vector space word representations are useful for many natural language processing applications. The diversity of techniques for computing vector representations and the large number of evaluation benchmarks makes reliable comparison a tedious task both for researchers developing new vector space models and for those wishing to use them. We present a website and suite of offline tools that that facilitate evaluation of word vectors on standard lexical semantics benchmarks and permit exchange and archival by users who wish to find good vectors for their applications. The system is accessible at: www.wordvectors.org.


Central pattern generators for locomotion control in animals and robots: A review

The problem of controlling locomotion is an area in which neuroscience and robotics can fruitfully interact. In this article, I will review research carried out on locomotor central pattern generators (CPGs), i.e. neural circuits capable of producing coordinated patterns of high-dimensional rhythmic output signals while receiving only simple, low-dimensional, input signals. The review will first cover neurobiological observations concerning locomotor CPGs and their numerical modelling, with a special focus on vertebrates. It will then cover how CPG models implemented as neural networks or systems of coupled oscillators can be used in robotics for controlling the locomotion of articulated robots. The review also presents how robots can be used as scientific tools to obtain a better understanding of the functioning of biological CPGs. Finally, various methods for designing CPGs to control specific modes of locomotion will be briefly reviewed. In this process, I will discuss different types of CPG models, the pros and cons of using CPGs with robots, and the pros and cons of using robots as scientific tools. Open research topics both in biology and in robotics will also be discussed.


Inverse Kinematics for a Point-Foot Quadruped Robot with Dynamic Redundancy Resolution

In this work we examine the control of center of mass and swing leg trajectories in LittleDog, a point-foot quadruped robot. It is not clear how to formulate a function to compute forward kinematics of the center of mass of the robot as a function of actuated joint angles because point-foot walkers have no direct actuation between the feet and the ground. Nevertheless, we show that a whole-body Jacobian exists and is well defined when at least three of the feet are on the ground. Also, the typical approach of work-space centering for redundancy resolution causes destabilizing motions when executing fast motions. An alternative redundancy resolution optimization is proposed which projects single-leg inverse kinematic solutions into the nullspace. This hybrid approach seems to minimize 1) unnecessary rotation of the body, 2) twisting of the stance legs, and 3) whole-body involvement in achieving a step leg trajectory. In simulation, this control allows the robot to perform significantly more dynamic behaviors while maintaining stability.


Inverse dynamics control of floating base systems using orthogonal decomposition

Model-based control methods can be used to enable fast, dexterous, and compliant motion of robots without sacrificing control accuracy. However, implementing such techniques on floating base robots, e.g., humanoids and legged systems, is non-trivial due to under-actuation, dynamically changing constraints from the environment, and potentially closed loop kinematics. In this paper, we show how to compute the analytically correct inverse dynamics torques for model-based control of sufficiently constrained floating base rigid-body systems, such as humanoid robots with one or two feet in contact with the environment. While our previous inverse dynamics approach relied on an estimation of contact forces to compute an approximate inverse dynamics solution, here we present an analytically correct solution by using an orthogonal decomposition to project the robot dynamics onto a reduced dimensional space, independent of contact forces. We demonstrate the feasibility and robustness of our approach on a simulated floating base bipedal humanoid robot and an actual robot dog locomoting over rough terrain.


The 3D linear inverted pendulum mode: a simple modeling for a biped walking pattern generation

F or D walkingcontr ol of a biped robot we analyze the dynamics of a three dimensional inverted pendu lum in which motion is constr aine d to move along an arbitr arily de ned plane This analysis leads us a sim ple line ar dynamics the Thr ee Dimensional Linear In verte d Pendulum Mode D LIPM Geometric nature of trajectories under the D LIPM and a method for walking pattern gener ationare discusse d A simula tion r esult of a walking contr ol using a d o f biped robot model is also shown


Capture Point: A Step toward Humanoid Push Recovery

It is known that for a large magnitude push a human or a humanoid robot must take a step to avoid a fall. Despite some scattered results, a principled approach towards "when and where to take a step" has not yet emerged. Towards this goal, we present methods for computing capture points and the capture region, the region on the ground where a humanoid must step to in order to come to a complete stop. The intersection between the capture region and the base of support determines which strategy the robot should adopt to successfully stop in a given situation. Computing the capture region for a humanoid, in general, is very difficult. However, with simple models of walking, computation of the capture region is simplified. We extend the well-known linear inverted pendulum model to include a flywheel body and show how to compute exact solutions of the capture region for this model. Adding rotational inertia enables the humanoid to control its centroidal angular momentum, much like the way human beings do, significantly enlarging the capture region. We present simulations of a simple planar biped that can recover balance after a push by stepping to the capture region and using internal angular momentum. Ongoing work involves applying the solution from the simple model as an approximate solution to more complex simulations of bipedal walking, including a 3D biped with distributed mass.


Zero is Not Enough : On The Lower Limit of Agent Intelligence For Continuous Double Auction Markets †

agent continuous double auction, trade Gode and Sunder's (1993) results from using "zero-intelligence" (ZI) traders, that act randomly within a structured market, appear to imply that convergence to the theoretical equilibrium price in continuous double-auction markets is determined more by market structure than by the intelligence of the traders in that market. However, it is demonstrated here that the average transaction prices of ZI traders can vary significantly from the theoretical equilibrium value when the market supply and demand are asymmetric, and that the degree of difference from equilibrium is predictable from a priori probabilistic analysis. In this sense, it is shown here that Gode and Sunder's results are artefacts of their experimental regime. Following this, 'zero-intelligence-plus' (ZIP) traders are introduced: like ZI traders, these simple agents make stochastic bids. Unlike ZI traders, they employ an elementary form of machine learning. Groups of ZIP traders interacting in experimental markets similar to those used by Smith (1962) and Gode and Sunder (1993) are demonstrated, and we show that the performance of ZIP traders is significantly closer to the human data than is the performance of Gode and Sunder's ZI traders. Because ZI traders are too simple, we offer ZIP traders as a slight upward revision of the intelligence required to achieve equilibrium in continuous double auction markets.


Durable write cache in flash memory SSD for relational and NoSQL databases

In order to meet the stringent requirements of low latency as well as high throughput, web service providers with large data centers have been replacing magnetic disk drives with flash memory solid-state drives (SSDs). They commonly use relational and NoSQL database engines to manage OLTP workloads in the warehouse-scale computing environments. These modern database engines rely heavily on redundant writes and frequent cache flushes to guarantee the atomicity and durability of transactional updates. This has become a serious bottleneck of performance in both relational and NoSQL database engines. This paper presents a new SSD prototype called DuraSSD equipped with tantalum capacitors. The tantalum capacitors make the device cache inside DuraSSD durable, and additional firmware features of DuraSSD take advantage of the durable cache to support the atomicity and durability of page writes. It is the first time that a flash memory SSD with durable cache has been used to achieve an order of magnitude improvement in transaction throughput without compromising the atomicity and durability. Considering that the simple capacitors increase the total cost of an SSD no more than one percent, DuraSSD clearly provides a cost-effective means for transactional support. DuraSSD is also expected to alleviate the problem of high tail latency by minimizing write stalls.


Multi-Task Learning For Parsing The Alexa Meaning Representation Language

The Alexa Meaning Representation Language (AMRL) is a compositional graph-based semantic representation that includes fine-grained types, properties, actions, and roles and can represent a wide variety of spoken language. AMRL increases the ability of virtual assistants to represent more complex requests, including logical and conditional statements as well as ones with nested clauses. Due to this representational capacity, the acquisition of large scale data resources is challenging, which limits the accuracy of resulting models. This paper has two primary contributions. The first contribution is a linearization of the AMRL parses that aligns it to a related task of spoken language understanding (SLU) and a deep neural network architecture that uses multi-task learning to predict AMRL fine-grained types, properties and intents. The second contribution is a deep neural network architecture that leverages embeddings from the large-scale data resources that are available for SLU. When combined, these contributions enable the training of accurate models of AMRL parsing, even in the presence of data sparsity. The proposed models, which use the linearized AMRL parse, multi-task learning, residual connections and embeddings from SLU, decrease the error rates in the prediction of the full AMRL parse by 3.56%


BIER — Boosting Independent Embeddings Robustly

Learning similarity functions between image pairs with deep neural networks yields highly correlated activations of large embeddings. In this work, we show how to improve the robustness of embeddings by exploiting independence in ensembles. We divide the last embedding layer of a deep network into an embedding ensemble and formulate training this ensemble as an online gradient boosting problem. Each learner receives a reweighted training sample from the previous learners. This leverages large embedding sizes more effectively by significantly reducing correlation of the embedding and consequently increases retrieval accuracy of the embedding. Our method does not introduce any additional parameters and works with any differentiable loss function. We evaluate our metric learning method on image retrieval tasks and show that it improves over state-ofthe- art methods on the CUB-200-2011, Cars-196, Stanford Online Products, In-Shop Clothes Retrieval and VehicleID datasets by a significant margin.


MAGIX: Model Agnostic Globally Interpretable Explanations

Explaining the behavior of a black box machine learning model at the instance level is useful for building trust. However, it is also important to understand how the model behaves globally. Such an understanding provides insight into both the data on which the model was trained and the patterns that it learned. We present here an approach that learns if-then rules to globally explain the behavior of black box machine learning models that have been used to solve classification problems. The approach works by first extracting conditions that were important at the instance level and then evolving rules through a genetic algorithm with an appropriate fitness function. Collectively, these rules represent the patterns followed by the model for decisioning and are useful for understanding its behavior. We demonstrate the validity and usefulness of the approach by interpreting black box models created using publicly available data sets as well as a private digital marketing data set.


Integrating occlusion culling with parallel LOD for rendering complex 3D environments on GPU

In many research domains, such as mechanical engineering, game development and virtual reality, a typical output model is usually produced in a multi-object manner for efficient data management. To have a complete description of the whole model, tens of thousands of, or even millions of, such objects are created, which makes the entire dataset exceptionally complex. Consequently, visualizing the model becomes a computationally intensive process that impedes a real-time rendering and interaction.


New Frontiers in Formal Methods: Learning, Cyber-Physical Systems, Education, and Beyond

We survey promising directions for research in the area of formal methods and its applications, including fundamental questions about the combination of formal methods and machine learning, and applications to cyberphysical systems and education.


Electrick: Low-Cost Touch Sensing Using Electric Field Tomography

Current touch input technologies are best suited for small and flat applications, such as smartphones, tablets and kiosks. In general, they are too expensive to scale to large surfaces, such as walls and furniture, and cannot provide input on objects having irregular and complex geometries, such as tools and toys. We introduce Electrick, a low-cost and versatile sensing technique that enables touch input on a wide variety of objects and surfaces, whether small or large, flat or irregular. This is achieved by using electric field tomography in concert with an electrically conductive material, which can be easily and cheaply added to objects and surfaces. We show that our technique is compatible with commonplace manufacturing methods, such as spray/brush coating, vacuum forming, and casting/molding enabling a wide range of possible uses and outputs. Our technique can also bring touch interactivity to rapidly fabricated objects, including those that are laser cut or 3D printed. Through a series of studies and illustrative example uses, we show that Electrick can enable new interactive opportunities on a diverse set of objects and surfaces that were previously static.


Treacher collins syndrome.

Treacher Collins syndrome is a genetic disorder resulting in congenital craniofacial malformation. Patients typically present with downslanting palpebral fissures, lower eyelid colobomas, microtia, and malar and mandibular hypoplasia. This autosomal dominant disorder has a variable degree of phenotypic expression, and patients have no associated developmental delay or neurologic disease. Care for these patients requires a multidisciplinary team from birth through adulthood. Proper planning, counseling and surgical techniques are essential for optimizing patient outcomes. Here the authors review the features, genetics, and treatment of Treacher Collins syndrome.


Generating entangled photon pairs in a parallel crystal geometry

We present recent findings towards developing brighter entangled photon sources in critically phase matched (CPM) nonlinear crystals. Specifically, we use type-I collinear phase matching at non-degenerate wavelengths in parallel β-Barium Borate (BBO) crystals to generate pairs of polarization entangled photons for free-space quantum key distribution (QKD). We first review the entangled source configuration and then discuss ways to further improve the source brightness by means of tailoring the pump and collection modes. We present preliminary results that may lead to brighter entangled photon sources that are intrinsically robust to changes in their environment.


A Survey on Wireless Body Area Networks for eHealthcare Systems in Residential Environments

Current progress in wearable and implanted health monitoring technologies has strong potential to alter the future of healthcare services by enabling ubiquitous monitoring of patients. A typical health monitoring system consists of a network of wearable or implanted sensors that constantly monitor physiological parameters. Collected data are relayed using existing wireless communication protocols to a base station for additional processing. This article provides researchers with information to compare the existing low-power communication technologies that can potentially support the rapid development and deployment of WBAN systems, and mainly focuses on remote monitoring of elderly or chronically ill patients in residential environments.


Primary Object Segmentation in Videos via Alternate Convex Optimization of Foreground and Background Distributions

An unsupervised video object segmentation algorithm, which discovers a primary object in a video sequence automatically, is proposed in this work. We introduce three energies in terms of foreground and background probability distributions: Markov, spatiotemporal, and antagonistic energies. Then, we minimize a hybrid of the three energies to separate a primary object from its background. However, the hybrid energy is nonconvex. Therefore, we develop the alternate convex optimization (ACO) scheme, which decomposes the nonconvex optimization into two quadratic programs. Moreover, we propose the forward-backward strategy, which performs the segmentation sequentially from the first to the last frames and then vice versa, to exploit temporal correlations. Experimental results on extensive datasets demonstrate that the proposed ACO algorithm outperforms the state-of-the-art techniques significantly.


A qualitative evaluation of evolution of a learning analytics tool

New systems are designed with improved quality or features. However, not every new system lives to its pre-development expectations when tested with end-users. The evaluation of the first version of our LOCO-Analyst tool for providing teachers with feedback on students learning activities and performance led to the enhancing the visualization features of the tool. The second evaluation of the improved tool allowed us to see how the improvements affect the user perceptions of the tool. Here, we present the qualitative results of our two evaluations. The results show that educators find the kinds of feedback implemented in the tool informative and they value the mix of textual and graphical representations of different kinds of feedback provided by the tool.


Automatic Readability Classification of Crowd-Sourced Data based on Linguistic and Information-Theoretic Features

This paper presents a classifier of text readability based on information-theoretic features. The classifier was developed based on a linguistic approach to readability that explores lexical, syntactic and semantic features. For this evaluation we extracted a corpus of 645 articles from Wikipedia together with their quality judgments. We show that information-theoretic features perform as well as their linguistic counterparts even if we explore several linguistic levels at once.


Why Deep Learning Is Changing the Way to Approach NGS Data Processing: A Review

Nowadays, big data analytics in genomics is an emerging research topic. In fact, the large amount of genomics data originated by emerging next-generation sequencing (NGS) techniques requires more and more fast and sophisticated algorithms. In this context, deep learning is re-emerging as a possible approach to speed up the DNA sequencing process. In this review, we specifically discuss such a trend. In particular, starting from an analysis of the interest of the Internet community in both NGS and deep learning, we present a taxonomic analysis highlighting the major software solutions based on deep learning algorithms available for each specific NGS application field. We discuss future challenges in the perspective of cloud computing services aimed at deep learning based solutions for NGS.


Rigor mortis in an unusual position: Forensic considerations

We report a case in which the dead body was found with rigor mortis in an unusual position. The dead body was lying on its back with limbs raised, defying gravity. Direction of the salivary stains on the face was also defying the gravity. We opined that the scene of occurrence of crime is unlikely to be the final place where the dead body was found. The clues were revealing a homicidal offence and an attempt to destroy the evidence. The forensic use of 'rigor mortis in an unusual position' is in furthering the investigations, and the scientific confirmation of two facts - the scene of death (occurrence) is different from the scene of disposal of dead body, and time gap between the two places.


A conceptual model of client-driven agile requirements prioritization: results of a case study

Requirements (re)prioritization is an essential mechanism of agile development approaches to maximize the value for the clients and to accommodate changing requirements. Yet, in the agile Requirements Engineering (RE) literature, very little is known about how agile (re)prioritization happens in practice. Conceptual models about this process are missing, which, in turn, makes it difficult for both practitioners and researchers to reason about requirements decision-making at inter-iteration time. We did a multiple case study on agile requirements prioritization methods to yield a conceptual model for understanding the inter-iteration prioritization process. The model is derived by using interview data from practitioners in 8 development organizations. Such a model makes explicit the concepts that are used tacitly in the agile requirements prioritization practice and can be used for structuring future empirical investigations about this topic, and for analyzing, supporting, and improving the process in real-life projects.


A Penalty-Function Approach for Pruning Feedforward Neural Networks

This article proposes the use of a penalty function for pruning feedforward neural network by weight elimination. The penalty function proposed consists of two terms. The first term is to discourage the use of unnecessary connections, and the second term is to prevent the weights of the connections from taking excessively large values. Simple criteria for eliminating weights from the network are also given. The effectiveness of this penalty function is tested on three well-known problems: the contiguity problem, the parity problems, and the monks problems. The resulting pruned networks obtained for many of these problems have fewer connections than previously reported in the literature.


The Cascade-Correlation Learning Architecture

Cascade-Correlation is a new architecture and supervised learning algorithm for artificial neural networks. Instead of just adjusting the weights in a network of fixed topology, Cascade-Correlation begins with a minimal network, then automatically trains and adds new hidden units one by one, creating a multi-layer structure. Once a new hidden unit has been added to the network, its input-side weights are frozen. This unit then becomes a permanent feature-detector in the network, available for producing outputs or for creating other, more complex feature detectors. The Cascade-Correlation architecture has several advantages over existing algorithms: it learns very quickly, the network determines its own size and topology, it retains the structures it has built even if the training set changes, and it requires no back-propagation of error signals through the connections of the network. This research was sponsored in part by the National Science Foundation under Contract Number EET-8716324 and by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 4976 under Contract F33615-87-C-1499 and monitored by: Avionics Laboratory, Air Force Wright Aeronautical Laboratories, Aeronautical Systems Division (AFSC), Wright-Patterson AFB, OH 45433-6543. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government. 1. Why is Back-Propagation Learning So Slow? The Cascade-Correlation learning algorithm was developed in an attempt to overcome certain problems and limitations of the popular back-propagation (or “backprop”) learning algorithm [Rumelhart, 1986]. The most important of these limitations is the slow pace at which backprop learns from examples. Even on simple benchmark problems, a back-propagation network may require many thousands of epochs to learn the desired behavior from examples. (An epoch is defined as one pass through the entire set of training examples.) We have attempted to analyze the reasons why backprop learning is so slow, and we have identified two major problems that contribute to the slowness. We call these the step-size problem and the moving target problem. There may, of course, be other contributing factors that we have not yet identified. 1.1. The Step-Size Problem The step-size problem occurs because the standard back-propagation method computes only E w, the partial first derivative of the overall error function with respect to each weight in the network. Given these derivatives, we can perform a gradient descent in weight space, reducing the error with each step. It is straightforward to show that if we take infinitesimal steps down the gradient vector, running a new training epoch to recompute the gradient after each step, we will eventually reach a local minimum of the error function. Experience has shown that in most situations this local minimum will be a global minimum as well, or at least a “good enough” solution to the problem at hand. In a practical learning system, however, we do not want to take infinitesimal steps; for fast learning, we want to take the largest steps that we can. Unfortunately, if we choose a step size that is too large, the network will not reliably converge to a good solution. In order to choose a reasonable step size, we need to know not just the slope of the error function, but something about its higher-order derivatives—its curvature—in the vicinity of the current point in weight space. This information is not available in the standard back-propagation algorithm. A number of schemes have been proposed for dealing with the step-size problem. Some form of “momentum” [Rumelhart, 1986] is often used as a crude way of summarizing the slope of the error surface at earlier points in the computation. Conjugate gradient methods have been explored in the context of artificial neural networks by a number of researchers [Watrous, 1988, Lapedes, 1987, Kramer, 1989] with generally good results. Several schemes, for example [Franzini, 1987] and jacobs:dynamic, have been proposed that adjust the step-size dynamically, based on the change in gradient from one step to another. Becker and LeCun [Becker, 1988] explicitly compute an approximation to the second derivative of the error function at each step and use that information to guide the speed of descent. Fahlman’s quickprop algorithm [Fahlman, 1988] is one of the more successful algorithms for handling the step-size problem in back-propagation systems. Quickprop computes the E w values just as in standard backprop, but instead of simple gradient descent, Quickprop uses a second-order method, related to Newton’s method, to update the weights. On the learning benchmarks we have collected, quickprop consistently out-performs other backprop-like algorithms, sometimes by a large factor. Quickprop’s weight-update procedure depends on two approximations: first, that small changes in one weight have relatively little effect on the error gradient observed at other weights; second, that the error function with respect to each weight is locally quadratic. For each weight, quickprop keeps a copy of


Dynamic node creation in backpropagation networks

Summary form only given. A novel method called dynamic node creation (DNC) that attacks issues of training large networks and of testing networks with different numbers of hidden layer units is presented. DNC sequentially adds nodes one at a time to the hidden layer(s) of the network until the desired approximation accuracy is achieved. Simulation results for parity, symmetry, binary addition, and the encoder problem are presented. The procedure was capable of finding known minimal topologies in many cases, and was always within three nodes of the minimum. Computational expense for finding the solutions was comparable to training normal backpropagation (BP) networks with the same final topologies. Starting out with fewer nodes than needed to solve the problem actually seems to help find a solution. The method yielded a solution for every problem tried. BP applied to the same large networks with randomized initial weights was unable, after repeated attempts, to replicate some minimum solutions found by DNC.<<ETX>>


Emotion-based music recommendation by affinity discovery from film music

0957-4174/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.eswa.2008.09.042 q Part of the content of this paper has been publi International Conference on Multimedia, 2005. * Corresponding author. Tel.: +886 2 29393091x67 E-mail address: mkshan@cs.nccu.edu.tw (M.-K. Sh With the growth of digital music, the development of music recommendation is helpful for users to pick desirable music pieces from a huge repository of music. The existing music recommendation approaches are based on a user’s preference on music. However, sometimes, it might better meet users’ requirement to recommend music pieces according to emotions. In this paper, we propose a novel framework for emotion-based music recommendation. The core of the recommendation framework is the construction of the music emotion model by affinity discovery from film music, which plays an important role in conveying emotions in film. We investigate the music feature extraction and propose the Music Affinity Graph and Music Affinity Graph-Plus algorithms for the construction of music emotion model. Experimental result shows the proposed emotion-based music recommendation achieves 85% accuracy in average. 2008 Elsevier Ltd. All rights reserved.


Autonomous cleaning robot: Roboking system integration and overview

This paper would present the system integration and overview of the autonomous cleaning robot Roboking. Roboking is self-propelled autonomously navigating vacuum cleaning robot. It uses several sensors in order to protect indoor environments and itself while cleaning. In this paper, we would describe the principle of operation along with system structure, sensors, functions and integrated subsystems.


Design of auxetic structures via mathematical optimization.

The design of auxetic structures is traditionally based on engineering experience, see, for instance, refs. [1,2]. The goal of this article is to demonstrate how an existing auxetic structure can be improved by structural optimization techniques and manufactured by a selective electron beam melting (SEBM) system. Auxetic materials possess negative Poisson’s ratios ν which is in contrast to almost all engineering materials (e. g. metals ν ≈ 0.3). The negative Poisson’s ratio translates into the unusual geometric effect that these materials expand when stretched and contract when compressed. This behavior is of interest for example for fastener systems and fi lters. [ 2 , 3 ] It also results in interesting mechanical behavior like increased penetration resistance for large negative Poisson’s ratios [ 4 ] and in the case of isotropy for higher shear strength relative to the Young’s modulus [ 2 ] of the structure. The auxetic behavior can always be traced back to complex mesoor microscopic geometric mechanisms, e. g. unfolding of inverted elements or rotation of star shaped rigid units relative to each other. [ 5 – 7 ] These geometries can be realized on vastly different scales from specifi cally designed polymers to reactor cores. [ 2 , 8 ]


CMT-bone: A Mini-App for Compressible Multiphase Turbulence Simulation Software

Designed with the goal of mimicking key features of real HPC workloads, mini-apps have become an important tool for co-design. An investigation of mini-app behavior can provide system designers with insight into the impact of architectures, programming models, and tools on application performance. Mini-apps can also serve as a platform for fast algorithm design space exploration, allowing the application developers to evaluate their design choices before significantly redesigning the application codes. Consequently, it is prudent to develop a mini-app alongside the full blown application it is intended to represent. In this paper, we present CMT-bone a mini-app for the compressible multiphase turbulence (CMT) application, CMT-nek, being developed to extend the physics of the CESAR Nek5000 application code. CMT-bone consists of the most computationally intensive kernels of CMT-nek and the communication operations involved in nearest-neighbor updates and vector reductions. The mini-app represents CMT-nek in its most mature state and going forward it will be developed in parallel with the CMT-nek application to keep pace with key new performance impacting changes. We describe these kernels and discuss the role that CMT-bone has played in enabling interdisciplinary collaboration by allowing application developers to work with computer scientists on performance optimization on current architectures and performance analysis on notional future systems.


A typology for visualizing uncertainty

Information analysts, especially those working in the field of intelligence analysis, must assess not only the information presented to them, but the confidence they have in that information. Visual representations of information are challenged to incorporate a notion of confidence or certainty because the factors that influence the certainty or uncertainty of information vary with the type of information and the type of decisions being made. Visualization researchers have no model or framework for describing uncertainty as it relates to intelligence analysis, thus no consistent basis for constructing visualizations of uncertainty. This paper presents a typology describing the aspects of uncertainty related to intelligence analysis, drawing on frameworks for uncertainty representation in scientific computing.


Broadcast news story segmentation using latent topics on data manifold

This paper proposes to use Laplacian Probabilistic Latent Semantic Analysis (LapPLSA) for broadcast news story segmentation. The latent topic distributions estimated by LapPLSA are used to replace term frequency vector as the representation of sentences and measure the cohesive strength between the sentences. Subword n-gram is used as the basic term unit in the computation. Dynamic Programming is used for story boundary detection. LapPLSA projects the data into a low-dimensional semantic topic representation while preserving the intrinsic local geometric structure of the data. The locality preserving property attempts to make the estimated latent topic distributions more robust to the noise from automatic speech recognition errors. Experiments are conducted on the ASR transcripts of TDT2 Mandarin broadcast news corpus. Our proposed approach is compared with other approaches which use dimensionality reduction technique with the locality preserving property, and two different topic modeling techniques. Experiment results show that our proposed approach provides the highest F1-measure of 0.8228, which significantly outperforms the best previous approaches.


A 10-year retrospective of research in health mass media campaigns: where do we go from here?

Mass media campaigns have long been a tool for promoting public health. How effective are such campaigns in changing health-related attitudes and behaviors, however, and how has the literature in this area progressed over the past decade? The purpose of the current article is threefold. First, I discuss the importance of health mass media campaigns and raise the question of whether they are capable of effectively impacting public health. Second, I review the literature and discuss what we have learned about the effectiveness of campaigns over the past 10 years. Finally, I conclude with a discussion of possible avenues for the health campaign literature over the next 10 years. The overriding conclusion is the following: The literature is beginning to amass evidence that targeted, well-executed health mass media campaigns can have small-to-moderate effects not only on health knowledge, beliefs, and attitudes, but on behaviors as well, which can translate into major public health impact given the wide reach of mass media. Such impact can only be achieved, however, if principles of effective campaign design are carefully followed.


Conditional Generative Adversarial Networks for Commonsense Machine Comprehension

Recently proposed Story Cloze Test [Mostafazadeh et al., 2016] is a commonsense machine comprehension application to deal with natural language understanding problem. This dataset contains a lot of story tests which require commonsense inference ability. Unfortunately, the training data is almost unsupervised where each context document followed with only one positive sentence that can be inferred from the context. However, in the testing period, we must make inference from two candidate sentences. To tackle this problem, we employ the generative adversarial networks (GANs) to generate fake sentence. We proposed a Conditional GANs (CGANs) in which the generator is conditioned by the context. Our experiments show the advantage of the CGANs in discriminating sentence and achieve state-of-the-art results in commonsense story reading comprehension task compared with previous feature engineering and deep learning methods.


Outliers , Level Shifts , and Variance Changes in Time Series

Outliers, level shifts, and variance changes are commonplace in applied time series analysis. However, their existence is often ignored and their impact is overlooked, for the lack of simple and useful methods to detect and handle those extraordinary events. The problem of detecting outliers, level shifts, and variance changes in a univariate time series is considered. The methods employed are extremely simple yet useful. Only the least squares techniques and residual variance ratios are used. The effectiveness of these simple methods is demonstrated by analysing three real data sets.


A simple tractor-trailer backing control law for path following

Backing of tractor-trailer systems is a problem addressed in many literatures. It is usually solved using various nonlinear-based control methods, which are often not easy to implement or tune. Similar to other work focused on backing a single axle trailer with a car like vehicle, we propose a two-tier controller that is simple and intuitive. However, ours is based upon curvature as opposed to hitch angle, which allows the control input to be more directly related to path specification and to handle path curvature discontinuity better. Experimental results are provided to illustrate the capability of this new algorithm applied to a full scale autonomous vehicle and trailer system in a real field environment using minimal sensing capability. Results demonstrate good performance on sloped grounds with various grades.


Weighted graph comparison techniques for brain connectivity analysis

The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore high-level brain connectivity analysis tasks that need to be supported by dedicated visual analysis tools. A significant example of such a task is the comparison of different connectivity data in the form of weighted graphs. Several approaches have been suggested for graph comparison within information visualization, but the comparison of weighted graphs has not been addressed. We explored the design space of applicable visual representations and present augmented adjacency matrix and node-link visualizations. To assess which representation best support weighted graph comparison tasks, we performed a controlled experiment. Our findings suggest that matrices support these tasks well, outperforming node-link diagrams. These results have significant implications for the design of brain connectivity analysis tools that require weighted graph comparisons. They can also inform the design of visual analysis tools in other domains, e.g. comparison of weighted social networks or biological pathways.


Identifying Customer Preferences about Tourism Products Using an Aspect-based Opinion Mining Approach

In this study we extend Bing Liu’s aspect-based opinion mining technique to apply it to the tourism domain. Using this extension, we also offer an approach for considering a new alternative to discover consumer preferences about tourism products, particularly hotels and restaurants, using opinions available on the Web as reviews. An experiment is also conducted, using hotel and restaurant reviews obtained from TripAdvisor, to evaluate our proposals. Results showed that tourism product reviews available on web sites contain valuable information about customer preferences that can be extracted using an aspect-based opinion mining approach. The proposed approach proved to be very effective in determining the sentiment orientation of opinions, achieving a precision and recall of 90%. However, on average, the algorithms were only capable of extracting 35% of the explicit aspect expressions. c © 2013 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of KES International.


Cannabinoids and the skeleton: from marijuana to reversal of bone loss.

The active component of marijuana, Delta(9)-tetrahydrocannabinol, activates the CB1 and CB2 cannabinoid receptors, thus mimicking the action of endogenous cannabinoids. CB1 is predominantly neuronal and mediates the cannabinoid psychotropic effects. CB2 is predominantly expressed in peripheral tissues, mainly in pathological conditions. So far the main endocannabinoids, anandamide and 2-arachidonoylglycerol, have been found in bone at 'brain' levels. The CB1 receptor is present mainly in skeletal sympathetic nerve terminals, thus regulating the adrenergic tonic restrain of bone formation. CB2 is expressed in osteoblasts and osteoclasts, stimulates bone formation, and inhibits bone resorption. Because low bone mass is the only spontaneous phenotype so far reported in CB2 mutant mice, it appears that the main physiologic involvement of CB2 is associated with maintaining bone remodeling at balance, thus protecting the skeleton against age-related bone loss. Indeed, in humans, polymorphisms in CNR2, the gene encoding CB2, are strongly associated with postmenopausal osteoporosis. Preclinical studies have shown that a synthetic CB2-specific agonist rescues ovariectomy-induced bone loss. Taken together, the reports on cannabinoid receptors in mice and humans pave the way for the development of 1) diagnostic measures to identify osteoporosis-susceptible polymorphisms in CNR2, and 2) cannabinoid drugs to combat osteoporosis.


A Bayesian Approach to Predict Performance of a Student (BAPPS): A Case with Ethiopian Students

The importance of accurate estimation of student’s future performance is essential in order to provide the student with adequate assistance in the learning process. To this end, this research aimed at investigating the use of Bayesian networks for predicting performance of a student, based on values of some identified attributes. We presented empirical experiments on the prediction of performance with a data set of high school students containing 8 attributes. The paper demonstrates an application of the Bayesian approach in the field of education and shows that the Bayesian network classifier has a potential to be used as a tool for prediction of student performance.


A Prolog Framework for Integrating Business Rules into Java Applications

Business specifications – that formerly only supported IT development – increasingly become business configurations in the form of rules that can be loaded directly into IT solutions. PROLOG is well–known for its qualities in the development of sophisticated rule systems. It is desirable to combine the advantages of PROLOG with JAVA, since JAVA has become one of the most used programming languages in industry. However, experts of both programming languages are rare. To overcome the resulting interoperability problems, we have developed a framework which generates a JAVA archive that provides methods to query a given set of PROLOG rules; it ensures that valid knowledge bases are transmitted between JAVA and PROLOG. We use XML Schema for describing the format for exchanging a knowledge base between PROLOG and JAVA. From the XML Schema desciption, we scaffold JAVA classes; the JAVA programmer can use them and fill in the open slots by statements accessing other JAVA data structures. The data structure on the JAVA side reflects the complex structured knowledge base, with which the PROLOG rules work, in an object–oriented way. We can to some extend verify the correctness of the data set / knowledge base sent from JAVA to PROLOG using standard methods for XML Schema. Moreover, we can add constraints that go beyond XML. For instance, we can specify standard integrity constraints known from relational databases, such as primary key, foreign key, and not–null constraints. Since we are dealing with complex structured XML data, however, there can be far more general integrity constraints. These can be expressed by standard PROLOG rules, which can be evaluated on the PROLOG side; they could also be compiled to JAVA by available PROLOG to JAVA converters such as Prolog Cafe – since they will usually be written in a supported subset of PROLOG. We have used our framework for integrating PROLOG business rules into a commercial E–Commerce system written in JAVA.


Confluence: conformity influence in large social networks

Conformity is a type of social influence involving a change in opinion or behavior in order to fit in with a group. Employing several social networks as the source for our experimental data, we study how the effect of conformity plays a role in changing users' online behavior. We formally define several major types of conformity in individual, peer, and group levels. We propose Confluence model to formalize the effects of social conformity into a probabilistic model. Confluence can distinguish and quantify the effects of the different types of conformities. To scale up to large social networks, we propose a distributed learning method that can construct the Confluence model efficiently with near-linear speedup. Our experimental results on four different types of large social networks, i.e., Flickr, Gowalla, Weibo and Co-Author, verify the existence of the conformity phenomena. Leveraging the conformity information, Confluence can accurately predict actions of users. Our experiments show that Confluence significantly improves the prediction accuracy by up to 5-10% compared with several alternative methods.


On board eco-driving system for varying road-traffic environments using model predictive control

This paper presents model predictive control of a vehicle in a varying road-traffic environment for ecological (eco) driving. The vehicle control input is derived by rigorous reasoning approach of model based anticipation of road, traffic and fuel consumption in a crowded road network regulated by traffic signals. Model predictive control with Continuation and generalized minimum residual method for optimization is used to calculate the sequence of control inputs aiming at long run fuel economy maintaining a safe driving. Performance of the proposed eco-driving system is evaluated through simulations in AIMSUN microscopic transport simulator. In spite of nonlinearity and discontinuous movement of other traffic and signals, the proposed system is robust enough to control the vehicle safely. The driving behavior with fuel saving aspects is graphically illustrated, compared and analyzed to signify the prospect of the proposed eco-driving of a vehicle.


Joint Computation Partitioning and Resource Allocation for Latency Sensitive Applications in Mobile Edge Clouds

The proliferation of mobile devices and ubiquitous access of the wireless network enables many new mobile applications such as augmented reality, mobile gaming and so on. As the applications are latency sensitive, researchers propose to offload the complex computations of these applications to the nearby mobile edge cloud, in order to reduce the latency. Existing works mostly consider the problem of partitioning the computations between the mobile device and the traditional cloud that has abundant resources. The proposed approaches can not be applied in the context of mobile edge cloud, because both the resources in the mobile edge cloud and the wireless access bandwidth to the edge cloud are constrained. In this paper, we study joint computation partitioning and resource allocation problem for latency sensitive applications in mobile edge clouds. The problem is novel in that we combine the computation partitioning and the two-dimensional resource allocations in both the computation resources and the network bandwidth. We develop a new and efficient method, namely Multi-Dimensional Search and Adjust (MDSA), to solve the problem. We compares MDSA with the classic list scheduling method and the SearchAdjust algorithm via comprehensive simulations. The results show that MDSA outperforms the benchmark algorithms in terms of the overall application latency.


smartPrediction: a real-time smartphone-based fall risk prediction and prevention system

The high risk of falls and the substantial increase in the elderly population have recently stimulated scientific research on Smartphone-based fall detection systems. Even though these systems are helpful for fall detection, the best way to reduce the number of falls and their consequences is to predict and prevent them from happening in the first place. To address the issue of fall prevention, in this paper, we propose a fall prediction system by integrating the sensor data of Smartphones and a Smartshoe. We designed and implemented a Smartshoe that contains four pressure sensors with a Wi-Fi communication module to unobtrusively collect data in any environment. By assimilating the Smartshoe and Smartphone sensors data, we performed an extensive set of experiments to evaluate normal and abnormal walking patterns. The system can generate an alert message in the Smartphone to warn the user about the high-risk gait patterns and potentially save them from an imminent fall. We validated our approach using a decision tree with 10-fold cross validation and found 97.2% accuracy in gait abnormality detection.


Evaluation of LoRa LPWAN technology for remote health and wellbeing monitoring

Low power consumption, low transceiver chip cost and large coverage area are the main characteristics of the low power wide area networks (LPWAN) technologies. We expect that LPWAN can be part of enabling new human-centric health and wellness monitoring applications. Therefore in this work we study the indoor performance of one LPWAN technology, namely LoRa, by the means of real-life measurements. The measurements were conducted using the commercially available equipment in the main campus of the University of Oulu, Finland, which has an indoor area spanning for over 570 meters North to South and over 320 meters East to West. The measurements were executed for a sensor node operating close to human body that was periodically reporting the sensed data to a base station. The obtained results show that when using 14 dBm transmit power and the largest spreading factor of 12 for the 868 MHz ISM band, the whole campus area can be covered. Measured packet success delivery ratio was 96.7 % without acknowledgements and retransmissions.


Executive control in language processing

During communication, speakers and listeners need the mechanisms of executive control to organize thoughts and actions along internal goals. Speakers may use executive functions to select the right word over competing alternatives to refer to the concept in mind. Listeners may use executive functions to coordinate the outputs of multiple linguistic processes to reach a coherent interpretation of what others say. Bilinguals may use executive functions to control which language is to use or to switch from one language to another. The control mechanisms recruited in language processing may be similar to those recruited in perception and attention, supported by a network of frontal, parietal and sub-cortical brain structures. Here we review existing evidences regarding the involvement of domain-general executive control in language processing. We will explain how executive functions are employed to control interference in comprehension and production, within and across languages.


Soft-Switched CCM Boost Converters With High Voltage Gain for High-Power Applications

This paper proposes a new soft-switched continuous-conduction-mode (CCM) boost converter suitable for high-power applications such as power factor correction, hybrid electric vehicles, and fuel cell power conversion systems. The proposed converter achieves zero-voltage-switched (ZVS) turn-on of active switches in CCM and zero-current-switched turn-off of diodes leading to negligible reverse-recovery loss. The components' voltage ratings and energy volumes of passive components of the proposed converter are greatly reduced compared to the conventional zero-voltage-transition converter. Voltage conversion ratio is almost doubled compared to the conventional boost converter. Extension of the proposed concept to realize multiphase dc-dc converters is discussed. Experimental results from a 1.5-kW prototype are provided to validate the proposed concept.


An Interleaved Boost Converter With Zero-Voltage Transition

This paper proposes a novel soft-switching interleaved boost converter composed of two shunted elementary boost conversion units and an auxiliary inductor. This converter is able to turn on both the active power switches at zero voltage to reduce their switching losses and evidently raise the conversion efficiency. Since the two parallel-operated elementary boost units are identical, operation analysis and design for the converter module becomes quite simple. A laboratory test circuit is built, and the circuit operation shows satisfactory agreement with the theoretical analysis. The experimental results show that this converter module performs very well with the output efficiency as high as 95%.


A new active clamping zero-voltage switching PWM current-fed half-bridge converter

A new active clamping zero-voltage switching (ZVS) pulse-width modulation (PWM) current-fed half-bridge converter (CFHB) is proposed in this paper. Its active clamping snubber (ACS) can not only absorb the voltage surge across the turned-off switch, but also achieve the ZVS of all power switches. Moreover, it can be applied to all current-fed power conversion topologies and its operation as well as structure is very simple. Since auxiliary switches in the snubber circuit are switched in a complementary way to main switches, an additional PWM IC is not necessary. In addition, it does not need any clamp winding and auxiliary circuit besides additional two power switches and one capacitor while the conventional current-fed half bridge converter has to be equipped with two clamp windings, two ZVS circuits, and two snubbers. Therefore, it can ensure the higher operating frequency, smaller-sized reactive components, lower cost of production, easier implementation, and higher efficiency. The operational principle, theoretical analysis, and design considerations are presented. To confirm the operation, validity, and features of the proposed circuit, experimental results from a 200-W, 24-200Vdc prototype are presented.


Landsat continuity : Issues and opportunities for land cover monitoring

Initiated in 1972, the Landsat program has provided a continuous record of earth observation for 35 years. The assemblage of Landsat spatial, spectral, and temporal resolutions, over a reasonably sized image extent, results in imagery that can be processed to represent land cover over large areas with an amount of spatial detail that is absolutely unique and indispensable for monitoring, management, and scientific activities. Recent technical problems with the two existing Landsat satellites, and delays in the development and launch of a successor, increase the likelihood that a gap in Landsat continuity may occur. In this communication, we identify the key features of the Landsat program that have resulted in the extensive use of Landsat data for large area land covermapping andmonitoring.We then augment this list of key features by examining the data needs of existing large area land cover monitoring programs. Subsequently, we use this list as a basis for reviewing the current constellation of earth observation satellites to identify potential alternative data sources for large area land cover applications. Notions of a virtual constellation of satellites to meet large area land cover mapping and monitoring needs are also presented. Finally, research priorities that would facilitate the integration of these alternative data sources into existing large area land cover monitoring programs are identified. Continuity of the Landsat program and the measurements provided are critical for scientific, environmental, economic, and social purposes. It is difficult to overstate the importance of Landsat; there are no other systems in orbit, or planned for launch in the short-term, that can duplicate or approach replication, of the measurements and information conferred by Landsat. While technical and political options are being pursued, there is no satellite image data stream poised to enter the National Satellite Land Remote Sensing Data Archive should system failures occur to Landsat-5 and -7. Crown Copyright © 2007 Published by Elsevier Inc. All rights reserved.


Subcarrier-index modulation OFDM

A new transmission approach, referred to as subcarrier-index modulation (SIM) is proposed to be integrated with the orthogonal frequency division multiplexing (OFDM) systems. More specifically, it relates to adding an additional dimension to the conventional two-dimensional (2-D) amplitude/phase modulation (APM) techniques, i.e. amplitude shift keying (ASK) and quadrature amplitude modulation (QAM). The key idea of SIM is to employ the subcarrier-index to convey information to the receiver. Furthermore, a closed-form analytical bit error ratio (BER) of SIM OFDM in Rayleigh channel is derived. Analytical and simulation results show error probability performance gain of 4 dB over 4-QAM OFDM systems for both coded and uncoded data without power saving policy. Alternatively, power saving policy retains an average gain of 1 dB while using 3 dB less transmit power per OFDM symbol.


Impact of aluminum wire and ribbon bonding technologies on D2PAK package reliability during thermal cycling applications


Image Processing using IP Core Generator through FPGA

Xilinx CORE Generator System generates and delivers parameterizable cores optimized for Xilinx FPGAs. CORE Generator is mainly used to create high density, high performance designs in Xilinx FPGAs in less time. The CORE Generator is included with the ISE WebPack and ISE Foundation software and comes with an extensive library of Xilinx LogiCORE IP. These include DSP functions, memories, storage elements, math functions and a variety of basic elements. Xilinx provides a flexible Block Memory Generator core to create compact, high-performance memories running at up to 450 MHz. Block Memory Generator provides single port and dual port block memory. These memory types differ in selection of operating modes.Matlab tool is used to convert the image that is being processed to .coe file format.


Improvement of the on-body performance of a dual-band textile antenna using an EBG structure

A new dual-band wearable textile antenna designed for body-centric communications is introduced. The antenna is fully characterized in free space and on the body model, with and without an electromagnetic band gap (EBG) substrate. The band gap array consists of 3 × 3 elements and is used to reduce the interaction with human tissues. With the EBG back reflector, the radiation into the body is reduced by more than 15 dB. Increases of 5.2 dB and 3 dB gain are noticed at 2.45 GHz and 5.5 GHz, respectively. The results are presented for the return loss, radiation pattern, efficiency, and specific absorption rate (SAR).


Procedural City Layout Generation Based on Urban Land Use Models

Training and simulation applications in virtual worlds require significant amounts of urban environments. Procedural generation is an efficient way to create such models. Existing approaches for procedural modelling of cities aim at facilitating the work of urban planners and artists, but either require expert knowledge or external input data to generate results that resemble real-life cities, or they have long computation times, and thus are unsuitable for non-experts such as training instructors. We propose a method that procedurally creates layouts of structurally plausible cities from high-level, intuitive user input such as city size, location and historic background. The resulting layouts consist of different kinds of city districts which are arranged using constraints derived from established models of urban land use. Our approach avoids the need for external expert engagement in the creation process, and allows for the generation of large city layouts in seconds, making it significantly faster than comparable agent-based software and thus supporting the needs of non-expert creators of virtual cities for many applications.


A modular crawler-driven robot: Mechanical design and preliminary experiments

This paper presents a tracked robot composed of the proposed crawler mechanism, in which a planetary gear reducer is employed as the transmission device and provides two outputs in different forms with only one actuator. When the crawler moves in a rough environment, collision between mechanism and environment inevitably occurs. This under-actuated crawler can absorb the impact energy that should be transmitted to the actuator. A modular concept for the crawler is proposed for enlarging its use in robot systems and mechanical design of a modular crawler is conducted. Using this crawler module, a four-crawler-driven robot is realized by easily assembling. Experiments are conducted to verify the proposed concept and mechanical design. A single crawler module can well perform the proposed three locomotion modes. The four-crawler-driven robot has good adaptability to the environment which can get over obstacles both passively and actively.


An Algorithm for Training Polynomial Networks

We consider deep neural networks, in which the output of each node is a quadratic function of its inputs. Similar to other deep architectures, these networks can compactly represent any function on a finite training set. The main goal of this paper is the derivation of an efficient layer-by-layer algorithm for training such networks, which we denote as the Basis Learner. The algorithm is a universal learner in the sense that the training error is guaranteed to decrease at every iteration, and can eventually reach zero under mild conditions. We present practical implementations of this algorithm, as well as preliminary experimental results. We also compare our deep architecture to other shallow architectures for learning polynomials, in particular kernel learning.


Deep Learning Approach for Secondary Structure Protein Prediction based on First Level Features Extraction using a Latent CNN Structure

In Bioinformatics, Protein Secondary Structure Prediction (PSSP) has been considered as one of the main challenging tasks in this field. Today, secondary structure protein prediction approaches have been categorized into three groups (Neighbor-based, model-based, and meta predicator-based model). The main purpose of the model-based approaches is to detect the protein sequence-structure by utilizing machine learning techniques to train and learn a predictive model for that. In this model, different supervised learning approaches have been proposed such as neural networks, hidden Markov chain, and support vector machines have been proposed. In this paper, our proposed approach which is a Latent Deep Learning approach relies on detecting the first level features based on using Stacked Sparse Autoencoder. This approach allows us to detect new features out of the set of training data using the sparse autoencoder which will have used later as convolved filters in the Convolutional Neural Network (CNN) structure. The experimental results show that the highest accuracy of the prediction is 86.719% in the testing set of our approach when the backpropagation framework has been used to pre-trained techniques by relying on the unsupervised fashion where the whole network can be fine-tuned in a supervised learning fashion. Keywords—Secondary structure protein prediction; secondary structure; fine-tuning; Stacked Sparse; Deep Learning; CNN


A Method for Identification of Basmati Rice grain of India and Its Quality Using Pattern Classification

The research work deals with an approach to perform texture and morphological based retrieval on a corpus of Basmati rice grain images. The work has been carried out using Image Warping and Image analysis approach. The method has been employed to normalize food grain images and hence eliminating the effects of orientation using image warping technique with proper scaling. The approach has been tested on sufficient number of basmati rice grain images of rice based on intensity, position and orientation. A digital image analysis algorithm based on color, morphological and textural features was developed to identify the six varieties of basmati rice seeds which are widely planted in India. Nine color and nine morphological and textural features were used for discriminant analysis. A back propagation neural network-based classifier was developed to identify the unknown grain types. The color and textural features were presented to the neural network for training purposes. The trained network was then used to identify the unknown grain types. It is also to find the percentage purity of hulled basmati rice grain sample by image processing technique. Commercially the purity test of basmati rice sample is done according to the size of the grain kernel (full, half or broken). By image processing we can also identify any broken basmati rice grains. Here we discuss the various procedures used to obtain the percentage quality of basmati rice grains. Keywords— warping, Image rectification, Image segmentation, Edge Detection, blurring image, Thresholding, Percentage Purity, Pixel area.


OCR binarization and image pre-processing for searching historical documents

We consider the problem of document binarization as a pre-processing step for optical character recognition (OCR) for the purpose of keyword search of historical printed documents. A number of promising techniques from the literature for binarization, pre-filtering, and post-binarization denoising were implemented along with newly developed methods for binarization: an error diffusion binarization, a multiresolutional version of Otsu’s binarization, and denoising by despeckling. The OCR in the ABBYY FineReader 7.1 SDK is used as a black box metric to compare methods. Results for 12 pages from six newspapers of differing quality show that performance varies widely by image, but that the classic Otsu method and Otsu-based methods perform best on average. 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.


Multi-phase Word Sense Embedding Learning Using a Corpus and a Lexical Ontology

Word embeddings play a significant role in many modern NLP systems. However, most prevalent word embedding learning methods learn one representation per word which is problematic for polysemous words and homonymous words. To address this problem, we propose a multi-phase word sense embedding learning method which utilizes both a corpus and a lexical ontology to learn one embedding per word sense. We use word sense definitions and relations between word senses defined in a lexical ontology in a different way from existing systems. Experimental results on word similarity task show that our approach produces word sense embeddings of high quality.


A Study of Attribute-based Proxy Re-encryption Scheme in Cloud Environments

Attribute-based proxy re-encryption (ABPRE) scheme is one of the proxy cryptography, which can delegate the reencryption capability to the proxy and re-encrypt the encrypted data by using the re-encryption key. ABPRE extending the traditional proxy cryptography and attributes plays an important role. In ABPRE, users are identified by attributes, and the access policy is designed to control the user’s access. Using ABPRE can have these advantages: (i) The proxy can be delegated to execute the re-encryption operation, which reduces the computation overhead of the data owner; (ii) The authorized user just uses his own secret key to decrypt the encrypted data, and he doesn’t need to store an additional decryption key for deciphering; (iii) The sensitive information cannot be revealed to the proxy in re-encryption, and the proxy only complies to the data owner’s command. In this paper, we survey two various access policy attribute-based proxy re-encryption schemes and analyze these schemes. Thereafter, we list the comparisons of them by some criteria.


Dual-Band Transmitarrays With Dual-Linear Polarization at Ka-Band

Dual-band transmitarray antennas are demonstrated at Ka-band with the capability of forming independent linearly polarized beams with a given polarization in each frequency band, while sharing the same radiating aperture. The proposed three-layer unit-cell is based on identical narrow microstrip patches printed on both receiving and transmitting layers and connected by a metallized via hole. The metal layers are printed on two identical substrates bonded with a thin film, and the designed unit-cell exhibits a 180° phase resolution (i.e., 1-b phase quantization). The dual-band dual-polarized property of the transmitarray is achieved by interleaving unit-cells operating in the down-link and up-link frequency bands. Four different prototypes are characterized to demonstrate the relevance of the proposed concepts. A good agreement is obtained between the radiation patterns, gain curves, and cross-polarization levels measured and computed in both frequency bands and polarizations.


The diffusion of political memes in social media: keynote abstract

This talk presents ongoing work on the study of information diffusion in social media, focusing in particular on political communication in the Twitter microblogging network. Social media platforms play an important role in shaping political discourse in the US and around the world. The truthy.indiana.edu infrastructure allows us to mine and visualize a large stream of social media data related to political themes. The analyses in this keynote address polarization and cross-ideological communication, and partisan asymmetries in the online political activities of social media users. Machine learning efforts can successfully leverage the structure of meme diffusion networks to detect orchestrated astroturf attacks that simulate grassroots campaigns, and to predict the political affiliation of active users. The retweet network segregates individuals into two distinct, homogenous communities of left- and right-leaning users. The mention network does not exhibit this kind of segregation, instead forming a communication bridge across which information flows between these two partisan communities. We propose a mechanism of action to explain these divergent topologies and provide statistical evidence in support of this hypothesis. Related to political communication are questions about the birth of online social movements. Social media data provides an opportunity to look for signatures that capture these seminal events. Finally, I will introduce a model of the competition for attention in social media. A dynamic of information diffusion emerges from this process, where a few ideas go viral while most do not. I will show that the relative popularity of different topics, the diversity of information to which we are exposed, and the fading of our collective interests for specific memes, can all be explained as deriving from a combination between the competition for limited attention and the structure of social networks. Surprisingly, one can reproduce the massive heterogeneity in the popularity and persistence of ideas without the need to assume different intrinsic values among those ideas.


Factorization machines with follow-the-regularized-leader for CTR prediction in display advertising

Predicting ad click-through rates is the core problem in display advertising, which has received much attention from the machine learning community in recent years. In this paper, we present an online learning algorithm for click-though rate prediction, namely Follow-The-Regularized-Factorized-Leader (FTRFL), which incorporates the Follow-The-Regularized-Leader (FTRL-Proximal) algorithm with per-coordinate learning rates into Factorization machines. Experiments on a real-world advertising dataset show that the FTRFL method outperforms the baseline with stochastic gradient descent, and has a faster rate of convergence.


Culture and diverging views of social events.

The authors compared East Asians' and Americans' views of everyday social events. Research suggests that Americans tend to focus more on the self and to have a greater sense of personal agency than East Asians. The authors assessed whether, compared to East Asians, Americans emphasize main characters even when events do not involve the self and whether they see more agency or intentionality in actions, even when the actions are not their own. Whether East Asians would observe more emotions in everyday scenarios than would Americans also was investigated. In Study 1, Chinese and Americans read alleged diary entries of another person. Americans did focus more on main characters and on characters' intentionality. Study 2 replicated these results comparing Taiwanese and Americans on free recall of events concerning the self and of narratives and videos concerning others. Study 2 also found that Taiwanese made more comments about the emotional states of characters.


A Fuzzy Approach for Mining Quantitative Association Rules


Secure cloud computing: Benefits, risks and controls

Cloud computing presents a new model for IT service delivery and it typically involves over-a-network, on-demand, self-service access, which is dynamically scalable and elastic, utilising pools of often virtualized resources. Through these features, cloud computing has the potential to improve the way businesses and IT operate by offering fast start-up, flexibility, scalability and cost efficiency. Even though cloud computing provides compelling benefits and cost-effective options for IT hosting and expansion, new risks and opportunities for security exploits are introduced. Standards, policies and controls are therefore of the essence to assist management in protecting and safeguarding systems and data. Management should understand and analyse cloud computing risks in order to protect systems and data from security exploits. The focus of this paper is on mitigation for cloud computing security risks as a fundamental step towards ensuring secure cloud computing environments.


Improving the Neural Algorithm of Artistic Style

In this work we investigate different avenues of improving the Neural Algorithm of Artistic Style [7]. While showing great results when transferring homogeneous and repetitive patterns, the original style representation often fails to capture more complex properties, like having separate styles of foreground and background. This leads to visual artifacts and undesirable textures appearing in unexpected regions when performing style transfer. We tackle this issue with a variety of approaches, mostly by modifying the style representation in order for it to capture more information and impose a tighter constraint on the style transfer result. In our experiments, we subjectively evaluate our best method as producing from barely noticeable to significant improvements in the quality of style transfer.


Deep Neural Networks Reveal a Gradient in the Complexity of Neural Representations across the Ventral Stream.

Converging evidence suggests that the primate ventral visual pathway encodes increasingly complex stimulus features in downstream areas. We quantitatively show that there indeed exists an explicit gradient for feature complexity in the ventral pathway of the human brain. This was achieved by mapping thousands of stimulus features of increasing complexity across the cortical sheet using a deep neural network. Our approach also revealed a fine-grained functional specialization of downstream areas of the ventral stream. Furthermore, it allowed decoding of representations from human brain activity at an unsurpassed degree of accuracy, confirming the quality of the developed approach. Stimulus features that successfully explained neural responses indicate that population receptive fields were explicitly tuned for object categorization. This provides strong support for the hypothesis that object categorization is a guiding principle in the functional organization of the primate ventral stream.


High-Resolution Image Inpainting Using Multi-scale Neural Patch Synthesis

Recent advances in deep learning have shown exciting promise in filling large holes in natural images with semantically plausible and context aware details, impacting fundamental image manipulation tasks such as object removal. While these learning-based methods are significantly more effective in capturing high-level features than prior techniques, they can only handle very low-resolution inputs due to memory limitations and difficulty in training. Even for slightly larger images, the inpainted regions would appear blurry and unpleasant boundaries become visible. We propose a multi-scale neural patch synthesis approach based on joint optimization of image content and texture constraints, which not only preserves contextual structures but also produces high-frequency details by matching and adapting patches with the most similar mid-layer feature correlations of a deep classification network. We evaluate our method on the ImageNet and Paris Streetview datasets and achieved state-of-the-art inpainting accuracy. We show our approach produces sharper and more coherent results than prior methods, especially for high-resolution images.


A path decomposition approach for computing blocking probabilities in wavelength-routing networks

We study a class of circuit-switched wavelength-routing networks with fixed or alternate routing and with random wavelength allocation. We present an iterative path decomposition algorithm to evaluate accurately and efficiently the blocking performance of such networks with and without wavelength converters. Our iterative algorithm analyzes the original network by decomposing it into single-path subsystems. These subsystems are analyzed in isolation, and the individual results are appropriately combined to obtain a solution for the overall network. To analyze individual subsystems, we first construct an exact Markov process that captures the behavior of a path in terms of wavelength use. We also obtain an approximate Markov process which has a closed-form solution that can be computed efficiently for short paths. We then develop an iterative algorithm to analyze approximately arbitrarily long paths. The path decomposition approach naturally captures the correlation of both link loads and link blocking events. Our algorithm represents a simple and computationally efficient solution to the difficult problem of computing call-blocking probabilities in wavelength-routing networks. We also demonstrate how our analytical techniques can be applied to gain insight into the problem of converter placement in wavelength-routing networks.


A neuro-stimulus chip with telemetry unit for retinal prosthetic device

In this retinal prosthesis project, a rehabilitative device is designed to replace the functionality of defective photoreceptors in patients suffering from retinitis pigmentosa (RP) and age-related macular degeneration (AMD). The device consists of an extraocular and an intraocular unit. The implantable component receives power and a data signal via a telemetric inductive link between the two units. The extraocular unit includes a video camera and video processing board, a telemetry protocol encoder chip, and an RF amplifier and primary coil. The intraocular unit consists of a secondary coil, a rectifier and regulator, a retinal chip with a telemetry protocol decoder, a stimulus signal generator, and an electrode array. This paper focuses on the design, fabrication, and testing of a microchip which serves as the telemetry protocol decoder and stimulus signal generator. It is fabricated by MOSIS with 1.2-mm CMOS technology and was demonstrated to provide the desired biphasic current stimulus pulses for an array of 100 retinal electrodes at video frame rates.