Learning Ontologies for the Semantic Web

The Semantic Web relies heavily on the formal ontologies that structure underlying data for the purpose of comprehensive and transportable machine understanding. Therefore, the success of the Semantic Web depends strongly on the proliferation of ontologies, which requires fast and easy engineering of ontologies and avoidance of a knowledge acquisition bottleneck. Ontology Learning greatly facilitates the construction of ontologies by the ontology engineer. The vision of ontology learning that we propose here includes a number of complementary disciplines that feed on di erent types of unstructured, semi-structured and fully structured data in order to support a semi-automatic, cooperative ontology engineering process. Our ontology learning framework proceeds through ontology import, extraction, pruning, re nement, and evaluation giving the ontology engineer a wealth of coordinated tools for ontology modeling. Besides of the general framework and architecture, we show in this paper some exemplary techniques in the ontology learning cycle that we have implemented in our ontology learning environment, TextTo-Onto, such as ontology learning from free text, from dictionaries, or from legacy ontologies, and refer to some others that need to complement the complete architecture, such as reverse engineering of ontologies from database schemata or learning from XML documents. 1. ONTOLOGIES FOR THE SEMANTIC WEB Conceptual structures that de ne an underlying ontology are germane to the idea of machine processable data on the Semantic Web. Ontologies are (meta)data schemas, providing a controlled vocabulary of concepts, each with an explicitly de ned and machine processable semantics. By de ning shared and common domain theories, ontologies help both people and machines to communicate concisely, supporting the exchange of semantics and not only syntax. Hence, the Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission by the authors. Semantic Web Workshop 2001 Hongkong, China Copyright by the authors. cheap and fast construction of domain-speci c ontologies is crucial for the success and the proliferation of the Semantic Web. Though ontology engineering tools have become mature over the last decade (cf. [9]), the manual acquisition of ontologies still remains a tedious, cumbersome task resulting easily in a knowledge acquisition bottleneck. Having developed our ontology engineering workbench, OntoEdit, we had to face exactly this issue, in particular we were given questions like Can you develop an ontology fast? (time) Is it diÆcult to build an ontology? (diÆculty) How do you know that you've got the ontology right? (con dence) In fact, these problems on time, diÆculty and con dence that we ended up with were similar to what knowledge engineers had dealt with over the last two decades when they elaborated on methodologies for knowledge acquisition or workbenches for de ning knowledge bases. A method that proved extremely bene cial for the knowledge acquisition task was the integration of knowledge acquisition with machine learning techniques [33]. The drawback of these approaches, e.g. the work described in [21], however, was their rather strong focus on structured knowledge or data bases, from which they induced their rules. In contrast, in the Web environment that we encounter when building Web ontologies, the structured knowledge or data base is rather the exception than the norm. Hence, intelligent means for an ontology engineer takes on a di erent meaning than the | very seminal | integration architectures for more conventional knowledge acquisition [7]. Our notion of Ontology Learning aims at the integration of a multitude of disciplines in order to facilitate the construction of ontologies, in particular machine learning. Because the fully automatic acquisition of knowledge by machines remains in the distant future, we consider the process of ontology learning as semi-automatic with human intervention, adopting the paradigm of balanced cooperative modeling [20] for the construction of ontologies for the Semantic Web. This objective in mind, we have built an architecture that combines knowledge acquisition with machine learning, feeding on the resources that we nowadays nd on the syntactic Web, viz. free text, semi-structured text, schema de nitions (DTDs), etc. Thereby, modules in our framework serve different steps in the engineering cycle, which here consists of the following ve steps (cf. Figure 1): First, existing ontologies are imported and reused by merging existing structures or de ning mapping rules between existing structures and the ontology to be established. For instance, [26] describe how ontological structures contained in Cyc are used in order to facilitate the construction of a domain-speci c ontology. Second, in the ontology extraction phase major parts of the target ontology are modeled with learning support feeding from web documents. Third, this rough outline of the target ontology needs to be pruned in order to better adjust the ontology to its prime purpose. Fourth, ontology re nement pro ts from the given domain ontology, but completes the ontology at a ne granularity (also in contrast to extraction). Fifth, the prime target application serves as a measure for validating the resulting ontology [31]. Finally, one may revolve again in this cycle, e.g. for including new domains into the constructed ontology or for maintaining and updating its scope. 2. THE ONTOLOGY LEARNING KILLER APPLICATION Though ontologies and their underlying data in the Semantic Web are envisioned to be reusable for a wide range of possibly unforeseen applications, a particular target application remains the touchstone for a given ontology. In our case, we have been dealing with ontology-based knowledge portals that structure Web content and that allow for structured provisioning and accessing of data [29, 30]. Knowledge portals are information intermediaries for knowledge accessing and sharing on the Web. The development of a knowledge portal consists of the tasks of structuring the knowledge, establishing means for providing new knowledge and accessing the knowledge contained in the portal. A considerable part of development and maintenance of the portal lies in integrating legacy information as well as in constructing and maintaining the ontology in vast, often unknown, terrain. For instance, a knowledge portal may focus on the electronics sector, integrating comparative shopping in conjunction with manuals, reports and opinions about current electronic products. The creation of the background ontology for this knowledge portal involves tremendous e orts for engineering the conceptual structures that underly existing warehouse databases, product catalogues, user manuals, test reports and newsgroup discussions. Correspondingly, ontology structures must be constructed from database schemata, a given product thesaurus (like BMEcat), XML documents and document type de nitions (DTDs), and free texts. Still worse, signi cant parts of these (meta-)data change extremely fast and, hence, require a regular update of the corresponding ontology parts. Thus, very di erent types of (meta-)data might be useful input for the construction of the ontology. However, in practice one needs comprehensive support in order to deal Just like Tim Berners-Lee did not forsee online auctions being a common business model of the Web of 2000. Comprehensive support with ontology learning need not necessarily imply the top-notch learning algorithms, but may rely more heavily on appropriate tool support and methodology. with this wealth. Hence, there comes the need for a range of di erent techniques: Structured data and meta data require reverse engineering approaches, free text may contribute to ontology learning directly or through information extraction approaches. Semi-structured data may nally require and pro t from both. In the following we elaborate on our ontology learning framework. Thereby we approach di erent techniques for di erent types of data, showing parts of our architecture, its current status, and parts that may complement our current Text-To-Onto environment. A general overview of ontology learning techniques as well as corresponding references may be found in Section 9. 3. AN ARCHITECTURE FOR ONTOLOGY LEARNING Given the task of constructing and maintaining an ontology for a Semantic Web application, e.g. for an ontologybased knowledge portal that we have been dealing with (cf. [29]), we have produced a wish list of what kind of support we would fancy. 3.1 Ontology Engineering WorkbenchOntoEdit As core to our approach we have built a graphical user interface to support the ontology engineering process manually performed by the ontology engineer. Here, we o er sophisticated graphical means for manual modeling and re ning the nal ontology. Di erent views are o ered to the user targeting the epistemological level rather than a particular representation language. However, the ontological structures built there may be exported to standard Semantic Web representation languages, such as OIL and DAML-ONT, as well as our own F-Logic based extensions of RDF(S). In addition, executable representations for constraint checking and application debugging can be generated and then accessed via SilRi, our F-Logic inference engine, that is directly connected with OntoEdit. The sophisticated ontology engineering tools we knew, e.g. the Prot eg e modeling environment for knowledge-based systems [9], would o er capabilities roughly comparable to OntoEdit. However, given the task of constructing a knowledge portal, we f


Combination features and models for human detection

This paper presents effective combination models with certain combination features for human detection. In the past several years, many existing features/models have achieved impressive progress, but their performances are still limited by the biases rooted in their self-structures, that is, a particular kind of feature/model may work well for some types of human bodies, but not for all the types. To tackle this difficult problem, we combine certain complementary features/models together with effective organization/fusion methods. Specifically, the HOG features, color features and bar-shape features are combined together with a cell-based histogram structure to form the so-called HOG-III features. Moreover, the detections from different models are fused together with the new proposed weighted-NMS algorithm, which enhances the probable “true” activations as well as suppresses the overlapped detections. The experiments on PASCAL VOC datasets demonstrate that, both the HOG-III features and the weighted-NMS fusion algorithm are effective (obvious improvement for detection performance) and efficient (relatively less computation cost): When applied to human detection task with the Grammar model and Poselet model, they can boost the detection performance significantly; Also, when extended to detection of the whole VOC 20 object categories with the deformable part-based model and deep CNN-based model, they still show competitive improvements.


Multimedia, hypermedia, and hypertext: Motivation considered and reconsidered

Computer-based instruction (CBI) is becoming increasingly popular in the classroom, particularly because the latest technological advancements allow for visually rich and interactive environments. While the inherent nature of CBIs is often thought to engage learners, research examining the role of motivation in learning with these environments has resulted in mixed findings. These findings are further complicated by unique design characteristics of distinct CBIs. This literature review synthesizes research that has examined the role of theoretically-grounded constructs of motivation in the context of three popular CBIs, multimedia, hypermedia, and hypertext. Specifically, this literature review considered empirical studies that examined the effect of these CBIs on motivation, in addition to the effect of motivation on learning outcomes and the learning process within the context of these environments. The literature review concludes with a theoretical consideration of previous research and a discussion of a framework for future directions. 2010 Published by Elsevier Ltd.


Ensemble Methods in Data Mining: Improving Accuracy Through Combining Predictions

Following your need to always fulfil the inspiration to obtain everybody is now simple. Connecting to the internet is one of the short cuts to do. There are so many sources that offer and connect us to other world condition. As one of the products to see in internet, this website becomes a very available place to look for countless ensemble methods in data mining improving accuracy through combining predictions synthesis lectures on data mining and knowledge discovery sources. Yeah, sources about the books from countries in the world are provided.


The commercial use of segmentation and predictive modeling techniques for database marketing in the Netherlands

Although the application of segmentation and predictive modeling is an important topic in the database marketing (DBM) literature, no study has yet investigated the extent of adoption of these techniques. We present the results of a Dutch survey involving 228 database marketing companies. We find that managers tend to rely on intuition and on the long-standing methods RFM and cross-tabulation. Our results indicate that the application of segmentation and response modeling is positively related to company and database size, frequency of customer contact, and the use of a direct channel of distribution. The respondents indicate that future research should focus on models applicable for Internet marketing, long-term effects of direct marketing, irritation from direct marketing offers, and segmentation and predictive modeling techniques. D 2002 Elsevier Science B.V. All rights reserved.


Design and analysis of an origami continuum manipulation module with torsional strength

This paper presents an origami-inspired cable-driven continuum manipulator module that offers low-cost, low-volume deployment, light weight, and inherently safe human interaction and collaboration. Each module has a mass of around 110 g and integrates the actuation, sensing, and control sub-systems necessary for operation. The origami structure has 7.311 Nm/rad (0.128 Nm/degree) torsional stiffness while being capable of bending in two directions and changing arc-length down to a fully collapsed state. A maximum contraction of 35 mm and bending angle of 35.5 degrees were achieved with 45 mm arc length. The module is capable of passively supporting a 1-kg mass at its tip, or 4 additional serially connected modules, bending approximately 6 degrees in the worst case. We also show that we can actively compensate for external moments by pre-compressing or pre-bending the module. We utilize an inverse kinematic control scheme and use it for both open and closed loop control following a circular trajectory. Our results indicate that the module motion follows the desired trajectory with an RMS error of 0.681 mm in the horizontal (x-y) plane and 0.373 mm in the z-axis with closed-loop control. We also assembled two origami modules in series and drove them independently, demonstrating the proof-of-concept of a modular origami continuum manipulator.


Bayesian optimization for learning gaits under uncertainty

Designing gaits and corresponding control policies is a key challenge in robot locomotion. Even with a viable controller parametrization, finding near-optimal parameters can be daunting. Typically, this kind of parameter optimization requires specific expert knowledge and extensive robot experiments. Automatic black-box gait optimization methods greatly reduce the need for human expertise and time-consuming design processes. Many different approaches for automatic gait optimization have been suggested to date. However, no extensive comparison among them has yet been performed. In this article, we thoroughly discuss multiple automatic optimization methods in the context of gait optimization. We extensively evaluate Bayesian optimization, a model-based approach to black-box optimization under uncertainty, on both simulated problems and real robots. This evaluation demonstrates that Bayesian optimization is particularly suited for robotic applications, where it is crucial to find a good set of gait parameters in a small number of experiments.


A Generative Approach to Audio-Visual Person Tracking

This paper focuses on the integration of acoustic and visual information for people tracking. The system presented relies on a probabilistic framework within which information from multiple sources is integrated at an intermediate stage. An advantage of the method proposed is that of using a generative approach which supports easy and robust integration of multi source information by means of sampled projection instead of triangulation. The system described has been developed in the EU funded CHIL Project research activities. Experimental results from the CLEAR evaluation workshop are reported.


Position-aware activity recognition with wearable devices

Reliable human activity recognition with wearable devices enables the development of human-centric pervasive applications.We aim to develop a robust wearable-based activity recognition system for real life situations where the device position is up to the user or where a user is unable to collect initial training data. Consequently, in this work we focus on the problem of recognizing the on-body position of the wearable device ensued by comprehensive experiments concerning subject-specific and cross-subjects activity recognition approaches that rely on acceleration data. We introduce a device localization method that predicts the on-body position with an F-measure of 89% and a cross-subjects activity recognition approach that considers common physical characteristics. In this context, we present a real world data set that has been collected from 15 participants for 8 common activities where they carried 7 wearable devices in different on-body positions. Our results show that the detection of the device position consistently improves the result of activity recognition for common activities. Regarding cross-subjects models, we identified the waist as the most suitable device location at which the acceleration patterns for the same activity across several people are most similar. In this context, our results provide evidence for the reliability of physical characteristics based cross-subjectsmodels. © 2017 Elsevier B.V. All rights reserved.


Tears or Fears? Comparing Gender Stereotypes about Movie Preferences to Actual Preferences

This study investigated the accuracy of gender-specific stereotypes about movie-genre preferences for 17 genres. In Study 1, female and male participants rated the extent to which 17 movie genres are preferred by women or men. In Study 2, another sample of female and male participants rated their own preference for each genre. There were three notable results. First, Study 1 revealed the existence of gender stereotypes for the majority of genres (i.e., for 15 of 17 genres). Second, Study 2 revealed the existence of actual gender differences in preferences for the majority of genres (i.e., for 11 of 17 genres). Third, in order to assess the accuracy of gender stereotypes on movie preferences, we compared the results of both studies and found that the majority of gender stereotypes were accurate in direction, but inaccurate in size. In particular, the stereotypes overestimated actual gender differences for the majority of movie genres (i.e., 10 of 17). Practical and theoretical implications of these findings are discussed.


Rule extraction from autoencoder-based connectionist computational models

1College of Computer Science, Sichuan Normal University, Chengdu, Sichuan, China 2Developmental Neurocognition Lab, Department of Psychological Sciences, Birkbeck, University of London, London, UK 3College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, China Correspondence Juan Yang, College of Computer Science, Sichuan Normal University, Chengdu, Sichuan, China. Email: jkxy_yjuan@sicnu.edu.cn Funding information National Natural Science Foundation of China, Grant/Award Number: (61402309); UK Economic and Social Research Council, Grant/Award Number: RES-062-23-2721 Summary Mapping problems are typical research topics related to natural language learning, and they include not only classification mappings but also nonclassification mappings, such as verbs and their past tenses. Connectionist computational models are one of the most popular approaches for simulating those mapping problems; however, their lack of explanatory ability has prevented them from being further used to understand the language learning process. Therefore, the work of extracting rational rules from a connectionist model is as important as simulating the mapping behaviors. Unfortunately, there is no available technique that can be directly applied in those computational models to simulate nonclassification problems. In this paper, an autoencoder-based connectionist computational model is proposed to derive a rule extraction method that can construct “If-Then” rational relations with high fidelity for nonclassification mapping problems. To demonstrate its generalizability, this computational model is extended to a modified version to address a multi-label classification mapping problem related to cognitive style prediction. Experiments prove this computational model's simulation ability and its explanatory ability on nonclassification problems by comparing its fidelity performances with those of the classical connectionist computational model (multilayer perceptron artificial neural network), and its similar ability on a multi-label classification problem (Felder-Silverman learning style classification) by comparing its prediction accuracy with those of other rule induction techniques.


Shape from periodic texture using the spectrogram

Texture has long been recognized in computer vision as an important monocular shape cue, with texture gradients yielding information on surface orientation. A more recent trend is the analysis of images in terms of local spatial frequencies, where each pixel has associated with it its own spatial frequency distribution. This has proven to be a successful method of reasoning about and exploiting many imaging phenomena. Thinking about both shape-from-texture and local spatial frequency, it seems that texture gradients would cause systematic changes in local frequency, and that these changes could be analyzed to extract shape information. However, there does not yet exist a theory that connects texture, shape, and the detailed behavior of local spatial frequency. We show in this paper how local spatial frequency is related to the surface normal of a textured surface. We find that the Fourier power spectra of any two similarly textured patches on a plane are approximately related to each other by an affine transformation. The transformation parameters are a function of the plane’s surface normal. We use this relationship as the basis of a new algorithm for finding surface normals of textured shapes using the spectrogram, which is one type of local spatial frequency representation. We validate the relationship by testing the algorithm on real textures. By analyzing shape and texture in terms of the local spatial frequency representation, we can exploit the advantages of the representation for the shape-from-texture problem. Specifically, our algorithm requires no feature detection and can give correct results even when the texture is aliased.


Network traffic anomaly detection using clustering techniques and performance comparison

Real-time network traffic anomaly detection is crucial for the confidentiality, integrity, and security of network information. Machine learning approaches are widely used to distinguish traffic flow outliers based on different anomalies with unique statistical characteristics. K-means clustering and Gaussian Mixture Model (GMM) are effective clustering techniques with many variations and easy to implement. Fuzzy clustering is more flexible than hard clustering and is practical for intrusion detection because of the natural treatment of data using fuzzy clustering. Fuzzy c-means clustering (FCM) is an iteratively optimal algorithm normally based on the least square method to partition data sets, which has high computational overhead. This paper proposes modifications to the objective function and the distance function that reduce the computational complexity of FCM while keeping clustering accurate. A combination of FCM clustering GMM, and feature transformation methods are proposed and a comparison of the related testing results and clustering methods is presented.


ElasticSwitch: practical work-conserving bandwidth guarantees for cloud computing

While cloud computing providers offer guaranteed allocations for resources such as CPU and memory, they do not offer any guarantees for network resources. The lack of network guarantees prevents tenants from predicting lower bounds on the performance of their applications. The research community has recognized this limitation but, unfortunately, prior solutions have significant limitations: either they are inefficient, because they are not work-conserving, or they are impractical, because they require expensive switch support or congestion-free network cores.
 In this paper, we propose ElasticSwitch, an efficient and practical approach for providing bandwidth guarantees. ElasticSwitch is efficient because it utilizes the spare bandwidth from unreserved capacity or underutilized reservations. ElasticSwitch is practical because it can be fully implemented in hypervisors, without requiring a specific topology or any support from switches. Because hypervisors operate mostly independently, there is no need for complex coordination between them or with a central controller. Our experiments, with a prototype implementation on a 100-server testbed, demonstrate that ElasticSwitch provides bandwidth guarantees and is work-conserving, even in challenging situations.


Approximate Reverse Carry Propagate Adder for Energy-Efficient DSP Applications

In this paper, a reverse carry propagate adder (RCPA) is presented. In the RCPA structure, the carry signal propagates in a counter-flow manner from the most significant bit to the least significant bit; hence, the carry input signal has higher significance than the output carry. This method of carry propagation leads to higher stability in the presence of delay variations. Three implementations of the reverse carry propagate full-adder (RCPFA) cell with different delay, power, energy, and accuracy levels are introduced. The proposed structure may be combined with an exact (forward) carry adder to form hybrid adders with tunable levels of accuracy. The design parameters of the proposed RCPA implementations and some hybrid adders realized utilizing these structures are studied and compared with those of the state-of-the-art approximate adders using HSPICE simulations in a 45-nm CMOS technology. The results indicate that employing the proposed RCPAs in the hybrid adders may provide, on average, 27%, 6%, and 31% improvements in delay, energy, and energy-delay-product while providing higher levels of accuracy. In addition, the structure is more resilient to delay variation compared to the conventional approximate adder. Finally, the efficacy of the proposed RCPAs is investigated in the discrete cosine transform (DCT) block of the JPEG compression and finite-impulse response (FIR) filter applications. The investigation reveals 60% and 39% energy saving in the DCT of JPEG and FIR filter, respectively, for the proposed RCPAs.


Beyond Autograding: Advances in Student Feedback Platforms

1. SUMMARY Automatic grading of programming assignments has been a feature of computer science courses for almost as long as there have been computer science courses [1]. However, contemporary autograding systems in computer science courses have extended their scope far beyond performing automated assessment to include gamification [2], test coverage analysis [3], managing human-authored feedback, contest adjudication [4], secure remote code execution [5], and more. Many of these individual features have been described and evaluated in the computer science education literature, but little attention has been given to the practical benefits and challenges of using the systems that implement these features in computer science courses.


The promising future of microalgae: current status, challenges, and optimization of a sustainable and renewable industry for biofuels, feed, and other products

Microalgae have recently attracted considerable interest worldwide, due to their extensive application potential in the renewable energy, biopharmaceutical, and nutraceutical industries. Microalgae are renewable, sustainable, and economical sources of biofuels, bioactive medicinal products, and food ingredients. Several microalgae species have been investigated for their potential as value-added products with remarkable pharmacological and biological qualities. As biofuels, they are a perfect substitute to liquid fossil fuels with respect to cost, renewability, and environmental concerns. Microalgae have a significant ability to convert atmospheric CO2 to useful products such as carbohydrates, lipids, and other bioactive metabolites. Although microalgae are feasible sources for bioenergy and biopharmaceuticals in general, some limitations and challenges remain, which must be overcome to upgrade the technology from pilot-phase to industrial level. The most challenging and crucial issues are enhancing microalgae growth rate and product synthesis, dewatering algae culture for biomass production, pretreating biomass, and optimizing the fermentation process in case of algal bioethanol production. The present review describes the advantages of microalgae for the production of biofuels and various bioactive compounds and discusses culturing parameters.


Computational Thinking and Expository Writing in the Middle School

To broaden participation in computing we need to look beyond traditional domains of inquiry and expertise. We present results from a demonstration project in which interactive journalism was used to infuse computational thinking into the standard curriculum and regular classroom experience at a middle school with a diverse population. Outcomes indicate that we were able to develop positive attitudes about computational thinking and programming among students and teachers who did not necessarily view themselves as “math types.” By partnering with language arts, technology and math teachers at Fisher Middle School, Ewing New Jersey, we introduced the isomorphism between the journalistic process and computational thinking to 7th and 8th graders. An intense summer institute, first with the teachers and then with students recruited from the school, immersed them in the “newsroom of the future” where they researched and wrote news stories, shot and edited video, and developed procedural animations in Scratch to support their storylines. An afterschool club sustained the experience. The teachers adapted interactive journalism and Scratch programming to enrich standard language arts curriculum and are infusing computational thinking in classroom experiences throughout the school.


Modeling HTTP/2 Speed from HTTP/1 Traces

With the standardization of HTTP/2, content providers want to understand the benefits and pitfalls of transitioning to the new standard. Using a large dataset of HTTP/1.1 resource timing data from production traffic on Akamai’s CDN, and a model of HTTP/2 behavior, we obtain the distribution of performance differences between the protocol versions for nearly 280,000 downloads. We find that HTTP/2 provides significant performance improvements in the tail, and, for websites for which HTTP/2 does not improve median performance, we explore how optimizations like prioritization and push can improve performance, and how these improvements relate to page structure.


Guillain-Barré Syndrome in India: population-based validation of the Brighton criteria.

OBJECTIVE
Case definitions of GBS were recently developed in response to the 2009 H1N1 vaccination programme but have undergone limited field testing. We validate the sensitivity of the Brighton Working Group case definitions for Guillain-Barré Syndrome (GBS) using a population-based cohort in India.

METHODS
The National Polio Surveillance Unit of India actively collects all cases of acute flaccid paralysis (AFP) in children <15 years old, including cases of GBS. Cases of GBS with available cerebrospinal fluid (CSF) and nerve conduction studies (NCS) results, neurological examination, clinical history, and exclusion of related diagnoses were selected (2002-2003). Relevant data were abstracted and entered into a central database. Sensitivity of the Brighton GBS criteria for level 3 of diagnostic certainty which requires no clinical laboratory testing, level 2 which employs CSF or NCS, and level 1 which employs both, were calculated.

RESULTS
79 cases of GBS (mean age 6.5 years, range 4.0-14.5; 39% female) met the case definition. GBS cases were ascending (79%), symmetrical (85%), and bilateral (100%); involving lower extremity hypotonia (86%) and weakness (100%), upper extremity hypotonia (62%) and weakness (80%), areflexia/hyporeflexia (88%), respiratory muscles (22%), bulbar muscles (22%), and cranial nerves (13%). Four limbs were involved in 80% of cases. Mean time to maximal weakness was 5.2 days (range 0.5-30 days) with nadir GBS disability scores of 3 (7%), 4 (67%), 5 (15%), 6 (10%), or unclear (1%). CSF (mean time to lumbar puncture 29 days) was normal in 29% with cytoalbuminologic dissociation in 65% (mean protein 105 mg/dL, range 10-1000; mean cell count 11/μL, range 0-220, n=4 with >50 cells/μL). Significant improvement occurred in 73% whereas death (9%) occurred 6-29 days after sensorimotor symptom onset. The majority of cases (86%) fulfilled Brighton level 3, level 2 (84%), and level 1 (62%) of diagnostic certainty.

CONCLUSION
The diagnosis of GBS can be made using Brighton Working Group criteria in India with moderate to high sensitivity. Brighton Working Group case definitions are a plausible standard for capturing a majority of cases of GBS in field operations in low income settings during AFP surveillance.


3 D Tracking via Body Radio Reflections by

This thesis presents WiTrack, a system that tracks the 3D motion of a user from the radio signals reflected off her body. It works even if the person is occluded from the WiTrack device or in a different room. WiTrack does not require the user to carry any wireless device, yet its accuracy exceeds current RF localization systems, which require the user to hold a transceiver. Empirical measurements with a WiTrack prototype show that, on average, it localizes the center of a human body to within a median of 10 to 13 cm in the x and y dimensions, and 21 cm in the z dimension. It also provides coarse tracking of body parts, identifying the direction of a pointing hand with a median of 11.20. WiTrack bridges a gap between RF-based localization systems which locate a user through walls and occlusions, and human-computer interaction systems like Kinect, which can track a user without instrumenting her body, but require the user to stay within the direct line of sight of the device. Thesis Supervisor: Dina Katabi Title: Professor of Computer Science and Engineering


Genetic Ablation of Orexin Neurons in Mice Results in Narcolepsy, Hypophagia, and Obesity

Orexins (hypocretins) are a pair of neuropeptides implicated in energy homeostasis and arousal. Recent reports suggest that loss of orexin-containing neurons occurs in human patients with narcolepsy. We generated transgenic mice in which orexin-containing neurons are ablated by orexinergic-specific expression of a truncated Machado-Joseph disease gene product (ataxin-3) with an expanded polyglutamine stretch. These mice showed a phenotype strikingly similar to human narcolepsy, including behavioral arrests, premature entry into rapid eye movement (REM) sleep, poorly consolidated sleep patterns, and a late-onset obesity, despite eating less than nontransgenic littermates. These results provide evidence that orexin-containing neurons play important roles in regulating vigilance states and energy homeostasis. Orexin/ataxin-3 mice provide a valuable model for studying the pathophysiology and treatment of narcolepsy.


Deep Enhanced Representation for Implicit Discourse Relation Recognition

Implicit discourse relation recognition is a challenging task as the relation prediction without explicit connectives in discourse parsing needs understanding of text spans and cannot be easily derived from surface features from the input sentence pairs. Thus, properly representing the text is very crucial to this task. In this paper, we propose a model augmented with different grained text representations, including character, subword, word, sentence, and sentence pair levels. The proposed deeper model is evaluated on the benchmark treebank and achieves stateof-the-art accuracy with greater than 48% in 11-way and F1 score greater than 50% in 4-way classifications for the first time according to our best knowledge.


Computational thinking (CT): on weaving it in

Paul Curzon Queen Mary University of London Mile End, London, E1 4NS UK +44 (20) 7882 5212 pc@dcs.qmul.ac.uk Joan Peckham Harriet Taylor NSF 4201 Wilson Blvd. Arlington, VA 22230, USA (703) 292-7344 jpeckham/htaylor@nsf.gov Amber Settle School of Computing DePaul University 243 S. Wabash Avenue Chicago, IL 60604, USA (312) 362-5324 asettle@cdm.depaul.edu Eric Roberts Computer Science Stanford University 202 Gates Stanford, CA 94305-901 650-723-3642 eroberts@cs.stanford.edu


A Survey of Computation Offloading for Mobile Systems

Mobile systems have limited resources, such as battery life, network bandwidth, storage capacity, and processor performance. These restrictions may be alleviated by computation of f loading: sending heavy computation to resourceful servers and receiving the results from these servers. Many issues related to offloading have been investigated in the past decade. This survey paper provides an overview of the background, techniques, systems, and research areas for offloading computation. We also describe directions for future research.


Adaptive Computation Offloading from Mobile Devices into the Cloud

The inherently limited processing power and battery lifetime of mobile phones hinder the possible execution of computationally intensive applications like content-based video analysis or 3D modeling. Offloading of computationally intensive application parts from the mobile platform into a remote cloud infrastructure or nearby idle computers addresses this problem. This paper presents our Mobile Augmentation Cloud Services (MACS) middleware which enables adaptive extension of Android application execution from a mobile client into the cloud. Applications are developed by using the standard Android development pattern. The middleware does the heavy lifting of adaptive application partitioning, resource monitoring and computation offloading. These elastic mobile applications can run as usual mobile application, but they can also reach transparently remote computing resources. Two prototype applications using the MACS middleware demonstrate the benefits of the approach. The evaluation shows that applications, which involve complicated algorithms and large computations, can benefit from offloading with around 95% energy savings and significant performance gains compared to local execution only.


Computing arbitrary functions of encrypted data

Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorphic" encryption scheme that keeps data private, but that allows a worker that does not have the secret decryption key to compute any (still encrypted) result of the data, even when the function of the data is very complex. In short, a third party can perform complicated processing of data without being able to see it. Among other things, this helps make cloud computing compatible with privacy.


Developing and Implementing Parametric Human Body Shape Models in Ergonomics Software

Human figure models included with today’s high-end simulation systems are widely used for ergonomic analysis. Male and female figures can be scaled by inputting standard anthropometric dimensions, such as stature, body weight, and limb lengths to represent a large range of body sizes. However, the shapes of these scaled figures are often unrealistic, particularly for extreme body types, because only a relatively few dimensions of the figures are adjusted. Several software packages have the capability of adjusting the figure to match a body surface scan of an individual, but this capability is insufficient when individuals with a wide range of attributes must be simulated. We present a new figure generation capability in the Jack human modeling software based on a statistical analysis of laser scans of hundreds of men and women. A template mesh based on the Jack figure model was fitted to each scan, and a statistical shape model was created using principal component analysis and regression. The model was integrated within the Jack software to create Jack figures with highly realistic body shapes, usable natively with all simulation and analysis features.


Adolescent development and the regulation of youth crime.

Elizabeth Scott and Laurence Steinberg explore the dramatic changes in the law's conception of young offenders between the end of the nineteenth century and the beginning of the twenty-first. At the dawn of the juvenile court era, they note, most youths were tried and punished as if they were adults. Early juvenile court reformers argued strongly against such a view, believing that the justice system should offer young offenders treatment that would cure them of their antisocial ways. That rehabilitative model of juvenile justice held sway until a sharp upswing in youth violence at the end of the twentieth century led both public opinion and public policy toward a view that youths should be held to the same standard of criminal accountability as adults. Lawmakers seemed to lose sight of developmental differences between adolescents and adults. But Scott and Steinberg note that lawmakers and the public appear now to be rethinking their views once more. A justice system that operates on the principle of "adult time for adult crime" now seems to many to take too little note of age and immaturity in calculating criminal punishment. In 2005 the United States Supreme Court abolished the juvenile death penalty as cruel and unusual punishment, emphasizing that the immaturity of adolescents made them less culpable than adult criminals. In addition, state legislatures recently have repealed or moderated some of the punitive laws they recently enacted. Meanwhile, observe the authors, public anger has abated and attitudes toward young offenders have softened somewhat. In response to these changes, Scott and Steinberg argue that it is appropriate to reexamine juvenile justice policy and to devise a new model for the twenty-first century. In this article, they propose what they call a developmental model. They observe that substantial new scientific evidence about adolescence and criminal activity by adolescents provides the building blocks for a new legal regime superior to today's policy. They put adolescent offenders into an intermediate legal category-neither children, as they were seen in the early juvenile court era, nor adults, as they often are seen today. They observe that such an approach is not only more compatible than the current regime with basic principles of fairness at the heart of the criminal law, but also more likely to promote social welfare by reducing the social cost of juvenile crime.


A survey of consensus problems in multi-agent coordination

As a distributed solution to multi-agent coordination, consensus or agreement problems have been studied extensively in the literature. This paper provides a survey of consensus problems in multi-agent cooperative control with the goal of promoting research in this area. Theoretical results regarding consensus seeking under both time-invariant and dynamically changing information exchange topologies are summarized. Applications of consensus protocols to multiagent coordination are investigated. Future research directions and open problems are also proposed.


Security breaches are largely caused by the vulnerable software. Since individuals and organizations mostly depend on softwares, it is important to produce in secured manner. The first step towards producing secured software is through gathering security requirements. This paper describes Software Security Requirements Gathering Instrument (SSRGI) that helps gather security requirements from the various stakeholders. This will guide the developers to gather security requirements along with the functional requirements and further incorporate security during other phases of software development. We subsequently present case studies that describe the integration of the SSRGI instrument with Software Requirements Specification (SRS) document as specified in standard IEEE 830-1998. Proposed SSRGI will support the software developers in gathering security requirements in detail during requirements gathering phase.


DESIGN AND IMPLEMENTATION OF A VIRTUAL CLASSROOM SYSTEM

In the last few decades, education has witnessed some advances in technologies involving computeraided learning that promises to drastically change the methods of teaching and learning. The World Wide Web has played a major role in information storage and dissemination in the educational community. Conventional classroom based teaching involves the delivery of course materials by the lecturer in a particular place at a defined time. Hence it imposes a constraint of time and place on both the instructor and the student. Due to human factor arising from the traditional classroom method, the lecturer may not always be able to put in optimum effort towards preparing and delivering course materials. There may also be inconsistencies in the pedagogy and learning style due to repetitive nature of teaching/learning. The objective of this paper is to develop a virtual classroom system to enhance learning on campus. The system was developed using PHP and MySQL as server side programming and database respectively. The web-based virtual classroom provides a web enabled interactive model for e-learning in which the course material is presented using multimedia and hypermedia.


Regenerative braking for electric vehicle based on fuzzy logic control strategy

In order to recycle more energy in the process of regenerative braking, we design a regenerative braking force calculation controller based on fuzzy logic. The sugeno's interface fuzzy logic controller has three-inputs including the driver's brake requirements, vehicle speed and batteries' SOC and one-output which is the regenerative braking force. To ensure charging safety, the influence of batteries' temperature is also taken into consideration. Besides, we modify the original braking force distribution regulations in the simulation software--ADVISOR. The simulation results verify that the method can not only recycle more energy from braking but also ensure the safety of braking and the batteries.


MATLAB functions to analyze directional (azimuthal) data - II: Correlation

Data that represent azimuthal directions cannot be analyzed in the same manner as ordinary linear variables that measure, for example, size or quality. This is especially true for correlations between variables. Although many statistical techniques have been developed for dealing with directional data, software is scarce for the unique calculations. This paper describes a MATLAB script, located on the IAMG server, that calculates measures of association (correlations) between two circular variables, or between a circular and a linear variable. The calculations include tests of significance of the associations. These tests use large-sample approximations or resampling methods. r 2005 Elsevier Ltd. All rights reserved.


Multiscale contrast enhancement for radiographies: Laplacian pyramid versus fast wavelet transform

Contrast enhancement of radiographies based on a multiscale decomposition of the images recently has proven to be a far more versatile and efficient method than regular unsharp-masking techniques, while containing these as a subset. In this paper, we compare the performance of two multiscale-methods, namely the Laplacian Pyramid and the fast wavelet transform (FWT). We find that enhancement based on the FWT suffers from one serious drawback-the introduction of visible artifacts when large structures are enhanced strongly. By contrast, the Laplacian Pyramid allows a smooth enhancement of large structures, such that visible artifacts can be avoided. Only for the enhancement of very small details, for denoising applications or compression of images, the FWT may have some advantages over the Laplacian Pyramid.


A Survey of Denial-of-Service and Distributed Denial of Service Attacks and Defenses in Cloud Computing

Cloud Computing is a computing model that allows ubiquitous, convenient and on-demand access to a shared pool of highly configurable resources (e.g., networks, servers, storage, applications and services). Denial-of-Service (DoS) and Distributed Denial-of-Service (DDoS) attacks are serious threats to the Cloud services’ availability due to numerous new vulnerabilities introduced by the nature of the Cloud, such as multi-tenancy and resource sharing. In this paper, new types of DoS and DDoS attacks in Cloud Computing are explored, especially the XML-DoS and HTTP-DoS attacks, and some possible detection and mitigation techniques are examined. This survey also provides an overview of the existing defense solutions and investigates the experiments and metrics that are usually designed and used to evaluate their performance, which is helpful for the future research in the domain.


A benchmark for comparison of dental radiography analysis algorithms

Dental radiography plays an important role in clinical diagnosis, treatment and surgery. In recent years, efforts have been made on developing computerized dental X-ray image analysis systems for clinical usages. A novel framework for objective evaluation of automatic dental radiography analysis algorithms has been established under the auspices of the IEEE International Symposium on Biomedical Imaging 2015 Bitewing Radiography Caries Detection Challenge and Cephalometric X-ray Image Analysis Challenge. In this article, we present the datasets, methods and results of the challenge and lay down the principles for future uses of this benchmark. The main contributions of the challenge include the creation of the dental anatomy data repository of bitewing radiographs, the creation of the anatomical abnormality classification data repository of cephalometric radiographs, and the definition of objective quantitative evaluation for comparison and ranking of the algorithms. With this benchmark, seven automatic methods for analysing cephalometric X-ray image and two automatic methods for detecting bitewing radiography caries have been compared, and detailed quantitative evaluation results are presented in this paper. Based on the quantitative evaluation results, we believe automatic dental radiography analysis is still a challenging and unsolved problem. The datasets and the evaluation software will be made available to the research community, further encouraging future developments in this field. (http://www-o.ntust.edu.tw/~cweiwang/ISBI2015/).


Anatomy of the Facial Danger Zones: Maximizing Safety during Soft-Tissue Filler Injections.

With limited downtime and immediate results, facial filler injections are becoming an ever more popular alternative to surgical rejuvenation of the face. The results, and the complications, can be impressive. To maximize safety during injections, the authors have outlined general injection principles followed by pertinent anatomy within six different facial danger zones. Bearing in mind the depth and the location of the vasculature within each zone, practitioners can tailor their injection techniques to prevent vessel injury and avoid cannulation.


Feature Generation Using General Constructor Functions

Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creating an accurate, succinct and comprehensible representation of the target concept. To overcome this problem, researchers have proposed algorithms for automatic construction of features. The majority of these algorithms use a limited predefined set of operators for building new features. In this paper we propose a generalized and flexible framework that is capable of generating features from any given set of constructor functions. These can be domain-independent functions such as arithmetic and logic operators, or domain-dependent operators that rely on partial knowledge on the part of the user. The paper describes an algorithm which receives as input a set of classified objects, a set of attributes, and a specification for a set of constructor functions that contains their domains, ranges and properties. The algorithm produces as output a set of generated features that can be used by standard concept learners to create improved classifiers. The algorithm maintains a set of its best generated features and improves this set iteratively. During each iteration, the algorithm performs a beam search over its defined feature space and constructs new features by applying constructor functions to the members of its current feature set. The search is guided by general heuristic measures that are not confined to a specific feature representation. The algorithm was applied to a variety of classification problems and was able to generate features that were strongly related to the underlying target concepts. These features also significantly improved the accuracy achieved by standard concept learners, for a variety of classification problems.


Towards Security as a Service (SecaaS): On the modeling of Security Services for Cloud Computing

The security of software services accessible via the Internet has always been a crosscutting non-functional requirement of uttermost importance. The recent advent of the Cloud Computing paradigm and its wide diffusion has given birth to new challenges towards the securing of existing Cloud services, by properly accounting the issues related to their delivery models and their usage patterns, and has opened the way to the new concept of Security as a Service(SecaaS), i.e. the ability of developing reusable software services which can be composed with standard Cloud services in order to offer them the suitable security features. In this context, there is a strong need for methods and tools for the modeling of security concerns, as well as for evaluation techniques, for supporting both the comparison of different design choices and the analysis of their impact on the behavior of new services before their actual realization. This paper proposes a meta-model for supporting the modeling of Security Services in a Cloud Computing environment as well as an approach for guiding the identification and the integration of security services within the standard Cloud delivery models. The proposal is exemplified through a case study.


Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecasting

Timely accurate traffic forecast is crucial for urban traffic control and guidance. Due to the high nonlinearity and complexity of traffic flow, traditional methods cannot satisfy the requirements of mid-and-long term prediction tasks and often neglect spatial and temporal dependencies. In this paper, we propose a novel deep learning framework, Spatio-Temporal Graph Convolutional Networks (STGCN), to tackle the time series prediction problem in traffic domain. Instead of applying regular convolutional and recurrent units, we formulate the problem on graphs and build the model with complete convolutional structures, which enable much faster training speed with fewer parameters. Experiments show that our model STGCN effectively captures comprehensive spatio-temporal correlations through modeling multi-scale traffic networks and consistently outperforms state-of-the-art baselines on various real-world traffic datasets.


The search engine manipulation effect (SEME) and its possible impact on the outcomes of elections.

Internet search rankings have a significant impact on consumer choices, mainly because users trust and choose higher-ranked results more than lower-ranked results. Given the apparent power of search rankings, we asked whether they could be manipulated to alter the preferences of undecided voters in democratic elections. Here we report the results of five relevant double-blind, randomized controlled experiments, using a total of 4,556 undecided voters representing diverse demographic characteristics of the voting populations of the United States and India. The fifth experiment is especially notable in that it was conducted with eligible voters throughout India in the midst of India's 2014 Lok Sabha elections just before the final votes were cast. The results of these experiments demonstrate that (i) biased search rankings can shift the voting preferences of undecided voters by 20% or more, (ii) the shift can be much higher in some demographic groups, and (iii) search ranking bias can be masked so that people show no awareness of the manipulation. We call this type of influence, which might be applicable to a variety of attitudes and beliefs, the search engine manipulation effect. Given that many elections are won by small margins, our results suggest that a search engine company has the power to influence the results of a substantial number of elections with impunity. The impact of such manipulations would be especially large in countries dominated by a single search engine company.


Analysis of Software Defined Network firewall (SDF)

Software Defined Networks (SDN) technology can alternate the network, unlock critical intelligence, and help deliver the new services and analytics needed to run on-demand applications for today's businesses and consumers. So, SDN has been much request for adoption in mostly data centre. SDN provides network administrators to clear overview of the entire network architecture. It decouples a network's control and forwarding functions such that the physical and logical networks can be treated independently. This method allows network traffic flows to be programmatically and effectively reallocated to meet changing demands. That's what SDN does. Software defined network have too many scarcity like throughput, packet loss and network attack defense. Software defined firewalls helps to overcome lack of SDN and also reduce ratios of attack traffic. Here we analyze some SDF techniques and challenges related to software defined network.


REVISED NOTE ON LEARNING QUADRATIC ASSIGNMENT WITH GRAPH NEURAL NETWORKS

Inverse problems correspond to a certain type of optimization problems formulated over appropriate input distributions. Recently, there has been a growing interest in understanding the computational hardness of these optimization problems, not only in the worst case, but in an average-complexity sense under this same input distribution.In this revised note, we are interested in studying another aspect of hardness, related to the ability to learn how to solve a problem by simply observing a collection of previously solved instances. These ‘planted solutions’ are used to supervise the training of an appropriate predictive model that parametrizes a broad class of algorithms, with the hope that the resulting model will provide good accuracy-complexity tradeoffs in the average sense.We illustrate this setup on the Quadratic Assignment Problem, a fundamental problem in Network Science. We observe that data-driven models based on Graph Neural Networks offer intriguingly good performance, even in regimes where standard relaxation based techniques appear to suffer.


The Six Pillars for Building Big Data Analytics Ecosystems

With almost everything now online, organizations look at the Big Data collected to gain insights for improving their services. In the analytics process, derivation of such insights requires experimenting-with and integrating different analytics techniques, while handling the Big Data high arrival velocity and large volumes. Existing solutions cover bits-and-pieces of the analytics process, leaving it to organizations to assemble their own ecosystem or buy an off-the-shelf ecosystem that can have unnecessary components to them. We build on this point by dividing the Big Data Analytics problem into six main pillars. We characterize and show examples of solutions designed for each of these pillars. We then integrate these six pillars into a taxonomy to provide an overview of the possible state-of-the-art analytics ecosystems. In the process, we highlight a number of ecosystems to meet organizations different needs. Finally, we identify possible areas of research for building future Big Data Analytics Ecosystems.


Iterative thresholding based image segmentation using 2D improved Otsu algorithm

Threshold based segmentation methods can effectively separate objects from the background. The conventional Otsu's method can achieve good result only when the histogram of an image has two distinct peaks. In this paper, an iterative thresholding based on 2D improved Otsu method using a novel threshold value recognition function is proposed which is used to find the optimum threshold value in different types of histograms and separate into two classes. For the two classes separated by the above threshold value, mean values are computed. Based on the threshold value and the two mean values, the histogram of an image is divided iteratively into three regions, namely, the Foreground (FG) region, Background (BG) region and To-Be-Processed (TBP) region. The pixels greater than the larger mean belongs to FG region, the pixel which are lesser than the smaller mean belongs to BG region. The pixel that lies between the two mean values belongs to the TBP region and only this region is processed at next iteration, the FG and BG region are not processed further. Again for that TBP region, the novel threshold value recognition function is used to find a new threshold value and then the two mean values are computed to separate into three classes, namely, the FG, BG and TBP region. Then the new TBP region is processed in a similar manner iteratively until the two mean values computed at successive iterations are not changed. Finally all the previously determined foreground regions are combined separately and the background regions are combined separately to give the segmented image. The experimental results show that the proposed method performs well in detecting the objects and has better anti-noise performance compared with the existing methods.


Understanding the Spatial and Temporal Activity Patterns of Subway Mobility Flows

In urban transportation systems, mobility flows in the subway system reflect the spatial and temporal dynamics of working days. To investigate the variability of mobility flows, we analyse the spatial community through a series of snapshots of subway stations over sequential periods. Using Shanghai as a case study, we find that the spatial community snapshots reveal dynamic passenger activities. Adopting a dual-perspective, we apply spatial and temporal models separately to explore where and when individuals travel for entertainment. In the two models, microblog topics and spatial facilities such as food venues and entertainment businesses are used to characterise the spatial popularity of each station and people’s travelling perceptions. In the studied case, the city centre is characterised by greater social influence, and it is better described by the spatial model. In the temporal model, shorter travel distances motivate individuals to start their trips earlier. Interestingly, as the number of food-related facilities near the starting station increases, until it exceeds 1563, the speed of people’s journeys slows down. This study provides a method for modelling the effects of social features on mobility flows and for predicting the spatial-temporal mobility flows of newly built subway stations.


Optimal crawling strategies for web search engines

Web Search Engines employ multiple so-called crawlers to maintain local copies of web pages. But these web pages are frequently updated by their owners, and therefore the crawlers must regularly revisit the web pages to maintain the freshness of their local copies. In this paper, we propose a two-part scheme to optimize this crawling process. One goal might be the minimization of the average level of staleness over all web pages, and the scheme we propose can solve this problem. Alternatively, the same basic scheme could be used to minimize a possibly more important search engine embarrassment level metric: The frequency with which a client makes a search engine query and then clicks on a returned url only to find that the result is incorrect. The first part our scheme determines the (nearly) optimal crawling frequencies, as well as the theoretically optimal times to crawl each web page. It does so within an extremely general stochastic framework, one which supports a wide range of complex update patterns found in practice. It uses techniques from probability theory and the theory of resource allocation problems which are highly computationally efficient -- crucial for practicality because the size of the problem in the web environment is immense. The second part employs these crawling frequencies and ideal crawl times as input, and creates an optimal achievable schedule for the crawlers. Our solution, based on network flow theory, is exact as well as highly efficient. An analysis of the update patterns from a highly accessed and highly dynamic web site is used to gain some insights into the properties of page updates in practice. Then, based on this analysis, we perform a set of detailed simulation experiments to demonstrate the quality and speed of our approach.


Neural Network Recognizer for Hand-Written Zip Code Digits

This paper describes the construction of a system that recognizes hand-printed digits, using a combination of classical techniques and neural-net methods. The system has been trained and tested on real-world data, derived from zip codes seen on actual U.S. Mail. The system rejects a small percentage of the examples as unclassifiable, and achieves a very low error rate on the remaining examples. The system compares favorably with other state-of-the art recognizers. While some of the methods are specific to this task, it is hoped that many of the techniques will be applicable to a wide range of recognition tasks.


Consistent inference of probabilities in layered networks: predictions and generalizations

The problem of learning a general input-output relation using a layered neural network is discussed in a statistical framework. By imposing the consistency condition that the error minimization be equivalent to a likelihood maximization for training the network, the authors arrive at a Gibbs distribution on a canonical ensemble of networks with the same architecture. This statistical description enables them to evaluate the probability of a correct prediction of an independent example, after training the network on a given training set. The prediction probability is highly correlated with the generalization ability of the network, as measured outside the training set. This suggests a general and practical criterion for training layered networks by minimizing prediction errors. The authors demonstrate the utility of this criterion for selecting the optimal architecture in the continuity problem. As a theoretical application of the statistical formalism, they discuss the question of learning curves and estimate the sufficient training size needed for correct generalization, in a simple example.<<ETX>>


Inferring Employee Engagement from Social Media

Employees increasingly are expressing ideas and feelings through enterprise social media. Recent work in CHI and CSCW has applied linguistic analysis towards understanding employee experiences. In this paper, we apply dictionary based linguistic analysis to measure 'Employee Engagement'. Employee engagement is a measure of employee willingness to apply discretionary effort towards organizational goals, and plays an important role in organizational outcomes such as financial or operational results. Organizations typically use surveys to measure engagement. This paper describes an approach to model employee engagement based on word choice in social media. This method can potentially complement surveys, thus providing more real-time insights into engagement and allowing organizations to address engagement issues faster. Our results predicting engagement scores on a survey by combining demographics with social media text demonstrate that social media text has significant predictive power compared to demographic data alone. We also find that engagement may be a state than a stable trait since social media posts closer to the administration of the survey had the most predictive power. We further identify the minimum number of social media posts required per employee for the best prediction.


Chrome Extensions: Threat Analysis and Countermeasures

The widely popular browser extensions now become one of the most commonly used malware attack vectors. The Google Chrome browser, which implements the principles of least privileges and privilege separation by design, offers a strong security mechanism to protect malicious websites from damaging the whole browser system via extensions. In this study, we however reveal that Chrome’s extension security model is not a panacea for all possible attacks with browser extensions. Through a series of practical bot-based attacks that can be performed even under typical settings, we demonstrate that malicious Chrome extensions pose serious threats, including both information dispersion and harvesting, to browsers. We further conduct an in-depth analysis of Chrome’s extension security model, and conclude that its vulnerabilities are rooted fro m the violation of the principles of least privileges and priv ilege separation. Following these principles, we propose a set of countermeasures that enforce the policies of microprivilege management and differentiating DOM elements. Using a prototype developed on the latest Chrome browser, we show that they can effectively mitigate the threats posed by malicious Chrome extensions with little effect on normal browsing experience.


Segmented handwritten text recognition with recurrent neural network classifiers

Recognition of handwritten text is a useful technique that can be applied in different applications, such as signature recognition, bank check recognition, etc. However, the off-line handwritten text recognition in an unconstrained situation is still a very challenging task due to the high complexity of text strokes and image background. This paper presents a novel segmented handwritten text recognition technique that ensembles recurrent neural network (RNN) classifiers. Two RNN models are first trained that take advantage of the widely used geometrical feature and the Histogram of Oriented Gradient (HOG) feature, respectively. Given a handwritten word image, the optimal recognition result is then obtained by integrating the two trained RNN models together with a lexicon. Experiments on public datasets show the superior performance of our proposed technique.


A Hypercube-Based Indirect Encoding for Evolving Large-Scale Neural Networks

Research in neuroevolution, i.e. evolving artificial neural networks (ANNs) through evolutionary algorithms, is inspired by the evolution of biological brains. Because natural evolution discovered intelligent brains with billions of neurons and trillions of connections, perhaps neuroevolution can do the same. Yet while neuroevolution has produced successful results in a variety of domains, the scale of natural brains remains far beyond reach. This paper presents a method called Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) that aims to narrow this gap. HyperNEAT employs an indirect encoding called connective Compositional Pattern Producing Networks (connective CPPNs) that can produce connectivity patterns with symmetries and repeating motifs by interpreting spatial patterns generated within a hypercube as connectivity patterns in a lower-dimensional space. The advantage of this approach is that it can exploit the geometry of the task by mapping its regularities onto the topology of the network, thereby shifting problem difficulty away from dimensionality to underlying problem structure. Furthermore, connective CPPNs can represent the same connectivity pattern at any resolution, allowing ANNs to scale to new numbers of inputs and outputs without further evolution . HyperNEAT is demonstrated through visual discrimination and food gathering tasks, including successful visual discrimination networks containing over eight million connections. The main conclusion is that the ability to explore the space of regular connectivity patterns opens up a new class of complex high-dimensional tasks to neuroevolution.


Answer Selection in Community Question Answering via Attentive Neural Networks

Answer selection in community question answering (cQA) is a challenging task in natural language processing. The difficulty lies in that it not only needs the consideration of semantic matching between question answer pairs but also requires a serious modeling of contextual factors. In this letter, we propose an attentive deep neural network architecture so as to learn the deterministic information for answer selection. The architecture can support various input formats through the organization of convolutional neural networks, attention-based long short-term memory, and conditional random fields. Experiments are carried out on the SemEval-2015 cQA dataset. We attain 58.35% on macroaveraged $\mathrm{F_1}$, which outperforms the Top-1 system in the shared task by 1.16% and improves the state-of-the-art deep-neural-network-based method by 2.21%.


Thermodynamics and NMR of internal G.T mismatches in DNA.

Thermodynamics of 39 oligonucleotides with internal G.T mismatches dissolved in 1 M NaCl were determined from UV absorbance versus temperature profiles. These data were combined with literature values of six sequences to derive parameters for 10 linearly independent trimer and tetramer sequences with G.T mismatches and Watson-Crick base pairs. The G.T mismatch parameters predict DeltaG degrees 37, DeltaH degrees , DeltaS degrees , and TM with average deviations of 5.1%, 7.5%, 8.0%, and 1.4 degrees C, respectively. These predictions are within the limits of what can be expected for a nearest-neighbor model. The data show that the contribution of a single G.T mismatch to helix stability is context dependent and ranges from +1.05 kcal/mol for AGA/TTT to -1.05 kcal/mol for CGC/GTG. Several tests of the applicability of the nearest-neighbor model to G.T mismatches are described. Analysis of imino proton chemical shifts show that structural perturbations from the G.T mismatches are highly localized. One-dimensional NOE difference spectra demonstrate that G.T mismatches form stable hydrogen-bonded wobble pairs in diverse contexts. Refined nearest-neighbor parameters for Watson-Crick base pairs are also presented.


Comparing Blockchain and Cloud Services for Business Process Execution

Blockchain is of rising importance as a technology for engineering applications in cross-organizational settings, avoiding reliance on central trusted third-parties. The use of blockchain, instead of traditional databases or services, is an architectural choice in the development of a software system. The costs of execution and storage are important non-functional qualities, but as yet very little has been done to study them for blockchain-based systems. We investigate the cost of using blockchain using business process execution as a lens. Specifically, we compare the cost for computation and storage of business process execution on blockchain vs. a popular cloud service. First, we capture the cost models for both alternatives. Second, we implemented and measured the cost of business process execution on blockchain and cloud services for an example business process model from the literature. We observe two orders of magnitude difference in this cost.


Bipartite graph reinforcement model for web image annotation

Automatic image annotation is an effective way for managing and retrieving abundant images on the internet. In this paper, a bipartite graph reinforcement model (BGRM) is proposed for web image annotation. Given a web image, a set of candidate annotations is extracted from its surrounding text and other textual information in the hosting web page. As this set is often incomplete, it is extended to include more potentially relevant annotations by searching and mining a large-scale image database. All candidates are modeled as a bipartite graph. Then a reinforcement algorithm is performed on the bipartite graph to re-rank the candidates. Only those with the highest ranking scores are reserved as the final annotations. Experimental results on real web images demonstrate the effectiveness of the proposed model.


Design and prototyping of 3-phase BLDC motor

The development of electric vehicle is now growing rapidly. Demands to deliver a reliable and easy to drive in motor control causes Brushless Direct Current (BLDC) motor becomes a potential candidate. A BLDC motor drive is a potential option for an electric vehicle since it has a high reliability, simple design, and ability to work at high rotation per minute (RPM). This paper discussed the Permanent Magnet BLDC Motor design method. The structure of an interior rotor permanent magnet type is selected to be used in the design of Permanent Magnet BLDC motor so that it can be applied in a drive that requires a large torque and capable of acceleration and deceleration with good response. Selection of 12 slots and 8 poles configuration aims for improving the motor performance. The motor is designed and simulated using a software-based Motor Solve FEA (Finite Element Analysis). Based on this design and simulation results, a prototype of BLDC motor is built. Parameters testing as stator resistance, inductances (the d-axis and q-axis inductance), and the back emf constant (Ke) were used to evaluate the result of the design and prototype motor. Measuring the prototype motor's parameters was carried out by several different methods depending on the parameters tested. Stator resistance testing is performed with the measurement of current in the coil which is then obtained by calculating the magnitude of stator resistance as 0.14710296 Ω. Measurements of d-axis stator inductance, q-axis stator inductance, and back emf constant of prototype permanent magnet BLDC motor is obtained as results of 0.35304710 mH, 0.38246769 mH and 0.09690626 Vs/rad respectively. The test results between design and prototype testing were quite good. The difference between the test results and the design of the prototype test results was caused by incompatibility of material composition although using the same type of material. The evaluation shows the electromagnetic parameters is influenced by its constituent materials.


Edge Computing – EDGE 2018

Edge computing systems (Cloudlet, Fog Computing, Multi-access Edge Computing) provide numerous benefits to information technology: reduced latency, improved bandwidth, battery lifetime, etc. Despite all the benefits, edge computing systems have several issues that could significantly reduce the performance of certain applications. Indeed, current edge computing technologies do not assure ultra-low latency for real-time applications and they encounter overloading issues for data processing. To solve the aforementioned issues, we propose Home Edge Computing (HEC): a new three-tier edge computing architecture that provides data storage and processing in close proximity to the users. The term “Home” in Home Edge Computing does not restrain our work to the homes of the users, we take into account other places where the users could connect to the Internet such as: companies, shopping malls, hospitals, etc. Our three-tier architecture is composed of a Home Server, an Edge Server and a Central Cloud which we also find in traditional edge computing architectures. The Home Server is located within the vicinities of the users which allow the achievement of ultra-low latency for applications that could be processed by the said server; this also help reduce the amount of data that could be treated in the Edge Server and the Central Cloud. We demonstrate the validity of our architecture by leveraging the EdgeCloudSim simulation platform. The results of the simulation show that our proposal can, in fact, help achieve ultra-low latency and reduce overloading issues.


Network Decoupling: From Regular to Depthwise Separable Convolutions

Depthwise separable convolution has shown great efficiency in network design, but requires time-consuming training procedure with full training-set available. This paper first analyzes the mathematical relationship between regular convolutions and depthwise separable convolutions, and proves that the former one could be approximated with the latter one in closed form. We show depthwise separable convolutions are principal components of regular convolutions. And then we propose network decoupling (ND), a training-free method to accelerate convolutional neural networks (CNNs) by transferring pre-trained CNN models into the MobileNet-like depthwise separable convolution structure, with a promising speedup yet negligible accuracy loss. We further verify through experiments that the proposed method is orthogonal to other training-free methods like channel decomposition, spatial decomposition, etc. Combining the proposed method with them will bring even larger CNN speedup. For instance, ND itself achieves about 2× speedup for the widely used VGG16, and combined with other methods, it reaches 3.7× speedup with graceful accuracy degradation. We demonstrate that ND is widely applicable to classification networks like ResNet, and object detection network like SSD300.


Sixty years of fear appeal research: current state of the evidence.

Fear arousal is widely used in persuasive campaigns and behavioral change interventions. Yet, experimental evidence argues against the use of threatening health information. The authors reviewed the current state of empirical evidence on the effectiveness of fear appeals. Following a brief overview of the use of fear arousal in health education practice and the structure of effective fear appeals according to two main theoretical frameworks-protection motivation theory and the extended parallel process model-the findings of six meta-analytic studies in the effectiveness of fear appeals are summarized. It is concluded that coping information aimed at increasing perceptions of response effectiveness and especially self-efficacy is more important in promoting protective action than presenting threatening health information aimed at increasing risk perceptions and fear arousal. Alternative behavior change methods than fear appeals should be considered.


The Prediction of Earnings Using Financial Statement Information: Empirical Evidence With Logit Models and Artificial Neural Networks

In the past three decades, earnings have been one of the most researched variables in accounting. Empirical research provided substantial evidence on its usefulness in the capital markets but evidence in predicting earnings has been limited, yielding inconclusive results. The purpose of this study is to validate and extend prior research in predicting earnings by examining aggregate and industry-specific data. A sample of 10,509 firm-year observations included in the Compustat database for the period 1982-91 is used in the study. The stepwise logistic regression results of the present study indicated that nine earnings and non-earnings variables can be used to predict earnings. These predictor variables are not identical to those reported in prior studies. These results are also extended to the manufacturing industry. Two new variables are identified to be significant in this industry. Moreover, an Artificial Neural Network (ANN) approach is employed to complement the logistic regression results. The ANN model's performance is at least as high as the logistic regression model's predictive ability.


Compact-Size Low-Profile Wideband Circularly Polarized Omnidirectional Patch Antenna With Reconfigurable Polarizations

A compact-size low-profile wideband circularly polarized (CP) omnidirectional antenna with reconfigurable polarizations is presented in this communication. This design is based on a low-profile omnidirectional CP antenna which consists of a vertically polarized microstrip patch antenna working in TM01/TM02 modes and sequentially bended slots etched on the ground plane for radiating horizontally polarized electric field. The combined radiation from both the microstrip patch and the slots leads to a CP omnidirectional radiation pattern. The polarization reconfigurability is realized by introducing PIN diodes on the slots. By electronically controlling the states of the PIN diodes, the effective orientation of the slots on ground plane can be changed dynamically and the polarization of antenna can be altered between left-hand circular polarization (LHCP) and right-hand circular polarization (RHCP). The proposed antenna exhibits a wide-operational bandwidth of 19.8% (2.09-2.55 GHz) with both axial ratio below 3 dB and return loss above 10 dB when radiates either LHCP or RHCP waves. Experimental results show good agreement with the simulation results. The present design has a compact size, a thickness of only 0.024λ and exhibits stable CP omnidirectional conical-beam radiation patterns within the entire operating frequency band with good circular polarization.


Substrate Integrated Waveguide Loaded by Complementary Split-Ring Resonators and Its Applications to Miniaturized Waveguide Filters

A substrate integrated waveguide with square complementary split-ring resonators (CSRRs) etched on the waveguide surface is investigated in this paper. The proposed structures allow the implementation of a forward-wave passband propagating below the characteristic cutoff frequency of the waveguide. By changing the orientations of the CSRRs, which are incorporated in the waveguide surface and can be interpreted in terms of electric dipoles, varied passband characteristics are observed. A detailed explanation for the generation and variations of the passbands has been illuminated. The application of this waveguide and CSRR combination technique to the design of miniaturized waveguide bandpass filters characterized by transmission zeros is then illustrated. Filter design methodology is examined. These proposed filters exhibit high selectivity and compact size due to the employment of the subwavelength resonators and an evanescent-wave transmission. By slightly altering the configuration of the CSRRs, we find that the propagation of the TE10 mode can be suppressed and filters with improved selectivity and stopband rejection can be obtained. To verify the presented concept, three different types of filters are fabricated based on the standard printed circuit board process. The measured results are in good agreement with the simulation.


Head-worn displays: a review

Head-worn display design is inherently an interdisciplinary subject fusing optical engineering, optical materials, optical coatings, electronics, manufacturing techniques, user interface design, computer science, human perception, and physiology for assessing these displays. This paper summarizes the state-of-the-art in head-worn display design (HWD) and development. This review is focused on the optical engineering aspects, divided into different sections to explore principles and applications. Building on the guiding fundamentals of optical design and engineering, the principles section includes a summary of microdisplay or laser sources, the Lagrange invariant for understanding the trade-offs in optical design of HWDs, modes of image presentation (i.e., monocular, biocular, and stereo) and operational modes such as optical and video see-through. A brief summary of the human visual system pertinent to the design of HWDs is provided. Two optical design forms, namely, pupil forming and non-pupil forming are discussed. We summarize the results from previous design work using aspheric, diffractive, or holographic elements to achieve compact and lightweight systems. The applications section is organized in terms of field of view requirements and presents a reasonable collection of past designs


Large-Scale Automatic Species Identification

The crowd-sourced Naturewatch GBIF dataset is used to obtain a species classification dataset containing approximately 1.2 million photos of nearly 20 thousand different species of biological organisms observed in their natural habitat. We present a general hierarchical species identification system based on deep convolutional neural networks trained on the NatureWatch dataset. The dataset contains images taken under a wide variety of conditions and is heavily imbalanced, with most species associated with only few images. We apply multi-view classification as a way to lend more influence to high frequency details, hierarchical fine-tuning to help with class imbalance and provide regularisation, and automatic specificity control for optimising classification depth. Our system achieves 55.8% accuracy when identifying individual species and around 90% accuracy at an average taxonomy depth of 5.1—equivalent to the taxonomic rank of ”family”—when applying automatic specificity control.


Health Monitoring and Assistance to Support Aging in Place

To many people, home is a sanctuary. For those people who need special medical care, they may need to be pulled out of their home to meet their medical needs. As the population ages, the percentage of people in this group is increasing and the effects are expensive as well as unsatisfying. We hypothesize that many people with disabilities can lead independent lives in their own homes with the aid of athome automated assistance and health monitoring. In order to accomplish this, robust methods must be developed to collect relevant data and process it dynamically and adaptively to detect and/or predict threatening long-term trends or immediate crises. The main objective of this paper is to investigate techniques for using agent-based smart home technologies to provide this at-home health monitoring and assistance. To this end, we have developed novel inhabitant modeling and automation algorithms that provide remote health monitoring for caregivers. Specifically, we address the following technological challenges: 1) identifying lifestyle trends, 2) detecting anomalies in current data, and 3) designing a reminder assistance system. Our solution approaches are being tested in simulation and with volunteers at the UTA’s MavHome site, an agent-based


An Empirical Evaluation of Deep Learning for Network Anomaly Detection

Deep learning has been given a great deal of attention with its success story in many areas such as image analysis and speech recognition. In particular, deep learning is good at dealing with high-dimensional data exhibiting non-linearity. Our preliminary study reveals a very high degree of non-linearity from network traffic data, which explains why it is hard to improve the detection accuracy by using conventional machine learning techniques (e.g., SVM, Random Forest, Ad-aboosting). In this study, we empirically evaluate deep learning to see its feasibility for network anomaly detection. We examine a set of deep learning models constructed based on the Fully Connected Network (FCN), Variational AutoEncoder (VAE), and Long Short-Term Memory with Sequence to Sequence (LSTM Seq2Seq) structures, with two public traffic data sets that have distinctive properties with respect to the distribution of normal and attack populations. Our experimental results confirm the potential of deep learning models for network anomaly detection, and the model based on the LSTM Seq2Seq structure shows a highly promising performance, yielding 99% of binary classification accuracy on the public data sets.


A study of speaker adaptation for DNN-based speech synthesis

A major advantage of statistical parametric speech synthesis (SPSS) over unit-selection speech synthesis is its adaptability and controllability in changing speaker characteristics and speaking style. Recently, several studies using deep neural networks (DNNs) as acoustic models for SPSS have shown promising results. However, the adaptability of DNNs in SPSS has not been systematically studied. In this paper, we conduct an experimental analysis of speaker adaptation for DNN-based speech synthesis at different levels. In particular, we augment a low-dimensional speaker-specific vector with linguistic features as input to represent speaker identity, perform model adaptation to scale the hidden activation weights, and perform a feature space transformation at the output layer to modify generated acoustic features. We systematically analyse the performance of each individual adaptation technique and that of their combinations. Experimental results confirm the adaptability of the DNN, and listening tests demonstrate that the DNN can achieve significantly better adaptation performance than the hidden Markov model (HMM) baseline in terms of naturalness and speaker similarity.


Noise and Bandwidth analysis for PMOS based wide swing cascode current mirror using 0.35 um CMOS-MEMS technology

In this work, we propose a PMOS based wide swing cascode current mirror (WSSCM) for 0.35 um CMOS-MEMS technology. The proposed circuit shows a high bandwidth current mirror with high output resistance capability operating at low voltage levels. Noise, output resistance and bandwidth analysis are presented. CADENCE SPECTRE circuit design tool using MIMOS 0.35 um and BSIM3 transistor models is used to carry out the simulations. The circuit achieves an amplification of 120.04 uA, the input referred noise of the circuit is 75.77 nV/√Hz with a minimum power consumption of 0.33 mW and a high output resistance of 15 MO .


Review of Inflatable Booms for Deployable Space Structures : Packing and Rigidization

Inflatable structures offer the potential of compactly stowing lightweight structures, which assume a fully deployed state in space. An important category of space inflatables are cylindrical booms, which may form the structural members of trusses or the support structure for solar sails. Two critical and interdependent aspects of designing inflatable cylindrical booms for space applications are i) packaging methods that enable compact stowage and ensure reliable deployment, and ii) rigidization techniques that provide long-term structural ridigity after deployment. The vast literature in these two fields is summarized to establish the state of the art.


Simulation of Rigid Origami

This paper presents a system for computer based interactive simulation of origami, based on rigid origami model. Our system shows the continuous process of folding a piece of paper into a folded shape by calculating the configuration from the crease pattern. The configuration of the model is represented by crease angles, and the trajectory is calculated by projecting angles motion to the constrained space. Additionally, polygons are triangulated and crease lines are adjusted in order to make the model more flexible. Flexible motion and comprehensible representation of origami help users to understand the structure of the model and to fold the model from a crease pattern.


One-DOF Cylindrical Deployable Structures with Rigid Quadrilateral Panels

In this paper,we present a novel cylindrical deployable structure and variations of its design with the following characteristics: 1. Flat-foldable: The shape flattens into a compact 2D configuration. 2. Rigid-foldable: Each element does not deform throughout the transformation. 3. One-DOF: The mechanism has exactly one degree of freedom. 4. Thick: Facets can be substituted with thick or multilayered panels without introducing the distortion of elements.


Robotic origami folding

Origami, the human art of paper sculpture, is a fresh challenge for the field of robotic manipulation, and provides a concrete example for many difficult and general manipulation problems. This thesis will present some initial results, including the world’s first origami-folding robot, some new theorems about foldability, definition of a simple class of origami for which I have designed a complete automatic planner, analysis of the kinematics of more complicated folds, and some observations about the configuration spaces of compound spherical closed chains.


Swarm Control of UAVs for Cooperative Hunting with DDDAS

Swarm control is a problem of increasing importance with technological advancements. Recently, governments have begun employing UAVs for reconnaissance, including swarms of drones searching for evasive targets. An agent-based simulation for dynamic cooperative cleaning is augmented with additional behaviors and implemented into a Dynamic Data-Driven Application System (DDDAS) framework for dynamic swarm control.