Query: Improving robot manipulation through fingertip perception

Relevant passages:
LIBSVM: a library for support vector machines <=SEP=> 

A tactile sensor for the fingertips of the humanoid robot iCub <=SEP=> In order to successfully perform object manipulation, humanoid robots must be equipped with tactile sensors. However, the limited space that is available in robotic fingers imposes severe design constraints. In [1] we presented a small prototype fingertip which incorporates a capacitive pressure system. This paper shows an improved version, which has been integrated on the hand of the humanoid robot iCub. The fingertip is 14.5 mm long and 13 mm wide. The capacitive pressure sensor system has 12 sensitive zones and includes the electronics to send the 12 measurements over a serial bus with only 4 wires. Each synthetic fingertip is shaped approximately like a human fingertip. Furthermore, an integral part of the capacitive sensor is soft silicone foam, and therefore the fingertip is compliant. We describe the structure of the fingertip, their integration on the humanoid robot iCub and present test results to show the characteristics of the sensor.

Tactile sensing for mechatronics * a state of the art survey <=SEP=> In this paper we examine the state of the art in tactile sensing for mechatronics[ We de_ne a tactile sensor as a device or system that can measure a given property of an object or contact event through physical contact between the sensor and the object[ We consider any property that can be measured through contact\ including the shape of an object\ texture\ temperature\ hardness\ moisture content\ etc[ A comprehensive search of the literature revealed that there was a signi_cant increase in publications on tactile sensing from 0880 onwards[ Considerable e}ort in the 0879s was spent investigating transduction techniques and developing new sensors\ whilst emphasis in more recent research has focused on experiments using tactile sensors to perform a variety of tasks[ This paper reports on progress in tactile sensing in the following areas] cutaneous sensors\ sensing _ngers\ soft materials\ industrial robot grippers\ multi_ngered hands\ probes and whiskers\ analysis of sensing devices\ haptic perception\ processing sensory data and new application areas[ We conclude that the predominant choice of transduction method is piezoelectric\ with arrays using resistive or capacitive sensing[ We found that increased emphasis on understanding tactile sensing and perception issues has opened up potential for new application areas[ The predicted growth in applications in industrial automation has not eventuated[ New applications for tactile sensing including surgery\ rehabilitation and service robotics\ and food processing automation show considerable potential and are now receiving signi_cant levels of research attention[ Þ 0887 Elsevier Science Ltd[ All rights reserved[

The iCub humanoid robot: an open platform for research in embodied cognition <=SEP=> We report about the iCub, a humanoid robot for research in embodied cognition. At 104 cm tall, the iCub has the size of a three and half year old child. It will be able to crawl on all fours and sit up to manipulate objects. Its hands have been designed to support sophisticate manipulation skills. The iCub is distributed as Open Source following the GPL/FDL licenses. The entire design is available for download from the project homepage and repository (http://www.robotcub.org). In the following, we will concentrate on the description of the hardware and software systems. The scientific objectives of the project and its philosophical underpinning are described extensively elsewhere [1].

HAWK : Halting Anomaly with Weighted ChoKing to Rescue Well-Behaved TCP Sessions from Shrew DoS Attacks <=SEP=> 1 Manuscript submitted to ICDCS 2005 on October 8, 2004. All rights reserved by the authors. This research was supported by an NSF ITR Research Grant under contract number ACI-0325409. Corresponding Author: Kai Hwang, Email: kaihwang@usc.edu, Tel: 213-740-4470, Fax: 213-740-4418. Abstract—High availability in network services is crucial for effective large-scale distributed computing. While denial-ofservice (DoS) attacks through massive packet flooding have baffled researchers for years, a new type of even more detrimental attack—shrew attacks (periodic intensive packet bursts with low average rate)—has recently been identified. Shrew attacks can significantly degrade well-behaved TCP sessions and are very difficult to detect, not to mention defend against, due to its low average rate. We propose a new stateful adaptive queue management technique called HAWK (Halting Anomaly with Weighted choKing) which works by judiciously identifying malicious shrew packet flows using a small flow table and dropping such packets decisively to halt the attack such that well-behaved TCP sessions can re-gain their bandwidth shares. Our NS-2 based extensive performance results indicate that HAWK is highly agile in the sense that it can swiftly (e.g., within 5 seconds) identify and then halt shrew attacks with a flow table of tiny size (e.g., 600 bytes). Thus, HAWK is readily amenable to practical implementation in a real environment.

Centralities in Large Networks: Algorithms and Observations <=SEP=> Node centrality measures are important in a large number of graph applications, from search and ranking to social and biological network analysis. In this paper we study node centrality for very large graphs, up to billions of nodes and edges. Various definitions for centrality have been proposed, ranging from very simple (e.g., node degree) to more elaborate. However, measuring centrality in billion-scale graphs poses several challenges. Many of the “traditional” definitions such as closeness and betweenness were not designed with scalability in mind. Therefore, it is very difficult, if not impossible, to compute them both accurately and efficiently. In this paper, we propose centrality measures suitable for very large graphs, as well as scalable methods to effectively compute them. More specifically, we propose effective closeness and LINERANK which are designed for billion-scale graphs. We also develop algorithms to compute the proposed centrality measures in MAPREDUCE, a modern paradigm for large-scale, distributed data processing. We present extensive experimental results on both synthetic and real datasets, which demonstrate the scalability of our approach to very large graphs, as well as interesting findings and anomalies.

Phonetic posteriorgrams for many-to-one voice conversion without parallel data training <=SEP=> This paper proposes a novel approach to voice conversion with non-parallel training data. The idea is to bridge between speakers by means of Phonetic PosteriorGrams (PPGs) obtained from a speaker-independent automatic speech recognition (SI-ASR) system. It is assumed that these PPGs can represent articulation of speech sounds in a speaker-normalized space and correspond to spoken content speaker-independently. The proposed approach first obtains PPGs of target speech. Then, a Deep Bidirectional Long Short-Term Memory based Recurrent Neural Network (DBLSTM) structure is used to model the relationships between the PPGs and acoustic features of the target speech. To convert arbitrary source speech, we obtain its PPGs from the same SI-ASR and feed them into the trained DBLSTM for generating converted speech. Our approach has two main advantages: 1) no parallel training data is required; 2) a trained model can be applied to any other source speaker for a fixed target speaker (i.e., many-to-one conversion). Experiments show that our approach performs equally well or better than state-of-the-art systems in both speech quality and speaker similarity.

Telos: Representing Knowledge About Information Systems <=SEP=> We describe Telos, a language intended to support the development of information systems. The design principles for the language are based on the premise that information system development is knowledge intensive and that the primary responsibility of any language intended for the task is to be able to formally represent the relevent knowledge. Accordingly, the proposed language is founded on concepts from knowledge representations. Indeed, the language is appropriate for representing knowledge about a variety of worlds related to a particular information system, such as the subject world (application domain), the usage world (user models, environments), the system world (software requirements, design), and the development world (teams, metodologies).
We introduce the features of the language through examples, focusing on those provided for desribing metaconcepts that can then be used to describe knowledge relevant to a particular information system. Telos' fetures include an object-centered framework which supports aggregation, generalization, and classification; a novel treatment of attributes; an explicit representation of time; and facilities for specifying integrity constraints and deductive rules. We review actual applications of the language through further examples, and we sketch a formalization of the language.

Fighting Accounting Fraud Through Forensic Data Analytics <=SEP=> Accounting fraud is a global concern representing a significant threat to the financial system stability due to the resulting diminishing of the market confidence and trust of regulatory authorities. Several tricks can be used to commit accounting fraud, hence the need for non-static regulatory interventions that take into account different fraudulent patterns. Accordingly, this study aims to improve the detection of accounting fraud via the implementation of several machine learning methods to better differentiate between fraud and non-fraud companies, and to further assist the task of examination within the riskier firms by evaluating relevant financial indicators. Out-of-sample results suggest there is a great potential in detecting falsified financial statements through statistical modelling and analysis of publicly available accounting information. The proposed methodology can be of assistance to public auditors and regulatory agencies as it facilitates auditing processes, and supports more targeted and effective examinations of accounting reports.

Mindfulness and emotion regulation in depression and anxiety: common and distinct mechanisms of action. <=SEP=> BACKGROUND
The current study seeks to investigate the mechanisms through which mindfulness is related to mental health in a clinical sample of adults by examining (1) whether specific cognitive emotion regulation strategies (rumination, reappraisal, worry, and nonacceptance) mediate associations between mindfulness and depression and anxiety, respectively, and (2) whether these emotion regulation strategies operate uniquely or transdiagnostically in relation to depression and anxiety.


METHODS
Participants were 187 adults seeking treatment at a mood and anxiety disorders clinic in Connecticut. Participants completed a battery of self-report measures that included assessments of depression and anxiety (Mood and Anxiety Symptom Questionnaire), and emotion regulation (Ruminative Response Scale, Penn State Worry Questionnaire, Emotion Regulation Questionnaire, Difficulties in Emotion Regulation Scale).


RESULTS
Simple mediation analyses indicated that rumination and worry significantly mediated associations between mindfulness and anxiety symptoms, whereas rumination and reappraisal significantly mediated associations between mindfulness and depressive symptoms. Multiple mediation analyses showed that worry significantly mediated associations between mindfulness and anxiety symptoms and rumination and reappraisal significantly mediated associations between mindfulness and depressive symptoms.


CONCLUSIONS
Findings suggest that mindfulness operates through distinct and common mechanisms depending on clinical context.

The principles and practice of probabilistic programming <=SEP=> Probabilities describe degrees of belief, and probabilistic inference describes rational reasoning under uncertainty. It is no wonder, then, that probabilistic models have exploded onto the scene of modern artificial intelligence, cognitive science, and applied statistics: these are all sciences of inference under uncertainty. But as probabilistic models have become more sophisticated, the tools to formally describe them and to perform probabilistic inference have wrestled with new complexity. Just as programming beyond the simplest algorithms requires tools for abstraction and composition, complex probabilistic modeling requires new progress in model representation—probabilistic programming languages. These languages provide compositional means for describing complex probability distributions; implementations of these languages provide generic inference engines: tools for performing efficient probabilistic inference over an arbitrary program. In their simplest form, probabilistic programming languages extend a well-specified deterministic programming language with primitive constructs for random choice. This is a relatively old idea, with foundational work by Giry, Kozen, Jones, Moggi, SahebDjahromi, Plotkin, and others [see e.g. 7]. Yet it has seen a resurgence thanks to new tools for probabilistic inference and new complexity of probabilistic modeling applications. There are a number of recent probabilistic programming languages [e.g. 8, 9, 11–17], embodying different tradeoffs in expressivity, efficiency, and perspicuity. We will focus on the probabilistic programming language Church [6] for simplicity, but the design of probabilistic languages to best support complex model representation and efficient inference is an active and important topic. Church extends (the purely functional subset of) Scheme with elementary random primitives, such as flip (a bernoulli), multinomial, and gaussian. In addition, Church includes language constructs that simplify modeling. For instance, mem, a higher-order procedure that memoizes its input function, is useful for describing persistent random properties and lazy model construction. (Interestingly, memoization has a semantic effect in probabilistic languages.) If we view the semantics of the underlying deterministic language as a map from programs to executions of the program, the semantics of the probabilistic language will be a map from programs to distributions over executions. When the program halts

Integrating technology in the classroom: a visual conceptualization of teachers' knowledge, goals and beliefs <=SEP=> In this paper, we devise a diagrammatic conceptualization to describe and represent the complex interplay of a teacher’s knowledge (K), goals (G) and beliefs (B) in leveraging technology effectively in the classroom. The degree of coherency between the KGB region and the affordances of the technology serves as an indicator of the teachers’ developmental progression through the initiation, implementation and maturation phases of using technology in the classroom. In our study, two teachers with differing knowledge, goals and beliefs are studied as they integrated GroupScribbles technology in their classroom lessons over a period of 1 year. Our findings reveal that the transition between the teacher’s developmental states (as indicated by coherency diagrams) is nonlinear, and thus the importance of ensuring high coherency right at the initiation stage. Support for the teacher from other teachers and researchers remains an important factor in developing the teacher’s competency to leverage the technology successfully. The stability of the KGB region further ensures smooth progression of the teacher’s effective integration of technology in the classroom.

Shilling attacks against recommender systems: a comprehensive survey <=SEP=> Online vendors employ collaborative filtering algorithms to provide recommendations to their customers so that they can increase their sales and profits. Although recommendation schemes are successful in e-commerce sites, they are vulnerable to shilling or profile injection attacks. On one hand, online shopping sites utilize collaborative filtering schemes to enhance their competitive edge over other companies. On the other hand, malicious users and/or competing vendors might decide to insert fake profiles into the user-item matrices in such a way so that they can affect the predicted ratings on behalf of their advantages. In the past decade, various studies have been conducted to scrutinize different shilling attacks strategies, profile injection attack types, shilling attack detection schemes, robust algorithms proposed to overcome such attacks, and evaluate them with respect to accuracy, cost/benefit, and overall performance. Due to their popularity and importance, we survey about shilling attacks in collaborative filtering algorithms. Giving an overall picture about various shilling attack types by introducing new classification attributes is imperative for further research. Explaining shilling attack detection schemes in detail and robust algorithms proposed so far might open a lead to develop new detection schemes and enhance such robust algorithms further, even propose new ones. Thus, we describe various attack types and introduce new dimensions for attack classification. Detailed description of the proposed detection and robust recommendation algorithms are given. Moreover, we briefly explain evaluation of the proposed schemes. We conclude the paper by discussing various open questions.

Modeling people flow: simulation analysis of international-departure passenger flows in an airport terminal <=SEP=> An entire airport terminal building is simulated to examine passenger flows, especially international departures. First, times needed for passengers to be processed in the terminal building are examined. It is found that the waiting time for check-in accounts for more than 80 percent of the total waiting time of passengers spent in the airport. A special-purpose data-generator is designed and developed to create experimental data for executing a simulation. It is found that the possible number of passengers missing their flights could be drastically reduced by adding supporting staff to and by making use of first-and business-class check-in counters for processing economy-and group-class passengers.

Enhancement of MRI human thigh muscle segmentation by template-based framework <=SEP=> Image segmentation of anatomic structures is often an essential step in medical image analysis. A variety of segmentation methods have been proposed, but none provides automatic segmentation of the thigh. In magnetic resonance images of the thigh, the segmentation is complicated by factors, such as artifacts (e.g. intensity inhomogeneity and echo) and inconsistency of soft and hard tissue compositions, especially in muscle from older people, where accumulation of intermuscular fat is greater than in young muscles. In this paper, the combination framework that leads to a segmentation enhancement method for region of interest segmentation are demonstrated. Appropriate methods of image pre-processing, thresholding, manual interaction of muscle border, template conversion and deformable contours in combination with image filters are applied. Prior geometrical information in an initial template image is used to automatically derive the muscle outlines by application of snake active contours, in serial images within a single MRI dataset. Our approach has an average segmented output accuracy of 93.34% by Jaccard Similarity Index, and reduced the processing time by 97.73% per image compared to manual segmentation.

Age and gender estimation using deep residual learning network <=SEP=> In this paper, we propose a deep residual learning model for age and gender estimation. Our method detects faces in input images, and then the age and gender of each face are estimated. The estimation method consists of three deep neural networks where we adopt residual learning methods. We train the model with IMDB-WIKI database [4]. However, since the database has only a small number of face images under the age of 20, we augment the set by collecting the images on the Internet. Experimental results show that the proposed model with residual learning yields improved performance.

Misinformation in Online Social Networks: Detect Them All with a Limited Budget <=SEP=> Online social networks have become an effective and important social platform for communication, opinions exchange, and information sharing. However, they also make it possible for rapid and wide misinformation diffusion, which may lead to pernicious influences on individuals or society. Hence, it is extremely important and necessary to detect the misinformation propagation by placing monitors.
 In this article, we first define a general misinformation-detection problem for the case where the knowledge about misinformation sources is lacking, and show its equivalence to the influence-maximization problem in the reverse graph. Furthermore, considering node vulnerability, we aim to detect the misinformation reaching to a specific user. Therefore, we study a τ-Monitor Placement problem for cases where partial knowledge of misinformation sources is available and prove its #P complexity. We formulate a corresponding integer program, tackle exponential constraints, and propose a Minimum Monitor Set Construction (MMSC) algorithm, in which the cut-set2 has been exploited in the estimation of reachability of node pairs. Moreover, we generalize the problem from a single target to multiple central nodes and propose another algorithm based on a Monte Carlo sampling technique. Extensive experiments on real-world networks show the effectiveness of proposed algorithms with respect to minimizing the number of monitors.

Nanopore sequencing technology and tools for genome assembly: computational analysis of the current state, bottlenecks and future directions. <=SEP=> Nanopore sequencing technology has the potential to render other sequencing technologies obsolete with its ability to generate long reads and provide portability. However, high error rates of the technology pose a challenge while generating accurate genome assemblies. The tools used for nanopore sequence analysis are of critical importance, as they should overcome the high error rates of the technology. Our goal in this work is to comprehensively analyze current publicly available tools for nanopore sequence analysis to understand their advantages, disadvantages and performance bottlenecks. It is important to understand where the current tools do not perform well to develop better tools. To this end, we (1) analyze the multiple steps and the associated tools in the genome assembly pipeline using nanopore sequence data, and (2) provide guidelines for determining the appropriate tools for each step. Based on our analyses, we make four key observations: (1) the choice of the tool for basecalling plays a critical role in overcoming the high error rates of nanopore sequencing technology. (2) Read-to-read overlap finding tools, GraphMap and Minimap, perform similarly in terms of accuracy. However, Minimap has a lower memory usage, and it is faster than GraphMap. (3) There is a trade-off between accuracy and performance when deciding on the appropriate tool for the assembly step. The fast but less accurate assembler Miniasm can be used for quick initial assembly, and further polishing can be applied on top of it to increase the accuracy, which leads to faster overall assembly. (4) The state-of-the-art polishing tool, Racon, generates high-quality consensus sequences while providing a significant speedup over another polishing tool, Nanopolish. We analyze various combinations of different tools and expose the trade-offs between accuracy, performance, memory usage and scalability. We conclude that our observations can guide researchers and practitioners in making conscious and effective choices for each step of the genome assembly pipeline using nanopore sequence data. Also, with the help of bottlenecks we have found, developers can improve the current tools or build new ones that are both accurate and fast, to overcome the high error rates of the nanopore sequencing technology.

The pains and pleasures of parenting: when, why, and how is parenthood associated with more or less well-being? <=SEP=> The relationship between parenthood and well-being has become a hot topic among scholars, media, and general public alike. The research, however, has been mixed-some studies indicate that parents are happier than nonparents, whereas others suggest the reverse. We suggest that the question of whether parents are more or less happy than their childless peers is not the most meaningful one. To reconcile the conflicting literature and expand understanding of the emotional experience of parenthood, we present a model of parents' well-being that describes why and how parents experience more or less happiness than nonparents (i.e., mediators of the link between parenthood and well-being). We then apply this model to explain when parents are more likely to experience more or less happiness (i.e., moderators of parents' well-being, such as parent age or child temperament). Supporting our model, we review 3 primary methodological approaches: studies comparing parents and nonparents, studies examining changes in well-being across the transition to parenthood, and studies comparing parents' experiences while with their children to their other daily activities. Our review suggests that the relationship between parenthood and well-being is highly complex. We propose that parents are unhappy to the extent that they encounter relatively greater negative emotions, magnified financial problems, more sleep disturbance, and troubled marriages. By contrast, when parents experience greater meaning in life, satisfaction of their basic needs, greater positive emotions, and enhanced social roles, they are met with happiness and joy.

Control Strategy on Doubly Fed Induction Generator Using PSIM <=SEP=> This paper deals with doubly fed induction generator control strategy. This paper includes the results performed in PSIM-9 software such as Performance comparison of output voltage under different loading conditions and output power. Keywords— Doubly Fed Induction Generator (DFIG), variable speed wind turbine

Uplift Modeling with Multiple Treatments and General Response Types <=SEP=> Randomized experiments have been used to assist decisionmaking in many areas. They help people select the optimal treatment for the test population with certain statistical guarantee. However, subjects can show significant heterogeneity in response to treatments. The problem of customizing treatment assignment based on subject characteristics is known as uplift modeling, differential response analysis, or personalized treatment learning in literature. A key feature for uplift modeling is that the data is unlabeled. It is impossible to know whether the chosen treatment is optimal for an individual subject because response under alternative treatments is unobserved. This presents a challenge to both the training and the evaluation of uplift models. In this paper we describe how to obtain an unbiased estimate of the key performance metric of an uplift model, the expected response. We present a new uplift algorithm which creates a forest of randomized trees. The trees are built with a splitting criterion designed to directly optimize their uplift performance based on the proposed evaluation method. Both the evaluation method and the algorithm apply to arbitrary number of treatments and general response types. Experimental results on synthetic data and industry-provided data show that our algorithm leads to significant performance improvement over other applicable methods. Accepted: 2017 SIAM International Conference on Data

On Semantic Algebra: A Denotational Mathematics for Natural Language Comprehension and Cognitive Computing <=SEP=> Semantics is composed meaning of language expressions and perceptions at the levels of words, phrase, sentence, paragraph, and essay. The basic unit of formal semantics is a concept as a formal model of words in a natural language. Cognitive linguistics focuses on cognitive semantics and its interaction with underlying syntactic structures. A denotational mathematics known as semantic algebra is presented for rigorous semantics manipulations in cognitive linguistics. Semantic algebra deals with formal semantics of linguistics by a general mathematical model of semantics and a set of algebraic operators. On the basis of semantic algebra, language semantics may not only be deductively analyzed based on syntactic structures from the top down, but also be synthetically composed by the algebraic semantic operators from the bottom up at different levels of language units. Semantic algebra enables a wide range of applications in cognitive informatics, cognitive linguistics, computational linguistics, semantic computing, cognitive computing, machine learning, computing with words, as well as natural language analysis, synthesis, and comprehension.

Cross-Lingual Propagation for Deep Sentiment Analysis <=SEP=> Across the globe, people are voicing their opinion in social media and various other online fora. Given such data, modern deep learning-based sentiment analysis methods excel at determining the sentiment polarity of what is being said about companies, products, etc. Unfortunately, such deep methods require significant training data, while for many languages, resources and training data are scarce. In this work, we present a cross-lingual propagation algorithm that yields sentiment embedding vectors for numerous languages. We then rely on a dual-channel convolutional neural architecture to incorporate them into the network. This allows us to achieve gains in deep sentiment analysis across a range of languages and domains.

The Ring of Gyges : Using Smart Contracts for Crime <=SEP=> Thanks to their anonymity (pseudonymity) and lack of trusted intermediaries, cryptocurrencies such as Bitcoin have created or stimulated growth in many businesses and communities. Unfortunately, some are criminal, e.g., money laundering, marketplaces for illicit goods, and ransomware. Next-generation cryptocurrencies such as Ethereum will include rich scripting languages in support of smart contracts, programs that autonomously intermediate transactions. We illuminate the extent to which these new cryptocurrencies, by enabling criminal activities to be conducted anonymously and with minimal trust assumptions, may fuel new criminal ecosystems. Specifically, we show how what we call criminal smart contracts (CSCs) can facilitate leakage of confidential information, theft of cryptographic keys, and various realworld crimes (murder, arson, terrorism). We show significantly that CSCs for leakage of secrets are efficiently realizable in existing scripting languages such as that in Ethereum. We show that CSCs for key theft can be achieved using cryptographic primitives, such as Succinct Non-interactive ARguments of Knowledge (SNARKs), that are already expressible in these languages and for which efficient supporting language extensions are anticipated. We demonstrate similarly that authenticated data feeds, another anticipated feature of smart contract systems, can facilitate CSCs for real-world crimes. Our results illuminate the scope of possible abuses in nextgeneration cryptocurrencies. They highlight the urgency of creating policy and technical safeguards and thereby realizing the great promise of smart contracts for beneficial goals.

Opening the Black Box of Deep Neural Networks via Information <=SEP=> Despite their great success, there is still no comprehensive theoretical understanding of learning with Deep Neural Networks (DNNs) or their inner organization. Previous work [Tishby and Zaslavsky (2015)] proposed to analyze DNNs in the Information Plane; i.e., the plane of the Mutual Information values that each layer preserves on the input and output variables. They suggested that the goal of the network is to optimize the Information Bottleneck (IB) tradeoff between compression and prediction, successively, for each layer. In this work we follow up on this idea and demonstrate the effectiveness of the InformationPlane visualization of DNNs. Our main results are: (i) most of the training epochs in standard DL are spent on compression of the input to efficient representation and not on fitting the training labels. (ii) The representation compression phase begins when the training errors becomes small and the Stochastic Gradient Decent (SGD) epochs change from a fast drift to smaller training error into a stochastic relaxation, or random diffusion, constrained by the training error value. (iii) The converged layers lie on or very close to the Information Bottleneck (IB) theoretical bound, and the maps from the input to any hidden layer and from this hidden layer to the output satisfy the IB self-consistent equations. This generalization through noise mechanism is unique to Deep Neural Networks and absent in one layer networks. (iv) The training time is dramatically reduced when adding more hidden layers. Thus the main advantage of the hidden layers is computational. This can be explained by the reduced relaxation time, as this it scales super-linearly (exponentially for simple diffusion) with the information compression from the previous layer. (v) As we expect critical slowing down of the stochastic relaxation near phase transitions on the IB curve, we expect the hidden layers to converge to such critical points.1

A comparative evaluation of procedural level generators in the Mario AI framework <=SEP=> Evaluation is an open problem in procedural content generation research. The field is now in a state where there is a glut of content generators, each serving different purposes and using a variety of techniques. It is difficult to understand, quantitatively or qualitatively, what makes one generator different from another in terms of its output. To remedy this, we have conducted a large-scale comparative evaluation of level generators for the Mario AI Benchmark, a research-friendly clone of the classic platform game Super Mario Bros. In all, we compare the output of seven different level generators from the literature, based on different algorithmic methods, plus the levels from the original Super Mario Bros game. To compare them, we have defined six expressivity metrics, of which two are novel contributions in this paper. These metrics are shown to provide interestingly different characterizations of the level generators. The results presented in this paper, and the accompanying source code, is meant to become a benchmark against which to test new level generators and expressivity metrics.

Fuzzy clustering with artificial bee colony algorithm <=SEP=> In this work, performance of the Artificial Bee Colony Algorithm which is a recently proposed algorithm, has been tested on fuzzy clustering. We applied the Artificial Bee Colony (ABC) Algorithm fuzzy clustering to classify different data sets; Cancer, Diabetes and Heart from UCI database, a collection of classification benchmark problems. The results indicate that the performance of Artificial Bee Colony Optimization Algorithm is successful in fuzzy clustering.

A PRAM and NAND flash hybrid architecture for high-performance embedded storage subsystems <=SEP=> NAND flash-based storage is widely used in embedded systems due to its numerous benefits: low cost, high density, small form factor and so on. However, NAND flash-based storage is still suffering from serious performance degradation for random or small size write access. This degradation mainly comes from the physical constraints of NAND flash: erase-before-program and different unit size of erase and program operations. To overcome these constraints, we propose to use PRAM (Phase-change RAM) which supports advanced features: fast byte access capability and no requirement for erase-before-program.
 In this paper, we focus on developing a high-performance NAND flash-based storage system by maximally exploiting the advanced feature of PRAM, in terms of performance and wearing out. To do this, we first propose a new hybrid storage architecture which consists of PRAM and NAND flash. Second, we devise two novel software schemes for the proposed hybrid storage architecture; FSMS (File System Metadata Separation) and hFTL (hybrid Flash Translation Layer). Finally, we demonstrate that our hybrid architecture increases the performance up to 290% and doubles the lifespan compared to the existing NAND flash only storage systems.

New developments in our understanding of acne pathogenesis and treatment. <=SEP=> Interest in sebaceous gland physiology and its diseases is rapidly increasing. We provide a summarized update of the current knowledge of the pathobiology of acne vulgaris and new treatment concepts that have emerged in the last 3 years (2005-2008). We have tried to answer questions arising from the exploration of sebaceous gland biology, hormonal factors, hyperkeratinization, role of bacteria, sebum, nutrition, cytokines and toll-like receptors (TLRs). Sebaceous glands play an important role as active participants in the innate immunity of the skin. They produce neuropeptides, excrete antimicrobial peptides and exhibit characteristics of stem cells. Androgens affect sebocytes and infundibular keratinocytes in a complex manner influencing cellular differentiation, proliferation, lipogenesis and comedogenesis. Retention hyperkeratosis in closed comedones and inflammatory papules is attributable to a disorder of terminal keratinocyte differentiation. Propionibacterium acnes, by acting on TLR-2, may stimulate the secretion of cytokines, such as interleukin (IL)-6 and IL-8 by follicular keratinocytes and IL-8 and -12 in macrophages, giving rise to inflammation. Certain P. acnes species may induce an immunological reaction by stimulating the production of sebocyte and keratinocyte antimicrobial peptides, which play an important role in the innate immunity of the follicle. Qualitative changes of sebum lipids induce alteration of keratinocyte differentiation and induce IL-1 secretion, contributing to the development of follicular hyperkeratosis. High glycemic load food and milk may induce increased tissue levels of 5alpha-dihydrotestosterone. These new aspects of acne pathogenesis lead to the considerations of possible customized therapeutic regimens. Current research is expected to lead to innovative treatments in the near future.