A Three-Winding Coupled-Inductor DC–DC Converter Topology With High Voltage Gain and Reduced Switch Stress

This paper presents a dc–dc boost converter topology for low input and high output voltage applications, such as photovoltaic systems, fuel cell systems, high-intensity discharge lamp, and electric vehicles. The suggested configuration consists of a three-winding coupled-inductor, a single switch and two hybrid voltage multiplier cells. Furthermore, two independent hybrid voltage multiplier cells are in parallel when the single switch S is turned on, and they are in series when the switch S is turned off. So, the advantages of the proposed converter structure are summarized as follows: 1) A coupled inductor with three windings is introduced in the presented converter structure. The two secondary windings of the coupled inductor are, respectively, used to form a hybrid multiplier cell on the one hand, on the other hand, it increases the control freedom of the voltage gain, enhances the utility rate of magnetic core and power density, and reduces the stress of power components to provide a stable constant dc output voltage. 2) The two hybrid multiplier cells can absorb synchronously the energy of stray inductance, which not only reduces the current stress of corresponding diodes, but also greatly alleviates the spike voltage of the main switch, which improves the efficiency. 3) The two hybrid multiplier cells are connected in series to supply power energy for the load, so the voltage gain is extended greatly due to this particular structure. Thus, low-voltage low-conduction-loss devices can be selected and the reverse-recovery currents within the diodes are inhibited. The operating principles and the steady state analyses of the proposed converter are discussed in detail. Finally, a test prototype has been implemented in the laboratory, and the simulated and experimental results show satisfactory agreement with the theoretical analysis.


Twitter Sentiment Analysis: A Bootstrap Ensemble Framework

Twitter sentiment analysis has become widely popular. However, stable Twitter sentiment classification performance remains elusive due to several issues: heavy class imbalance in a multi-class problem, representational richness issues for sentiment cues, and the use of diverse colloquial linguistic patterns. These issues are problematic since many forms of social media analytics rely on accurate underlying Twitter sentiments. Accordingly, a text analytics framework is proposed for Twitter sentiment analysis. The framework uses an elaborate bootstrapping ensemble to quell class imbalance, sparsity, and representational richness issues. Experiment results reveal that the proposed approach is more accurate and balanced in its predictions across sentiment classes, as compared to various comparison tools and algorithms. Consequently, the bootstrapping ensemble framework is able to build sentiment time series that are better able to reflect events eliciting strong positive and negative sentiments from users. Considering the importance of Twitter as one of the premiere social media platforms, the results have important implications for social media analytics and social intelligence.


DeFlaker: Automatically Detecting Flaky Tests

Developers often run tests to check that their latest changes to a code repository did not break any previously working functionality. Ideally, any new test failures would indicate regressions caused by the latest changes. However, some test failures may not be due to the latest changes but due to non-determinism in the tests, popularly called flaky tests. The typical way to detect flaky tests is to rerun failing tests repeatedly. Unfortunately, rerunning failing tests can be costly and can slow down the development cycle.
 We present the first extensive evaluation of rerunning failing tests and propose a new technique, called DeFlaker, that detects if a test failure is due to a flaky test without rerunning and with very low runtime overhead. DeFlaker monitors the coverage of latest code changes and marks as flaky any newly failing test that did not execute any of the changes. We deployed DeFlaker live, in the build process of 96 Java projects on TravisCI, and found 87 previously unknown flaky tests in 10 of these projects. We also ran experiments on project histories, where DeFlaker detected 1, 874 flaky tests from 4, 846 failures, with a low false alarm rate (1.5%). DeFlaker had a higher recall (95.5% vs. 23%) of confirmed flaky tests than Maven's default flaky test detector.


Understanding the influence and service type of trusted third party on consumers' online trust: evidence from Australian B2C marketplace

In this study, the trusted third party (TTP) in Australia's B2C marketplace is studied and the factors influencing consumers' trust behaviour are examined from the perspective of consumers' online trust. Based on the literature review and combined with the development status and background of Australia's e-commerce, underpinned by the Theory of Planned Behaviour (TPB) and a conceptual trust model, this paper expatiates the specific factors and influence mechanism of TTP on consumers' trust behaviour. Also this paper explains two different functions of TTP to solve the online trust problem faced by consumers. Meanwhile, this paper summarizes five different types of services provided by TTPs during the establishment of the trust relationship. Finally, the present study selects 100 B2C enterprises by the simple random sampling method and makes a detailed analysis of their TTPs, to verify the services and functions of the proposed TTP in the trust model. This study is of some significance for comprehending the influence mechanism, functions and services of TTPs on consumers' trust behaviour in the realistic Australian B2C environment.


Exploration and Mapping with Autonomous Robot Teams Results from the MAGIC 2010 Competition

The potential impact of autonomous robotics is magnified when those robots are deployed in teams: a team of cooperating robots can greatly increase the effectiveness of a human working alone, making short work of search-and-rescue and reconnaissance tasks. To achieve this potential, however, a number of challenging problems ranging from multi-robot planning, state estimation, object detection, and human-robot interfaces must first be solved. The MAGIC 2010 competition, like the DARPA grand challenges that preceded it, presented a formidable robotics problem designed to foster fundamental advances in these difficult areas. MAGIC asked teams of robots to collaboratively explore and map a 500× 500m area, detect and track benign and dangerous objects, and collaborate with human commanders while respecting their cognitive limits. This paper describes our winning entry in the MAGIC contest, where we fielded a team of 14 autonomous robots supervised by two human operators. While the challenges in MAGIC were diverse, we believe that cooperative multi-robot state estimation is ultimately the critical factor in building a successful system. In this paper, we describe our system and some of the technological advances that we believe were responsible for our success. We also contrast our approach to those of other teams. a)


A segmented claw-pole motor for traction applications considering recycling aspects

With the expansion of the fleet of electric and hybrid electric vehicles worldwide, it is of interest to consider recycling aspects of the parts that are introduced in these new vehicles. This paper focuses on the design of an electrical machine, a claw-pole motor, considering recycling of its components. The suggested design has segmented core parts of soft magnetic composites which yield a design very suitable for recycling as the core material is brittle and it thus simplifies the access of the copper winding. The windings are pre-formed ring-coils with a high fill-factor and with no end-windings. Through the use of direct water cooling, employing space between the claws, the current density can be high, and the machine can be compact. The results of finite element simulations of the electromagnetic properties (previously validated against measurements) show that a high performance recyclable motor with ratings above 10 kW can be made. In comparison with a commercial motor, the claw-pole motor has similar performance, a higher core and magnet weight and a lower copper weight. It also has an expected advantage regarding manufacturing cost and cost of recycling and it has lower copper loss.


Force Jacket: Pneumatically-Actuated Jacket for Embodied Haptic Experiences

Immersive experiences seek to engage the full sensory system in ways that words, pictures, or touch alone cannot. With respect to the haptic system, however, physical feedback has been provided primarily with handheld tactile experiences or vibration-based designs, largely ignoring both pressure receptors and the full upper-body area as conduits for expressing meaning that is consistent with sight and sound. We extend the potential for immersion along these dimensions with the Force Jacket, a novel array of pneumatically-actuated airbags and force sensors that provide precisely directed force and high frequency vibrations to the upper body. We describe the pneumatic hardware and force control algorithms, user studies to verify perception of airbag location and pressure magnitude, and subsequent studies to define full-torso, pressure and vibration-based feel effects such as punch, hug, and snake moving across the body. We also discuss the use of those effects in prototype virtual reality applications.


Adoption of business continuity planning processes in IT service management

For any fault of the same severity level, traditional fault discovery and notification tools provide equal weighting from business points of view. To improve the fault correlation from business perspectives, we proposed a framework to automate network and system alerts with respect to its business service impact for proactive notification to IT operations management. This paper outlines the value of business continuity planning (BCP) during the course of service impact analysis, placing particular emphasis on the business perspective in the processes of IT service management. The framework explicitly employs BCP relevant processes in order to identify the relationships between business services and IT resources A practical case in IT operations to illustrate the concept was then conducted.


ADMIRAL: A Data Mining Based Financial Trading System

This paper presents a novel framework for predicting stock trends and making financial trading decisions based on a combination of data and text mining techniques. The prediction models of the proposed system are based on the textual content of time-stamped Web documents in addition to traditional numerical time series data, which is also available from the Web. The financial trading system based on the model predictions (ADMIRAL) is using three different trading strategies. In this paper, the ADMIRAL system is simulated and evaluated on real-world series of news stories and stocks data using the C4.5 decision tree induction algorithm. The main performance measures are the predictive accuracy of the induced models and, more importantly, the profitability of each trading strategy using these predictions


Linear cross-modal hashing for efficient multimedia search

Most existing cross-modal hashing methods suffer from the scalability issue in the training phase. In this paper, we propose a novel cross-modal hashing approach with a linear time complexity to the training data size, to enable scalable indexing for multimedia search across multiple modals. Taking both the intra-similarity in each modal and the inter-similarity across different modals into consideration, the proposed approach aims at effectively learning hash functions from large-scale training datasets. More specifically, for each modal, we first partition the training data into $k$ clusters and then represent each training data point with its distances to $k$ centroids of the clusters. Interestingly, such a k-dimensional data representation can reduce the time complexity of the training phase from traditional O(n2) or higher to O(n), where $n$ is the training data size, leading to practical learning on large-scale datasets. We further prove that this new representation preserves the intra-similarity in each modal. To preserve the inter-similarity among data points across different modals, we transform the derived data representations into a common binary subspace in which binary codes from all the modals are "consistent" and comparable. nThe transformation simultaneously outputs the hash functions for all modals, which are used to convert unseen data into binary codes. Given a query of one modal, it is first mapped into the binary codes using the modal's hash functions, followed by matching the database binary codes of any other modals. Experimental results on two benchmark datasets confirm the scalability and the effectiveness of the proposed approach in comparison with the state of the art.


In this report we provide an overview of the open source Armadillo C++ linear algebra library (matrix maths). The library aims to have a good balance between speed and ease of use, and is useful if C++ is the language of choice (due to speed and/or integration capabilities), rather than another language like Matlab or Octave. In particular, Armadillo can be used for fast prototyping and computationally intensive experiments, while at the same time allowing for relatively painless transition of research code into production environments. It is distributed under a license that is applicable in both open source and proprietary software development contexts. The library supports integer, floating point and complex numbers, as well as a subset of trigonometric and statistics functions. Various matrix decompositions are provided through optional integration with LAPACK, or one its high-performance drop-in replacements, such as MKL from Intel or ACML from AMD. A delayed evaluation approach is employed (during compile time) to combine several operations into one and reduce (or eliminate) the need for temporaries. This is accomplished through C++ template meta-programming. Performance comparisons suggest that the library is considerably faster than Matlab and Octave, as well as previous C++ libraries such as IT++ and Newmat. This report reflects a subset of the functionality present in Armadillo v2.4. Armadillo can be downloaded from: • http://arma.sourceforge.net If you use Armadillo in your research and/or software, we would appreciate a citation to this document. Please cite as: • Conrad Sanderson. Armadillo: An Open Source C++ Linear Algebra Library for Fast Prototyping and Computationally Intensive Experiments. Technical Report, NICTA, 2010. Armadillo: An Open Source C++ Linear Algebra Library NICTA Technical Report


An optimal method for stochastic composite optimization

This paper considers an important class of convex programming (CP) problems, namely, the stochastic composite optimization (SCO), whose objective function is given by the summation of general nonsmooth and smooth stochastic components. Since SCO covers non-smooth, smooth and stochastic CP as certain special cases, a valid lower bound on the rate of convergence for solving these problems is known from the classic complexity theory of convex programming. Note however that the optimization algorithms that can achieve this lower bound had never been developed. In this paper, we show that the simple mirror-descent stochastic approximation method exhibits the best-known rate of convergence for solving these problems. Our major contribution is to introduce the accelerated stochastic approximation (AC-SA) algorithm based on Nesterov’s optimal method for smooth CP [32,34], and show that the AC-SA algorithm can achieve the aforementioned lower bound on the rate of convergence for SCO. To the best of our knowledge, it is also the first universally optimal algorithm in the literature for solving non-smooth, smooth and stochastic CP problems. We illustrate the significant advantages of the AC-SA algorithm over existing methods in the context of solving a special but broad class of stochastic programming problems.


Universal approximation bounds for superpositions of a sigmoidal function

Approximation properties of a class of artificial neural networks are established. It is shown that feedforward networks with one layer of sigmoidal nonlinearities achieve inte grated squared error of order O(l/n), where n is the number of nodes. The function appruximated is assumed to have a bound on the first moment of the magnitude distribution of the Fourier transform. The nonlinear parameters associated with the sigmoidal nodes, as well as the parameters of linear combination, are adjusted in the approximation. In contrast, it is shown that for series expansions with n terms, in which only the parameters of linear combination are adjusted, the integrated squared approximation error cannot be made smaller than order 1/n2/d uniformly for functions satisfying the same smoothness assumption, where d is the dimension of the input to the function. For the class of functions examined here, the approximation rate and the parsimony of the parameterization of the networks are surprisingly advantageous in high-dimensional settings.


Greed is good: algorithmic results for sparse approximation

This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho's basis pursuit (BP) paradigm can recover the optimal representation of an exactly sparse signal. It leverages this theory to show that both OMP and BP succeed for every sparse input signal from a wide class of dictionaries. These quasi-incoherent dictionaries offer a natural generalization of incoherent dictionaries, and the cumulative coherence function is introduced to quantify the level of incoherence. This analysis unifies all the recent results on BP and extends them to OMP. Furthermore, the paper develops a sufficient condition under which OMP can identify atoms from an optimal approximation of a nonsparse signal. From there, it argues that OMP is an approximation algorithm for the sparse problem over a quasi-incoherent dictionary. That is, for every input signal, OMP calculates a sparse approximant whose error is only a small factor worse than the minimal error that can be attained with the same number of terms.


Primal-dual subgradient methods for convex problems

In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. The proposed schemes differ from the classical approaches (divergent series methods, mirror descent methods) by presence of two control sequences. The first sequence is responsible for aggregating the support functions in the dual space, and the second one establishes a dynamically updated scale between the primal and dual spaces. This additional flexibility allows to guarantee a boundedness of the sequence of primal test points even in the case of unbounded feasible set. We present the variants of subgradient schemes for nonsmooth convex minimization, minimax problems, saddle point problems, variational inequalities, and stochastic optimization. In all situations our methods are proved to be optimal from the view point of worst-case black-box lower complexity bounds.


Modelling Radiological Language with Bidirectional Long Short-Term Memory Networks

Motivated by the need to automate medical information extraction from free-text radiological reports, we present a bi-directional long short-term memory (BiLSTM) neural network architecture for modelling radiological language. The model has been used to address two NLP tasks: medical named-entity recognition (NER) and negation detection. We investigate whether learning several types of word embeddings improves BiLSTM’s performance on those tasks. Using a large dataset of chest x-ray reports, we compare the proposed model to a baseline dictionary-based NER system and a negation detection system that leverages the hand-crafted rules of the NegEx algorithm and the grammatical relations obtained from the Stanford Dependency Parser. Compared to these more traditional rule-based systems, we argue that BiLSTM offers a strong alternative for both our tasks.


Marine debris in central California: quantifying type and abundance of beach litter in Monterey Bay, CA.

Monitoring beach litter is essential for reducing ecological threats towards humans and wildlife. In Monterey Bay, CA information on seasonal and spatial patterns is understudied. Central California's coastal managers require reliable information on debris abundance, distribution, and type, to support policy aimed at reducing litter. We developed a survey method that allowed for trained citizen scientists to quantify the types and abundance of beach litter. Sampling occurred from July 2009-June 2010. Litter abundance ranged from 0.03 to 17.1 items m(-2). Using a mixed model approach, we found season and location have the greatest effect on litter abundance. Styrofoam, the most numerically abundant item, made up 41% of the total amount of litter. Unexpected items included fertilizer pellets. The results of this study provide a baseline on the types and abundance of litter on the central coast and have directly supported policy banning Styrofoam take out containers from local municipalities.


Issues and Perspectives in Meditation Research: In Search for a Definition

Despite the growing interest in the neurobiological correlates of meditation, most research has omitted to take into account the underlying philosophical aspects of meditation and its wider implications. This, in turn, is reflected in issues surrounding definition, study design, and outcomes. Here, I highlight the often ignored but important aspect of definition in the existing scholarship on neuroscience and meditation practice. For a satisfactory account of a neuroscience of meditation, we must aim to retrieve an operational definition that is inclusive of a traditional ontological description as well as the modern neurocognitive account of the phenomena. Moving beyond examining the effects of meditation practice, to take a potential step forward in the direction to establish how meditation works, it becomes crucial to appraise the philosophical positions that underlie the phenomenology of meditation in the originating traditions. This endeavor may challenge our intuitions and concepts in either directions, but issues pertaining to definition, design, and validity of response measures are extremely important for the evolution of the field and will provide a much-needed context and framework for meditation based interventions.


Patent classifications as indicators of intellectual organization

Using the 138,751 patents filed in 2006 under the Patent Cooperation Treaty, coclassification analysis is pursued on the basis of threeand four-digit codes in the International Patent Classification (IPC, 8 edition). The co-classifications among the patents enable us to analyze and visualize the relations among technologies at different levels of aggregation. The hypothesis that classifications might be considered as the organizers of patents into classes, and that therefore co-classification patterns—more than co-citation patterns—might be useful for mapping, is not corroborated. The classifications hang weakly together, even at the four-digit level; at the country level, more specificity can be made visible. However, countries are not the appropriate units of analysis because patent portfolios are largely similar in many advanced countries in terms of the classes attributed. Instead of classes, one may wish to explore the mapping of title words as a better approach to visualize the intellectual organization of patents.


Genetically Improved PSO Algorithm for Efficient Data Clustering

Clustering is an important research topic in data mining that appears in a wide range of unsupervised classification applications. Partitional clustering algorithms such as the k-means algorithm are the most popular for clustering large datasets. The major problem with the k-means algorithm is that it is sensitive to the selection of the initial partitions and it may converge to local optima. In this paper, we present a hybrid two-phase GAI-PSO+k-means data clustering algorithm that performs fast data clustering and can avoid premature convergence to local optima. In the first phase we utilize the new genetically improved particle swarm optimization algorithm (GAI-PSO) which is a population-based heuristic search technique modeled on the hybrid of cultural and social rules derived from the analysis of the swarm intelligence (PSO) and the concepts of natural selection and evolution (GA). The GAI-PSO combines the standard velocity and position update rules of PSOs with the ideas of selection, mutation and crossover from GAs. The GAI-PSO algorithm searches the solution space to find the optimal initial cluster centroids for the next phase. The second phase is a local refining stage utilizing the k-means algorithm which can efficiently converge to the optimal solution. The proposed algorithm combines the ability of the globalized searching of the evolutionary algorithms and the fast convergence of the k-means algorithm and can avoid the drawback of both. The performance of the proposed algorithm is evaluated through several benchmark datasets. The experimental results show that the proposed algorithm is highly forceful and outperforms the previous approaches such as SA, ACO, PSO and k-means for the partitional clustering problem.


s t )-r technologies social responses to communication c Defining Virtual Reality : Dimensions Determining Telepresence

Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variable-based definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of “presence” and “telepresence,” which refer to the sense of being in an environment, generated by natural or mediated means, respectively. Two technological dimensions that contribute to telepresence, vividness and interactivity, are discussed. A variety of media are classified according to these dimensions. Suggestions are made for the application of the new definition of virtual reality within the field of communication research.


Advances in ultrasound biomicroscopy.

The visualisation of living tissues at microscopic resolution is attracting attention in several fields. In medicine, the goals are to image healthy and diseased tissue with the aim of providing information previously only available from biopsy samples. In basic biology, the goal may be to image biological models of human disease or to conduct longitudinal studies of small-animal development. High-frequency ultrasonic imaging (ultrasound biomicroscopy) offers unique advantages for these applications. In this paper, the development of ultrasound biomicroscopy is reviewed. Aspects of transducer development, systems design and tissue properties are presented to provide a foundation for medical and biological applications. The majority of applications appear to be developing in the 40-60-MHz frequency range, where resolution on the order of 50 microm can be achieved. Doppler processing in this frequency range is beginning to emerge and some examples of current achievements will be highlighted. The current state of the art is reviewed for medical applications in ophthalmology, intravascular ultrasound, dermatology, and cartilage imaging. Ultrasound biomicroscopic studies of mouse embryonic development and tumour biology are presented. Speculation on the continuing evolution of ultrasound biomicroscopy will be discussed.


A practical approach for content mining of Tweets.

Use of data generated through social media for health studies is gradually increasing. Twitter is a short-text message system developed 6 years ago, now with more than 100 million users generating over 300 million Tweets every day. Twitter may be used to gain real-world insights to promote healthy behaviors. The purposes of this paper are to describe a practical approach to analyzing Tweet contents and to illustrate an application of the approach to the topic of physical activity. The approach includes five steps: (1) selecting keywords to gather an initial set of Tweets to analyze; (2) importing data; (3) preparing data; (4) analyzing data (topic, sentiment, and ecologic context); and (5) interpreting data. The steps are implemented using tools that are publically available and free of charge and designed for use by researchers with limited programming skills. Content mining of Tweets can contribute to addressing challenges in health behavior research.


60 GHz system-on-package antenna array with parasitic microstrip antenna single element

In this paper microstrip antenna for 60 GHz on LTCC is presented. Special techniques are used to satisfy the antenna specification in wide bandwidth (7 GHz, from 57 GHz to 64 GHz) and high gain (15 dBi). An increase in bandwidth is achieved by using aperture the coupling and the multilayer structure. Gain is increased by using parasitic patches which increase the total antenna aperture. In paper was presented 60 GHz parasitic microstrip antenna with two layers of parasitic patches. High gain is obtained as the result of the optimization. However, presented return loss results can not be treated as wide bandwidth.


Checking Business Process Evolution

Business processes support the modeling and the implementation of software as workflows of local and inter-process activities. Taking over structuring and composition, evolution has become a central concern in software development. We advocate it should be taken into account as soon as the modeling of business processes, which can thereafter be made executable using process engines or model-to-code transformations. We show here that business process evolution needs formal analysis in order to compare different versions of processes, identify precisely the differences between them, and ensure the desired consistency. To reach this objective, we first present a model transformation from the BPMN standard notation to the LNT process algebra. We then propose a set of relations for comparing business processes at the formal model level. With reference to related work, we propose a richer set of comparison primitives supporting renaming, refinement, propertyand context-awareness. Thanks to an implementation of our approach that can be used through a Web application, we put the checking of evolution within the reach of business process designers.


On the number of response regions of deep feed forward networks with piece-wise linear activations

This paper explores the complexity of deep feedforward networks with linear presynaptic couplings and rectified linear activations. This is a contribution to the growing body of work contrasting the representational power of deep and shallow network architectures. In particular, we offer a framework for comparing deep and shallow models that belong to the family of piecewise linear functions based on computational geometry. We look at a deep rectifier multi-layer perceptron (MLP) with linear outputs units and compare it with a single layer version of the model. In the asymptotic regime, when the number of inputs stays constant, if the shallow model has kn hidden units and n0 inputs, then the number of linear regions is O(k0n0). For a k layer model with n hidden units on each layer it is Ω(bn/n0c n0). The number bn/n0c grows faster than k0 when n tends to infinity or when k tends to infinity and n ≥ 2n0. Additionally, even when k is small, if we restrict n to be 2n0, we can show that a deep model has considerably more linear regions that a shallow one. We consider this as a first step towards understanding the complexity of these models and specifically towards providing suitable mathematical tools for future analysis.


Business Process Design by Reusing Business Process Fragments from the Cloud

The constant development of technologies forces companies to be more innovative in order to stay competitive. In fact, designing a process from scratch is time consuming, error prone and costly. In this context, companies are heading to reuse process fragments when designing a new process to ensure a high degree of efficiency, with respect to delivery deadlines. However, reusing these fragments may disclose sensitive business activities, especially if these latter are deployed in an untrusted environment. In addition, companies are concerned about their user's privacy. To address these issues, we investigate how to build a new business process by reusing the safest existing fragments coming from various cloud servers, i.e. The ones that comply at best with company's preferences and policies, and offer an appropriate level of safety.


A Communication Theoretical Analysis of Multiple-Access Channel Capacity in Magneto-Inductive Wireless Networks

Magneto-inductive (MI) wireless communications is an emerging subject with a rich set of applications, including local area networks for the Internet-of-Things, wireless body area networks, in-body and on-chip communications, and underwater and underground sensor networks as a low-cost alternative to radio frequency, acoustic or optical methods. Practical MI networks include multiple access channel (MAC) mechanisms for connecting a random number of coils without any specific topology or coil orientation assumptions covering both short and long ranges. However, there is not any information theoretical modeling of MI MAC (MIMAC) capacity of such universal networks with fully coupled frequency selective channel models and exact 3-D coupling model of circular coils instead of long range dipole approximations. In this paper, K-user MIMAC capacity is information theoretically modeled and analyzed, and two-user MIMACs are modeled with explicitly detailed channel responses, bandwidths and coupled thermal noise. K-user MIMAC capacity is achieved through Lagrangian solution with K-user water-filling optimization. Optimum orientations maximizing capacity and received power are theoretically analyzed, and numerically simulated for two-user MIMACs. Constructive gain and destructive interference mechanisms on MIMACs are introduced in comparison with the classical interference based approaches. The theoretical basis promises the utilization of MIMACs in 5G architectures.


A Space Vector Modulation Scheme of the Quasi-Z-Source Three-Level T-Type Inverter for Common-Mode Voltage Reduction

The conventional three-level inverter suffers the limitation of voltage buck operation. In order to give both voltage buck and boost operation capability, the quasi-Z-source three-level T-type inverter (3LT<inline-formula> <tex-math notation="LaTeX">$^2$</tex-math></inline-formula>I) has been proposed. This paper further proposes a space vector modulation (SVM) scheme for the quasi-Z-source 3LT<inline-formula><tex-math notation="LaTeX">$^2$</tex-math> </inline-formula>I to reduce the magnitude and slew rate of common-mode voltage (CMV). By properly selecting the shoot-through phase, the shoot-through states are inserted within zero vector in order not to affect the active states and output voltage. Doing so, the CMV generated by the quasi-Z-source 3LT<inline-formula><tex-math notation="LaTeX"> $^2$</tex-math></inline-formula>I is restricted within one-sixth of dc-link voltage, and voltage boosting and CMV reduction can be simultaneously realized. In addition, high dc-link voltage utilization can be maintained. The proposed scheme has been verified in both simulations and experiments. Comparisons are conducted with the conventional SVM method and the phase-shifted sinusoidal PWM method.


User experience: challenges and opportunities

User expectations, motivations and feelings when using a product or encountering a system have urged the need to investigate beyond the traditional functionality and usability concerns by assessing and designing for the user experience. Having this realized, we can ensure positive user experience as well as desirable products. This paper aims at providing an overview of the main concepts and principles related to user experience. The topics discussed in this paper cover both theories from the academia as well as empirical studies from the industry. Due to misconception of user experience, it was found that industry depends on and uses the traditional usability methods in the product development as user experience practices. As a result, this paper discusses and elaborates the relationship between conventional usability and user experience in addition to the variety of methods which can be used for user experience evaluation during different time spans. Furthermore, user experience extends over different areas such as human computer interaction, and product design and development. Knowledge and concepts related to user experience are scattered due to the dynamic concepts of user experience. In other words, authors tend to discuss the user experience from their own perspective and interest. Hence, this paper is trying to provide and establish a holistic understanding of the user experience by covering different topics related to user experience. The output of this paper may provide and assist researchers and practitioners to establish a base to aid in proper understanding of user experience, its concepts and principles.


High performance communication architecture for smart distribution power grid in developing nations

In a smart distribution power grid, cost efficient and reliable communication architecture plays a crucial role in achieving complete functionality. There are different sets of Quality of Services (QoS) requirements for different data packets transmitting inside the microgrid (a regionally limited smart distribution grid), making it challenging to derive optimal communication architecture. The objective of this research work is to determine the optimal communication technologies for each data packet based on its QoS requirement. In this paper, we have proposed an architecture for a smart distribution power grid with Cyber Physical System enabled microgrids, which accommodate almost all functional requirements of a smart distribution power grid. For easy transition towards optimal communication architecture, we have presented a six-tier communication topology, which is derived from the architecture for a smart distribution power grid. The optimization formulations for each packet structure presented in this paper minimize the overall cost and consider the QoS requirements for each packet. Based on the simulation results, we have made recommendations for optimal communication technologies for each packet and thereby developed a heterogeneous communication architecture for


Sexual Dimorphism in the Parietal Substrate Associated with Visuospatial Cognition Independent of General Intelligence

Sex differences in visuospatial cognition (VSC) with male advantage are frequently reported in the literature. There is evidence for sexual dimorphisms in the human brain, one of which postulates more gray matter (GM) in females and more white matter (WM) in males relative to total intracranial volume. We investigated the neuroanatomy of VSC independent of general intelligence (g) in sex-separated populations, homogenous in age, education, memory performance, a memory- and brain morphology-related gene, and g. VSC and g were assessed with the Wechsler adult intelligence scale. The influence of g on VSC was removed using a hierarchical factor analysis and the Schmid–Leiman solution. Structural high-resolution magnetic resonance images were acquired and analyzed with voxel-based morphometry. As hypothesized, the clusters of positive correlations between local volumes and VSC performance independent of g were found mainly in parietal areas, but also in pre- and postcentral regions, predominantly in the WM in males, whereas in females these correlations were located in parietal and superior temporal areas, predominantly in the GM. Our results suggest that VSC depends more strongly on parietal WM structures in males and on parietal GM structures in females. This sex difference might have to do with the increased axonal and decreased somatodendritic tissue in males relative to females. Whether such sex-specific implementations of the VSC network can be explained genetically as suggested in investigations into the Turner syndrome or as a result of structural neural plasticity upon different experience and usage remains to be shown.


The effect of flow experience on mobile SNS users' loyalty

Purpose – The purpose of this research is to examine the effect of flow experience on mobile social networking service (SNS) users’ loyalty. Design/methodology/approach – Based on 305 valid responses collected from a survey questionnaire, structural equation modeling (SEM) technology was employed to examine the research model. Findings – The results show that both information quality and system quality significantly affect users’ trust and flow experiences, which further determine their loyalty. The results indicate that flow experience is the strongest determinant of users’ loyalty. Practical implications – Mobile SNS providers need to consider user experience when seeking users’ loyalty. They should enhance information quality and system quality in order to improve user trust and flow experience. Originality/value – Although much research has been conducted to explore the effects of extrinsic motivations, such as perceived usefulness, on mobile commerce user behavior, the effect of intrinsic motivations, such as flow experience, is seldom tested. This research found the effect of flow experience on mobile SNS users’ loyalty to be significant.


Engineering Time-Expanded Graphs for Faster Timetable Information

We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect.


FingerScanner: Embedding a Fingerprint Scanner in a Raspberry Pi

Nowadays, researchers are paying increasing attention to embedding systems. Cost reduction has lead to an increase in the number of platforms supporting the operating system Linux, jointly with the Raspberry Pi motherboard. Thus, embedding devices on Raspberry-Linux systems is a goal in order to make competitive commercial products. This paper presents a low-cost fingerprint recognition system embedded into a Raspberry Pi with Linux.


Depth driven people counting using deep region proposal network

People counting is a crucial subject in video surveillance application. Factors such as severe occlusions, scene perspective distortions in real application scenario make this task challenging. In this paper, we carefully designed a deep detection framework based on depth information for people counting in crowded environments. Our system performs head detection on depth images collected by an overhead vertical Kinect sensor. To the best of our knowledge, this is the first attempt to use the deep convolutional neural networks on depth images for people counting. We explored the impact of the number and quality of RPN positive anchors on the performance of Faster R-CNN and proposed a solution. Our method is very simple but effective, not only showing promising results but also efficiency as it runs in real-time at a frame rate of about 110 frames per second on a GPU.


A Sparse Matrix Library in C + + for High PerformanceArchitectures

We describe an object oriented sparse matrix library in C++ built upon the Level 3 Sparse BLAS proposal [5] for portability and performance across a wide class of machine architectures. The C++ library includes algorithms for various iterative methods and supports the most common sparse data storage formats used in practice. Besides simplifying the subroutine interface, the object oriented design allows the same driving code to be used for various sparse matrix formats, thus addressing many of the di culties encountered with the typical approach to sparse matrix libraries. We emphasize the fundamental design issues of the C++ sparse matrix classes and illustrate their usage with the preconditioned conjugate gradient (PCG) method as an example. Performance results illustrate that these codes are competitive with optimized Fortran 77. We discuss the impact of our design on elegance, performance, maintainability, portability, and robustness.


Explaining and Harnessing Adversarial Examples

Several machine learning models, including neural networks, consistently misclassify adversarial examples—inputs formed by applying small but intentionally worst-case perturbations to examples from the dataset, such that the perturbed input results in the model outputting an incorrect answer with high confidence. Early attempts at explaining this phenomenon focused on nonlinearity and overfitting. We argue instead that the primary cause of neural networks’ vulnerability to adversarial perturbation is their linear nature. This explanation is supported by new quantitative results while giving the first explanation of the most intriguing fact about them: their generalization across architectures and training sets. Moreover, this view yields a simple and fast method of generating adversarial examples. Using this approach to provide examples for adversarial training, we reduce the test set error of a maxout network on the MNIST dataset.


Towards Deep Neural Network Architectures Robust to Adversarial Examples

Recent work has shown deep neural networks (DNNs) to be highly susceptible to well-designed, small perturbations at the input layer, or so-called adversarial examples. Taking images as an example, such distortions are often imperceptible, but can result in 100% mis-classification for a state of the art DNN. We study the structure of adversarial examples and explore network topology, pre-processing and training strategies to improve the robustness of DNNs. We perform various experiments to assess the removability of adversarial examples by corrupting with additional noise and pre-processing with denoising autoencoders (DAEs). We find that DAEs can remove substantial amounts of the adversarial noise. However, when stacking the DAE with the original DNN, the resulting network can again be attacked by new adversarial examples with even smaller distortion. As a solution, we propose Deep Contractive Network, a model with a new end-to-end training procedure that includes a smoothness penalty inspired by the contractive autoencoder (CAE). This increases the network robustness to adversarial examples, without a significant performance penalty.


Deep neural networks are easily fooled: High confidence predictions for unrecognizable images

Deep neural networks (DNNs) have recently been achieving state-of-the-art performance on a variety of pattern-recognition tasks, most notably visual classification problems. Given that DNNs are now able to classify objects in images with near-human-level performance, questions naturally arise as to what differences remain between computer and human vision. A recent study [30] revealed that changing an image (e.g. of a lion) in a way imperceptible to humans can cause a DNN to label the image as something else entirely (e.g. mislabeling a lion a library). Here we show a related result: it is easy to produce images that are completely unrecognizable to humans, but that state-of-the-art DNNs believe to be recognizable objects with 99.99% confidence (e.g. labeling with certainty that white noise static is a lion). Specifically, we take convolutional neural networks trained to perform well on either the ImageNet or MNIST datasets and then find images with evolutionary algorithms or gradient ascent that DNNs label with high confidence as belonging to each dataset class. It is possible to produce images totally unrecognizable to human eyes that DNNs believe with near certainty are familiar objects, which we call “fooling images” (more generally, fooling examples). Our results shed light on interesting differences between human vision and current DNNs, and raise questions about the generality of DNN computer vision.


Analysis of classifiers’ robustness to adversarial perturbations

The goal of this paper is to analyze the intriguing instability of classifiers to adversarial perturbations (Szegedy et al., in: International conference on learning representations (ICLR), 2014). We provide a theoretical framework for analyzing the robustness of classifiers to adversarial perturbations, and show fundamental upper bounds on the robustness of classifiers. Specifically, we establish a general upper bound on the robustness of classifiers to adversarial perturbations, and then illustrate the obtained upper bound on two practical classes of classifiers, namely the linear and quadratic classifiers. In both cases, our upper bound depends on a distinguishability measure that captures the notion of difficulty of the classification task. Our results for both classes imply that in tasks involving small distinguishability, no classifier in the considered set will be robust to adversarial perturbations, even if a good accuracy is achieved. Our theoretical framework moreover suggests that the phenomenon of adversarial instability is due to the low flexibility of classifiers, compared to the difficulty of the classification task (captured mathematically by the distinguishability measure). We further show the existence of a clear distinction between the robustness of a classifier to random noise and its robustness to adversarial perturbations. Specifically, the former is shown to be larger than the latter by a factor that is proportional to $$\sqrt{d}$$ d (with d being the signal dimension) for linear classifiers. This result gives a theoretical explanation for the discrepancy between the two robustness properties in high dimensional problems, which was empirically observed by Szegedy et al. in the context of neural networks. We finally show experimental results on controlled and real-world data that confirm the theoretical analysis and extend its spirit to more complex classification schemes.


The evolution of Crew Resource Management training in commercial aviation.

In this study, we describe changes in the nature of Crew Resource Management (CRM) training in commercial aviation, including its shift from cockpit to crew resource management. Validation of the impact of CRM is discussed. Limitations of CRM, including lack of cross-cultural generality are considered. An overarching framework that stresses error management to increase acceptance of CRM concepts is presented. The error management approach defines behavioral strategies taught in CRM as error countermeasures that are employed to avoid error, to trap errors committed, and to mitigate the consequences of error.


Understanding Types of Cyberbullying in an Anonymous Messaging Application

The possibility of anonymity and lack of effective ways to identify inappropriate messages have resulted in a significant amount of online interaction data that attempt to harass, bully, or offend the recipient. In this work, we perform a preliminary linguistic study on messages exchanged using one such popular web/smartphone application—Sarahah, that allows friends to exchange messages anonymously. Since messages exchanged via Sarahah are private, we collect them when the recipient shares it on Twitter. We then perform an analysis of the different kinds of messages exchanged through this application. Our linguistic analysis reveals that a significant number of these messages (∼ 20%) include inappropriate, hurtful, or profane language intended to embarrass, offend, or bully the recipient. Our analysis helps in understanding the different ways in which anonymous message exchange platforms are used and the different types of bullying present in such exchanges.


Transient response and dynamic power dissipation comparison of various Dickson charge pump configurations based on charge transfer switches

Dickson charge pump is a switches-capacitor network providing a voltage gain and having open-circuit resistance dependent on the topology frequency and the size of storage capacitors. In this paper, the current status of research and development in the field of Dickson charge pump is extensively reviewed. Dickson charge pump is inductor-less DC to DC converter which uses a capacitor for its energy storage. The aim of this paper is to compare various techniques of Dickson charge pump currently explored in industry and academia. The parameters especially efficiency and voltage are compared. We have also discussed and evaluated the optimised criteria of capacitor sizing according to clock signals provided such that the charge pump performance could be properly optimised. We have simulated the transient response of DCP and provided the comprehensive study.


From GPS traces to a routable road map

This paper presents a method for automatically converting raw GPS traces from everyday vehicles into a routable road network. The method begins by smoothing raw GPS traces using a novel aggregation technique. This technique pulls together traces that belong on the same road in response to simulated potential energy wells created around each trace. After the traces are moved in response to the potential fields, they tend to coalesce into smooth paths. To help adjust the parameters of the constituent potential fields, we present a theoretical analysis of the behavior of our algorithm on a few different road configurations. With the resulting smooth traces, we apply a custom clustering algorithm to create a graph of nodes and edges representing the road network. We show how this network can be used to plan reasonable driving routes, much like consumer-oriented mapping Web sites. We demonstrate our algorithms using real GPS data collected on public roads, and we evaluate the effectiveness of our approach on public roads, and we evaluate the effectiveness of our approach by comparing the route planning results suggested by our generated graph to a commercial route planner.


Modeling and control of a hexacopter with a rotating seesaw

This paper presents a novel multicomputer type with a unique structure. This structure allows decoupling angular motion from translational motion along one of the body axes, and by that, five of the body degrees of freedom (DoF) can be controlled independently. The proposed aerial vehicle is a hexacopter with six propellers, such that four propellers are attached to the vehicle body and the other two attached to a seesaw. The seesaw is free to rotate around a single axis that is fixed in the body frame. Compared to a standard hexacopter, this unique design improves the maneuverability of the aerial vehicle, without the price of additional actuators. As opposed to tilting-rotor aerial-vehicle, in the proposed design all actuators generate lift. The paper describes the dynamical model of the novel vehicle and suggests a nonlinear controller to track desired trajectories along five of its DoF. The performances of the design are demonstrated numerically.


Peer victimization, psychosocial adjustment, and physical activity in overweight and at-risk-for-overweight youth.

OBJECTIVE
To examine the relationship between peer victimization and child and parent reports of psychosocial adjustment and physical activity in a clinical sample of at-risk-for-overweight and overweight children and adolescents.

METHODS
The Schwartz Peer Victimization Scale, Children's Depression Inventory-Short Form, Multidimensional Anxiety Scale for Children, Social Physique Anxiety Scale, PACE+ Adolescent Physical Activity Measure, and Asher Loneliness Scale were administered to 92 children and adolescents (54 females) aged 8-18 years. The youth's parent/guardian completed the Child Behavior Checklist.

RESULTS
Peer victimization was positively related to child-reported depression, anxiety, social physique anxiety, and loneliness, and parent-reported internalizing and externalizing symptoms. Peer victimization was negatively related to physical activity. Depressive symptoms and loneliness mediated the relations between peer victimization and physical activity.

CONCLUSION
Recognition of the magnitude of the problem and the means of evaluating for peer victimization is important for clinicians who work with overweight youth. Assessing peer experiences may assist in understanding rates of physical activity and/or past nonadherence to clinician recommendations.


Investigations on Knowledge Base Embedding for Relation Prediction and Extraction

We report an evaluation of the effectiveness of the existing knowledge base embedding models for relation prediction and for relation extraction on a wide range of benchmarks. We also describe a new benchmark, which is much larger and complex than previous ones, which we introduce to help validate the effectiveness of both tasks. The results demonstrate that knowledge base embedding models are generally effective for relation prediction but unable to give improvements for the state-of-art neural relation extraction model with the existing strategies, while pointing limitations of existing methods.


Agents on Stage: Advancing the State of the Art of AI

Intelligent computer agents are both the original goal and the ultimate goal of artificial intelligence research. In striving toward that goal, our community has followed a practical research strategy of "divide-and-conquer," with different sub-communities attacking important component functions of intelligence, such as planning, search, knowledge representation, vision, and natural language. This strategy has been almost too successful, yielding both challenging theoretical problems that have come to dominate the inquiries of many researchers and a spate of practical techniques that have enabled other researchers to move into profitable commercial enterprises. While each of these pursuits is worthy in its own right, together they have had the unfortunate sideeffect of fragmenting the field and almost completely diverting it from efforts to build intelligent agents.


An Effective CU Size Decision Method for HEVC Encoders

The emerging high efficiency video coding standard (HEVC) adopts the quadtree-structured coding unit (CU). Each CU allows recursive splitting into four equal sub-CUs. At each depth level (CU size), the test model of HEVC (HM) performs motion estimation (ME) with different sizes including 2N × 2N, 2N × N, N × 2N and N × N. ME process in HM is performed using all the possible depth levels and prediction modes to find the one with the least rate distortion (RD) cost using Lagrange multiplier. This achieves the highest coding efficiency but requires a very high computational complexity. In this paper, we propose a fast CU size decision algorithm for HM. Since the optimal depth level is highly content-dependent, it is not efficient to use all levels. We can determine CU depth range (including the minimum depth level and the maximum depth level) and skip some specific depth levels rarely used in the previous frame and neighboring CUs. Besides, the proposed algorithm also introduces early termination methods based on motion homogeneity checking, RD cost checking and SKIP mode checking to skip ME on unnecessary CU sizes. Experimental results demonstrate that the proposed algorithm can significantly reduce computational complexity while maintaining almost the same RD performance as the original HEVC encoder.


Vectorization vs. compilation in query execution

Compiling database queries into executable (sub-) programs provides substantial benefits comparing to traditional interpreted execution. Many of these benefits, such as reduced interpretation overhead, better instruction code locality, and providing opportunities to use SIMD instructions, have previously been provided by redesigning query processors to use a vectorized execution model. In this paper, we try to shed light on the question of how state-of-the-art compilation strategies relate to vectorized execution for analytical database workloads on modern CPUs. For this purpose, we carefully investigate the behavior of vectorized and compiled strategies inside the Ingres VectorWise database system in three use cases: Project, Select and Hash Join. One of the findings is that compilation should always be combined with block-wise query execution. Another contribution is identifying three cases where "loop-compilation" strategies are inferior to vectorized execution. As such, a careful merging of these two strategies is proposed for optimal performance: either by incorporating vectorized execution principles into compiled query plans or using query compilation to create building blocks for vectorized processing.


"PASS" principles for predictable bone regeneration.

Guided bone regeneration is a well-established technique used for augmentation of deficient alveolar ridges. Predictable regeneration requires both a high level of technical skill and a thorough understanding of underlying principles of wound healing. This article describes the 4 major biologic principles (i.e., PASS) necessary for predictable bone regeneration: primary wound closure to ensure undisturbed and uninterrupted wound healing, angiogenesis to provide necessary blood supply and undifferentiated mesenchymal cells, space maintenance/creation to facilitate adequate space for bone ingrowth, and stability of wound and implant to induce blood clot formation and uneventful healing events. In addition, a novel flap design and clinical cases using this principle are presented.


Expression Profiling of Developing Zebrafish Retinal Cells.

During retinal development, a variety of different types of neurons are produced. Understanding how each of these types of retinal nerve cells is generated is important from a developmental biology perspective. It is equally important if one is interested in how to regenerate cells after an injury or a disease. To gain more insight into how retinal neurons develop in the zebrafish, we performed single-cell mRNA profiling and in situ hybridizations (ISHs) on retinal sections and whole-mount zebrafish. Through the series of ISHs, designed and performed solely by undergraduate students in the laboratory, we were able to retrospectively identify our single-cell mRNA profiles as most likely coming from developing amacrine cells. Further analysis of these profiles will reveal genes that can be mutated using genome editing techniques. Together these studies increase our knowledge of the genes driving development of different cell types in the zebrafish retina.


Context and behavioral processes in extinction.

This article provides a selective review and integration of the behavioral literature on Pavlovian extinction. The first part reviews evidence that extinction does not destroy the original learning, but instead generates new learning that is especially context-dependent. The second part examines insights provided by research on several related behavioral phenomena (the interference paradigms, conditioned inhibition, and inhibition despite reinforcement). The final part examines four potential causes of extinction: the discrimination of a new reinforcement rate, generalization decrement, response inhibition, and violation of a reinforcer expectation. The data are consistent with behavioral models that emphasize the role of generalization decrement and expectation violation, but would be more so if those models were expanded to better accommodate the finding that extinction involves a context-modulated form of inhibitory learning.


Forecasting seasonal time series with computational intelligence: On recent methods and the potential of their combinations

Accurate time series forecasting is a key issue to support individual and organizational decision making. In this paper, we introduce novel methods for multi-step seasonal time series forecasting. All the presented methods stem from computational intelligence techniques: evolutionary artificial neural networks, support vector machines and genuine linguistic fuzzy rules. Performance of the suggested methods is experimentally justified on seasonal time series from distinct domains on three forecasting horizons. The most important contribution is the introduction of a new hybrid combination using linguistic fuzzy rules and the other computational intelligence methods. This hybrid combination presents competitive forecasts, when compared with the popular ARIMA method. Moreover, such hybrid model is more easy to interpret by decision-makers when modeling trended series. 2012 Elsevier Ltd. All rights reserved.


A Wide-Range Model for Metal-Oxide Surge Arrester

This paper presents an electric model of a metal-oxide surge arrester (MOSA). The proposed electric model accurately represents the MOSA in a wide range of frequencies and amplitudes. The model was developed and validated based on MOSA electrical behavior in each one of the three operating regions of the zinc-oxide (ZnO) surge arresters, and in a database composed of voltage and current waveforms measured from tests performed in 12 ZnO varistors having different physical dimensions and electrical characteristics—from five different manufacturers. These varistors were subjected to different voltage levels in the low current region, and multilevel amplitude of switching current impulses (30/60 <inline-formula><tex-math notation="LaTeX">$\mu$</tex-math></inline-formula>s), lightning current impulses (8/20 <inline-formula><tex-math notation="LaTeX">$\mu$</tex-math></inline-formula>s), high current impulses (4/10 <inline-formula><tex-math notation="LaTeX">$\mu$</tex-math></inline-formula>s), and fast-front current impulses (1.5/26 <inline-formula><tex-math notation="LaTeX">$\mu$</tex-math></inline-formula>s and 3/6 <inline-formula><tex-math notation="LaTeX">$\mu$</tex-math></inline-formula>s) encompass the three regions of operation and a wide range of frequencies and amplitudes. The results provided by the MOSA wide-range (MWR) model were compared with those obtained in the laboratory. The MWR model has shown good agreement in terms of waveform, peak value, and absorbed energy for the evaluated cases.


Perceptually based brush strokes for nonphotorealistic visualization

An important problem in the area of computer graphics is the visualization of large, complex information spaces. Datasets of this type have grown rapidly in recent years, both in number and in size. Images of the data stored in these collections must support rapid and accurate exploration and analysis. This article presents a method for constructing visualizations that are both effective and aesthetic. Our approach uses techniques from master paintings and human perception to visualize a multidimensional dataset. Individual data elements are drawn with one or more brush strokes that vary their appearance to represent the element's attribute values. The result is a nonphotorealistic visualization of information stored in the dataset. Our research extends existing glyph-based and nonphotorealistic techniques by applying perceptual guidelines to build an effective representation of the underlying data. The nonphotorealistic properties the strokes employ are selected from studies of the history and theory of Impressionist art. We show that these properties are similar to visual features that are detected by the low-level human visual system. This correspondence allows us to manage the strokes to produce perceptually salient visualizations. Psychophysical experiments confirm a strong relationship between the expressive power of our nonphotorealistic properties and previous findings on the use of perceptual color and texture patterns for data display. Results from these studies are used to produce effective nonphotorealistic visualizations. We conclude by applying our techniques to a large, multidimensional weather dataset to demonstrate their viability in a practical, real-world setting.


TEXT MINING : PROMISES AND CHALLENGES

Text mining, also known as knowledge discovery from text, and document information mining, refers to the process of extracting interesting patterns from very large text corpus for the purposes of discovering knowledge. Text mining is an interdisciplinary field involving information retrieval, text understanding, information extraction, clustering, categorization, visualization, database technology, machine learning, and data mining. Regarded by many as the next wave of knowledge discovery, text mining has a very high commercial value. This talk presents a general framework for text mining, consisting of two stages: text refining that transforms unstructured text documents into an intermediate form; and knowledge distill ation that deduces patterns or knowledge from the intermediate form. We then survey the state-of-the-art text mining approaches, products, and applications by aligning them based on the text refining and knowledge distill ation functions as well as the intermediate form that they adopt. In conclusion, we highlight the upcoming challenges of text mining and the opportunities it offers.


Soft-Switching Zeta–Flyback Converter With a Buck–Boost Type of Active Clamp

This paper presents the system analysis, design consideration, and implementation of a soft-switching zeta-flyback converter to achieve zero-voltage switching (ZVS). In the proposed converter, the zeta and flyback topologies are adopted in the output side to achieve the following features: to share the power components in the transformer primary side, to achieve the partial magnetizing flux reset, and to share the output power. The buck-boost type of active clamp is connected in parallel with the primary side of the isolation transformer to recycle the energy stored in the leakage inductor of isolated transformer and to limit the peak voltage stress of switching devices due to the transformer leakage inductor when the main switch is turned off. The active clamp circuit can make the switching devices to turn on at ZVS. Experimental results taken from a laboratory prototype rated at 240 W, input voltage of 150 V, output voltage of 12 V, and switching frequency of 150 kHz are presented to demonstrate the converter performance. Based on the experimental results, the circuit efficiency is about 90.5% at rated output power, and the output voltage variation is about 1%.


Incomplete Multisource Transfer Learning

Transfer learning is generally exploited to adapt well-established source knowledge for learning tasks in weakly labeled or unlabeled target domain. Nowadays, it is common to see multiple sources available for knowledge transfer, each of which, however, may not include complete classes information of the target domain. Naively merging multiple sources together would lead to inferior results due to the large divergence among multiple sources. In this paper, we attempt to utilize incomplete multiple sources for effective knowledge transfer to facilitate the learning task in target domain. To this end, we propose an incomplete multisource transfer learning through two directional knowledge transfer, i.e., cross-domain transfer from each source to target, and cross-source transfer. In particular, in cross-domain direction, we deploy latent low-rank transfer learning guided by iterative structure learning to transfer knowledge from each single source to target domain. This practice reinforces to compensate for any missing data in each source by the complete target data. While in cross-source direction, unsupervised manifold regularizer and effective multisource alignment are explored to jointly compensate for missing data from one portion of source to another. In this way, both marginal and conditional distribution discrepancy in two directions would be mitigated. Experimental results on standard cross-domain benchmarks and synthetic data sets demonstrate the effectiveness of our proposed model in knowledge transfer from incomplete multiple sources.


General Survey on Security Issues on Internet of Things

Internet of Things is the integration of a variety of technologies. The Internet of Things incorporates transparently and impeccably large number of assorted end systems, providing open access to selected data for digital services. Internet of things is a promising research in commerce, industry, and education applications. The abundance of sensors and actuators motivates sensing and actuate devices in communication scenarios thus enabling sharing of information in Internet of Things. Advances in sensor data collection technology and Radio Frequency Identification technology has led large number of smart devices connected to the Internet, continuously transmitting data over time.In the context of security, due to different communication overloads and standards conventional security services are not applicable on Internet of Things as a result of which the technological loopholes leads to the generation of malicious data, devices are compromised and so on. Hence a flexible mechanism can deal with the security threats in the dynamic environment of Internet of Things and continuous researches and new ideas needs to be regulated periodically for various upcoming challenges. This paper basically tries to cover up the security issues and challenges of Internet of Things along with a


Toward Characterizing the Productivity Benefits of Very Large Displays

Larger display surfaces are becoming increasingly available due to multi-monitor capability built into many systems, in addition to the rapid decrease in their costs. However, little is known about the performance benefits of using these larger surfaces compared to traditional single-monitor displays. In addition, it is not clear that current software designs and interaction techniques have been properly tuned for these larger surfaces. A preliminary user study was carried out to provide some initial evidence about the benefits of large versus small display surfaces for complex, multi-application office work. Significant benefits were observed in the use of a prototype, larger display, in addition to significant positive user preference and satisfaction with its use over a small display. In addition, design guidelines for enhancing user interaction across large display surfaces were identified. User productivity could be significantly enhanced in future graphical user interface designs if developed with these findings in mind.


Enhancing Knowledge Graph Completion By Embedding Correlations

Despite their large sizes, modern Knowledge Graphs (KGs) are still highly incomplete. Statistical relational learning methods can detect missing links by "embedding" the nodes and relations into latent feature tensors. Unfortunately, these methods are unable to learn good embeddings if the nodes are not well-connected. Our proposal is to learn embeddings for correlations between subgraphs and add a post-prediction phase to counter the lack of training data. This technique, applied on top of methods like TransE or HolE, can significantly increase the predictions on realistic KGs.


Real-Time Head Orientation from a Monocular Camera Using Deep Neural Network

[1] J. Xiao, S. Baker, I. Matthews, T. Kanade, “Real-Time Combined 2D + 3D Active Appearance Models,” CVPR, pp.535-542, 2004. [2] N. Gourier, D. Hall, J. L. Crowley, “Estimating Face Orientation from Robust Detection of Salient Facial Features”, Proceedings of Pointing 2004, ICPR, International Workshop on Visual Observation of Deictic Gestures, 2004. [3] G. Fanelli, M. Dantone, J. Gall, A. Jssati, L. Van Gool, “Random Forests for Real Time 3D Face Analysis,” IJCV, pp.437-458, 2013. [4] Y. LeCun, R. Bottou, Y. Bengio, P. Haffner, “Gradient-based Learning Applied to Document Recognition,” Proc. IEEE, vol. 86, no. 11, pp.2278-2324, 1998. [5] A. Krizhevsky, I. Sutskever, G. E. Hinton, “ImageNet Classification with Deep Convolutional Neural Networks,” NIPS, pp.1106-1114, 2012. This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (No. 2010-0028680). Proposed Method  Conventional Head Pose Estimation Approaches


Driver head pose estimation using efficient descriptor fusion

A great interest is focused on driver assistance systems using the head pose as an indicator of the visual focus of attention and the mental state. In fact, the head pose estimation is a technique allowing to deduce head orientation relatively to a view of camera and could be performed by model-based or appearance-based approaches. Modelbased approaches use a face geometrical model usually obtained from facial features, whereas appearance-based techniques use the whole face image characterized by a descriptor and generally consider the pose estimation as a classification problem. Appearance-based methods are faster andmore adapted to discrete pose estimation. However, their performance depends strongly on the head descriptor, which should be well chosen in order to reduce the information about identity and lighting contained in the face appearance. In this paper, we propose an appearancebased discrete head pose estimation aiming to determine the driver attention level from monocular visible spectrum images, even if the facial features are not visible. Explicitly, we first propose a novel descriptor resulting from the fusion of four most relevant orientation-based head descriptors, namely the steerable filters, the histogram of oriented gradients (HOG), the Haar features, and an adapted version of speeded up robust feature (SURF) descriptor. Second, in order to derive a compact, relevant, and consistent subset of descriptor’s features, a comparative study is conducted on some well-known feature selection algorithms. Finally, the obtained subset is subject to the classification process, performed by the support vector machine (SVM), to learn head pose variations. As we show in experiments with the public database (Pointing’04) as well as with our real-world sequence, our approach describes the head with a high accuracy and provides robust estimation of the head pose, compared to state-of-the-art methods.


Real time head pose estimation with random regression forests

Fast and reliable algorithms for estimating the head pose are essential for many applications and higher-level face analysis tasks. We address the problem of head pose estimation from depth data, which can be captured using the ever more affordable 3D sensing technologies available today. To achieve robustness, we formulate pose estimation as a regression problem. While detecting specific face parts like the nose is sensitive to occlusions, learning the regression on rather generic surface patches requires enormous amount of training data in order to achieve accurate estimates. We propose to use random regression forests for the task at hand, given their capability to handle large training datasets. Moreover, we synthesize a great amount of annotated training data using a statistical model of the human face. In our experiments, we show that our approach can handle real data presenting large pose changes, partial occlusions, and facial expressions, even though it is trained only on synthetic neutral face data. We have thoroughly evaluated our system on a publicly available database on which we achieve state-of-the-art performance without having to resort to the graphics card.


3D head pose estimation with convolutional neural network trained on synthetic images

In this paper, we propose a method to estimate head pose with convolutional neural network, which is trained on synthetic head images. We formulate head pose estimation as a regression problem. A convolutional neural network is trained to learn head features and solve the regression problem. To provide annotated head poses in the training process, we generate a realistic head pose dataset by rendering techniques, in which we consider the variation of gender, age, race and expression. Our dataset includes 74000 head poses rendered from 37 head models. For each head pose, RGB image and annotated pose parameters are given. We evaluate our method on both synthetic and real data. The experiments show that our method improves the accuracy of head pose estimation.


Multilingual Speech Recognition with a Single End-to-End Model

Training a conventional automatic speech recognition (ASR) system to support multiple languages is challenging because the sub-word unit, lexicon and word inventories are typically language specific. In contrast, sequence-to-sequence models are well suited for multilingual ASR because they encapsulate an acoustic, pronunciation and language model jointly in a single network. In this work we present a single sequence-to-sequence ASR model trained on 9 different Indian languages, which have very little overlap in their scripts. Specifically, we take a union of language-specific grapheme sets and train a grapheme-based sequence-to-sequence model jointly on data from all languages. We find that this model, which is not explicitly given any information about language identity, improves recognition performance by 21% relative compared to analogous sequence-to-sequence models trained on each language individually. By modifying the model to accept a language identifier as an additional input feature, we further improve performance by an additional 7% relative and eliminate confusion between different languages.


The coevolution of cultural groups and ingroup favoritism.

Cultural boundaries have often been the basis for discrimination, nationalism, religious wars, and genocide. Little is known, however, about how cultural groups form or the evolutionary forces behind group affiliation and ingroup favoritism. Hence, we examine these forces experimentally and show that arbitrary symbolic markers, though initially meaningless, evolve to play a key role in cultural group formation and ingroup favoritism because they enable a population of heterogeneous individuals to solve important coordination problems. This process requires that individuals differ in some critical but unobservable way and that their markers be freely and flexibly chosen. If these conditions are met, markers become accurate predictors of behavior. The resulting social environment includes strong incentives to bias interactions toward others with the same marker, and subjects accordingly show strong ingroup favoritism. When markers do not acquire meaning as accurate predictors of behavior, players show a markedly reduced taste for ingroup favoritism. Our results support the prominent evolutionary hypothesis that cultural processes can reshape the selective pressures facing individuals and so favor the evolution of behavioral traits not previously advantaged.


Efficiency-Oriented Design of ZVS Half-Bridge Series Resonant Inverter With Variable Frequency Duty Cycle Control

The efficiency of zero voltage switching half-bridge series resonant inverter can be decreased under certain load conditions due to the high switching frequencies required. The proposed variable frequency duty cycle (VFDC) control is intended to improve the efficiency in the medium and low output power levels because of the decreased switching frequencies. The study performed in this letter includes, in a first step, a theoretical analysis of power balance as a function of control parameters. In addition, restrictions due to snubber capacitors and deadtime, and variability of the loads have been considered. Afterward, an efficiency analysis has been carried out to determine the optimum operation point. Switching and conduction losses have been calculated to examine the overall efficiency improvement. VFDC strategy efficiency improvement is achieved by means of a switching-frequency reduction, mainly at low-medium power range, and with low-quality factor loads. Domestic induction heating application is suitable for the use of VFDC strategy due to its special load characteristics. For this reason, the simulation results have been validated using an induction heating inverter with a specially designed load.


Implementation of RFID on Computer Based Test (RF-CBT) system

The paper presents an improvement of assessment model using RFID (Radio Frequency Identification) technology which implemented on Computer Based Test (CBT). The RFID worked at frequency 13.56 MHz. The RF-CBT system is constructed with User-PC and Server-PC. A RFID reader module (Mifare RC522, Microcontroller ATMEGA328) and LabVIEW program are installed on User-PC. An RFID tag information from User-PC was sent into Server-PC which is installed with MySQL database and PHP. The registered RFID tag on Server-PC could log in the CBT automatically. Our system is proposed not only for auto login to CBT but also for developing a random question and scoring test result on CBT. The system could reduce the opportunity to cheat in test as anyone cannot login to the test except have the authentic RFID tag. This system is feasible to measure students' cognitive abilities at once because it uses multiple choices test type.


Social influence on the use of Clinical Decision Support Systems: Revisiting the Unified Theory of Acceptance and Use of Technology by the fuzzy DEMATEL technique

The aim of study is to examine whether social influence affects medical professionals’ behavioral intention to use while introducing a new Clinical Decision Support System (CDSS). The series of Technology Acceptance Models (TAMs) have been widely applied to examine new technology acceptance by scholars; nevertheless, these models omit system diversity and the user’s profession. On the other hand, causal analysis greatly affects the efficiency of decision-making, and it is usually analyzed by Structural Equation Modeling (SEM); however, the method is often misapplied. This research applies the Decision-Making Trial and Evaluation Laboratory (DEMATEL) technique to explore the causal relationship between the significant Unified Theory of Acceptance and Use of Technology (UTAUT) variables. Fuzzy concept is applied to illustrate human vague judgment. It is significant that, in contrary with UTAUT, this study found that social influence does not matter in the behavioral intention to use the CDSS for medical professionals. 2011 Elsevier Ltd. All rights reserved.


An in-pipe robot with underactuated parallelogram crawler modules

In this paper, we present a new in-pipe robot with independent underactuated parallelogram crawler modules, which can automatically overcome inner obstacles in the pipes. The parallelogram crawler modules are adopted to maintain the anterior-posterior symmetry of forward and backward movements, and a simple differential mechanism based on a pair of spur gears is installed to provide underactuated mechanisms. A central base unit connects each crawler module through foldable pantograph mechanisms. To verify the basic behavior of this robot, primary experiments in pipes with different diameters and at partial steps were conducted.


Evaluating the influence of cultural competence education on students' transcultural self-efficacy perceptions.

Guided by the cultural competence and confidence (CCC) model, the Transcultural Self-Efficacy Tool (TSET) was used to evaluate the influence of cultural competence education on the transcultural self-efficacy (TSE) perceptions of undergraduate nursing students following an integrated approach to cultural competence education. Results continue to support that TSE is influenced by formalized education and other learning experiences. As hypothesized, compared with novice students, advanced students' scores were higher for all subscales in both cross-sectional (n = 147) and longitudinal (n = 36) study designs. Results from analysis of variance and covariance demonstrated that none of the demographic variables predicted change; semester was the sole predictor, lending additional support that (a) the educational interventions throughout the four semesters influenced TSE changes and (b) all students regardless of background benefit (and require) formalized cultural competence education. Implications for nurse educators conclude the article.


Feature extraction approaches based on matrix pattern: MatPCA and MatFLDA

Feature Extraction Approaches Based On Matrix Pattern: MatPCA and MatFLDA Songcan Chen 1* Yulian Zhu 1 Daoqiang Zhang 1 Jing-Yu Yang 2 Dept. of Computer Science and Engineering, Nanjing University of Aeronautics & Astronautics, Nanjing 210016, People’s Republic of China. Dept. of Computer Science, Nanjing University of Science & Technology, Nanjing 210094, People’s Republic of China Abstract Principle component analysis (PCA) and Fisher linear discriminant analysis (FLDA), as two popular feature extraction approaches in Pattern recognition and data analysis, extract so-needed features directly based on vector patterns, i.e., before applying them, any non-vector pattern such as an image is first vectorized into a vector pattern by some technique like concatenation. However, such a vectorization has been proved not to be beneficial for image recognition due to consequences of both the algebraic feature extraction approach and 2DPCA. In this paper, inspired by the above two approaches, we try an opposite direction to extract features for any vector pattern by first matrixizing it into a matrix pattern and then applying the matrixized versions of PCA and FLDA, MatPCA and MatFLDA, to the pattern. MatFLDA uses, in essence, the same principle as the algebraic feature extraction approach and is constructed in terms of similar objective function to FLDA while MatPCA uses a minimization of the reconstructed error for the training samples like PCA to obtain a set of projection vectors, which is somewhat different derivation from 2DPCA despite of equivalence. Finally experiments on 10 publicly obtainable datasets show that both MatPCA and MatFLDA gain performance improvement in different degrees respectively on 7 and 5


Performance analysis and security dependence of on paper digital signature using random and critical content

The content of physical paper documents is a major concern, after the development of modern scanning and printing technologies. The tendency for the document fraud has been growing and the paper-based documents require authenticating the sender identity and ensuring the content integrity. This paper presents a reliable and simple method for authenticating the content of a paper document by implementing an on paper digital signature. This method randomly selects the words at random positions of the document along with critical content and creates on paper digital signature. This method employs an online document verification system and the unauthorized access is denied by the user authentication mechanism. Performance analysis and security dependence on the system is also studied in this paper.


Population-Level Prediction of Type 2 Diabetes From Claims Data and Analysis of Risk Factors.

We present a new approach to population health, in which data-driven predictive models are learned for outcomes such as type 2 diabetes. Our approach enables risk assessment from readily available electronic claims data on large populations, without additional screening cost. Proposed model uncovers early and late-stage risk factors. Using administrative claims, pharmacy records, healthcare utilization, and laboratory results of 4.1 million individuals between 2005 and 2009, an initial set of 42,000 variables were derived that together describe the full health status and history of every individual. Machine learning was then used to methodically enhance predictive variable set and fit models predicting onset of type 2 diabetes in 2009-2011, 2010-2012, and 2011-2013. We compared the enhanced model with a parsimonious model consisting of known diabetes risk factors in a real-world environment, where missing values are common and prevalent. Furthermore, we analyzed novel and known risk factors emerging from the model at different age groups at different stages before the onset. Parsimonious model using 21 classic diabetes risk factors resulted in area under ROC curve (AUC) of 0.75 for diabetes prediction within a 2-year window following the baseline. The enhanced model increased the AUC to 0.80, with about 900 variables selected as predictive (p < 0.0001 for differences between AUCs). Similar improvements were observed for models predicting diabetes onset 1-3 years and 2-4 years after baseline. The enhanced model improved positive predictive value by at least 50% and identified novel surrogate risk factors for type 2 diabetes, such as chronic liver disease (odds ratio [OR] 3.71), high alanine aminotransferase (OR 2.26), esophageal reflux (OR 1.85), and history of acute bronchitis (OR 1.45). Liver risk factors emerge later in the process of diabetes development compared with obesity-related factors such as hypertension and high hemoglobin A1c. In conclusion, population-level risk prediction for type 2 diabetes using readily available administrative data is feasible and has better prediction performance than classical diabetes risk prediction algorithms on very large populations with missing data. The new model enables intervention allocation at national scale quickly and accurately and recovers potentially novel risk factors at different stages before the disease onset.


Deep learning approach for Network Intrusion Detection in Software Defined Networking

Software Defined Networking (SDN) has recently emerged to become one of the promising solutions for the future Internet. With the logical centralization of controllers and a global network overview, SDN brings us a chance to strengthen our network security. However, SDN also brings us a dangerous increase in potential threats. In this paper, we apply a deep learning approach for flow-based anomaly detection in an SDN environment. We build a Deep Neural Network (DNN) model for an intrusion detection system and train the model with the NSL-KDD Dataset. In this work, we just use six basic features (that can be easily obtained in an SDN environment) taken from the forty-one features of NSL-KDD Dataset. Through experiments, we confirm that the deep learning approach shows strong potential to be used for flow-based anomaly detection in SDN environments.


Shot boundary detection from videos using entropy and local descriptor

Video shot segmentation is an important step in key frame selection, video copy detection, video summarization, and video indexing for retrieval. Although some types of video data, e.g., live sports coverage, have abrupt shot boundaries that are easy to identify using simple heuristics, it is much more difficult to identify shot boundaries in other types such as cinematic movies. We propose an algorithm for shot boundary detection able to accurately identify not only abrupt shot boundaries, but also the fade-in and fade-out boundaries typical of cinematic movies. The algorithm is based on analysis of changes in the entropy of the gray scale intensity over consecutive frames and analysis of correspondences between SURF features over consecutive frames. In an experimental evaluation on the TRECVID-2007 shot boundary test set, the algorithm achieves substantial improvements over state of the art methods, with a precision of 97.8% and a recall of 99.3%.


SIGNet: Semantic Instance Aided Unsupervised 3D Geometry Perception

Unsupervised learning for visual perception of 3D geometry is of great interest to autonomous systems. Recent works on unsupervised learning have made considerable progress on geometry perception; however, they perform poorly on dynamic objects and scenarios with dark and noisy environments. In contrast, supervised learning algorithms, which are robust, require large labeled geometric dataset. This paper introduces SIGNet, a novel framework that provides robust geometry perception without requiring geometrically informative labels. Specifically, SIGNet integrates semantic information to make unsupervised robust geometric predictions for dynamic objects in low lighting and noisy environments. SIGNet is shown to improve upon the state-of-the-art unsupervised learning for geometry perception by 30% (in squared relative error for depth prediction). In particular, SIGNet improves the dynamic object class performance by 39% in depth prediction and 29% in flow prediction.


Analysis of hidden units in a layered network trained to classify sonar targets

-A neural network learning procedure has been applied to the classification ~/sonar returns [kom two undersea targets, a metal cylinder and a similarly shaped rock. Networks with an intermediate layer ~/ hidden processing units achieved a classification accuracy as high as 100% on a training set of l04 returns. These net~orks correctly classified up to 90.4% of 104 test returns not contained in the training set. This perfi~rmance was better than that of a nearest neighbor classifier, which was 82.7%. and was close to that of an optimal Bayes classifie~ Specific signal features extracted by hidden units in a trained network were identified and related to coding schemes in the pattern of connection strengths between the input and the hidden units. Network perlbrmance and class[/~cation strategy was comparable to that of trained human listeners. Keywords--Learning algorithms, Hidden units. Multilayered neural network, Sonar, Signal processing.