Unipedal balance is affected by lower extremity joint arthroplasty procedure 1 year following surgery.

Lower Extremity Joint Arthroplasty (LEJA) surgery is an effective way to alleviate painful osteoarthritis. Unfortunately, these surgeries do not normalize the loading asymmetry during the single leg stance phase of gait. Therefore, we examined single leg balance in 234 TJA patients (75 hips, 65 knees, 94 ankles) approximately 12 months following surgery. Patients passed if they maintained single leg balance for 10s with their eyes open. Patients one year following total hip arthroplasty (THA-63%) and total knee arthroplasty (TKA-69%) had similar pass rates compared to a total ankle arthroplasty (TAA-9%). Patients following THA and TKA exhibit better unilateral balance in comparison with TAA patients. It may be beneficial to include a rigorous proprioception and balance training program in TAA patients to optimize functional outcomes.

Preliminary experience of ovarian tissue cryopreservation procedure: alternatives, perspectives and feasibility

Chemotherapy and radiotherapy induce premature ovarian failure in many patients treated for oncological or benign diseases. The present paper reviews the risk of developing premature ovarian failure according to the type of treatment and the different options to preserve fertility, focusing on the cryopreservation of ovarian tissue. This technique constitutes a promising approach to preserve the fertility of young patients and offers the advantage of storing a large number of follicles that could be subsequently transplanted or cultured in vitro to obtain mature oocytes. Based on 34 requests, from which 19 were performed, the feasibility of the ovarian cryopreservation procedure is evaluated. The medical and ethical approaches of this protocol are also discussed. Cryopreservation of ovarian tissue constitutes new hope for many patients, but must still be kept for selected cases, with a significant risk of premature ovarian failure after treatments such as bone marrow transplantation.

Correction for Eddy Current-Induced Echo-Shifting Effect in Partial-Fourier Diffusion Tensor Imaging.

In most diffusion tensor imaging (DTI) studies, images are acquired with either a partial-Fourier or a parallel partial-Fourier echo-planar imaging (EPI) sequence, in order to shorten the echo time and increase the signal-to-noise ratio (SNR). However, eddy currents induced by the diffusion-sensitizing gradients can often lead to a shift of the echo in k-space, resulting in three distinct types of artifacts in partial-Fourier DTI. Here, we present an improved DTI acquisition and reconstruction scheme, capable of generating high-quality and high-SNR DTI data without eddy current-induced artifacts. This new scheme consists of three components, respectively, addressing the three distinct types of artifacts. First, a k-space energy-anchored DTI sequence is designed to recover eddy current-induced signal loss (i.e., Type 1 artifact). Second, a multischeme partial-Fourier reconstruction is used to eliminate artificial signal elevation (i.e., Type 2 artifact) associated with the conventional partial-Fourier reconstruction. Third, a signal intensity correction is applied to remove artificial signal modulations due to eddy current-induced erroneous T2(∗) -weighting (i.e., Type 3 artifact). These systematic improvements will greatly increase the consistency and accuracy of DTI measurements, expanding the utility of DTI in translational applications where quantitative robustness is much needed.

Visual imagery in autobiographical memory: The role of repeated retrieval in shifting perspective.

Recent memories are generally recalled from a first-person perspective whereas older memories are often recalled from a third-person perspective. We investigated how repeated retrieval affects the availability of visual information, and whether it could explain the observed shift in perspective with time. In Experiment 1, participants performed mini-events and nominated memories of recent autobiographical events in response to cue words. Next, they described their memory for each event and rated its phenomenological characteristics. Over the following three weeks, they repeatedly retrieved half of the mini-event and cue-word memories. No instructions were given about how to retrieve the memories. In Experiment 2, participants were asked to adopt either a first- or third-person perspective during retrieval. One month later, participants retrieved all of the memories and again provided phenomenology ratings. When first-person visual details from the event were repeatedly retrieved, this information was retained better and the shift in perspective was slowed.

A new inversion procedure for confocal scanning microscopy and other bandlimited signal processing problems

We find a simple analytic expression for the inverse of an infinite matrix related to the problem of data reduction in confocal scanning microscopy and other band-limited signal processing problems. Potential applications of this result to practical problems are outlined. The matrix arises from a sampling expansion approach to the integral equation.

Is intracytoplasmic sperm injection (ICSI) a safe procedure: What do we learn first trimester data in ICSI pregnancies ?

info:eu-repo/semantics/nonPublished

Description of a procedure to identify strategies: The case of the tiles problem

In this paper we present a procedure to describe strategies in problems which can be solved using inductive reasoning. This procedure is based on some aspects of the analysis of the specific subject matter, concretely on the elements, the representation systems and the transformations involved. We show an example of how we used this procedure for the tiles problem. Finally we present some results and conclusions.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

The paper considers the job shop scheduling problem to minimize the makespan. It is assumed that each job consists of at most two operations, one of which is to be processed on one of m⩾2 machines, while the other operation must be performed on a single bottleneck machine, the same for all jobs. For this strongly NP-hard problem we present two heuristics with improved worst-case performance. One of them guarantees a worst-case performance ratio of 3/2. The other algorithm creates a schedule with the makespan that exceeds the largest machine workload by at most the length of the largest operation.

An open shop scheduling problem with a non-bottleneck machine

This paper considers the problem of processing n jobs in a two-machine non-preemptive open shop to minimize the makespan, i.e., the maximum completion time. One of the machines is assumed to be non-bottleneck. It is shown that, unlike its flow shop counterpart, the problem is NP-hard in the ordinary sense. On the other hand, the problem is shown to be solvable by a dynamic programming algorithm that requires pseudopolynomial time. The latter algorithm can be converted into a fully polynomial approximation scheme that runs in time. An O(n log n) approximation algorithm is also designed whi finds a schedule with makespan at most 5/4 times the optimal value, and this bound is tight.

Two-stage open shop scheduling with a bottleneck machine

It is known that for the open shop scheduling problem to minimize the makespan there exists no polynomial-time heuristic algorithm that guarantees a worst-case performance ratio better than 5/4, unless P6≠NP. However, this result holds only if the instance of the problem contains jobs consisting of at least three operations. This paper considers the open shop scheduling problem, provided that each job consists of at most two operations, one of which is to be processed on one of the m⩾2 machines, while the other operation must be performed on the bottleneck machine, the same for all jobs. For this NP-hard problem we present a heuristic algorithm and show that its worst-case performance ratio is 5/4.