Miracle-dz/UniFAR-FTUs huggingface dataset:
Comparison of two-dimensional and three-dimensional echocardiographic strain in children with CHD

Abstract Background In CHD, three-dimensional strain analysis may overcome limitations of Doppler and two-dimensional strain of the left ventricle. The aims of this study were to evaluate feasibility and reproducibility of three-dimensional longitudinal, circumferential, and radial systolic strain by three-dimensional speckle-tracking echocardiography compared with two-dimensional echocardiography. Methods Patients with CHD, biventricular circulation with a systemic left ventricle, and who had two- and three-dimensional imaging performed on the same day from 2010 to 2014 were included. Quantitative two- and three-dimensional strain analyses were performed (two-dimensional cardiac performance analysis version 1.2 and four-dimensional left ventricular analysis version 3.1). Intra- and inter-observer variabilities were calculated on 25 studies. Results A total of 30 patients, including 19 (61%) males, with a median age of 3.6 years (0.1–22 years) were included. The mean fractional shortening was 34.6±5.3%, and the mean ejection fraction was 62.0±6.4%. Measurement of two- and three-dimensional strain was feasible in >95% of segments. Good correlation was observed between longitudinal and circumferential strain (r=0.92, p⩽0.001 and r=0.87, p⩽0.001), but not radial strain (r=0.29, p=0.2). Intra- and inter-observer agreements were better for three-dimensional compared with two-dimensional strain, and better for both two- and three-dimensional longitudinal and circumferential strains compared with radial strain. Conclusion Left ventricular three-dimensional strain analysis is feasible in children with CHD. The reproducibility of longitudinal and circumferential strain by three-dimensional analyses is better. Further longitudinal studies are warranted for the potential clinical application of this new technology.
Isometries of vector-valued function spaces preserving the kernel of a linear operator

We prove Banach–Stone type theorems for isometries of continuously differentiable (continuously twice differentiable resp.) functions on the unit interval equipped with norms related to the first derivative (a linear differential operator of second-order resp.). They are consequences of a general theorem on isometries of function spaces, on which a linear operator is defined, over compact Hausdorff spaces.
Avaliação de métodos de quantificação de imagens PET com [11C]-(R)-PK11195 na investigação da esclerose múltipla

A ativacao da microglia e uma resposta importante a processos inflamatorios no sistema nervoso central (SNC). Estudos vem utilizando a aquisicao de imagens de tomografia por emissao de positrons (PET) com o radiotracador [11C]-(R)-PK11195, ligante seletivo para TSPO, presente em niveis baixos no SNC saudavel. Embora a literatura traga diversos metodos quantitativos de analise das imagens de PET cerebrais adquiridas com [11C]-(R)-PK11195, nao existe metodo padronizado de analise aplicavel na pratica clinica. Limitacoes envolvem a necessidade de amostragem de sangue arterial para aquisicao da funcao de entrada para quantificacao verdadeira de parâmetros cineticos, tais como o potencial de ligacao. Quando a funcao de entrada arterial nao e adquirida, a utilizacao de modelos baseados em regiao de referencia apresenta erros de quantificacao, pois nao existe uma regiao no cerebro que seja livre de ligacao especifica de [11C]-(R)-PK11195. O objetivo desse trabalho e investigar metodos de analise quantitativa e semiquantitativa de imagens de PET cerebrais adquiridas com [11C]-(R)-PK11195, identificando suas limitacoes e potencialidades. Esse trabalho esta inserido dentro de um estudo clinico com pacientes com esclerose multipla (EM) do tipo remitente-recorrente em tratamento com fingolimode. Serao utilizadas imagens cerebrais de PET adquiridas com [11C]-(R)-PK11195 e imagens estruturais de ressonância magnetica ponderadas em T1. Metodos de analise quantitativa e semiquantitativa serao comparadas, levando em consideracao aspectos especificos da EM. Na analise transversal, o uso do SUVRWM na regiao justacortical e periventricular apresenta os melhores resultados de diferenciacao entre grupos de pacientes com EM e o grupo controle. Na analise longitudinal, o uso do SUVRWM e do SUVRCB podem indicar o comportamento da captacao de [11C]-(R)-PK11195 ao longo do tempo, sendo tais medidas potenciais indicadores de evolucao da EM quando aplicados nas regioes justacortical e periventricular. Conclui-se que, dentre os metodos analisados, o metodo SUVRWM apresenta resultados promissores e satisfatorios, em especial quando aplicado as regioes justacortical e periventricular.
No Free Lunch Theorem, Inductive Skepticism, and the Optimality of Meta-induction

The no free lunch theorem is a radicalized version of Hume’s induction skepticism. It asserts that relative to a uniform probability distribution over all possible worlds, all computable prediction algorithms—whether ‘clever’ inductive or ‘stupid’ guessing methods (etc.)—have the same expected predictive success. This theorem seems to be in conflict with results about meta-induction. According to these results, certain meta-inductive prediction strategies may dominate other (non-meta-inductive) methods in their predictive success (in the long run). In this article this conflict is analyzed and dissolved, by means of probabilistic analysis and computer simulation.
Target Reference 2 D Alignment Joint 3 D Fitting Expression Warp 3 D Rotation Define Crop Region Final Blending

We address the problem of correcting an undesirable expression on a face photo by transferring local facial components, such as a smiling mouth, from another face photo of the same person which has the desired expression. Direct copying and blending using existing compositing tools results in semantically unnatural composites, since expression is a global effect and the local component in one expression is often incompatible with the shape and other components of the face in another expression. To solve this problem we present Expression Flow, a 2D flow field which can warp the target face globally in a natural way, so that the warped face is compatible with the new facial component to be copied over. To do this, starting with the two input face photos, we jointly construct a pair of 3D face shapes with the same identity but different expressions. The expression flow is computed by projecting the difference between the two 3D shapes back to 2D. It describes how to warp the target face photo to match the expression of the reference photo. User studies suggest that our system is able to generate face composites with much higher fidelity than existing methods. CR Categories: I.4. 9 [IMAGE PROCESSING AND COMPUTER VISION]: Applications
Some implications of work hardening and ideal plasticity

1. Summary. The purpose of this note is to point out the severe restriction imposed on possible stress-strain relations by a mathematical formulation of the concepts of work hardening and ideal plasticity. Using this condition, an algebraic derivation and extension is given of Prager's extension1 of the Mises plastic potential function. A brief discussion is also given of the meaning of stability of plastic deformation as contrasted with stability of non-conservative systems in general. 2. Introduction. A mathematical theory of plasticity must of necessity be based upon simplifying assumptions. For example, a good first approximation may be obtained by ignoring time effects in most structural metals at room temperature under isothermal conditions. A stress-strain diagram, therefore, represents a succession of states of static equilibrium. Furthermore, it is an experimental fact that metals generally work harden; then each equilibrium state is said to be stable. The phenomenon of the upper yield point, exhibited by a few metals, notably mild steel, is an important exception. Another exception is the region beyond the ultimate strength on a nominal tensile stress-strain plot when necking occurs, Fig. 1. However, this real instability is in terms of force; the actual stress continues to increase until failure occurs.
A nonconvex optimization approach to IMRT planning with dose-volume constraints

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
Patch-based adaptive weighting with segmentation and scale (PAWSS) for visual tracking

Tracking-by-detection algorithms are widely used for visual tracking, where the problem is treated as a classification task where an object model is updated over time using online learning techniques. In challenging conditions where an object undergoes deformation or scale variations, the update step is prone to include background information in the model appearance or to lack the ability to estimate the scale change, which degrades the performance of the classifier. In this paper, we incorporate a Patch-based Adaptive Weighting with Segmentation and Scale (PAWSS) tracking framework that tackles both the scale and background problems. A simple but effective colour-based segmentation model is used to suppress background information and multi-scale samples are extracted to enrich the training pool, which allows the tracker to handle both incremental and abrupt scale variations between frames. Experimentally, we evaluate our approach on the online tracking benchmark (OTB) dataset and Visual Object Tracking (VOT) challenge datasets. The results show that our approach outperforms recent state-of-the-art trackers, and it especially improves the successful rate score on the OTB dataset, while on the VOT datasets, PAWSS ranks among the top trackers while operating at real-time frame rates.
Conformal Surface Parameterization for Texture Mapping

We give an explicit method for mapping any simply connected surface onto the sphere in a manner which preserves angles. This technique relies on certain conformal mappings from differential geometry. Our method provides a new way to automatically assign texture coordinates to complex undulating surfaces. We demonstrate a finite element method that can be used to apply our mapping technique to a triangulated geometric description of a surface.
Reproducing kernel Hilbert spaces

REPRODUCING KERNEL HILBERT SPACES Baver Okutmustur M.S. in Mathematics Supervisor: Assist. Prof. Dr. Aurelian Gheondea August, 2005 In this thesis we make a survey of the theory of reproducing kernel Hilbert spaces associated with positive definite kernels and we illustrate their applications for interpolation problems of Nevanlinna-Pick type. Firstly we focus on the properties of reproducing kernel Hilbert spaces, generation of new spaces and relationships between their kernels and some theorems on extensions of functions and kernels. One of the most useful reproducing kernel Hilbert spaces, the Bergman space, is studied in details in chapter 3. After giving a brief definition of Hardy spaces, we dedicate the last part for applications of interpolation problems of NevanlinnaPick type with three main theorems: interpolation with a finite number of points, interpolation with an infinite number of points and interpolation with points on the boundary. Finally we include an Appendix that contains a brief recall of the main results from functional analysis and operator theory.
House Physical Environment Condition of Type 2 Diabetes Mellitus Patient from Puskesmas Sempaja Geriatric Health Post Unit

The prevalence rate of type 2 diabetes mellitus (T2D) tends to increase in various parts of the world. T2D is characterized by high blood glucose level, and currently among the top diseases affecting millions of people in the world. T2D is a chronic disease that is prone to various complications, one of which is diabetic neuropathy and foot ulcers. T2D is more common in the elderly who primarily stayedhome,soaccess,qualityandmaintenancetoadequatehousingareimportant fordiabeticpatientsinmanagingdiabetesroutinesanddiet.Thisresearchisa cross-sectionalanalyticstudy.Participantsinthisstudywereselectedpurposively fromgeriatrichealthpostatCommunityHealthCenterinSempaja,Samarinda, Indonesia.Thevariablesstudiedwerethephysicalconditionofthehousebased onhealthyhousequestionnairefromtheIndonesianMinistryofHealth,andthe statusofdiabetesofthepatient.Theresultsshowedthatonly8. 6%(n = 5) of T2D patients had unhealthy house while 15.5% (n = 9) of those without T2D had unhealthy house. No association between physical environment conditions between house of T2D patients and those without T2D was found (p = 0.1664). Nonetheless, signiﬁcant differences were found on the component of the healthy house score: the housing score (p = 0.0243) and sanitation score (p = 0.00730; no signiﬁcance was found on the behavior score (p = 0.1240).
Throughput Optimal Decentralized Scheduling with Single-bit State Feedback for a Class of Queueing Systems

Motivated by medium access control for resource-challenged wireless Internet of Things (IoT), we consider the problem of queue scheduling with reduced queue state information. In particular, we consider a time-slotted scheduling model with $N$ sensor nodes, with pair-wise dependence, such that Nodes $i$ and $i + 1,~0<i<N$ cannot transmit together. We develop new throughput-optimal scheduling policies requiring only the empty-nonempty state of each queue that we term Queue Nonemptiness-Based (QNB) policies. We propose a Policy Splicing technique to combine scheduling policies for small networks in order to construct throughput-optimal policies for larger networks, some of which also aim for low delay. For $N = 3,$ there exists a sum-queue length optimal QNB scheduling policy. We show, however, that for $N>4,$ there is no QNB policy that is sum-queue length optimal over all arrival rate vectors in the capacity region. We then extend our results to a more general class of interference constraints that we call cluster-of-cliques (CoC) conflict graphs. We consider two types of CoC networks, namely, Linear Arrays of Cliques (LAoC) and Star-of-Cliques (SoC) networks. We develop QNB policies for these classes of networks, study their stability and delay properties, and propose and analyze techniques to reduce the amount of state information to be disseminated across the network for scheduling. In the SoC setting, we propose a throughput-optimal policy that only uses information that nodes in the network can glean by sensing activity (or lack thereof) on the channel. Our throughput-optimality results rely on two new arguments: a Lyapunov drift lemma specially adapted to policies that are queue length-agnostic, and a priority queueing analysis for showing strong stability.
Dynamic game semantics

Abstract The present work achieves a mathematical, in particular syntax-independent, formulation of dynamics and intensionality of computation in terms of games and strategies. Specifically, we give game semantics of a higher-order programming language that distinguishes programmes with the same value yet different algorithms (or intensionality) and the hiding operation on strategies that precisely corresponds to the (small-step) operational semantics (or dynamics) of the language. Categorically, our games and strategies give rise to a cartesian closed bicategory, and our game semantics forms an instance of a bicategorical generalisation of the standard interpretation of functional programming languages in cartesian closed categories. This work is intended to be a step towards a mathematical foundation of intensional and dynamic aspects of logic and computation; it should be applicable to a wide range of logics and computations.
Fault‐tolerant control for Markovian jump systems with general uncertain transition rates against simultaneous actuator and sensor faults

This paper investigates the problems of simultaneous estimations of actuator faults and sensor faults, as well as fault‐tolerant control schemes for a class of Markovian jump systems with general uncertain transition rates. In a general uncertain transition rate matrix model, transition rate may be completely unknown, or one can only acquire its estimated value, which makes the design much more challenging. First, the original system is transformed into a descriptor one by extending the sensor faults to be parts of state vector. Then, a robust stochastic adaptive observer is designed for the descriptor system with the actuator fault being adjusted by an adaptive law. On the basis of the estimated states as well as estimated actuator and sensor faults, a fault‐tolerant control strategy is proposed to make the resulting closed‐loop system stable in the presence of the actuator fault. Sufficient existence conditions of the observer and controller are derived in terms of linear matrix inequalities. Finally, three practical examples are given to validate the high efficiency of our proposed method. Copyright © 2017 John Wiley & Sons, Ltd.
Star-world navigation functions for convergence to a time-varying destination manifold

Robot navigation and motion planning are important tasks in practical applications. Navigation functions [1] is an important tool for that purpose. They serve as a potential field methodology for exact robot motion planning and control problems. However, traditional navigation functions are built for static environments, and existing navigation functions with time-varying destinations [2] only apply to sphere worlds. This dissertation proposes an extension to navigation function methodologies that applies to star worlds with time-varying destinations. Based on the existing literature [2] of time-varying navigation functions in sphere worlds, time-varying diffeomorphic transformations are constructed, and a proof of the correctness of the overall construction that extends the time-varying navigation functions from sphere worlds to star worlds and star forests, is presented. A new environmental modeling method is also introduced, to reduce computational and analytical complexity of workspace modeling, without sacrificing too much in terms of representation generality. This environment modeling method provides unified expressions of cube-like obstacles in n-dimensional spaces. For the cube-like obstacles, analytical expressions of the implicit representations and the length of rays (segments from a “center” point in the interior to an arbitrary point on the boundary) are given. Thanks to the new environmental modeling method, real-time robot motion planning can be achieved with the proposed time-varying navigation functions, without elaborate workspace modeling and in a wide range of of complex enclosed environments. The proposed robot motion planning method is validated in both simulations and experiments. Calculation examples of time-varying navigation constructions are provided, and simulations with a ideal point robot without kinematics and dynamics constrains are conducted. Visualization of those time-varying potential fields with moving targets is also offered.
Adaptive neural control for nonstrict‐feedback stochastic nonlinear time‐delay systems with input and output constraints

This paper investigates an adaptive neural tracking control for a class of nonstrict‐feedback stochastic nonlinear time‐delay systems with input saturation and output constraint. First, the Gaussian error function is used to represent a continuous differentiable asymmetric saturation model. Second, the appropriate Lyapunov‐Krasovskii functional and the property of hyperbolic tangent functions are used to compensate the time‐delay effects, the neural network is used to approximate the unknown nonlinearities, and a barrier Lyapunov function is designed to ensure that the output parameters are restricted. At last, based on Lyapunov stability theory, a robust adaptive neural control method is proposed, and the designed controller decreases the number of learning parameters and thus reduces the computational burden. It is shown that the designed neural controller can ensure that all the signals in the closed‐loop system are 4‐Moment (or 2 Moment) semi‐globally uniformly ultimately bounded and the tracking error converges to a small neighborhood of the origin. Two examples are given to further verify the effectiveness of the proposed approach.
Dynamic Virtual Network Reconfiguration Over SDN Orchestrated Multitechnology Optical Transport Domains

Network virtualization is an emerging technique that enables multiple tenants to share an underlying physical infrastructure, isolating the traffic running over different virtual infrastructures/tenants. This technique aims to improve network utilization, while reducing the complexities in terms of network management for operators. Applied to this context, software-defined networking (SDN) paradigm can ease network configurations by enabling network programability and automation, which reduces the amount of operations required from both service and infrastructure providers. SDN techniques are decreasing vendor lock-in issues due to specific configuration methods or protocols. Application-based network operations (ABNO) are a toolbox of key network functional components with the goal of offering application-driven network management. Service provisioning using ABNO may involve direct configuration of data plane elements or delegate it to several control plane modules. We validate the applicability of ABNO to multitenant virtual networks in multitechnology optical domains based on two scenarios, in which multiple control plane instances are orchestrated by the architecture. Congestion detection and failure recovery are chosen to demonstrate fast recalculation and reconfiguration, while hiding the configurations in the physical layer from the upper layer.