Gamut Mapping to Preserve Spatial Luminance Variations

A spatial gamut mapping technique is proposed to overcome the shortcomings encountered with standard pointwise gamut mapping algorithms by preserving spatially local luminance variations in the original image. It does so by first processing the image through a standard pointwise gamut mapping algorithm. The difference between the original image luminance Y and gamut mapped image luminance Y’ is calculated. A spatial filter is then applied to this difference signal, and added back to the gamut mapped signal Y’. The filtering operation can result in colors near the gamut boundary being placed outside the gamut, hence a second gamut mapping step is required to move these pixels back into the gamut. Finally, the in-gamut pixels are processed through a color correction function for the output device, and rendered to that device. Psychophysical experiments validate the superior performance of the proposed algorithm, which reduces many of the artifacts arising from standard pointwise techniques.


Intelligent Device-to-Device Communication in the Internet of Things

Analogous to the way humans use the Internet, devices will be the main users in the Internet of Things (IoT) ecosystem. Therefore, device-to-device (D2D) communication is expected to be an intrinsic part of the IoT. Devices will communicate with each other autonomously without any centralized control and collaborate to gather, share, and forward information in a multihop manner. The ability to gather relevant information in real time is key to leveraging the value of the IoT as such information will be transformed into intelligence, which will facilitate the creation of an intelligent environment. Ultimately, the quality of the information gathered depends on how smart the devices are. In addition, these communicating devices will operate with different networking standards, may experience intermittent connectivity with each other, and many of them will be resource constrained. These characteristics open up several networking challenges that traditional routing protocols cannot solve. Consequently, devices will require intelligent routing protocols in order to achieve intelligent D2D communication. We present an overview of how intelligent D2D communication can be achieved in the IoT ecosystem. In particular, we focus on how state-of-the-art routing algorithms can achieve intelligent D2D communication in the IoT.


Social trust and social reciprocity based cooperative D2D communications

Thanks to the convergence of pervasive mobile communications and fast-growing online social networking, mobile social networking is penetrating into our everyday life. Aiming to develop a systematic understanding of the interplay between social structure and mobile communications, in this paper we exploit social ties in human social networks to enhance cooperative device-to-device communications. Specifically, as hand-held devices are carried by human beings, we leverage two key social phenomena, namely social trust and social reciprocity, to promote efficient cooperation among devices. With this insight, we develop a coalitional game theoretic framework to devise social-tie based cooperation strategies for device-to-device communications. We also develop a network assisted relay selection mechanism to implement the coalitional game solution, and show that the mechanism is immune to group deviations, individually rational, and truthful. We evaluate the performance of the mechanism by using real social data traces. Numerical results show that the proposed mechanism can achieve up-to 122% performance gain over the case without D2D cooperation.


Resource allocation for device-to-device communications underlaying LTE-advanced networks

The Long Term Evolution-Advanced (LTEAdvanced) networks are being developed to provide mobile broadband services for the fourth generation (4G) cellular wireless systems. Deviceto- device (D2D) communications is a promising technique to provide wireless peer-to-peer services and enhance spectrum utilization in the LTE-Advanced networks. In D2D communications, the user equipments (UEs) are allowed to directly communicate between each other by reusing the cellular resources rather than using uplink and downlink resources in the cellular mode when communicating via the base station. However, enabling D2D communications in a cellular network poses two major challenges. First, the interference caused to the cellular users by D2D devices could critically affect the performances of the cellular devices. Second, the minimum quality-of-service (QoS) requirements of D2D communications need to be guaranteed. In this article, we introduce a novel resource allocation scheme (i.e. joint resource block scheduling and power control) for D2D communications in LTE-Advanced networks to maximize the spectrum utilization while addressing the above challenges. First, an overview of LTE-Advanced networks, and architecture and signaling support for provisioning of D2D communications in these networks are described. Furthermore, research issues and the current state-of-the-art of D2D communications are discussed. Then, a resource allocation scheme based on a column generation method is proposed for D2D communications. The objective is to maximize the spectrum utilization by finding the minimum transmission length in terms of time slots for D2D links while protecting the cellular users from harmful interference and guaranteeing the QoS of D2D links. The performance of this scheme is evaluated through simulations.


THREE LAYERS APPROACH FOR NETWORK SCANNING DETECTION

Computer networks became one of the most important dimensions in any organization. This importance is due to the connectivity benefits that can be given by networks, such as computing power, data sharing and enhanced performance. However using networks comes with a cost, there are some threats and issues that need to be addressed, such as providing sufficient level of security. One of the most challenging issues in network security is network scanning. Network scanning is considered to be the initial step in any attacking process. Therefore, detecting networks scanning helps to protect networks resources, services, and data before the real attack happens. This paper proposes an approach that consists of three layers to detect Sequential and Random network scanning for both TCP and UDP protocols. The proposed Three Layers Approach aims to increase network scanning detection accuracy. The Three Layers Approach defines some packets to be used as signs of network scanning existence. Before applying the approach in a network, there is a Thresholds Generation Stage to that aims to determine descriptive set of thresholds. After that, the first layer of the approach aggregates sign packets in separated tables. Then the second layer of the approach analyzes these tables in new tables by counting packets generated by each IP. Finally, the last layer makes a decision of whether or not a network is being scanned.


Study of induction heating power supply based on fuzzy controller

In order to satisfy the higher control performance requirement of the Induction Heating Supply, a fuzzy logic control technology for induction heating power supply power control system is researched. This study presents the composition and design of the induction heating control system based on the fuzzy logic controller. In this paper, a complete simulation model of induction heating systems is obtained by using the Matlab /Simulink software, Simulation results show the effectiveness and superiority of the control system.


Kawaii/Cute interactive media

Cuteness in interactive systems is a relatively new development yet has its roots in the aesthetics of many historical and cultural elements. Symbols of cuteness abound in nature as in the creatures of neotenous proportions: drawing in the care and concern of the parent and the care from a protector. We provide an in-depth look at the role of cuteness in interactive systems beginning with a history. We particularly focus on the Japanese culture of Kawaii, which has made large impact around the world, especially in entertainment, fashion, and animation. We then take the approach of defining cuteness in contemporary popular perception. User studies are presented offering an in-depth understanding of key perceptual elements, which are identified as cute. This knowledge provides for the possibility to create a cute filter that can transform inputs and automatically create more cute outputs. This paper also provides an insight into the next generation of interactive systems that bring happiness and comfort to users of all ages and cultures through the soft power of cute.


A unified approach for mining outliers

This paper deals with nding outliers (exceptions) in large datasets. The identiication of outliers can often lead to the discovery of truly unexpected knowledge in areas such as electronic commerce, credit card fraud, and even the analysis of performance statistics of professional athletes. One contribution of this paper is to show how our proposed, intuitive notion of outliers can unify or generalize many of the existing notions of outliers provided by discordancy tests for standard statistical distributions. Thus, when mining large datasets containing many attributes, a uniied approach can replace many statistical discordancy tests, regardless of any knowledge about the underlying distribution of the attributes. A second contribution of this paper is the development of an algorithm to nd all outliers in a dataset. An important advantage of this algorithm is that its time complexity is linear with respect to the number of objects in the dataset. We include preliminary performance results.


An efficient centroid type-reduction strategy for general type-2 fuzzy logic system


Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation

¿Ontology matching¿ is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit upper ontologies as semantic bridges in the ontology matching process and presents a systematic analysis of the relationships among features of matched ontologies (number of simple and composite concepts, stems, concepts at the top level, common English suffixes and prefixes, and ontology depth), matching algorithms, used upper ontologies, and experiment results. This analysis allowed us to state under which circumstances the exploitation of upper ontologies gives significant advantages with respect to traditional approaches that do no use them. We run experiments with SUMO-OWL (a restricted version of SUMO), OpenCyc, and DOLCE. The experiments demonstrate that when our ¿structural matching method via upper ontology¿ uses an upper ontology large enough (OpenCyc, SUMO-OWL), the recall is significantly improved while preserving the precision obtained without upper ontologies. Instead, our ¿nonstructural matching method¿ via OpenCyc and SUMO-OWL improves the precision and maintains the recall. The ¿mixed method¿ that combines the results of structural alignment without using upper ontologies and structural alignment via upper ontologies improves the recall and maintains the F-measure independently of the used upper ontology.


A Wideband Slotted Bow-Tie Antenna With Reconfigurable CPW-to-Slotline Transition for Pattern Diversity

We propose a slotted bow-tie antenna with pattern reconfigurability. The antenna consists of a coplanar waveguide (CPW) input, a pair of reconfigurable CPW-to-slotline transitions, a pair of Vivaldi-shaped radiating tapered slots, and four PIN diodes for reconfigurability. With suitable arrangement of the bias network, the proposed antenna demonstrates reconfigurable radiation patterns in the frequency range from 3.5 to 6.5 GHz in three states: a broadside radiation with fairly omnidirectional pattern and two end-fire radiations whose main beams are directed to exactly opposite directions. The proposed antenna is investigated comprehensively with the help of the radiation patterns in the two principal cuts and also the antenna gain responses versus frequencies. The simulation and measurement results reveal fairly good agreement and hence sustain the reconfigurability of the proposed design.


Analysis of Software Aging in a Web Server

Several recent studies have reported & examined the phenomenon that long-running software systems show an increasing failure rate and/or a progressive degradation of their performance. Causes of this phenomenon, which has been referred to as "software aging", are the accumulation of internal error conditions, and the depletion of operating system resources. A proactive technique called "software rejuvenation" has been proposed as a way to counteract software aging. It involves occasionally terminating the software application, cleaning its internal state and/or its environment, and then restarting it. Due to the costs incurred by software rejuvenation, an important question is when to schedule this action. While periodic rejuvenation at constant time intervals is straightforward to implement, it may not yield the best results. The rate at which software ages is usually not constant, but it depends on the time-varying system workload. Software rejuvenation should therefore be planned & initiated in the face of the actual system behavior. This requires the measurement, analysis, and prediction of system resource usage. In this paper, we study the development of resource usage in a web server while subjecting it to an artificial workload. We first collect data on several system resource usage & activity parameters. Non-parametric statistical methods are then applied toward detecting & estimating trends in the data sets. Finally, we fit time series models to the data collected. Unlike the models used previously in the research on software aging, these time series models allow for seasonal patterns, and we show how the exploitation of the seasonal variation can help in adequately predicting the future resource usage. Based on the models employed here, proactive management techniques like software rejuvenation triggered by actual measurements can be built


A Flexible Fabrication Approach Toward the Shape Engineering of Microscale Soft Pneumatic Actuators

The recent developments of soft robots have inspired a variety of applications that require compliance for safety and softness for biomimetics. With such prevalence and advantages of soft robots, researchers are diverting their interests toward applications like micromanipulation of biological tissue. However, the progress has been thwarted by the difficulty in producing soft robots in miniature scale. In this paper, we present a new kind of microscale soft pneumatic actuators (SPA) made from streamlined and standardized fabrication procedure with customizable bending modalities inspired by shape engineering. Preliminary mathematical models are given to interpret width-based shape engineering for customization and to compare the bending angle and radius of curvature measured from the characterization experiments. The fabricated SPA was tested on the sciatic nerve of a rat in order to show its future potentials in biomedical field. Ultimately, this paper will contribute to the diversification of SPA fabrication and customization, as well as biomedical applications that demand smaller dimensions and higher precision.


Cognitive Wireless Powered Network: Spectrum Sharing Models and Throughput Maximization

The recent advance in radio-frequency (RF) wireless energy transfer (WET) has motivated the study of wireless powered communication network (WPCN) in which distributed wireless devices are powered via dedicated WET by the hybrid access-point (H-AP) in the downlink (DL) for uplink (UL) wireless information transmission (WIT). In this paper, by utilizing the cognitive radio (CR) technique, we study a new type of CR enabled secondary WPCN, called cognitive WPCN, under spectrum sharing with the primary wireless communication system. In particular, we consider a cognitive WPCN, consisting of one single H-AP with constant power supply and distributed wireless powered users, shares the same spectrum for its DL WET and UL WIT with an existing primary communication link, where the WPCN's WET/WIT and the primary link's WIT may interfere with each other. Under this new setup, we propose two coexisting models for spectrum sharing of the two systems, namely underlay and overlay-based cognitive WPCNs, depending on different types of knowledge on the primary user transmission available for the cognitive WPCN. For each model, we maximize the sum-throughput of the cognitive WPCN by optimizing its transmission under different constraints applied to protect the primary user transmission. Analysis and simulation results are provided to compare the sum-throughput of the cognitive WPCN versus the achievable rate of the primary user under two proposed coexisting models. It is shown that the overlay based cognitive WPCN outperforms the underlay based counterpart, thanks to its fully co-operative WET/WIT design with the primary WIT, while also requiring higher complexity for implementation.


Accounting Restatements and External Financing Choices

There is little research on how accounting information quality affects a firm’s external financing choices. In this paper, we use the occurrence of accounting restatements as a proxy for the reduced credibility of accounting information and investigate how restatements affect a firm’s external financing choices. We find that for firms that obtain external financing after restatements, they rely more on debt financing, especially private debt financing, and less on equity financing. The increase in debt financing is more pronounced for firms with more severe information problems and less pronounced for firms with prompt CEO/CFO turnover and auditor dismissal. Our evidence indicates that accounting information quality affects capital providers’ resource allocation and that debt holders help alleviate information problems after accounting restatements.


Integrating Perception and Planning for Autonomous Navigation of Urban Vehicles

The paper addresses the problem of autonomous navigation of a car-like robot evolving in an urban environment. Such an environment exhibits an heterogeneous geometry and is cluttered with moving obstacles. Furthermore, in this context, motion safety is a critical issue. The proposed approach to the problem lies in the coupling of two crucial robotic capabilities, namely perception and planning. The main contributions of this work are the development and integration of these modules into one single application, considering explicitly the constraints related to the environment and the system


The international personality item pool and the future of public-domain personality measures

Seven experts on personality measurement here discuss the viability of public-domain personality measures, focusing on the International Personality Item Pool (IPIP) as a prototype. Since its inception in 1996, the use of items and scales from the IPIP has increased dramatically. Items from the IPIP have been translated from English into more than 25 other languages. Currently over 80 publications using IPIP scales are listed at the IPIP Web site (http://ipip.ori.org), and the rate of IPIPrelated publications has been increasing rapidly. The growing popularity of the IPIP can be attributed to Wve factors: (1) It is cost free; (2) its items can be obtained instantaneously via the Internet; (3) it includes over 2000 items, all easily available for inspection; (4) scoring keys for IPIP scales are This article represents a synthesis of contributions to the presidential symposium, The International Personality Item Pool and the Future of Public-Domain Personality Measures (L.R. Goldberg, Chair) at the sixth annual meeting of the Association for Research in Personality, New Orleans, January 20, 2005. Authorship order is based on the order of participation in the symposium. The IPIP project has been continually supported by Grant MH049227 from the National Institute of Mental Health, U.S. Public Health Service. J.A. Johnson’s research was supported by the DuBois Educational Foundation. The authors thank Paul T. Costa Jr., Samuel D. Gosling, Leonard G. Rorer, Richard Reed, and Krista Trobst for their helpful suggestions. * Corresponding author. Fax: +1 814 375 4784. E-mail address: j5j@psu.edu (J.A. Johnson). 0092-6566/$ see front matter  2005 Elsevier Inc. All rights reserved. doi:10.1016/j.jrp.2005.08.007 L.R. Goldberg et al. / Journal of Research in Personality 40 (2006) 84–96 85 provided; and (5) its items can be presented in any order, interspersed with other items, reworded, translated into other languages, and administered on the World Wide Web without asking permission of anyone. The unrestricted availability of the IPIP raises concerns about possible misuse by unqualiWed persons, and the freedom of researchers to use the IPIP in idiosyncratic ways raises the possibility of fragmentation rather than scientiWc uniWcation in personality research.  2005 Elsevier Inc. All rights reserved.


A CCPP algorithm based on the standard map for the mobile robot

This paper introduces a new integrated algorithm to achieve the complete coverage path planning (CCPP) task for the mobile robot in a given obstacles-included terrain. The algorithm combines the cellular decomposition approach and the chaotic Standard map together to design the coverage procedure. The cellular decomposition approach decompose the target region into several rectangular feasible sub-regions. Then the chaotic Standard map in the full mapping state produces the complete coverage trajectories inside the feasible sub-regions, and the connection trajectories between two adjacent feasible sub-regions. Compared with the general cellular decomposition method, the proposed integrated algorithm needs no designated start point and goal point to link two adjacent sub-regions. The planned trajectories demonstrate a good distribution characteristics with regard to completeness and evenness. No obstacles-avoidance method and boundaries detection are needed in the coverage procedure.


Probabilistic slope stability analysis by finite elements

The paper investigates the probability of failure of a cohesive slope using both simple and more advanced probabilistic analysis tools. The influence of local averaging on the probability of failure of a test problem is thoroughly investigated. In the simple approach, classical slope stability analysis techniques are used, and the shear strength is treated as a single random variable. The advanced method, called the random finite element method (RFEM), uses elastoplasticity combined with random field theory. The RFEM method is shown to offer many advantages over traditional probabilistic slope stability techniques, because it enables slope failure to develop naturally by “seeking out” the most critical mechanism. Of particular importance in this work, is the conclusion that simplified probabilistic analysis, in which spatial variability is ignored by assuming perfect correlation, can lead to unconservative estimates of the probability of failure. This contradicts the findings of other investigators using classical slope stability analysis tools.


New low-voltage class AB/AB CMOS op amp with rail-to-rail input/output swing

A new low-voltage CMOS Class AB/AB fully differential opamp with rail-to-rail input/output swing and supply voltage lower than two V/sub GS/ drops is presented. The scheme is based on combining floating-gate transistors and Class AB input and output stages. The op amp is characterized by low static power consumption and enhanced slew-rate. Moreover the proposed opamp does not suffer from typical reliability problems related to initial charge trapped in the floating-gate devices. Simulation and experimental results in 0.5-/spl mu/m CMOS technology verify the scheme operating with /spl plusmn/0.9-V supplies and close to rail-to-rail input and output swing.


Ultrafast photonic reinforcement learning based on laser chaos

Reinforcement learning involves decision making in dynamic and uncertain environments and constitutes an important element of artificial intelligence (AI). In this work, we experimentally demonstrate that the ultrafast chaotic oscillatory dynamics of lasers efficiently solve the multi-armed bandit problem (MAB), which requires decision making concerning a class of difficult trade-offs called the exploration–exploitation dilemma. To solve the MAB, a certain degree of randomness is required for exploration purposes. However, pseudorandom numbers generated using conventional electronic circuitry encounter severe limitations in terms of their data rate and the quality of randomness due to their algorithmic foundations. We generate laser chaos signals using a semiconductor laser sampled at a maximum rate of 100 GSample/s, and combine it with a simple decision-making principle called tug of war with a variable threshold, to ensure ultrafast, adaptive, and accurate decision making at a maximum adaptation speed of 1 GHz. We found that decision-making performance was maximized with an optimal sampling interval, and we highlight the exact coincidence between the negative autocorrelation inherent in laser chaos and decision-making performance. This study paves the way for a new realm of ultrafast photonics in the age of AI, where the ultrahigh bandwidth of light wave can provide new value.


A generalized maximum entropy approach to bregman co-clustering and matrix approximation

Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an information-theoretic co-clustering approach applicable to empirical joint probability distributions was proposed. In many situations, co-clustering of more general matrices is desired. In this paper, we present a substantially generalized co-clustering framework wherein any Bregman divergence can be used in the objective function, and various conditional expectation based constraints can be considered based on the statistics that need to be preserved. Analysis of the co-clustering problem leads to the minimum Bregman information principle, which generalizes the maximum entropy principle, and yields an elegant meta algorithm that is guaranteed to achieve local optimality. Our methodology yields new algorithms and also encompasses several previously known clustering and co-clustering algorithms based on alternate minimization.


Adolescent coping style and behaviors: conceptualization and measurement.

The developmental tasks associated with adolescence pose a unique set of stressors and strains. Included in the normative tasks of adolescence are developing and identity, differentiating from the family while still staying connected, and fitting into a peer group. The adolescent's adaptation to these and other, often competing demands is achieved through the process of coping which involves cognitive and behavioral strategies directed at eliminating or reducing demands, redefining demands so as to make them more manageable, increasing resources for dealing with demands, and/or managing the tension which is felt as a result of experiencing demands. In this paper, individual copying theory and family stress theory are reviewed to provide a theoretical foundation for assessing adolescent coping. In addition, the development and testing of an adolescent self-report coping inventory, Adolescent Coping Orientation for Problem Experiences (A-COPE) is presented. Gender differences in coping style are presented and discussed. These coping patterns were validated against criterion indices of adolescents' use of cigarettes, liquor, and marijuana using data from a longitudinal study of 505 families with adolescents. The findings are discussed in terms of coping theory and measurement and in terms of adolescent development and substance use.


VisTA: Visual Terminology Alignment Tool for Factual Knowledge Aggregation

The alignment of terminologies can be considered as a kind of “translation” between two or more terminologies that aims to enhance the communication among people coming from different domains or expertise. In this paper we introduce the Visual Terminology Alignment tool (VisTA) that enables the exact alignment for RDF/SKOS-like terminologies, suitable for integrating knowledge bases, rather than information retrieval systems. The tool provides a simple and friendly web-based user interface for the alignment between two terminologies, while it visualizes the terminology hierarchies, enables the interactive alignment process, and presents the alignment result. The latter is a native RDF/SKOS graph that interconnects the two terminology graphs, supporting interoperability and extending the search capabilities over the integrated semantic graph, using the broader and exact match properties.


Evaluating State-of-the-Art Object Detector on Challenging Traffic Light Data

Traffic light detection (TLD) is a vital part of both intelligent vehicles and driving assistance systems (DAS). General for most TLDs is that they are evaluated on small and private datasets making it hard to determine the exact performance of a given method. In this paper we apply the state-of-the-art, real-time object detection system You Only Look Once, (YOLO) on the public LISA Traffic Light dataset available through the VIVA-challenge, which contain a high number of annotated traffic lights, captured in varying light and weather conditions.,,,,,,The YOLO object detector achieves an AUC of impressively 90.49% for daysequence1, which is an improvement of 50.32% compared to the latest ACF entry in the VIVAchallenge. Using the exact same training configuration as the ACF detector, the YOLO detector reaches an AUC of 58.3%, which is in an increase of 18.13%.


A Variational Observation Model of 3 D Object for Probabilistic Semantic SLAM

We present a Bayesian object observation model for complete probabilistic semantic SLAM. Recent studies on object detection and feature extraction have become important for scene understanding and 3D mapping. However, 3D shape of the object is too complex to formulate the probabilistic observation model; therefore, performing the Bayesian inference of the object-oriented features as well as their pose is less considered. Besides, when the robot equipped with an RGB mono camera only observes the projected single view of an object, a significant amount of the 3D shape information is abandoned. Due to these limitations, semantic SLAM and viewpoint-independent loop closure using volumetric 3D object shape is challenging. In order to enable the complete formulation of probabilistic semantic SLAM, we approximate the observation model of a 3D object with a tractable distribution. We also estimate the variational likelihood from the 2D image of the object to exploit its observed single view. In order to evaluate the proposed method, we perform pose and feature estimation, and demonstrate that the automatic loop closure works seamlessly without additional loop detector in various environments.


The level and nature of autistic intelligence.

Autistics are presumed to be characterized by cognitive impairment, and their cognitive strengths (e.g., in Block Design performance) are frequently interpreted as low-level by-products of high-level deficits, not as direct manifestations of intelligence. Recent attempts to identify the neuroanatomical and neurofunctional signature of autism have been positioned on this universal, but untested, assumption. We therefore assessed a broad sample of 38 autistic children on the preeminent test of fluid intelligence, Raven's Progressive Matrices. Their scores were, on average, 30 percentile points, and in some cases more than 70 percentile points, higher than their scores on the Wechsler scales of intelligence. Typically developing control children showed no such discrepancy, and a similar contrast was observed when a sample of autistic adults was compared with a sample of nonautistic adults. We conclude that intelligence has been underestimated in autistics.


A theory of biological pattern formation

One of the elementary processes in morphogenesis is the formation of a spatial pattern of tissue structures, starting from almost homogeneous tissue. It will be shown that relatively simple molecular mechanisms based on auto- and cross catalysis can account for a primary pattern of morphogens to determine pattern formation of the tissue. The theory is based on short range activation, long range inhibition, and a distinction between activator and inhibitor concentrations on one hand, and the densities of their sources on the other. While source density is expected to change slowly, e.g. as an effect of cell differentiation, the concentration of activators and inhibitors can change rapidly to establish the primary pattern; this results from auto- and cross catalytic effects on the sources, spreading by diffusion or other mechanisms, and degradation. Employing an approximative equation, a criterium is derived for models, which lead to a striking pattern, starting from an even distribution of morphogens, and assuming a shallow source gradient. The polarity of the pattern depends on the direction of the source gradient, but can be rather independent of other features of source distribution. Models are proposed which explain size regulation (constant proportion of the parts of the pattern irrespective of total size). Depending on the choice of constants, aperiodic patterns, implying a one-to-one correlation between morphogen concentration and position in the tissue, or nearly periodic patterns can be obtained. The theory can be applied not only to multicellular tissues, but also to intracellular differentiation, e.g. of polar cells. The theory permits various molecular interpretations. One of the simplest models involves bimolecular activation and monomolecular inhibition. Source gradients may be substituted by, or added to, sink gradients, e.g. of degrading enzymes. Inhibitors can be substituted by substances required for, and depleted by activation. Sources may be either synthesizing systems or particulate structures releasing activators and inhibitors. Calculations by computer are presented to exemplify the main features of the theory proposed. The theory is applied to quantitative data on hydra — a suitable one-dimensional model for pattern formation — and is shown to account for activation and inhibition of secondary head formation.


Topological Value Iteration Algorithm for Markov Decision Processes

Value Iteration is an inefficient algorithm for Markov decision processes (MDPs) because it puts the majority of its effort into backing up the entire state space, which turns out to be unnecessary in many cases. In order to overcome this problem, many approaches have been proposed. Among them, LAO*, LRTDP and HDP are state-of-theart ones. All of these use reachability analysis and heuristics to avoid some unnecessary backups. However, none of these approaches fully exploit the graphical features of the MDPs or use these features to yield the best backup sequence of the state space. We introduce an algorithm named Topological Value Iteration (TVI) that can circumvent the problem of unnecessary backups by detecting the structure of MDPs and backing up states based on topological sequences. We prove that the backup sequence TVI applies is optimal. Our experimental results show that TVI outperforms VI, LAO*, LRTDP and HDP on our benchmark MDPs.


On the segmentation of 3D LIDAR point clouds

This paper presents a set of segmentation methods for various types of 3D point clouds. Segmentation of dense 3D data (e.g. Riegl scans) is optimised via a simple yet efficient voxelisation of the space. Prior ground extraction is empirically shown to significantly improve segmentation performance. Segmentation of sparse 3D data (e.g. Velodyne scans) is addressed using ground models of non-constant resolution either providing a continuous probabilistic surface or a terrain mesh built from the structure of a range image, both representations providing close to real-time performance. All the algorithms are tested on several hand labeled data sets using two novel metrics for segmentation evaluation.


Efficient Graph-Based Image Segmentation

This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.


Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes

We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin-image representation. The spin-image is a data level shape descriptor that is used to match surfaces represented as surface meshes. We present a compression scheme for spin-images that results in efficient multiple object recognition which we verify with results showing the simultaneous recognition of multiple objects from a library of 20 models. Furthermore, we demonstrate the robust performance of recognition in the presence of clutter and occlusion through analysis of recognition trials on 100 scenes. This research was performed at Carnegie Mellon University and was supported by the US Department of Energy under contract DE-AC21-92MC29104. 1


A Method for Registration of 3-D Shapes

Tianhe Yang Summary of " A Method for Registration of 3-D Shapes "


Underwater Vehicle Obstacle Avoidance and Path Planning Using a MultiBeam Forward Looking Sonar

This paper describes a new framework for segmentation of sonar images, tracking of underwater objects and motion estimation. This framework is applied to the design of an obstacle avoidance and path planning system for underwater vehicles based on a multi-beam forward looking sonar sensor. The real-time data flow (acoustic images) at the input of the system is first segmented and relevant features are extracted. We also take advantage of the real-time data stream to track the obstacles in following frames to obtain their dynamic characteristics. This allows us to optimize the preprocessing phases in segmenting only the relevant part of the images. Once the static (size and shape) as well as dynamic characteristics (velocity, acceleration, ...) of the obstacles have been computed, we create a representation of the vehicle’s workspace based on these features. This representation uses constructive solid geometry(CSG) to create a convex set of obstacles defining the workspace. The tracking takes also into account obstacles which are no longer in the field of view of the sonar in the path planning phase. A well-proven nonlinear search (sequential quadratic programming) is then employed, where obstacles are expressed as constraints in the search space. This approach is less affected by local minima than classical methods using potential fields. The proposed system is not only capable of obstacle avoidance but also of path planning in complex environments which include fast moving obstacles. Results obtained on real sonar data are shown and discussed. Possible applications to sonar servoing and real-time motion estimation are also discussed.


Finding the shortest paths by node combination

By repeatedly combining the source node's nearest neighbor, we propose a node combination (NC) method to implement the Dijkstra's algorithm. The NC algorithm finds the shortest paths with three simple iterative steps: find the nearest neighbor of the source node, combine that node with the source node, and modify the weights on edges that connect to the nearest neighbor. The NC algorithm is more comprehensible and convenient for programming as there is no need to maintain a set with the nodes' distances. Experimental evaluations on various networks reveal that the NC algorithm is as efficient as Dijkstra's algorithm. As the whole process of the NC algorithm can be implemented with vectors, we also show how to find the shortest paths on a weight matrix. } is the set of nodes, E = {e ij j if there is a link from v i to v j } is the set of edges and W = {w ij j 1 6 i, j 6 N} is the weight matrix for E. Given two nodes v s , v t of G, the shortest path problem can be defined as how to find a path with the minimum sum of the weights on the edges in a v s , v t-path. Generally, v s and v t are called source node and sink node, respectively. The shortest path problem is one of the most fundamental network optimization problems with widespread applications [1–4]. Among the various shortest path algorithms developed [5–12], Dijkstra's algorithm is probably the most well-known. It maintains a set S of solved nodes, comprising those nodes whose final shortest path distance from the source v s has determined, and labels d(i), storing the upper bound of the shortest path distance from v s to v i. The algorithm repeatedly selects the node v k 2 VnS with the minimum d(i), adds v k to S, and updates d(i) for nodes that are incident to v k Step 1. Select a node v k from Q such that dðv k Þ ¼ min v j 2Q dðv j Þ, if d(v k) = 1, stop, otherwise go to Step 2. Step 3. for every v j 2 Q, update d(v j) = min{d(v j), d(v k) + w kj }. Go to Step 1. In practice, Dijkstra's algorithm relies heavily on the strategies used to select the next minimum labeled …


User friendly SLAM initialization

The development of new Simultaneous Localization and Mapping (SLAM) techniques is quickly advancing in research communities and rapidly transitioning into commercial products. Creating accurate and high-quality SLAM maps relies on a robust initialization process. However, the robustness and usability of SLAM initialization for end-users has often been disregarded. This paper presents and evaluates a novel tracking system for 6DOF pose tracking between a single keyframe and the current camera frame, without any prior scene knowledge. Our system is particularly suitable for SLAM initialization, since it allows 6DOF pose tracking in the intermediate frames before a wide-enough baseline between two keyframes has formed. We investigate how our tracking system can be used to interactively guide users in performing an optimal motion for SLAM initialization. However, our findings from a pilot study indicate that the need for such motion can be completely hidden from the user and outsourced to our tracking system. Results from a second user study show that letting our tracking system create a SLAM map as soon as possible is a viable and usable solution. Our work provides important insight for SLAM systems, showing how our novel tracking system can be integrated with a user interface to support fast, robust and user-friendly SLAM initialization.


Online Dictionary Learning on Symmetric Positive Definite Manifolds with Vision Applications

Symmetric Positive Definite (SPD) matrices in the form of region covariances are considered rich descriptors for images and videos. Recent studies suggest that exploiting the Riemannian geometry of the SPD manifolds could lead to improved performances for vision applications. For tasks involving processing large-scale and dynamic data in computer vision, the underlying model is required to progressively and efficiently adapt itself to the new and unseen observations. Motivated by these requirements, this paper studies the problem of online dictionary learning on the SPD manifolds. We make use of the Stein divergence to recast the problem of online dictionary learning on the manifolds to a problem in Reproducing Kernel Hilbert Spaces, for which, we develop efficient algorithms by taking into account the geometric structure of the SPD manifolds. To our best knowledge, our work is the first study that provides a solution for online dictionary learning on the SPD manifolds. Empirical results on both large-scale image classification task and dynamic video processing tasks validate the superior performance of our approach as compared to several state-of-the-art algorithms.


Web Content Analysis: Expanding the Paradigm

Are established methods of content analysis (CA) adequate to analyze web content, or should new methods be devised to address new technological developments? This chapter addresses this question by contrasting narrow and broad interpretations of the concept of web content analysis. The utility of a broad interpretation that subsumes the narrow one is then illustrated with reference to research on weblogs (blogs), a popular web format in which features of HTML documents and interactive computer-mediated communication converge. The chapter concludes by proposing an expanded Web Content Analysis (WebCA) paradigm in which insights from paradigms such as discourse analysis and social network analysis are operationalized and implemented within a general content analytic framework.


ZoomNet: Deep Aggregation Learning for High-Performance Small Pedestrian Detection

It remains very challenging for a single deep model to detect pedestrians of different sizes appears in an image. One typical remedy for the small pedestrian detection is to upsample the input and pass it to the network multiple times. Unfortunately this strategy not only exponentially increases the computational cost but also probably impairs the model effectiveness. In this work, we present a deep architecture, refereed to as ZoomNet, which performs small pedestrian detection by deep aggregation learning without up-sampling the input. ZoomNet learns and aggregates deep feature representations at multiple levels and retains the spatial information of the pedestrian from different scales. ZoomNet also learns to cultivate the feature representations from the classification task to the detection task and obtains further performance improvements. Extensive experimental results demonstrate the state-of-the-art performance of ZoomNet. The source code of this work will be made public available to facilitate further studies on this problem.


On Oblique Random Forests

Abstract. In his original paper on random forests, Breiman proposed two different decision tree ensembles: one generated from “orthogonal” trees with thresholds on individual features in every split, and one from “oblique” trees separating the feature space by randomly oriented hyperplanes. In spite of a rising interest in the random forest framework, however, ensembles built from orthogonal trees (RF) have gained most, if not all, attention so far. In the present work we propose to employ “oblique” random forests (oRF) built from multivariate trees which explicitly learn optimal split directions at internal nodes using linear discriminative models, rather than using random coefficients as the original oRF. This oRF outperforms RF, as well as other classifiers, on nearly all data sets but those with discrete factorial features. Learned node models perform distinctively better than random splits. An oRF feature importance score shows to be preferable over standard RF feature importance scores such as Gini or permutation importance. The topology of the oRF decision space appears to be smoother and better adapted to the data, resulting in improved generalization performance. Overall, the oRF propose here may be preferred over standard RF on most learning tasks involving numerical and spectral data.


The ATILF-LLF System for Parseme Shared Task: a Transition-based Verbal Multiword Expression Tagger

We describe the ATILF-LLF system built for the MWE 2017 Shared Task on automatic identification of verbal multiword expressions. We participated in the closed track only, for all the 18 available languages. Our system is a robust greedy transition-based system, in which MWE are identified through a MERGE transition. The system was meant to accommodate the variety of linguistic resources provided for each language, in terms of accompanying morphological and syntactic information. Using per-MWE Fscore, the system was ranked first1 for all but two languages (Hungarian and Romanian).


Indistinguishability of Random Systems

An (X ,Y)-random system takes inputs X1, X2, . . . ∈ X and generates, for each new input Xi, an output Yi ∈ Y, depending probabilistically on X1, . . . , Xi and Y1, . . . , Yi−1. Many cryptographic systems like block ciphers, MAC-schemes, pseudo-random functions, etc., can be modeled as random systems, where in fact Yi often depends only on Xi, i.e., the system is stateless. The security proof of such a system (e.g. a block cipher) amounts to showing that it is indistinguishable from a certain perfect system (e.g. a random permutation). We propose a general framework for proving the indistinguishability of two random systems, based on the concept of the equivalence of two systems, conditioned on certain events. This abstraction demonstrates the common denominator among many security proofs in the literature, allows to unify, simplify, generalize, and in some cases strengthen them, and opens the door to proving new indistinguishability results. We also propose the previously implicit concept of quasi-randomness and give an efficient construction of a quasi-random function which can be used as a building block in cryptographic systems based on pseudorandom functions.


CEC : Research in visualization techniques for field construction

Field construction can be planned, monitored, and controlled at two distinct levels: 1) the activity or schedule level; and 2) the operation or process level. Graphical 3D visualization can serve as an effective communication method at both levels. Several research efforts in visualizing construction are rooted in scheduling. They typically involve linking activity-based construction schedules and 3D CAD models of facilities to describe discretely-evolving construction “product” visualizations (often referred to as 4D CAD). The focus is on communicating what component(s) are built where and when, with the intention of studying the optimal activity sequence, spatial, and temporal interferences, etc. The construction processes or operations actually involved in building the components are usually implied. A second approach in visualizing construction is rooted in discrete-event simulation that, in addition to visualizing evolving construction products, also concerns the visualization of the operations and processes that are performed in building them. In addition to what is built where and when, the approach communicates who builds it and how by depicting the interaction between involved machines, resources, and materials. This paper introduces the two approaches, and describes the differences in concept, form, and content between activity level and operations level construction visualization. An example of a structural steel framing operation is presented to elucidate the comparison. This work was originally published in the proceedings of the 2002 IEEE Winter Simulation Conference (Kamat and Martinez 2002). This paper expands on the original work, by describing recent advances in both activity and operations level construction visualization.


Brain—Computer Interface

Human-computer interfaces (HCIs) have become ubiquitous. Interfaces such as keyboards and mouses are used daily while interacting with computing devices (Ebrahimi et al., 2003). There is a developing need, however, for HCIs that can be used in situations where these typical interfaces are not viable. Direct brain-computer interfaces (BCI) is a developing field that has been adding this new dimension of functionality to HCI. BCI has created a novel communication channel, especially for those users who are unable to generate necessary muscular movements to use typical HCI devices.


Human Performance Issues and User Interface Design for Teleoperated Robots

In the future, it will become more common for humans to team up with robotic systems to perform tasks that humans cannot realistically accomplish alone. Even for autonomous and semiautonomous systems, teleoperation will be an important default mode. However, teleoperation can be a challenging task because the operator is remotely located. As a result, the operator's situation awareness of the remote environment can be compromised and the mission effectiveness can suffer. This paper presents a detailed examination of more than 150 papers covering human performance issues and suggested mitigation solutions. The paper summarizes the performance decrements caused by video images bandwidth, time lags, frame rates, lack of proprioception, frame of reference, two-dimensional views, attention switches, and motion effects. Suggested solutions and their limitations include stereoscopic displays, synthetic overlay, multimodal interfaces, and various predicative and decision support systems.


Study on advantages and disadvantages of Cloud Computing – the advantages of Telemetry Applications in the Cloud

As companies of all shapes and sizes begin to adapt to cloud computing, this new technology is evolving like never before. Industry experts believe that this trend will only continue to grow and develop even further in the coming few years. While Cloud computing is undoubtedly beneficial for mid-size to large companies, it is not without its downsides, especially for smaller businesses. In this paper we are presenting a list of advantages and disadvantages of Cloud computing technology, with a view to helping enterprises fully understand and adopt the concept of Cloud computing. Also, in the last chapter we are presenting a cloud application for telemetry with a focus on monitoring hydro-energy, in order to demonstrate the advantages that cloud technology can have for this domain. We consider that the way to make cloud vastly benefit all types of businesses is to know very well it's ups and downs and adapt to them accordingly. Key-Words: Cloud Computing, Grid Computing, telemetry, architecture, advantages, disadvantages.


Finding a Needle in Haystack: Facebook's Photo Storage

Facebook needed an architecture to address the need of storing metadata to find photos on storage machines efficiently in memory. They realized that storing a single photo in a single file would prevent them from achieving this goal; thus, they chose to store multiple photos in a single file, reducing the metadata overhead and making it more possible to store the metadata in memory. They ultimately came up with an architecture that consists of a Haystack Store (the persistent storage), Haystack Directory (used to locate photos and manage storage), and Haystack Cache (used to provide quick access to photos not found in the CDN but generating a large number of requests from users). Their architecture allowed them to choose whether to use a CDN or not, but in either case, the Cache was used to address the issue of the “long tail” problem, where less popular photos still generate requests, and does so by having any request from the user directly be stored in the Cache or by having photos fetched from a write-enabled machine to be stored in the Cache. Haystack addressed the potential of failures wiping inmemory data structures by storing these structures in index files. These index files are updated asynchronously of writes preventing performance decrease. To efficiently handle modifications, Haystack chose to append modified files to the end of the file as well as record file to delete the old version of the file. The old version of the file, along with any files marked deleted through delete requests are deleted through an operation called compaction, which takes files not marked deleted or only new versions of modified file and stores it in a new file on disk. This way, deletes and modifications are handled asynchronously of writes and thus is efficient.


Similarity Preserving Snippet-Based Visualization of Web Search Results

Internet users are very familiar with the results of a search query displayed as a ranked list of snippets. Each textual snippet shows a content summary of the referred document (or webpage) and a link to it. This display has many advantages, for example, it affords easy navigation and is straightforward to interpret. Nonetheless, any user of search engines could possibly report some experience of disappointment with this metaphor. Indeed, it has limitations in particular situations, as it fails to provide an overview of the document collection retrieved. Moreover, depending on the nature of the query for example, it may be too general, or ambiguous, or ill expressed the desired information may be poorly ranked, or results may contemplate varied topics. Several search tasks would be easier if users were shown an overview of the returned documents, organized so as to reflect how related they are, content wise. We propose a visualization technique to display the results of web queries aimed at overcoming such limitations. It combines the neighborhood preservation capability of multidimensional projections with the familiar snippet-based representation by employing a multidimensional projection to derive two-dimensional layouts of the query search results that preserve text similarity relations, or neighborhoods. Similarity is computed by applying the cosine similarity over a "bag-of-wordsâ' vector representation of collection built from the snippets. If the snippets are displayed directly according to the derived layout, they will overlap considerably, producing a poor visualization. We overcome this problem by defining an energy functional that considers both the overlapping among snippets and the preservation of the neighborhood structure as given in the projected layout. Minimizing this energy functional provides a neighborhood preserving two-dimensional arrangement of the textual snippets with minimum overlap. The resulting visualization conveys both a global view of the query results and visual groupings that reflect related results, as illustrated in several examples shown.


The Tale of e-Government: A Review of the Stories that Have Been Told So Far and What is Yet to Come

Since its first appearance, the concept of eGovernment has evolved into a recognized means that has helped the public sector to increase its efficiency and effectiveness. A lot of research has therefore been done in this area to elaborate on the different aspects encompassing this concept. However, when looking at the existing e-Government literature, research mostly focuses on one specific aspect of e-Government and there are few generic publications that provide an overview of the diversity of this interdisciplinary research field over a longer term period. This study analyzes the abstracts of eight e-Government journals from 2000 to 2016 by means of a quantitative text mining analysis, backed by a qualitative Delphi approach. The article concludes with a discussion on the findings and implications as well as directions for future research.


Public health implications of altered puberty timing.

Changes in puberty timing have implications for the treatment of individual children, for the risk of later adult disease, and for chemical testing and risk assessment for the population. Children with early puberty are at a risk for accelerated skeletal maturation and short adult height, early sexual debut, potential sexual abuse, and psychosocial difficulties. Altered puberty timing is also of concern for the development of reproductive tract cancers later in life. For example, an early age of menarche is a risk factor for breast cancer. A low age at male puberty is associated with an increased risk for testicular cancer according to several, but not all, epidemiologic studies. Girls and, possibly, boys who exhibit premature adrenarche are at a higher risk for developing features of metabolic syndrome, including obesity, type 2 diabetes, and cardiovascular disease later in adulthood. Altered timing of puberty also has implications for behavioral disorders. For example, an early maturation is associated with a greater incidence of conduct and behavior disorders during adolescence. Finally, altered puberty timing is considered an adverse effect in reproductive toxicity risk assessment for chemicals. Recent US legislation has mandated improved chemical testing approaches for protecting children's health and screening for endocrine-disrupting agents, which has led to changes in the US Environmental Protection Agency's risk assessment and toxicity testing guidelines to include puberty-related assessments and to the validation of pubertal male and female rat assays for endocrine screening.


Effect of written emotional expression on immune function in patients with human immunodeficiency virus infection: a randomized trial.

OBJECTIVES
To determine whether writing about emotional topics compared with writing about neutral topics could affect CD4+ lymphocyte count and human immunodeficiency virus (HIV) viral load among HIV-infected patients.

METHODS
Thirty-seven HIV-infected patients were randomly allocated to 2 writing conditions focusing on emotional or control topics. Participants wrote for 4 days, 30 minutes per day. The CD4+ lymphocyte count and HIV viral load were measured at baseline and at 2 weeks, 3 months, and 6 months after writing.

RESULTS
The emotional writing participants rated their essays as more personal, valuable, and emotional than those in the control condition. Relative to the drop in HIV viral load, CD4+ lymphocyte counts increased after the intervention for participants in the emotional writing condition compared with control writing participants.

CONCLUSIONS
The results are consistent with those of previous studies using emotional writing in other patient groups. Based on the self-reports of the value of writing and the preliminary laboratory findings, the results suggest that emotional writing may provide benefit for patients with HIV infection.


A Quantitative Comparison of Semantic Web Page Segmentation Approaches

This paper explores the effectiveness of different semantic web page segmentation algorithms on modern websites. We compare three known algorithms each serving as an example of a particular approach to the problem, and one self-developed algorithm, WebTerrain, that combines two of the approaches. With our testing framework we have compared the performance of four algorithms for a large benchmark we have constructed. We have examined each algorithm for a total of eight different configurations (varying datasets, evaluation metric and the type of the input HTML documents). We found that all algorithms performed better on random pages on average than on popular pages, and results are better when running the algorithms on the HTML obtained from the DOM rather than on the plain HTML. Overall there is much room for improvement as we find the best average F-score to be 0.49, indicating that for modern websites currently available algorithms are not yet of practical use.


Smith-Petersen osteotomy in thoracolumbar deformity surgery.

OBJECTIVE
To describe the technique and indications of a Smith-Petersen osteotomy in spinal deformity surgery.

METHODS
Pertinent literature was reviewed to describe the indications and reported complications of this corrective technique.

RESULTS
The operative nuances of the technique are described.

CONCLUSION
A Smith-Petersen osteotomy is a safe and effective surgical technique to obtain correction of spinal deformity in both the sagittal and coronal planes.


Ensembles for unsupervised outlier detection: challenges and research questions a position paper

Ensembles for unsupervised outlier detection is an emerging topic that has been neglected for a surprisingly long time (although there are reasons why this is more difficult than supervised ensembles or even clustering ensembles). Aggarwal recently discussed algorithmic patterns of outlier detection ensembles, identified traces of the idea in the literature, and remarked on potential as well as unlikely avenues for future transfer of concepts from supervised ensembles. Complementary to his points, here we focus on the core ingredients for building an outlier ensemble, discuss the first steps taken in the literature, and identify challenges for future research.


Efficient SIMD code generation for runtime alignment and length conversion

When generating codes for today's multimedia extensions, one of the major challenges is to deal with memory alignment issues. While hand programming still yields best performing SIMD codes, it is both time consuming and error prone. Compiler technology has greatly improved, including techniques that simdize loops with misaligned accesses by automatically rearranging mis-aligned memory streams in registers. Current techniques are applicable to runtime alignments, but they aggressively reduce the alignment overhead only when all alignments are known at compile time. This paper presents two major enhancements to the state of the art, improving both performance and coverage. First, we propose a novel technique to simdize loops with runtime alignment nearly as efficiently as those with compile-time misalignment. Runtime alignment is pervasive in real applications because it is either part of the algorithms, or it is an artifact of the compiler's inability to extract accurate alignment information from complex applications. Second, we incorporate length conversion operations, e.g., conversions between data of different sizes, into the alignment handling framework. Length conversions are pervasive in multimedia applications where mixed integer types are often used. Supporting length conversion can greatly improve the coverage of simdizable loops. Experimental results indicate that our runtime alignment technique achieves a 19% to 32% speedup increase over prior art for a benchmark stressing the impact of misaligned data. We also demonstrate speedup factors of up to 8.11 for real benchmarks over sequential execution.


Turning the Waiting Room into a Classroom: Weekly Classes Using a Vegan or a Portion-Controlled Eating Plan Improve Diabetes Control in a Randomized Translational Study.

BACKGROUND
In research settings, plant-based (vegan) eating plans improve diabetes management, typically reducing weight, glycemia, and low-density lipoprotein (LDL) cholesterol concentrations to a greater extent than has been shown with portion-controlled eating plans.

OBJECTIVE
The study aimed to test whether similar benefits could be found using weekly nutrition classes in a typical endocrinology practice, hypothesizing that a vegan eating plan would improve glycemic control, weight, lipid concentrations, blood pressure, and renal function and would do so more effectively than a portion-controlled eating plan.

DESIGN
In a 20-week trial, participants were randomly assigned to a low-fat vegan or portion-controlled eating plan.

PARTICIPANTS/SETTING
Individuals with type 2 diabetes treated in a single endocrinology practice in Washington, DC, participated (45 starters, 40 completers).

INTERVENTION
Participants attended weekly after-hours classes in the office waiting room. The vegan plan excluded animal products and added oils and favored low-glycemic index foods. The portion-controlled plan included energy intake limits for weight loss (typically a deficit of 500 calories/day) and provided guidance on portion sizes.

MAIN OUTCOME MEASURES
Body weight, hemoglobin A1c (HbA1c), plasma lipids, urinary albumin, and blood pressure were measured.

STATISTICAL ANALYSES PERFORMED
For normally distributed data, t tests were used; for skewed outcomes, rank-based approaches were implemented (Wilcoxon signed-rank test for within-group changes, Wilcoxon two-sample test for between-group comparisons, and exact Hodges-Lehmann estimation to estimate effect sizes).

RESULTS
Although participants were in generally good metabolic control at baseline, body weight, HbA1c, and LDL cholesterol improved significantly within each group, with no significant differences between the two eating plans (weight: -6.3 kg vegan, -4.4 kg portion-controlled, between-group P=0.10; HbA1c, -0.40 percentage point in both groups, P=0.68; LDL cholesterol -11.9 mg/dL vegan, -12.7 mg/dL portion-controlled, P=0.89). Mean urinary albumin was normal at baseline and did not meaningfully change. Blood pressure changes were not significant.

CONCLUSIONS
Weekly classes, integrated into a clinical practice and using either a low-fat vegan or portion-controlled eating plan, led to clinical improvements in individuals with type 2 diabetes.


On Two Metaphors for Learning and the Dangers of Choosing Just One

The upshots of the former section can be put as follows: All our concepts and beliefs have their roots in a limited number of fundamental ideas that cross disciplinary boundaries and are carried from one domain to another by the language we use. One glance at the current discourse on learning should be enough to realize that nowadays educational research is caught between two metaphors that, in this article, will be called the acquisition metaphor and the participation metaphor. Both of these metaphors are simultaneously present in most recent texts, but while the acquisition metaphor is likely to be more prominent in older writings, more recent studies are often dominated by the participation metaphor.


Visual feature integration and the temporal correlation hypothesis.

The mammalian visual system is endowed with a nearly infinite capacity for the recognition of patterns and objects. To have acquired this capability the visual system must have solved what is a fundamentally combinatorial problem. Any given image consists of a collection of features, consisting of local contrast borders of luminance and wavelength, distributed across the visual field. For one to detect and recognize an object within a scene, the features comprising the object must be identified and segregated from those comprising other objects. This problem is inherently difficult to solve because of the combinatorial nature of visual images. To appreciate this point, consider a simple local feature such as a small vertically oriented line segment placed within a fixed location of the visual field. When combined with other line segments, this feature can form a nearly infinite number of geometrical objects. Any one of these objects may coexist with an equally large number of other


Virgin soil in irony research : Personality , humor , and the “ sense of irony ”

he aim of the paper is fourfold: (a) show why humor scholars should study irony, (b) explore the need for considering interindividual differences in healthy adults’ irony performance, (c) stress the necessity for developing tools assessing habitual differences in irony performance, and (d) indicate future directions for joint irony and humor research and outline possible applications. Verbal irony is often employed with a benevolent humorous intent by speakers, but can also serve as a means of disparagement humor. In both cases, encoding and decoding activities entailing irony need to be considered in the context of the psychology of humor. We argue that verbal irony performance can be considered a phenomenon native to the realm of humor and individual differences. We point out that research has widely neglected the meaningfulness of variance in irony performance within experimental groups when looking at determinants of irony detection and production. Based on theoretical considerations and previous empirical findings we show that this variance can be easily related to individual-differences variables such as the sense of humor, dispositions toward laughter and ridicule (e.g., gelotophobia), and general mental ability. Furthermore, we hypothesize that there is an enduring trait determining irony performance we will label the sense of irony. The sense of irony possibly goes along with inclinations toward specific affective and cognitive processing patterns when dealing with verbal irony. As an application, novel irony performance tests can help to study psychological and neurophysiological correlates of irony performance more feasibly, that is, in nonclinical groups. DOI: https://doi.org/10.1037/tps0000054 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-124094 Accepted Version Originally published at: Bruntsch, Richard; Hofmann, Jennifer; Ruch, Willibald (2016). Virgin soil in irony research: Personality, humor, and the “sense of irony”. Translational Issues in Psychological Science, 2(1):25-34. DOI: https://doi.org/10.1037/tps0000054 VIRGIN SOIL IN IRONY RESEARCH 1 Running head: VIRGIN SOIL IN IRONY RESEARCH Virgin soil in irony research: Personality, humor, and the “sense of irony”


Shape matching and object recognition using low distortion correspondences

We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning transform, typically a regularized thin plate spline, resulting in a dense correspondence between the two shapes. Object recognition is then handled in a nearest neighbor framework where the distance between exemplar and query is the matching cost between corresponding points. We show results on two datasets. One is the Caltech 101 dataset (Fei-Fei, Fergus and Perona), an extremely challenging dataset with large intraclass variation. Our approach yields a 48% correct classification rate, compared to Fei-Fei et al 's 16%. We also show results for localizing frontal and profile faces that are comparable to special purpose approaches tuned to faces.


SUN database: Large-scale scene recognition from abbey to zoo

Scene categorization is a fundamental problem in computer vision. However, scene understanding research has been constrained by the limited scope of currently-used databases which do not capture the full variety of scene categories. Whereas standard databases for object categorization contain hundreds of different classes of objects, the largest available dataset of scene categories contains only 15 classes. In this paper we propose the extensive Scene UNderstanding (SUN) database that contains 899 categories and 130,519 images. We use 397 well-sampled categories to evaluate numerous state-of-the-art algorithms for scene recognition and establish new bounds of performance. We measure human scene classification performance on the SUN database and compare this with computational methods. Additionally, we study a finer-grained scene representation to detect scenes embedded inside of larger scenes.


Shape matching and object recognition using shape contexts

This paper presents my work on computing shape models that are computationally fast and invariant basic transformations like translation, scaling and rotation. In this paper, I propose shape detection using a feature called shape context. Shape context describes all boundary points of a shape with respect to any single boundary point. Thus it is descriptive of the shape of the object. Object recognition can be achieved by matching this feature with a priori knowledge of the shape context of the boundary points of the object. Experimental results are promising on handwritten digits, trademark images.


Backward Stochastic Differential Equations and Applications

A new type of stochastic differential equation, called the backward stochastic differentil equation (BSDE), where the value of the solution is prescribed at the final (rather than the initial) point of the time interval, but the solution is nevertheless required to be at each time a function of the past of the underlying Brownian motion, has been introduced recently, independently by Peng and the author in [16], and by Dufne and Epstein in [7]. This class of equations is a natural nonlinear extension of linear equations that appear both as the equation for the adjoint process in the maximum principle for optimal stochastic control (see [2]), and as a basic model for asset pricing in financial mathematics. It was soon after discovered (see [22], [17]) that those BSDEs provide probabilistic formulas for solutions of certain semilinear partial differential equations (PDEs), which generalize the well-known Feynmann-Kac formula for second order linear PDEs. This provides a new additional tool for analyzing solutions of certain PDEs, for instance reaction-diffusion equations.


Face detection using SURF cascade

We present a novel boosting cascade based face detection framework using SURF features. The framework is derived from the well-known Viola-Jones (VJ) framework but distinguished by two key contributions. First, the proposed framework deals with only several hundreds of multidimensional local SURF patches instead of hundreds of thousands of single dimensional haar features in the VJ framework. Second, it takes AUC as a single criterion for the convergence test of each cascade stage rather than the two conflicting criteria (false-positive-rate and detection-rate) in the VJ framework. These modifications yield much faster training convergence and much fewer stages in the final cascade. We made experiments on training face detector from large scale database. Results shows that the proposed method is able to train face detectors within one hour through scanning billions of negative samples on current personal computers. Furthermore, the built detector is comparable to the state-of-the-art algorithm not only on the accuracy but also on the processing speed.


Automatic detection and classification of diabetic retinopathy stages using CNN

A Convolutional Neural Networks (CNNs) approach is proposed to automate the method of Diabetic Retinopathy(DR) screening using color fundus retinal photography as input. Our network uses CNN along with denoising to identify features like micro-aneurysms and haemorrhages on the retina. Our models were developed leveraging Theano, an open source numerical computation library for Python. We trained this network using a high-end GPU on the publicly available Kaggle dataset. On the data set of over 30,000 images our proposed model achieves around 95% accuracy for the two class classification and around 85% accuracy for the five class classification on around 3,000 validation images.


Qualitative research in health care. Assessing quality in qualitative research.

In the past decade, qualitative methods have become more commonplace in areas such as health services research and health technology assessment, and there has been a corresponding rise in the reporting of qualitative research studies in medical and related journals. Interest in these methods and their wider exposure in health research has led to necessary scrutiny of qualitative research. Researchers from other traditions are increasingly concerned to understand qualitative methods and, most importantly, to examine the claims researchers make about the findings obtained from these methods. The status of all forms of research depends on the quality of the methods used. In qualitative research, concern about assessing quality has manifested itself recently in the proliferation of guidelines for doing and judging qualitative work. Users and funders of research have had an important role in developing these guidelines as they become increasingly familiar with qualitative methods, but require some means of assessing their quality and of distinguishing “good” and “poor” quality research. However, the issue of “quality” in qualitative research is part of a much larger and contested debate about the nature of the knowledge produced by qualitative research, whether its quality can legitimately be judged, and, if so, how. This paper cannot do full justice to this wider epistemological debate. Rather it outlines two views of how qualitative methods might be judged and argues that qualitative research can be assessed according to two broad criteria: validity and relevance.


An empirical examination of factors contributing to the creation of successful e-learning environments

Although existing models of e-learning effectiveness in information systems (IS) have increased our understanding of how technology can support and enhance learning, most of our models do not take into account the importance of social presence. Thus, this study extends previous research by developing a model of e-learning effectiveness which adds social presence to other oft studied variables including application-specific computer self-efficacy (AS-CSE), perceived usefulness, course interaction, and e-learning effectiveness. Using data from 345 individuals, this model was validated through a field study in an introductory IS survey course. Results indicate that AS-CSE and perceived usefulness were related to course performance, course satisfaction, and course instrumentality. In addition, course interaction was related to course performance and satisfaction. Finally, social presence was related to course satisfaction and course instrumentality. Implications for research and practice are discussed. r 2007 Elsevier Ltd. All rights reserved.


peepHole : Securing your homes with Raspberry Pi and Amazon Echo

In recent years, the field of Internet of Things (IoT) has seen significant investments made by the research community and the industry. Specifically, the Smart Home space has been a prime focus with the introduction of devices such as Amazon Echo, Google Home, Samsung Smart Things among others. The growth of an industry results in innovative, economic, and advanced solutions. In this paper, we focus on smart home security and how to build a robust, cost-effective system that can be widely used. We power our system using Amazon Echo, Amazon’s cloud services, its speech services. A Raspberry Pi with a camera module is used as the hardware component for providing home security. We describe the different components of our product and we show that our system works effectively to identify the person at the doorstep, and have thus named our system peepHole. Keywords—Intenet of Things, Smart Homes, Home Security, Amazon Web Services, Amazon Echo, Raspberry Pi, Face Verification


Chemical structure recognition and prediction: A machine learning technique

A chemical structure recognition system designed to identify and predict hand-drawn chemical diagrams is presented. Although the proposed system is primarily intended to help chemists complete their chemical structure drawings and predict and complete the chemical structure, it is also envisioned to be utilized as a learning aid in chemistry education on a student's touchscreen device or on a teacher's smart board. The proposed system continuously provides the user with real-time feedback about the most relevant combinations to complete the chemical compound. A constantly updated list of prioritized candidate structures is displayed to the user. If the user is an expert, he or she will be allowed to contribute to the learning process of the proposed system. The proposed system deploys two trainable Bayesian networks, one at its input and another one at its output. Between the two networks, the classification of hand- drawn chemical structure is done using morphological image processing, LDA and PCA, incorporating therefore both image- based and feature-based techniques. This incorporation contributes considerably to the increased performance of the proposed system by enabling it to efficiently recognize messy drawings and noisy sketches like those containing over-traced strokes. Performance comparison with existing state of the art techniques proved the system to be outperforming in terms of recognition accuracy.


Breath acetone monitoring by portable Si:WO3 gas sensors.

Breath analysis has the potential for early stage detection and monitoring of illnesses to drastically reduce the corresponding medical diagnostic costs and improve the quality of life of patients suffering from chronic illnesses. In particular, the detection of acetone in the human breath is promising for non-invasive diagnosis and painless monitoring of diabetes (no finger pricking). Here, a portable acetone sensor consisting of flame-deposited and in situ annealed, Si-doped epsilon-WO(3) nanostructured films was developed. The chamber volume was miniaturized while reaction-limited and transport-limited gas flow rates were identified and sensing temperatures were optimized resulting in a low detection limit of acetone (∼20ppb) with short response (10-15s) and recovery times (35-70s). Furthermore, the sensor signal (response) was robust against variations of the exhaled breath flow rate facilitating application of these sensors at realistic relative humidities (80-90%) as in the human breath. The acetone content in the breath of test persons was monitored continuously and compared to that of state-of-the-art proton transfer reaction mass spectrometry (PTR-MS). Such portable devices can accurately track breath acetone concentration to become an alternative to more elaborate breath analysis techniques.


Performance analysis of latent fingerprint enhancement techniques

Fingerprint Enhancement is an important step used to improve the accuracy and rate of automated detection of fingerprints. Enhancing the latent fingerprints facilitates the extraction of minutiae from the fingerprint image. In this paper, two methods of latent fingerprint enhancement are carried out. The first uses Histogram Equalization for enhancing the latent fingerprint. The second method uses a novel approach of Binarization followed by Wiener filtering and an additional Median filter. The improvements in the image are then analyzed based on their entropy, contrast and moment.


Text Generation From Tables

This paper proposes a neural generative model, namely Table2Seq, to generate a natural language sentence based on a table. Specifically, the model maps a table to continuous vectors and then generates a natural language sentence by leveraging the semantics of a table. Since rare words, e.g., entities and values, usually appear in a table, we develop a flexible copying mechanism that selectively replicates contents from the table to the output sequence. We conduct extensive experiments to demonstrate the effectiveness of our Table2Seq model and the utility of the designed copying mechanism. On the WIKIBIO and SIMPLEQUESTIONS datasets, the Table2Seq model improves the state-of-the-art results from 34.70 to 40.26 and from 33.32 to 39.12 in terms of BLEU-4 scores, respectively. Moreover, we construct an open-domain dataset WIKITABLETEXT that includes 13 318 descriptive sentences for 4962 tables. Our Table2Seq model achieves a BLEU-4 score of 38.23 on WIKITABLETEXT outperforming template-based and language model based approaches. Furthermore, through experiments on 1 M table-query pairs from a search engine, our Table2Seq model considering the structured part of a table, i.e., table attributes and table cells, as additional information outperforms a sequence-to-sequence model considering only the sequential part of a table, i.e., table caption.


Standards for smart education – towards a development framework

Smart learning environments (SLEs) utilize a range of digital technologies in supporting learning, education and training; they also provide a prominent signpost for how future learning environments might be shaped. Thus, while innovation proceeds, SLEs are receiving growing attention from the research community, outputs from which are discussed in this paper. Likewise, this broad application of educational digital technologies is also the remit of standardization in an ISO committee, also discussed in this paper. These two communities share a common interest in, conceptualizing this emerging domain with the aim to identifying direction to further development. In doing so, terminology issues arise along with key questions such as, ‘how is smart learning different from traditional learning?’ Presenting a bigger challenge is the question, ‘how can standardization work be best scoped in today's innovation-rich, networked, cloud-based and data-driven learning environments?’ In responding, this conceptual paper seeks to identify candidate constructs and approaches that might lead to stable, coherent and exhaustive understanding of smart learning environments, thereby providing standards development for learning, education and training a needed direction. Based on reviews of pioneering work within smart learning, smart education and smart learning environments we highlight two models, a cognitive smart learning model and a smartness level model. These models are evaluated against current standardization challenges in the field of learning, education and training to form the basis for a development platform for new standards in this area.


Early Detection of Sudden Pedestrian Crossing for Safe Driving During Summer Nights

Sudden pedestrian crossing (SPC) is the major reason for pedestrian-vehicle crashes. In this paper, we focus on detecting SPCs at night for supporting an advanced driver assistance system using a far-infrared (FIR) camera mounted on the front roof of a vehicle. Although the thermal temperature of the road is similar to or higher than that of the pedestrians during summer nights, many previous researches have focused on pedestrian detection during the winter, spring, or autumn seasons. However, our research concentrates on SPC during the hot summer season because the number of collisions between pedestrians and vehicles in Korea is higher at that time than during the other seasons. For real-time processing, we first decide the optimal levels of image scaling and search area. We then use our proposed method for detecting virtual reference lines that are associated with road segmentation without using color information and change these lines according to the turning direction of the vehicle. Pedestrian detection is conducted using a cascade random forest with low-dimensional Haar-like features and oriented center-symmetric local binary patterns. The SPC is predicted based on the likelihood and the spatiotemporal features of the pedestrians, such as their overlapping ratio with virtual reference lines, as well as the direction and magnitude of each pedestrian’s movement. The proposed algorithm was successfully applied to various pedestrian data sets captured by an FIR camera, and the results show that its SPC detection performance is better than those of other methods.


Experiences with rapid mobile game development using unity engine

In this work, we describe our experiences with FunCopter, a casual game we have designed and implemented using Unity engine, suitable for portable devices. We emphasize some general principles, particularly with respect to rapid game development and constrained graphics. In addition to that, we present the main activities realized in each software engineering phase and the lessons we learned during its development. These descriptions include details from the initial concept to the fully realized, playable game. This work will share general but important experiences with Unity, particularly interesting for game developers in beginner's level.


Dimensionality reduction for the quantitative evaluation of a smartphone-based Timed Up and Go test

The Timed Up and Go is a clinical test to assess mobility in the elderly and in Parkinson's disease. Lately instrumented versions of the test are being considered, where inertial sensors assess motion. To improve the pervasiveness, ease of use, and cost, we consider a smartphone's accelerometer as the measurement system. Several parameters (usually highly correlated) can be computed from the signals recorded during the test. To avoid redundancy and obtain the features that are most sensitive to the locomotor performance, a dimensionality reduction was performed through principal component analysis (PCA). Forty-nine healthy subjects of different ages were tested. PCA was performed to extract new features (principal components) which are not redundant combinations of the original parameters and account for most of the data variability. They can be useful for exploratory analysis and outlier detection. Then, a reduced set of the original parameters was selected through correlation analysis with the principal components. This set could be recommended for studies based on healthy adults. The proposed procedure could be used as a first-level feature selection in classification studies (i.e. healthy-Parkinson's disease, fallers-non fallers) and could allow, in the future, a complete system for movement analysis to be incorporated in a smartphone.


Let's stop trying to be "sexy" - preparing managers for the (big) data-driven business era

Let's stop trying to be 'sexy' – preparing managers for the (big) data-driven business era Kevin Daniel André Carillo, Article information: To cite this document: Kevin Daniel André Carillo, (2017) "Let's stop trying to be 'sexy' – preparing managers for the (big) data-driven business era", Business Process Management Journal, Vol. 23 Issue: 3, doi: 10.1108/BPMJ-09-2016-0188 Permanent link to this document: http://dx.doi.org/10.1108/BPMJ-09-2016-0188


The neurobiology of social cognition

Recent studies have begun to elucidate the roles played in social cognition by specific neural structures, genes, and neurotransmitter systems. Cortical regions in the temporal lobe participate in perceiving socially relevant stimuli, whereas the amygdala, right somatosensory cortices, orbitofrontal cortices, and cingulate cortices all participate in linking perception of such stimuli to motivation, emotion, and cognition. Open questions remain about the domain-specificity of social cognition, about its overlap with emotion and with communication, and about the methods best suited for its investigation.


Conformal Surface Parameterization for Texture Mapping

In this paper , we give an explicit methodfor mappingany simply connectedsurfaceonto the spherein a mannerwhich preservesangles. This techniquerelieson certainconformalmappingsfrom differentialgeometry. Our methodprovidesa new way to automaticallyassigntexturecoordinates to complex undulatingsurfaces. We demonstratea finite elementmethod thatcanbeusedto applyour mappingtechniqueto a triangulatedgeometric descriptionof a surface.


The ARTEMIS European driving cycles for measuring car pollutant emissions.

In the past 10 years, various work has been undertaken to collect data on the actual driving of European cars and to derive representative real-world driving cycles. A compilation and synthesis of this work is provided in this paper. In the frame of the European research project: ARTEMIS, this work has been considered to derive a set of reference driving cycles. The main objectives were as follows: to derive a common set of reference real-world driving cycles to be used in the frame of the ARTEMIS project but also in the frame of on-going national campaigns of pollutant emission measurements, to ensure the compatibility and integration of all the resulting emission data in the European systems of emission inventory; to ensure and validate the representativity of the database and driving cycles by comparing and taking into account all the available data regarding driving conditions; to include in three real-world driving cycles (urban, rural road and motorway) the diversity of the observed driving conditions, within sub-cycles allowing a disaggregation of the emissions according to more specific driving conditions (congested and free-flow urban). Such driving cycles present a real advantage as they are derived from a large database, using a methodology that was widely discussed and approved. In the main, these ARTEMIS driving cycles were designed using the available data, and the method of analysis was based to some extent on previous work. Specific steps were implemented. The study includes characterisation of driving conditions and vehicle uses. Starting conditions and gearbox use are also taken into account.


Syntax and semantics in the acquisition of locative verbs.

Children between the ages of three and seven occasionally make errors with locative verbs like pour and fill, such as *I filled water into the glass and *I poured the glass with water (Bowerman, 1982). To account for this pattern of errors, and for how they are eventually unlearned, we propose that children use a universal linking rule called object affectedness: the direct object corresponds to the argument that is specified as 'affected' in some particular way in the semantic representation of a verb. However, children must learn which verbs specify which of their arguments as being affected; specifically, whether it is the argument whose referent is undergoing a change of location, such as the content argument of pour, or the argument whose referent is undergoing a change of state, such as the container argument of fill. This predicts that syntactic errors should be associated with specific kinds of misinterpretations of verb meaning. Two experiments were performed on the ability of children and adults to understand and produce locative verbs. The results confirm that children tend to make syntactic errors with sentences containing fill and empty, encoding the content argument as direct object (e.g. fill the water). As predicted, children also misinterpreted the meanings of fill and empty as requiring not only that the container be brought into a full or empty state, but also that the content move in some specific manner (by pouring, or by dumping). Furthermore, children who misinterpreted the verbs' meanings were more likely to make syntactic errors with them. These findings support the hypothesis that verb meaning and syntax are linked in precise ways in the lexicons of language learners.