Myxobolus allami sp. n. is described from the intestinal wall of the silvery black porgy, Sparidentex hasta (Valenciennes), off Saudi Arabian coast of Arabian Gulf. Two of 20 examined fish were found to be infected with irregular-shaped plasmodia 3-8 mm long × 2-3 mm wide. Mature myxospores are subspherical to elliptical in the valvular view and oval in the sutural view, and are 11-13 (12) µm long, 7-8 (7.5) µm wide and 10-12 (10.8) µm thick. Spores have relatively thin valves and mostly (~ 72%) end with short caudal appendages of ~3 µm long. The spores also have two polar capsules, which are oval to elliptical and measure 5-7 (5.7) µm in length and 2-3 (2.7) µm in width. Polar filaments are coiled, with three turns. Transmission electron microscopy revealed that caudal appendages originated from the sutural edge at the posterior pole of the myxospore with density similar to that of its valves. The SSU rRNAgene sequence of the present species does not match any available sequences in GenBank. Phylogenetically, this species is sister to Myxobolus khaliji Zhang, Al-Qurausihy et Abdel-Baki, 2014 within a well-supported clade of Myxobolus-Henneguya with species infecting marine fishes. The combination of molecular data and morphological differences between this and other species of Myxobolus Bütschli, 1882 lead us to propose that the present form be established as a new species, M. allami. The present study also provides more evidence for the idea that caudal appendages cannot be reliably used to distinguish the species of the genera Myxobolus and Henneguya Thélohan, 1892.
A new nematode, Dichelyne alatae sp. n., is described on the basis of the worms recovered from the intestine of the whiting, Sillaginopsis panijus (Perciformes: Sillaginidae) from the estuary of the river Hooghly at Kalyani, West Bengal, India. Dichelyne alatae differs from congeners in having a small body size, deirids posterior to the oesophagus, short and wide caudal alae at the level of cloacal opening, unequal, alate spicules, a shield-shaped gubemaculum, a different number of caudal papillae and a conical tail with spines in its distal region.
Neural networks have shown good results for detecting a certain pattern in a given image. In this paper, faster neural networks for pattern detection are presented. Such processors are designed based on cross correlation in the frequency domain between the input matrix and the input weights of neural networks. This approach is developed to reduce the computation steps required by these faster neural networks for the searching process. The principle of divide and conquer strategy is applied through matrix decomposition. Each matrix is divided into submatrices small in size, and then each one is tested separately by using a single faster neural processor. Furthermore, faster pattern detection is obtained by using parallel processing techniques to test the resulting submatrices at the same time, employing the same number of faster neural networks. In contrast to faster neural networks, the speed-up ratio is increased with the size of the input matrix when using faster neural networks and matrix decomposition. Moreover, the problem of local submatrix normalization in the frequency domain is solved. The effect of matrix normalization on the speed-up ratio of pattern detection is discussed. Simulation results show that local submatrix normalization through weight normalization is faster than submatrix normalization in the spatial domain. The overall speed-up ratio of the detection process is increased as the normalization of weights is done offline.
Together with the development of peritoneal dialysis (PD), appropriate animal models play an important role in the investigation of physiological, pathophysiological and clinical aspects of PD. However, there is still not an ideal experimental PD animal model. In this study, 45 Sprague-Dawley rats were divided into three groups. Grou p 1 (n=15) was receiving daily peritoneal injection through the catheter connected to the abdominal cavity, using PD solution containing 3.86 % D-glucose. Group 2 (n=15) was receiving daily peritoneal injection of 0.9 % physiological saline through a catheter. Group 3 (n=15), which was subjected to sham operation, served as controls. Our results showed that WBC counts in peritoneal effluent of Group 1 were slightly higher than those of Group 2 and control group, respectively (p<0.05). However, there was no episode of infection in any group. In addition, there was no significant difference in neutrophils fractions among these three groups. Hematoxylin-eosin and Masson’s trichrome staining demonstrated a dramatic increase in thickness of the mesothelium-to-muscle layer of peritoneum exposed to high glucose (Group 1) compared to Group 2 and controls (p<0.01). These data indicated that we established a novel rat model of PD with a modified catheter insertion method. This model is more practical, easy to operate, not too expensive and it will facilitate the investigate of long-term effects of PD., Y.-M. Peng ... [et al.]., and Obsahuje bibliografii a bibliografické odkazy
A new model for propagation of long waves including the coastal area is introduced. This model considers only the motion of the surface of the sea under the condition of preservation of mass and the sea floor is inserted into the model as an obstacle to the motion. Thus we obtain a constrained hyperbolic free-boundary problem which is then solved numerically by a minimizing method called {\em the discrete Morse semi-flow}. The results of the computation in 1D show the adequacy of the proposed model.
An original Nyquist-based frequency domain robust decentralized controller (DC) design technique for robust stability and guaranteed nominal performance is proposed, applicable for continuous-time uncertain systems described by a set of transfer function matrices. To provide nominal performance, interactions are included in individual design using one selected characteristic locus of the interaction matrix, used to reshape frequency responses of decoupled subsystems; such modified subsystems are termed "equivalent subsystems". Local controllers of equivalent subsystems independently tuned for stability and specified feasible performance constitute the decentralized controller guaranteeing specified performance of the full system. To guarantee robust stability, the M−Δ stability conditions are derived. Unlike standard robust approaches, the proposed technique considers full nominal model, thus reducing conservativeness of resulting robust stability conditions. The developed frequency domain design procedure is graphical, interactive and insightful. A case study providing a step-by-step robust DC design for the Quadruple Tank Process [K.H. Johansson: Interaction bounds in multivariable control systems. Automatica 38 (2002), 1045-1051] is included.
Community detection algorithms help us improve the management of complex networks and provide a clean sight of them. We can encounter complex networks in various fields such as social media, bioinformatics, recommendation systems, and search engines. As the definition of the community changes based on the problem considered, there is no algorithm that works universally for all kinds of data and network structures. Communities can be disjointed such that each member is in at most one community or overlapping such that every member is in at least one community. In this study, we examine the problem of finding overlapping communities in complex networks and propose a new algorithm based on the similarity of neighbors. This algorithm runs in O(mlgm) running time in the complex network containing m number of relationships. To compare our algorithm with existing ones, we select the most successful four algorithms from the Community Detection library (CDlib) by eliminating the algorithms that require prior knowledge, are unstable, and are time-consuming. We evaluate the successes of the proposed algorithm and the selected algorithms using various known metrics such as modularity, F-score, and Normalized Mutual Information. In addition, we adapt the coverage metric defined for disjoint communities to overlapping communities and also make comparisons with this metric. We also test all of the algorithms on small graphs of real communities. The experimental results show that the proposed algorithm is successful in finding overlapping communities.