The objective of the presented study is to introduce analysis the black-white pixels ratio in medial temporal lobe (MTL) brain structure in digitized transcranial B-images using our developed software B-MODE Assist. T...
ISBN:
(数字)9789532900996
ISBN:
(纸本)9781728175386
The objective of the presented study is to introduce analysis the black-white pixels ratio in medial temporal lobe (MTL) brain structure in digitized transcranial B-images using our developed software B-MODE Assist. This ratio could be a significant marker related to the echogenicity grade. In B-image, the MTL is stable anechogenic structure but increased echogenicity of surrounding cortex is detectable in the case of MTL atrophy; the atrophy predicts Alzheimer's Disease. Within this study, a set of 97 B-images is used. There are two key goals of this pilot study; verify the reproducibility of the ratio between two observers and to show that the ratio is not much different in the case of original image in comparison with a magnified segment and using constant brightness increasing; the ratio should be independent on image resolution and brightness. To select medial temporal lobe structure, a 20mm square-shaped Region of Interest is used. The correlation coefficient r=0.69 was achieved between two independent, non-experienced observers. The error does not exceed 28 % between 2 non-experienced observers and does not exceed 12 % between the measurements from the same observer. Also, the variance and the range were computed. Achieved results have been judged by an experienced sonographer. In the future, the ratio could be an effective value to determine the MTL atrophy based on the ratio value and possibility to create a rule-based expert system which should help evaluate probability of Alzheimer's Disease based on the cortex echogenicity grade. In general, this approach could be a reliable way to detect risk of Alzheimer's Disease using neurosonological imaging.
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-pot...
详细信息
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.< >
Let B be a set of n unit balls in 3. We show that the combinatorial complexity of the space of lines in 3 that avoid all the balls of B is O(n3+Ε), for any Ε > 0. This result has connections to problems in visibi...
详细信息
Let B be a set of n unit balls in 3. We show that the combinatorial complexity of the space of lines in 3 that avoid all the balls of B is O(n3+Ε), for any Ε > 0. This result has connections to problems in visibility, ray shooting, motion planning and geometric optimization.
Three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort...
详细信息
Three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort. A homogeneous cluster of workstations has been used to compare the algorithms implemented. The MPI library has been selected to establish the communication and synchronization between the processors. The time complexity for each parallel sorting algorithm will also be mentioned and analyzed.
We show that the reachability problem over directed planar graphs can be solved simultaneously in polynomial time and approximately O(√n) space. In contrast, the best space bound known for the reachability problem on...
详细信息
We show that the reachability problem over directed planar graphs can be solved simultaneously in polynomial time and approximately O(√n) space. In contrast, the best space bound known for the reachability problem on general directed graphs with polynomial running time is O(n/2√ log n ).
Until recently, it was commonly accepted that most genetic information is transacted by proteins. Recent evidence suggests that the majority of the genomes of mammals and other complex organisms are in fact transcribe...
详细信息
In this paper, we present a implicit encoding technique that makes use of lower-layer packet reordering to superimpose covert messages onto a reliable data stream. In particular, since the TCP layer provides a reliabl...
详细信息
In this paper, we present a implicit encoding technique that makes use of lower-layer packet reordering to superimpose covert messages onto a reliable data stream. In particular, since the TCP layer provides a reliable in-order data stream over the unreliable network layerpsilas IP datagram service, we can encode covert messages by artificially permuting IP packets before they leave the source and reading the permutation at the destination prior to delivering the payload to TCP. Applying such permutations will not adversely affect TCPpsilas ability to reconstitute the transport layer data stream, since TCP is designed to be robust against out of order network layer packet delivery. We describe the design and operation of PERMEATE, an open-source covert channel toolkit which implements such a permutational covert channel over TCP, and we provide a quantitative assessment of itpsilas efficacy and efficiency as a covert channel.
The cutting triangular cycles of lines in space were investigated. It was shown that a collection of lines in 3-space can be cut into a subquadratic number of pieces, such that all depth cycles defined by triples of l...
详细信息
The cutting triangular cycles of lines in space were investigated. It was shown that a collection of lines in 3-space can be cut into a subquadratic number of pieces, such that all depth cycles defined by triples of lines are eliminated. A long-standing open problem in computational geometry, motivated by hidden-surface removal in computer graphics, was solved.
A common technique for modeling complex systems in many computational engineering domains is the finite element method. Analyzing these systems using the finite element method involves the application of time consumin...
详细信息
暂无评论