Abstract: A retrospective study was undertaken to record the
occurrence and pattern of fractures in small animals (dogs and cats)
from year 2005 to 2010. A total of 650 cases were presented in small
animal surgery unit out of which of 116 (dogs and cats) were
presented with history of fractures of different bones. A total of
17.8% (116/650) cases were of fractures which constituted dogs 67%
while cats were 23%. The majority of animals were intact. Trauma in
the form of road side accident was the principal cause of fractures in
dogs whereas as in cats it was fall from height. The ages of the
fractured dog ranged from 4 months to 12 years whereas in cat it was
from 4 weeks to 10 years. The femoral fractures represented 37.5%
and 25% respectively in dogs and cats. Diaphysis, distal metaphyseal
and supracondylar fractures were the most affected sites in dog and
cats. Tibial fracture in dogs and cats represented 21.5% and 10%
while humoral fractures were 7.9% and 14% in dogs and cats
respectively. Humoral condyler fractures were most commonly seen
in puppies aged 4 to 6 months. Fractured radius-ulna incidence was
19% and 14% in dogs and cats respectively. Other fractures recorded
were of lumbar vertebrae, mandible and metacarpals etc. The
management comprised of external and internal fixation in both the
species. The most common internal fixation technique employed was
Intramedullary fixation in long followed by other methods like stack
or cross pinning, wiring etc as per findings in the cases. The cast
bandage was used majorly as mean for external coaptation. The
paper discusses the outcome of the case as per the technique
employed.
Abstract: The study of proteomics reached unexpected levels of
interest, as a direct consequence of its discovered influence over some
complex biological phenomena, such as problematic diseases like
cancer. This paper presents the latest authors- achievements regarding
the analysis of the networks of proteins (interactome networks), by
computing more efficiently the betweenness centrality measure. The
paper introduces the concept of betweenness centrality, and then
describes how betweenness computation can help the interactome net-
work analysis. Current sequential implementations for the between-
ness computation do not perform satisfactory in terms of execution
times. The paper-s main contribution is centered towards introducing
a speedup technique for the betweenness computation, based on
modified shortest path algorithms for sparse graphs. Three optimized
generic algorithms for betweenness computation are described and
implemented, and their performance tested against real biological
data, which is part of the IntAct dataset.
Abstract: In this paper, a new reversible watermarking method is presented that reduces the size of a stereoscopic image sequence while keeping its content visible. The proposed technique embeds the residuals of the right frames to the corresponding frames of the left sequence, halving the total capacity. The residual frames may result in after a disparity compensated procedure between the two video streams or by a joint motion and disparity compensation. The residuals are usually lossy compressed before embedding because of the limited embedding capacity of the left frames. The watermarked frames are visible at a high quality and at any instant the stereoscopic video may be recovered by an inverse process. In fact, the left frames may be exactly recovered whereas the right ones are slightly distorted as the residuals are not embedded intact. The employed embedding method reorders the left frame into an array of consecutive pixel pairs and embeds a number of bits according to their intensity difference. In this way, it hides a number of bits in intensity smooth areas and most of the data in textured areas where resulting distortions are less visible. The experimental evaluation demonstrates that the proposed scheme is quite effective.
Abstract: The join dependency provides the basis for obtaining
lossless join decomposition in a classical relational schema. The
existence of Join dependency shows that that the tables always
represent the correct data after being joined. Since the classical
relational databases cannot handle imprecise data, they were
extended to fuzzy relational databases so that uncertain, ambiguous,
imprecise and partially known information can also be stored in
databases in a formal way. However like classical databases, the
fuzzy relational databases also undergoes decomposition during
normalization, the issue of joining the decomposed fuzzy relations
remains intact. Our effort in the present paper is to emphasize on this
issue. In this paper we define fuzzy join dependency in the
framework of type-1 fuzzy relational databases & type-2 fuzzy
relational databases using the concept of fuzzy equality which is
defined using fuzzy functions. We use the fuzzy equi-join operator
for computing the fuzzy equality of two attribute values. We also
discuss the dependency preservation property on execution of this
fuzzy equi- join and derive the necessary condition for the fuzzy
functional dependencies to be preserved on joining the decomposed
fuzzy relations. We also derive the conditions for fuzzy join
dependency to exist in context of both type-1 and type-2 fuzzy
relational databases. We find that unlike the classical relational
databases even the existence of a trivial join dependency does not
ensure lossless join decomposition in type-2 fuzzy relational
databases. Finally we derive the conditions for the fuzzy equality to
be non zero and the qualification of an attribute for fuzzy key.