اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTheory of Rule 6 and its Application to Round Robin Tournament
295
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we have used one 2 variable Boolean function called Rule 6 to define another beautiful transformation named as Extended Rule-6. Using this function we have explored the algebraic beauties and its application to an efficient Round Robin Tournament (RRT) routine for 2k (k is any natural number) number of teams. At the end, we have thrown some light towards any number of teams of the form nk where n, k are natural numbers.
قيم البحث
اقرأ أيضاً
In this paper the theory of Carry Value Transformation (CVT) is designed and developed on a pair of n-bit strings and is used to produce many interesting patterns. One of them is found to be a self-similar fractal whose dimension is same as the dimen
sion of the Sierpinski triangle. Different construction procedures like L-system, Cellular Automata rule, Tilling for this fractal are obtained which signifies that like other tools CVT can also be used for the formation of self-similar fractals. It is shown that CVT can be used for the production of periodic as well as chaotic patterns. Also, the analytical and algebraic properties of CVT are discussed. The definition of CVT in two-dimension is slightly modified and its mathematical properties are highlighted. Finally, the extension of CVT and modified CVT (MCVT) are done in higher dimensions.
A circle graph is a graph in which the adjacency of vertices can be represented as the intersection of chords of a circle. The problem of calculating the chromatic number is known to be NP-complete, even on circle graphs. In this paper, we propose a
new integer linear programming formulation for a coloring problem on circle graphs. We also show that the linear relaxation problem of our formulation finds the fractional chromatic number of a given circle graph. As a byproduct, our formulation gives a polynomial-sized linear programming formulation for calculating the fractional chromatic number of a circle graph. We also extend our result to a formulation for a capacitated stowage stack minimization problem.
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Many of the QKD protocols that were introduced in the past involve the challenge of monitoring the signal disturbance over the communication l
ine, in order to evaluate the information leakage to a potential eavesdropper. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. Here, we propose a new version of this so-called round-robin differential phase-shifting (RRDPS) protocol, in which both time and phase degrees-of-freedom are utilized to enlarge the Hilbert space dimensionality, without increasing experimental complexity or relaxing security assumptions. We derive the security proofs of the round-robin differential phase-time-shifting (RRDPTS) protocol in the collective attack scenario and benchmark the new protocol against RRDPS for different experimental parameters. Furthermore, a proof-of-concept experiment of the RRDPTS protocol, using weak coherent pulses and decoy-state method, is demonstrated over 80 km of fiber link. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
Fast and accurate performance analysis techniques are essential in early design space exploration and pre-silicon evaluations, including software eco-system development. In particular, on-chip communication continues to play an increasingly important
role as the many-core processors scale up. This paper presents the first performance analysis technique that targets networks-on-chip (NoCs) that employ weighted round-robin (WRR) arbitration. Besides fairness, WRR arbitration provides flexibility in allocating bandwidth proportionally to the importance of the traffic classes, unlike basic round-robin and priority-based arbitration. The proposed approach first estimates the effective service time of the packets in the queue due to WRR arbitration. Then, it uses the effective service time to compute the average waiting time of the packets. Next, we incorporate a decomposition technique to extend the analytical model to handle NoC of any size. The proposed approach achieves less than 5% error while executing real applications and 10% error under challenging synthetic traffic with different burstiness levels.
Zahns theory of dynamical tides is analyzed critically. We compare the results of this theory with our numerical calculations for stars with a convective core and a radiative envelope and with masses of one and a half and two solar masses. We show th
at for a binary system consisting of stars of one and a half or two solar masses and a point object with a mass equal to the solar mass and with an orbital period of one day under the assumption of a dense spectrum and moderately rapid dissipation, the evolution time scales of the semimajor axis will be shorter than those in Zahns theory by several orders of magnitude
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
