Note-Taking With Computers : Exploring Alternative Strategies for Improved Recall

Three experiments examined note-taking strategies and their relation to recall. In Experiment 1, participants were instructed either to take organized lecture notes or to try and transcribe the lecture, and they either took their notes by hand or typed them into a computer. Those instructed to transcribe the lecture using a computer showed the best recall on immediate tests, and the subsequent experiments focused on note-taking using computers. Experiment 2 showed that taking organized notes produced the best recall on delayed tests. In Experiment 3, however, when participants were given the opportunity to study their notes, those who had tried to transcribe the lecture showed better recall on delayed tests than those who had taken organized notes. Correlational analyses of data from all 3 experiments revealed that for those who took organized notes, working memory predicted note-quantity, which predicted recall on both immediate and delayed tests. For those who tried to transcribe the lecture, in contrast, only note-quantity was a consistent predictor of recall. These results suggest that individuals who have poor working memory (an ability traditionally thought to be important for note-taking) can still take effective notes if they use a note-taking strategy (transcribing using a computer) that can help level the playing field for students of diverse cognitive abilities.


Analytical Tools for Blockchain: Review, Taxonomy and Open Challenges

Bitcoin has introduced a new concept that could feasibly revolutionise the entire Internet as it exists, and positively impact on many types of industries including, but not limited to, banking, public sector and supply chain. This innovation is grounded on pseudo-anonymity and strives on its innovative decentralised architecture based on the blockchain technology. Blockchain is pushing forward a race of transaction-based applications with trust establishment without the need for a centralised authority, promoting accountability and transparency within the business process. However, a blockchain ledger (e.g., Bitcoin) tend to become very complex and specialised tools, collectively called “Blockchain Analytics”, are required to allow individuals, law enforcement agencies and service providers to search, explore and visualise it. Over the last years, several analytical tools have been developed with capabilities that allow, e.g., to map relationships, examine flow of transactions and filter crime instances as a way to enhance forensic investigations. This paper discusses the current state of blockchain analytical tools and presents a thematic taxonomy model based on their applications. It also examines open challenges for future development and research.


Cross-language knowledge transfer using multilingual deep neural network with shared hidden layers

In the deep neural network (DNN), the hidden layers can be considered as increasingly complex feature transformations and the final softmax layer as a log-linear classifier making use of the most abstract features computed in the hidden layers. While the loglinear classifier should be different for different languages, the feature transformations can be shared across languages. In this paper we propose a shared-hidden-layer multilingual DNN (SHL-MDNN), in which the hidden layers are made common across many languages while the softmax layers are made language dependent. We demonstrate that the SHL-MDNN can reduce errors by 3-5%, relatively, for all the languages decodable with the SHL-MDNN, over the monolingual DNNs trained using only the language specific data. Further, we show that the learned hidden layers sharing across languages can be transferred to improve recognition accuracy of new languages, with relative error reductions ranging from 6% to 28% against DNNs trained without exploiting the transferred hidden layers. It is particularly interesting that the error reduction can be achieved for the target language that is in different families of the languages used to learn the hidden layers.


Communication-Efficient Learning of Deep Networks from Decentralized Data

Modern mobile devices have access to a wealth of data suitable for learning models, which in turn can greatly improve the user experience on the device. For example, language models can improve speech recognition and text entry, and image models can automatically select good photos. However, this rich data is often privacy sensitive, large in quantity, or both, which may preclude logging to the data center and training there using conventional approaches. We advocate an alternative that leaves the training data distributed on the mobile devices, and learns a shared model by aggregating locally-computed updates. We term this decentralized approach Federated Learning. We present a practical method for the federated learning of deep networks based on iterative model averaging, and conduct an extensive empirical evaluation, considering five different model architectures and four datasets. These experiments demonstrate the approach is robust to the unbalanced and non-IID data distributions that are a defining characteristic of this setting. Communication costs are the principal constraint, and we show a reduction in required communication rounds by 10–100× as compared to synchronized stochastic gradient descent.


Federated Meta-Learning for Recommendation

Recommender systems have been widely studied from the machine learning perspective, where it is crucial to share information among users while preserving user privacy. In this work, we present a federated meta-learning framework for recommendation in which user information is shared at the level of algorithm, instead of model or data adopted in previous approaches. In this framework, user-specific recommendation models are locally trained by a shared parameterized algorithm, which preserves user privacy and at the same time utilizes information from other users to help model training. Interestingly, the model thus trained exhibits a high capacity at a small scale, which is energyand communicationefficient. Experimental results show that recommendation models trained by meta-learning algorithms in the proposed framework outperform the state-of-the-art in accuracy and scale. For example, on a production dataset, a shared model under Google Federated Learning (McMahan et al., 2017) with 900,000 parameters has prediction accuracy 76.72%, while a shared algorithm under federated meta-learning with less than 30,000 parameters achieves accuracy of 86.23%.


Neural networks and principal component analysis: Learning from examples without local minima

We consider the problem of learning from examples in layered linear feed-forward neural networks using optimization methods, such as back propagation, with respect to the usual quadratic error function E of the connection weights. Our main result is a complete description of the landscape attached to E in terms of principal component analysis. We show that E has a unique minimum corresponding to the projection onto the subspace generated by the first principal vectors of a covariance matrix associated with the training patterns. All the additional critical points of E are saddle points (corresponding to projections onto subspaces generated by higher order vectors). The auto-associative case is examined in detail. Extensions and implications for the learning algorithms are discussed.


A CORDIC processor for FFT computation and its implementation using gallium arsenide technology

In this paper, the architecture and the implementation of a complex fast Fourier transform (CFFT) processor using 0.6 m gallium arsenide (GaAs) technology are presented. This processor computes a 1024-point FFT of 16 bit complex data in less than 8 s, working at a frequency beyond 700 MHz, with a power consumption of 12.5 W. The architecture of the processor is based on the COordinate Rotation DIgital Computer (CORDIC) algorithm, which avoids the use of conventional multiplicationand-accumulation (MAC) units, but evaluates the trigonometric functions using only add and shift operations. Improvements to the basic CORDIC architecture are introduced in order to reduce the area and power of the processor. This together with the use of pipelining and carry save adders produces a very regular and fast processor. The CORDIC units were fabricated and tested in order to anticipate the final performance of the processor. This work also demonstrates the maturity of GaAs technology for implementing ultrahigh-performance signal processors.


A current-starved inverter-based differential amplifier design for ultra-low power applications

As silicon feature sizes decrease, more complex circui try arrays can now be contrived on a single die. This increase in the number of on-chip devices per unit area results in increased power dissipation per unit area. In order to meet certain power and operating temperature specifications, circuit design necessitates a focus on power efficiency, which is especially important in systems employing hundreds or thousands of instances of the same device. In large arrays, a slight increase in the power efficiency of a single component is heightened by the number of instances of the device in the system. This paper proposes a fully differential, low-power current-starving inverter-based amplifier topology designed in a commercial 0.18μm process. This design achieves 46dB DC gain and a 464 kHz uni ty gain frequency with a power consumption of only 145.32nW at 700mV power supply vol tage for ultra-low power, low bandwidth applications. Higher bandwidth designs are also proposed, including a 48dB DC gain, 2.4 MHz unity-gain frequency amplifier operating at 900mV wi th only 3.74μW power consumption.


Conditional connectivity

For a noncomplete graph G , the traditional definition of its connectivity is the minimum number of points whose removal results in a disconnected subgraph with components H , , . . . , H k . The conditional connectivity of G with respect to some graphtheoretic property P is the smallest cardinality of a set S of points, if any, such that every component Hi of the disconnected graph G S has property P. A survey of promising properties P is presented. Questions for various P-connectivities are listed in analogy with known results on connectivity and line-connectivity.


A review of mangrove rehabilitation in the Philippines: successes, failures and future prospects

From half a million hectares at the turn of the century, Philippine mangroves have declined to only 120,000 ha while fish/shrimp culture ponds have increased to 232,000 ha. Mangrove replanting programs have thus been popular, from community initiatives (1930s–1950s) to government-sponsored projects (1970s) to large-scale international development assistance programs (1980s to present). Planting costs escalated from less than US$100 to over $500/ha, with half of the latter amount allocated to administration, supervision and project management. Despite heavy funds for massive rehabilitation of mangrove forests over the last two decades, the long-term survival rates of mangroves are generally low at 10–20%. Poor survival can be mainly traced to two factors: inappropriate species and site selection. The favored but unsuitable Rhizophora are planted in sandy substrates of exposed coastlines instead of the natural colonizers Avicennia and Sonneratia. More significantly, planting sites are generally in the lower intertidal to subtidal zones where mangroves do not thrive rather than the optimal middle to upper intertidal levels, for a simple reason. Such ideal sites have long been converted to brackishwater fishponds whereas the former are open access areas with no ownership problems. The issue of pond ownership may be complex and difficult, but such should not outweigh ecological requirements: mangroves should be planted where fishponds are, not on seagrass beds and tidal flats where they never existed. This paper reviews eight mangrove initiatives in the Philippines and evaluates the biophysical and institutional factors behind success or failure. The authors recommend specific protocols (among them pushing for a 4:1 mangrove to pond ratio recommended for a healthy ecosystem) and wider policy directions to make mangrove rehabilitation in the country more effective.


What characterizes a shadow boundary under the sun and sky?

Despite decades of study, robust shadow detection remains difficult, especially within a single color image. We describe a new approach to detect shadow boundaries in images of outdoor scenes lit only by the sun and sky. The method first extracts visual features of candidate edges that are motivated by physical models of illumination and occluders. We feed these features into a Support Vector Machine (SVM) that was trained to discriminate between most-likely shadow-edge candidates and less-likely ones. Finally, we connect edges to help reject non-shadow edge candidates, and to encourage closed, connected shadow boundaries. On benchmark shadow-edge data sets from Lalonde et al. and Zhu et al., our method showed substantial improvements when compared to other recent shadow-detection methods based on statistical learning.


3D distance fields: a survey of techniques and applications

A distance field is a representation where, at each point within the field, we know the distance from that point to the closest point on any object within the domain. In addition to distance, other properties may be derived from the distance field, such as the direction to the surface, and when the distance field is signed, we may also determine if the point is internal or external to objects within the domain. The distance field has been found to be a useful construction within the areas of computer vision, physics, and computer graphics. This paper serves as an exposition of methods for the production of distance fields, and a review of alternative representations and applications of distance fields. In the course of this paper, we present various methods from all three of the above areas, and we answer pertinent questions such as How accurate are these methods compared to each other? How simple are they to implement?, and What is the complexity and runtime of such methods?.


Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization

Due to its low storage cost and fast query speed, hashing has been widely adopted for similarity search in multimedia data. In particular, more and more attentions have been payed to multimodal hashing for search in multimedia data with multiple modalities, such as images with tags. Typically, supervised information of semantic labels is also available for the data points in many real applications. Hence, many supervised multimodal hashing (SMH) methods have been proposed to utilize such semantic labels to further improve the search accuracy. However, the training time complexity of most existing SMH methods is too high, which makes them unscalable to large-scale datasets. In this paper, a novel SMH method, called semantic correlation maximization (SCM), is proposed to seamlessly integrate semantic labels into the hashing learning procedure for large-scale data modeling. Experimental results on two real-world datasets show that SCM can significantly outperform the state-of-the-art SMH methods, in terms of both accuracy and scalability.


Noise radar using random phase and frequency modulation

Pulse compression radar is used in a great number of applications. Excellent range resolution and high electronic counter-countermeasures performance is achieved by wideband long pulses, which spread out the transmitted energy in frequency and time. By using a random noise waveform, the range ambiguity is suppressed as well. In most applications, the random signal is transmitted directly from a noise-generating microwave source. A sine wave, which is phase or frequency modulated by random noise, is an alternative, and in this paper, the ambiguity function and the statistical characteristics of the correlation output for the latter configuration are further analyzed. Range resolution is then improved because the noise bandwidth of the modulated carrier is wider than that of the modulating signal, and the range sidelobes are also further suppressed. Random biphase modulation gives a 4-dB (/spl pi//sup 2//4) improvement, but much higher sidelobe suppression could be achieved using continuous phase/frequency modulation. Due to the randomness of the waveform, the output correlation integral is accompanied by a noise floor, which limits the possible sidelobe suppression as determined by the time-bandwidth product. In synthetic aperture radar (SAR) applications with distributed targets, this product should be large compared with the number of resolution elements inside the antenna main beam. The advantages of low range sidelobes and enhanced range resolution make frequency/phase-modulated noise radar attractive for many applications, including SAR mapping, surveillance, altimetry, and scatterometry. Computer algorithms for reference signal delay and compression are discussed as replacements for the classical delay line implementation.


Collusive Piracy Prevention in P2P Content Delivery Networks

Collusive piracy is the main source of intellectual property violations within the boundary of a P2P network. Paid clients (colluders) may illegally share copyrighted content files with unpaid clients (pirates). Such online piracy has hindered the use of open P2P networks for commercial content delivery. We propose a proactive content poisoning scheme to stop colluders and pirates from alleged copyright infringements in P2P file sharing. The basic idea is to detect pirates timely with identity-based signatures and time-stamped tokens. The scheme stops collusive piracy without hurting legitimate P2P clients by targeting poisoning on detected violators, exclusively. We developed a new peer authorization protocol (PAP) to distinguish pirates from legitimate clients. Detected pirates will receive poisoned chunks in their repeated attempts. Pirates are thus severely penalized with no chance to download successfully in tolerable time. Based on simulation results, we find 99.9 percent prevention rate in Gnutella, KaZaA, and Freenet. We achieved 85-98 percent prevention rate on eMule, eDonkey, Morpheus, etc. The scheme is shown less effective in protecting some poison-resilient networks like BitTorrent and Azureus. Our work opens up the low-cost P2P technology for copyrighted content delivery. The advantage lies mainly in minimum delivery cost, higher content availability, and copyright compliance in exploring P2P network resources.


RanDroid: Android malware detection using random machine learning classifiers

The growing polularity of Android based smartphone attracted the distribution of malicious applications developed by attackers which resulted the need for sophisticated malware detection techniques. Several techniques are proposed which use static and/or dynamic features extracted from android application to detect malware. The use of machine learning is adapted in various malware detection techniques to overcome the mannual updation overhead. Machine learning classifiers are widely used to model Android malware patterns based on their static features and dynamic behaviour. To address the problem of malware detection, in this paper we have proposed a machine learning-based malware detection system for Android platform. Our proposed system utilizes the features of collected random samples of goodware and malware apps to train the classifiers. The system extracts requested permissions, vulnerable API calls along with the existence of app's key information such as; dynamic code, reflection code, native code, cryptographic code and database from applications, which was missing in previous proposed solutions and uses them as features in various machine learning classifiers to build classification model. To validate the performance of proposed system, "RanDroid" various experiments have been carriedout, which show that the RanDroid is capable to achieve a high classification accuracy of 97.7 percent.


Accelerating Asynchronous Stochastic Gradient Descent for Neural Machine Translation

In order to extract the best possible performance from asynchronous stochastic gradient descent one must increase the mini-batch size and scale the learning rate accordingly. In order to achieve further speedup we introduce a technique that delays gradient updates effectively increasing the mini-batch size. Unfortunately with the increase of mini-batch size we worsen the stale gradient problem in asynchronous stochastic gradient descent (SGD) which makes the model convergence poor. We introduce local optimizers which mitigate the stale gradient problem and together with fine tuning our momentum we are able to train a shallow machine translation system 27% faster than an optimized baseline with negligible penalty in BLEU.


A Glimpse Far into the Future: Understanding Long-term Crowd Worker Quality

Microtask crowdsourcing is increasingly critical to the creation of extremely large datasets. As a result, crowd workers spend weeks or months repeating the exact same tasks, making it necessary to understand their behavior over these long periods of time. We utilize three large, longitudinal datasets of nine million annotations collected from Amazon Mechanical Turk to examine claims that workers fatigue or satisfice over these long periods, producing lower quality work. We find that, contrary to these claims, workers are extremely stable in their quality over the entire period. To understand whether workers set their quality based on the task's requirements for acceptance, we then perform an experiment where we vary the required quality for a large crowdsourcing task. Workers did not adjust their quality based on the acceptance threshold: workers who were above the threshold continued working at their usual quality level, and workers below the threshold self-selected themselves out of the task. Capitalizing on this consistency, we demonstrate that it is possible to predict workers' long-term quality using just a glimpse of their quality on the first five tasks.


Robust Cross-lingual Hypernymy Detection using Dependency Context

Cross-lingual Hypernymy Detection involves determining if a word in one language (“fruit”) is a hypernym of a word in another language (“pomme” i.e. apple in French). The ability to detect hypernymy cross-lingually can aid in solving cross-lingual versions of tasks such as textual entailment and event coreference. We propose BISPARSE-DEP, a family of unsupervised approaches for cross-lingual hypernymy detection, which learns sparse, bilingual word embeddings based on dependency contexts. We show that BISPARSE-DEP can significantly improve performance on this task, compared to approaches based only on lexical context. Our approach is also robust, showing promise for low-resource settings: our dependency-based embeddings can be learned using a parser trained on related languages, with negligible loss in performance. We also crowd-source a challenging dataset for this task on four languages – Russian, French, Arabic, and Chinese. Our embeddings and datasets are publicly available.1


Broadband and compact impedance transformers for microwave circuits

Most microwave circuits and antennas use impedance transformers. In a conventional power amplifier, large number of inductors and capacitor or transmission line sections are use to realize an impedance transformer. This article presents an asymmetric broadside-coupled microstrip TLT (transmission line transformer) on the GaAs substrate. This matching network can be easily implemented using any monolithic microwave integrated circuit (MMIC) process supporting multilevel metallization


Seeing Behind the Camera: Identifying the Authorship of a Photograph

We introduce the novel problem of identifying the photographer behind a photograph. To explore the feasibility of current computer vision techniques to address this problem, we created a new dataset of over 180,000 images taken by 41 well-known photographers. Using this dataset, we examined the effectiveness of a variety of features (low and high-level, including CNN features) at identifying the photographer. We also trained a new deep convolutional neural network for this task. Our results show that high-level features greatly outperform low-level features. We provide qualitative results using these learned models that give insight into our method's ability to distinguish between photographers, and allow us to draw interesting conclusions about what specific photographers shoot. We also demonstrate two applications of our method.


Participatory Air Pollution Monitoring Using Smartphones

Air quality monitoring is extremely important as air pollution has a direct impact on human health. In this paper we introduce a low-power and low-cost mobile sensing system for participatory air quality monitoring. In contrast to traditional stationary air pollution monitoring stations, we present the design, implementation, and evaluation of GasMobile, a small and portable measurement system based on off-the-shelf components and suited to be used by a large number of people. Vital to the success of participatory sensing applications is a high data quality. We improve measurement accuracy by (i) exploiting sensor readings near governmental measurement stations to keep sensor calibration up to date and (ii) analyzing the effect of mobility on the accuracy of the sensor readings to give user advice on measurement execution. Finally, we show that it is feasible to use GasMobile to create collective high-resolution air pollution maps.


Bluetooth based home automation system

The past decade has seen significant advancement in the field of consumer electronics. Various ‘intelligent’ appliances such as cellular phones, air-conditioners, home security devices, home theatres, etc. are set to realize the concept of a smart home. They have given rise to a Personal Area Network in home environment, where all these appliances can be interconnected and monitored using a single controller. Busy families and individuals with physical limitation represent an attractive market for home automation and networking. A wireless home network that does not incur additional costs of wiring would be desirable. Bluetooth technology, which has emerged in late 1990s, is an ideal solution for this purpose. This paper describes an application of Bluetooth technology in home automation and networking environment. It proposes a network, which contains a remote, mobile host controller and several client modules (home appliances). The client modules communicate with the host controller through Bluetooth devices. q 2002 Elsevier Science B.V. All rights reserved.


OCNet: Object Context Network for Scene Parsing

In this paper, we address the problem of scene parsing with deep learning and focus on the context aggregation strategy for robust segmentation. Motivated by that the label of a pixel is the category of the object that the pixel belongs to, we introduce an object context pooling (OCP) scheme, which represents each pixel by exploiting the set of pixels that belong to the same object category with such a pixel, and we call the set of pixels as object context. Our implementation, inspired by the self-attention approach, consists of two steps: (i) compute the similarities between each pixel and all the pixels, forming a socalled object context map for each pixel served as a surrogate for the true object context, and (ii) represent the pixel by aggregating the features of all the pixels weighted by the similarities. The resulting representation is more robust compared to existing context aggregation schemes, e.g., pyramid pooling modules (PPM) in PSPNet and atrous spatial pyramid pooling (ASPP), which do not differentiate the context pixels belonging to the same object category or not, making the reliability of contextually aggregated representations limited. We empirically demonstrate our approach and two pyramid extensions with state-ofthe-art performance on three semantic segmentation benchmarks: Cityscapes, ADE20K and LIP. Code has been made available at: https://github.com/PkuRainBow/ OCNet.pytorch.


RETOS: Resilient, Expandable, and Threaded Operating System for Wireless Sensor Networks

This paper presents the design principles, implementation, and evaluation of the RETOS operating system which is specifically developed for micro sensor nodes. RETOS has four distinct objectives, which are to provide (1) a multithreaded programming interface, (2) system resiliency, (3) kernel extensibility with dynamic reconfiguration, and (4) WSN-oriented network abstraction. RETOS is a multithreaded operating system, hence it provides the commonly used thread model of programming interface to developers. We have used various implementation techniques to optimize the performance and resource usage of multithreading. RETOS also provides software solutions to separate kernel from user applications, and supports their robust execution on MMU-less hardware. The RETOS kernel can be dynamically reconfigured, via loadable kernel framework, so a application-optimized and resource-efficient kernel is constructed. Finally, the networking architecture in RETOS is designed with a layering concept to provide WSN-specific network abstraction. RETOS currently supports Atmel ATmega128, TI MSP430, and Chipcon CC2430 family of microcontrollers. Several real-world WSN applications are developed for RETOS and the overall evaluation of the systems is described in the paper.


MRTouch: Adding Touch Input to Head-Mounted Mixed Reality

We present MRTouch, a novel multitouch input solution for head-mounted mixed reality systems. Our system enables users to reach out and directly manipulate virtual interfaces affixed to surfaces in their environment, as though they were touchscreens. Touch input offers precise, tactile and comfortable user input, and naturally complements existing popular modalities, such as voice and hand gesture. Our research prototype combines both depth and infrared camera streams together with real-time detection and tracking of surface planes to enable robust finger-tracking even when both the hand and head are in motion. Our technique is implemented on a commercial Microsoft HoloLens without requiring any additional hardware nor any user or environmental calibration. Through our performance evaluation, we demonstrate high input accuracy with an average positional error of 5.4 mm and 95% button size of 16 mm, across 17 participants, 2 surface orientations and 4 surface materials. Finally, we demonstrate the potential of our technique to enable on-world touch interactions through 5 example applications.


Aneka Cloud Application Platform and Its Integration with Windows Azure

Aneka is an Application Platform-as-a-Service (Aneka PaaS) for Cloud Computing. It acts as a framework for building customized applications and deploying them on either public or private Clouds. One of the key features of Aneka is its support for provisioning resources on different public Cloud providers such as Amazon EC2, Windows Azure and GoGrid. In this chapter, we will present Aneka platform and its integration with one of the public Cloud infrastructures, Windows Azure, which enables the usage of Windows Azure Compute Service as a resource provider of Aneka PaaS. The integration of the two platforms will allow users to leverage the power of Windows Azure Platform for Aneka Cloud Computing, employing a large number of compute instances to run their applications in parallel. Furthermore, customers of the Windows Azure platform can benefit from the integration with Aneka PaaS by embracing the advanced features of Aneka in terms of multiple programming models, scheduling and management services, application execution services, accounting and pricing services and dynamic provisioning services. Finally, in addition to the Windows Azure Platform we will illustrate in this chapter the integration of Aneka PaaS with other public Cloud platforms such as Amazon EC2 and GoGrid, and virtual machine management platforms such as Xen Server. The new support of provisioning resources on Windows Azure once again proves the adaptability, extensibility and flexibility of Aneka.


Distributional Semantics Resources for Biomedical Text Processing

The openly available biomedical literature contains over 5 billion words in publication abstracts and full texts. Recent advances in unsupervised language processing methods have made it possible to make use of such large unannotated corpora for building statistical language models and inducing high quality vector space representations, which are, in turn, of utility in many tasks such as text classification, named entity recognition and query expansion. In this study, we introduce the first set of such language resources created from analysis of the entire available biomedical literature, including a dataset of all 1to 5-grams and their probabilities in these texts and new models of word semantics. We discuss the opportunities created by these resources and demonstrate their application. All resources introduced in this study are available under open licenses at http://bio.nlplab.org.


Optimization algorithm using scrum process

Scrum process is methodology for software development. Members in a scrum team have self-organizing team by planning and sharing knowledge. This paper introduces optimization algorithm using the population as scrum team doing the scrum process to find an optimum solution. The proposed algorithm maintains the level of exploration and the exploitation search by specific of the scrum-team. The experiment has compared the proposed approach with GA and PSO by finding an optimal solution of five numerical functions. The experiment result indicates that the proposed algorithm provides the best solution and finds the result quickly.


Evolving a Heuristic Function for the Game of Tetris


Relations Among Loneliness, Social Anxiety, and Problematic Internet Use

The model of problematic Internet use advanced and tested in the current study proposes that individuals' psychosocial well-being, along with their beliefs about interpersonal communication (both face-to-face and online) are important cognitive predictors of negative outcomes arising from Internet use. The study examined the extent to which social anxiety explains results previously attributed to loneliness as a predictor of preference for online social interaction and problematic Internet use. The results support the hypothesis that the relationship between loneliness and preference for online social interaction is spurious, and that social anxiety is the confounding variable.


The comorbid psychiatric symptoms of Internet addiction: attention deficit and hyperactivity disorder (ADHD), depression, social phobia, and hostility.

PURPOSE
To: (1) determine the association between Internet addiction and depression, self-reported symptoms of attention deficit and hyperactivity disorder (ADHD), social phobia, and hostility for adolescents; and (2) evaluate the sex differences of association between Internet addiction and the above-mentioned psychiatric symptoms among adolescents.

METHODS
A total of 2114 students (1204 male and 910 female) were recruited for the study. Internet addiction, symptoms of ADHD, depression, social phobia, and hostility were evaluated by the self-report questionnaire.

RESULTS
The results demonstrated that adolescents with Internet addiction had higher ADHD symptoms, depression, social phobia, and hostility. Higher ADHD symptoms, depression, and hostility are associated with Internet addiction in male adolescents, and only higher ADHD symptoms and depression are associated with Internet addiction in female students.

CONCLUSION
These results suggest that Internet addiction is associated with symptoms of ADHD and depressive disorders. However, hostility was associated with Internet addiction only in males. Effective evaluation of, and treatment for ADHD and depressive disorders are required for adolescents with Internet addiction. More attention should be paid to male adolescents with high hostility in intervention of Internet addiction.


Internet Addiction: The Emergence of a New Clinical Disorder

Anecdotal reports indicated that some on-line users were becoming addicted to the Internet in much that same way that others became addicted to drugs or alcohol which resulted in academic, social, and occupational impairment. However, research among sociologists, psychologists, or psychiatrists has not formally identified addictive use of the Internet as a problematic behavior. This study investigated the existence of Internet addiction and the extent of problems caused by such potential misuse. This study utilized an adapted version of the criteria for pathological gambling defined by the DSM-IV (APA, 1994). On the basis of this criteria, case studies of 396 dependent Internet users (Dependents) and a control group of 100 non-dependent Internet users (Non-Dependents) were classified. Qualitative analyses suggests significant behavioral and functional usage differences between the two groups. Clinical and social implications of pathological Internet use and future directions for research are discussed.


Internet addiction in Korean adolescents and its relation to depression and suicidal ideation: a questionnaire survey.

This study examined the relationship of Internet addiction to depression and suicidal ideation in Korean adolescents. The participants were 1573 high-school students living in a city who completed the self-reported measures of the Internet Addiction Scale, the Korean version of the Diagnostic Interview Schedule for Children-Major Depression Disorder-Simple Questionnaire, and the Suicidal Ideation Questionnaire-Junior. A correlational survey design was employed. Among the samples, 1.6% was diagnosed as Internet addicts, while 38.0% was classified as possible Internet addicts. The prevalence of Internet addiction did not vary with gender. The levels of depression and suicide ideation were highest in the Internet-addicts group. Future studies should investigate the direct relationship between psychological health problems and Internet dependency.


Internet addiction among Chinese adolescents: prevalence and psychological features.

BACKGROUND
To investigate the prevalence of Internet addiction among Chinese adolescents and to explore the psychological features associated with Internet addiction.

METHODS
A total of 2620 high school students from four high schools in Changsha City were surveyed using Diagnostic Questionnaire for Internet Addiction (YDQ), Eysenck Personality Questionnaire (the edition for children, EPQ), Time Management Disposition Scale (TMDS) and Strengths and Difficulties Questionnaire (SDQ). The mean age of whole sample was 15.19 years (ranging from 12 years to 18 years). According to the modified YDQ criteria by Beard, 64 students who were diagnosed as Internet addiction (the mean age: 14.59 years) and 64 who were diagnosed as being normal in Internet usage (the mean age: 14.81 years) were included in a case-control study.

RESULTS
The rate of Internet use among the surveyed adolescents was 88%, among which the incidence rate of Internet addiction was 2.4%. The Internet addiction group had significantly higher scores on the EPQ subscales of neuroticism, psychoticism, and lie than the control group (P < 0.05). The Internet addiction group scored lower than the control group on the TMDS subscales of sense of control over time, sense of value of time, and sense of time efficacy (P < 0.05). Compared with the control group, the Internet addiction group had also significantly higher scores on the SDQ subscales of emotional symptoms, conduct problems, hyperactivity, total difficulties and lower scores on the subscale of prosocial behaviours (P < 0.05).

CONCLUSIONS
The present study suggests that Internet addiction is not rare among Chinese adolescents. In addition, adolescents with Internet addiction possess different psychological features when compared with those who use the Internet less frequently.


Hardware resource estimation for heterogeneous FPGA-based SoCs

The increasing complexity of recent System-on-Chip (SoC) designs introduces new challenges for design space exploration tools. In addition to the time-to-market challenge, designers need to estimate rapidly and accurately both performance and area occupation of complex and diverse applications. High-Level Synthesis (HLS) has been emerged as an attractive solution for designers to address these challenges in order to explore a large number of SoC configurations. In this paper, we target hybrid CPU-FPGA based SoCs. We propose a high-level area estimation tool based on an analytic model without requiring register-transfer level (RTL) implementations. This technique allows to estimate the required FPGA resources at the source code level to map an application to a hybrid CPU-FPGA system. The proposed model also enables a fast design exploration with different trade-offs through HLS optimization pragmas. Experimental results show that the proposed area analytic model provides an accurate estimation with a negligible error (less than 5+) compared to RTL implementations.


No double-dissociation between optic ataxia and visual agnosia: Multiple sub-streams for multiple visuo-manual integrations

The current dominant view of the visual system is marked by the functional and anatomical dissociation between a ventral stream specialised for perception and a dorsal stream specialised for action. The "double-dissociation" between visual agnosia (VA), a deficit of visual recognition, and optic ataxia (OA), a deficit of visuo-manual guidance, considered as consecutive to ventral and dorsal damage, respectively, has provided the main argument for this dichotomic view. In the first part of this paper, we show that the currently available empirical data do not suffice to support a double-dissociation between OA and VA. In the second part, we review evidence coming from human neuropsychology and monkey data, which cast further doubts on the validity of a simple double-dissociation between perception and action because they argue for a far more complex organisation with multiple parallel visual-to-motor connections: 1. A dorso-dorsal pathway (involving the most dorsal part of the parietal and pre-motor cortices): for immediate visuo-motor control--with OA as typical disturbance. The latest research about OA is reviewed, showing how these patients exhibit deficits restricted to the most direct and fast visuo-motor transformations. We also propose that mild mirror ataxia, consisting of misreaching errors when the controlesional hand is guided to a visual goal though a mirror, could correspond to OA with an isolated "hand effect". 2. A ventral stream-prefrontal pathway (connections from the ventral visual stream to pre-frontal areas, by-passing the parietal areas): for "mediate" control (involving spatial or temporal transpositions [Rossetti, Y., & Pisella, L. (2003). Mediate responses as direct evidence for intention: Neuropsychology of Not to-, Not now- and Not there-tasks. In S. Johnson (Ed.), Cognitive Neuroscience perspectives on the problem of intentional action (pp. 67-105). MIT Press.])--with VA as typical disturbance. Preserved visuo-manual guidance in patients with VA is restricted to immediate goal-directed guidance, they exhibit deficits for delayed or pantomimed actions. 3. A ventro-dorsal pathway (involving the more ventral part of the parietal lobe and the pre-motor and pre-frontal areas): for complex planning and programming relying on high representational levels with a more bilateral organisation or an hemispheric lateralisation--with mirror apraxia, limb apraxia and spatial neglect as representatives. Mirror apraxia is a deficit that affects both hands after unilateral inferior parietal lesion with the patients reaching systematically and repeatedly toward the virtual image in the mirror. Limb apraxia is localized on a more advanced conceptual level of object-related actions and results from deficient integrative, computational and "working memory" capacities of the left inferior parietal lobule. A component of spatial working memory has recently been revealed also in spatial neglect consecutive to lesion involving the network of the right inferior parietal lobule and the right frontal areas. We conclude by pointing to the differential temporal constraints and integrative capabilities of these parallel visuo-motor pathways as keys to interpret the neuropsychological deficits.


Mechanisms of decompensation and organ failure in cirrhosis: From peripheral arterial vasodilation to systemic inflammation hypothesis.

The peripheral arterial vasodilation hypothesis has been most influential in the field of cirrhosis and its complications. It has given rise to hundreds of pathophysiological studies in experimental and human cirrhosis and is the theoretical basis of life-saving treatments. It is undisputed that splanchnic arterial vasodilation contributes to portal hypertension and is the basis for manifestations such as ascites and hepatorenal syndrome, but the body of research generated by the hypothesis has revealed gaps in the original pathophysiological interpretation of these complications. The expansion of our knowledge on the mechanisms regulating vascular tone, inflammation and the host-microbiota interaction require a broader approach to advanced cirrhosis encompassing the whole spectrum of its manifestations. Indeed, multiorgan dysfunction and failure likely result from a complex interplay where the systemic spread of bacterial products represents the primary event. The consequent activation of the host innate immune response triggers endothelial molecular mechanisms responsible for arterial vasodilation, and also jeopardizes organ integrity with a storm of pro-inflammatory cytokines and reactive oxygen and nitrogen species. Thus, the picture of advanced cirrhosis could be seen as the result of an inflammatory syndrome in contradiction with a simple hemodynamic disturbance.


Single Image Shadow Removal via Neighbor-Based Region Relighting

In this paper we present a novel method for shadow removal in single images. For each shadow region we use a trained classifier to identify a neighboring lit region of the same material. Given a pair of lit-shadow regions we perform a region relighting transformation based on histogram matching of luminance values between the shadow region and the lit region. Then, we adjust the CIELAB a and b channels of the shadow region by adding constant offsets based on the difference of the median shadow and lit pixel values. We demonstrate that our approach produces results that outperform the state of the art by evaluating our method using a publicly available benchmark dataset.


Electric grid state estimators for distribution systems with microgrids

In the development of smart grid, state estimation in distribution systems will likely face more challenges than that at the transmission level. This paper addresses one of such challenges, namely, the absence of topology information, by developing a forecast-aided topology change detection method and an event-triggered recursive Bayesian estimator to identify the correct topology. Simulation studies with microgrid induced changes are presented to illustrate the effectiveness of the proposed algorithm.


Thumb Motor Performance Varies by Movement Orientation, Direction, and Device Size During Single-Handed Mobile Phone Use

OBJECTIVE
The aim of this study was to determine if thumb motor performance metrics varied by movement orientation, direction, and device size during single-handed use of a mobile phone device.

BACKGROUND
With the increased use of mobile phones, understanding how design factors affect and improve performance can provide better design guidelines.

METHOD
A repeated measures laboratory experiment of 20 right-handed participants measured the thumb tip's 3-D position relative to a phone during reciprocal tapping tasks across four phone designs and four thumb tip movement orientations. Each movement orientation included two movement directions: an "outward" direction consisting in CMC (carpometacarpal) joint flexion or abduction movements and an "inward" direction consisting in CMC joint extension or adduction movements. Calculated metrics of the thumb's motor performance were Fitts' effective width and index of performance.

RESULTS
Index of performance varied significantly across phones, with performance being generally better for the smaller devices. Performance was also significantly higher for adduction-abduction movement orientations compared to flexion-extension, and for "outward" compared to "inward" movement directions.

CONCLUSION
For single-handed device use, adduction-abduction-type movements on smaller phones lead to better thumb performance.

APPLICATION
The results from this study can be used to design new mobile phone devices and keypad interfaces that optimize specific thumb motions to improve the user-interface experience during single-handed use.


Elliptic Curve Cryptosystems

The application of elliptic curves to the field of cryptography has been relatively recent. It has opened up a wealth of possibilities in terms of security, encryption, and real-world applications. In particular, we are interested in public-key cryptosystems that use the elliptic curve discrete logarithm problem to establish security. The objective of this thesis is to assemble the most important facts and findings into a broad, unified overview of this field. To illustrate certain points, we also discuss a sample implementation of the elliptic curve analogue of the El


Electronic Payments of Small Amounts

This note considers the application of electronic cash to transactions in which many small amounts must be paid to the same payee and in which it is not possible to just pay the total amount afterwards. The most notable example of such a transaction is payment for phone calls. If currently published electronic cash systems are used and a full payment protocol is executed for each of the small amounts, the overall complexity of the system will be prohibitively large (time, storage and communication). This note describes how such payments can be handled in a wide class of payment systems. The solution is very easy to adapt as it only in uences the payment and deposit transactions involving such payments. Furthermore, making and verifying each small payment requires very little computation and communication, and the total complexity of both transactions is comparable to that of a payment of a xed amount.


A 25-kHz 3rd-order continuous-time Delta-Sigma modulator using tri-level quantizer

This paper presents a 3rd order continuous-time Delta-Sigma modulator with a tri-level quantizer, which provides 3-dB reduction of quantization noise without dynamic element matching (DEM). The tri-level DAC linearity is analyzed and it shows that a highly linear tri-level DAC can be realized in fully-differential active-RC Delta-Sigma modulator. The performance of the tri-level continuous-time Delta-Sigma modulator has been verified through simulations using a standard 0.18-μm CMOS process. It achieves 81-dB SNDR at 3.2-MS/s sampling rate and consumes 1.14-μW power with ideal amplifier.


Finding a Maximum Clique using Ant Colony Optimization and Particle Swarm Optimization in Social Networks

Interaction between users in online social networks plays a key role in social network analysis. One on important types of social group is full connected relation between some users, which known as clique structure. Therefore finding a maximum clique is essential for some analysis. In this paper, we proposed a new method using ant colony optimization algorithm and particle swarm optimization algorithm. In the proposed method, in order to attain better results, it is improved process of pheromone update by particle swarm optimization. Simulation results on popular standard social network benchmarks in comparison standard ant colony optimization algorithm are shown a relative enhancement of proposed algorithm. Keywordssocial network analysis; clique problem; ACO; PSO.


Surgical Management of Hidradenitis Suppurativa: Outcomes of 590 Consecutive Patients.

BACKGROUND
Hidradenitis suppurativa is a progressive, recurrent inflammatory disease. Surgical management is potentially curative with limited efficacy data.

OBJECTIVE
To evaluate hidradenitis surgical patients.

METHODS
Retrospective review of outcomes of 590 consecutive surgically treated patients.

RESULTS
Most patients were white (91.0% [435/478]), men (337 [57.1%]), smokers (57.7% [297/515]) with Hurley Stage III disease (476 [80.7%]). Procedure types were excision (405 [68.6%]), unroofing (168 [28.5%]), and drainage (17 [2.9%]) treating disease of perianal/perineum (294 [49.8%]), axilla (124 [21.0%]), gluteal cleft (76 [12.9%]), inframammary (12 [2.0%]), and multiple surgical sites (84 [14.2%]). Postoperative complications occurred in 15 patients (2.5%) and one-fourth (144 [24.4%]) suffered postoperative recurrence, which necessitated reoperation in one-tenth (69 [11.7%]) of patients. Recurrence risk was increased by younger age (hazard ratio [HR], 0.8; 95% confidence interval [CI], 0.7-0.9), multiple surgical sites (HR, 1.6; 95% CI, 1.1-2.5), and drainage-type procedures (HR, 3.5; 95% CI, 1.2-10.7). Operative location, disease severity, gender, and operative extent did not influence recurrence rate.

CONCLUSION
Excision and unroofing procedures were effective treatments with infrequent complications and low recurrence rates. Well-planned surgical treatment aiming to remove or unroof the area of intractable hidradenitis suppurativa was highly effective in the management of this challenging disease.


Analysis of Massive MIMO-Enabled Downlink Wireless Backhauling for Full-Duplex Small Cells

Recent advancements in self-interference (SI) cancellation capability of low-power wireless devices motivate in-band full-duplex (FD) wireless backhauling in small cell networks (SCNs). In-band FD wireless backhauling concurrently allows the use of the same frequency spectrum for the backhaul as well as access links of the small cells. In this paper, using tools from stochastic geometry, we develop a framework to model the downlink rate coverage probability of a user in a given SCN with massive multiple-input-multiple-output (MIMO)-enabled wireless backhauls. The considered SCN is composed of a mixture of small cells that are configured in either in-band or out-of-band backhaul modes with a certain probability. The performance of the user in the considered hierarchical network is limited by several sources of interference, such as the backhaul interference, small cell base station (SBS)-to-SBS interference, and the SI. Moreover, due to the channel hardening effect in massive MIMO, the backhaul links only experience long term channel effects, whereas the access links experience both the long term and the short term channel effects. Consequently, the developed framework is flexible to characterize different sources of interference while capturing the heterogeneity of the access and backhaul channels. In specific scenarios, the framework enables deriving closed-form coverage probability expressions. Under perfect backhaul coverage, the simplified expressions are utilized to optimize the proportion of in-band and out-of-band small cells in the SCN in the closed form. Finally, a few remedial solutions are proposed that can potentially mitigate the backhaul interference and in turn improve the performance of in-band FD wireless backhauling. Numerical results investigate the scenarios in which in-band wireless backhauling is useful and demonstrate that maintaining a correct proportion of in-band and out-of-band FD small cells is crucial in wireless backhauled SCNs.


Applications of Trajectory Data in Transportation: Literature Review and Maryland Case Study

This paper considers applications of trajectory data in transportation, and makes two primary contributions. First, it provides a comprehensive literature review detailing ways in which trajectory data has been used for transportation systems analysis, distilling existing research into the following six areas: demand estimation, modeling human behavior, designing public transit, measuring and predicting traffic performance, quantifying environmental impact, and safety analysis. Additionally, it presents innovative applications of trajectory data for the state of Maryland, employing visualization and machine learning techniques to extract value from 20 million GPS traces. These visual analytics will be implemented in the Regional Integrated Transportation Information System (RITIS), which provides free data sharing and visual analytics tools to help transportation agencies attain situational awareness, evaluate performance, and share insights with the public.


Smart Health Care: An Edge-Side Computing Perspective

Increasing health awareness and rapid technological advancements have resulted in significant growth in an emerging sector: smart health care. By the end of 2020, the total number of smart health-care devices is expected to reach 808.9 million (646 million devices without wearables and the remaining with wearables) [1], [2]. This proliferation of devices is expected to revolutionize health care by speeding up treatment and diagnostic processes, decreasing physician visit costs, and enhancing patient care quality.


Hand segmentation for hand-object interaction from depth map

Hand segmentation for hand-object interaction is a necessary preprocessing step in many applications such as augmented reality, medical application, and human-robot interaction. However, typical methods are based on color information which is not robust to objects with skin color, skin pigment difference, and light condition variations. Thus, we propose hand segmentation method for hand-object interaction using only a depth map. It is challenging because of the small depth difference between a hand and objects during an interaction. To overcome this challenge, we propose the two-stage random decision forest (RDF) method consisting of detecting hands and segmenting hands. To validate the proposed method, we demonstrate results on the publicly available dataset of hand segmentation for hand-object interaction. The proposed method achieves high accuracy in short processing time comparing to the other state-of-the-art methods.


Finding News Citations for Wikipedia

An important editing policy in Wikipedia is to provide citations for added statements in Wikipedia pages, where statements can be arbitrary pieces of text, ranging from a sentence to a paragraph. In many cases citations are either outdated or missing altogether.
 In this work we address the problem of finding and updating news citations for statements in entity pages. We propose a two-stage supervised approach for this problem. In the first step, we construct a classifier to find out whether statements need a news citation or other kinds of citations (web, book, journal, etc.). In the second step, we develop a news citation algorithm for Wikipedia statements, which recommends appropriate citations from a given news collection. Apart from IR techniques that use the statement to query the news collection, we also formalize three properties of an appropriate citation, namely: (i) the citation should entail the Wikipedia statement, (ii) the statement should be central to the citation, and (iii) the citation should be from an authoritative source.
 We perform an extensive evaluation of both steps, using 20 million articles from a real-world news collection. Our results are quite promising, and show that we can perform this task with high precision and at scale.


A Modular Framework for Versatile Conversational Agent Building

This paper illustrates a web-based infrastructure of an architecture for conversational agents equipped with a modular knowledge base. This solution has the advantage to allow the building of specific modules that deal with particular features of a conversation (ranging from its topic to the manner of reasoning of the chatbot). This enhances the agent interaction capabilities. The approach simplifies the chatbot knowledge base design process: extending, generalizing or even restricting the chatbot knowledge base in order to suit it to manage specific dialoguing tasks as much as possible.


ERP integration in a healthcare environment: a case study


Evaluating the influence of YouTube advertising for attraction of young customers

Nowadays, we have been faced with an increasing number of people who are spending tremendous amounts of time all around the world on YouTube. To date, the factors that persuade customers to accept YouTube advertising as an advertising medium are not yet fully understood. The present paper identified four dimensions towards YouTube advertising (i.e., entertainment, Informativeness, Customization and irritation) which may be affected on advertising value as well as brand awareness, and accordingly on purchase intention of consumers. The conceptual model hypothesizes that ad value strategies are positively associated with brand awareness, which in turn influence perceived usefulness of You Tube and continued purchase behavior. For this study, data were collected from students studying at the Sapienza University of Rome. In total, 315 usable questionnaires were chosen in order to analysis of data for the variables. The results show that entertainment, informativeness and customization are the strongest positive drivers, while irritation is negatively related to YouTube advertising. On the other hand, advertising value through YouTube affects both brand awareness and purchase intention of con-


Embedding new data points for manifold learning via coordinate propagation

In recent years, a series of manifold learning algorithms have been proposed for nonlinear dimensionality reduction. Most of them can run in a batch mode for a set of given data points, but lack a mechanism to deal with new data points. Here we propose an extension approach, i.e., mapping new data points into the previously learned manifold. The core idea of our approach is to propagate the known coordinates to each of the new data points. We first formulate this task as a quadratic programming, and then develop an iterative algorithm for coordinate propagation. Tangent space projection and smooth splines are used to yield an initial coordinate for each new data point, according to their local geometrical relations. Experimental results and applications to camera direction estimation and face pose estimation illustrate the validity of our approach.


Automated segmentation of 3D anatomical structures on CT images by using a deep convolutional network based on end-to-end learning approach

We have proposed an end-to-end learning approach that trained a deep convolutional neural network (CNN) for automatic CT image segmentation, which accomplished a voxel-wised multiple classification to directly map each voxel on 3D CT images to an anatomical label automatically. The novelties of our proposed method were (1) transforming the anatomical structures segmentation on 3D CT images into a majority voting of the results of 2D semantic image segmentation on a number of 2D-slices from different image orientations, and (2) using “convolution” and “deconvolution” networks to achieve the conventional “coarse recognition” and “fine extraction” functions which were integrated into a compact all-in-one deep CNN for CT image segmentation. The advantage comparing to previous works was its capability to accomplish real-time image segmentations on 2D slices of arbitrary CT-scan-range (e.g. body, chest, abdomen) and produced correspondingly-sized output. In this paper, we propose an improvement of our proposed approach by adding an organ localization module to limit CT image range for training and testing deep CNNs. A database consisting of 240 3D CT scans and a human annotated ground truth was used for training (228 cases) and testing (the remaining 12 cases). We applied the improved method to segment pancreas and left kidney regions, respectively. The preliminary results showed that the accuracies of the segmentation results were improved significantly (pancreas was 34% and kidney was 8% increased in Jaccard index from our previous results). The effectiveness and usefulness of proposed improvement for CT image segmentations were confirmed.


Preserving the Archival Bond in Distributed Ledgers: A Data Model and Syntax

Distributed cryptographic ledgers, such as the blockchain, are now being used in recordkeeping. However, they lack a key feature of more traditional recordkeeping systems needed to establish the authenticity of records and enable reliance on them for trustworthy recordkeeping. The missing feature is known in archival science as the archival bond – the mutual relationship that exists among documents by virtue of the actions in which they participate. In this paper, we propose a novel data model and syntax using core web principles that can be used to address this shortcoming in distributed ledgers as recordkeeping systems.


Fast and accurate scan registration through minimization of the distance between compact 3D NDT representations

Registration of range sensor measurements is an important task in mobile robotics and has received a lot of attention. Several iterative optimization schemes have been proposed in order to align three-dimensional (3D) point scans. With the more widespread use of high-frame-rate 3D sensors and increasingly more challenging application scenarios for mobile robots, there is a need for fast and accurate registration methods that current state-of-the-art algorithms cannot always meet. This work proposes a novel algorithm that achieves accurate point cloud registration an order of a magnitude faster than the current state of the art. The speedup is achieved through the use of a compact spatial representation: the Three-Dimensional Normal Distributions Transform (3D-NDT). In addition, a fast, global-descriptor based on the 3D-NDT is defined and used to achieve reliable initial poses for the iterative algorithm. Finally, a closed-form expression for the covariance of the proposed method is also derived. The proposed algorithms are evaluated on two standard point cloud data sets, resulting in stable performance on a par with or better than the state of the art. The implementation is available as an open-source package for the Robot Operating System (ROS).


Optimized Spatial Hashing for Collision Detection of Deformable Objects

We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to represent volumetric deformable models and the presented algorithm is integrated in a physically–based environment, which can be used in game engines and surgical simulators. The proposed algorithm employs a hash function for compressing a potentially infinite regular spatial grid. Although the hash function does not always provide a unique mapping of grid cells, it can be generated very efficiently and does not require complex data structures, such as octrees or BSPs. We have investigated and optimized the parameters of the collision detection algorithm, such as hash function, hash table size and spatial cell size. The algorithm can detect collisions and self– collisions in environments of up to 20k tetrahedrons in real–time. Although the algorithm works with tetrahedral meshes, it can be easily adapted to other object primitives, such as triangles. Figure 1: Environment with dynamically deforming objects, that consist of tetrahedrons.


Effects of cognitive-behavioral therapy on brain activation in specific phobia

Little is known about the effects of successful psychotherapy on brain function in subjects with anxiety disorders. The present study aimed to identify changes in brain activation following cognitive-behavioral therapy (CBT) in subjects suffering from specific phobia. Using functional magnetic resonance imaging (fMRI), brain activation to spider videos was measured in 28 spider phobic and 14 healthy control subjects. Phobics were randomly assigned to a therapy-group (TG) and a waiting-list control group (WG). Both groups of phobics were scanned twice. Between scanning sessions, CBT was given to the TG. Before therapy, brain activation did not differ between both groups of phobics. As compared to control subjects, phobics showed greater responses to spider vs. control videos in the insula and anterior cingulate cortex (ACC). CBT strongly reduced phobic symptoms in the TG while the WG remained behaviorally unchanged. In the second scanning session, a significant reduction of hyperactivity in the insula and ACC was found in the TG compared to the WG. These results propose that increased activation in the insula and ACC is associated with specific phobia, whereas an attenuation of these brain responses correlates with successful therapeutic intervention.


Identifying Relations for Open Information Extraction

Open Information Extraction (IE) is the task of extracting assertions from massive corpora without requiring a pre-specified vocabulary. This paper shows that the output of state-ofthe-art Open IE systems is rife with uninformative and incoherent extractions. To overcome these problems, we introduce two simple syntactic and lexical constraints on binary relations expressed by verbs. We implemented the constraints in the REVERB Open IE system, which more than doubles the area under the precision-recall curve relative to previous extractors such as TEXTRUNNER and WOE. More than 30% of REVERB’s extractions are at precision 0.8 or higher— compared to virtually none for earlier systems. The paper concludes with a detailed analysis of REVERB’s errors, suggesting directions for future work.1


Multilingual Relation Extraction using Compositional Universal Schema

When building a knowledge base (KB) of entities and relations from multiple structured KBs and text, universal schema represents the union of all input schema, by jointly embedding all relation types from input KBs as well as textual patterns expressing relations. In previous work, textual patterns are parametrized as a single embedding, preventing generalization to unseen textual patterns. In this paper we employ an LSTM to compositionally capture the semantics of relational text. We dramatically demonstrate the flexibility of our approach by evaluating in a multilingual setting, in which the English training data entities overlap with the seed KB, but the Spanish text does not. Additional improvements are obtained by tying word embeddings across languages. In extensive experiments on the English and Spanish TAC KBP benchmark, our techniques provide substantial accuracy improvements. Furthermore we find that training with the additional non-overlapping Spanish also improves English relation extraction accuracy. Our approach is thus suited to broad-coverage automated knowledge base construction in low-resource languages and domains.


Spark: Cluster Computing with Working Sets

MapReduce and its variants have been highly successful in implementing large-scale data-intensive applications on commodity clusters. However, most of these systems are built around an acyclic data flow model that is not suitable for other popular applications. This paper focuses on one such class of applications: those that reuse a working set of data across multiple parallel operations. This includes many iterative machine learning algorithms, as well as interactive data analysis tools. We propose a new framework called Spark that supports these applications while retaining the scalability and fault tolerance of MapReduce. To achieve these goals, Spark introduces an abstraction called resilient distributed datasets (RDDs). An RDD is a read-only collection of objects partitioned across a set of machines that can be rebuilt if a partition is lost. Spark can outperform Hadoop by 10x in iterative machine learning jobs, and can be used to interactively query a 39 GB dataset with sub-second response time.


GENIES: a natural-language processing system for the extraction of molecular pathways from journal articles

Systems that extract structured information from natural language passages have been highly successful in specialized domains. The time is opportune for developing analogous applications for molecular biology and genomics. We present a system, GENIES, that extracts and structures information about cellular pathways from the biological literature in accordance with a knowledge model that we developed earlier. We implemented GENIES by modifying an existing medical natural language processing system, MedLEE, and performed a preliminary evaluation study. Our results demonstrate the value of the underlying techniques for the purpose of acquiring valuable knowledge from biological journals.


A Convolutional Neural Network for Modelling Sentences

The ability to accurately represent sentences is central to language understanding. We describe a convolutional architecture dubbed the Dynamic Convolutional Neural Network (DCNN) that we adopt for the semantic modelling of sentences. The network uses Dynamic k-Max Pooling, a global pooling operation over linear sequences. The network handles input sentences of varying length and induces a feature graph over the sentence that is capable of explicitly capturing short and long-range relations. The network does not rely on a parse tree and is easily applicable to any language. We test the DCNN in four experiments: small scale binary and multi-class sentiment prediction, six-way question classification and Twitter sentiment prediction by distant supervision. The network achieves excellent performance in the first three tasks and a greater than 25% error reduction in the last task with respect to the strongest baseline.


DeepTLR: A single deep convolutional network for detection and classification of traffic lights

Reliable real-time detection of traffic lights is a major concern for the task of autonomous driving. As deep convolutional networks have proven to be a powerful tool in visual object detection, we propose DeepTLR, a camera-based system for real-time detection and classification of traffic lights. Detection and state classification are realized using a single deep convolutional network. DeepTLR does not use any prior knowledge about traffic light locations. Also the detection is executed frame by frame without using temporal information. It is able to detect traffic lights on the whole camera image without any presegmentation. This is achieved by classifying each fine-grained pixel region of the input image and performing a bounding box regression on regions of each class. We show that our algorithm is able to run on frame-rates required for real-time applications while reaching notable results.


Integration of Radio Frequency Identification and Wireless Sensor Networks

.................................................................................................................... iii ÖZ ...................................................................................................................................... v DEDICATION ................................................................................................................ vii ACKNOWLEDGMENTS ............................................................................................. viii LIST OF TABLES .......................................................................................................... xii LIST OF FIGURES ....................................................................................................... xiii LIST OF SYMBOLS/ABBREVIATIONS ...................................................................... xv


Low-k interconnect stack with a novel self-aligned via patterning process for 32nm high volume manufacturing

Interconnect process features are described for a 32nm high performance logic technology. Lower-k, yet highly manufacturable, Carbon-Doped Oxide (CDO) dielectric layers are introduced on this technology at three layers to address the demand for ever lower metal line capacitance. The pitches have been aggressively scaled to meet the expectation for density, and the metal resistance and electromigration performance have been carefully balanced to meet the high reliability requirements while maintaining the lowest possible resistance. A new patterning scheme has been used to limit any patterning damage to the lower-k ILD and address the increasingly difficult problem of via-to-metal shorting at these very tight pitches. The interconnect stack has a thick Metal-9 layer to provide a low resistance path for the power and I/O routing that has been carefully scaled to maintain a low resistance. The combined interconnect stack provides high density, performance, and reliability, and supports a Pb-free 32nm process.


Timing Attack against Protected RSA-CRT Implementation Used in PolarSSL

In this paper, we present a timing attack against the RSACRT algorithm used in the current version 1.1.4 of PolarSSL, an opensource cryptographic library for embedded systems. This implementation uses a classical countermeasure to avoid two previous attacks of Schindler and another one due to Boneh and Brumley. However, a careful analysis reveals a bias in the implementation of Montgomery multiplication. We theoretically analyse the distribution of output values for Montgomery multiplication when the output is greater than the Montgomery constant, R. In this case, we show that an extra bit is set in the top most significant word of the output and a time variance can be observed. Then we present some proofs with reasonable assumptions to explain this bias due to an extra bit. Moreover, we show it can be used to mount an attack that reveals the factorisation. We also study another countermeasure and show its resistance against attacked library.


Haptic Feedback for Virtual Reality 1

Haptic feedback is a crucial sensorial modality in virtual reality interactions. Haptics means both force feedback (simulating object hardness, weight, and inertia) and tactile feedback (simulating surface contact geometry, smoothness, slippage, and temperature). Providing such sensorial data requires desk-top or portable special-purpose hardware called haptic interfaces. Modeling physical interactions involves precise collision detection, real-time force computation, and high control-loop bandwidth. This results in a large computation load which requires multi-processor parallel processing on networked computers. Applications for haptics-intensive VR simulations include CAD model design and assembly. Improved technology (wearable computers, novel actuators, haptic toolkits) will increase the use of force/tactile feedback in future VR simulations.


DFT-based Transformation Invariant Pooling Layer for Visual Classification

We propose a novel discrete Fourier transform-based pooling layer for convolutional neural networks. The DFT magnitude pooling replaces the traditional max/average pooling layer between the convolution and fully-connected layers to retain translation invariance and shape preserving (aware of shape difference) properties based on the shift theorem of the Fourier transform. Thanks to the ability to handle image misalignment while keeping important structural information in the pooling stage, the DFT magnitude pooling improves the classification accuracy significantly. In addition, we propose the DFT method for ensemble networks using the middle convolution layer outputs. The proposed methods are extensively evaluated on various classification tasks using the ImageNet, CUB 2010-2011, MIT Indoors, Caltech 101, FMD and DTD datasets. The AlexNet, VGG-VD 16, Inception-v3, and ResNet are used as the base networks, upon which DFT and DFT methods are implemented. Experimental results show that the proposed methods improve the classification performance in all networks and datasets.


A systematic literature review of green software metrics

Green IT is getting increasing attention in software engineering research. Nevertheless energy efficiency studies have mostly focused on the hardware side of IT, the software role still requires deepening in terms of methods and techniques. Furthermore, it is necessary to understand how to assess the software“greenness” for stimulating the energy efficiency awareness, since early phases of the software lifecycle. The main goal of this study is to describe and to classify metrics related to software “greenness” present in the software engineering literature. Furthermore, this study analyzes the evolution of those metrics, in terms of type, context, and evaluation methods. To achieve this goal, a systematic literature review has been performed surveying the metrics claimed in the last decade. After examined 960 publications, we selected 23 of them as primary studies, from which we isolated extracting 96 different green metrics. Therefore, we analyzed search results in order to show what is the trend of research about green software metrics, how metrics perform measurement on resources, and what type of metrics are more appealing for defined contexts.


Artificial-Life Ecosystems - What are they and what could they become?

This paper summarises the history of the terms ecology and ecosystem, before examining their application in the early and recent literature of A-Life agent-based software simulation. It investigates trends in A-Life that have led to a predominance of simulations incorporating artificial evolution acting on generic agents, but lacking a level of detail that would allow the emergence of phenomena relating to the transfer and transformation of energy and matter between the virtual abiotic environment and biota. Implications of these characteristics for the relevance of A-Life’s virtual ecosystem models to Ecology are discussed. We argue a position that the inclusion of low-level representations of energetics, matter and evolution, in concert with pattern-oriented modelling techniques from Ecology for model validation, will improve the relevance of A-Life models to Ecology. We also suggest two methods that may allows us to meet this goal: artificial evolution can be employed as a mechanism for automating pattern-oriented ecological modelling from the level of individual species up to that of the ecosystem, or it may be employed to explore general principles of ecosystem behaviour over evolutionary time periods.


Pulse-Modulated Intermittent Control in Consensus of Multiagent Systems

This paper proposes a control framework, called pulse-modulated intermittent control, which unifies impulsive control and sampled control. Specifically, the concept of pulse function is introduced to characterize the control/rest intervals and the amplitude of the control. By choosing some specified functions as the pulse function, the proposed control scheme can be reduced to sampled control or impulsive control. The proposed control framework is applied to consensus problems of multiagent systems. Using discretization approaches and stability theory, several necessary and sufficient conditions are established to ensure the consensus of the controlled system. The results show that consensus depends not only on the network topology, the sampling period and the control gains, but also the pulse function. Moreover, a lower bound of the asymptotic convergence factor is derived as well. For a given pulse function and an undirected graph, an optimal control gain is designed to achieve the fastest convergence. In addition, impulsive control and sampled control are revisited in the proposed control framework. Finally, some numerical examples are given to verify the effectiveness of theoretical results.


Weighted Low-Rank Approximations

Weighted-norms can arise in several situations. A zero/one weighted-norm, for example, arises when some of the entries in the matrix are not observed. External estimates of the noise variance associated with each measurement may be available (e.g. gene expression analysis) and using weights inversely proportional to the noise variance can lead to better reconstruction of the underlying structure. In other applications, entries in the target matrix represent aggregates of many samples. When using unweighted low-rank approximations (e.g. for separating style and content [4]), we assume a uniform number of samples for each entry. By incorporating weights, we can account for varying numbers of samples in such situations. Low-rank approximations are also used in the design of two-dimensional digital filters, in which case weights might arise from constraints of varying importance [3].


The validity of the Hospital Anxiety and Depression Scale. An updated literature review.

OBJECTIVE
To review the literature of the validity of the Hospital Anxiety and Depression Scale (HADS).

METHOD
A review of the 747 identified papers that used HADS was performed to address the following questions: (I) How are the factor structure, discriminant validity and the internal consistency of HADS? (II) How does HADS perform as a case finder for anxiety disorders and depression? (III) How does HADS agree with other self-rating instruments used to rate anxiety and depression?

RESULTS
Most factor analyses demonstrated a two-factor solution in good accordance with the HADS subscales for Anxiety (HADS-A) and Depression (HADS-D), respectively. The correlations between the two subscales varied from.40 to.74 (mean.56). Cronbach's alpha for HADS-A varied from.68 to.93 (mean.83) and for HADS-D from.67 to.90 (mean.82). In most studies an optimal balance between sensitivity and specificity was achieved when caseness was defined by a score of 8 or above on both HADS-A and HADS-D. The sensitivity and specificity for both HADS-A and HADS-D of approximately 0.80 were very similar to the sensitivity and specificity achieved by the General Health Questionnaire (GHQ). Correlations between HADS and other commonly used questionnaires were in the range.49 to.83.

CONCLUSIONS
HADS was found to perform well in assessing the symptom severity and caseness of anxiety disorders and depression in both somatic, psychiatric and primary care patients and in the general population.


An automated system to detect and recognize vehicle license plates of Bangladesh

Bangladesh is a country in South Asia that uses Retro Reflective license plates. The plate has two lines with words, letters, and digits. An automated system to detect and recognize these plates is presented in this paper. The system is divided into four parts: plate detection, extraction, character segmentation and recognition. At first, the input image is enhanced using CLAHE and a matched filter specially designed for license plates with two lines is applied. Then tilt correction using Radon transformation, binarization and cleaning are performed. For character segmentation, mean intensity based horizontal and vertical projection is used. In recognition, we have used two different Convolutional Neural Network (CNN) to classify digits and letters. Tesseract OCR is used for district names. We have developed a dataset of over 400 images of different vehicles (e.g., private car, bus, truck etc.) taken at different times of day (including nights). The plates in this dataset are in different angles, including blurry, worn-out and muddy ones. On this dataset, the proposed system achieved a success rate of 96.8% in detection, 89.5% in extraction, 98.6% in segmentation and 98.0% in character recognition.


Text Mining for Documents Annotation and Ontology Support

This paper presents a survey of basic concepts in the area of text data mining and some of the methods used in order to elicit useful knowledge from collections of textual data. Three different text data mining techniques (clustering/visualisation, association rules and classification models) are analysed and its exploitation possibilities within the Webocracy project are showed. Clustering and association rules discovery are well suited as supporting tools for ontology management. Classification models are used for automatic documents annotation.


Encouraging user behaviour with achievements: An empirical study

Stack Overflow, a question and answer Web site, uses a reward system called badges to publicly reward users for their contributions to the community. Badges are used alongside a reputation score to reward positive behaviour by relating a user's site identity with their perceived expertise and respect in the community. A greater number of badges associated with a user profile in some way indicates a higher level of authority, leading to a natural incentive for users to attempt to achieve as many badges as possible. In this study, we examine the publicly available logs for Stack Overflow to examine three of these badges in detail. We look at the effect of one badge in context on an individual user level and at the global scope of three related badges across all users by mining user behaviour around the time that the badge is awarded. This analysis supports the claim that badges can be used to influence user behaviour by demonstrating one instance of an increase in user activity related to a badge immediately before it is awarded when compared to the period afterwards.


Implicit theories about willpower predict self-regulation and grades in everyday life.

Laboratory research shows that when people believe that willpower is an abundant (rather than highly limited) resource they exhibit better self-control after demanding tasks. However, some have questioned whether this "nonlimited" theory leads to squandering of resources and worse outcomes in everyday life when demands on self-regulation are high. To examine this, we conducted a longitudinal study, assessing students' theories about willpower and tracking their self-regulation and academic performance. As hypothesized, a nonlimited theory predicted better self-regulation (better time management and less procrastination, unhealthy eating, and impulsive spending) for students who faced high self-regulatory demands. Moreover, among students taking a heavy course load, those with a nonlimited theory earned higher grades, which was mediated by less procrastination. These findings contradict the idea that a limited theory helps people allocate their resources more effectively; instead, it is people with the nonlimited theory who self-regulate well in the face of high demands.


Enabling network programmability in LTE/EPC architecture using OpenFlow

Nowadays, mobile operators face the challenge to sustain the future data tsunami. In fact, today's increasing data and control traffic generated by new kinds of network usage puts strain on mobile operators', without creating any corresponding equivalent revenue. In our previous work, we analyzed the 3GPP LTE/EPC architecture and showed that a redesign of this architecture is needed to suit future network usages and to provide new revenue generating services. Moreover, we proposed a new control plane based on the OpenFlow (OF) protocol for the LTE/EPC architecture that enables flexibility and programmability aspects. In this paper, we are interested in the programmability aspect. We show how the data plane can be easily configured thanks to OF. In addition, we evaluate the signaling load of our proposed architecture and compare it to that of 3GPP LTE/EPC architecture. The preliminary findings suggest that managing the data plane with OF has little impact on the signaling load while the network programmability is improved.


The Behavioural Paths to Wellbeing : An Exploratory Study to Distinguish Between Hedonic and Eudaimonic Wellbeing From an Activity Perspective

Hedonic wellbeing and eudaimonic wellbeing are two prevailing approaches to wellbeing. However, remarkably little research has distinguished them from an activity perspective; the knowledge of behavioural paths for achieving these two wellbeings is poor. This study first clarified the behavioural contents of the two approaches through a bottom-up method and then analysed the representativeness of activities to indicate to what extent activities contributed to wellness. We found that the paths to hedonic wellbeing and eudaimonic wellbeing overlapped and differed from each other. Furthermore, this study explained why hedonic activity differed from eudaimonic activity by analysing activity characteristics. We found that people reported higher frequency, sensory experience, and affective experience in hedonic activity, whereas they reported higher intellectual experience, behavioural experience, and spiritual experience in eudaimonic activity. Finally, we explored the behavioural pattern of wellbeing pursuit in both an unthreatening situation and a threatening situation. We found that the overlap between the two approaches increased in the threatening situation. Moreover, people in the threatening situation tended to score lower on all characteristics except frequency relative to those in the unthreatening situation. It seemed that the behavioural pattern in the threatening situation was less effective than its equivalent in the unthreatening situation.


Unsupervised outlier detection in streaming data using weighted clustering

Outlier detection is a very important task in many fields like network intrusion detection, credit card fraud detection, stock market analysis, detecting outlying cases in medical data etc. Outlier detection in streaming data is very challenging because streaming data cannot be scanned multiple times and also new concepts may keep evolving in coming data over time. Irrelevant attributes can be termed as noisy attributes and such attributes further magnify the challenge of working with data streams. In this paper, we propose an unsupervised outlier detection scheme for streaming data. This scheme is based on clustering as clustering is an unsupervised data mining task and it does not require labeled data. In proposed scheme both density based and partitioning clustering method are combined to take advantage of both density based and distance based outlier detection. Proposed scheme also assigns weights to attributes depending upon their respective relevance in mining task and weights are adaptive in nature. Weighted attributes are helpful to reduce or remove the effect of noisy attributes. Keeping in view the challenges of streaming data, the proposed scheme is incremental and adaptive to concept evolution. Experimental results on synthetic and real world data sets show that our proposed approach outperforms other existing approach (CORM) in terms of outlier detection rate, false alarm rate, and increasing percentages of outliers.


Motif-Based Classification of Time Series with Bayesian Networks and SVMs

Classification of time series is an important task with many challenging applications like brain wave (EEG) analysis, signature verification or speech recognition. In this paper we show how characteristic local patterns (motifs) can improve the classification accuracy. We introduce a new motif class, generalized semi-continuous motifs. To allow flexibility and noise robustness, these motifs may include gaps of various lengths, generic and more specific wildcards. We propose an efficient algorithm for mining generalized sequential motifs. In experiments on real medical data, we show how generalized semi-continuous motifs improve the accuracy of SVMs and Bayesian Networks for time series classificiation.