Computer Forensics Field Triage Process Model

With the proliferation of digital based evidence, the need for the timely identification, analysis and interpretation of digital evidence is becoming more crucial. In many investigations critical information is required while at the scene or within a short period of time measured in hours as opposed to days. The traditional cyber forensics approach of seizing a system(s)/media, transporting it to the lab, making a forensic image(s), and then searching the entire system for potential evidence, is no longer appropriate in some circumstances. In cases such as child abductions, pedophiles, missing or exploited persons, time is of the essence. In these types of cases, investigators dealing with the suspect or crime scene need investigative leads quickly; in some cases it is the difference between life and death for the victim(s). The Cyber Forensic Field Triage Process Model (CFFTPM) proposes an onsite or field approach for providing the identification, analysis and interpretation of digital evidence in a short time frame, without the requirement of having to take the system(s)/media back to the lab for an in-depth examination or acquiring a complete forensic image(s). The proposed model adheres to commonly held forensic principles, and does not negate the ability that once the initial field triage is concluded, the system(s)/storage media be transported back to a lab environment for a more thorough examination and analysis. The CFFTPM has been successfully used in various real world cases, Journal of Digital Forensics, Security and Law, Vol. 1(2) 20 and its investigative importance and pragmatic approach has been amply demonstrated. Furthermore, the derived evidence from these cases has not been challenged in the court proceedings where it has been introduced. The current article describes the CFFTPM in detail, discusses the model’s forensic soundness, investigative support capabilities and practical considerations.


Saliency-Guided Detection of Unknown Objects in RGB-D Indoor Scenes

This paper studies the problem of detecting unknown objects within indoor environments in an active and natural manner. The visual saliency scheme utilizing both color and depth cues is proposed to arouse the interests of the machine system for detecting unknown objects at salient positions in a 3D scene. The 3D points at the salient positions are selected as seed points for generating object hypotheses using the 3D shape. We perform multi-class labeling on a Markov random field (MRF) over the voxels of the 3D scene, combining cues from object hypotheses and 3D shape. The results from MRF are further refined by merging the labeled objects, which are spatially connected and have high correlation between color histograms. Quantitative and qualitative evaluations on two benchmark RGB-D datasets illustrate the advantages of the proposed method. The experiments of object detection and manipulation performed on a mobile manipulator validate its effectiveness and practicability in robotic applications.


Interactive Character Animation Using Simulated Physics: A State-of-the-Art Review

Physics simulation offers the possibility of truly responsive and realistic animation. Despite wide adoption of physics simulation for the animation of passive phenomena, such as fluids, cloths and rag-doll characters, commercial applications still resort to kinematics-based approaches for the animation of actively controlled characters. However, following a renewed interest in the use of physics simulation for interactive character animation, many recent publications demonstrate tremendous improvements in robustness, visual quality and usability. We present a structured review of over two decades of research on physics-based character animation, as well as point out various open research areas and possible future directions.


Resilient packet delivery through software defined redundancy: An experimental study

Mission-critical applications that use computer networks require guaranteed communication with bounds on the time needed to deliver packets, even if hardware along a path fails or congestion occurs. Current networking technologies follow a reactive approach in which retransmission mechanisms and routing update protocols respond once packet loss occurs. We present a proactive approach that pre-builds and monitors redundant paths to ensure timely delivery with no recovery latency, even in the case of a single-link failure. The paper outlines the approach, describes a new mechanism we call a redundancy controller, and explains the use of SDN to establish and change paths. The paper also reports on a prototype system and gives experimental measurements.


The FuzzyLog: A Partially Ordered Shared Log

The FuzzyLog is a partially ordered shared log abstraction. Distributed applications can concurrently append to the partial order and play it back. FuzzyLog applications obtain the benefits of an underlying shared log – extracting strong consistency, durability, and failure atomicity in simple ways – without suffering from its drawbacks. By exposing a partial order, the FuzzyLog enables three key capabilities for applications: linear scaling for throughput and capacity (without sacrificing atomicity), weaker consistency guarantees, and tolerance to network partitions. We present Dapple, a distributed implementation of the FuzzyLog abstraction that stores the partial order compactly and supports efficient appends / playback via a new ordering protocol. We implement several data structures and applications over the FuzzyLog, including several map variants as well as a ZooKeeper implementation. Our evaluation shows that these applications are compact, fast, and flexible: they retain the simplicity (100s of lines of code) and strong semantics (durability and failure atomicity) of a shared log design while exploiting the partial order of the FuzzyLog for linear scalability, flexible consistency guarantees (e.g., causal+ consistency), and network partition tolerance. On a 6-node Dapple deployment, our FuzzyLogbased ZooKeeper supports 3M/sec single-key writes, and 150K/sec atomic cross-shard renames.


Predictors of Relationship Satisfaction in Online Romantic Relationships

Based on traditional theories of interpersonal relationship development and on the hyperpersonal communication theory, this study examined predictors of relationship satisfaction for individuals involved in online romantic relationships. One hundredfourteen individuals (N1⁄4114) involved in online romantic relationships, and who had only engaged in computer-mediated communication (CMC) with their partners, completed an online questionnaire about their relationships. Intimacy, trust, and communication satisfaction were found to be the strongest predictors of relationship satisfaction for individuals involved in online romances. Additionally, perceptions of relationship variables differed depending on relationship length and time spent communicating. Implications for interpersonal and hyperpersonal communication theories, and future investigation of online relationships, are discussed.


Impact of Corpora Quality on Neural Machine Translation

Large parallel corpora that are automatically obtained from the web, documents or elsewhere often exhibit many corrupted parts that are bound to negatively affect the quality of the systems and models that learn from these corpora. This paper describes frequent problems found in data and such data affects neural machine translation systems, as well as how to identify and deal with them. The solutions are summarised in a set of scripts that remove problematic sentences from input corpora.


Computed tomographic analysis of tooth-bearing alveolar bone for orthodontic miniscrew placement.

INTRODUCTION
When monocortical orthodontic miniscrews are placed in interdental alveolar bone, the safe position of the miniscrew tip should be ensured. This study was designed to quantify the periradicular space in the tooth-bearing area to provide practical guidelines for miniscrew placement.

METHODS
Computerized tomographs of 30 maxillae and mandibles were taken from nonorthodontic adults with normal occlusion. Both mesiodistal interradicular distance and bone thickness over the narrowest interradicular space (safety depth) were measured at 2, 4, 6, and 8 mm from the cementoenamel junction.

RESULTS
Mesiodistal space greater than 3 mm was available at the 8-mm level in the maxillary anterior region, between the premolars, and between the second premolar and the first molar at 4 mm. In the mandible, sufficient mesiodistal space was found between the premolars, between the molars, and between the second premolar and the first molar at the 4-mm level. Safety depth greater than 4 mm was found in the maxillary and mandibular intermolar regions, and between the second premolar and the first molar in both arches.

CONCLUSIONS
Subapical placement is advocated in the anterior segment. Premolar areas appear reliable in both arches. Angulated placement in the intermolar area is suggested to use the sufficient safety depth in this area.


Block Chain Technologies & The Semantic Web : A Framework for Symbiotic Development

The concept of peer-to-peer applications is not new, nor is the concept of distributed hash tables. What emerged in 2008 with the publication of the Bitcoin white paper was an incentive structure that unified these two software paradigms with a set of economic stimuli to motivate the creation of a dedicated computing network orders of magnitude more powerful than the world’s fastest supercomputers. The purpose of which is the maintenance of a massive distributed database known as the Bitcoin “block chain”. Apart from the digital currency it enables, block chain technology is a fascinating new computing paradigm with broad implications for the future development of the World Wide Web, and by extension, the further growth of Linked Data and the Semantic Web. This work is divided into two main sections, we first demonstrate how block chain technologies can contribute toward the realization of a more robust Semantic Web, and subsequently we provide a framework wherein the Semantic Web is utilized to ameliorate block chain technology itself.


A survey of remote optical photoplethysmographic imaging methods

In recent years researchers have presented a number of new methods for recovering physiological parameters using just low-cost digital cameras and image processing. The ubiquity of digital cameras presents the possibility for many new, low-cost applications of vital sign monitoring. In this paper we present a review of the work on remote photoplethysmographic (PPG) imaging using digital cameras. This review specifically focuses on the state-of-the-art in PPG imaging where: 1) measures beyond pulse rate are evaluated, 2) non-ideal conditions (e.g., the presence of motion artifacts) are explored, and 3) use cases in relevant environments are demonstrated. We discuss gaps within the literature and future challenges for the research community. To aid in the continuing advancement of PPG imaging research, we are making available a website with the references collected for this review as well as information on available code and datasets of interest. It is our hope that this website will become a valuable resource for the PPG imaging community. The site can be found at: http://web.mit.edu/~djmcduff/www/ remote-physiology.html.


Non-contact, automated cardiac pulse measurements using video imaging and blind source separation.

Remote measurements of the cardiac pulse can provide comfortable physiological assessment without electrodes. However, attempts so far are non-automated, susceptible to motion artifacts and typically expensive. In this paper, we introduce a new methodology that overcomes these problems. This novel approach can be applied to color video recordings of the human face and is based on automatic face tracking along with blind source separation of the color channels into independent components. Using Bland-Altman and correlation analysis, we compared the cardiac pulse rate extracted from videos recorded by a basic webcam to an FDA-approved finger blood volume pulse (BVP) sensor and achieved high accuracy and correlation even in the presence of movement artifacts. Furthermore, we applied this technique to perform heart rate measurements from three participants simultaneously. This is the first demonstration of a low-cost accurate video-based method for contact-free heart rate measurements that is automated, motion-tolerant and capable of performing concomitant measurements on more than one person at a time.


Mobile monitoring with wearable photoplethysmographic biosensors.

earable biosensors (WBS) will permit continuous cardiovascular (CV) monitoring in a number of novel settings. Benefits may be realized in the diagnosis and treatment of a number of major diseases. WBS, in conjunction with appropriate alarm algorithms, can increase surveillance capabilities for CV catastrophe for high-risk subjects. WBS could also play a role in the treatment of chronic diseases, by providing information that enables precise titration of therapy or detecting lapses in patient compliance. WBS could play an important role in the wireless surveillance of people during hazardous operations (military, fire-fighting, etc.), or such sensors could be dispensed during a mass civilian casualty occurrence. Given that CV physio-logic parameters make up the " vital signs " that are the most important information in emergency medical situations, WBS might enable a wireless monitoring system for large numbers of at-risk subjects. This same approach may also have utility in monitoring the waiting room of today's overcrowded emergency departments. For hospital inpatients who require CV monitoring, current biosensor technology typically tethers patients in a tangle of cables, whereas wearable CV sensors could increase inpatient comfort and may even reduce the risk of tripping and falling, a perennial problem for hospital patients who are ill, medicated, and in an unfamiliar setting. On a daily basis, wearable CV sensors could detect a missed dose of medication by sensing untreated elevated blood pressure and could trigger an automated reminder for the patient to take the medication. Moreover, it is important for doctors to titrate the treatment of high blood pressure, since both insufficient therapy as well as excessive therapy (leading to abnormally low blood pressures) increase mortality. However, healthcare providers have only intermittent values of blood pressure on which to base therapy decisions; it is possible that continuous blood pressure monitoring would permit enhanced titration of therapy and reductions in mortality. Similarly, WBS would be able to log the physiologic signature of a patient's exercise efforts (manifested as changes in heart rate and blood pressure), permitting the patient and healthcare provider to assess compliance with a regimen proven to improve health outcomes. For patients with chronic cardiovascular disease, such as heart failure, home monitoring employing WBS may detect exacerbations in very early (and often easily treated) stages, long before the patient progresses to more dangerous levels that necessitate an emergency room visit and costly hospital admission. In this article we will address both technical and clinical …


An extended set of Haar-like features for rapid object detection

Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple features. In this paper we introduce a novel set of rotated haar-like features, which significantly enrich this basic set of simple haar-like features and which can also be calculated very efficiently. At a given hit rate our sample face detector shows off on average a 10% lower false alarm rate by means of using these additional rotated features. We also present a novel post optimization procedure for a given boosted cascade improving on average the false alarm rate further by 12.5%. Using both enhancements the number of false detections is only 24 at a hit rate of 82.3% on the CMU face set [7].


Recovering pulse rate during motion artifact with a multi-imager array for non-contact imaging photoplethysmography

Photoplethysmography relies on characteristic changes in the optical absorption of tissue due to pulsatile (arterial) blood flow in peripheral vasculature. Sensors for observing the photoplethysmographic effect have traditionally required contact with the skin surface. Recent advances in non-contact imaging photoplethysmography have demonstrated that measures of cardiopulmonary system state, such as pulse rate, pulse rate variability, and respiration rate, can be obtained from a participant by imaging their face under relatively motionless conditions. A critical limitation in this method that must be resolved is the inability to recover these measures under conditions of head motion artifact. To investigate the adequacy of channel space dimensionality for the use of blind source separation in this context, nine synchronized, visible spectrum imagers positioned in a semicircular array centered on the imaged participant were used for data acquisition in a controlled lighting environment. Three-lead electrocardiogram and finger-tip reflectance photoplethysmogram were also recorded as ground truth signals. Controlled head motion artifact trial conditions were compared to trials in which the participant remained stationary, with and without the aid of a chinrest. Bootstrapped means of one-minute, non-overlapping trial segments show that, for situations involving little to no head motion, a single imager is sufficient for recovering pulse rate with an average absolute error of less than two beats per minute. However, error in the recovered pulse rate measurement for the single imager can be as high as twenty-two beats per minute when head motion artifact is severe. This increase in measurement error during motion artifact was mitigated by increasing the dimensionality of the imager channel space with multiple imagers in the array prior to applying blind source separation. In contrast to single-imager results, the multi-imager channel space resulted in an absolute error in the recovered pulse rate measurement that is comparable with pulse rate measured via fingertip reflectance photoplethysmography. These results demonstrate that non-contact, imaging photoplethysmography can be accurate in the presence of head motion artifact when a multi-imager array is implemented to increase the dimensionality of the decomposed channel space.


Inverse Risk-Sensitive Reinforcement Learning

We address the problem of inverse reinforcement learning in Markov decision processes where the agent is risk-sensitive. We derive a risk-sensitive reinforcement learning algorithm with convergence guarantees that employs convex risk metrics and models of human decisionmaking deriving from behavioral economics. The risk-sensitive reinforcement learning algorithm provides the theoretical underpinning for a gradient-based inverse reinforcement learning algorithm that minimizes a loss function defined on observed behavior of a risk-sensitive agent. We demonstrate the performance of the proposed technique on two examples: (i) the canonical Grid World example and (ii) a Markov decision process modeling ride-sharing passengers’ decisions given price changes. In the latter, we use pricing and travel time data from a ride-sharing company to construct the transition probabilities and rewards of the Markov decision process.


Minimization of symbolic automata

Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this paper we study the problem of minimizing symbolic automata. We formally define and prove the basic properties of minimality in the symbolic setting, and lift classical minimization algorithms (Huffman-Moore's and Hopcroft's algorithms) to symbolic automata. While Hopcroft's algorithm is the fastest known algorithm for DFA minimization, we show how, in the presence of symbolic alphabets, it can incur an exponential blowup. To address this issue, we introduce a new algorithm that fully benefits from the symbolic representation of the alphabet and does not suffer from the exponential blowup. We provide comprehensive performance evaluation of all the algorithms over large benchmarks and against existing state-of-the-art implementations. The experiments show how the new symbolic algorithm is faster than previous implementations.


An Empirical Evaluation of True Online TD({\lambda})

The true online TD(λ) algorithm has recently been proposed (van Seijen and Sutton, 2014) as a universal replacement for the popular TD(λ) algorithm, in temporal-difference learning and reinforcement learning. True online TD(λ) has better theoretical properties than conventional TD(λ), and the expectation is that it also results in faster learning. In this paper, we put this hypothesis to the test. Specifically, we compare the performance of true online TD(λ) with that of TD(λ) on challenging examples, random Markov reward processes, and a real-world myoelectric prosthetic arm. We use linear function approximation with tabular, binary, and non-binary features. We assess the algorithms along three dimensions: computational cost, learning speed, and ease of use. Our results confirm the strength of true online TD(λ): 1) for sparse feature vectors, the computational overhead with respect to TD(λ) is minimal; for non-sparse features the computation time is at most twice that of TD(λ), 2) across all domains/representations the learning speed of true online TD(λ) is often better, but never worse than that of TD(λ), and 3) true online TD(λ) is easier to use, because it does not require choosing between trace types, and it is generally more stable with respect to the step-size. Overall, our results suggest that true online TD(λ) should be the first choice when looking for an efficient, general-purpose TD method.


Cause related marketing campaigns and consumer purchase intentions : The mediating role of brand awareness and corporate image

The purpose of this research is to investigate the kind of relationship between Cause Related Marketing (CRM) campaigns, brand awareness and corporate image as possible antecedents of consumer purchase intentions in the less developed country of Pakistan. An initial conceptualization was developed from mainstream literature to be validated through empirical research. The conceptualization was then tested with primary quantitative survey data collected from 203 students studying in different universities of Rawalpindi and Islamabad. Correlation and regression analysis were used to test the key hypothesis derived from literature positing brand awareness and corporate image as mediating the relationship between CRM and consumer purchase intentions. The findings indicate that consumer purchase intentions are influenced by the cause related marketing campaigns. Furthermore it was observed that the brand awareness and corporate image partially mediate the impact of CRM campaigns on consumer purchase intentions. The data was gathered from universities situated in Rawalpindi and Islamabad only. Hence, future research could extend these findings to other cities in Pakistan to test their generalizability. Further research can be carried out through data collection from those people who actually participated in cause related marketing campaigns to identify the original behavior of customers instead of their purchase intentions. This research and the claims made are limited to the FMCG industry. The key implications cause related marketing of these findings for marketing managers lend support for the use of campaigns in Pakistan. The findings also suggest some measures which can be taken in to consideration in order to enhance brand awareness and to improve corporate image as both variables mediate the impact of CRM campaigns on consumer purchase intentions. The study contributes to cause related marketing literature by indicating a mediating role of brand awareness and corporate image on CRM campaigns and consumer purchase intentions. This mediating role was ignored in previous studies. Moreover, it contributes to close the gap of empirical research in this field, which exists particularly due to the diverse attitude of customers in less developed countries such as Pakistan.


Loosecut: Interactive image segmentation with loosely bounded boxes

One popular approach to interactively segment an object of interest from an image is to annotate a bounding box that covers the object, followed by a binary labeling. However, the existing algorithms for such interactive image segmentation prefer a bounding box that tightly encloses the object. This increases the annotation burden, and prevents these algorithms from utilizing automatically detected bounding boxes. In this paper, we develop a new LooseCut algorithm that can handle cases where the bounding box only loosely covers the object. We propose a new Markov Random Fields (MRF) model for segmentation with loosely bounded boxes, including an additional energy term to encourage consistent labeling of similar-appearance pixels and a global similarity constraint to better distinguish the foreground and background. This MRF model is then solved by an iterated max-flow algorithm. We evaluate LooseCut in three public image datasets, and show its better performance against several state-of-the-art methods when increasing the bounding-box size.


Morphological Smoothing and Extrapolation of Word Embeddings

Languages with rich inflectional morphology exhibit lexical data sparsity, since the word used to express a given concept will vary with the syntactic context. For instance, each count noun in Czech has 12 forms (where English uses only singular and plural). Even in large corpora, we are unlikely to observe all inflections of a given lemma. This reduces the vocabulary coverage of methods that induce continuous representations for words from distributional corpus information. We solve this problem by exploiting existing morphological resources that can enumerate a word’s component morphemes. We present a latentvariable Gaussian graphical model that allows us to extrapolate continuous representations for words not observed in the training corpus, as well as smoothing the representations provided for the observed words. The latent variables represent embeddings of morphemes, which combine to create embeddings of words. Over several languages and training sizes, our model improves the embeddings for words, when evaluated on an analogy task, skip-gram predictive accuracy, and word similarity.


K-Automorphism: A General Framework For Privacy Preserving Network Publication

The growing popularity of social networks has generated interesting data management and data mining problems. An important concern in the release of these data for study is their privacy, since social networks usually contain personal information. Simply removing all identifiable personal information (such as names and social security number) before releasing the data is insufficient. It is easy for an attacker to identify the target by performing different structural queries. In this paper we propose k-automorphism to protect against multiple structural attacks and develop an algorithm (called KM) that ensures k-automorphism. We also discuss an extension of KM to handle “dynamic” releases of the data. Extensive experiments show that the algorithm performs well in terms of protection it provides.


Making Smart Contracts Smarter

Cryptocurrencies record transactions in a decentralized data structure called a blockchain. Two of the most popular cryptocurrencies, Bitcoin and Ethereum, support the feature to encode rules or scripts for processing transactions. This feature has evolved to give practical shape to the ideas of smart contracts, or full-fledged programs that are run on blockchains. Recently, Ethereum's smart contract system has seen steady adoption, supporting tens of thousands of contracts, holding millions dollars worth of virtual coins.
 In this paper, we investigate the security of running smart contracts based on Ethereum in an open distributed network like those of cryptocurrencies. We introduce several new security problems in which an adversary can manipulate smart contract execution to gain profit. These bugs suggest subtle gaps in the understanding of the distributed semantics of the underlying platform. As a refinement, we propose ways to enhance the operational semantics of Ethereum to make contracts less vulnerable. For developers writing contracts for the existing Ethereum system, we build a symbolic execution tool called Oyente to find potential security bugs. Among 19, 336 existing Ethereum contracts, Oyente flags 8, 833 of them as vulnerable, including the TheDAO bug which led to a 60 million US dollar loss in June 2016. We also discuss the severity of other attacks for several case studies which have source code available and confirm the attacks (which target only our accounts) in the main Ethereum network.


Enumerating the Non-Isomorphic Assembly Configurations of Modular Robotic Systems

A \modular" robotic system consists of joint and link modules that can be assembled in a variety of conngurations to meet diierent or changing task requirements. However, due to typical symmetries in module design, diierent assembly conngurations may lead to robotic structures which are kinematically identical, or isomorphic. This paper considers how to enumerate the non-isomorphic assembly conngurations of a modular robotic system. We introduce an Assembly Incidence Matrix (AIM) to represent a modular robot assembly con-guration. Then we use symmetries of the module geometry and graph isomorphisms to deene an equivalence relation on the AIMs. Equivalent AIMs represent isomorphic robot assembly conngurations. Based on this equivalence relation, we propose an algorithm to generate non-isomorphic assembly conngurations of an n-link tree-like robot with diierent joint and link module types. Examples demonstrate that this method is a signiicant improvement over a brute force enumeration process.


Locally Normalized Filter Banks Applied to Deep Neural-Network-Based Robust Speech Recognition

This letter describes modifications to locally normalized filter banks (LNFB), which substantially improve their performance on the Aurora-4 robust speech recognition task using a Deep Neural Network-Hidden Markov Model (DNN-HMM)-based speech recognition system. The modified coefficients, referred to as LNFB features, are a filter-bank version of locally normalized cepstral coefficients (LNCC), which have been described previously. The ability of the LNFB features is enhanced through the use of newly proposed dynamic versions of them, which are developed using an approach that differs somewhat from the traditional development of delta and delta–delta features. Further enhancements are obtained through the use of mean normalization and mean–variance normalization, which is evaluated both on a per-speaker and a per-utterance basis. The best performing feature combination (typically LNFB combined with LNFB delta and delta–delta features and mean–variance normalization) provides an average relative reduction in word error rate of 11.4% and 9.4%, respectively, compared to comparable features derived from Mel filter banks when clean and multinoise training are used for the Aurora-4 evaluation. The results presented here suggest that the proposed technique is more robust to channel mismatches between training and testing data than MFCC-derived features and is more effective in dealing with channel diversity.


DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks

Probabilistic forecasting, i.e. estimating the probability distribution of a time series’ future given its past, is a key enabler for optimizing business processes. In retail businesses, for example, forecasting demand is crucial for having the right inventory available at the right time at the right place. In this paper we propose DeepAR, a methodology for producing accurate probabilistic forecasts, based on training an auto-regressive recurrent network model on a large number of related time series. We demonstrate how by applying deep learning techniques to forecasting, one can overcome many of the challenges faced by widely-used classical approaches to the problem. We show through extensive empirical evaluation on several real-world forecasting data sets that our methodology produces more accurate forecasts than other state-of-the-art methods, while requiring minimal manual work.


IMPACTS DUE TO INTERNET ADDICTION AMONG MALAYSIAN UNIVERSITY STUDENTS Azizah Zainudin

The purpose of this study is to study the impacts due to Internet addiction among Malaysian university students. Research methodology used in this study was by distributing survey questions to 653 university students from five different universities in Malaysia. There were four possible impacts measured in this research study which include Academic Performances, Relationships, Personality and Lifestyle. The finding shows that, Internet addiction cause problems with respondents’ academic performances, having bad personality and practicing an unhealthy lifestyle. There were significantly differences in academic performances, personality and lifestyle between “Average user” and “Excessive user”. The above matter will be further discussed throughout this


Micropower energy harvesting

More than a decade of research in the field of thermal, motion, vibration and electromagnetic radiation energy harvesting has yielded increasing power output and smaller embodiments. Power management circuits for rectification and DC–DC conversion are becoming able to efficiently convert the power from these energy harvesters. This paper summarizes recent energy harvesting results and their power man-


The Role of Asymmetric Dimethylarginine (ADMA) in Endothelial Dysfunction and Cardiovascular Disease

Endothelium plays a crucial role in the maintenance of vascular tone and structure. Endothelial dysfunction is known to precede overt coronary artery disease. A number of cardiovascular risk factors, as well as metabolic diseases and systemic or local inflammation cause endothelial dysfunction. Nitric oxide (NO) is one of the major endothelium derived vaso-active substances whose role is of prime importance in maintaining endothelial homeostasis. Low levels of NO are associated with impaired endothelial function. Asymmetric dimethylarginine (ADMA), an analogue of L-arginine, is a naturally occurring product of metabolism found in human circulation. Elevated levels of ADMA inhibit NO synthesis and therefore impair endothelial function and thus promote atherosclerosis. ADMA levels are increased in people with hypercholesterolemia, atherosclerosis, hypertension, chronic heart failure, diabetes mellitus and chronic renal failure. A number of studies have reported ADMA as a novel risk marker of cardiovascular disease. Increased levels of ADMA have been shown to be the strongest risk predictor, beyond traditional risk factors, of cardiovascular events and all-cause and cardiovascular mortality in people with coronary artery disease. Interventions such as treatment with L-arginine have been shown to improve endothelium-mediated vasodilatation in people with high ADMA levels. However the clinical utility of modifying circulating ADMA levels remains uncertain.


Sindice.com: a document-oriented lookup index for open linked data

Data discovery on the SemanticWeb requires crawling and indexing of statements, in addition to the ‘linked-data’ approach of de-referencing resourceURIs. Existing SemanticWeb search engines are focused on database-like functionality, compromising on index size, query performance and live updates.Wepresent Sindice, a lookup indexover SemanticWeb resources. Our index allows applications to automatically locate documents containing information about a given resource. In addition, we allow resource retrieval through inverse-functional properties, offer a full-text search and index SPARQL endpoints. Finally, we extend the sitemap protocol to efficiently index large datasets with minimal impact on data providers.


Evaluating radial, axial and transverse flux topologies for 'in-wheel' motor

Three different motor topologies, (1) radial, (2) axial and (3) transverse flux, are investigated for 'in-wheel' electric propulsion system. The design constraints are: 350mm/spl times/100mm package limitation, 48 V DC bus restriction and per phase inverter current limited to 500 A/sup pk/. In addition, magnet pole pairs are fixed to 9 due to limitation in 'position sensor' capacity. The paper summarizes results obtained from analytical design followed by 2D and 3D static and transient finite element analysis accompanied with experimental verification for the radial flux topology.


Essential features of serious games design in higher education: Linking learning attributes to game mechanics

This paper consolidates evidence and material from a range of specialist and disciplinary fields to provide an evidence-based review and synthesis on the design and use of serious games in higher education. Search terms identified 165 papers reporting conceptual and empirical evidence on how learning attributes and game mechanics may be planned, designed, and implemented by university teachers interested in using games, which are integrated into lesson plans and orchestrated as part of a learning sequence at any scale. The findings outline the potential of classifying the links between learning attributes and game mechanics as a means to scaffold teachers’ understanding of how to perpetuate learning in optimal ways whilst enhancing the in-game learning experience. The findings of this paper provide a foundation for describing methods, frames, and discourse around experiences of design and use of serious games, linked to methodological limitations and recommendations for further research in this area. Practitioner Notes What is already known about this topic • Serious game design is a relatively new discipline that couples learning design with game features. A key characteristic of this approach is grounded in educational need and theory, rather than a focus purely on entertainment. Under this approach, a common method for designing serious games involves the creation of learning strategies, content and principles for the purpose of enhancing the student’s learning experience. • There are no pedagogically driven strategies that take into account how learning attributes are interlinked to game elements for balancing learning with play. This is due to a limited evidence base of comparative evaluations assessing differing game designs against a single pedagogical model, or vice versa. This often leads practitioners seeking to introduce games into classroom with difficulties identifying what defines a game or how design should be enacted in a way that encompasses particular learning interventions. • Qualitative research methodologies have not been utilised as often for discerning how people experience, understand and use serious games for teaching and learning in higher education. What this paper adds • This paper presents the foundation of a taxonomy linking learning and game attributes along with teacher roles, aiming to encourage the cross-fertilisation and further integration of evidence on serious game design. The initial findings provide insight for practitioners on elements common to games and serious games, and how these link to particular learning design strategies that may afford pedagogically-rich games. • It informs development in the design and use of serious games to support teaching and learning in higher education. Given the key role of practitioners in the development of a wide range of serious games, due to the iterative and participatory methods frequently adopted, it offers insight into game elements and mechanics, allowing practitioners to easily relate to how learning activities, outcomes, feedback and roles may vary and visualised in relation to what needs to be learned out of playing the game. • The paper also identifies gaps in the evidence base and avenues for future research. Through this a practitioner can gain insight into the current unknowns in the area, and relate their experience of introducing games in the classroom to the current evidence base. Implications for practice and/or policy • The taxonomy informs serious game/instructional designers, game developers, academics and students about how learning elements (e.g. learning activities, learning outcomes, feedback and assessment) can be represented in games. We advocate dialogue between teachers and serious game designers, for improving the process of amalgamating learning with fun; and whilst the idea of using digital games is relatively new, teachers have a wealth of experience introducing learning features in games to be used into their classroom activities which frequently set out undocumented. • It aids the delineation of game attributes and associated game categories for characterising games based on primary purpose and use. Planning and designing teaching and learning in a game and teacher’s associated role in guiding the in-game learning process is a consistent challenge and this paper seeks to provide a foundation by which this process can be undertaken in an informed and conscious manner. • The findings of the review act as the point of departure for creating a research agenda for understanding disjunctions between espoused and enacted personal theories of using serious games through qualitative methodologies. Introduction Serious Games (SGs) design is a relatively new discipline that couples learning design with game mechanics and logic (de Freitas, 2006; Hainley 2006; Westera et al., 2008). Design for SGs involves the creation of learning activities that may use the whole game or entail a gaming element (e.g. leader boards, virtual currencies, in-game hints) for the purpose of transforming the student’s learning experience. Arguments against SGs have centred upon lack of empirical evidence in support of their efficacy; and the fact that appropriate research methodologies have not been enacted as yet for discerning how people understand and use SGs for teaching and learning in higher education (Mayer 2012; Connolly 2012). However, there are studies in the UK and US respectively that have demonstrated positive results in large sample groups (see for example Dunwell et al., 2014; Hertzog et al., 2014; Kato et al., 2008). Research evidence stresses the lack of commonly accepted pedagogically-driven strategies to afford game mechanisms and suggest that an inclusive model that takes into account pedagogy and teaching strategy, aligned to game activity and assessment is necessary for balancing play features with pedagogical aspects. This argument stems from an important observation that learning is a constructive process, which encompasses aspects of collaborative learning in which knowledge creation emerges through discussion and negotiation between individuals and groups. With these perspectives, this paper draws together evidence and material from a range of specialist and disciplinary fields to offer a critical review and synthesis of the design and use of SGs in higher


Removing Shadows from Images

We attempt to recover a 2D chromaticity intrinsic variation of a single RGB image which is independent of lighting, without requiring any prior knowledge about the camera. The proposed algorithm aims to learn an invariant direction for projecting from 2D color space to the greyscale intrinsic image. We notice that along this direction, the entropy in the derived invariant image is minimized. The experiments conducted on various inputs indicate that this method achieves intrinsic 2D chromaticity images which are free of shadows. In addition, we examined the idea to utilize projection pursuit instead of entropy minimization to find the desired direction.


Kwyjibo: automatic domain name generation

Automatically generating ‘good’ domain names that are random yet pronounceable is a problem harder than it first appears. The problem is related to random word generation, and we survey and categorize existing techniques before presenting our own syllable-based algorithm that produces higher-quality results. Our results are also applicable elsewhere, in areas such as password generation, username generation, and even computer-generated poetry. Copyright © 2008 John Wiley & Sons, Ltd.


Multi-session PLDA scoring of i-vector for partially open-set speaker detection

This paper advocates the use of probabilistic linear discriminant analysis (PLDA) for partially open-set detection task with multiple i-vectors enrollment condition. Also referred to as speaker verification, the speaker detection task has always been considered under an open-set scenario. In this paper, a more general partially open-set speaker detection problem in considered, where the imposters might be one of the known speakers previously enrolled to the system. We show how this could be coped with by modifying the definition of the alternative hypothesis in the PLDA scoring function. We also look into the impact of the conditionalindependent assumption as it was used to derive the PLDA scoring function with multiple training i-vectors. Experiments were conducted using the NIST 2012 Speaker Recognition Evaluation (SRE’12) datasets to validate various points discussed in the paper.


The effects of prosocial video games on prosocial behaviors: international evidence from correlational, longitudinal, and experimental studies.

Although dozens of studies have documented a relationship between violent video games and aggressive behaviors, very little attention has been paid to potential effects of prosocial games. Theoretically, games in which game characters help and support each other in nonviolent ways should increase both short-term and long-term prosocial behaviors. We report three studies conducted in three countries with three age groups to test this hypothesis. In the correlational study, Singaporean middle-school students who played more prosocial games behaved more prosocially. In the two longitudinal samples of Japanese children and adolescents, prosocial game play predicted later increases in prosocial behavior. In the experimental study, U.S. undergraduates randomly assigned to play prosocial games behaved more prosocially toward another student. These similar results across different methodologies, ages, and cultures provide robust evidence of a prosocial game content effect, and they provide support for the General Learning Model.


Oral squamous cell carcinoma overview.

Most cancer in the head and neck is squamous cell carcinoma (HNSCC) and the majority is oral squamous cell carcinoma (OSCC). This is an overview of oral squamous cell carcinoma (OSCC) highlighting essential points from the contributors to this issue, to set the scene. It emphasises the crucial importance of prevention and the necessarily multidisciplinary approach to the diagnosis and management of patients with OSCC.


Hybrid crafting: towards an integrated practice of crafting with physical and digital components

With current digital technologies, people have large archives of digital media, such as images and audio files, but there are only limited means to include these media in creative practices of crafting and making. Nevertheless, studies have shown that crafting with digital media often makes these media more cherished and that people enjoy being creative with their digital media. This paper aims to open up the way for novel means for crafting, which include digital media in integrations with physical construction, here called ‘hybrid crafting’. Notions of hybrid crafting were explored to inform the design of products or systems that may support these new crafting practices. We designed ‘Materialise’—a building set that allows for the inclusion of digital images and audio files in physical constructions by using tangible building blocks that can display images or play audio files, alongside a variety of other physical components—and used this set in four hands-on creative workshops to gain insight into how people go about doing hybrid crafting; whether hybrid crafting is desirable; what the characteristics of hybrid crafting are; and how we may design to support these practices. By reflecting on the findings from these workshops, we provide concrete guidelines for the design of novel hybrid crafting products or systems that address craft context, process and result. We aim to open up the design space to designing for hybrid crafting because these new practices provide interesting new challenges and opportunities for future crafting that can lead to novel forms of creative expression.


MOA: Massive Online Analysis

MassiveOnline Analysis (MOA) is a software environment for implementing al orithms and running experiments for online learning from evolving data str eams. MOA includes a collection of offline and online methods as well as tools for evaluation. In particular, it implements boosting, bagging, and Hoeffding Trees, all with and without Na ı̈ve Bayes classifiers at the leaves. MOA supports bi-directional interaction with WEKA, the Waikato Environment for Knowledge Analysis, and is released under the GNU GPL license.


Deep Learning with Limited Numerical Precision

Training of large-scale deep neural networks is often constrained by the available computational resources. We study the effect of limited precision data representation and computation on neural network training. Within the context of low-precision fixed-point computations, we observe the rounding scheme to play a crucial role in determining the network’s behavior during training. Our results show that deep networks can be trained using only 16-bit wide fixed-point number representation when using stochastic rounding, and incur little to no degradation in the classification accuracy. We also demonstrate an energy-efficient hardware accelerator that implements low-precision fixed-point arithmetic with stochastic rounding.


Learning Deep Features for Scene Recognition using Places Database

[1] L. Fei-Fei, R. Fergus, and P. Perona. Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. Computer Vision and Image Understanding, 2007. [2] G. Griffin, A. Holub, and P. Perona. Caltech-256 object category dataset. 2007. [3] S. Lazebnik, C. Schmid, and J. Ponce. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In Proc. CVPR, 2006. [4] L.-J. Li and L. Fei-Fei. What, where and who? classifying events by scene and object recognition. In Proc. ICCV, 2007. [5] G. Patterson and J. Hays. Sun attribute database: Discovering, annotating, and recognizing scene attributes. In Proc. CVPR, 2012.


A 240 G-ops/s Mobile Coprocessor for Deep Neural Networks

Deep networks are state-of-the-art models used for understanding the content of images, videos, audio and raw input data. Current computing systems are not able to run deep network models in real-time with low power consumption. In this paper we present nn-X: a scalable, low-power coprocessor for enabling real-time execution of deep neural networks. nn-X is implemented on programmable logic devices and comprises an array of configurable processing elements called collections. These collections perform the most common operations in deep networks: convolution, subsampling and non-linear functions. The nn-X system includes 4 high-speed direct memory access interfaces to DDR3 memory and two ARM Cortex-A9 processors. Each port is capable of a sustained throughput of 950 MB/s in full duplex. nn-X is able to achieve a peak performance of 227 G-ops/s, a measured performance in deep learning applications of up to 200 G-ops/s while consuming less than 4 watts of power. This translates to a performance per power improvement of 10 to 100 times that of conventional mobile and desktop processors.


Optimizing FPGA-based Accelerator Design for Deep Convolutional Neural Networks

Convolutional neural network (CNN) has been widely employed for image recognition because it can achieve high accuracy by emulating behavior of optic nerves in living creatures. Recently, rapid growth of modern applications based on deep learning algorithms has further improved research and implementations. Especially, various accelerators for deep CNN have been proposed based on FPGA platform because it has advantages of high performance, reconfigurability, and fast development round, etc. Although current FPGA accelerators have demonstrated better performance over generic processors, the accelerator design space has not been well exploited. One critical problem is that the computation throughput may not well match the memory bandwidth provided an FPGA platform. Consequently, existing approaches cannot achieve best performance due to under-utilization of either logic resource or memory bandwidth. At the same time, the increasing complexity and scalability of deep learning applications aggravate this problem. In order to overcome this problem, we propose an analytical design scheme using the roofline model. For any solution of a CNN design, we quantitatively analyze its computing throughput and required memory bandwidth using various optimization techniques, such as loop tiling and transformation. Then, with the help of rooine model, we can identify the solution with best performance and lowest FPGA resource requirement. As a case study, we implement a CNN accelerator on a VC707 FPGA board and compare it to previous approaches. Our implementation achieves a peak performance of 61.62 GFLOPS under 100MHz working frequency, which outperform previous approaches significantly.


Topology Derivation of Nonisolated Three-Port DC–DC Converters From DIC and DOC

A systematic approach is proposed for the derivation of nonisolated three-port converter (TPC) topologies based on dual-input converters (DIC) and dual-output converters (DOC), which serves as an interface for a renewable source, a storage battery, and a load simultaneously. The power flow in a TPC is analyzed and compared with that in a DIC or a DOC, respectively. Beginning with building the power flow paths of a TPC from a DIC or a DOC, the general principles and detailed procedures for the generation and optimization of TPC topologies are presented. Based on these works, a family of nonisolated TPC topologies is developed. The derived TPCs feature single-stage power conversion between any two of the three ports, and result in high integration and high efficiency. One of the proposed TPCs, named Boost-TPC, is taken as an example for verifying the performance of its circuit topology with related operational methods. Pulsewidth modulation and power management methods, used in this circuit, are analyzed in detail. Experiments have been carried out on a 1-kW prototype of the Boost-TPC, which demonstrate the feasibility and effectiveness of the proposed topology derivation method.


A framework for cognitive Internet of Things based on blockchain

Internet of Things, cognitive systems, and blockchain technology are three fields which have created numerous revolutions in software development. It seems that a combination among these fields may results in emerging a high potential and interesting field. Therefore, in this paper, we propose a framework for Internet of Things based on cognitive systems and blockchain technology. To the best of our knowledge, there is no framework for Internet of Things based on cognitive systems and blockchain. In order to study the applicability of the proposed framework, a recommender system based on the proposed framework is suggested. Since the proposed framework is novel, the suggested recommender system is novel. The suggested recommender system is compared with the existing recommender systems. The results show that the suggested recommender system has several benefits which are not available in the existing recommender systems.


Management patterns: SDN-enabled network resilience management

Software-defined networking provides abstractions and a flexible architecture for the easy configuration of network devices, based on the decoupling of the data and control planes. This separation has the potential to considerably simplify the implementation of resilience functionality (e.g., traffic classification, anomaly detection, traffic shaping) in future networks. Although software-defined networking in general, and OpenFlow as its primary realisation, provide such abstractions, support is still needed for orchestrating a collection of OpenFlow-enabled services that must cooperate to implement network-wide resilience. In this paper, we describe a resilience management framework that can be readily applied to this problem. An important part of the framework are policy-controlled management patterns that describe how to orchestrate individual resilience services, implemented as OpenFlow applications.


Gated convolutional networks based hybrid acoustic models for low resource speech recognition

In acoustic modeling for large vocabulary speech recognition, recurrent neural networks (RNN) have shown great abilities to model temporal dependencies. However, the performance of RNN is not prominent in resource limited tasks, even worse than the traditional feedforward neural networks (FNN). Furthermore, training time for RNN is much more than that for FNN. In recent years, some novel models are provided. They use non-recurrent architectures to model long term dependencies. In these architectures, they show that using gate mechanism is an effective method to construct acoustic models. On the other hand, it has been proved that using convolution operation is a good method to learn acoustic features. We hope to take advantages of both these two methods. In this paper we present a gated convolutional approach to low resource speech recognition tasks. The gated convolutional networks use convolutional architectures to learn input features and a gate to control information. Experiments are conducted on the OpenKWS, a series of low resource keyword search evaluations. From the results, the gated convolutional networks relatively decrease the WER about 6% over the baseline LSTM models, 5% over the DNN models and 3% over the BLSTM models. In addition, the new models accelerate the learning speed by more than 1.8 and 3.2 times compared to that of the baseline LSTM and BLSTM models.


Deep Texture Features for Robust Face Spoofing Detection

Biometric systems are quite common in our everyday life. Despite the higher difficulty to circumvent them, nowadays criminals are developing techniques to accurately simulate physical, physiological, and behavioral traits of valid users, process known as spoofing attack. In this context, robust countermeasure methods must be developed and integrated with the traditional biometric applications in order to prevent such frauds. Despite face being a promising trait due to its convenience and acceptability, face recognition systems can be easily fooled with common printed photographs. Most of state-of-the-art antispoofing techniques for face recognition applications extract handcrafted texture features from images, mainly based on the efficient local binary patterns (LBP) descriptor, to characterize them. However, recent results indicate that high-level (deep) features are more robust for such complex tasks. In this brief, a novel approach for face spoofing detection that extracts deep texture features from images by integrating the LBP descriptor to a modified convolutional neural network is proposed. Experiments on the NUAA spoofing database indicate that such deep neural network (called LBPnet) and an extended version of it (n-LBPnet) outperform other state-of-the-art techniques, presenting great results in terms of attack detection.


Performance Evaluation of Concurrent Lock-free Data Structures on GPUs

Graphics processing units (GPUs) have emerged as a strong candidate for high-performance computing. While regular data-parallel computations with little or no synchronization are easy to map on the GPU architectures, it is a challenge to scale up computations on dynamically changing pointer-linked data structures. The traditional lock-based implementations are known to offer poor scalability due to high lock contention in the presence of thousands of active threads, which is common in GPU architectures. In this paper, we present a performance evaluation of concurrent lock-free implementations of four popular data structures on GPUs. We implement a set using lock-free linked list, hash table, skip list, and priority queue. On the first three data structures, we evaluate the performance of different mixes of addition, deletion, and search operations. The priority queue is designed to support retrieval and deletion of the minimum element and addition operations to the set. We evaluate the performance of these lock-free data structures on a Tesla C2070 Fermi GPU and compare it with the performance of multi-threaded lock-free implementations for CPU running on a 24-core Intel Xeon server. The linked list, hash table, skip list, and priority queue implementations achieve speedup of up to 7.4, 11.3, 30.7, and 30.8, respectively on the GPU compared to the Xeon server.


Images of Success and the Preference for Luxury

This research examines the impact of media depictions of success (or failure) on consumers’ desire for luxury brands. In a pilot study and three additional studies, we demonstrate that reading a story about a similar/successful other, such as a business major from the same university, increases consumers’ expectations about their own future wealth, which in turn increases their desire for luxury brands. However, reading about a dissimilar successful other, such as a biology major, lowers consumers’preferences for luxury brands. Furthermore, we examine the role of ease of imagining oneself in the narrative as a mediator of the relation between direction of comparison, similarity, and brand preference.


A new weight initialization method for sigmoidal feedforward artificial neural networks

Initial weight choice has been recognized to be an important aspect of the training methodology for sigmoidal feedforward neural networks. In this paper, a new mechanism for weight initialization is proposed. The mechanism distributes the initial input to output weights in a manner that all weights (including thresholds) leading into a hidden layer are uniformly distributed in a region and the center of the region from which the weights are sampled are such that no region overlaps for two distinct hidden nodes. The proposed method is compared against random weight initialization routines on five function approximation tasks using the Resilient Backpropagation (RPROP) algorithm for training. The proposed method is shown to lead to about twice as fast convergence to a pre-specifled goal for training as compared to any of the random weight initialization methods. Moreover, it is shown that at least for these problems the networks reach a deeper minima of the error functional during training and generalizes better than the networks trained whose weights were initialized by random weight initialization methods.


Combining qualitative and quantitative sampling, data collection, and analysis techniques in mixed-method studies.

Researchers have increasingly turned to mixed-method techniques to expand the scope and improve the analytic power of their studies. Yet there is still relatively little direction on and much confusion about how to combine qualitative and quantitative techniques. These techniques are neither paradigm- nor method-linked; researchers' orientations to inquiry and their methodological commitments will influence how they use them. Examples of sampling combinations include criterion sampling from instrument scores, random purposeful sampling, and stratified purposeful sampling. Examples of data collection combinations include the use of instruments for fuller qualitative description, for validation, as guides for purposeful sampling, and as elicitation devices in interviews. Examples of data analysis combinations include interpretively linking qualitative and quantitative data sets and the transformation processes of qualitizing and quantitizing.


Artistic reality: fast brush stroke stylization for augmented reality

The goal of augmented reality is to provide the user with a view of the surroundings enriched by virtual objects. Practically all augmented reality systems rely on standard real-time rendering methods for displaying graphical objects. Although such conventional computer graphics algorithms are fast, they often fail to produce sufficiently realistic renderings. Therefore, virtual models can easily be distinguished from the real environment. We have recently proposed a novel approach for generating augmented reality images [4]. Our method is based on the idea of applying stylization techniques for adapting the visual realism of both the camera image and the virtual graphical objects. Since both the camera image and the virtual objects are stylized in a corresponding way, they appear very similar. Here, we present a new method for the stylization of augmented reality images. This approach generates a painterly brush stroke rendering. The resulting stylized augmented reality video frames look similar to paintings created in the pointillism style. We describe the implementation of the camera image filter and the non-photorealistic rendererfor virtual objects. These components have been newly designed or adapted for this purpose. They are fast enough for generating augmented reality images in near real-time (more than 14 frames per second).


A Definition of Artificial Intelligence

In this paper we offer a formal definition of Artificial Intelligence and this directly gives us an algorithm for construction of this object. Really, this algorithm is useless due to the combinatory explosion. The main innovation in our definition is that it does not include the knowledge as a part of the intelligence. So according to our definition a newly born baby also is an Intellect. Here we differs with Turing's definition which suggests that an Intellect is a person with knowledge gained through the years.


Anisotropic diffusion map based spectral embedding for 3D CAD model retrieval

In the product life cycle, design reuse can save cost and improve existing products conveniently in most new product development. To retrieve similar models from big database, most search algorithms convert CAD model into a shape descriptor and compute the similarity two models according to a descriptor metric. This paper proposes a new 3D shape matching approach by matching the coordinates directly. It is based on diffusion maps which integrate the rand walk and graph spectral analysis to extract shape features embedded in low dimensional spaces and then they are used to form coordinations for non-linear alignment of different models. These coordinates could capture multi-scale properties of the 3D geometric features and has shown good robustness to noise. The results also have shown better performance compared to the celebrated Eigenmap approach in the 3D model retrieval.


Know Your Body Through Intrinsic Goals

The first "object" that newborn children play with is their own body. This activity allows them to autonomously form a sensorimotor map of their own body and a repertoire of actions supporting future cognitive and motor development. Here we propose the theoretical hypothesis, operationalized as a computational model, that this acquisition of body knowledge is not guided by random motor-babbling, but rather by autonomously generated goals formed on the basis of intrinsic motivations. Motor exploration leads the agent to discover and form representations of the possible sensory events it can cause with its own actions. When the agent realizes the possibility of improving the competence to re-activate those representations, it is intrinsically motivated to select and pursue them as goals. The model is based on four components: (1) a self-organizing neural network, modulated by competence-based intrinsic motivations, that acquires abstract representations of experienced sensory (touch) changes; (2) a selector that selects the goal to pursue, and the motor resources to train to pursue it, on the basis of competence improvement; (3) an echo-state neural network that controls and learns, through goal-accomplishment and competence, the agent's motor skills; (4) a predictor of the accomplishment of the selected goals generating the competence-based intrinsic motivation signals. The model is tested as the controller of a simulated simple planar robot composed of a torso and two kinematic 3-DoF 2D arms. The robot explores its body covered by touch sensors by moving its arms. The results, which might be used to guide future empirical experiments, show how the system converges to goals and motor skills allowing it to touch the different parts of own body and how the morphology of the body affects the formed goals. The convergence is strongly dependent on competence-based intrinsic motivations affecting not only skill learning and the selection of formed goals, but also the formation of the goal representations themselves.


Photo tourism: exploring photo collections in 3D

We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model of the scene and image to model correspondences. Our photo explorer uses image-based rendering techniques to smoothly transition between photographs, while also enabling full 3D navigation and exploration of the set of images and world geometry, along with auxiliary information such as overhead maps. Our system also makes it easy to construct photo tours of scenic or historic locations, and to annotate image details, which are automatically transferred to other relevant images. We demonstrate our system on several large personal photo collections as well as images gathered from Internet photo sharing sites.


Design for wearability

Digital Technology is constantly improving as information becomes wireless. These advances demand more wearable and mobile form factors for products that access information. A product that is wearable should have wearability. This paper explores the concept of dynamic wearability, through design research. Wearability is defined as the interaction between the human body and the wearable object. Dynamic wearability extends that definition to include the human body in motion. Our research has been to locate, understand, and define the spaces on the human body where solid and flexible forms can rest-without interfering with fluid human movement. The result is a set of design guidelines embodied in a set of wearable forms. These wearable forms describe the three dimensional spaces on the body best suited for comfortable and unobtrusive wearability by design.


A New Approach to Quantify Network Security by Ranking of Security Metrics and Considering Their Relationships

There are several characteristics in computer networks, which play important roles in determining the level of network security. These characteristics known as security metrics can be applied for security quantification in computer networks. Most of the researches on this area has focused on defining the new security metrics to improve the quantification process. In this paper, we present a new approach to analyze and quantify the network security by ranking of security metrics with considering the relationships between them. Our ranking method reveals the importance of each security metric to quantify security in the network under surveillance. The proposed approach helps the network administrators to have a better insight on the level of network security


Is FLIP enough? Or should we use the FLIPPED model instead?

Yunglung Chen, Yuping Wang, Kinshuk, Nian-Shing Chen Department of Information Management, National Sun Yat-sen University, No. 70, Lienhai Rd., Kaohsiung 80424, Taiwan School of Languages and Linguistics, Griffith University, Nathan, 4111, Australia School of Computing and Information System, Athabasca University, Athabasca, Canada henryylchen@gmail.com, y.wang@griffith.edu.au, kinshuk@athabascau.ca, nschen@mis.nsysu.edu.tw


Step-by-step design and control of LCL filter based three phase grid-connected inverter

This paper proposes a detailed step-by-step design procedure and control of an LCL filter for grid connected three phase sine PWM voltage source inverter. The goal of the design is to ensure high quality of grid current as well as to minimize the size of filter magnetics. In order to ensure unity power factor injection into grid a current controller is designed with a constraint that only the inverter side inductor current is sensed. Good agreement between simulation and experimental results verify the effectiveness of the designed controller and the LCL filter.


Power Quality Control and Design of Power Converter for Variable-Speed Wind Energy Conversion System with Permanent-Magnet Synchronous Generator

The control strategy and design of an AC/DC/AC IGBT-PMW power converter for PMSG-based variable-speed wind energy conversion systems (VSWECS) operation in grid/load-connected mode are presented. VSWECS consists of a PMSG connected to a AC-DC IGBT-based PWM rectifier and a DC/AC IGBT-based PWM inverter with LCL filter. In VSWECS, AC/DC/AC power converter is employed to convert the variable frequency variable speed generator output to the fixed frequency fixed voltage grid. The DC/AC power conversion has been managed out using adaptive neurofuzzy controlled inverter located at the output of controlled AC/DC IGBT-based PWM rectifier. In this study, the dynamic performance and power quality of the proposed power converter connected to the grid/load by output LCL filter is focused on. Dynamic modeling and control of the VSWECS with the proposed power converter is performed by using MATLAB/Simulink. Simulation results show that the output voltage, power, and frequency of VSWECS reach to desirable operation values in a very short time. In addition, when PMSG based VSWECS works continuously with the 4.5 kHz switching frequency, the THD rate of voltage in the load terminal is 0.00672%.


Finding expert users in community question answering

Community Question Answering (CQA) websites provide a rapidly growing source of information in many areas. This rapid growth, while offering new opportunities, puts forward new challenges. In most CQA implementations there is little effort in directing new questions to the right group of experts. This means that experts are not provided with questions matching their expertise, and therefore new matching questions may be missed and not receive a proper answer. We focus on finding experts for a newly posted question. We investigate the suitability of two statistical topic models for solving this issue and compare these methods against more traditional Information Retrieval approaches. We show that for a dataset constructed from the Stackoverflow website, these topic models outperform other methods in retrieving a candidate set of best experts for a question. We also show that the Segmented Topic Model gives consistently better performance compared to the Latent Dirichlet Allocation Model.


Impact of rank optimization on downlink non-orthogonal multiple access (NOMA) with SU-MIMO

Non-orthogonal multiple access (NOMA) is a promising radio access technique for further cellular enhancements toward the 5th generation (5G) mobile communication systems. Single-user multiple-input multiple-output (SU-MIMO) is one of the key technologies in long term evolution (LTE) /LTE-Advanced systems. It is proved that NOMA combined with SU-MIMO techniques can achieve further system performance improvement. In this paper, we focus on the impact of rank optimization on the performance of NOMA with SU-MIMO in downlink. Firstly, a geometry based rank adjustment method is studied. Secondly, an enhanced feedback method for rank adjustment is discussed. The simulation results show that the performance gain of NOMA improves with the proposed two rank adjustment methods. Compared to orthogonal access system, large performance gains can be achieved for NOMA, which are about 23% for cell average throughput and 33% for cell-edge user throughput.


On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality

The classification problem is considered in which an outputvariable y assumes discrete values with respectiveprobabilities that depend upon the simultaneous values of a set of input variablesx = {x_1,....,x_n}. At issue is how error in the estimates of theseprobabilities affects classification error when the estimates are used ina classification rule. These effects are seen to be somewhat counterintuitive in both their strength and nature. In particular the bias andvariance components of the estimation error combine to influenceclassification in a very different way than with squared error on theprobabilities themselves. Certain types of (very high) bias can becanceled by low variance to produce accurate classification. This candramatically mitigate the effect of the bias associated with some simpleestimators like “naive” Bayes, and the bias induced by thecurse-of-dimensionality on nearest-neighbor procedures. This helps explainwhy such simple methods are often competitive with and sometimes superiorto more sophisticated ones for classification, and why“bagging/aggregating” classifiers can often improveaccuracy. These results also suggest simple modifications to theseprocedures that can (sometimes dramatically) further improve theirclassification performance.


Semantic Segmentation for High Spatial Resolution Remote Sensing Images Based on Convolution Neural Network and Pyramid Pooling Module

Semantic segmentation provides a practical way to segment remotely sensed images into multiple ground objects simultaneously, which can be potentially applied to multiple remote sensed related aspects. Current classification algorithms in remotely sensed images are mostly limited by different imaging conditions, the multiple ground objects are difficult to be separated from each other due to high intraclass spectral variances and interclass spectral similarities. In this study, we propose an end-to-end framework to semantically segment high-resolution aerial images without postprocessing to refine the segmentation results. The framework provides a pixel-wise segmentation result, comprising convolutional neural network structure and pyramid pooling module, which aims to extract feature maps at multiple scales. The proposed model is applied to the ISPRS Vaihingen benchmark dataset from the ISPRS 2D Semantic Labeling Challenge. Its segmentation results are compared with previous state-of-the-art method UZ_1, UPB and three other methods that segment images into objects of all the classes (including clutter/background) based on true orthophoto tiles, and achieve the highest overall accuracy of 87.8% over the published performances, to the best of our knowledge. The results validate the efficiency of the proposed model in segmenting multiple ground objects from remotely sensed images simultaneously.


A Multichannel Approach to Fingerprint Classification

Fingerprint classification provides an important indexing mechanism in a fingerprint database. An accurate and consistent classification can greatly reduce fingerprint matching time for a large database. We present a fingerprint classification algorithm which is able to achieve an accuracy better than previously reported in the literature. We classify fingerprints into five categories: whorl, right loop, left loop, arch, and tented arch. The algorithm uses a novel representation (FingerCode) and is based on a two-stage classifier to make a classification. It has been tested on 4,000 images in the NIST-4 database. For the five-class problem, a classification accuracy of 90 percent is achieved (with a 1.8 percent rejection during the feature extraction phase). For the four-class problem (arch and tented arch combined into one class), we are able to achieve a classification accuracy of 94.8 percent (with 1.8 percent rejection). By incorporating a reject option at the classifier, the classification accuracy can be increased to 96 percent for the five-class classification task, and to 97.8 percent for the four-class classification task after a total of 32.5 percent of the images are rejected.


Receptive fields, binocular interaction and functional architecture in the cat's visual cortex.

What chiefly distinguishes cerebral cortex from other parts of the central nervous system is the great diversity of its cell types and inter-connexions. It would be astonishing if such a structure did not profoundly modify the response patterns of fibres coming into it. In the cat's visual cortex, the receptive field arrangements of single cells suggest that there is indeed a degree of complexity far exceeding anything yet seen at lower levels in the visual system. In a previous paper we described receptive fields of single cortical cells, observing responses to spots of light shone on one or both retinas (Hubel & Wiesel, 1959). In the present work this method is used to examine receptive fields of a more complex type (Part I) and to make additional observations on binocular interaction (Part II). This approach is necessary in order to understand the behaviour of individual cells, but it fails to deal with the problem of the relationship of one cell to its neighbours. In the past, the technique of recording evoked slow waves has been used with great success in studies of functional anatomy. It was employed by Talbot & Marshall (1941) and by Thompson, Woolsey & Talbot (1950) for mapping out the visual cortex in the rabbit, cat, and monkey. Daniel & Whitteiidge (1959) have recently extended this work in the primate. Most of our present knowledge of retinotopic projections, binocular overlap, and the second visual area is based on these investigations. Yet the method of evoked potentials is valuable mainly for detecting behaviour common to large populations of neighbouring cells; it cannot differentiate functionally between areas of cortex smaller than about 1 mm2. To overcome this difficulty a method has in recent years been developed for studying cells separately or in small groups during long micro-electrode penetrations through nervous tissue. Responses are correlated with cell location by reconstructing the electrode tracks from histological material. These techniques have been applied to CAT VISUAL CORTEX 107 the somatic sensory cortex of the cat and monkey in a remarkable series of studies by Mountcastle (1957) and Powell & Mountcastle (1959). Their results show that the approach is a powerful one, capable of revealing systems of organization not hinted at by the known morphology. In Part III of the present paper we use this method in studying the functional architecture of the visual cortex. It helped us attempt to explain on anatomical …


Fingerprint classification

A fingerprint classification algorithm is presented in this paper. Fingerprints are classified into five categories: arch, tented arch, left loop, right loop and whorl. The algorithm extracts singular points (cores and deltas) in a fingerprint image and performs classification based on the number and locations of the detected singular points. The classifier is invariant to rotation, translation and small amounts of scale changes. The classifier is rule-based, where the rules are generated independent of a given data set. The classifier was tested on 4000 images in the NIST-4 database and on 5400 images in the NIST-9 database. For he NIST-4 database, classification accuracies of 85.4% for the five-class problem and 91.1% for the four-class problem (with arch and tented arch placed in the same category) were achieved. Using a reject option, the four-class classification error can be reduced to less than 6% with 10% fingerprint images rejected. Similar classification performance was obtained on the NIST-9 database.


Pattern classification and scene analysis


Adaptive flow orientation-based feature extraction in fingerprint images

-A reliable method for extracting structural features from fingerprint images is presented. Viewing fingerprint images as a textured image, an orientation flow field is computed. The rest of the stages in the algorithm use the flow field to design adaptive filters for the input image. To accurately locate ridges, a waveform projection-based ridge segmentation algorithm is used. The ridge skeleton image is obtained and smoothed using morphological operators to detect the features. A large number of spurious features from the detected set of minutiae is deleted by a postprocessing stage. The performance of the proposed algorithm has been evaluated by computing a "goodness index" (GI) which compares the results of automatic extraction with manually extracted ground truth. The significance of the observed GI values is determined by comparing the index for a set of fingerprints against the GI values obtained under a baseline distribution. The detected features are observed to be reliable and accurate. Fingerprints Feature extraction Texture Flow orientation Minutiae Segmentation Skeleton


Automated Static Code Analysis for Classifying Android Applications Using Machine Learning

In this paper we apply Machine Learning (ML) techniques on static features that are extracted from Android's application files for the classification of the files. Features are extracted from Android’s Java byte-code (i.e.,.dex files) and other file types such as XML-files. Our evaluation focused on classifying two types of Android applications: tools and games. Successful differentiation between games and tools is expected to provide positive indication about the ability of such methods to learn and model Android benign applications and potentially detect malware files. The results of an evaluation, performed using a test collection comprising 2,285 Android. apk files, indicate that features, extracted statically from. apk files, coupled with ML classification algorithms can provide good indication about the nature of an Android application without running the application, and may assist in detecting malicious applications. This method can be used for rapid examination of Android. apks and informing of suspicious applications.


Automated Text Summarization and the SUMMARIST System

This paper consists of three parts: a preliminary typology of summaries in general; a description of the current and planned modules and performance of the SUMMARIST automated multilingual text summarization system being built sat ISI, and a discussion of three methods to evaluate summaries. 1. T H E N A T U R E O F S U M M A R I E S Early experimentation in the late 1950's and early 60's suggested that text summarization by computer was feasible though not s traightforward (Luhn, 59; Edmundson, 68). The methods developed then were fairly unsophisticated, relying primarily on surface level phenomena such as sentence position and word frequency counts, and focused on producing extracts (passages selected from the text, reproduced verbatim) rather than abstracts (interpreted portions of the text, newly generated). After a hiatus of some decades, the growing presence of large amounts of online text--in corpora and especially on the Web--renewed the interest in automated text summarization. During these intervening decades, progress in Natural Language Processing (NLP), coupled with great increases of computer memory and speed, made possible more sophisticated techniques, with very encouraging results. In the late 1990's, some relatively small research investments in the US (not more than 10 projects, including commercial efforts at Microsoft, Lexis-Nexis, Oracle, SRA, and TextWise, and university efforts at CMU, NMSU, UPenn, and USC/ISI) over three or four years have produced several systems that exhibit potential marketability, as well as several innovations that promise continued improvement. In addition, several recent workshops, a book collection, and several tutorials testify that automated text summarization has become a hot area. However, when one takes a moment to study the various systems and to consider what has really been achieved, one cannot help being struck by their underlying similarity, by the narrowness of their focus, and by the large numbers of unknown factors that surround the problem. For example, what precisely is a summary? No-one seems to know exactly. In our work, we use summary as the generic term and define it as follows: A summary is a text that is produced out of one or more (possibly multimedia) texts, that contains (some of) the same information of the original text(s), and that is no longer than half of the original text(s). To clarify the picture a little, we follow and extend (Sp~irck Jones, 97) by identifying the following aspects of variation. Any summary can be characterized by (at least) three major classes of characteristics: Invut: characteristics of the source text(s) Source size: single-document v s . multi-document: A single-document summary derives from a single input text (though the summarization process itself may employ information compiled earlier from other texts). A multi-document summary is one text that covers the content of more than one input text, and is usually used only when the input texts are thematically related. Specificity: domain-specific vs. general: When the input texts all pertain to a single domain, it may be appropr ia te to apply domain spec i f i c summarization techniques, focus on specific content, and output specific formats, compared to the general case. A domain-specific summary derives from input text(s) whose theme(s) pertain to a single restricted domain. As such, it can assume less term ambiguity, idiosyncratic word and grammar usage, specialized formatting, etc., and can reflect them in the summary.


Asymmetrical duty cycle control with phase limit of LLC resonant inverter for an induction furnace

This paper proposes a power control of LLC resonant inverter for an induction furnace using asymmetrical duty cycle control (ADC) with phase limit to guarantee zero voltage switching (ZVS) operation and protect switching devices from spike current during the operation. The output power can be simply controlled through duty cycle of gate signals of a full-bridge inverter. With the phase limit control, non-ZVS operation and spike current caused by a change of duty cycle with fixed frequency and load Curie's temperature can be eliminated. Theoretical and simulation analyses of the proposed method have been investigated. The experimental results of heating a 300 g of Tin from room temperature until it is melted at 232 °C provided.


Defect Detection in Patterned Fabrics Using Modified Local Binary Patterns

Local binary patterns LBP, is one of the features which has been used for texture classification. In this paper, a method based on using these features is proposed for detecting defects in patterned fabrics. In the training stage, at first step LBP operator is applied to all rows (columns) of a defect free fabric sample, pixel by pixel, and the reference feature vector is computed. Then this image is divided into windows and LBP operator is applied to each row (column) of these windows. Based on comparison with the reference feature vector a suitable threshold for defect free windows is found. In the detection stage, a test image is divided into windows and using the threshold, defective windows can be detected. The proposed method is simple and gray scale invariant. Because of its simplicity, online implementation is possible as well.


Less is More: Nyström Computational Regularization

We study Nyström type subsampling approaches to large scale kernel methods, and prove learning bounds in the statistical learning setting, where random sampling and high probability estimates are considered. In particular, we prove that these approaches can achieve optimal learning bounds, provided the subsampling level is suitably chosen. These results suggest a simple incremental variant of Nyström Kernel Regularized Least Squares, where the subsampling level implements a form of computational regularization, in the sense that it controls at the same time regularization and computations. Extensive experimental analysis shows that the considered approach achieves state of the art performances on benchmark large scale datasets.


Power consumption estimation in CMOS VLSI chips

Power consumption from logic circuits, interconnections, dock distribution, on chip memories, and off chip driving in CMOS VLSI is estimated. Estimation methods are demonstrated and verified. An estimate tool is created. Power consumption distribution between ~ I I ~ I T O M ~ C ~ ~ O I W , clock distribution, logic gates, memories, and off chip driving are analyzed by examples. Comparisons are done between cell library, gate array, and full custom design. Also comparisons between static and dynamic logic are given. Results show that the power consumption of all interconnections and off chip driving can be up to 20% and 65% of the total power consumption respectively. Compared to cell library design, gate array designed chips consume about 10% more power, and power reduction in full custom designed chips could be 15%.


A dynamic instruction set computer

One of the key contributions of this paper is the idea of treating the two-dimensional FPGA area as a one-dimensional array of custom instructions, which the paper refers to as linear hardware space. Each custom instruction occupies the full width of the array but can occupy different heights to allow for instructions of varying complexity. Instructions also have a common interface that includes pass-thrus which connect to the previous and next instructions in the array. This communication interface greatly simplifies the problem of relocating a custom instruction to a free area, allowing other instructions to potentially remain in-place. The communication paths for an instruction are always at the same relative positions, and run-time CAD operations (and their corresponding overheads) are completely avoided. Thus, the linear hardware space reduces the overheads and simplifies the process of run-time reconfiguration of custom processor instructions.


Mechanical Design and Modeling of an Omni-directional RoboCup Player

Abstract. This paper covers the mechanical design process of an omni-directional mobile robot developed for the Ohio University RoboCup team player. It covers each design iteration, detailing what we learned from each phase. In addition, the kinematics of the final design is derived, and its inverse Jacobian matrix for the design is presented. The dynamic equations of motion for the final design is derived in a symbolic form, assuming that no slip occurs on the wheel in the spin direction. Finally, a simulation example demonstrates simple independent PID wheel control for the complex coupled nonlinear dynamic system.


Analysis on botnet detection techniques

Botnet detection plays an important role in network security. Botnet are collection of compromised computers called the bot. For detecting the presence of bots in a network, there are many detection techniques available. Network based detection method is the one of the efficient method in detecting bots. Paper reviews four different botnet detection techniques and a comparison of all these techniques are done.