Spermiogenesis in the amphilinidean cestode Amphilina foliacea (Rudolphi, 1819) was examined using transmission electron microscopy. The orthogonal development of the two flagella is followed by a flagellar rotation and their proximodistal fusion with the median cytoplasmic process. This process is accompanied by extension of both the mitochondrion and nucleus into the median cytoplasmic process. The two pairs of electron-dense attachment zones mark the lines where the proximodistal fusion of the median cytoplasmic process with the two flagella takes place. The intercentriolar body, previously undetermined in A. foliacea, is composed of three electron-dense and two electron-lucent plates. Also new for this species is the finding of electron-dense material in the apical region of the differentiation zone at the early stage of spermiogenesis, and the fact that two arching membranes appear at the base of the differentiation zone only when the two flagella rotate towards the median cytoplasmic process. The present data add more evidence for a close relationship between the Amphilinidea and the Eucestoda.
In this paper, we present a new type of attack on iterated chaotic ciphers using related keys. Based on the fact that a chaotic sequence is not sensitive to the less significant bits of initial conditions and parameters, a divide-and-conquer attack on iterated chaotic ciphers was presented by us before, which significantly reduces the computing complexity of attacks. However, if the information leaked is significant according to the distribution of the coincidence degrees, a measure for the information leakage of chaotic ciphers, or the size of the key is large, then it is difficult for the divide-and-conquer attack to reduce its computing complexity into a realizable level. The related-key attack we present in this paper simultaneously uses the information leaked from different chaotic sequences generated by related keys and combines the ideas of linear cryptanalysis and divide-and-conquer attack together, hence greatly enhances the efficiency of divide-and-conquer attack. As an example, we test the related-key attack on the ZLL chaotic cipher with a 64-bit key on a Pentium IV 2.5 GHz PC, which takes only 8 minutes and 45 seconds to recover all bits of the key successfully.
The subprime mortgage crisis and subsequent financial tsunami have raised considerable concerns about financial risk management and evaluation. This is nowhere more apparent than in new economic firms (NEFs) with large economic targets and heavy R&D expenses, such as firms in the electronics industries. With its potential for extreme growth and superior profitability, the electronic industries in Taiwan have been in the financial stock market spotlight. Recently, the relevance vector machine (RVM) was reported to have considerably less computation complexity than support vector machines (SVM) models, since it uses fewer kernel functions. Another emerging technique is rough set theory (RST), which derives rules from data. Based on the corporation life cycle theory (CLC), this study developed a relevance vector machine with rough set theory (RVMRS) to predict the status of a corporation in the decline stage. To demonstrate the performance of the designed RVMRS model, the study used electronic industries data from the Taiwan Economic Journal data bank, Taiwan Security Exchange, and Securities and Futures Institute in Taiwan. Experimental results revealed that the presented RVMRS model can predict the decline stage in a firm's life cycle with satisfactory accuracy, and generate rules for investors, managers, bankers and regulators that enable them to make suitable judgments. In addition, this study proved that the transparency and information disclosure index (TDI) is crucial to predicting the financial decline of corporations.
Let T be a tree, let u be its vertex. The branch weight b(u) of u is the maximum number of vertices of a branch of T at u. The set of vertices u of T in which b(u) attains its minimum is the branch weight centroid B(T) of T. For finite trees the present author proved that B(T) coincides with the median of T, therefore it consists of one vertex or of two adjacent vertices. In this paper we show that for infinite countable trees the situation is quite different.
We consider the half-linear second order differential equation which is viewed as a perturbation of the so-called Riemann-Weber half-linear differential equation. We present a comparison theorem with respect to the power of the half-linearity in the equation under consideration. Our research is motivated by the recent results published by J. Sugie, N. Yamaoka, Acta Math. Hungar. 111 (2006), 165–179.
M. Radulescu proved the following result: Let X be a compact Hausdorff topological space and π : C(X) → C(X) a supra-additive and supra-multiplicative operator. Then π is linear and multiplicative. We generalize this result to arbitrary topological spaces.
We study the behaviour of the $n$-dimensional centered Hardy-Littlewood maximal operator associated to the family of cubes with sides parallel to the axes, improving the previously known lower bounds for the best constants $c_n$ that appear in the weak type $(1,1)$ inequalities.
We consider the steady Navier-Stokes equations in a 2-dimensional unbounded multiply connected domain Ω under the general outflow condition. Let T be a 2-dimensional straight channel R × (−1, 1). We suppose that Ω ∩ {x1 < 0} is bounded and that Ω ∩ {x1 > −1} = T ∩ {x1 > −1}. Let V be a Poiseuille flow in T and µ the flux of V . We look for a solution which tends to V as x1 → ∞. Assuming that the domain and the boundary data are symmetric with respect to the x1-axis, and that the axis intersects every component of the boundary, we have shown the existence of solutions if the flux is small (Morimoto-Fujita [8]). Some improvement will be reported in this note. We also show certain regularity and asymptotic properties of the solutions.
Let $L(H)$ denote the algebra of all bounded linear operators on a separable infinite dimensional complex Hilbert space $H$ into itself. Given $A\in L(H)$, we define the elementary operator $\Delta _A\colon L(H)\longrightarrow L(H)$ by $\Delta _A(X)=AXA-X$. In this paper we study the class of operators $A\in L(H)$ which have the following property: $ATA=T$ implies $AT^{\ast }A=T^{\ast }$ for all trace class operators $T\in C_1(H)$. Such operators are termed generalized quasi-adjoints. The main result is the equivalence between this character and the fact that the ultraweak closure of the range of $\Delta _A$ is closed under taking adjoints. We give a characterization and some basic results concerning generalized quasi-adjoints operators.