A systematic method of designing TSC checker for Q class (even code length) of Borden’s code [l] is proposed, where a modular approach is used. In a comparative study, it is found that the proposed method is much better than [2,3] and it has a larger capability than [4,5] in designing the checker. For instance, the 3/12 code in C(12,2) can be identified in one of four ways, corresponding to PT’...

Synthesis of the purine ring is a central metabolic function of all cells. The products, AMP and GMP, provide purine bases for DNA and RNA, as well as for a number of essential coenzymes (NAD, NADP, FAD, and coenzyme A) and signaling molecules (e.g. cAMP; Fig. 1). ATP serves as the energy source for many chemical reactions. In addition, in plants, the nucleotides are the precursors for purine a...

The term “e-government” largely implies the use of interactive websites, but the bigger picture includes a broad range of emerging technologies such as SMS, smartphones and smartcards, and many also include the use of the telephone, as it allows remote (and sometimes automated) interaction. E-government also brings with it broad range of issues such as user authentication, personal security and...

It is a well known fact that if C is an [n, k, d] formally self-dual even code with n > 30, then d ≤ 2[n/8]. A formally self-dual even code with d = 2[n/8] is called nearextremal. Kim and Pless [9] conjecture that there does not exist a near-extremal formally self dual even (not Type II) code of length n ≥ 48 with 8|n. In this paper, we prove that if n ≥ 72 and 8|n, then there is no near-extrem...

A detailed discussion of the point in polygon problem for arbitrary polygons is given. Two concepts for solving this problem are known in literature: the even-odd rule and the winding number, the former leading to ray-crossing, the latter to angle summation algorithms. First we show by mathematical means that both concepts are very closely related, thereby developing a first version of an algor...