MOTIVATION: Pediatric kidney disease is a widespread, progressive condition that severely impacts growth and development of children. Chronic kidney disease is often more insidious in children than in adults, usually requiring a renal biopsy for diagnosis. Biopsy evaluation requires copious examination by trained pathologists, which can be tedious and prone to human error. In this study, we propose an artificial intelligence (AI) method to assist pathologists in accurate segmentation and classification of pediatric kidney structures, named as AI-based Pediatric Kidney Diagnosis (APKD). RESULTS: We collected 2935 pediatric patients diagnosed with kidney disease for the development of APKD. The dataset comprised 93 932 histological structures annotated manually by three skilled nephropathologists. APKD scored an average accuracy of 94% for each kidney structure category, including 99% in the glomerulus. We found strong correlation between the model and manual detection in detected glomeruli (Spearman correlation coefficient r = 0.98, P < .001; intraclass correlation coefficient ICC = 0.98, 95% CI = 0.96-0.98). Compared to manual detection, APKD was approximately 5.5 times faster in segmenting glomeruli. Finally, we show how the pathological features extracted by APKD can identify focal abnormalities of the glomerular capillary wall to aid in the early diagnosis of pediatric kidney disease. AVAILABILITY AND IMPLEMENTATION: https://github.com/ChunyueFeng/Kidney-DataSet.

MOTIVATION: DNA fibre assay has a potential application in genomic medicine, cancer and stem cell research at the single-molecule level. A major challenge for the clinical and research implementation of DNA fibre assays is the slow speed in which manual analysis takes place as it limits the clinical actionability. While automatic detection of DNA fibres speeds up this process considerably, current publicly available software have limited features in terms of their user interface for manual correction of results, which in turn limit their accuracy and ability to account for atypical structures that may be important in diagnosis or investigative studies. We recognize that core improvements can be made to the GUI to allow for direct interaction with automatic results to preserve accuracy as well as enhance the versatility of automatic DNA fibre detection for use in variety of situations. RESULTS: To address the unmet needs of diverse DNA fibre analysis investigations, we propose DNA Stranding, an open-source software that is able to perform accurate fibre length quantification (13.22% mean relative error) and fibre pattern recognition (R > 0.93) with up to six fibre patterns supported. With the graphical interface, we developed, user can conduct semi-automatic analyses which benefits from the advantages of both automatic and manual processes to improve workflow efficiency without compromising accuracy. AVAILABILITY AND IMPLEMENTATION: The software package is available at https://github.com/lgole/DNAStranding. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Architectures for software use rich abstractions and idioms to describe system components, the nature of interactions among the components, and the patterns that guide the composition of components into systems. These abstractions are higher level than the elements usually supported by programming languages and tools. They capture packaging and interaction issues as well as computational functionality. Well-established (if informal) patterns guide the architectural design of systems. We sketch a model for defining architectures and present an implementation of the basic level of that model. Our purpose is to support the abstractions used in practice by software designers. The implementation provides a testbed for experiments with a variety of system construction mechanisms. It distinguishes among different types of components and different ways these components can interact. It supports abstract interactions such as data flow and scheduling on the same footing as simple procedure call. It can express and check appropriate compatibility restrictions and configuration constraints. It accepts existing code as components, incurring no runtime overhead after initialization. It allows easy incorporation of specifications and associated analysis tools developed elsewhere. The implementation provides a base for extending the notation and validating the model.>

A matrix has Property A if and only if it is a diagonal matrix, or else there exists a rearrangement of the rows and corresponding columns of the matrix which corresponds to a red-black partitioning An L-matrix has positive diagonal elements and nonpositlve off-diagonal elements.

The use of finite difference methods enables one to solve numerically many boundary value problems involving partial differential equations of elliptic type for which explicit a,~alytic solutions are not available.To date these methods have primarily been used for manual computations as described for instance by Southwell, 14 Shortley and •eller, 12 Emmons, 2 Allen, 1 and Shaw 11.Anyone who has carried out the method by hand will be impressed by the large amount of drudgery which is required, and probably feels that here is a place where the use of high speed machines is indicated.However, until recently the use of machines has been largely limited to the solution of Laplace's equation in a square, as described in Snyder and Livingston, 13 Young and Lerch, 20 and Young and Warlich, 21 although, of course, other problems have been treated.**Thereason machines have not been used more is probably that, in spite of the fact that they can eliminate the drudgery of carrying out the iterations, a large amount of preparation is needed for each problem as compared with hand methods.On the other hand, manual methods are more flexible and can be quickly adapted to widely varying types of problems.In order for the automatic procedures tohave any chance of competing with manual methods, it would appear necessary to have available a large routine capable, with the insertion of constants on tape specifying the differential equation, the region, the boundary conditions, the iteratire method, etc., of solving a large class of problems.The main part of the routine would be prepared once and for all, and only a small amount *Presented at the meeting of the Association, Jtme 23-25, 1954.Thls work was done under Contract No. DA-36-034-ORD-1486, placed by the Office of Ordnance Research, U. S. Army, with the University of Maryland.**For instance more difficult problems on weather prediction have been solved at the InstitUte c~ Advanced Study.