4,050 research outputs found

    Brightness as an Augmentation Technique for Image Classification

    Get PDF
    Augmentation techniques are crucial for accurately training convolution neural networks (CNNs). Therefore, these techniques have become the preprocessing methods. However, not every augmentation technique can be beneficial, especially those that change the image’s underlying structure, such as color augmentation techniques. In this study, the effect of eight brightness scales was investigated in the task of classifying a large histopathology dataset. Four state-of-the-art CNNs were used to assess each scale’s performance. The use of brightness was not beneficial in all the experiments. Among the different brightness scales, the [0.75–1.00] scale, which closely resembles the original brightness of the images, resulted in the best performance. The use of geometric augmentation yielded better performance than any brightness scale. Moreover, the results indicate that training the CNN without applying any augmentation techniques led to better results than considering brightness augmentation. Therefore, experimental results support the hypothesis that brightness augmentation techniques are not beneficial for image classification using deep-learning models and do not yield any performance gain. Furthermore, brightness augmentation techniques can significantly degrade the model’s performance when they are applied with extreme values

    Current-Induced Step Bending Instability on Vicinal Surfaces

    Full text link
    We model an apparent instability seen in recent experiments on current induced step bunching on Si(111) surfaces using a generalized 2D BCF model, where adatoms have a diffusion bias parallel to the step edges and there is an attachment barrier at the step edge. We find a new linear instability with novel step patterns. Monte Carlo simulations on a solid-on-solid model are used to study the instability beyond the linear regime.Comment: 4 pages, 4 figure

    Effect of Integrated Plant Nutrient Management System in Quality of Mandarin Orange (Citrus Reticulata Blanco)

    Get PDF
    Nepal is a major producer among top twenty producing country of mandarin orange in the world. The productivity of the mandarin orange is very low as compared to other developed countries. Nutrient management is the serious problem in most of the orchard along the country. The experiment was conducted in Baglung district of Gandaki Province, Nepal in 2017 to study the effect of Integrated Plant Nutrient Management System (IPNMs) in quality parameters of mandarin orange. Seven group of treatment were assigned for experiment. All treatments were replicated three times in randomized complete block design. The fruits of T4 (Integrated nutrient) have greater fruit diameter: 5.26 cm, weight: 83.32 g total soluble solid: 14.53 brix % and lower titratable acidity: 0.846%. Fruits of T7 have more peel percentage (26.07%). These all findings indicate, integrated plant nutrient management system governs the quality of fresh mandarin orange

    On generalized cluster algorithms for frustrated spin models

    Full text link
    Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for the fully frustrated Ising model on a square lattice, by placing bonds between sites based on information from plaquettes rather than links of the lattice. Here we study some properties of this algorithm and some variants of it. We introduce a practical methodology for constructing a generalized cluster algorithm for a given spin model, and investigate apply this method to some other frustrated Ising models. We find that such algorithms work well for simple fully frustrated Ising models in two dimensions, but appear to work poorly or not at all for more complex models such as spin glasses.Comment: 34 pages in RevTeX. No figures included. A compressed postscript file for the paper with figures can be obtained via anonymous ftp to minerva.npac.syr.edu in users/paulc/papers/SCCS-527.ps.Z. Syracuse University NPAC technical report SCCS-52

    A Complex Network Approach to Topographical Connections

    Full text link
    The neuronal networks in the mammals cortex are characterized by the coexistence of hierarchy, modularity, short and long range interactions, spatial correlations, and topographical connections. Particularly interesting, the latter type of organization implies special demands on the evolutionary and ontogenetic systems in order to achieve precise maps preserving spatial adjacencies, even at the expense of isometry. Although object of intensive biological research, the elucidation of the main anatomic-functional purposes of the ubiquitous topographical connections in the mammals brain remains an elusive issue. The present work reports on how recent results from complex network formalism can be used to quantify and model the effect of topographical connections between neuronal cells over a number of relevant network properties such as connectivity, adjacency, and information broadcasting. While the topographical mapping between two cortical modules are achieved by connecting nearest cells from each module, three kinds of network models are adopted for implementing intracortical connections (ICC), including random, preferential-attachment, and short-range networks. It is shown that, though spatially uniform and simple, topographical connections between modules can lead to major changes in the network properties, fostering more effective intercommunication between the involved neuronal cells and modules. The possible implications of such effects on cortical operation are discussed.Comment: 5 pages, 5 figure

    An examination of writing pauses in the handwriting of children with Developmental Coordination Disorder.

    Get PDF
    This article has been made available through the Brunel Open Access Publishing Fund.Difficulties with handwriting are reported as one of the main reasons for the referral of children with Developmental Coordination Disorder (DCD) to healthcare professionals. In a recent study we found that children with DCD produced less text than their typically developing (TD) peers and paused for 60% of a free-writing task. However, little is known about the nature of the pausing; whether they are long pauses possibly due to higher level processes of text generation or fatigue, or shorter pauses related to the movements between letters. This gap in the knowledge-base creates barriers to understanding the handwriting difficulties in children with DCD. The aim of this study was to characterise the pauses observed in the handwriting of English children with and without DCD. Twenty-eight 8-14 year-old children with a diagnosis of DCD participated in the study, with 28 TD age and gender matched controls. Participants completed the 10 min free-writing task from the Detailed Assessment of Speed of Handwriting (DASH) on a digitising writing tablet. The total overall percentage of pausing during the task was categorised into four pause time-frames, each derived from the literature on writing (250 ms to 2 s; 2-4 s; 4-10 s and >10 s). In addition, the location of the pauses was coded (within word/between word) to examine where the breakdown in the writing process occurred. The results indicated that the main group difference was driven by more pauses above 10 s in the DCD group. In addition, the DCD group paused more within words compared to TD peers, indicating a lack of automaticity in their handwriting. These findings may support the provision of additional time for children with DCD in written examinations. More importantly, they emphasise the need for intervention in children with DCD to promote the acquisition of efficient handwriting skill

    Breaking quantum linearity: constraints from human perception and cosmological implications

    Full text link
    Resolving the tension between quantum superpositions and the uniqueness of the classical world is a major open problem. One possibility, which is extensively explored both theoretically and experimentally, is that quantum linearity breaks above a given scale. Theoretically, this possibility is predicted by collapse models. They provide quantitative information on where violations of the superposition principle become manifest. Here we show that the lower bound on the collapse parameter lambda, coming from the analysis of the human visual process, is ~ 7 +/- 2 orders of magnitude stronger than the original bound, in agreement with more recent analysis. This implies that the collapse becomes effective with systems containing ~ 10^4 - 10^5 nucleons, and thus falls within the range of testability with present-day technology. We also compare the spectrum of the collapsing field with those of known cosmological fields, showing that a typical cosmological random field can yield an efficient wave function collapse.Comment: 13 pages, LaTeX, 3 figure

    Time-dependent correlation functions in a one-dimensional asymmetric exclusion process

    Full text link
    We study a one-dimensional anisotropic exclusion process describing particles injected at the origin, moving to the right on a chain of LL sites and being removed at the (right) boundary. We construct the steady state and compute the density profile, exact expressions for all equal-time n-point density correlation functions and the time-dependent two-point function in the steady state as functions of the injection and absorption rates. We determine the phase diagram of the model and compare our results with predictions from dynamical scaling and discuss some conjectures for other exclusion models.Comment: LATEX-file, 32 pages, Weizmann preprint WIS/93/01/Jan-P

    An automated system for polymer wear debris analysis in total disc arthroplasty using convolution neural network

    Get PDF
    Introduction: Polymer wear debris is one of the major concerns in total joint replacements due to wear-induced biological reactions which can lead to osteolysis and joint failure. The wear-induced biological reactions depend on the wear volume, shape and size of the wear debris and their volumetric concentration. The study of wear particles is crucial in analysing the failure modes of the total joint replacements to ensure improved designs and materials are introduced for the next generation of devices. Existing methods of wear debris analysis follow a traditional approach of computer-aided manual identification and segmentation of wear debris which encounters problems such as significant manual effort, time consumption, low accuracy due to user errors and biases, and overall lack of insight into the wear regime. Methods: This study proposes an automatic particle segmentation algorithm using adaptive thresholding followed by classification using Convolution Neural Network (CNN) to classify ultra-high molecular weight polyethylene polymer wear debris generated from total disc replacements tested in a spine simulator. A CNN takes object pixels as numeric input and uses convolution operations to create feature maps which are used to classify objects. Results: Classification accuracies of up to 96.49% were achieved for the identification of wear particles. Particle characteristics such as shape, size and area were estimated to generate size and volumetric distribution graphs. Discussion: The use of computer algorithms and CNN facilitates the analysis of a wider range of wear debris with complex characteristics with significantly fewer resources which results in robust size and volume distribution graphs for the estimation of the osteolytic potential of devices using functional biological activity estimates.</p

    Dynamic behaviors in directed networks

    Full text link
    Motivated by the abundance of directed synaptic couplings in a real biological neuronal network, we investigate the synchronization behavior of the Hodgkin-Huxley model in a directed network. We start from the standard model of the Watts-Strogatz undirected network and then change undirected edges to directed arcs with a given probability, still preserving the connectivity of the network. A generalized clustering coefficient for directed networks is defined and used to investigate the interplay between the synchronization behavior and underlying structural properties of directed networks. We observe that the directedness of complex networks plays an important role in emerging dynamical behaviors, which is also confirmed by a numerical study of the sociological game theoretic voter model on directed networks
    • …
    corecore