Rupture of the cranial cruciate ligament associated with deformity of the proximal tibia in five dogs

Excessive mechanical stress due to caudal sloping of the tibial plateau may result In early breakdown of the cranial cruciate ligament (CrCL). Five dogs with CrCL rupture associated with caudal sloping of the proximal tibial plateau are described. All were small dogs, of between three and six years of age, with a mean bodyweight of 9.3 kg, which had acute hindlimb lameness. Radiographic examination revealed cranial displacement of the tibia, with a tibial angle varying from 58 to 60 degrees. All cases were treated with a lateral fabellotibial suture and cranial cuneiform osteotomy of the proximal tibia. All dogs were using the operated limb three days after surgery, with normal gait re-established after a mean period of 10 days. Excessive tibial plateau sloping is not a frequent cause of hindlimb lameness In small animals, although it Is Important to consider it as a predisposing factor for rupture of the CrCL.

Search schemes for random optimization algorithms that preserve the asymptotic distribution

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case.

Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System

In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.

Allocation of protective devices in distribution circuits using nonlinear programming models and genetic algorithms

The optimized allocation of protective devices in strategic points of the circuit improves the quality of the energy supply and the system reliability index. This paper presents a nonlinear integer programming (NLIP) model with binary variables, to deal with the problem of protective device allocation in the main feeder and all branches of an overhead distribution circuit, to improve the reliability index and to provide customers with service of high quality and reliability. The constraints considered in the problem take into account technical and economical limitations, such as coordination problems of serial protective devices, available equipment, the importance of the feeder and the circuit topology. The use of genetic algorithms (GAs) is proposed to solve this problem, using a binary representation that does (1) or does not (0) show allocation of protective devices (reclosers, sectionalizers and fuses) in predefined points of the circuit. Results are presented for a real circuit (134 busses), with the possibility of protective device allocation in 29 points. Also the ability of the algorithm in finding good solutions while improving significantly the indicators of reliability is shown. (C) 2003 Elsevier B.V. All rights reserved.

Luxação aguda isolada da articulação tibiofibular proximal

A luxação traumática isolada da articulação tibiofibular proximal é rara. Esta lesão pode não ser reconhecida ou diagnosticada no atendimento inicial. A ausência de suspeita clínica pode causar problemas para o diagnóstico. O diagnóstico necessita de história precisa do mecanismo e sintomas da lesão, avaliação clínica e radiográfica adequada de ambos joelhos. Casos não reconhecidos são fonte de alterações crônicas. O tratamento é feito por redução fechada e imobilização ou, em casos irredutíveis ou instáveis, redução aberta com fixação interna temporária. Um caso raro de luxação tibiofibular proximal isolada em um jogador de basquetebol é relatado para ilustrar essa lesão.

Impact of proximal cytoplasmic droplets on quality traits and in-vitro embryo production efficiency of cryopreserved bull spermatozoa

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

alpha(1)-Adrenoceptors in proximal segments of tail arteries from control and reserpinised rats

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Effects of meal size and proximal-distal segmentation on gastric activity

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Using Amino Acid Correlation and Community Detection Algorithms to Identify Functional Determinants in Protein Families

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Efeitos do treinamento físico sobre a resistência mecânica do terço proximal do fêmur de ratos

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Use of genetic algorithms and solvation potential to study peptides structure

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains and implicit solvation potential are used to optimize the tertiary structure of peptides. We starting from the known PDB structure of its backbone which is kept fixed while the side chains allowed adopting the conformations present in the rotamer library. It was used rotamer library independent of backbone and a implicit solvation potential. The structure of Mastoporan-X was predicted using several force fields with a growing complexity; we started it with a field where the only present interaction was Lennard-Jones. We added the Coulombian term and we considered the solvation effects through a term proportional to the solvent accessible area. This paper present good and interesting results obtained using the potential with solvation term and rotamer library. Hence, the algorithm (called YODA) presented here can be a good tool to the prediction problem. (c) 2007 Elsevier B.V. All rights reserved.

ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.