Miracle-dz/UniFAR-FTUs huggingface dataset:
Laparoscopic living donor right hemihepatectomy with venous outflow reconstruction using cadaveric common iliac artery allograft

Rationale: With the development of laparoscopic technique, the total laparoscopic living donor right hemihepatectomy (LLDRH) procurement surgery has been successfully performed in many liver transplant centers all over the world, and the number of cases is continuing to increase. We report our case of laparoscopic right graft resection with venous outflow reconstruction using cadaveric common iliac artery allograft in our center and review literatures about total LLDRH surgery. Patient concerns and Diagnoses: A 40-year-old male living donor for right hepatectomy was selected after pretransplant evaluation including laboratory tests, liver volume, anatomy of hepatic vein, artery, portal vein, and bile duct. Living donor liver transplantation surgery was approved by Sichuan Provincial Health Department and the ethics committee of the West China Hospital, Sichuan University. Interventions: Hepatic parenchyma transection was performed by ultrasonic scalpel and Cavitron Ultrasonic Surgical Aspirator (CUSA). Right branch of portal vein, right hepatic artery, right hepatic duct, and right hepatic vein were meticulously dissected. The right hepatic duct was ligated and transected 2 mm far from the bifurcation of common hepatic duct, right hepatic artery, and portal vein were also ligated and transected, the right hepatic vein was transected by laparoscopic linear cutting stapler. The gap between short hepatic veins and right hepatic vein was bridged and reconstructed by cadaveric common iliac artery allograft. Outcomes: The operation time was 480 minutes and warm ischemia time was 4 minutes. Blood loss was 300 mL without blood transfusion. The donor was discharged on postoperative day 7 uneventfully without complications. Literatures about laparoscopic living donor right hemihepatectomy are compared and summarized in table. Lessons: The total laparoscopic living donor right hemihepatectomy is technically feasible and safe in some transplant centers which should have rich open living donor liver transplantation experience and skilled laparoscopic techniques. Venous outflow tract reconstruction is necessary if orifice diameter of short hepatic vein is greater than 0.5 cm on the graft cutting surface.
Absolute stability conditions for discrete-time recurrent neural networks

An analysis of the absolute stability for a general class of discrete-time recurrent neural networks (RNN's) is presented. A discrete-time model of RNN's is represented by a set of nonlinear difference equations. Some sufficient conditions for the absolute stability are derived using Ostrowski's theorem and the similarity transformation approach. For a given RNN model, these conditions are determined by the synaptic weight matrix of the network. The results reported in this paper need fewer constraints on the weight matrix and the model than in previously published studies.
of the Annual Meeting of the Cognitive Science Society Title Assessing the Efficacy of Transitional Probabilities for Learning Syntactic Categories

While research on both infant language abilities and the informativeness of natural language for the formation of grammatical categories has advanced considerably, the extent to which these two fields inform each other is limited. To address this issue, we ask whether tracking transitional probabilities, a skill which infants are known to apply to language learning, is useful for learning grammatical categories from natural child-directed speech. We systematically remove subsets of the data to assess the relative contributions of several potential sources of information. Our analysis finds that immediately following a high frequency function word provides considerable information about whether a word is a noun or a verb. However, in unsupervised clustering, this information alone does not result in highly accurate categorization of nouns and verbs.
Testing the master constraint programme for loop quantum gravity: II. Finite-dimensional systems

This is the second paper in our series of five in which we test the master constraint programme for solving the Hamiltonian constraint in loop quantum gravity. In this work, we begin with the simplest examples: finite-dimensional models with a finite number of first or second class constraints, Abelian or non-Abelian, with or without structure functions.
Induction of the G2/M transition stabilizes haploid embryonic stem cells

The recent successful establishment of mouse parthenogenetic haploid embryonic stem cells (phESCs) and androgenetic haploid ESCs (ahESCs) has stimulated genetic research not only in vitro but also in vivo because of the germline competence of these cell lines. However, it is difficult to maintain the haploid status over time without a frequent sorting of the G1 phase haploid ESCs by fluorescence-activated cell sorting (FACS) at short intervals, because haploid cells tend to readily self-diploidize. To overcome this spontaneous diploid conversion, we developed a phESC culture condition using a small molecular inhibitor of Wee1 kinase to regulate the cell cycle by accelerating the G2/M phase transition and preventing re-entry into extra G1/S phase. Here, we demonstrate that, under this condition, phESCs maintained the haploid status for at least 4 weeks without the need for FACS. This method will greatly enhance the availability of these cells for genetic screening.
ON TRAVELING WAVE SOLUTIONS OF THE θ − CLASS OF DISPERSIVE EQUATIONS

We investigate traveling wave solutions to a class of dispersive models – the θ-equation of the form ut − utxx + uux = θuuxxx + (1− θ)uxuxx, including two integrable equations, the Camassa-Holm equation (θ = 1/3) and the Degasperis-Procesi equation(θ = 1/4) as special models. When 0 ≤ θ ≤ 1 2 , strong solutions of the θ-equation may blow-up in finite time, correspondingly, the traveling wave solutions are quite rich. It is shown that when θ = 0, only periodic travel wave is permissible, and when θ = 1/2 traveling waves may be solitary, periodic or kink-like waves. For 0 < θ < 1/2, traveling waves such as periodic, solitary, peakon, peaked periodic, cusped periodic, or cusped soliton are all permissible.
Developmental Assessment With Young Children: A Systematic Review of Battelle Studies

Developmental assessment scales are important tools for determining developmental delays and planning preventive interventions. One broad assessment scale used to evaluate child development is the Battelle Developmental Inventories (BDIs). The BDI-2 has a standardized version in English with good psychometric properties and a translated version in Spanish; however, despite widespread clinical use, there has been limited early childhood development research focused on this assessment tool in the past 10 years. The purpose of this systematic review was to evaluate the literature about the BDIs and their screening test and analyze their use for child assessment. Seven databases were used to retrieve articles in English, Portuguese, and Spanish. Overall, 34 articles were evaluated for general features, salient findings, and key methodological issues, such as target population, objectives, research design, and main results. Authors' considerations about the psychometric properties and utility of the BDIs were also examined. Results indicated that 41.17% of studies with the BDIs were from the United States, and the most common target population was children with autism spectrum disorders. Generally, the articles highlighted the broad applications of this measure and robust psychometric properties cited in the BDIs examiner's manual as reasons for their use. This review suggests that it is important to conduct independent analyses of the psychometric properties of the BDIs as well as validation studies to ensure appropriate applications of the BDI, including for use with non-American populations.
Order reduction of linear continuous time interval system using mixed evolutionary technique

Higher order systems are difficult to control and complex in nature hence, it is desirable to reduce these systems in the low order system. A system with constant coefficient but uncertain within finite range is known as interval system. This paper aims to reduce linear continuous time interval system using evolutionary technique. Cuckoo optimization algorithm technique has attracted vast attention among various evolutionary techniques. The Routh array is constructed to obtain denominator of higher order system using the generalized routh table. The numerator of reduced order system is obtained using cuckoo optimization algorithm by minimizing integral square error between original and reduced order system. Reduced order system retains the stability and steady state value of the higher order system. The numerical examples are illustrated and results are compared with the other well known methods.
The Time-Triggered Sensor Fusion Model

This paper compares current sensor fusion models and proposes a new time-triggered model for sensor fusion. The time-triggered sensor fusion model decomposes a real time system into three levels, a node level, containing the sensors and the actuators, a cluster level that gathers measurements and performs sensor fusion, and an application level where an application program makes control decisions based on environmental information provided by the cluster level. Because the application code is independent of the employed sensors, the system is open to sensor reconfigurations and reuse of the application code. Furthermore, the model contains a hardwareindependent application interface and a timetriggered smart transducer network. An application of the presented concept is shown with a mobile robot controlled by a timetriggered communication network.
Multi-hop Networks Management Considering Terminal Mobility

Multi-hop network is attractive for ad-hoc network which is the network to build temporarily such as the mobile computing and the communication system in case of a disaster. Multi-hop network also realizes the spatial reuse of spectral resources by controlling transmission range. Therefore, the channel capacity can be used eé ciently. However, the issue to identify a network topology eé ciently should be solved, because there are not any base stations or control stations to manage the operation of a network. Therefore, we proposed an algorithm to identify a network topology in the previous paper. And we conårmed the validity and availability of the proposed algorithm. In this paper, in order to accommodate mobile terminals into the network, we consider the eãect of terminal mobility on this algorithm. And we develop the relationship among clustering-radius, çooding-radius and velocity of terminals. As long as this relationship is satisåed, clustering and çooding can be performed successfully without any missing terminals. By computer simulation, the validity of system behavior with this relationship is veriåed.
Asymptotic Distribution of Log-Likelihood Maximization Based Algorithms and Applications

The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that are based on a twostage approach, in which an initial estimate is used as the starting point of a subsequent iterative search, are analyzed. The analysis is relevant for cases where the log-likelihood function is known to have local maxima in addition to the global maximum, and there is no available method that is guaranteed to provide an estimate within the attraction region of the global maximum. In addition, an algorithm for finding the maximum likelihood estimator is offered. The algorithm is best suited for scenarios in which the likelihood equations do not have a closed form solution, the iterative search is computationally cumbersome and highly dependent on the data length, and there is a risk of convergence to a local maximum. The result on the asymptotic distribution is validated and the performance of the offered algorithm is examined by computer simulations.
Transcribing nonsense words : The effect of numbers of repetitions and voices

Online is checked for eligibility for copyright before being made available in the live archive. URLs from City Research Online may be freely distributed and linked to from other web pages. Enquiries If you have any enquiries about any aspect of City Research Online, or if you wish to make contact with the author(s) of this paper, please email the team at publications@city.ac. uk. Abstract Transcription skills are crucially important to all phoneticians, and particularly for speech and language therapists who may use transcriptions to make decisions about diagnosis and intervention. Whilst interest in factors affecting transcription accuracy is increasing, there are still a number of issues that are yet to be investigated. The present paper considers how the number and type of voices, and the number of repetitions affects the transcription of nonsense words. Thirty two students in their second year of study for a BSc in Speech and Language Therapy were participants in an experiment. They heard two nonsense words presented ten times in either one or two voices. Results show that the number and gender of voices did not affect accuracy, but that accuracy increased between six and ten repetitions. Implications for teaching and learning, clinical practice, and further research are discussed.
The von Neumann Architecture Is Due for Retirement

The processor industry has reached the point where sequential improvements have plateaued and we are being flooded with parallel hardware we don't know how to utilise. An efficient, general-purpose and easy-touse parallel model is urgently needed to replace the von Neumann model. We introduce and discuss the selfmodifying dataflow graph, an unusual model of computation which combines the naturally parallel dataflow model with local graph transformations to eliminate the need for a global memory. We justify why it is a promising candidate.
Improved design of oversampled allpass transformed DFT filter-banks with near-perfect reconstruction

In this paper, the design of oversampled allpass transformed analysis-synthesis filter-banks is treated, which can be employed for non-uniform subband processing. Near-perfect reconstruction can be achieved by a synthesis filter-bank design which uses phase equalizers to compensate the phase modifications due to the allpass transformation of the analysis filter-bank. It is shown that an FIR phase equalizer, which is obtained by a least-squares approximation of the desired non-causal IIR phase equalizer, leads to almost perfect signal reconstruction and causes only a comparatively low signal delay. The devised synthesis filter-bank design can be described by a closed-form expression and allows to control the trade-off between reconstruction errors on the one hand and signal delay and computational complexity on the other hand.
HRTF-based robust least-squares frequency-invariant beamforming

In this work, a Head-Related Transfer Function (HRTF)-based Robust Least-Squares Frequency-Invariant (RLSFI) beamformer design is proposed. The HRTF-based RLSFI beamformer accounts for the influence of a robot's head on the sound field. The performance of the new HRTF-based RLSFI beamformer is evaluated using signal-based measures and word error rates for an off-the-shelf speech recognizer, and is compared to the performance of the original free-field RLSFI beamformer design. The experimental results confirm the efficacy of the proposed HRTF-based beamformer design for robot audition.
On the heat channel and its capacity

The heat channel is defined by an analog filter and a subsequent inaccurate measurement of the filter output signal. The filter is related to the solution of the heat equation and to the heat kernel of the quantum mechanical harmonic oscillator, so the name of the channel. The channel is modeled as an infinite-dimensional vector Gaussian channel and the capacity in terms of average energy of the input signal is derived. The relation to rate distortion theory is investigated by calculating the rate distortion function of a closely connected Gaussian process. Then a second formula for the capacity of the heat channel based on average energy of the measured filter output signal is given. The result is interpreted in context of estimation theory and a parallel to a famous formula connecting mutual information with minimum mean-square error in Gaussian channels is presented.
On Non-reversible Markov Chains

Reversibility is a suucient but not necessary condition for Markov chains for use in Markov chain Monte Carlo simulation. It is necessary to select a Markov chain that has a pre-speciied distribution as its unique stationary distribution. There are many Markov chains that have such property. We give guidelines on how to rank them based on the asymptotic variance of the estimates they produce. Two questions are addressed. First, how to select a Markov chain among several non-reversible (or reversible) ones. Second, given a non-reversible Markov chain, is there a reversible one with the same (or better) performance?
Supporting fully adaptive routing in InfiniBand networks

InfiniBand is a new standard for communication between processing nodes and I/O devices as well as for interprocessor communication. The InfiniBand Architecture (IBA) supports distributed routing. However, routing in IBA is deterministic because forwarding tables store a single output port per destination ID. This prevents packets from using alternative paths when the requested output port is busy. Despite the fact that alternative paths could be selected at the source node to reach the same destination node, this is not effective enough to improve network performance. However, using adaptive routing could help to circumvent the congested areas in the network, leading to an increment in performance. In this paper, we propose a simple strategy to implement forwarding tables for IBA switches that support adaptive routing while still maintaining compatibility with the IBA specs. Adaptive routing can be enabled or disabled individually for each packet at the source node. Also, the proposed strategy enables the use in IBA of fully adaptive routing algorithms without using additional network resources to improve network performance. Evaluation results show that extending IBA switch capabilities with fully adaptive routing noticeably increases network performance. In particular, network throughput increases up to an average factor of 3.9.
Detecting Coarticulation in Sign Language using Conditional Random Fields

Coarticulation is one of the important factors that makes automatic sign language recognition a hard problem. Unlike in speech recognition, coarticulation effects in sign languages are over longer durations and simultaneously impact different aspects of the sign such as the hand shape, position, and movement. Due to this effect, the appearance of a sign, especially at the beginning and at the end, can be significantly different under different sentence contexts, which makes the recognition of signs in sentences hard. We advocate a two-step approach, where in the first step one segments the individual signs in a sentence and in the next step one recognizes the signs. In this work, we show how the first step, i.e. sign segmentation, can be performed effectively by using the conditional random fields (CRF) to directly detect the coarticulation points. The CRF approach does not make conditional independence assumptions about the observations and can be trained with fewer samples than hidden Markov models (HMMs). We validate our approach by demonstrating performance with American sign language (ASL) sentence level data and show that the CRF approach is 85% accurate in segmenting signs compared to 60% for the HMM approach at 0.1 false alarm rate
MAC layer impact on the performance of real-time cooperative positioning

This work analyzes the impact of medium access control (MAC) layer on the performance of real-time cooperative positioning in ad-hoc mobile wireless networks. The probability mass function (pmf) of the latency introduced by the MAC layer is here derived to assess the influence of MAC parameters on the latency and then operate on those to improve the positioning performance while reducing the number of position estimation iterations.
UML Model Refactoring as Refinement: A Coalgebraic Perspective

Although increasingly popular, Model Driven Architecture (MDA)still lacks suitable formal foundations on top of which rigorousmethodologies for the description, analysis and transformation ofmodels could be built. This paper aims to contribute in thisdirection: building on previous work by the authors on coalgebraicrefinement for software components and architectures, it discussesrefactoring of models within a coalgebraic semantic framework. Architectures are defined through aggregation based on a coalgebraic semantics for (subsets of)UML. On the other hand, such aggregations, no matter how large and complex they are, can always be dealt with ascoalgebras themselves. This paves the way to a discipline ofmodels' transformations which, being invariant under either behavioural equivalenceor refinement, are able to formally capture a large number of refactoring patterns. The main ideas underlying this research are presented through a detailed example in the context of refactoring of UML class diagrams.
VisTrees: fast indexes for interactive data exploration

Visualizations are arguably the most important tool to explore, understand and convey facts about data. As part of interactive data exploration, visualizations might be used to quickly skim through the data and look for patterns. Unfortunately, database systems are not designed to efficiently support these workloads. As a result, visualizations often take very long to produce, creating a significant barrier to interactive data analysis. In this paper, we focus on the interactive computation of histograms for data exploration. To address this issue, we present a novel multi-dimensional index structure called VisTree. As a key contribution, this paper presents several techniques to better align the design of multi-dimensional indexes with the needs of visualization tools for data exploration. Our experiments show that the VisTree achieves a speed increase of up to three orders of magnitude compared to traditional multi-dimensional indexes and enables an interactive speed of below 500ms even on large data sets.
Separation of Concerns in Semiformal Models for Software Specification by Combining Decomposition and Aspects

In this paper we investigate mechanisms for the separation of concerns in semiformal models for software specification. We identify the problems in two typical approaches (Structured Analysis and UML) and present the concepts for separation of concerns in A DORA, a specification language being developed in our research group. ADORA uses hierarchical decomposition of objects as a primary decomposition technique. However, it avoids the problems of a one-dimensional separation of concerns by flexibly combining this decomposition with arbitrary aspects, yielding “base + n concerns”-views of the specification.
A Whole-Food Plant-Based Diet Reversed Angina without Medications or Procedures

A 60-year-old man presented with typical angina and had a positive stress test. He declined both drug therapy and invasive testing. Instead, he chose to adopt a whole-food plant-based diet, which consisted primarily of vegetables, fruits, whole grains, potatoes, beans, legumes, and nuts. His symptoms improved rapidly, as well as his weight, blood pressure, and cholesterol levels. Plant-based diets have been associated with improved plasma lipids, diabetes control, coronary artery disease and with a reduction in mortality. Adoption of this form of lifestyle therapy should be among the first recommendations for patients with atherosclerosis.