Miracle-dz/UniFAR-FTUs huggingface dataset:
A simple iterative geometry-based interface-preserving reinitialization for the level set method

The iterative reinitialization, as an important process for the standard level set method, is flexible and straightforward in large-scale computing but has problems of interface movement and serious mass loss. Thus a simple iterative geometry-based interface-preserving reinitialization is proposed to reconstruct a signed distance function (SDF) while fixing the interface location with the combination of the external and internal iterations. The external iteration is used to restore the nature of the SDF. And the internal iteration firstly determines displacement errors of zero-level-set interpolation points via the geometric position of the interface, then the errors are redistributed iteratively to adjacent nodes until moving zero-level-set interpolation points are driven back to their original positions. The novel approach performs excellent mass conservation and shape preservation without sacrificing the simplicity of the iterative reinitialization. The accuracy and efficiency of the proposed method are validated with typical stationary interface examples and well-known benchmark cases.
Operational parameters and modes of rotary working body for harrowing crops

A rotary working body with evenly spaced needles along perimeter is a flat disk (rotating in longitudinal–vertical plane). The technological process of interaction with soil is that when rolling rotary disk in soil layer, needle is introduced into it, crushing and shifting soil in direction of rotation. The degree of soil loosening of freely rotating needle disk on axis in longitudinal–vertical plane depends on several parameters: diameter of a disk, number and shape of needles, speed of progressive motion, soil properties. There was made an analytical research of needle working bodies in terms of influence of sizes of disk and needles on process of their interaction with soil.
Steering, Entanglement, Nonlocality, and the EPR Paradox

The concept of steering was introduced by Schrodinger in 1935 as a generalization of the EPR paradox for arbitrary pure bipartite entangled states and arbitrary measurements by one party. Until now, it has never been rigorously defined, so it has not been known (for example) what mixed states are steerable (that is, can be used to exhibit steering). We provide an operational definition, from which we prove (by considering Werner states and Isotropic states) that steerable states are a strict subset of the entangled states, and a strict superset of the states that can exhibit Bell-nonlocality. For arbitrary bipartite Gaussian states we derive a linear matrix inequality that decides the question of steerability via Gaussian measurements, and we relate this to the original EPR paradox.
Compact and Flexible Wideband Antenna for Intraoral Tongue-Drive System for People With Disabilities

This communication presents a compact and flexible folded dipole antenna with stable and wide-bandwidth characteristics for the application of an intraoral tongue-drive system (iTDS) designed for use by people with severe disabilities. The proposed antenna, with an exceptionally small size of 20 mm <inline-formula> <tex-math notation="LaTeX">$\times \,\, 4.4$ </tex-math></inline-formula> mm <inline-formula> <tex-math notation="LaTeX">$\times \,\, 0.025$ </tex-math></inline-formula> mm, was designed to overcome the challenges of space-suitability and detuning that occur due to the variable conditions of the oral environment of the mouth by providing stable and wideband antenna properties. The substantial reduction in the size of the antenna was achieved by introducing slots and meandering the arms of the radiator. Performance was analyzed in open- and closed-mouth scenarios using a realistic model of the human head. Maximum simulated impedance bandwidths of 163% and 151% were observed for the closed- and open-mouth cases, respectively. The proposed design showed lower specific absorption rate (SAR) values (addressing safety concerns) with higher realized gain values in both scenarios compared to the current state-of-the-art iTDS antennas. In order to validate the simulation results, <italic>in vivo</italic> and <italic>in vitro</italic> measurements were taken for the reflection coefficient and radiation patterns, respectively. The results prove that the proposed antenna can efficiently work in the dynamic environment of the mouth and is, therefore, a good candidate for iTDS application.
Reporting on Climate Change by Broadcast Meteorologists: A National Assessment

Television weathercasters are uniquely situated to inform their audiences about the local impacts of global climate change and a growing number of them are adopting the role of climate change educator. We surveyed all American broadcast meteorology professionals in 2015 (N = 2,059; response rate = 22.6%), 2016 (N = 2017; response rate = 31.2%), and 2017 (N = 2,177; response rate = 22.1%) to assess weathercasters’ interest in reporting about climate change; if, where, and how they report about climate change; and the reactions they get from their audiences when they do. Many participating weathercasters indicated that they were moderately or very interested in reporting about climate change, especially using local historical climate information (56%). Just over half of the weathercasters (57.9%) had used one or more communication mode to inform their viewers, or other people in their community, about the local impacts of climate change in the prior year. The most commonly used modes were social media (42.7%), school visits (36.3%), community events (33.1%), and on-air broadcasts (31.3%). Most weathercasters who had reported about climate change on air indicated they received either positive viewer feedback or little feedback (61.9%); conversely, weathercasters who had not reported about climate change expected to receive mostly negative feedback (44.2%). In sum, this analysis suggests that large numbers of weathercasters have adopted the role of climate change educator in their communities; they use a range of communication modes to share climate change information with their audiences and receive mostly positive feedback from their audiences when they do.
Bounded synchronization of complex dynamical networks with prescribed performance via event‐based transmission strategy

This paper addresses a novel prescribed performance synchronization of complex dynamical networks by means of event‐triggered communication protocols. With the designed controller and proposed even‐triggered communication strategy, this paper have advantages of guaranteeing the transient and steady‐state performance of complex dynamic networks and avoiding the continuous communication of networks for reducing the number of communications and saving the network resources. In addition, the Zeno behavior is avoided in the networks. At last, the effectiveness of the theoretic results obtained is verified via the application in the complex dynamical network with Chua's circuit.
Treinamento de redes neurais artificiais através de otimização multi-objetivo: uma nova abordagem para o equilíbrio entre a polarização e a variância

Neste trabalho e desenvolvido um novo metodo para treinamento de Redes Neurais Artificiais (RNAS) do tipo Perceptron Multi·camadas (Multilayer Perceptron-MLP) utilizando- se tecnicas de otimizacao multi-objetivo para encontrar solucoes com alta capacidade de generalizacao. Na abordagem proposta, alem de ser utilizado o erro quadratico como funcao de custo, utiliza·se tambem a funcao norma do vetor de pesos como um segundo objetivo. Estas duas funcoes sao minimizadas e como consequencia deste processo, obtem·se um conjunto de solucoes chamadas Pareto-otimas. Atraves de um decisor, estas solucoes sao avaliadas e apenas uma delas e escolhida como solucao final, a qual equilibra os efeitos da polarizacao e da variância resultando em alta capacidade de generalizacao dada uma determinada realizacao do conjunto de treinamentos O metodo multi-objetivo proposto controla a flexibilidade do modelo independentemente da quantidade de pesos existente na rede, a partir de uma estrutura minima, Alem disso, a utilizacao de parâmetros de treinamento apesar de ser necessaria, influencia pouco a solucao final, O que faz com que a escolha destes parâmetros seja uma tarefa simples. Alem do algoritmo multi-objetivo proposto e do algoritmo Backpropagation, metodos conhecidos os quais tambem visam ao aumento da capacidade de generalizacao como 10· Fold Cross-Validation, Early Stopping, Optimal Bmin Damage, Weight Decuy e Support Vector Mcchines sao abordados Uma analise qualitativa e quantitativa dos algoritmos e feita, atraves da qual pode-se observar a superioridade do metodo proposto, sendo o mesmo capaz de gerar solucoes com alta capacidade de generalizacao de forma simples e eficiente.
On The Compatibility Of Derived Structures On Critical Loci

ON THE COMPATIBILITY OF DERIVED STRUCTURES ON CRITICAL LOCI Antonijo Mrcela Tony Pantev We study the problem of compatibility of derived structures on a scheme which can be presented as a critical locus in more than one way. We consider the situation when a scheme can be presented as the critical locus of a function w ∈ O(S) and as the critical locus of the restriction w|X ∈ O(X) for some smooth subscheme X ⊂ S. In the case when S is the total space of a vector bundle over X, we prove that, under natural assumptions, the two derived structures coincide. We generalize the result to the case when X is a quantized cycle in S and also give indications how to proceed when X ⊂ S is a general closed embedding.
Genetic divergence and therapy-driven evolution between initial and recurrent glioma

Author(s): Johnson, Brett Earl | Advisor(s): Costello, Joseph | Abstract: Low-grade gliomas are slow-growing tumors that often undergo malignant progression to an aggressive high-grade glioblastoma (GBM) with a significantly worse prognosis. Treatment options after surgical resection include temozolomide (TMZ), an alkylating chemotherapeutic which is cytotoxic but can induce CgT/GgA transition mutations when DNA mismatch repair is deficient. However, the extent and clinical impact of TMZ-associated mutagenesis is poorly understood. To investigate the genomic evolution of recurrent tumors and the contribution of TMZ-induced mutagenesis to their mutational landscape, we sequenced the exomes of 23 initial low-grade gliomas and their patient-matched recurrences resected up to 11 years later. We identified a diverse set of evolutionary trajectories that included unexpected losses of canonical driver mutations and radical differences in the genetic relatedness of initial-recurrent tumor pairs. Notably, we found that the recurrent tumors of six patients treated after surgery with TMZ became hypermutated and subsequently recurred as GBM. In each, TMZ-associated mutations altered the function of key cancer genes in pathways involved in malignant progression, including activating mutations in MTOR and PIK3CA, and inactivating mutations in CDKN2A, PTEN, and RB1. These findings suggest that this widely used chemotherapeutic agent has the potential to accelerate tumor evolution with unintended clinical and biological consequences. The ongoing evolution of the genetic landscape in all recurrences emphasizes the need for a longitudinal approach to personalized cancer genomics.
Enhanced copy-paste forgery detection in digital images using scale-invariant feature transform

Image forgery detection and localisation is one of the principal problems in digital forensics. Copy–paste forgery in digital images is a type of forgery in which an image region is copied and pasted at another location within the same image. In this work, the authors propose a methodology to detect and localise copy-pasted regions in images based on scale-invariant feature transform (SIFT). Existing copy-paste forgery detection in images using SIFT and clustering techniques such as hierarchical agglomerative and density-based spatial clustering of applications with noise resulted many false pixel detections. They have introduced sensitivity-based clustering along with SIFT features to identify copy–pasted pixels and disregard the false pixels. Experimental evaluation on public image datasets MICC-F220, MICC-F2000 and MICC-F8 multi shows that the proposed method is showing improved performance in detecting and localising copy-paste forgeries in images than the existing works. Also the proposed work detects multiple copy–pasted regions in the images and is robust to attacks such as geometrical transformation of copied regions such as scaling and rotation.
Robust Spatial–Spectral Block-Diagonal Structure Representation With Fuzzy Class Probability for Hyperspectral Image Classification

Generally, the apparent spectral information of hyperspectral images (HSIs) is directly used to measure the similarity among HSI pixels in the feature space, but this process cannot reveal the inherent characteristics of HSI pixels. Moreover, constructing spatial–spectral block-diagonal subspace structure representations of intraclass land-cover samples remains a challenge for low-rank representation (LRR) in HSI classification. In this article, we propose two methods to reveal the complex intrinsic spatial–spectral features of HSIs using block-diagonal subspace structures, namely, the spatial–spectral block-diagonal structure representation with class probability (SSBDCP) and spatial-spectral block-diagonal structure representation with fuzzy class probability (SSBDFCP) methods, for HSI classification. First, the SSBDFCP and SSBDCP methods explore the structure similarity characteristics of the latent subspace to form a block-diagonal LRR (BDLRR) of intraclass pixels with class probability and fuzzy class probability (FCP) and suppress the interclass pixels’ representations. Then, the spatial information is considered in the proposed methods to enhance spatial–spectral graph expression and capture more comprehensive information. Note that SSBDFCP can perform better than SSBDCP because the FCP considers the “typicalness” that a sample belongs to a specific category and utilizes complex intrinsic discriminative information based on the feedback of “weakly” supervised information. Moreover, the feedback information can remove the noise features around the pixels and take advantage of the benefits of true neighbors. The experimental results for the Indian Pines and Pavia University data sets show that the SSBDFCP and SSBDCP methods achieve better HSI classification results than other popular graph construction methods.
The History of Malaria in the United States.

That malaria was once highly prevalent in northern United States is a matter of common knowledge. Thousands of people now living, physicians and laity, testify to the prevalence of a disease of which many of them were the victims. Literature, medical and nonmedical, contains many references to the fever and ague of the early days. Morbidity and mortality reports of States and cities record the high prevalence and subsequent decrease of the disease. UTndoubtedly malaria got the blame for much illness that it did not cause. Thayer (1) gives an illustration of the -loose diagnosis of "malaria" formerly made in some localities. During the six years ended in 1890 the cities of New York, Brooklyn, and Baltimore reported 4,407 deaths from malaria and 3,937 deaths from typhoid fever, the death rates from the two diseases being thus nearly equal. In the Johns Hopkins Hospital during a period of somewhat over seven years following its opening, two of the years being included in the above-named period, 48 deaths from typhoid were recorded and only 3 from malaria. That is, among the carefully diagnosed cases of the Johns Hopkins Hospital there -was a ratio of 16 typhoid deaths to 1 malaria death, while in the city of Baltimore the ratio reported was nearly 1 to 1. But, however much malaria may have been burdened with the belongings of other diseases,there was undoubtedly a large bulk of it at the bottom. When -large numbers of people come down in the autumn with attacks of chills and fever which often occur every other day and yield to quinine, a microscope is hardly needed to prove that a good deal of real malaria is concerned in the matter. Joseph G. Cannon (2), formerly Speaker of the House of Representatives, whose father was a country physician, has given a very graphic account of the popular diagnosis of malaria in the early days in Indiana:
Endoscopic sclerotherapy as compared with endoscopic ligation for bleeding esophagal varices

Abstract Background. Endoscopic sclerotherapy is an accepted treatment for bleeding esophageal varices, but it is associated with substantial local and systemic complications. Endoscopic ligation, a new form of endoscopic treatment for bleeding varices, may be safer. We compared the effectiveness and safety of the two techniques. Methods. In this randomized trial we compared endoscopic sclerotherapy and endoscopic ligation in 129 patients with cirrhosis who had proved bleeding from esophageal varices. Sixty-five patients were treated with sclerotherapy, and 64 with ligation. Initial treatment for acute bleeding was followed by elective retreatment to eradicate varices. The patients were followed for a mean of 10 months, during which we determined the incidence of complications and recurrences of bleeding, the number of treatments needed to eradicate varices, and survival. Results. Active bleeding at the first treatment was controlled by sclerotherapy in 10 of 13 patients (77 percent) and by ligation in 12.
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix

This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. By applying matching theory, we obtain new results for MLL+Mix proof nets: a linear-time correctness criterion, a quasi-linear sequentialization algorithm, and a characterization of the sub-polynomial complexity of the correctness problem. We also use graph algorithms to compute the dependency relation of Bagnol et al. (2015) and the kingdom ordering of Bellin (1997), and relate them to the notion of blossom which is central to combinatorial maximum matching algorithms. In this journal version, we have added an explanation of Retor\'e's "RB-graphs" in terms of a general construction on graphs with forbidden transitions. In fact, it is by analyzing RB-graphs that we arrived at this construction, and thus obtained a polynomial-time algorithm for finding trails avoiding forbidden transitions; the latter is among the material covered in another paper by the author focusing on graph theory (arXiv:1901.07028).
Explorando paralelismo em big data no processamento de séries temporais de imagens de sensoriamento remoto

A superficie do planeta Terra esta mudando a uma taxa sem precedentes e a classificacao do tipo de uso e cobertura do solo, utilizando series temporais de sensoriamento remoto, e hoje imprescindivel para a identificacao dessas mudancas. O algoritmo TWDTW se destaca nesta tarefa, mas possui complexidade quadratica com alto custo computacional, dificultando o seu uso em grandes volumes de dados (Big Data). Neste trabalho atacamos esses problemas explorando paralelismo tanto em nivel vertical (multicore/manycore) quanto horizontal (cluster de computadores), de forma integrada para oferecer alto desempenho. Na dimensao vertical, propomos um algoritmo paralelo (P-INDEX) para o calculo dos indices de sensoriamento remoto, e outro (P-TWDTW) para o calculo de medidas de similaridade entre series temporais. O speedup do algoritmo P-INDEX foi de ate 9 vezes no processamento de todas as imagens em relacao ao algoritmo sequencial, enquanto o P-TWDTW conseguiu ser ate 12 vezes mais rapido que sua versao centralizada em C++ e 246 vezes mais rapido que o algoritmo TWDTW original em R. Alem de viabilizar o calculo rapido de uma medida de similaridade mais sofisticada, a exploracao de paralelismo no P-TWDTW tambem contribuiu para que essas medidas fossem usadas como meta- caracteristicas para metodos de aprendizado de maquina mais robustos. Isso aumentou a acuracia da classificacao das series temporais de 78%, utilizando o TWDTW com o KNN, para quase 94%, utilizando as meta-caracteristicas obtidas a partir do P-TWDTW com o SVM. Na dimensao horizontal, propomos uma plataforma distribuida (BigSensing) que permite o tratamento eficiente de grandes volumes de dados de sensoriamento remoto. A plataforma inclui um motor inteligente de busca que e capaz de escolher, em tempo real, o melhor sistema para filtrar e recuperar os dados, de acordo com as restricoes espaciais e temporais da consulta, tendo uma reducao de quase 22% do tempo de resposta em relacao ao SciDB na filtragem e recuperacao de dados.
Measurement of the arterial input function from radial MR projections

Dynamic Contrast-Enhanced MRI (DCE-MRI) data may be used to non-invasively investigate the health status of tissue. The technique requires that the concentration of a contrast agent vs. time curve is known in both the tissue of interest and in a blood vessel feeding the tissue commonly referred to as the arterial input function (AIF). Physiologically relevant parameters are extracted through Pharmacokinetic modeling, though the accuracy is known to be highly sensitive to the quality of the acquired data. It is difficult to get a good measurement of the AIF in pre-clinical studies in mice due to their small body size and limited number of vessels of a sufficient size. As a result, several groups use a population averaged curve from the literature. This curve does not account for inter or intra-individual differences, and impacts the accuracy of the fit parameters. We propose a new projection-based measurement that measures the AIF from a single trajectory in k-space, which provides a temporal resolution equal to the repetition time (TR). This AIF is measured in the mouse tail due to the simpler geometry void of highly enhancing organs nearby. The projection-based AIF is advantageous as it allows for the acquisition of DCE data, in the tissue of interest, between measurements without affecting the temporal resolution of either data set. We set up a dual coil experimental platform that acquires AIF data at the mouse tail and DCE data at the tumour. Our technique allows for data optimization at both locations, without restricting the temporal or spatial resolutions of the AIF or DCE data. It may be applied to any pre-clinical study using mice or rats.
Computational analysis of backwards facing vortex generators for boundary layer mixing applications

Computational Fluid Dynamics simulations have been performed using RANS and URANS in order to observe the fundamental flow features and differences between various ramp vortex generator geometries. Both forwards and backwards generator geometries have been tested in 3 configurations. From the analysis it was found that the backwards facing ramp produced superior flow entrainment to the near wall region to the forwards facing ramp in a relatively thick boundary layer. A new method for the rapid visualisation of vortex cores has also been proposed.