A graph has linear clique-width at most k if it has a clique-width expression using at most k labels such that every disjoint union operation has an operand which is a single vertex graph. We give the first characterisation of graphs of linear clique-width at most 3, and we give the first polynomial-time recognition algorithm for graphs of linear clique-width at most 3. In addition, we present ...

We discuss the effect on finite machine implementation of chaotic system on randomness. We show that the most significant bit even for fully developed chaotic systems implemented with high precision (using 1000-bit arithmetics) is not random. We propose chaos-based pseudo-random bit generators and discuss their efficient software implementation.

The delay and dispersion of the packet train have been widely used in most network measurement tools. The timestamp of the packet is critical for the measurement accuracy. However, timestamping performed either in the application or the kernel layer would be easily affected by the source and destination hosts especially in high-speed network. Therefore, to evaluate the impact of the timestamp p...

In recent years, researchers have investigated a growing number of weighted networks where ties are differentiated according to their strength or capacity. Yet, most network measures do not take weights into consideration, and thus do not fully capture the richness of the information contained in the data. In this paper, we focus on a measure originally defined for unweighted networks: the glob...

Network motifs are overrepresented interconnection patterns found in real-world networks. What functional advantages may they offer for building complex systems? We show that most network motifs emerge from interconnections patterns that best exploit the intrinsic stability characteristics of individual nodes. This feature is observed at different scales in a network, from nodes to modules, sug...

International incoming grey traffic is currently one of the most important issues for both the Regulator and legal telecommunication operators in Pakistan. The major reason for higher grey traffic in Pakistan is because of international settlement rates which are higher than the cost of domestic termination rate. The grey traffic operators gain financial advantage by offering low international ...

In this paper, we provide a generalization of theorem proved by Eliahou and Fromentin, which exhibit remarkable property the sequence $(n'_g)$, where $n'_g$ denotes number gapsets with genus $g$ depth at most $3$.