EEG alpha activity reflects attentional demands, and beta activity reflects emotional and cognitive processes.

Two experiments were designed to examine the effects of attentional demands on the electroencephalogram during cognitive and emotional tasks. We found an interaction of task with hemisphere as well as more overall parietal alpha for tasks not requiring attention to the environment, such as mental arithmetic, than for those requiring such attention. Differential hemispheric activation for beta was found most strongly in the temporal areas for emotionally positive or negative tasks and in the parietal areas for cognitive tasks.


The possibility of predicting learning performance using features of note taking activities and instructions in a blended learning environment

A formative assessment was introduced to a blended learning course in order to predict participant’s learning performance using measurements of their note taking activity and metrics of their attitudes. The lexical metrics were created by analyzing the contents of student’s notes from every class, and by measuring their characteristics. In the results of two types of regression analysis of these measurements, features of note taking activities were a significant source of information for predicting the scores of final exams. In regards to temporal changes in prediction performance during the course, the progress of learning and the typical changes in features of note taking activity were discussed. During the analyses, the effectiveness of the lecturer’s note taking instructions was also confirmed.


Correlation analysis of MQTT loss and delay according to QoS level

MQTT is an open protocol developed and released by IBM. To ensure the reliability of message transmission, MQTT supports three levels of QoS. In this paper, we analyze MQTT message transmission process which consists of real wired/wireless publish client, broker server and Subscribe client. By transmitting messages through 3 levels of QoS with various sizes of payloads, we have captured packets to analyze end-to-end delays and message loss.


Improved resolution from subpixel shifted pictures

In this paper we consider the problem of obtaining a picture with improved resolution from an ensemble of K spatially shifted low-resolution pictures. We show that it can be done and provide a procedure for its implementations. The framework and scheme utilized in the generalized multichannel sampling theorem of Papoulis and Brown was found to be an appropriate representation for our problem. The linear channels of this scheme correspond to the processes that produce the low-resolution pictures (by blur and shifts) and to the process of reconstruction. The total process is shown to consist of two distinct degradation-restoration pairs: blurring-deblurring and undersampling-merging. This paper discusses merging. Deblurring (deconvolution) can be done by any desired scheme independent of merging. It is shown that the procedure achieves the claims of super resolution schemes but, unlike many of them, is well posed and robust. This procedure holds for a selected ensemble so that K is not too large and no two of the pictures practially coincide. The number of multiplications per pixel of the improved picture can be reduced to O(K2). o ESJZ


Research Paper: Automatic Detection of Acute Bacterial Pneumonia from Chest X-ray Reports

OBJECTIVE
To evaluate the performance of a natural language processing system in extracting pneumonia-related concepts from chest x-ray reports.

METHODS

DESIGN
Four physicians, three lay persons, a natural language processing system, and two keyword searches (designated AAKS and KS) detected the presence or absence of three pneumonia-related concepts and inferred the presence or absence of acute bacterial pneumonia from 292 chest x-ray reports. Gold standard: Majority vote of three independent physicians. Reliability of the gold standard was measured.

OUTCOME MEASURES
Recall, precision, specificity, and agreement (using Finn's R: statistic) with respect to the gold standard. Differences between the physicians and the other subjects were tested using the McNemar test for each pneumonia concept and for the disease inference of acute bacterial pneumonia.

RESULTS
Reliability of the reference standard ranged from 0.86 to 0.96. Recall, precision, specificity, and agreement (Finn R:) for the inference on acute bacterial pneumonia were, respectively, 0.94, 0.87, 0.91, and 0.84 for physicians; 0.95, 0.78, 0.85, and 0.75 for natural language processing system; 0.46, 0.89, 0.95, and 0.54 for lay persons; 0.79, 0.63, 0.71, and 0.49 for AAKS; and 0.87, 0.70, 0.77, and 0.62 for KS. The McNemar pairwise comparisons showed differences between one physician and the natural language processing system for the infiltrate concept and between another physician and the natural language processing system for the inference on acute bacterial pneumonia. The comparisons also showed that most physicians were significantly different from the other subjects in all pneumonia concepts and the disease inference.

CONCLUSION
In extracting pneumonia related concepts from chest x-ray reports, the performance of the natural language processing system was similar to that of physicians and better than that of lay persons and keyword searches. The encoded pneumonia information has the potential to support several pneumonia-related applications used in our institution. The applications include a decision support system called the antibiotic assistant, a computerized clinical protocol for pneumonia, and a quality assurance application in the radiology department.


Valuation of IT Investments Using Real Options Theory

Real Options Theory is often applied to the valuation of IT investments. The application of Real Options Theory is generally accompanied by a monetary valuation of real options through option pricing models which in turn are based on restrictive assumptions and thus subject to criticism. Therefore, this paper analyzes the application of option pricing models for the valuation of IT investments. A structured literature review reveals the types of IT investments which are valuated with Real Options Theory in scientific literature. These types of IT investments are further investigated and their main characteristics are compared to the restrictive assumptions of traditional option pricing models. This analysis serves as a basis for further discussion on how the identified papers address these assumptions. The results show that a lot of papers do not account for critical assumptions, although it is known that the assumptions are not fulfilled. Moreover, the type of IT investment determines the criticality of the assumptions. Additionally, several extensions or adaptions of traditional option pricing models can be found which provide the possibility of relaxing critical assumptions. Researchers can profit from the results derived in this paper in two ways: First, which assumptions can be critical for various types of IT investments are demonstrated. Second, extensions of option pricing models that relax critical assumptions are introduced.


The source code control system

The Source Code Control System (SCCS) is a software tool designed to help programming projects control changes to source code. It provides facilities for storing, updating, and retrieving all versions of modules, for controlling updating privileges for identifying load modules by version number, and for recording who made each software change, when and where it was made, and why. This paper discusses the SCCS approach to source code control, shows how it is used and explains how it is implemented.


Scheduling Real-Time Transactions: A Performance Evaluation

Managing transactions with real-time requirements presents many new problems. In this paper we address several: How can we schedule transactions with deadlines? How do the real-time constraints affect concurrency control? How should overloads be handled? How does the scheduling of 1/0 requests affect the timeliness of transactions? How should exclusive and shared locking be handled? We describe a new group of algorithms for scheduling real-time transactions that produce serializable schedules. We present a model for scheduling transactions with deadlines on a single processor disk resident database system, and evaluate the scheduling algorithms through detailed simulation experiments.


Magnetic field effects on plant growth, development, and evolution

The geomagnetic field (GMF) is a natural component of our environment. Plants, which are known to sense different wavelengths of light, respond to gravity, react to touch and electrical signaling, cannot escape the effect of GMF. While phototropism, gravitropism, and tigmotropism have been thoroughly studied, the impact of GMF on plant growth and development is not well-understood. This review describes the effects of altering magnetic field (MF) conditions on plants by considering plant responses to MF values either lower or higher than those of the GMF. The possible role of GMF on plant evolution and the nature of the magnetoreceptor is also discussed.


Attentive Tensor Product Learning for Language Generation and Grammar Parsing

This paper proposes a new architecture — Attentive Tensor Product Learning (ATPL) — to represent grammatical structures in deep learning models. ATPL is a new architecture to bridge this gap by exploiting Tensor Product Representations (TPR), a structured neural-symbolic model developed in cognitive science, aiming to integrate deep learning with explicit language structures and rules. The key ideas of ATPL are: 1) unsupervised learning of role-unbinding vectors of words via TPR-based deep neural network; 2) employing attention modules to compute TPR; and 3) integration of TPR with typical deep learning architectures including Long Short-Term Memory (LSTM) and Feedforward Neural Network (FFNN). The novelty of our approach lies in its ability to extract the grammatical structure of a sentence by using role-unbinding vectors, which are obtained in an unsupervised manner. This ATPL approach is applied to 1) image captioning, 2) part of speech (POS) tagging, and 3) constituency parsing of a sentence. Experimental results demonstrate the effectiveness of the proposed approach.


Interrater reliability of a modified Ashworth scale of muscle spasticity.

We undertook this investigation to determine the interrater reliability of manual tests of elbow flexor muscle spasticity graded on a modified Ashworth scale. We each independently graded the elbow flexor muscle spasticity of 30 patients with intracranial lesions. We agreed on 86.7% of our ratings. The Kendall's tau correlation between our grades was .847 (p less than .001). Thus, the relationship between the raters' judgments was significant and the reliability was good. Although the results were limited to the elbow flexor muscle group, we believe them to be positive enough to encourage further trials of the modified Ashworth scale for grading spasticity.


Improved Plagiarism Detection Algorithm Based on Abstract Syntax Tree

Statements with conditionals are widely used in C, C++ and java, such as if and while statements and they are easy to plagiarize by adjusting the logical structure of the corresponding statements. However, the existing relative algorithms and tools cannot effectively detect code plagiarism of these statements. This paper puts forward an improved code plagiarism detection algorithm based on abstract syntax tree. The algorithm calculates the hash value for each node of the abstract syntax tree, and compares the hash values node by node. Based on this, it analyzes the if-statement plagiarism, as if-statements are representative in the statements with conditionals, and puts forward the corresponding detection schemes in order to detect plagiarism effectively. After that, with the results of many experiments, the algorithm is proved effective on detecting if-statement plagiarisms.


Penile Implants among Prisoners—A Cause for Concern?

BACKGROUND
We report the prevalence of penile implants among prisoners and determine the independent predictors for having penile implants. Questions on penile implants were included in the Sexual Health and Attitudes of Australian Prisoners (SHAAP) survey following concerns raised by prison health staff that increasing numbers of prisoners reported having penile implants while in prison.

METHODS
Computer-Assisted Telephone Interviewing (CATI) of a random sample of prisoners was carried out in 41 prisons in New South Wales and Queensland (Australia). Men were asked, "Have you ever inserted or implanted an object under the skin of your penis?" If they responded Yes: "Have you ever done so while you were in prison?" Univariate logistic regression and logistic regression were used to determine the factors associated with penile implants.

RESULTS
A total of 2,018 male prisoners were surveyed, aged between 18 and 65 years, and 118 (5.8%) reported that they had inserted or implanted an object under the skin of their penis. Of these men, 87 (73%) had this done while they were in prison. In the multivariate analysis, a younger age, birth in an Asian country, and prior incarceration were all significantly associated with penile implants (p<0.001). Men with penile implants were also more likely to report being paid for sex (p<0.001), to have had body piercings (p<0.001) or tattoos in prison (p<0.001), and to have taken non-prescription drugs while in prison (p<0.05).

CONCLUSIONS
Penile implants appear to be fairly common among prisoners and are associated with risky sexual and drug use practices. As most of these penile implants are inserted in prison, these men are at risk of blood borne viruses and wound infection. Harm reduction and infection control strategies need to be developed to address this potential risk.


Air-filled substrate integrated waveguide — A flexible and low loss technological platform

In this paper, the air-filled substrate integrated waveguide (AFSIW), offering a technological platform for the design of high performance millimeterwave self-packaged substrate integrated components and systems, is presented. AFSIW is based on low-cost printed circuit board (PCB). Several components, including antennas, filters and couplers, have been theoretically studied and experimentally demonstrated up to 60 GHz. This technology, surpassing its dielectric-filled SIW (DFSIW) counterpart, is expected by the authors to replace the rectangular waveguide technology for future low-cost extremely high data rate communication systems and highly sensitive sensors operating at millimeterwave and beyond.


Attention Deficit Hyperactivity Disorder: Is There an App for That? Suitability Assessment of Apps for Children and Young People With ADHD

BACKGROUND
Attention-deficit/hyperactivity disorder (ADHD) is a complex highly comorbid disorder, which can have a huge impact on those with ADHD, their family, and the community around them. ADHD is currently managed using pharmacological and nonpharmacological interventions. However, with advances in technology and an increase in the use of mobile apps, managing ADHD can be augmented using apps specifically designed for this population. However, little is known regarding the suitability and usability of currently available apps.

OBJECTIVE
The aim of this study was to explore the suitability of the top 10 listed apps for children and young people with ADHD and clinicians who work with them. It is hypothesized that mobile apps designed for this population could be more suitably designed for this population.

METHODS
The top 10 listed apps that are specifically targeted toward children and young people with ADHD in the United Kingdom were identified via the Google Play (n=5) and iTunes store (n=5). Interviews were then undertaken with 5 clinicians who specialize in treating this population and 5 children and young people with ADHD themselves, to explore their opinions of the 10 apps identified and what they believe the key components are for apps to be suitable for this population.

RESULTS
Five themes emerged from clinician and young people interviews: the accessibility of the technology, the importance of relating to apps, addressing ADHD symptoms and related difficulties, age appropriateness, and app interaction. Three additional themes emerged from the clinician interviews alone: monitoring symptoms, side effects and app effect on relationships, and the impact of common comorbid conditions. The characteristics of the apps did not appear to match well with the views of our sample.

CONCLUSIONS
These findings suggest that the apps may not be suitable in meeting the complex needs associated with this condition. Further research is required to explore the value of apps for children and young people with ADHD and their families and, in particular, any positive role for apps in the management of ADHD in this age group. A systematic review on how technology can be used to engage this population and how it can be used to help them would be a useful way forward. This could be the platform to begin exploring the use of apps further.


Scale Up vs. Scale Out in Cloud Storage and Graph Processing Systems

Deployers of cloud storage and iterative processing systems typically have to deal with either dollar budget constraints or throughput requirements. This paper examines the question of whether such cloud storage and iterative processing systems are more cost-efficient when scheduled on a COTS (scale out) cluster or a single beefy (scale up) machine. We experimentally evaluate two systems: 1) a distributed key-value store (Cassandra), and 2) a distributed graph processing system (Graph Lab). Our studies reveal scenarios where each option is preferable over the other. We provide recommendations for deployers of such systems to decide between scale up vs. Scale out, as a function of their dollar or throughput constraints. Our results indicate that there is a need or adaptive scheduling in heterogeneous clusters containing scale up and scale out nodes.


The ASK Corpus - a Language Learner Corpus of Norwegian as a Second Language

In our paper we present the design and interface of ASK, a language learner corpus of Norwegian as a second language which contains essays collected from language tests on two different proficiency levels as well as personal data from the test takers. In addition, the corpus also contains texts and relevant personal data from native Norwegians as control data. The texts as well as the personal data are marked up in XML according to the TEI Guidelines. In order to be able to classify “errors” in the texts, we have introduced new attributes to the TEI corr and sic tags. For each error tag, a correct form is also in the text annotation. Finally, we employ an automatic tagger developed for standard Norwegian, the “Oslo-Bergen Tagger”, together with a facility for manual tag correction. As corpus query system, we are using the Corpus Workbench developed at the University of Stuttgart together with a web search interface developed at Aksis, University of Bergen. The system allows for searching for combinations of words, error types, grammatical annotation and personal data.


WordFreak: An Open Tool for Linguistic Annotation

WordFreak is a natural language annotation tool that has been designed to be easy to extend to new domains and tasks. Specifically, a plug-in architecture has been developed which allows components to be added to WordFreak for customized visualization, annotation specification, and automatic annotation, without re-compilation. The APIs for these plug-ins provide mechanisms to allow automatic annotators or taggers to guide future annotation to supports active learning. At present WordFreak can be used to annotate a number of different types of annotation in English, Chinese, and Arabic including: constituent parse structure and dependent annotations, and ACE named-entity and coreference annotation. The Java source code for WordFreak is distributed under the Mozilla Public License 1.1 via SourceForge at: http://wordfreak.sourceforge.net. This site also provides screenshots, and a web deployable version of WordFreak.


Comparison between JSON and XML in Applications Based on AJAX

As the core technology of Web 2.0, Ajax has caught more and more attention. Xml, as the traditional data load format, needs to be resolved by DOM (Document Object Model ) both in client-side and server-side, which wastes system resource and makes a great reduction of user-friendliness. In this paper, a light-weightdata-interchanging format-JSON (Java Script Object Notation) will be introduced, which provides a higher level of flexibility and efficiency. We make a comparison between JSON and XML through expriment, then use JSON as data-transfering format in an actual project. Results show that JSON is more suitable as a data-loading tool for Ajax applications.


Characterization of double-layer capacitors (DLCs) for power electronics applications

The double-layer capacitor (DLC) for power applications is a new device. A simple resistive capacitive equivalent circuit is insufficient to characterize its terminal behaviour. Based on physical reasoning, an equivalent circuit is proposed to provide the power electronics engineer with a model for the terminal behaviour of the DLC. The equivalent model consists of three Re branches, one of them with a voltage dependent capacitor. A method to identify the circuit parameters is presented. Measurements of carbon-based DLCs for power applications are presented, analysed, and the equivalent circuit response is compared with experimental results.


A novel spring mechanism to reduce energy consumption of robotic arms

Most conventional robotic arms use motors to accelerate the manipulator. This leads to an unnecessary high energy consumption when performing repetitive tasks. This paper presents an approach to reduce energy consumption in robotic arms by performing its repetitive tasks with the help of a parallel spring mechanism. A special non-linear spring characteristic has been achieved by attaching a spring to two connected pulleys. This parallel spring mechanism provides for the accelerations of the manipulator without compromising its ability to vary the task parameters (the time per stroke, the displacement per stroke the grasping time and the payload). The energy consumption of the arm with the spring mechanism is compared to that of the same arm without the spring mechanism. Optimal control studies show that the robotic arm uses 22% less energy due to the spring mechanism. On the 2 DOF prototype, we achieved an energy reduction of 20%. The difference was due to model simplifications. With a spring mechanism, there is an extra energetic cost, because potential energy has to be stored into the spring during startup. This cost is equal to the total energy savings of the 2 DOF arm during 8 strokes. Next, there could have been an energetic cost to position the manipulator outside the equilibrium position. We have designed the spring mechanism in such a way that this holding cost is negligible for a range of start- and end positions. The performed experiments showed that the implementation of the proposed spring mechanism results in a reduction of the energy consumption while the arm is still able to handle varying task parameters.


A Method for Compact Image Representation Using Sparse Matrix and Tensor Projections Onto Exemplar Orthonormal Bases

We present a new method for compact representation of large image datasets. Our method is based on treating small patches from a 2-D image as matrices as opposed to the conventional vectorial representation, and encoding these patches as sparse projections onto a set of exemplar orthonormal bases, which are learned a priori from a training set. The end result is a low-error, highly compact image/patch representation that has significant theoretical merits and compares favorably with existing techniques (including JPEG) on experiments involving the compression of ORL and Yale face databases, as well as a database of miscellaneous natural images. In the context of learning multiple orthonormal bases, we show the easy tunability of our method to efficiently represent patches of different complexities. Furthermore, we show that our method is extensible in a theoretically sound manner to higher-order matrices (¿tensors¿). We demonstrate applications of this theory to compression of well-known color image datasets such as the GaTech and CMU-PIE face databases and show performance competitive with JPEG. Lastly, we also analyze the effect of image noise on the performance of our compression schemes.


Place-Its: A Study of Location-Based Reminders on Mobile Phones

Context-awareness can improve the usefulness of automated reminders. However, context-aware reminder applications have yet to be evaluated throughout a person’s daily life. Mobile phones provide a potentially convenient and truly ubiquitous platform for the detection of personal context such as location, as well as the delivery of reminders. We designed Place-Its, a location-based reminder application that runs on mobile phones, to study people using location-aware reminders throughout their daily lives. We describe the design of Place-Its and a two-week exploratory user study. The study reveals that location-based reminders are useful, in large part because people use location in


MULTISCALE ENTANGLEMENT RENORMALIZATION ANSATZ

The goal of this paper is to demonstrate a method for tensorizing neural networks based upon an efficient way of approximating scale invariant quantum states, the Multi-scale Entanglement Renormalization Ansatz (MERA). We employ MERA as a replacement for linear layers in a neural network and test this implementation on the CIFAR-10 dataset. The proposed method outperforms factorization using tensor trains, providing greater compression for the same level of accuracy and greater accuracy for the same level of compression. We demonstrate MERAlayers with 3900 times fewer parameters and a reduction in accuracy of less than 1% compared to the equivalent fully connected layers.


Parametric and nonparametric linkage analysis: a unified multipoint approach.

In complex disease studies, it is crucial to perform multipoint linkage analysis with many markers and to use robust nonparametric methods that take account of all pedigree information. Currently available methods fall short in both regards. In this paper, we describe how to extract complete multipoint inheritance information from general pedigrees of moderate size. This information is captured in the multipoint inheritance distribution, which provides a framework for a unified approach to both parametric and nonparametric methods of linkage analysis. Specifically, the approach includes the following: (1) Rapid exact computation of multipoint LOD scores involving dozens of highly polymorphic markers, even in the presence of loops and missing data. (2) Non-parametric linkage (NPL) analysis, a powerful new approach to pedigree analysis. We show that NPL is robust to uncertainty about mode of inheritance, is much more powerful than commonly used nonparametric methods, and loses little power relative to parametric linkage analysis. NPL thus appears to be the method of choice for pedigree studies of complex traits. (3) Information-content mapping, which measures the fraction of the total inheritance information extracted by the available marker data and points out the regions in which typing additional markers is most useful. (4) Maximum-likelihood reconstruction of many-marker haplotypes, even in pedigrees with missing data. We have implemented NPL analysis, LOD-score computation, information-content mapping, and haplotype reconstruction in a new computer package, GENEHUNTER. The package allows efficient multipoint analysis of pedigree data to be performed rapidly in a single user-friendly environment.


Extensions of Parallel Coordinates for Interactive Exploration of Large Multi-Timepoint Data Sets

Parallel coordinate plots (PCPs) are commonly used in information visualization to provide insight into multi-variate data. These plots help to spot correlations between variables. PCPs have been successfully applied to unstructured datasets up to a few millions of points. In this paper, we present techniques to enhance the usability of PCPs for the exploration of large, multi-timepoint volumetric data sets, containing tens of millions of points per timestep. The main difficulties that arise when applying PCPs to large numbers of data points are visual clutter and slow performance, making interactive exploration infeasible. Moreover, the spatial context of the volumetric data is usually lost. We describe techniques for preprocessing using data quantization and compression, and for fast GPU-based rendering of PCPs using joint density distributions for each pair of consecutive variables, resulting in a smooth, continuous visualization. Also, fast brushing techniques are proposed for interactive data selection in multiple linked views, including a 3D spatial volume view. These techniques have been successfully applied to three large data sets: Hurricane Isabel (Vis'04 contest), the ionization front instability data set (Vis'08 design contest), and data from a large-eddy simulation of cumulus clouds. With these data, we show how PCPs can be extended to successfully visualize and interactively explore multi-timepoint volumetric datasets with an order of magnitude more data points.


Curved Folded Plate Timber Structures

Current research at the laboratory for timber construction IBOIS at EPFL focuses on shell structures. Two main families are investigated: shells made of linear elements, as timber rib shells, and shells made of surface elements, typically folded plate structures. With regard to timber rib shells, bent linear timber elements are used to create the shape of a shell. With folded plate structures, new timber derived products are used to create structures made of planar panels, where the panel simultaneously covers space and acts as load bearing element. Indeed, timber industry has developed in the last fifteen years new large-size timber panels. Composition and dimensions of these panels and the possibility of milling them with Computer Numerical Controlled machines shows great potential for folded plate structures. In the present paper we investigate to combine both approaches using bent timber panels for curved folded plate structures.


Food region segmentation in meal images using touch points

We propose an interactive scheme for segmenting meal images for automated dietary assessment. A smartphone user photographs a meal and marks a few touch points on the resulting image. The segmentation algorithm initializes a set of food segments with the touch points, and grows them using local image features. We evaluate the algorithm with a data set consisting of 300 manually segmented meal images. The precision of segmentation is 0.87, compared with 0.70 for fully automatic segmentation. The results show that the precision of segmentation was significantly improved by incorporating minimal user intervention.


Recurrent Capsule Network for Relations Extraction: A Practical Application to the Severity Classification of Coronary Artery Disease

Coronary artery disease (CAD) is one of the leading causes of cardiovascular disease deaths. CAD condition progresses rapidly, if not diagnosed and treated at an early stage may eventually lead to an irreversible state of the heart muscle death. Invasive coronary arteriography is the gold standard technique for CAD diagnosis. Coronary arteriography texts describe which part has stenosis and how much stenosis is in details. It is crucial to conduct the severity classification of CAD. In this paper, we propose a recurrent capsule network (RCN) to extract semantic relations between clinical named entities in Chinese coronary arteriography texts, through which we can automatically find out the maximal stenosis for each lumen to inference how severe CAD is according to the improved method of Gensini. Experimental results on the corpus collected from Shanghai Shuguang Hospital show that our proposed RCN model achieves a F1-score of 0.9641 in relation extraction, which outperforms the baseline methods.


A Novel User Authentication Scheme Based on QR-Code

User authentication is one of the fundamental procedures to ensure secure communications and share system resources over an insecure public network channel. Thus, a simple and efficient authentication mechanism is required for securing the network system in the real environment. In general, the password-based authentication mechanism provides the basic capability to prevent unauthorized access. Especially, the purpose of the one-time password is to make it more difficult to gain unauthorized access to restricted resources. Instead of using the password file as conventional authentication systems, many researchers have devoted to implement various one-time password schemes using smart cards, time-synchronized token or short message service in order to reduce the risk of tampering and maintenance cost. However, these schemes are impractical because of the far from ubiquitous hardware devices or the infrastructure requirements. To remedy these weaknesses, the attraction of the QR-code technique can be introduced into our one-time password authentication protocol. Not the same as before, the proposed scheme based on QR code not only eliminates the usage of the password verification table, but also is a cost effective solution since most internet users already have mobile phones. For this reason, instead of carrying around a separate hardware token for each security domain, the superiority of handiness benefit from the mobile phone makes our approach more practical and convenient.


Knowledge manipulation activities: results of a Delphi study

Knowledge-based organizations are hosts for multitudes of knowledge management (KM) episodes. Each episode is triggered by a knowledge need and culminates with the satisfaction of that need (or its abandonment). Within an episode, one or more of the organization’ processors (human and/or computer-based) manipulate knowledge resources in various ways in an effort to meet the need. This paper identifies and characterizes a generic set of elemental knowledge manipulation activities that can be arranged in a variety of patterns within KM episodes. It also indicates possible knowledge flows that can occur among the activities. This descriptive framework was developed using conceptual synthesis and a Delphi methodology involving an international panel of researchers and practitioners in the KM field. The framework can serve as a common language for discourse about knowledge manipulation. For researchers, it suggests issues that deserve investigation and concepts that must be considered in explorations of KM episodes. For practitioners, the framework provides a perspective on activities that need to be considered in the design, measurement, control, coordination, and support of an organization’ KM episodes. # 2002 Elsevier Science B.V. All rights reserved.


Brain activities associated with gaming urge of online gaming addiction.

The aim of this study was to identify the neural substrates of online gaming addiction through evaluation of the brain areas associated with the cue-induced gaming urge. Ten participants with online gaming addiction and 10 control subjects without online gaming addiction were tested. They were presented with gaming pictures and the paired mosaic pictures while undergoing functional magnetic resonance imaging (fMRI) scanning. The contrast in blood-oxygen-level dependent (BOLD) signals when viewing gaming pictures and when viewing mosaic pictures was calculated with the SPM2 software to evaluate the brain activations. Right orbitofrontal cortex, right nucleus accumbens, bilateral anterior cingulate and medial frontal cortex, right dorsolateral prefrontal cortex, and right caudate nucleus were activated in the addicted group in contrast to the control group. The activation of the region-of-interest (ROI) defined by the above brain areas was positively correlated with self-reported gaming urge and recalling of gaming experience provoked by the WOW pictures. The results demonstrate that the neural substrate of cue-induced gaming urge/craving in online gaming addiction is similar to that of the cue-induced craving in substance dependence. The above-mentioned brain regions have been reported to contribute to the craving in substance dependence, and here we show that the same areas were involved in online gaming urge/craving. Thus, the results suggest that the gaming urge/craving in online gaming addiction and craving in substance dependence might share the same neurobiological mechanism.


Enhancing well-being and alleviating depressive symptoms with positive psychology interventions: a practice-friendly meta-analysis.

Do positive psychology interventions-that is, treatment methods or intentional activities aimed at cultivating positive feelings, positive behaviors, or positive cognitions-enhance well-being and ameliorate depressive symptoms? A meta-analysis of 51 such interventions with 4,266 individuals was conducted to address this question and to provide practical guidance to clinicians. The results revealed that positive psychology interventions do indeed significantly enhance well-being (mean r=.29) and decrease depressive symptoms (mean r=.31). In addition, several factors were found to impact the effectiveness of positive psychology interventions, including the depression status, self-selection, and age of participants, as well as the format and duration of the interventions. Accordingly, clinicians should be encouraged to incorporate positive psychology techniques into their clinical work, particularly for treating clients who are depressed, relatively older, or highly motivated to improve. Our findings also suggest that clinicians would do well to deliver positive psychology interventions as individual (versus group) therapy and for relatively longer periods of time.


ARLearn: Augmented Reality Meets Augmented Virtuality

This article deals with educational opportunities for mixed reality games and related scenarios for learning. It discusses several issues and educational challenges to be tackled when linking augmented reality and augmented virtuality. Second, the paper describes the architecture of the ARLearn system which offers highly flexible support for different educational settings. Three prototypical use cases implemented based on the underlying ARLearn framework are discussed, which are a field trip system, an augmented Google StreetView client called StreetLearn, and a real time crisis intervention game. ARLearn combines real time notification and mixed reality games across Mobile Augmented Reality and Virtual Reality and the authors aim to use the underlying (open source) framework for further case studies and mixed reality applications for learning support.


High-quality computational imaging through simple lenses

Modern imaging optics are highly complex systems consisting of up to two dozen individual optical elements. This complexity is required in order to compensate for the geometric and chromatic aberrations of a single lens, including geometric distortion, field curvature, wavelength-dependent blur, and color fringing.
 In this article, we propose a set of computational photography techniques that remove these artifacts, and thus allow for postcapture correction of images captured through uncompensated, simple optics which are lighter and significantly less expensive. Specifically, we estimate per-channel, spatially varying point spread functions, and perform nonblind deconvolution with a novel cross-channel term that is designed to specifically eliminate color fringing.


Feature vector selection and projection using kernels

This paper provides new insight into kernel methods by using data selection. The kernel trick is used to select from the data a relevant subset forming a basis in a feature space F . Thus the selected vectors de,ne a subspace in F . Then, the data is projected onto this subspace where classical algorithms are applied. We show that kernel methods like generalized discriminant analysis (Neural Comput. 12 (2000) 2385) or kernel principal component analysis (Neural Comput. 10 (1998) 1299) can be expressed more easily. Moreover, it will turn out that the size of the basis is related to the complexity of the model. Therefore, the data selection leads to a complexity control and thus to a better generalization. The approach covers a wide range of algorithms. We investigate the function approximation on real classi,cation problems and on a regression problem. c © 2003 Elsevier B.V. All rights reserved.


A case for stateful forwarding plane

In Named Data Networking (NDN), packets carry data names instead of source and destination addresses. This paradigm shift leads to a new network forwarding plane: data consumers send Interest packets to request desired data, routers forward Interest packets and maintain the state of all pending Interests, which is then used to guide Data packets back to the consumers. Maintaining the pending Interest state, together with the two-way Interest and Data exchange, enables NDN routers’ forwarding process to measure performance of different paths, quickly detect failures and retry alternative paths. In this paper we describe an initial design of NDN’s forwarding plane and evaluate its data delivery performance under adverse conditions. Our results show that this stateful forwarding plane can successfully circumvent prefix hijackers, avoid failed links, and utilize multiple paths to mitigate congestion. We also compare NDN’s performance with that of IP-based solutions to highlight the advantages of a stateful forwarding plane. 2013 Elsevier B.V. All rights reserved.


An ontology-based approach for the reconstruction and analysis of digital incidents timelines

Due to the democratisation of new technologies, computer forensics investigators have to deal with volumes of data which are becoming increasingly large and heterogeneous. Indeed, in a single machine, hundred of events occur per minute, produced and logged by the operating system and various software. Therefore, the identification of evidence, and more generally, the reconstruction of past events is a tedious and time-consuming task for the investigators. Our work aims at reconstructing and analysing automatically the events related to a digital incident, while respecting legal requirements. To tackle those three main problems (volume, heterogeneity and legal requirements), we identify seven necessary criteria that an efficient reconstruction tool must meet to address these challenges. This paper introduces an approach based on a three-layered ontology, called ORD2I, to represent any digital events. ORD2I is associated with a set of operators to analyse the resulting timeline and to ensure the reproducibility of the investigation. © 2015 Elsevier Ltd. All rights reserved.


Assessing heterogeneity in meta-analysis: Q statistic or I2 index?

In meta-analysis, the usual way of assessing whether a set of single studies is homogeneous is by means of the Q test. However, the Q test only informs meta-analysts about the presence versus the absence of heterogeneity, but it does not report on the extent of such heterogeneity. Recently, the I(2) index has been proposed to quantify the degree of heterogeneity in a meta-analysis. In this article, the performances of the Q test and the confidence interval around the I(2) index are compared by means of a Monte Carlo simulation. The results show the utility of the I(2) index as a complement to the Q test, although it has the same problems of power with a small number of studies.


BloomFlash: Bloom Filter on Flash-Based Storage

The bloom filter is a probabilistic data structure that provides a compact representation of a set of elements. To keep false positive probabilities low, the size of the bloom filter must be dimensioned a priori to be linear in the maximum number of keys inserted, with the linearity constant ranging typically from one to few bytes. A bloom filter is most commonly used as an in memory data structure, hence its size is limited by the availability of RAM space on the machine. As datasets have grown over time to Internet scale, so have the RAM space requirements of bloom filters. If sufficient RAM space is not available, we advocate that flash memory may serve as a suitable medium for storing bloom filters, since it is about one-tenth the cost of RAM per GB while still providing access times orders of magnitude faster than hard disk. We present BLOOMFLASH, a bloom filter designed for flash memory based storage, that provides a new dimension of trade off with bloom filter access times to reduce RAM space usage (and hence system cost). The simple design of a single flat bloom filter on flash suffers from many performance bottlenecks, including in-place bit updates that are inefficient on flash and multiple reads and random writes spread out across many flash pages for a single lookup or insert operation. To mitigate these performance bottlenecks, BLOOMFLASH leverages two key design innovations: (i) buffering bit updates in RAM and applying them in bulk to flash that helps to reduce random writes to flash, and (ii) a hierarchical bloom filter design consisting of component bloom filters, stored one per flash page, that helps to localize reads and writes on flash. We use two real-world data traces taken from representative bloom filter applications to drive and evaluate our design. BLOOMFLASH achieves bloom filter access times in the range of few tens of microseconds, thus allowing up to order of tens of thousands operations per sec.


Optimizing the Hadoop MapReduce Framework with high-performance storage devices

Solid-state drives (SSDs) are an attractive alternative to hard disk drives (HDDs) to accelerate the Hadoop MapReduce Framework. However, the SSD characteristics and today’s Hadoop framework exhibit mismatches that impede indiscriminate SSD integration. This paper explores how to optimize a Hadoop MapReduce Framework with SSDs in terms of performance, cost, and energy consumption. It identifies extensible best practices that can exploit SSD benefits within Hadoop when combined with high network bandwidth and increased parallel storage access. Our Terasort benchmark results demonstrate that Hadoop currently does not sufficiently exploit SSD throughput. Hence, using faster SSDs in Hadoop does not enhance its performance. We show that SSDs presently deliver significant efficiency when storing intermediate Hadoop data, leaving HDDs for Hadoop Distributed File System (HDFS). The proposed configuration is optimized with the JVM reuse option and frequent heartbeat interval option. Moreover, we examined the performance of a state-of-the-art non-volatile memory express interface SSD within the Hadoop MapReduce Framework. While HDFS read and write throughput increases with high-performance SSDs, achieving complete system performance improvement requires carefully balancing CPU, network, and storage resource capabilities at a system level.


HoPE: Hot-Cacheline Prediction for Dynamic Early Decompression in Compressed LLCs

Data compression plays a pivotal role in improving system performance and reducing energy consumption, because it increases the logical effective capacity of a compressed memory system without physically increasing the memory size. However, data compression techniques incur some cost, such as non-negligible compression and decompression overhead. This overhead becomes more severe if compression is used in the cache. In this article, we aim to minimize the read-hit decompression penalty in compressed Last-Level Caches (LLCs) by speculatively decompressing frequently used cachelines. To this end, we propose a Hot-cacheline Prediction and Early decompression (HoPE) mechanism that consists of three synergistic techniques: Hot-cacheline Prediction (HP), Early Decompression (ED), and Hit-history-based Insertion (HBI). HP and HBI efficiently identify the hot compressed cachelines, while ED selectively decompresses hot cachelines, based on their size information. Unlike previous approaches, the HoPE framework considers the performance balance/tradeoff between the increased effective cache capacity and the decompression penalty. To evaluate the effectiveness of the proposed HoPE mechanism, we run extensive simulations on memory traces obtained from multi-threaded benchmarks running on a full-system simulation framework. We observe significant performance improvements over compressed cache schemes employing the conventional Least-Recently Used (LRU) replacement policy, the Dynamic Re-Reference Interval Prediction (DRRIP) scheme, and the Effective Capacity Maximizer (ECM) compressed cache management mechanism. Specifically, HoPE exhibits system performance improvements of approximately 11%, on average, over LRU, 8% over DRRIP, and 7% over ECM by reducing the read-hit decompression penalty by around 65%, over a wide range of applications.


Measuring praise and criticism: Inference of semantic orientation from association

The evaluative character of a word is called its semantic orientation. Positive semantic orientation indicates praise (e.g., "honest", "intrepid") and negative semantic orientation indicates criticism (e.g., "disturbing", "superfluous"). Semantic orientation varies in both direction (positive or negative) and degree (mild to strong). An automated system for measuring semantic orientation would have application in text classification, text filtering, tracking opinions in online discussions, analysis of survey responses, and automated chat systems (chatbots). This article introduces a method for inferring the semantic orientation of a word from its statistical association with a set of positive and negative paradigm words. Two instances of this approach are evaluated, based on two different statistical measures of word association: pointwise mutual information (PMI) and latent semantic analysis (LSA). The method is experimentally tested with 3,596 words (including adjectives, adverbs, nouns, and verbs) that have been manually labeled positive (1,614 words) and negative (1,982 words). The method attains an accuracy of 82.8% on the full test set, but the accuracy rises above 95% when the algorithm is allowed to abstain from classifying mild words.


Human behavior and the principle of least effort : An introduction to human ecology

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.


Direct Manipulation Interfaces

Approach • Social information independent of physical analog s – Text (e.g., emote) – abstract graphical representations (e.g., chat cir cles) • Interested in Abstract Approach a. Creates and deploys working systems b. Lack of attention Babble Prototype


Fine-grained metadata journaling on NVM

Journaling file systems have been widely used where data consistency must be assured. However, we observed that the overhead of journaling can cause up to 48.2% performance drop under certain kinds of workloads. On the other hand, the emerging high-performance, byte-addressable Non-volatile Memory (NVM) has the potential to minimize such overhead by being used as the journal device. The traditional journaling mechanism based on block devices is nevertheless unsuitable for NVM due to the write amplification of metadata journal we observed. In this paper, we propose a fine-grained metadata journal mechanism to fully utilize the low-latency byte-addressable NVM so that the overhead of journaling can be significantly reduced. Based on the observation that conventional block-based metadata journal contains up to 90% clean metadata that is unnecessary to be journalled, we design a fine-grained journal format for byte-addressable NVM which contains only modified metadata. Moreover, we redesign the process of transaction committing, checkpointing and recovery in journaling file systems utilizing the new journal format. Therefore, thanks to the reduced amount of ordered writes to NVM, the overhead of journaling can be reduced without compromising the file system consistency. Experimental results show that our NVM-based fine-grained metadata journaling is up to 15.8× faster than the traditional approach under FileBench workloads.


Individual ball possession in soccer

This paper describes models for detecting individual and team ball possession in soccer based on position data. The types of ball possession are classified as Individual Ball Possession (IBC), Individual Ball Action (IBA), Individual Ball Control (IBC), Team Ball Possession (TBP), Team Ball Control (TBC) und Team Playmaking (TPM) according to different starting points and endpoints and the type of ball control involved. The machine learning approach used is able to determine how long the ball spends in the sphere of influence of a player based on the distance between the players and the ball together with their direction of motion, speed and the acceleration of the ball. The degree of ball control exhibited during this phase is classified based on the spatio-temporal configuration of the player controlling the ball, the ball itself and opposing players using a Bayesian network. The evaluation and application of this approach uses data from 60 matches in the German Bundesliga season of 2013/14, including 69,667 IBA intervals. The identification rate was F = .88 for IBA and F = .83 for IBP, and the classification rate for IBC was κ = .67. Match analysis showed the following mean values per match: TBP 56:04 ± 5:12 min, TPM 50:01 ± 7:05 min and TBC 17:49 ± 8:13 min. There were 836 ± 424 IBC intervals per match and their number was significantly reduced by -5.1% from the 1st to 2nd half. The analysis of ball possession at the player level indicates shortest accumulated IBC times for the central forwards (0:49 ± 0:43 min) and the longest for goalkeepers (1:38 ± 0:58 min), central defenders (1:38 ± 1:09 min) and central midfielders (1:27 ± 1:08 min). The results could improve performance analysis in soccer, help to detect match events automatically, and allow discernment of higher value tactical structures, which is based on individual ball possession.


Tank-Like Module-Based Climbing Robot Using Passive Compliant Joints

This paper proposes an underactuated modular climbing robot with flat dry elastomer adhesives. This robot is designed to achieve high speed, high payload, and dexterous motions that are typical drawbacks of previous climbing robots. Each module is designed as a tread-wheeled mechanism to simultaneously realize high speed and high adhesive force. Two modules are connected by compliant joints, which induce a positive preload on the front wheels resulting in stable climbing and high payload capacity. Compliant joints also help the robot to perform various transitions. An active tail is adopted to regulate the preload of the second module. Force transfer equations are derived and stable operating conditions are verified. The stiffness coefficients of the compliant joints and the active tail force are determined optimally to satisfy the constraints of stable operation. The prototype two-module robot achieves 6-cm/s speed and 500-g payload capacity on vertical surfaces. The abilities of flat surface locomotion, internal, external, and thin-wall transitions, and overcoming various sized obstacles are validated through experiment. The principle of joint compliance can be adopted in other climbing robots to enhance their stability and transition capability.


Sparse Bayesian Extreme Learning Machine for Multi-classification

Extreme learning machine (ELM) has become a popular topic in machine learning in recent years. ELM is a new kind of single-hidden layer feedforward neural network with an extremely low computational cost. ELM, however, has two evident drawbacks: 1) the output weights solved by Moore-Penrose generalized inverse is a least squares minimization issue, which easily suffers from overfitting and 2) the accuracy of ELM is drastically sensitive to the number of hidden neurons so that a large model is usually generated. This brief presents a sparse Bayesian approach for learning the output weights of ELM in classification. The new model, called Sparse Bayesian ELM (SBELM), can resolve these two drawbacks by estimating the marginal likelihood of network outputs and automatically pruning most of the redundant hidden neurons during learning phase, which results in an accurate and compact model. The proposed SBELM is evaluated on wide types of benchmark classification problems, which verifies that the accuracy of SBELM model is relatively insensitive to the number of hidden neurons; and hence a much more compact model is always produced as compared with other state-of-the-art neural network classifiers.


An Integrated Environment for the Development of Knowledge-Based Recommender Applications

The complexity of product assortments offered by online selling platforms makes the selection of appropriate items a challenging task. Customers can differ significantly in their expertise and level of knowledge regarding such product assortments. Consequently, intelligent recommender systems are required which provide personalized dialogues supporting the customer in the product selection process. In this paper we present the domainindependent, knowledge-based recommender environment CWAdvisor which assists users by guaranteeing the consistency and appropriateness of solutions, by identifying additional selling opportunities, and by providing explanations for solutions. Using examples from different application domains, we show how model-based diagnosis, personalization, and intuitive knowledge acquisition techniques support the effective implementation of customer-oriented sales dialogues. In this context, we report our experiences gained in industrial projects and present an evaluation of successfully deployed recommender applications.


Agile distributed software development: enacting control through media and context

While face-to-face interaction is fundamental in agile software development, distributed environments must rely extensively on mediated interactions. Practicing agile principles in distributed environments therefore poses particular control challenges related to balancing fixed vs. evolving quality requirements and people vs. process-based collaboration. To investigate these challenges, we conducted an in-depth case study of a successful agile distributed software project with participants from a Russian firm and a Danish firm. Applying Kirsch’s elements of control framework, we offer an analysis of how control was enacted through the project context and in the participants’ mediated communication. The analysis reveals that formal measurement and evaluation control were persistently enacted through mediated communication. These formal control practices were, however, predominantly carried out in conjunction with informal roles and relationships such as clan-like control inherent in agile development. Overall, the study demonstrates that, if appropriately applied, communication technologies can significantly support distributed, agile practices by allowing concurrent enactment of both formal and informal controls. The paper discusses these findings as they relate to previous research and concludes with their implications for future research.


Active Learning with Oracle Epiphany

We present a theoretical analysis of active learning with more realistic interactions with human oracles. Previous empirical studies have shown oracles abstaining on difficult queries until accumulating enough information to make label decisions. We formalize this phenomenon with an “oracle epiphany model” and analyze active learning query complexity under such oracles for both the realizable and the agnostic cases. Our analysis shows that active learning is possible with oracle epiphany, but incurs an additional cost depending on when the epiphany happens. Our results suggest new, principled active learning approaches with realistic oracles.


CLOS: Integrating Object-Oriented and Functional Programming

Lisp has a long history as a functional language,* where action is invoked by calling a procedure, and where procedural abstraction and encapsulation provide convenient modularity boundaries. A number of attempts have been made to graft object-oriented programming into this framework without losing the essential character of Lisp—to include the benefits of data abstraction, extensible type classification, incremental operator definition, and code reuse through an inheritance hierarchy.
The Common Lisp Object System (CLOS) [3], a result of the ANSI standardization process for Common Lisp, represents a marriage of these two traditions. This article explores the landscape in which the major object-oriented facilities exist, showing how the CLOS solution is effective within the two contexts.


Time-Bounded Authentication of FPGAs

This paper introduces a novel technique to authenticate and identify field-programmable gate arrays (FPGAs). The technique uses the reconfigurability feature of FPGAs to perform self-characterization and extract the unique timing of the FPGA building blocks over the space of possible inputs. The characterization circuit is then exploited for constructing a physically unclonable function (PUF). The PUF can accept different forms of challenges including pulsewidth, digital binary, and placement challenges. The responses from the PUF are only verifiable by entities with access to the unique timing signature. However, the authentic device is the only entity who can respond within a given time constraint. The constraint is set by the gap between the speed of PUF evaluation on authentic hardware and simulation of its behavior. A suite of authentication protocols is introduced based on the time-bounded mechanism. We ensure that the responses are robust to fluctuations in operational conditions such as temperature and voltage variations by employing: 1) a linear calibration mechanism that adjusts the clock frequency by a feedback from on-chip temperature and voltage sensor readings, and 2) a differential PUF structure with real-valued responses that cancels out the common impact of variations on delays. Security against various attacks is discussed and a proof-of-concept implementation of signature extraction and authentication are demonstrated on Xilinx Virtex 5 FPGAs.


The Weibull-G Family of Probability Distributions

Abstract: The Weibull distribution is the most important distribution for problems in reliability. We study some mathematical properties of the new wider Weibull-G family of distributions. Some special models in the new family are discussed. The properties derived hold to any distribution in this family. We obtain general explicit expressions for the quantile function, ordinary and incomplete moments, generating function and order statistics. We discuss the estimation of the model parameters by maximum likelihood and illustrate the potentiality of the extended family with two applications to real data.


Reduction of Computational Efforts in Finite Element-Based Permanent Magnet Traction Motor Optimization

This paper presents a method for reducing computational time in constrained single objective optimization problems related to permanent magnet motors modeled using computationally intensive finite element method. The method is based on differential evolution algorithm. The principal approach is to interrupt the evaluation of inequality constraints after encountering the constraint which is violated and continue their evaluation only if better solutions are obtained in comparison with the candidate vector from the previous generation both in terms of inequality constraints and the cost function. This approach avoids unnecessary time consuming finite element calculations required for solving the inequality constraints and saves the overall optimization time without affecting the convergence rate. The main features of this approach and how it complements the existing method for handling inequality constraints in Differential Evolution algorithm is demonstrated on design optimization of an interior permanent magnet motor for the low-floor tram TMK 2200. The motor geometry is optimized for maximum torque density.


State-of-the-art autogenous ear reconstruction in cases of microtia.

Ear reconstruction is considered to be a challenging form of surgery. In cases of microtia, surgeons must reconstruct complex missing contours, which necessitates the use of a support and skin remnants to cover this support. Although the use of synthetic material has been proposed in order to avoid harvesting and carving cartilage, the best long-term choice for reconstructing an ear is autologous rib cartilage. This procedure requires good understanding of the 3-dimensional architecture of the ear and learning the step-by-step construction of a harmonious framework (which with practice will become the most straightforward part of the procedure). Surgery, usually performed at the age of 9 or 10 years, is planned in 2 stages. In the first stage, the framework is placed under a skin pocket. Six months later, the sulcus is created using an additional cartilage graft for projection and a skin-grafted galeal fascial flap. In order to shorten the learning curve, a detailed carving process is described here, as well as a tool to enable training before surgery. Remnants of the microtic ear can have many different shapes; therefore, a comprehensive approach to skin management is proposed, providing a simple surgical classification for all types of microtia. Furthermore, some refinements of the cartilage framework and the construction of the retroauricular sulcus have improved results. Whenever possible, successful reconstruction of a microtic ear with autologous rib cartilage, as opposed to synthetic materials, is by far the best option.


An alignment based similarity measure for hand detection in cluttered sign language video

Locating hands in sign language video is challenging due to a number of factors. Hand appearance varies widely across signers due to anthropometric variations and varying levels of signer proficiency. Video can be captured under varying illumination, camera resolutions, and levels of scene clutter, e.g., high-res video captured in a studio vs. low-res video gathered by a Web cam in a user's home. Moreover, the signers' clothing varies, e.g., skin-toned clothing vs. contrasting clothing, short-sleeved vs. long-sleeved shirts, etc. In this work, the hand detection problem is addressed in an appearance matching framework. The histogram of oriented gradient (HOG) based matching score function is reformulated to allow non-rigid alignment between pairs of images to account for hand shape variation. The resulting alignment score is used within a support vector machine hand/not-hand classifier for hand detection. The new matching score function yields improved performance (in ROC area and hand detection rate) over the vocabulary guided pyramid match kernel (VGPMK) and the traditional, rigid HOG distance on American Sign Language video gestured by expert signers. The proposed match score function is computationally less expensive (for training and testing), has fewer parameters and is less sensitive to parameter settings than VGPMK. The proposed detector works well on test sequences from an inexpert signer in a non-studio setting with cluttered background.


Phylogenetic analysis in the anomaly zone.

The concatenation method has been widely used as a means of combining data to estimate phylogenetic trees (Huelsenbeck et al. 1996a, 1996b; Glazko and Nei 2003). However, simulation studies have shown that the maximum likelihood (ML) estimate of the species tree for concatenated sequences may be statistically inconsistent if the gene trees are highly heterogeneous (Kolaczkowski and Thornton 2004; Kubatko and Degnan 2007). Recently, Degnan and Rosenberg (2006) defined an “anomaly zone”—a set of short internal branches in species trees that will generate gene trees that are discordant with the species tree more often than gene trees that are concordant. Kubatko and Degnan (2007) went on to show that when DNA sequences are generated from gene trees simulated from species trees in the anomaly zone, as well as from species trees slightly outside this zone but still with short internal branches, the ML estimate of the species tree for the concatenated sequences can be inconsistent, resulting in increasing certainty in the wrong species tree. These studies were all performed with a molecular clock on rooted gene and species trees within the variation realized in stochastic simulations of DNA sequences under the Jukes and Cantor (1969) model of nucleotide substitution. They applied the ML method with a clock to recover phylogenetic trees from their simulated concatenated data sets. In this paper, we show that phylogenetic methods that solely utilize the relative order of divergences among a set of DNA sequences as a criterion for inferring phylogenies, such as the unweighted pair group method with arithmetic mean (UPGMA), are statistically consistent even when DNA sequences are generated from gene trees simulated from species trees in the anomaly zone. In addition, we use simulation to assess the performance of a variety of tree construction methods when analyzing concatenated sequences generated from 4 and 5-taxon species tree located in the anomaly zone and show that a variety of methods do in fact recover the correct species tree topology, whereas ML, with or without a molecular clock, remains inconsistent. However, the branch lengths of the tree inferred from concatenated data are inevitably overestimated, as predicted by theory. Finally, simulations also suggest that a newly proposed Bayesian approach for estimating species trees from multiple unlinked loci, BEST (Liu and Pearl 2007; Liu et al. 2008), is consistent in both topology and branch lengths on data sets generated from species trees in the anomaly zone. THEORETICAL RESULTS


Autocomplete hand-drawn animations

Hand-drawn animation is a major art form and communication medium, but can be challenging to produce. We present a system to help people create frame-by-frame animations through manual sketches. We design our interface to be minimalistic: it contains only a canvas and a few controls. When users draw on the canvas, our system silently analyzes all past sketches and predicts what might be drawn in the future across spatial locations and temporal frames. The interface also offers suggestions to beautify existing drawings. Our system can reduce manual workload and improve output quality without compromising natural drawing flow and control: users can accept, ignore, or modify such predictions visualized on the canvas by simple gestures. Our key idea is to extend the local similarity method in [Xing et al. 2014], which handles only low-level spatial repetitions such as hatches within a single frame, to a global similarity that can capture high-level structures across multiple frames such as dynamic objects. We evaluate our system through a preliminary user study and confirm that it can enhance both users' objective performance and subjective satisfaction.


An MEG-based brain–computer interface (BCI)

Brain-computer interfaces (BCIs) allow for communicating intentions by mere brain activity, not involving muscles. Thus, BCIs may offer patients who have lost all voluntary muscle control the only possible way to communicate. Many recent studies have demonstrated that BCIs based on electroencephalography (EEG) can allow healthy and severely paralyzed individuals to communicate. While this approach is safe and inexpensive, communication is slow. Magnetoencephalography (MEG) provides signals with higher spatiotemporal resolution than EEG and could thus be used to explore whether these improved signal properties translate into increased BCI communication speed. In this study, we investigated the utility of an MEG-based BCI that uses voluntary amplitude modulation of sensorimotor mu and beta rhythms. To increase the signal-to-noise ratio, we present a simple spatial filtering method that takes the geometric properties of signal propagation in MEG into account, and we present methods that can process artifacts specifically encountered in an MEG-based BCI. Exemplarily, six participants were successfully trained to communicate binary decisions by imagery of limb movements using a feedback paradigm. Participants achieved significant mu rhythm self control within 32 min of feedback training. For a subgroup of three participants, we localized the origin of the amplitude modulated signal to the motor cortex. Our results suggest that an MEG-based BCI is feasible and efficient in terms of user training.


3D Reconstruction of Human Skeleton from Single Images or Monocular Video Sequences

In this paper, we first review the approaches to recover 3D shape and related movements of a human and then we present an easy and reliable approach to recover a 3D model using just one image or monocular video sequence. A simplification of the perspective camera model is required, due to the absence of stereo view. The human figure is reconstructed in a skeleton form and to improve the visual quality, a pre-defined human model is also fitted to the recovered 3D data.


Estimation of Primary Quantization Matrix in Double Compressed JPEG Images

In this report, we present a method for estimation of primary quantization matrix from a double compressed JPEG image. We first identify characteristic features that occur in DCT histograms of individual coefficients due to double compression. Then, we present 3 different approaches that estimate the original quantization matrix from double compressed images. Finally, most successful of them Neural Network classifier is discussed and its performance and reliability is evaluated in a series of experiments on various databases of double compressed images. It is also explained in this paper, how double compression detection techniques and primary quantization matrix estimators can be used in steganalysis of JPEG files and in digital forensic analysis for detection of digital forgeries.


Crowd analysis using visual and non-visual sensors, a survey

This paper proposes a critical survey of crowd analysis techniques using visual and non-visual sensors. Automatic crowd understanding has a massive impact on several applications including surveillance and security, situation awareness, crowd management, public space design, intelligent and virtual environments. In case of emergency, it enables practical safety applications by identifying crowd situational context information. This survey identifies different approaches as well as relevant work on crowd analysis by means of visual and non-visual techniques. Multidisciplinary research groups are addressing crowd phenomenon and its dynamics ranging from social, and psychological aspects to computational perspectives. The possibility to use smartphones as sensing devices and fuse this information with video sensors data, allows to better describe crowd dynamics and behaviors. Eventually, challenges and further research opportunities with reference to crowd analysis are exposed.


Rare adipose disorders (RADs) masquerading as obesity

Rare adipose disorders (RADs) including multiple symmetric lipomatosis (MSL), lipedema and Dercum's disease (DD) may be misdiagnosed as obesity. Lifestyle changes, such as reduced caloric intake and increased physical activity are standard care for obesity. Although lifestyle changes and bariatric surgery work effectively for the obesity component of RADs, these treatments do not routinely reduce the abnormal subcutaneous adipose tissue (SAT) of RADs. RAD SAT likely results from the growth of a brown stem cell population with secondary lymphatic dysfunction in MSL, or by primary vascular and lymphatic dysfunction in lipedema and DD. People with RADs do not lose SAT from caloric limitation and increased energy expenditure alone. In order to improve recognition of RADs apart from obesity, the diagnostic criteria, histology and pathophysiology of RADs are presented and contrasted to familial partial lipodystrophies, acquired partial lipodystrophies and obesity with which they may be confused. Treatment recommendations focus on evidence-based data and include lymphatic decongestive therapy, medications and supplements that support loss of RAD SAT. Associated RAD conditions including depression, anxiety and pain will improve as healthcare providers learn to identify and adopt alternative treatment regimens for the abnormal SAT component of RADs. Effective dietary and exercise regimens are needed in RAD populations to improve quality of life and construct advanced treatment regimens for future generations.


LSTM-Based NeuroCRFs for Named Entity Recognition

Although NeuroCRF, an augmented Conditional Random Fields (CRF) model whose feature function is parameterized as a Feed-Forward Neural Network (FF NN) on word embeddings, has soundly outperformed traditional linear-chain CRF on many sequence labeling tasks, it is held back by the fact that FF NNs have a fixed input length and therefore cannot take advantage of the full input sentence. We propose to address this issue by replacing the FF NN with a Long Short-Term Memory (LSTM) NN, which can summarize an input of arbitrary length into a fixed dimension representation. The resulting model obtains F1=89.28 on WikiNER dataset, a significant improvement over the NeuroCRF baseline’s F1=87.58, which is already a highly competitive result.


Automatic classification of citation function

The automatic recognition of the rhetorical function of citations in scientific text has many applications, from improvement of impact factor calculations to text summarisation and more informative citation indexers. Citation function is defined as the author’s reason for citing a given paper (e.g. acknowledgement of the use of the cited method). We show that our annotation scheme for citation function is reliable, and present a supervised machine learning framework to automatically classify citation function, which uses several shallow and linguistically-inspired features. We find, amongst other things, a strong relationship between citation function and sentiment classification.


Reference Scope Identification in Citing Sentences

A citing sentence is one that appears in a scientific article and cites previous work. Citing sentences have been studied and used in many applications. For example, they have been used in scientific paper summarization, automatic survey generation, paraphrase identification, and citation function classification. Citing sentences that cite multiple papers are common in scientific writing. This observation should be taken into consideration when using citing sentences in applications. For instance, when a citing sentence is used in a summary of a scientific paper, only the fragments of the sentence that are relevant to the summarized paper should be included in the summary. In this paper, we present and compare three different approaches for identifying the fragments of a citing sentence that are related to a given target reference. Our methods are: word classification, sequence labeling, and segment classification. Our experiments show that segment classification achieves the best results.


Learning Whom to Trust with MACE

Non-expert annotation services like Amazon’s Mechanical Turk (AMT) are cheap and fast ways to evaluate systems and provide categorical annotations for training data. Unfortunately, some annotators choose bad labels in order to maximize their pay. Manual identification is tedious, so we experiment with an item-response model. It learns in an unsupervised fashion to a) identify which annotators are trustworthy and b) predict the correct underlying labels. We match performance of more complex state-of-the-art systems and perform well even under adversarial conditions. We show considerable improvements over standard baselines, both for predicted label accuracy and trustworthiness estimates. The latter can be further improved by introducing a prior on model parameters and using Variational Bayes inference. Additionally, we can achieve even higher accuracy by focusing on the instances our model is most confident in (trading in some recall), and by incorporating annotated control instances. Our system, MACE (Multi-Annotator Competence Estimation), is available for download1.


New Compact CMOS Li-Ion Battery Charger Using Charge-Pump Technique for Portable Applications

This paper presents a new compact CMOS Li-Ion battery charger for portable applications that uses a charge-pump technique. The proposed charger features a small chip size and a simple circuit structure. Additionally, it provides basic functions with voltage/current detection, end-of-charge detection, and charging speed control. The charger operates in dual-mode and is supported in the trickle/large constant-current mode to constant-voltage mode with different charging rates. This charger is implemented using a TSMC 0.35-mum CMOS process with a 5-V power supply. The output voltage is almost 4.2 V, and the maximum charging current reaches 700 mA. It has 67.89% power efficiency, 837-mW chip power dissipation, and only 1.455times1.348 mm2 in chip area including pads


Consistency of Online Random Forests

As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online random forests.


Actor-Oriented Design of Embedded Hardware and Software Systems

In this paper, we argue that model-based design and platform-based design are two views of the same thing. A platform is a set of designs. Model-based design is about using platforms with useful modeling properties to specify designs, and then synthesizing implementations from these specifications. A design language, such as SystemC or VHDL, defines a platform. Any valid expression in the language is an element of the set. Viewed from below, the language provides an abstraction of implementation capabilities. Viewed from above, the language provides a set of constraints together with benefits that flow from those constraints. It provides a conceptual framework within which a design is crafted. An actor-oriented platform lies above the program-level platforms that are widely used today. It orthogonalizes the actor definition language and the actor assembly language, enabling domain-polymorphic actor definitions, multiple models of computation, and hierarchical heterogeneity. Actor-oriented platforms offer compelling modeling properties. Synthesis into program-level descriptions is possible. We illustrate these concepts by describing a design framework built on Ptolemy II.


Exploiting the Data Redundancy Locality to Improve the Performance of Deduplication-Based Storage Systems

The chunk-lookup disk bottleneck and the read amplification problems are two great challenges for deduplication-based storage systems and restrict the applicability of data deduplication for large-scale data volumes. Previous studies and our experimental evaluations have shown that the amount of redundant data shared among different types of applications is negligible. Based on the observations, we propose AA-Plus which effectively groups the hash index of the same application together and divides the whole hash index into different groups based on the application types. Moreover, it groups the data chunks of the same application together on the disks. The extensive trace-driven experiments conducted on our lightweight prototype implementation of AA-Plus show that compared with AA-Dedupe, AA-Plus significantly speeds up the write throughput by a factor of up to 6.9 and with an average of 3.1, and speeds up the read throughput by a factor of up to 3.3 and with an average of 1.9.


Surpassing Humans in Boundary Detection using Deep Learning

In this work we show that Deep Convolutional Neural Networks can outperform humans on the task of boundary detection, as measured on the standard Berkeley Segmentation Dataset. Our detector is fully integrated in the popular Caffe framework and processes a 320x420 image in less than a second. Our contributions consist firstly in combining a careful design of the loss for boundary detection training, a multi-resolution architecture and training with external data to improve the detection accuracy of the current state of the art, from an optimal dataset scale F-measure of 0.780 to 0.808 while human performance is at 0.803. We further improve performance to 0.813 by combining deep learning with grouping, integrating the Normalized Cuts technique within a deep network. We also examine the potential of our boundary detector in conjunction with the higher level tasks of object proposal generation and semantic segmentation for both tasks our detector yields clear improvements over state-of-the-art systems.


The HEXACO Honesty-Humility, Agreeableness, and Emotionality factors: a review of research and theory.

We review research and theory on the HEXACO personality dimensions of Honesty-Humility (H), Agreeableness (A), and Emotionality (E), with particular attention to the following topics: (1) the origins of the HEXACO model in lexical studies of personality structure, and the content of the H, A, and E factors in those studies; (2) the operationalization of the H, A, and E factors in the HEXACO Personality Inventory-Revised; (3) the construct validity of self-reports on scales measuring the H factor; (4) the theoretical distinction between H and A; (5) similarity and assumed similarity between social partners in personality, with a focus on H and A; (6) the extent to which H (and A and E) variance is represented in instruments assessing the "Five-Factor Model" of personality; and (7) the relative validity of scales assessing the HEXACO and Five-Factor Model dimensions in predicting criteria conceptually relevant to H, A, and E.


A Critical Review on Outlier Detection Techniques

Outlier Detection is a Data Mining Application. Outlier contains noisy data which is researched in various domains. The various techniques are already being researched that is more generic. We surveyed on various techniques and applications of outlier detection that provides a novel approach that is more useful for the beginners. The proposed approach helps to clean data at university level in less time with great accuracy. This survey includes the existing outlier techniques and applications where the noisy data exists. Our paper defines critical review on various techniques used in different applications of outlier detection that are to be researched further and they gives a particular type of knowledge based data i.e. more useful in research activities. So where the Anomalies is present it will be detected through outlier detection techniques and monitored accordingly especially in educational Data Mining.


KCoFI: Complete Control-Flow Integrity for Commodity Operating System Kernels

We present a new system, KCoFI, that is the first we know of to provide complete Control-Flow Integrity protection for commodity operating systems without using heavyweight complete memory safety. Unlike previous systems, KCoFI protects commodity operating systems from classical control-flow hijack attacks, return-to-user attacks, and code segment modification attacks. We formally verify a subset of KCoFI's design by modeling several features in small-step semantics and providing a partial proof that the semantics maintain control-flow integrity. The model and proof account for operations such as page table management, trap handlers, context switching, and signal delivery. Our evaluation shows that KCoFI prevents all the gadgets found by an open-source Return Oriented Programming (ROP) gadget-finding tool in the FreeBSD kernel from being used, it also reduces the number of indirect control-flow targets by 98.18%. Our evaluation also shows that the performance impact of KCoFI on web server bandwidth is negligible while file transfer bandwidth using OpenSSH is reduced by an average of 13%, and at worst 27%, across a wide range of file sizes. Postmark, an extremely file-system intensive benchmark, shows 2x overhead. Where comparable numbers are available, the overheads of KCoFI are far lower than heavyweight memory-safety techniques.


Data Mining: A Preprocessing Engine

This study is emphasized on different types of normalization. Each of which was tested against the ID3 methodology using the HSV data set. Number of leaf nodes, accuracy and tree growing time are three factors that were taken into account. Comparisons between different learning methods were accomplished as they were applied to each normalization method. A new matrix was designed to check for the best normalization method based on the factors and their priorities. Recommendations were concluded.


Attentional biases for emotional faces in young children of mothers with chronic or recurrent depression.

Attentional biases for negative stimuli have been observed in school-age and adolescent children of depressed mothers and may reflect a vulnerability to depression. The direction of these biases and whether they can be identified in early childhood remains unclear. The current study examined attentional biases in 5-7-year-old children of depressed and non-depressed mothers. Following a mood induction, children participated in a dot-probe task assessing biases for sad and happy faces. There was a significant interaction of group and sex: daughters of depressed mothers attended selectively to sad faces, while children of controls and sons of depressed mothers did not exhibit biases. No effects were found for happy stimuli. These findings suggest that attentional biases are discernible in early childhood and may be vulnerability markers for depression. The results also raise the possibility that sex differences in cognitive biases are evident before the emergence of sex differences in the prevalence of depression.


A positive level shifter for high speed symmetric switching in flash memories

In this paper, a novel positive level shifter is designed for high speed interfacing between the digital circuits operating at 1.2V and the memory core circuits operating at high voltages in flash memories. The proposed design is also validated for a wide range of output voltage levels and has been optimized to perform efficiently across the different process corners and temperatures. For the targeted design of 1.2V and 33 MHz input signal to 4V output signal, the level shifter has a symmetric switching speed with a rise time and fall time of 2ns and 1.89ns respectively while the average power consumption of 0.056mW is obtained in the typical condition. Simulation results are compared with various other conventional positive level shifters at different process corners and temperatures.


GMMCP tracker: Globally optimal Generalized Maximum Multi Clique problem for multiple object tracking

Data association is the backbone to many multiple object tracking (MOT) methods. In this paper we formulate data association as a Generalized Maximum Multi Clique problem (GMMCP). We show that this is the ideal case of modeling tracking in real world scenario where all the pairwise relationships between targets in a batch of frames are taken into account. Previous works assume simplified version of our tracker either in problem formulation or problem optimization. However, we propose a solution using GMMCP where no simplification is assumed in either steps. We show that the NP hard problem of GMMCP can be formulated through Binary-Integer Program where for small and medium size MOT problems the solution can be found efficiently. We further propose a speed-up method, employing Aggregated Dummy Nodes for modeling occlusion and miss-detection, which reduces the size of the input graph without using any heuristics. We show that, using the speedup method, our tracker lends itself to real-time implementation which is plausible in many applications. We evaluated our tracker on six challenging sequences of Town Center, TUD-Crossing, TUD-Stadtmitte, Parking-lot 1, Parking-lot 2 and Parking-lot pizza and show favorable improvement against state of art.


Integration Trends in Monolithic Power ICs: Application and Technology Challenges

This paper highlights the general trend towards further monolithic integration in power applications by enabling power management and interfacing solutions in advanced CMOS nodes. The need to combine high-density digital circuits, power-management circuits, and robust interfaces in a single technology platform requires the development of additional process options on top of baseline CMOS. Examples include high-voltage devices, devices to enable area-efficient ESD protection, and integrated capacitors and inductors with high quality factors. The use of bipolar devices in these technologies for protection and control purposes in power applications is also addressed.


Sign language recognition : Generalising to more complex corpora

The aim of this thesis is to find new approaches to Sign Language Recognition (SLR) which are suited to working with the limited corpora currently available. Data available for SLR is of limited quality; low resolution and frame rates make the task of recognition even more complex. The content is rarely natural, concentrating on isolated signs and filmed under labo ratory conditions. In addition, the amount of accurately labelled data is minimal. To this end, several contributions are made: Tracking the hands is eschewed in favour of detection based techniques more robust to noise; for both signs and for linguistically-motivated sign sub-units are investigated, to make best use of limited data sets. Finally, an algorithm is proposed to learn signs fiom the inset signers on TV, with the aid of the accompanying subtitles, thus increasing the corpus of data available. Tracking fast moving hands under laboratory conditions is a complex task, move this to real world data and the challenge is even greater. When using tracked data as a base for SLR, the er rors in the tracking are compounded at the classification stage. Proposed instead, is a novel sign detection method, which views space-time as a 3D volume and the sign within it as an object to be located. Features are combined into strong classifiers using a novel boosting implementation designed to create optimal classifiers over sparse datasets. Using boosted volumetric features, on a robust frame differenced input, average classification rates reach 71% on seen signers and 66% on a mixture of seen and unseen signers, with individual sign classification rates gaining 95%. Using a classifier per sign approach to SLR, means that data sets need to contain numerous examples of the signs to be learnt. Instead, this thesis proposes lear nt classifiers to detect the common sub-units of sign. The responses of these classifiers can then be combined for recognition at the sign level. This approach requires fewer examples per sign to be learnt, since the sub-unit detectors are trained on data from multiple signs. It is also faster at detection time since there are fewer classifiers to consult, the number of these being limited by the linguistics of sign and not the number of signs being detected. For this method, appearance based boosted classifiers are introduced to distinguish the sub-units of sign. Results show that when combined with temporal models, these novel sub-unit classifiers, can outperform similar classifiers learnt on tracked results. As an added side effect; since the sub-units are linguistically derived tliey can be used independently to help linguistic annotators. Since sign language data sets are costly to collect and annotate, there are not many publicly available. Those which are, tend to be constiained in content and often taken under laboratory conditions. However, in the UK, the British Broadcasting Corporation (BBC) regularly pro duces programs with an inset signer and corresponding subtitles. This provides a natural signer, covering a wide range of topics, in real world conditions. While it has no ground truth, it is proposed tliat the tr anslated subtitles can provide weak labels for learning signs. The final con tributions of this tliesis, lead to an innovative approach to learn signs from these co-occurring streams of data. Using a unique, temporally constr ained, version of the Apriori mining algo rithm, similar sections of video are identified as possible sign locations. These estimates are improved upon by introducing the concept of contextual negatives, removing contextually sim ilar" noise. Combined with an iterative honing process, to enhance the localisation of the target sign, 23 word/sign combinations are learnt from a 30 minute news broadcast, providing a novel rnetliod for automatic data set creation.


Get To The Point: Summarization with Pointer-Generator Networks

Neural sequence-to-sequence models have provided a viable new approach for abstractive text summarization (meaning they are not restricted to simply selecting and rearranging passages from the original text). However, these models have two shortcomings: they are liable to reproduce factual details inaccurately, and they tend to repeat themselves. In this work we propose a novel architecture that augments the standard sequence-to-sequence attentional model in two orthogonal ways. First, we use a hybrid pointer-generator network that can copy words from the source text via pointing, which aids accurate reproduction of information, while retaining the ability to produce novel words through the generator. Second, we use coverage to keep track of what has been summarized, which discourages repetition. We apply our model to the CNN / Daily Mail summarization task, outperforming the current abstractive state-of-the-art by at least 2 ROUGE points.