Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively re-constructing intermediate WAP-trees, starting with their suffix subsequences. This paper proposes an efficient approach for using the preorder linked WAP-trees...

A large number of choices exist when designing a reliable memory system. The choices range from simple replication to complex error control codes (ECC). An intermediate solution is to use combination of replication and simple ECC. Such a system consists of multiple memory modules, data stored in each module being encoded using an ECC. This paper compares reliability of memory systems formed usi...

The significance of the seismic rotational components have been overlooked in the seismic evaluation of structural behavior. As researchers have measured seismic components more accurately using sensitive rotational velocity sensor, it was observed that the magnitude of rotational components is considerable and could not be neglected. Hence, some parts of seismic damage or failure of structures...

T-Codes are a class of variable-length codes. Their self-synchronisation properties are useful in compression and communication applications where error recovery rather than error correction is at issue, for example, in digital telephony. T-Codes may be used without error correction or additional synchronisation mechanisms. Typically, the representation of variable-length codes is a problem in ...

In this study, a frame work for verification of famous seismic codes is utilized. To verify the seismic codes performance, damage quantity of RC frames is compared with the target performance. Due to the randomness property of seismic design and earthquake loads excitation, in this paper, fragility curves are developed. These diagrams are utilized to evaluate performance level of structures whi...

In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large...

T-Codes are a class of variable-length codes. Their self-synchronization properties are useful in compression and communication applications where error recovery rather than error correction is at issue, for example, in digital telephony. T-Codes may be used without error correction or additional synchronization mechanisms. Typically, the representation of variable-length codes is a problem in ...

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of nontransversal, yet still fault-tolerant, gates that work directly on sma...

We generalist Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Under these conditions, we generalize Gabidulin cod...