title: Promoting Student Metacognition

text: Imagine yourself as the instructor of an introductory undergraduate biology course. Two students from your course independently visit your office the week after the first exam. Both students are biology majors. Both regularly attend class and submit their assignments on time. Both appear to be eager, dedicated, and genuine students who want to learn biology. During each of their office hours visits, you ask them to share how they prepared for the first exam. Their stories are strikingly different (inspired by Ertmer and Newby, 1996). During office hours, Josephina expresses that she was happy the exam was on a Monday, because she had a lot of time to prepare the previous weekend. She shares that she started studying after work on Saturday evening and did not go out with friends that night. When queried, she also shares that she reread all of the assigned textbook material and made flashcards of the bold words in the text. She feels that she should have done well on the test, because she studied all Saturday night and all day on Sunday. She feels that she did everything she could do to prepare. That said, she is worried about what her grade will be, and she wants you to know that she studied really hard, so she should get a good grade on the exam. Later in the week, Maya visits your office. When asked how she prepared for the first exam, she explains that she has regularly reviewed the PowerPoint slides each evening after class since the beginning of the term 4 weeks ago. She also read the assigned textbook pages weekly, but expresses that she spent most of her time comparing the ideas in the PowerPoint slides with the information in the textbook to see how they were similar and different. She found several places in which things seemed not to agree, which confused her. She kept a running list of these confusions each week. When you ask what she did with these confusions, she shares that she


title: A Survey of Text Summarization Extractive Techniques

text: Text Summarization is condensing the source text into a shorter version preserving its information content and overall meaning. It is very difficult for human beings to manually summarize large documents of text. Text Summarization methods can be classified into extractive and abstractive summarization. An extractive summarization method consists of selecting important sentences, paragraphs etc. from the original document and concatenating them into shorter form. The importance of sentences is decided based on statistical and linguistic features of sentences. An abstractive summarization method consists of understanding the original text and re-telling it in fewer words. It uses linguistic methods to examine and interpret the text and then to find the new concepts and expressions to best describe it by generating a new shorter text that conveys the most important information from the original text document. In this paper, a Survey of Text Summarization Extractive techniques has been presented.


title: Multiple SVM-RFE for gene selection in cancer classification with expression data

text: This paper proposes a new feature selection method that uses a backward elimination procedure similar to that implemented in support vector machine recursive feature elimination (SVM-RFE). Unlike the SVM-RFE method, at each step, the proposed approach computes the feature ranking score from a statistical analysis of weight vectors of multiple linear SVMs trained on subsamples of the original training data. We tested the proposed method on four gene expression datasets for cancer classification. The results show that the proposed feature selection method selects better gene subsets than the original SVM-RFE and improves the classification accuracy. A Gene Ontology-based similarity assessment indicates that the selected subsets are functionally diverse, further validating our gene selection method. This investigation also suggests that, for gene expression-based cancer classification, average test error from multiple partitions of training and test sets can be recommended as a reference of performance quality.


title: Photogeometric Scene Flow for High-Detail Dynamic 3D Reconstruction

text: Photometric stereo (PS) is an established technique for high-detail reconstruction of 3D geometry and appearance. To correct for surface integration errors, PS is often combined with multiview stereo (MVS). With dynamic objects, PS reconstruction also faces the problem of computing optical flow (OF) for image alignment under rapid changes in illumination. Current PS methods typically compute optical flow and MVS as independent stages, each one with its own limitations and errors introduced by early regularization. In contrast, scene flow methods estimate geometry and motion, but lack the fine detail from PS. This paper proposes photogeometric scene flow (PGSF) for high-quality dynamic 3D reconstruction. PGSF performs PS, OF, and MVS simultaneously. It is based on two key observations: (i) while image alignment improves PS, PS allows for surfaces to be relit to improve alignment, (ii) PS provides surface gradients that render the smoothness term in MVS unnecessary, leading to truly data-driven, continuous depth estimates. This synergy is demonstrated in the quality of the resulting RGB appearance, 3D geometry, and 3D motion.


title: Data Driven Ontology Evaluation

text: The evaluation of ontologies is vital for the growth of the Semantic Web. We consider a number of problems in evaluating a knowledge artifact like an ontology. We propose in this paper that one approach to ontology evaluation should be corpus or data driven. A corpus is the most accessible form of knowledge and its use allows a measure to be derived of the ‘fit’ between an ontology and a domain of knowledge. We consider a number of methods for measuring this ‘fit’ and propose a measure to evaluate structural fit, and a probabilistic approach to identifying the best ontology.


title: Learning Across Scales - Multiscale Methods for Convolution Neural Networks

text: In this work, we establish the relation between optimal control and training deep Convolution Neural Networks (CNNs). We show that the forward propagation in CNNs can be interpreted as a time-dependent nonlinear differential equation and learning can be seen as controlling the parameters of the differential equation such that the network approximates the data-label relation for given training data. Using this continuous interpretation, we derive two new methods to scale CNNs with respect to two different dimensions. The first class of multiscale methods connects low-resolution and high-resolution data using prolongation and restriction of CNN parameters inspired by algebraic multigrid techniques. We demonstrate that our method enables classifying highresolution images using CNNs trained with low-resolution images and vice versa and warm-starting the learning process. The second class of multiscale methods connects shallow and deep networks and leads to new training strategies that gradually increase the depths of the CNN while re-using parameters for initializations.


title: Toolpath Planning for Continuous Extrusion Additive Manufacturing

text: Recent work in additive manufacturing has introduced a new class of 3D printers that operate by extruding slurries and viscous mixtures such as silicone, glass, epoxy, and concrete, but because of the fluid flow properties of these materials it is difficult to stop extrusion once the print has begun. Conventional toolpath generation for 3D printing is based on the assumption that the flow of material can be controlled precisely and the resulting path includes instructions to disable extrusion and move the print head to another portion of the model. A continuous extrusion printer cannot disable material flow, and so these toolpaths produce low quality prints with wasted material. This paper outlines a greedy algorithm for post-processing toolpath instructions that employs a Traveling Salesperson Problem (TSP) solver to reduce the distance traveled between subsequent space-filling curves and layers, which reduces unnecessary extrusion by at least 20% for simple object models on an open-source 3D printer.


Model Predictive Control System Design of a passenger car for a Valet Parking Scenario


title: Artificial Intelligence MArkup Language: A Brief Tutorial

text: The purpose of this paper is to serve as a reference guide for the development of chatterbots implemented with the AIML language. In order to achieve this, the main concepts in Pattern Recognition area are described because the AIML uses such theoretical framework in their syntactic and semantic structures. After that, AIML language is described and each AIML command/tag is followed by an application example. Also, the usage of AIML embedded tags for the handling of sequence dialogue limitations between humans and machines is shown. Finally, computer systems that assist in the design of chatterbots with the AIML language are classified and described.


title: An Analysis of the Elastic Net Approach to the Traveling Salesman Problem

text: This paper analyzes the elastic net approach (Durbin and Willshaw 1987) to the traveling salesman problem of finding the shortest path through a set of cities. The elastic net approach jointly minimizes the length of an arbitrary path in the plane and the distance between the path points and the cities. The tradeoff between these two requirements is controlled by a scale parameter K. A global minimum is found for large K, and is then tracked to a small value. In this paper, we show that (1) in the small K limit the elastic path passes arbitrarily close to all the cities, but that only one path point is attracted to each city, (2) in the large K limit the net lies at the center of the set of cities, and (3) at a critical value of K the energy function bifurcates. We also show that this method can be interpreted in terms of extremizing a probability distribution controlled by K. The minimum at a given K corresponds to the maximum a posteriori (MAP) Bayesian estimate of the tour under a natural statistical interpretation. The analysis presented in this paper gives us a better understanding of the behavior of the elastic net, allows us to better choose the parameters for the optimization, and suggests how to extend the underlying ideas to other domains.


title: A Comparative Analysis and Study of Multiview CNN Models for Joint Object Categorization and Pose Estimation

text: In the Object Recognition task, there exists a dichotomy between the categorization of objects and estimating object pose, where the former necessitates a view-invariant representation, while the latter requires a representation capable of capturing pose information over different categories of objects. With the rise of deep architectures, the prime focus has been on object category recognition. Deep learning methods have achieved wide success in this task. In contrast, object pose estimation using these approaches has received relatively less attention. In this work, we study how Convolutional Neural Networks (CNN) architectures can be adapted to the task of simultaneous object recognition and pose estimation. We investigate and analyze the layers of various CNN models and extensively compare between them with the goal of discovering how the layers of distributed representations within CNNs represent object pose information and how this contradicts with object category representations. We extensively experiment on two recent large and challenging multi-view datasets and we achieve better than the state-of-the-art.


title: Optimizing esthetics for implant restorations in the anterior maxilla: anatomic and surgical considerations.

text: The placement of dental implants in the anterior maxilla is a challenge for clinicians because of patients' exacting esthetic demands and difficult pre-existing anatomy. This article presents anatomic and surgical considerations for these demanding indications for implant therapy. First, potential causes of esthetic implant failures are reviewed, discussing anatomic factors such as horizontal or vertical bone deficiencies and iatrogenic factors such as improper implant selection or the malpositioning of dental implants for an esthetic implant restoration. Furthermore, aspects of preoperative analysis are described in various clinical situations, followed by recommendations for the surgical procedures in single-tooth gaps and in extended edentulous spaces with multiple missing teeth. An ideal implant position in all 3 dimensions is required. These mesiodistal, apicocoronal, and orofacial dimensions are well described, defining "comfort" and "danger" zones for proper implant position in the anterior maxilla. During surgery, the emphasis is on proper implant selection to avoid oversized implants, careful and low-trauma soft tissue handling, and implant placement in a proper position using either a periodontal probe or a prefabricated surgical guide. If missing, the facial bone wall is augmented using a proper surgical technique, such as guided bone regeneration with barrier membranes and appropriate bone grafts and/or bone substitutes. Finally, precise wound closure using a submerged or a semi-submerged healing modality is recommended. Following a healing period of between 6 and 12 weeks, a reopening procedure is recommended with a punch technique to initiate the restorative phase of therapy.


title: EEG correlates of task engagement and mental workload in vigilance, learning, and memory tasks.

text:
INTRODUCTION
The ability to continuously and unobtrusively monitor levels of task engagement and mental workload in an operational environment could be useful in identifying more accurate and efficient methods for humans to interact with technology. This information could also be used to optimize the design of safer, more efficient work environments that increase motivation and productivity.

METHODS
The present study explored the feasibility of monitoring electroencephalo-graphic (EEG) indices of engagement and workload acquired unobtrusively and quantified during performance of cognitive tests. EEG was acquired from 80 healthy participants with a wireless sensor headset (F3-F4,C3-C4,Cz-POz,F3-Cz,Fz-C3,Fz-POz) during tasks including: multi-level forward/backward-digit-span, grid-recall, trails, mental-addition, 20-min 3-Choice Vigilance, and image-learning and memory tests. EEG metrics for engagement and workload were calculated for each 1 -s of EEG.

RESULTS
Across participants, engagement but not workload decreased over the 20-min vigilance test. Engagement and workload were significantly increased during the encoding period of verbal and image-learning and memory tests when compared with the recognition/ recall period. Workload but not engagement increased linearly as level of difficulty increased in forward and backward-digit-span, grid-recall, and mental-addition tests. EEG measures correlated with both subjective and objective performance metrics.

DISCUSSION
These data in combination with previous studies suggest that EEG engagement reflects information-gathering, visual processing, and allocation of attention. EEG workload increases with increasing working memory load and during problem solving, integration of information, analytical reasoning, and may be more reflective of executive functions. Inspection of EEG on a second-by-second timescale revealed associations between workload and engagement levels when aligned with specific task events providing preliminary evidence that second-by-second classifications reflect parameters of task performance.


title: MuDeL: a language and a system for describing and generating mutants

text: Mutation Testing is an approach for assessing the quality of a test case suite by analyzing its ability in distinguishing the product under test from a set of alternative products, the so-called mutants. The mutants are generated from the product under test by applying a set of mutant operators, which produce products with slight syntactical differences. The mutant operators are usually based on typical errors that occurs during the software development and can be related to a fault model. In this paper, we propose a language — named MuDeL — for describing mutant operators aiming not only at automating the mutant generation, but also at providing precision and formality to the operator descriptions. The language was designed using concepts that come from transformational and logical programming paradigms, as well as from context-free grammar theory. The language is illustrated with some simple examples. We also describe the mudelgen system, developed to support this language.


title: Direct-on-line-start permanent-magnet-assisted synchronous reluctance machine with ferrite magnets

text: The possibility of applying low-cost ferrite magnets in a direct-on-line-start permanent-magnet-assisted synchronous reluctance machine (DOL PMaSynRM) for industrial applications, such as pump or ventilation systems was studied. The main target of this machine topology was to achieve a higher efficiency class compared to a counterpart induction machine (IM). Because of the weak properties of the ferrite magnets the motor had to be optimized for a low magnetic stress starting from the permanent magnets' point of view. The optimization procedure includes finding of a suitable rotor construction with a proper number of barriers, thickness of the barriers and thickness of the ferrite magnets. More detailed attention was dedicated to the analysis and elimination of irreversible demagnetization risk of ferrite magnets during start up period.


title: Internet use and the logics of personal empowerment in health.

text:
OBJECTIVES
The development of personal involvement and responsibility has become a strategic issue in health policy. The main goal of this study is to confirm the coexistence of three logics of personal empowerment through health information found on the Internet.

METHODS
A theoretical framework was applied to analyze personal empowerment from the user's perspective. A well-established Canadian Web site that offers information on personal health was used as a case study. A close-ended questionnaire was completed online by 2275 visitors and members of the Web site.

RESULTS
The findings confirm that the development of feelings of competence and control through Internet use is structured around three different logics. This implies three types of aptitudes that are fostered when the Internet is used to seek health information: doing what is prescribed (the professional logic), making choices based on personal judgment (the consumer logic), and mutual assistance (the community logic).

CONCLUSIONS
A recurring issue in three logics is the balance of roles and responsibilities required between the individual and the health provider.


title: Serendipity in the Research Literature: A Phenomenology of Serendipity Reporting

text: The role of information sciences is to connect people with the information they need to accomplish the tasks that contribute to the greater societal good. While evidence of the wonderful contributions arising from serendipitous events abound, the framework describing the information behaviors exhibited during a serendipitous experience is just emerging and additional detail regarding the factors influencing those behaviors is needed in order to support these experiences effectively. Furthermore, it is important to understand the whole process of serendipity to fully appreciate the impact of research policies, disciplinary traditions and academic reporting practices on this unique type of information behavior. This study addresses those need by examining the phenomenon of serendipity as it is reported by biomedical and radiography researchers. A mixed method content analysis of existing research reports will be incorporated with semi-structured interviews of serendipity reporters to gain a robust understanding of the phenomenon of serendipity, and provide detail that may inform the design of information environments.


title: Zero-forcing beamforming with block diagonalization scheme for Coordinated Multi-Point transmission

text: Coordinated Multi-Point (CoMP) transmission is a technology targeted for Long Term Evolution Advanced (LTE-A). The Joint Processing (JP) technique for CoMP can maximize system performance, which is achieved mainly with channel information-based beamforming algorithms. Precoding methods perform differently in various CoMP scenarios. In this paper, we propose a joint processing scheme in downlink CoMP transmission system. We apply block diagonal beamforming to downlink transmission, and assume perfect knowledge of downlink channels and transmit messages at each transmit point.


title: Social Computing for Mobile Big Data

text: Mobile big data contains vast statistical features in various dimensions, including spatial, temporal, and the underlying social domain. Understanding and exploiting the features of mobile data from a social network perspective will be extremely beneficial to wireless networks, from planning, operation, and maintenance to optimization and marketing.


title: Tobler ' s First Law of Geography , Self Similarity , and Perlin Noise : A Large Scale Analysis of Gradient Distribution in Southern Utah with Application to Procedural Terrain Generation

text: A statistical analysis finds that in a 160,000 square kilometer region of southern Utah gradients appear to be exponentially distributed at resolutions from 5m up to 1km. A simple modification to the Perlin noise generator changing the gradient distribution in each octave to an exponential distribution results in realistic and interesting procedurally generated terrain. The inverse transform sampling method is used in the amortized noise algorithm to achieve an exponential distribution in each octave, resulting in the generation of infinite non-repeating terrain with the same characteristics.


title: "My Data Just Goes Everywhere: " User Mental Models of the Internet and Implications for Privacy and Security

text: Many people use the Internet every day yet know little about how it really works. Prior literature diverges on how people’s Internet knowledge affects their privacy and security decisions. We undertook a qualitative study to understand what people do and do not know about the Internet and how that knowledge affects their responses to privacy and security risks. Lay people, as compared to those with computer science or related backgrounds, had simpler mental models that omitted Internet levels, organizations, and entities. People with more articulated technical models perceived more privacy threats, possibly driven by their more accurate understanding of where specific risks could occur in the network. Despite these differences, we did not find a direct relationship between people’s technical background and the actions they took to control their privacy or increase their security online. Consistent with other work on user knowledge and experience, our study suggests a greater emphasis on policies and systems that protect privacy and security without relying too much on users’ security practices.


title: Thirty-Five Years of Research on Neuro-Linguistic Programming . NLP Research Data Base . State of the Art or Pseudoscientific Decoration ?

text: The huge popularity of Neuro-Linguistic Programming (NLP) therapies and training has not been accompanied by knowledge of the empirical underpinnings of the concept. The article presents the concept of NLP in the light of empirical research in the Neuro-Linguistic Programming Research Data Base. From among 315 articles the author selected 63 studies published in journals from the Master Journal List of ISI. Out of 33 studies, 18.2% show results supporting the tenets of NLP, 54.5% results non-supportive of the NLP tenets and 27.3% brings uncertain results. The qualitative analysis indicates the greater weight of the non-supportive studies and their greater methodological worth against the ones supporting the tenets. Results contradict the claim of an empirical basis of NLP.


title: Cloud Computing: A Review

text: Cloud computing is a development of parallel, distributed and grid computing which provides computing potential as a service to clients rather than a product. Clients can access software resources, valuable information and hardware devices as a subscribed and monitored service over a network through cloud computing.Due to large number of requests for access to resources and service level agreements between cloud service providers and clients, few burning issues in cloud environment like QoS, Power, Privacy and Security, VM Migration, Resource Allocation and Scheduling need attention of research community.Resource allocation among multiple clients has to be ensured as per service level agreements. Several techniques have been invented and tested by research community for generation of optimal schedules in cloud computing. A few promising approaches like Metaheuristics, Greedy, Heuristic technique and Genetic are applied for task scheduling in several parallel and distributed systems. This paper presents a review on scheduling proposals in cloud environment.


title: Patient satisfaction and medication adherence assessment amongst patients at the diabetes medication therapy adherence clinic.

text:
AIMS
To determine the satisfaction and current adherence status of patients with diabetes mellitus at the diabetes Medication Therapy Adherence Clinic and the relationship between patient satisfaction and adherence.

METHODS
This cross-sectional descriptive study was carried out at three government hospitals in the state of Johor, Malaysia. Patient's satisfaction was measured using the Patient Satisfaction with Pharmaceutical Care Questionnaire; medication adherence was measured using the eight-item Morisky Medication Adherence Scale.

RESULTS
Of n=165 patients, 87.0% of patients were satisfied with DMTAC service (score 60-100) with mean scores of 76.8. On the basis of MMAS, 29.1% had a medium rate and 26.1% had a high rate of adherence. Females are 3.02 times more satisfied with the pharmaceutical service compared to males (OR 3.03, 95% CI 1.12-8.24, p<0.05) and non-Malays are less satisfied with pharmaceutical care provided during DMTAC compared to Malays (OR 0.32, 95% CI 0.12-0.85, p<0.05). Older patients age group ≥60 years were 3.29 times more likely to adhere to their medications (OR 3.29, 95% CI 1.10-9.86, p<0.05). Females were the most adherent compared to males (OR 2.33, 95%CI 1.10-4.93, p<0.05) and patients with secondary level of education were 2.72 times more adherent to their medications compared to those in primary school and no formal education (OR 2.72, 95%CI 1.13-6.55, p<0.05). There is a significant (p<0.01), positive fair correlation (r=0.377) between satisfaction and adherence.

CONCLUSION
Patients were highly satisfied with DMTAC service, while their adherence levels were low. There is an association between patient satisfaction and adherence.


title: Wind Turbine Structural Health Monitoring : A Short Investigation Based on SCADA Data

text: The use of offshore wind farms has been growing in recent years, as steadier and higher wind speeds can be generally found over water compared to land. Moreover, as human activities tend to complicate the construction of land wind farms, offshore locations, which can be found more easily near densely populated areas, can be seen as an attractive choice. However, the cost of an offshore wind farm is relatively high, and therefore their reliability is crucial if they ever need to be fully integrated into the energy arena. As wind turbines have become more complex, efficient, and expensive structures, they require more sophisticated monitoring systems, especially in offshore sites where the financial losses due to failure could be substantial. This paper presents the preliminary analysis of supervisor control and data acquisition (SCADA) extracts from the Lillgrund wind farm for the purposes of structural health monitoring. A machine learning approach is applied in order to produce individual power curves, and then predict measurements of the power produced of each wind turbine from the measurements of the other wind turbines in the farm. A comparison between neural network and Gaussian process regression is also made.


title: Deep Residual Learning for Image Recognition

text: Deeper neural networks are more difficult to train. We present a residual learning framework to ease the training of networks that are substantially deeper than those used previously. We explicitly reformulate the layers as learning residual functions with reference to the layer inputs, instead of learning unreferenced functions. We provide comprehensive empirical evidence showing that these residual networks are easier to optimize, and can gain accuracy from considerably increased depth. On the ImageNet dataset we evaluate residual nets with a depth of up to 152 layers - 8× deeper than VGG nets [40] but still having lower complexity. An ensemble of these residual nets achieves 3.57% error on the ImageNet test set. This result won the 1st place on the ILSVRC 2015 classification task. We also present analysis on CIFAR-10 with 100 and 1000 layers. The depth of representations is of central importance for many visual recognition tasks. Solely due to our extremely deep representations, we obtain a 28% relative improvement on the COCO object detection dataset. Deep residual nets are foundations of our submissions to ILSVRC & COCO 2015 competitions1, where we also won the 1st places on the tasks of ImageNet detection, ImageNet localization, COCO detection, and COCO segmentation.


title: Learning a Deep Convolutional Network for Image Super-Resolution

text: We propose a deep learning method for single image superresolution (SR). Our method directly learns an end-to-end mapping between the low/high-resolution images. The mapping is represented as a deep convolutional neural network (CNN) [15] that takes the lowresolution image as the input and outputs the high-resolution one. We further show that traditional sparse-coding-based SR methods can also be viewed as a deep convolutional network. But unlike traditional methods that handle each component separately, our method jointly optimizes all layers. Our deep CNN has a lightweight structure, yet demonstrates state-of-the-art restoration quality, and achieves fast speed for practical on-line usage.


title: A Public Domain Dataset for Human Activity Recognition using Smartphones

text: Human-centered computing is an emerging research field that aims to understand human behavior and integrate users and their social context with computer systems. One of the most recent, challenging and appealing applications in this framework consists in sensing human body motion using smartphones to gather context information about people actions. In this context, we describe in this work an Activity Recognition database, built from the recordings of 30 subjects doing Activities of Daily Living (ADL) while carrying a waist-mounted smartphone with embedded inertial sensors, which is released to public domain on a well-known on-line repository. Results, obtained on the dataset by exploiting a multiclass Support Vector Machine (SVM), are also acknowledged.


title: On deep learning-based channel decoding

text: We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide some evidence that neural networks can learn a form of decoding algorithm, rather than only a simple classifier. We introduce the metric normalized validation error (NVE) in order to further investigate the potential and limitations of deep learning-based decoding with respect to performance and complexity.


title: Automated plant Watering system

text: In daily operations related to farming or gardening Watering is the most important cultural practice and the most labor-intensive task. No matter whichever weather it is, either too hot and dry or too cloudy and wet, you want to be able to control the amount of water that reaches your plants. Modern watering systems could be effectively used to water plants when they need it. But this manual process of watering requires two important aspects to be considered: when and how much to water. In order to replace manual activities and making gardener's work easier, we have create automatic plant watering system. By adding automated plant watering system to your garden or agricultural field, you will help all of your plants reach their fullest potential as well as conserving water. Using sprinklers drip emitters, or a combination of both, we can design a system that is ideal for every plant in our yard. For implementation of automatic plant watering system, we have used combination of sprinkler systems, pipes, and nozzles. This project uses the ATmega328 microcontroller. It is programmed to sense moisture level of plants at particular instance of time, if the moisture content is less than specified threshold which is predefined according to particular plant's water need then desired amount of water is supplied till it reaches threshold. Generally, plants need to be watered twice a day, morning and evening. Thus, the microcontroller is programmed to water plants two times per day. System is designed in such a way that it reports its current state as well as remind the user to add water to the tank. All this notifications are made through mobile application. We hope that through this prototype we all can enjoy having plants, without being worried about absent or forgetfulness.


title: Energy-Efficient I/O Thread Schedulers for NVMe SSDs on NUMA

text: Non-volatile memory express (NVMe) based SSDs and the NUMA platform are widely adopted in servers to achieve faster storage speed and more powerful processing capability. As of now, very little research has been conducted to investigate the performance and energy efficiency of the state-of-the-art NUMA architecture integrated with NVMe SSDs, an emerging technology used to host parallel I/O threads. As this technology continues to be widely developed and adopted, we need to understand the runtime behaviors of such systems in order to design software runtime systems that deliver optimal performance while consuming only the necessary amount of energy. This paper characterizes the runtime behaviors of a Linux-based NUMA system employing multiple NVMe SSDs. Our comprehensive performance and energy-efficiency study using massive numbers of parallel I/O threads shows that the penalty due to CPU contention is much smaller than that due to remote access of NVMe SSDs. Based on this insight, we develop a dynamic "lesser evil" algorithm called ESN, to minimize the impact of these two types of penalties. ESN is an energy-efficient profiling-based I/O thread scheduler for managing I/O threads accessing NVMe SSDs on NUMA systems. Our empirical evaluation shows that ESN can achieve optimal I/O throughput and latency while consuming up to 50% less energy and using fewer CPUs.


title: Cascade Mask Generation Framework for Fast Small Object Detection

text: Detecting small objects is a challenging task. Existing CNN-based objection detection pipeline faces such a dilemma: using a high-resolution image as input incurs high computational cost, but using a low-resolution image as input loses the feature representation of small objects and therefore leads to low accuracy. In this work, we propose a cascade mask generation framework to tackle this issue. The proposed framework takes in multi-scale images as input and processes them in ascending order of the scale. Each processing stage outputs object proposals as well as a region-of-interest (RoI) mask for the next stage. With RoI convolution, the masked regions can be excluded from the computation in the next stage. The procedure continues until the largest scale image is processed. Finally, the object proposals generated from multiple scales are classified by a post classifier. Extensive experiments on Tsinghua-Tencent 100K traffic sign benchmark demonstrate that our approach achieves state-of-the-art small object detection performance at a significantly improved speed-accuracy tradeoff compared with previous methods.


title: Broadband Bent Triangular Omnidirectional Antenna for RF Energy Harvesting

text: In this letter, a broadband bent triangular omnidirectional antenna is presented for RF energy harvesting. The antenna has a bandwidth for VSWR ≤ 2 from 850 MHz to 1.94 GHz. The antenna is designed to receive both horizontal and vertical polarized waves and has a stable radiation pattern over the entire bandwidth. Antenna has also been optimized for energy harvesting application and it is designed for 100 Ω input impedance to provide a passive voltage amplification and impedance matching to the rectifier. A peak efficiency of 60% and 17% is obtained for a load of 500 Ω at 980 and 1800 MHz, respectively. At a cell site while harvesting all bands simultaneously a voltage of 3.76 V for open circuit and 1.38 V across a load of 4.3 k Ω is obtained at a distance of 25 m using an array of two elements of the rectenna.


title: Graph Indexing: Tree + Delta >= Graph

text: Recent scientific and technological advances have witnessed an abundance of structural patterns modeled as graphs. As a result, it is of special interest to process graph containment queries effectively on large graph databases. Given a graph database G, and a query graph q, the graph containment query is to retrieve all graphs in G which contain q as subgraph(s). Due to the vast number of graphs in G and the nature of complexity for subgraph isomorphism testing, it is desirable to make use of high-quality graph indexing mechanisms to reduce the overall query processing cost. In this paper, we propose a new cost-effective graph indexing method based on frequent tree-features of the graph database. We analyze the effectiveness and efficiency of tree as indexing feature from three critical aspects: feature size, feature selection cost, and pruning power. In order to achieve better pruning ability than existing graph-based indexing methods, we select, in addition to frequent tree-features (Tree), a small number of discriminative graphs (∆) on demand, without a costly graph mining process beforehand. Our study verifies that (Tree+∆) is a better choice than graph for indexing purpose, denoted (Tree+∆ ≥Graph), to address the graph containment query problem. It has two implications: (1) the index construction by (Tree+∆) is efficient, and (2) the graph containment query processing by (Tree+∆) is efficient. Our experimental studies demonstrate that (Tree+∆) has a compact index structure, achieves an order of magnitude better performance in index construction, and most importantly, outperforms up-to-date graphbased indexing methods: gIndex and C-Tree, in graph containment query processing.


title: Deep learning based human action recognition: A survey

text: Human action recognition has attracted much attentions because of its great potential applications. With the rapid development of computer performance and Internet, the methods of human action recognition based on deep learning become mainstream and develop at a breathless pace. This paper will give a novel reasonable taxonomy and a review of deep learning human action recognition methods based on color videos, skeleton sequences and depth maps. In addition, some datasets and effective tricks in action recognition deep learning methods will be introduced, and also the development trend is discussed.


title: A compact dual-band (L1/L2) GPS antenna design

text: A small slot-loaded patch antenna design developed for receiving both L1 and L2 bands GPS signals is discussed. The dual band coverage is achieved by using a patch mode at L2 band and a slot mode at L1 band. High dielectric material and meandered slot line are employed to reduce the antenna size down to 25.4 mm in diameter. The RHCP is achieved by combining two orthogonal modes via a small 0°-90° hybrid chip. Both patch and slot modes share a single proximity probe conveniently located on the side of the antenna (Fig.1). This paper discusses about the design procedure as well as simulated antenna performance.


title: PROBABILISTIC NEURAL NETWORK

text: This paper reports results of artificial neural network for robot navigation tasks. Machine learning methods have proven usability in many complex problems concerning mobile robots control. In particular we deal with the well-known strategy of navigating by “wall-following”. In this study, probabilistic neural network (PNN) structure was used for robot navigation tasks. The PNN result was compared with the results of the Logistic Perceptron, Multilayer Perceptron, Mixture of Experts and Elman neural networks and the results of the previous studies reported focusing on robot navigation tasks and using same dataset. It was observed the PNN is the best classification accuracy with 99,635% accuracy using same dataset.


title: Trends and Challenges in CMOS Design for Emerging 60 GHz WPAN Applications

text: The extensive growth of wireless communications industry is creating a big market opportunity. Wireless operators are currently searching for new solutions which would be implemented into the existing wireless communication networks to provide the broader bandwidth, the better quality and new value-added services. In the last decade, most commercial efforts were focused on the 1-10 GHz spectrum for voice and data applications for mobile phones and portable computers (Niknejad & Hashemi, 2008). Nowadays, the interest is growing in applications that use high rate wireless communications. Multigigabit-per-second communication requires a very large bandwidth. The Ultra-Wide Band (UWB) technology was basically used for this issue. However, this technology has some shortcomings including problems with interference and a limited data rate. Furthermore, the 3–5 GHz spectrum is relatively crowded with many interferers appearing in the WiFi bands (Niknejad & Hashemi, 2008). The use of millimeter wave frequency band is considered the most promising technology for broadband wireless. In 2001, the Federal Communications Commission (FCC) released a set of rules governing the use of spectrum between 57 and 66 GHz (Baldwin, 2007). Hence, a large bandwidth coupled with high allowable transmit power equals high possible data rates. Traditionally the implementation of 60 GHz radio technology required expensive technologies based on III-V compound semiconductors such as InP and GaAs (Smulders et al., 2007). The rapid progress of CMOS technology has enabled its application in millimeter wave applications. Currently, the transistors became small enough, consequently fast enough. As a result, the CMOS technology has become one of the most attractive choices in implementing 60 GHz radio due to its low cost and high level of integration (Doan et al., 2005). Despite the advantages of CMOS technology, the design of 60 GHz CMOS transceiver exhibits several challenges and difficulties that the designers must overcome. This chapter aims to explore the potential of the 60 GHz band in the use for emergent generation multi-gigabit wireless applications. The chapter presents a quick overview of the state-of-the-art of 60 GHz radio technology and its potentials to provide for high data rate and short range wireless communications. The chapter is organized as follows. Section 2 presents an overview about 60 GHz band. The advantages are presented to highlight the performance characteristics of this band. The opportunities of the physical layer of the IEEE


title: Classification of behaviour in housed dairy cows using an accelerometer-based activity monitoring system

text: Advances in bio-telemetry technology have made it possible to automatically monitor and classify behavioural activities in many animals, including domesticated species such as dairy cows. Automated behavioural classification has the potential to improve health and welfare monitoring processes as part of a Precision Livestock Farming approach. Recent studies have used accelerometers and pedometers to classify behavioural activities in dairy cows, but such approaches often cannot discriminate accurately between biologically important behaviours such as feeding, lying and standing or transition events between lying and standing. In this study we develop a decision-tree algorithm that uses tri-axial accelerometer data from a neck-mounted sensor to both classify biologically important behaviour in dairy cows and to detect transition events between lying and standing. Data were collected from six dairy cows that were monitored continuously for 36 h. Direct visual observations of each cow were used to validate the algorithm. Results show that the decision-tree algorithm is able to accurately classify three types of biologically relevant behaviours: lying (77.42 % sensitivity, 98.63 % precision), standing (88.00 % sensitivity, 55.00 % precision), and feeding (98.78 % sensitivity, 93.10 % precision). Transitions between standing and lying were also detected accurately with an average sensitivity of 96.45 % and an average precision of 87.50 %. The sensitivity and precision of the decision-tree algorithm matches the performance of more computationally intensive algorithms such as hidden Markov models and support vector machines. Biologically important behavioural activities in housed dairy cows can be classified accurately using a simple decision-tree algorithm applied to data collected from a neck-mounted tri-axial accelerometer. The algorithm could form part of a real-time behavioural monitoring system in order to automatically detect dairy cow health and welfare status.


title: Different models for model matching: An analysis of approaches to support model differencing

text: Calculating differences between models is an important and challenging task in Model Driven Engineering. Model differencing involves a number of steps starting with identifying matching model elements, calculating and representing their differences, and finally visualizing them in an appropriate way. In this paper, we provide an overview of the fundamental steps involved in the model differencing process and summarize the advantages and shortcomings of existing approaches for identifying matching model elements. To assist potential users in selecting one of the existing methods for the problem at stake, we investigate the trade-offs these methods impose in terms of accuracy and effort required to implement each one of them.


title: Wearable Computing for Health and Fitness: Exploring the Relationship between Data and Human Behaviour

text: Health and fitness wearable technology has recently advanced, making it easier for an individual to monitor their behaviours. Previously self generated data interacts with the user to motivate positive behaviour change, but issues arise when relating this to long term mention of wearable devices. Previous studies within this area are discussed. We also consider a new approach where data is used to support instead of motivate, through monitoring and logging to encourage reflection. Based on issues highlighted, we then make recommendations on the direction in which future work could be most beneficial.


title: Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science

text: As the field of data science continues to grow, there will be an ever-increasing demand for tools that make machine learning accessible to non-experts. In this paper, we introduce the concept of tree-based pipeline optimization for automating one of the most tedious parts of machine learning--pipeline design. We implement an open source Tree-based Pipeline Optimization Tool (TPOT) in Python and demonstrate its effectiveness on a series of simulated and real-world benchmark data sets. In particular, we show that TPOT can design machine learning pipelines that provide a significant improvement over a basic machine learning analysis while requiring little to no input nor prior knowledge from the user. We also address the tendency for TPOT to design overly complex pipelines by integrating Pareto optimization, which produces compact pipelines without sacrificing classification accuracy. As such, this work represents an important step toward fully automating machine learning pipeline design.


title: Brain basis of early parent-infant interactions: psychology, physiology, and in vivo functional neuroimaging studies.

text: Parenting behavior critically shapes human infants' current and future behavior. The parent-infant relationship provides infants with their first social experiences, forming templates of what they can expect from others and how to best meet others' expectations. In this review, we focus on the neurobiology of parenting behavior, including our own functional magnetic resonance imaging (fMRI) brain imaging experiments of parents. We begin with a discussion of background, perspectives and caveats for considering the neurobiology of parent-infant relationships. Then, we discuss aspects of the psychology of parenting that are significantly motivating some of the more basic neuroscience research. Following that, we discuss some of the neurohormones that are important for the regulation of social bonding, and the dysregulation of parenting with cocaine abuse. Then, we review the brain circuitry underlying parenting, proceeding from relevant rodent and nonhuman primate research to human work. Finally, we focus on a study-by-study review of functional neuroimaging studies in humans. Taken together, this research suggests that networks of highly conserved hypothalamic-midbrain-limbic-paralimbic-cortical circuits act in concert to support aspects of parent response to infants, including the emotion, attention, motivation, empathy, decision-making and other thinking that are required to navigate the complexities of parenting. Specifically, infant stimuli activate basal forebrain regions, which regulate brain circuits that handle specific nurturing and caregiving responses and activate the brain's more general circuitry for handling emotions, motivation, attention, and empathy--all of which are crucial for effective parenting. We argue that an integrated understanding of the brain basis of parenting has profound implications for mental health.


title: Learning to Fuse Things and Stuff

text: We propose an end-to-end learning approach for panoptic segmentation, a novel task unifying instance (things) and semantic (stuff) segmentation. Our model, TASCNet, uses feature maps from a shared backbone network to predict in a single feed-forward pass both things and stuff segmentations. We explicitly constrain these two output distributions through a global things and stuff binary mask to enforce cross-task consistency. Our proposed unified network is competitive with the state of the art on several benchmarks for panoptic segmentation as well as on the individual semantic and instance segmentation tasks.


title: How to get mature global virtual teams: a framework to improve team process management in distributed software teams

text: Managing global software development teams is not an easy task because of the additional problems and complexities that have to be taken into account. This paper defines VTManager, a methodology that provides a set of efficient practices for global virtual team management in software development projects. These practices integrate software development techniques in global environments with others such as explicit practices for global virtual team management, definition of skills and abilities needed to work in these teams, availability of collaborative work environments and shared knowledge management practices. The results obtained and the lessons learned from implementing VTManager in a pilot project to develop software tools for collaborative work in rural environments are also presented. This project was carried out by geographically distributed teams involving people from seven countries with a high level of virtualness.


title: An iterative maximum-likelihood polychromatic algorithm for CT

text: A new iterative maximum-likelihood reconstruction algorithm for X-ray computed tomography is presented. The algorithm prevents beam hardening artifacts by incorporating a polychromatic acquisition model. The continuous spectrum of the X-ray tube is modeled as a number of discrete energies. The energy dependence of the attenuation is taken into account by decomposing the linear attenuation coefficient into a photoelectric component and a Compton scatter component. The relative weight of these components is constrained based on prior material assumptions. Excellent results are obtained for simulations and for phantom measurements. Beam-hardening artifacts are effectively eliminated. The relation with existing algorithms is discussed. The results confirm that improving the acquisition model assumed by the reconstruction algorithm results in reduced artifacts. Preliminary results indicate that metal artifact reduction is a very promising application for this new algorithm.


title: Optimal Charging in Wireless Rechargeable Sensor Networks

text: Recent years have witnessed several new promising technologies to power wireless sensor networks, which motivate some key topics to be revisited. By integrating sensing and computation capabilities to the traditional radio-frequency identification (RFID) tags, the Wireless Identification and Sensing Platform (WISP) is an open-source platform acting as a pioneering experimental platform of wireless rechargeable sensor networks. Different from traditional tags, an RFID-based wireless rechargeable sensor node needs to charge its onboard energy storage above a threshold to power its sensing, computation, and communication components. Consequently, such charging delay imposes a unique design challenge for deploying wireless rechargeable sensor networks. In this paper, we tackle this problem by planning the optimal movement strategy of the mobile RFID reader, such that the time to charge all nodes in the network above their energy threshold is minimized. We first propose an optimal solution using the linear programming (LP) method. To further reduce the computational complexity, we then introduce a heuristic solution with a provable approximation ratio of (1 + θ)/(1 - ε) by discretizing the charging power on a 2-D space. Through extensive evaluations, we demonstrate that our design outperforms the set-cover-based design by an average of 24.7%, whereas the computational complexity is O((N/ε)2). Finally, we consider two practical issues in system implementation and provide guidelines for parameter setting.


title: CPW to waveguide transition with tapered slotline probe

text: A new CPW to waveguide transition is developed based on the concept of tapered slot antenna and E-plane probe coupling. The transition consists of a tapered slotline probe and a slotline to CPW matching section. The current design has the advantages of broad bandwidth, compact size, low fabrication cost, and high reliability. The characteristics of a prototype transition are investigated by numerical simulation on Duroid substrate and WR-90 waveguide. The back-to-back combination is measured to verify the agreement with the simulated results and realization of this design.


title: A novel secure hash algorithm for public key digital signature schemes

text: Hash functions are the most widespread among all cryptographic primitives, and are currently used in multiple cryptographic schemes and in security protocols. This paper presents a new Secure Hash Algorithm called (SHA-192). It uses a famous secure hash algorithm given by the National Institute of Standard and Technology (NIST).The basic design of SHA192 is to have the output length of 192.The SHA-192 has been designed to satisfy the different level of enhanced security and to resist the advanced SHA attacks. The security analysis of the SHA-192 is compared to the old one given by NIST and gives more security and excellent results as shown in our discussion. In this paper the digital signature algorithm which is given by NIST has been modified using the proposed algorithms SHA-192. Using proposed SHA-192 hash algorithm a new digital signature schemes is also proposed. The SHA-192 can be used in many applications such s public key cryptosystem, digital signcryption, message authentication code, random generator and in security architecture of upcoming wireless devices like software defined radio etc.


title: Ethical Challenges in Data-Driven Dialogue Systems

text: The use of dialogue systems as a medium for human-machine interaction is an increasingly prevalent paradigm. A growing number of dialogue systems use conversation strategies that are learned from large datasets. There are well documented instances where interactions with these system have resulted in biased or even offensive conversations due to the data-driven training process. Here, we highlight potential ethical issues that arise in dialogue systems research, including: implicit biases in data-driven systems, the rise of adversarial examples, potential sources of privacy violations, safety concerns, special considerations for reinforcement learning systems, and reproducibility concerns. We also suggest areas stemming from these issues that deserve further investigation. Through this initial survey, we hope to spur research leading to robust, safe, and ethically sound dialogue systems.


title: Speed-Security Tradeo s in Blockchain Protocols

text: Transaction processing speed is one of the major considerations in cryptocurrencies that are based on proof of work (POW) such as Bitcoin. At an intuitive level it is widely understood that processing speed is at odds with the security aspects of the underlying POW based consensus mechanism of such protocols, nevertheless the tradeo between the two properties is still not well understood. In this work, motivated by recent work [9] in the formal analysis of the Bitcoin backbone protocol, we investigate the tradeo between provable security and transaction processing speed viewing the latter as a function of the block generation rate. We introduce a new formal property of blockchain protocols, called chain growth, and we show it is fundamental for arguing the security of a robust transaction ledger. We strengthen the results of [9] showing for the rst time that reasonable security bounds hold even for the faster (than Bitcoin's) block generation rates that have been adopted by several major alt-coins (including Litecoin, Dogecoin etc.). We then provide a rst formal security proof of the GHOST rule for blockchain protocols. The GHOST rule was put forth in [14] as a mechanism to improve transaction processing speed and a variant of the rule is adopted by Ethereum. Our security analysis of the GHOST backbone matches our new analysis for Bitcoin in terms of the common pre x property but falls short in terms of chain growth where we provide an attack that substantially reduces the chain speed compared to Bitcoin. While our results establish the GHOST variant as a provably secure alternative to standard Bitcoin-like transaction ledgers they also highlight potential shortcomings in terms of processing speed compared to Bitcoin. We nally present attacks and simulation results against blockchain protocols (both for Bitcoin and GHOST) that present natural upper barriers for the speed-security tradeo . By combining our positive and negative results we map the speed/security domain for blockchain protocols and list open problems for future work.


title: Classification of teeth in cone-beam CT using deep convolutional neural network

text: Dental records play an important role in forensic identification. To this end, postmortem dental findings and teeth conditions are recorded in a dental chart and compared with those of antemortem records. However, most dentists are inexperienced at recording the dental chart for corpses, and it is a physically and mentally laborious task, especially in large scale disasters. Our goal is to automate the dental filing process by using dental x-ray images. In this study, we investigated the application of a deep convolutional neural network (DCNN) for classifying tooth types on dental cone-beam computed tomography (CT) images. Regions of interest (ROIs) including single teeth were extracted from CT slices. Fifty two CT volumes were randomly divided into 42 training and 10 test cases, and the ROIs obtained from the training cases were used for training the DCNN. For examining the sampling effect, random sampling was performed 3 times, and training and testing were repeated. We used the AlexNet network architecture provided in the Caffe framework, which consists of 5 convolution layers, 3 pooling layers, and 2 full connection layers. For reducing the overtraining effect, we augmented the data by image rotation and intensity transformation. The test ROIs were classified into 7 tooth types by the trained network. The average classification accuracy using the augmented training data by image rotation and intensity transformation was 88.8%. Compared with the result without data augmentation, data augmentation resulted in an approximately 5% improvement in classification accuracy. This indicates that the further improvement can be expected by expanding the CT dataset. Unlike the conventional methods, the proposed method is advantageous in obtaining high classification accuracy without the need for precise tooth segmentation. The proposed tooth classification method can be useful in automatic filing of dental charts for forensic identification.


title: Harvesting rib cartilage grafts for secondary rhinoplasty.

text:
BACKGROUND
Reconstruction of the nasal osseocartilaginous framework is the foundation of successful secondary rhinoplasty.

METHODS
Achieving this often requires large quantities of cartilage to correct both contour deformities and functional problems caused by previous procedures. Satisfactory and consistent long-term results rely on using grafts with low resorption rates and sufficient strength to offer adequate support. Auricular cartilage, irradiated cartilage, and alloplastic materials have all been used as implantable grafts with limited success.

RESULTS
In the senior author's experience (J.P.G.), rib cartilage has proven to be a reliable, abundant, and relatively accessible donor with which to facilitate successful secondary rhinoplasty surgery.

CONCLUSIONS
: The authors describe in detail the techniques that they have found to be integral in harvesting rib cartilage grafts for secondary rhinoplasty.


title: High-Dimensional Continuous Control Using Generalized Advantage Estimation

text: This paper is concerned with developing policy gradient methods that gracefully scale up to challenging problems with high-dimensional state and action spaces. Towards this end, we develop a scheme that uses value functions to substantially reduce the variance of policy gradient estimates, while introducing a tolerable amount of bias. This scheme, which we call generalized advantage estimation (GAE), involves using a discounted sum of temporal difference residuals as an estimate of the advantage function, and can be interpreted as a type of automated cost shaping. It is simple to implement and can be used with a variety of policy gradient methods and value function approximators. Along with this variance-reduction scheme, we use trust region algorithms to optimize the policy and value function, both represented as neural networks. We present experimental results on a number of highly challenging 3D locomotion tasks, where our approach learns complex gaits for bipedal and quadrupedal simulated robots. We also learn controllers for the biped getting up off the ground. In contrast to prior work that uses hand-crafted low-dimensional policy representations, our neural network policies map directly from raw kinematics to joint torques.


title: Policy Gradient Methods for Robotics

text: The acquisition and improvement of motor skills and control policies for robotics from trial and error is of essential importance if robots should ever leave precisely pre-structured environments. However, to date only few existing reinforcement learning methods have been scaled into the domains of high-dimensional robots such as manipulator, legged or humanoid robots. Policy gradient methods remain one of the few exceptions and have found a variety of applications. Nevertheless, the application of such methods is not without peril if done in an uninformed manner. In this paper, we give an overview on learning with policy gradient methods for robotics with a strong focus on recent advances in the field. We outline previous applications to robotics and show how the most recently developed methods can significantly improve learning performance. Finally, we evaluate our most promising algorithm in the application of hitting a baseball with an anthropomorphic arm


title: Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates

text: Reinforcement learning holds the promise of enabling autonomous robots to learn large repertoires of behavioral skills with minimal human intervention. However, robotic applications of reinforcement learning often compromise the autonomy of the learning process in favor of achieving training times that are practical for real physical systems. This typically involves introducing hand-engineered policy representations and human-supplied demonstrations. Deep reinforcement learning alleviates this limitation by training general-purpose neural network policies, but applications of direct deep reinforcement learning algorithms have so far been restricted to simulated settings and relatively simple tasks, due to their apparent high sample complexity. In this paper, we demonstrate that a recent deep reinforcement learning algorithm based on off-policy training of deep Q-functions can scale to complex 3D manipulation tasks and can learn deep neural network policies efficiently enough to train on real physical robots. We demonstrate that the training times can be further reduced by parallelizing the algorithm across multiple robots which pool their policy updates asynchronously. Our experimental evaluation shows that our method can learn a variety of 3D manipulation skills in simulation and a complex door opening skill on real robots without any prior demonstrations or manually designed representations.


title: Infinite-Horizon Policy-Gradient Estimation

text: Gradient-based approaches to direct policy search in reinf orcement learning have received much recent attention as a means to solve problems of partial observability and to avoid some of the problems associated with policy degradation in value-f unction methods. In this paper we introduceGPOMDP, a simulation-based algorithm for generating a bi sedestimate of the gradient of theaverage rewardin Partially Observable Markov Decision Processes ( POMDPs) controlled by parameterized stochastic policies. A similar algorithm wa s proposed by Kimura, Yamamura, and Kobayashi (1995). The algorithm’s chief advantages are tha t i requires storage of only twice the number of policy parameters, uses one free parameter 2 [0; 1) (which has a natural interpretation in terms of bias-variance trade-off), and requires no knowl edge of the underlying state. We prove convergence of GPOMDP, and show how the correct choice of the parameter is related to the mixing timeof the controlledPOMDP. We briefly describe extensions of GPOMDP to controlled Markov chains, continuous state, observation and control s paces, multiple-agents, higher-order derivatives, and a version for training stochastic policie s with internal states. In a companion paper (Baxter, Bartlett, & Weaver, 2001) we show how the gradient e stimates generated by GPOMDP can be used in both a traditional stochastic gradient algori thm and a conjugate-gradient procedure to find local optima of the average reward.


title: Privacy-Preserving Public Auditing For Secure Cloud Storage

text: By using Cloud storage, users can access applications, services, software whenever they requires over the internet. Users can put their data remotely to cloud storage and get benefit of on-demand services and application from the resources. The cloud must have to ensure data integrity and security of data of user. The issue about cloud storage is integrity and privacy of data of user can arise. To maintain to overkill this issue here, we are giving public auditing process for cloud storage that users can make use of a third-party auditor (TPA) to check the integrity of data. Not only verification of data integrity, the proposed system also supports data dynamics. The work that has been done in this line lacks data dynamics and true public auditability. The auditing task monitors data modifications, insertions and deletions. The proposed system is capable of supporting public auditability, data dynamics and Multiple TPA are used for the auditing process. We also extend our concept to ring signatures in which HARS scheme is used. Merkle Hash Tree is used to improve block level authentication. Further we extend our result to enable the TPA to perform audits for multiple users simultaneously through Batch auditing.


title: Design Of Ternary Logic Gates Using CNTFET

text: This paper presents a novel design of ternary logic gates like STI,PTI,NTI,NAND and NOR using carbon nanotube field effect transistors. Ternary logic is a promising alternative to the conventional binary logic design technique, since it is possible to accomplish simplicity and energy efficiency in modern digital design due to the reduced circuit overhead such as interconnects and chip area. In this paper novel design of basic logic gates for ternary logic based on CNTFET, is proposed. Keywords— Carbon nano-tube Field Effect Transistor(CNTFET),MVL(multi valued logic),Ternary logic,STI,NTI,PTI


title: Sampled-Point Network for Classification of Deformed Building Element Point Clouds

text: Search-and-rescue (SAR) robots operating in post-disaster urban areas need to accurately identify physical site information to perform navigation, mapping and manipulation tasks. This can be achieved by acquiring a 3D point cloud of the environment and performing object recognition from the point cloud data. However, this task is complicated by the unstructured environments and potentially-deformed objects encountered during disaster relief operations. Current 3D object recognition methods rely on point cloud input acquired under suitable conditions and do not consider deformations such as outlier noise, bending and truncation. This work introduces a deep learning architecture for 3D class recognition from point clouds of deformed building elements. The classification network, consisting of stacked convolution and average pooling layers applied directly to point coordinates, was trained using point clouds sampled from a database of mesh models. The proposed method achieves robustness to input variability using point sorting, resampling, and rotation normalization techniques. Experimental results on synthetically-deformed object datasets show that the proposed method outperforms the conventional deep learning methods in terms of classification accuracy and computational efficiency.


title: Real-time 3 D Camera Tracking for Industrial Augmented Reality Applications

text: In this paper we present a new solution for real-time 3D camera pose estimation for Augmented Reality (AR) applications. The tracking system does not require special engineering of the environment, such as placing markers or beacons. The required input data are a CAD model of the target object to be tracked, and a calibrated reference image of it. We consider the whole process of camera tracking, and developed both an autonomous initialization and a real-time tracking procedure. The system is robust to abrupt camera motions, strong changes of the lighting conditions and partial occlusions. To avoid typical jitter and drift problems the tracker performs feature matching not only in an iterative manner, but also against stable reference features, which are dynamically cached in case of high confidence. We present experimental results generated with help of synthetic ground truth, real off-line and on-line image sequences using different types of target objects.


title: [Hyaluronic acid rheology: Basics and clinical applications in facial rejuvenation].

text: Hyaluronic acid (HA) is the most widely used dermal filler to treat facial volume deficits and winkles specially for facial rejuvenation. Depending on various areas of the face, filler is exposed to two different forces (shear deformation and compression/stretching forces) resulting from intrinsec and external mechanical stress. The purpose of this technical note is to explain how rheology, which is the study of the flow and deformation of matter under strains, can be used in our clinical practice of facial volumization with fillers. Indeed, comprehension of the rheological properties of HA has become essential in selection of dermal filler targeted to the area of the face. Viscosity, elasticity and cohesivity are the main three properties to be taken into consideration in this selection. Aesthetic physicians and surgeons have to familiarize with those basics in order to select the HA with the right rheological properties to achieve a natural-looking and long-lasting outcome.


title: Robust Vehicle Detection and Distance Estimation Under Challenging Lighting Conditions

text: Avoiding high computational costs and calibration issues involved in stereo-vision-based algorithms, this paper proposes real-time monocular-vision-based techniques for simultaneous vehicle detection and inter-vehicle distance estimation, in which the performance and robustness of the system remain competitive, even for highly challenging benchmark datasets. This paper develops a collision warning system by detecting vehicles ahead and, by identifying safety distances to assist a distracted driver, prior to occurrence of an imminent crash. We introduce adaptive global Haar-like features for vehicle detection, tail-light segmentation, virtual symmetry detection, intervehicle distance estimation, as well as an efficient single-sensor multifeature fusion technique to enhance the accuracy and robustness of our algorithm. The proposed algorithm is able to detect vehicles ahead at both day or night and also for short- and long-range distances. Experimental results under various weather and lighting conditions (including sunny, rainy, foggy, or snowy) show that the proposed algorithm outperforms state-of-the-art algorithms.


title: Proof Analysis in Modal Logic

text: A general method for generating contractionand cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel–Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.


title: Huffman Coding-Based Adaptive Spatial Modulation

text: Antenna switch enables multiple antennas to share a common RF chain. It also offers an additional spatial dimension, i.e., antenna index, that can be utilized for data transmission via both signal space and spatial dimension. In this paper, we propose a Huffman coding-based adaptive spatial modulation that generalizes both conventional spatial modulation and transmit antenna selection. Through the Huffman coding, i.e., designing variable length prefix codes, the transmit antennas can be activated with different probabilities. When the input signal is Gaussian distributed, the optimal antenna activation probability is derived through optimizing channel capacity. To make the optimization tractable, closed form upper bound and lower bound are derived as the effective approximations of channel capacity. When the input is discrete QAM signal, the optimal antenna activation probability is derived through minimizing symbol error rate. Numerical results show that the proposed adaptive transmission offers considerable performance improvement over the conventional spatial modulation and transmit antenna selection.


title: On Blockchain Applications : Hyperledger Fabric And Ethereum

text: Blockchain is a tamper-proof digital ledger which can be used to record public or private peer to peer network transactions and it cannot be altered retroactively without the alteration of all subsequent blocks of the network. A blockchain is updated via the consensus protocol that ensures a linear, unambiguous ordering of transactions. Blocks guarantee the integrity and consistency of the blockchain across a network of distributed nodes. Different blockchain applications use various consensus protocols for their working. Byzantine fault tolerance (BFT) is one of them and it is a characteristic of a system that tolerates the class of failures known as the Byzantine Generals Problem. Hyperledger, Stellar, and Ripple are three blockchain application which uses BFT consensus. The best variant of BFT is Practical Byzantine Fault tolerance (PBFT). Hyperledger fabric with deterministic transactions can run on the top of PBFT. This paper focuses on a survey of various consensus mechanisms and makes a comparative study of Hyperledger fabric and Ethereum. Keywords— consensus; hyperledger fabric; ethereum; byzantine fault tolerance;


title: MapFactory – Towards a mapping design pattern for big geospatial data

text: With big geospatial data emerging, cartographers and geographic information scientists have to find new ways of dealing with the volume, variety, velocity, and veracity (4Vs) of the data. This requires the development of tools that allow processing, filtering, analysing, and visualising of big data through multidisciplinary collaboration. In this paper, we present the MapFactory design pattern that will be used for the creation of different maps according to the (input) design specification for big geospatial data. The design specification is based on elements from ISO19115-1:2014 Geographic information -Metadata -Part 1: Fundamentals that would guide the design and development of the map or set of maps to be produced. The results of the exploratory research suggest that the MapFactory design pattern will help with software reuse and communication. The MapFactory design pattern will aid software developers to build the tools that are required to automate map making with big geospatial data. The resulting maps would assist cartographers and others to make sense of big geospatial data.


title: Exploiting Redundancy in Question Answering

text: Our goal is to automatically answer brief factual questions of the form ``When was the Battle of Hastings?'' or ``Who wrote The Wind in the Willows?''. Since the answer to nearly any such question can now be found somewhere on the Web, the problem reduces to finding potential answers in large volumes of data and validating their accuracy. We apply a method for arbitrary passage retrieval to the first half of the problem and demonstrate that answer redundancy can be used to address the second half. The success of our approach depends on the idea that the volume of available Web data is large enough to supply the answer to most factual questions multiple times and in multiple contexts. A query is generated from a question and this query is used to select short passages that may contain the answer from a large collection of Web data. These passages are analyzed to identify candidate answers. The frequency of these candidates within the passages is used to ``vote'' for the most likely answer. The approach is experimentally tested on questions taken from the TREC-9 question-answering test collection. As an additional demonstration, the approach is extended to answer multiple choice trivia questions of the form typically asked in trivia quizzes and television game shows.


title: VOS-GAN: Adversarial Learning of Visual-Temporal Dynamics for Unsupervised Dense Prediction in Videos

text: Recent GAN-based video generation approaches model videos as the combination of a time-independent scene component and a time-varying motion component, thus factorizing the generation problem into generating background and foreground separately. One of the main limitations of current approaches is that both factors are learned by mapping one source latent space to videos, which complicates the generation task as a single data point must be informative of both background and foreground content. In this paper we propose a GAN framework for video generation that, instead, employs two latent spaces in order to structure the generative process in a more natural way: 1) a latent space to generate the static visual content of a scene (background), which remains the same for the whole video, and 2) a latent space where motion is encoded as a trajectory between sampled points and whose dynamics are modeled through an RNN encoder (jointly trained with the generator and the discriminator) and then mapped by the generator to visual objects’ motion. Additionally, we extend current video discrimination approaches by incorporating in the learning procedure motion estimation and, leveraging the peculiarity of the generation process, unsupervised pixel-wise dense predictions. Extensive performance evaluation showed that our approach is able to a) synthesize more realistic videos than state-of-the-art methods, b) learn effectively both local and global video dynamics, as demonstrated by the results achieved on a video action recognition task over the UCF-101 dataset, and c) accurately perform unsupervised video object segmentation on standard video benchmarks, such as DAVIS, SegTrack and F4K-Fish.


title: Pharmacist-managed medication therapy adherence clinics: The Malaysian experience.

text: In Malaysia, the first pharmacist-managed clinic was established in 2004. This type of clinics is locally known as a medication therapy adherence clinic (MTAC).1e3 In fact, these clinics were introduced by the Pharmaceutical Services Division (PSD), Ministry of Health Malaysia (MOH) as part of the clinical pharmacy services to improve the quality, safety, and cost-effectiveness of patient care through better medicines management at ambulatory care settings in hospitals and MOH clinics.2 The major aims of the clinics include optimization of medication therapy, improvement of medication adherence, and prevention or reduction of adverse drug events and other medication related problems.1 Over a decade, the number of MTACs has increased tremendously to 660 by the end of 2013.1 Moreover, currently, there are 13 types of clinics being operated in Malaysia that include neurology (stroke), diabetes, heart failure, respiratory, psoriasis, anticoagulation, rheumatology, nephrology, hepatitis, geriatrics, retroviral disease, hemophilia, and psychiatry.1,3,4 The pharmacists operate the clinics and provide pharmaceutical care services to the patients in collaboration with physicians and other healthcare professionals according to specific protocols. The specific roles of the pharmacist include providing drug information, patient education and counseling, identifying and solving drugrelated problems, monitoring patients' drug therapy and treatment outcomes, offering feedback on patient progress, making appropriate recommendations to physicians to individualize the patients' drug regimens according to patient-related factors including clinical, humanistic, and economic factors.1e4 Several studies have been conducted to evaluate the impact of pharmacist-managed clinics on patient care in Malaysia.5e10 These studies have demonstrated that the clinics are beneficial in optimizing medication therapy, improving medication adherence, and giving better clinical outcomes. Moreover, some studies have shown that these clinics are more cost-effective than standard medical care.11,12 In addition, it has been shown that the patients are satisfied with the pharmaceutical care services provided by these clinics.13,14 Therefore, the current evidence supports further expansion of these clinics in the ambulatory care system in Malaysia. We believe there are several factors that have led to the success of the pharmacist-managed clinics in Malaysia. These include the tremendous support and guidance from the PSD, Ministry of Health Malaysia to help in the establishment of these clinics. As an example of this support, the PSD has established a protocol for each clinic to help the pharmacists run the clinic, and to enable standardization of practice and the expansion of the clinics throughout the country. These protocols are written by specialized clinical pharmacy committees (e.g. respiratory subspecialty,


title: An Intelligent RFID Reader and its Application in Airport Baggage Handling System

text: In civil aviation baggage handing application, the RFID tags are used to enhance the ability for baggage tracking, dispatching and conveyance, so as to improve the management efficiency and the users' satisfaction. An intelligent RFID reader which has the ability of data disposal and provides EPC Edge Savant services is presented. The prototype readers and its experiment in the airport baggage handling system are also introduced. The workflow of the reader can be configured dynamically, which makes the deployment much more flexible. Real-time tasks can also be assigned to implement edge business process by the intelligent reader.


title: Realtime Ray Tracing on GPU with BVH-based Packet Traversal

text: Recent GPU ray tracers can already achieve performance competitive to that of their CPU counterparts. Nevertheless, these systems can not yet fully exploit the capabilities of modern GPUs and can only handle medium-sized, static scenes. In this paper we present a BVH-based GPU ray tracer with a parallel packet traversal algorithm using a shared stack. We also present a fast, CPU-based BVH construction algorithm which very accurately approximates the surface area heuristic using streamed binning while still being one order of magnitude faster than previously published results. Furthermore, using a BVH allows us to push the size limit of supported scenes on the GPU: We can now ray trace the 12.7 million triangle Power Plant at 1024 times 1024 image resolution with 3 fps, including shading and shadows.


title: Mobile Forensic Data Analysis: Suspicious Pattern Detection in Mobile Evidence

text: Culprits’ identification by the means of suspicious pattern detection techniques from mobile device data is one of the most important aims of the mobile forensic data analysis. When criminal activities are related to entirely automated procedures such as malware propagation, predicting the corresponding behavior is a rather achievable task. However, when human behavior is involved, such as in cases of traditional crimes, prediction and detection become more compelling. This paper introduces a combined criminal profiling and suspicious pattern detection methodology for two criminal activities with moderate to the heavy involvement of mobile devices, cyberbullying and low-level drug dealing. Neural and Neurofuzzy techniques are applied on a hybrid original and simulated dataset. The respective performance results are measured and presented, the optimal technique is selected, and the scenarios are re-run on an actual dataset for additional testing and verification.


title: A GPU-based implementation of motion detection from a moving platform

text: We describe a GPU-based implementation of motion detection from a moving platform. Motion detection from a moving platform is inherently difficult as the moving camera induces 2D motion field in the entire image. A step compensating for camera motion is required prior to estimating of the background model. Due to inevitable registration errors, the background model is estimated according to a sliding window of frames to avoid the case where erroneous registration influences the quality of the detection for the whole sequence. However, this approach involves several characteristics that put a heavy burden on real-time CPU implementation. We exploit GPU to achieve significant acceleration over standard CPU implementations. Our GPU-based implementation can build the background model and detect motion regions at around 18 fps on 320times240 videos that are captured for a moving camera.


title: How to do a grounded theory study: a worked example of a study of dental practices

text:
BACKGROUND
Qualitative methodologies are increasingly popular in medical research. Grounded theory is the methodology most-often cited by authors of qualitative studies in medicine, but it has been suggested that many 'grounded theory' studies are not concordant with the methodology. In this paper we provide a worked example of a grounded theory project. Our aim is to provide a model for practice, to connect medical researchers with a useful methodology, and to increase the quality of 'grounded theory' research published in the medical literature.

METHODS
We documented a worked example of using grounded theory methodology in practice.

RESULTS
We describe our sampling, data collection, data analysis and interpretation. We explain how these steps were consistent with grounded theory methodology, and show how they related to one another. Grounded theory methodology assisted us to develop a detailed model of the process of adapting preventive protocols into dental practice, and to analyse variation in this process in different dental practices.

CONCLUSIONS
By employing grounded theory methodology rigorously, medical researchers can better design and justify their methods, and produce high-quality findings that will be more useful to patients, professionals and the research community.


title: qBase relative quantification framework and software for management and automated analysis of real-time quantitative PCR data

text: Although quantitative PCR (qPCR) is becoming the method of choice for expression profiling of selected genes, accurate and straightforward processing of the raw measurements remains a major hurdle. Here we outline advanced and universally applicable models for relative quantification and inter-run calibration with proper error propagation along the entire calculation track. These models and algorithms are implemented in qBase, a free program for the management and automated analysis of qPCR data.


title: A Comparison of String Distance Metrics for Name-Matching Tasks

text: Using an open-source, Java toolkit of name-matching methods, we experimentally compare string distance metrics on the task of matching entity names. We investigate a number of different metrics proposed by different communities, including edit-distance metrics, fast heuristic string comparators, token-based distance metrics, and hybrid methods. Overall, the best-performing method is a hybrid scheme combining a TFIDF weighting scheme, which is widely used in information retrieval, with the Jaro-Winkler string-distance scheme, which was developed in the probabilistic record linkage community.


title: The power of statistical tests in meta-analysis.

text: Calculations of the power of statistical tests are important in planning research studies (including meta-analyses) and in interpreting situations in which a result has not proven to be statistically significant. The authors describe procedures to compute statistical power of fixed- and random-effects tests of the mean effect size, tests for heterogeneity (or variation) of effect size parameters across studies, and tests for contrasts among effect sizes of different studies. Examples are given using 2 published meta-analyses. The examples illustrate that statistical power is not always high in meta-analysis.


title: Frequent Pattern Compression: A Significance-Based Compression Scheme for L2 Caches

text: With the widening gap between processor and memory speeds, memory system designers ma find cache compression beneficial to increase cache capacity and reduce off-chip bandwidth Most hardware compression algorithms fall into the dictionary-based category, which depend on building a dictionary and using its entries to encode repeated data values. Such algorithms are effective in compressing large data blocks and files. Cache lines, however, are typically short (32-256 bytes), and a per-line dictionary places a significant overhead that limits the compressibility and increases decompression latency of such algorithms. For such short lines significance-based compression is an appealing alternative. We propose and evaluate a simple significance-based compression scheme that has a low com pression and decompression overhead. This scheme, Frequent Pattern Compression (FPC compresses individual cache lines on a word-by-word basis by storing common word patterns in a compressed format accompanied with an appropriate prefix. For a 64-byte cache line, compression can be completed in three cycles and decompression in five cycles, assuming 1 FO4 gate delays per cycle. We propose a compressed cache design in which data is stored in compressed form in the L2 caches, but are uncompressed in the L1 caches. L2 cache lines ar compressed to predetermined sizes that never exceed their original size to reduce decompre sion overhead. This simple scheme provides comparable compression ratios to more comple schemes that have higher cache hit latencies.


title: A pre-collision control strategy for human-robot interaction based on dissipated energy in potential inelastic impacts

text: Enabling human-robot collaboration raises new challenges in safety-oriented robot design and control. Indices that quantitatively describe human injury due to a human-robot collision are needed to propose suitable pre-collision control strategies. This paper presents a novel model-based injury index built on the concept of dissipated kinetic energy in a potential inelastic impact. This quantity represents the fracture energy lost when a human-robot collision occurs, modeling both clamped and unclamped cases. It depends on the robot reflected mass and velocity in the impact direction. The proposed index is expressed in analytical form suitable to be integrated in a constraint-based pre-collision control strategy. The exploited control architecture allows to perform a given robot task while simultaneously bounding our injury assessment and minimizing the reflected mass in the direction of the impact. Experiments have been performed on a lightweight robot ABB FRIDA to validate the proposed injury index as well as the pre-collision control strategy.


title: A Quadratic-Complexity Observability-Constrained Unscented Kalman Filter for SLAM

text: This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic computational complexity in the number of states and the inconsistency of the state estimates. To address the first issue, we introduce a new sampling strategy for the UKF, which has constant computational complexity. As a result, the overall computational complexity of UKF-based SLAM becomes of the same order as that of the extended Kalman filter (EKF)-based SLAM, i.e., quadratic in the size of the state vector. Furthermore, we investigate the inconsistency issue by analyzing the observability properties of the linear-regression-based model employed by the UKF. Based on this analysis, we propose a new algorithm, termed observability-constrained (OC)-UKF, which ensures the unobservable subspace of the UKF's linear-regression-based system model is of the same dimension as that of the nonlinear SLAM system. This results in substantial improvement in the accuracy and consistency of the state estimates. The superior performance of the OC-UKF over other state-of-the-art SLAM algorithms is validated by both Monte-Carlo simulations and real-world experiments.


title: Routing protocols in Vehicular Delay Tolerant Networks: A comprehensive survey

text: This article presents a comprehensive survey of routing protocols proposed for routing in Vehicular Delay Tolerant Networks (VDTN) in vehicular environment. DTNs are utilized in various operational environments, including those subject to disruption and disconnection and those with high-delay, such as Vehicular Ad-Hoc Networks (VANET). We focus on a special type of VANET, where the vehicular traffic is sparse and direct end-to-end paths between communicating parties do not always exist. Thus, communication in this context falls into the category of Vehicular Delay Tolerant Network (VDTN). Due to the limited transmission range of an RSU (Road Side Unit), remote vehicles, in VDTN, may not connect to the RSU directly and thus have to rely on intermediate vehicles to relay the packets. During the message relay process, complete end-to-end paths may not exist in highly partitioned VANETs. Therefore, the intermediate vehicles must buffer and forward messages opportunistically. Through buffer, carry and forward, the message can eventually be delivered to the destination even if an end-to-end connection never exists between source and destination. The main objective of routing protocols in DTN is to maximize the probability of delivery to the destination while minimizing the end-to-end delay. Also, vehicular traffic models are important for DTN routing in vehicle networks because the performance of DTN routing protocols is closely related to population and mobility models of the network. 2014 Elsevier B.V. All rights reserved.