• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.451-465
• /
• 2016

A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ⁺ such that |g(u) - g(v)| ≥ diam(G) + 1 - d_G(u, v), where diam(G) and d(u, v) are diameter and distance between u and v in graph G respectively. The radio number rn(G) of G is the smallest number k such that G has radio labeling with max{g(v) : v ∈ V(G)} = k. We investigate radio number for some families of generalized caterpillar graphs.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.613-627
• /
• 2019

Consider a connected molecular graph G = (V, E) where V is the set of vertices and E is the set of edges. In G, vertices represent the atoms and edges represent the covalent bonds between atoms. In graph G, every edge (say) e = uv will be connected by two atoms u and v. The edge Szeged index is a topological index which has been introduced by Ivan Gutman. In this paper, we have computed edge Szeged indices of a hydrocarbon family called Benzene ring and is denoted by $(BR)_{n{\times}n}$.

• Journal of the Korean Society of Food Culture
• /
• v.34 no.4
• /
• pp.424-431
• /
• 2019

The purpose of this study is to analyze and evaluate the key success factors for the fast food industry in the region of Lahore Pakistan. Fast food concept developed very speedily in the last few years in Lahore region. The success or failure of a fast food industry based on some factors like Physical environment, Brand-name, Food quality, Price, Taste, Promotional activity, Habitual consumption, Health threats, Consumer expectation, and Family meal. To identify which of these factors has a greater influence on consumer satisfaction, four fast food restaurants such as McDonald's, PIZZA HUT, KFC, and subway were targeted randomly. The proposed research is quantitative in nature and for data collection; a random sampling technique was used. A questionnaire survey answered by 273 people was considered in this research. Data have been analyzed through statistical techniques. It is observed that Brand name, Food quality, Physical environment, Health threats, Price, Family meals, Habitual consumption, and Consumer expectation showed significant impacts on Fast food industry compared to other factors evaluated herein.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.181-192
• /
• 2023

Blockchain system brought innovation in the area of accounting, credit monitoring and trade secrets. Consensus algorithm that considered the central component of blockchain, significantly influences performance and security of blockchain system. In this paper we presented four consensus protocols specifically as Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS) and Practical Byzantine Fault-Tolerance (PBFT), we also reviewed different security threats that affect the performance of Consensus Protocols and precisely enlist their counter measures. Further we evaluated the performance of these Consensus Protocols in tabular form based on different parameters. At the end we discussed a comprehensive comparison of Consensus protocols in terms of Throughput, Latency and Scalability. We presume that our results can be beneficial to blockchain system and token economists, practitioners and researchers.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.181-190
• /
• 2024

FANET (Flying ad-hoc network) is a self-adjusting wireless network that enables easy to deploy flying nodes, inexpensive, flexible such as UAV in the absence of fixed network infrastructure they communicate amoung themselves. Past few decades FANET is only the emerging networks with it's huge range of next-generation applications.FANET is a sub-set of MANET's(Mobile Ad-hoc Network) and UAV networks are known as FANET.Routing enables the flying nodes to establish routes to radio access infrastructure specifically FANET and among themselves coordinate and collaborate.This paper presents a review on existing proposed communication architecture and routing protocols for FANETS.In addition open issues and challenges are summarized in tabular form with proposed solution.Our goal is to provide a general idea to the researchers about different topics to be addressed in future.

• Asian Pacific Journal of Cancer Prevention
• /
• v.13 no.9
• /
• pp.4581-4585
• /
• 2012

Fms-like tyrosine kinase 3 (FLT3) performs a vital role in the pathogenesis of hematopoietic malignancies. Therefore in recent times, the focus of several studies was on use of FLT3 as a prognostic marker. The present study investigated the molecular characterization and incidence of FLT3 mutations in acute leukemia patients in Pakistan. A total of 55 patients were studied, of which 25 were suffering from acute lymphoblastic leukemia (ALL) and 30 were suffering from acute myeloid leukemia (AML). The polymerase chain reaction demonstrated FLT3/ITD mutations in 1 (4%) of 25 ALL patients, a male with the L2 subtype. In AML cases the rate was 4 (13.3%) of 30, three males and one female. The AML-M4 subtype was found in three and the AML M2 subtype in the other. In the AML cases, a statistically significant (p=0.009) relationship was found between WBC (109/L) and FLT3/ITD positivity. However, no significant relationship was found with other clinical parameters (p>0.05). In acute myeloid leukemia (AML) $FLT3/ITD^+$ mutation was more prevalent in elderly patients 31-40 age groups, 21-30 and 51-60 age groups respectively. In acute lymphoblastic leukemia (ALL) statistically no significant relationship was found between clinical features and FLT3/ITD positivity (p>0.05). However, in acute lymphoblastic leukemia (ALL) $FLT3/ITD^+$ mutation was more commonly found in age groups of 21-30.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.425-434
• /
• 2007

We iteratively generate a sequence of measurable mappings and study necessary conditions for its convergence to a random fixed point of random nonexpansive operator. A random fixed point theorem for random nonexpansive operator, relaxing the convexity condition on the underlying space, is also proved. As an application, we obtained random fixed point theorems for Caristi type random operators.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.743-752
• /
• 2011

Fixed point theorems for two hybrid pairs of single valued and multivalued noncompatible maps under strict contractive condition are proved, without appeal to continuity of any map involved therein and completeness of underlying space. These results extend, unify and improve the earlier comparable known results.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.109-118
• /
• 2023

Energy awareness is an essential design flaw in wireless sensor network. Clustering is the most highly regarded energy-efficient technique that offers various benefits such as energy efficiency and network lifetime. Clusters create hierarchical WSNs that introduce the efficient use of limited sensor node resources and thus enhance the life of the network. The goal of this paper is to provide an analysis of the various energy efficient clustering algorithms. Analysis is based on the energy efficiency and network lifetime. This review paper provides an analysis of different energy-efficient clustering algorithms for WSNs.