The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or di...
详细信息
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O (n log(2) n). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O (n(2)) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time.
In this paper a general technique for reducing processors in simulation without ang increase in time is described. This results in an O(root log n) time algorithm for simulating one step of PRIORITY on TOLERANT with p...
详细信息
In this paper a general technique for reducing processors in simulation without ang increase in time is described. This results in an O(root log n) time algorithm for simulating one step of PRIORITY on TOLERANT with processor-time product of O(nloglog n);the same as that for simulating PRIORITY on ARBITRARY. This is used to obtain an O(log n/loglog n + root log n(loglog m - loglog n)) time algorithm for sorting n integers from the set (O,...,m - 1), m greater than or equal to n, with a processor-time product of O(n log log m log log n) on a TOLERANT CRCW PRAM. New upper and lower bounds for ordered chaining problem on an allocated COMMON CRCW model are also obtained. The algorithm for ordered chaining takes O(log n/loglog n) time on an allocated PRAM of size n. It is shown that this result is best possible (upto a constant multiplicative factor) by obtaining a lower bound of Omega(rlog n/(log r + loglog n)) for finding the first (leftmost one) live processor on an allocated-COMMON PRAM of size n of r-slow virtual processors (one processor simulates r processors of allocated PRAM). As a result, for ordered chaining problem, ''processor-time product'' has to be at least Omega(nlog n/loglog n) for any poly-logarithmic time algorithm. algorithm for ordered-chaining problem results in an O(log N/loglog N) time algorithm for (stable) sorting of n integers from the set (0,..., m - 1) with n-processors on a COMMON CRCW PRAM;here N = max(n, m). In particular if, m = n(O(1)), then sorting takes Theta(log n/loglog n) time on both TOLERANT and COMMON CRCW PRAMs. Processor-time product for TOLERANT is O(n(loglog n)(2)). algorithm for COMMON uses n processors.
In this paper, we have developed an algorithm that proposes advance and novice security mechanism that can defend any kind of attacks and is advantageous over the other existing algorithms that are currently being use...
详细信息
ISBN:
(纸本)9781538630457
In this paper, we have developed an algorithm that proposes advance and novice security mechanism that can defend any kind of attacks and is advantageous over the other existing algorithms that are currently being used in security areas like email and web-based security applications. This algorithm is based on the concept of time in analog clock. The most powerful feature of this algorithm is 10506 (permutation of substitution clock). We implemented this algorithm in python. And after verification and validation we found out that it is impossible to crack by any kind of tool in existence. We are looking forward to use this algorithm in various applications.
At previous PTTI meeting, PTTI'17, we mentioned that VNIIFTRI has got four Rb fountain frequency standards, which run as frequency standards, not clocks. These instruments are not intended for secondary presentati...
详细信息
ISBN:
(纸本)9781538656204
At previous PTTI meeting, PTTI'17, we mentioned that VNIIFTRI has got four Rb fountain frequency standards, which run as frequency standards, not clocks. These instruments are not intended for secondary presentation of the time unit the second SI. These are indeed very stable frequency reference without frequency drift inherent, for example, to H-masers. During last year output frequency of these standards has been calibrated against operational CsF02 primary fountain frequency standard and now one may use these instruments as time and frequency unit keepers. This report will present preliminary results of the first experiments on application of Rb fountain frequency standards for maintenance the national atomic time scale TA(SU). According internal regulation TA(SU) is independent atomic time scale with the unit of time the second SU, reproduced by operational primary Cs fountain frequency standards. This time scale by-turn is maintained by ensemble of continuously operating high stable hydrogen masers. On other hand, each H-maser demonstrates more or less predictable frequency drift the value of which may be quite comparable to daily H-maser frequency stability. That is why one has times to times re-evaluate H-maser output frequency parameters. The more often one will re-evaluate H-maser output frequency parameters the more stable and accurate (in sense unit of time the second SU) time scale will be produced. The key problem is interruptible Cs standard mode of operation. Typically, Cs standard produces two or three sessions per month, but sometimes happens gaps for some months. In such cases availability of more or less continuously operating stable and none drifting frequency reference such as Rb fountain frequency standards may be a solution of the problem. The paper presents comparisons of some scenarios of TA(SU) maintenance: a. purely based on H-maser ensemble and primary Cs fountain frequency standards data and b. based on H-maser ensemble and Rb fountain f
We study a set of scheduling problems in a distributed flow-shop scheduling system consisting of several flow-shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factori...
详细信息
We study a set of scheduling problems in a distributed flow-shop scheduling system consisting of several flow-shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factories, and to devise a job schedule for each of the factories such that the weighted number of jobs completed in just-in-time mode is maximized. We classify computational complexity of the problems, including the special cases of unit weights and job- or machine-independent processing times.
In this paper, we have developed an algorithm that proposes advance and novice security mechanism that can defend any kind of attacks and is advantageous over the other existing algorithms that are currently being use...
详细信息
In this paper, we have developed an algorithm that proposes advance and novice security mechanism that can defend any kind of attacks and is advantageous over the other existing algorithms that are currently being used in security areas like email and web-based security applications. This algorithm is based on the concept of time in analog clock. The most powerful feature of this algorithm is 10~(506) (permutation of substitution clock). We implemented this algorithm in python. And after verification and validation we found out that it is impossible to crack by any kind of tool in existence. We are looking forward to use this algorithm in various applications.
暂无评论