524 research outputs found
Folio
No full textPrincipal's Message; Sajjad Zafar Irfani-Editorial. pp. 1; Amar Bin Adil-Article-A Poet's Search for Values. pp. 2-6; Arif A. Khan-Article-The House of God. pp. 7-10; Sajjad Zafar Irfani-Article-On Education. pp. 11-15; Tanvir Mohsin Khan-Essay-Success. pp. 16-17; Muhammad Asif-Ah! Exam. pp. 18-19; Mohayuddin Abu Bakar-Disillusionment. pp. 20-21; Gohar Majid Sheikh-Good Temper. pp. 22-23; Shahid Imtiaz-Poetry-Aspiration of Freedom. pp. 25; Sports: 96th Annual Athletic Championship, February 15-16, 1983. pp. 26-27; Dr. E. J. Sinclair Passes Away. pp. 30-31; Literacy. pp. 32-33; Folio '83 [Urdu-Punjabi]. 199 p.Quaid-e-Azam. after title; Prof Nasim Zakaria, Principal. after Principal's Message; Editors. before editorial; Dr E. J. Sinclair. before page 31; Prof Mir Muhammad Yaquib. after page 33; Department of Political Science. after page 33; Rana Iftikhar Ahmad, President Student Union. after page 33; Members of Student Union. after page 33; Editors (Urdu). before Urdu content
Folio
No full textSajjad Sulaiman, Javed A. Kiyyani-Editorial. pp. 4-6; Sajjad Sulaiman-Interview-Our Man in India. pp. 9-19; Memories-Recollections of a Formanite. pp. 20-22; Plair, Jaffery K.-Memories-Those were the Year. pp. 23-24;Ashraf M. Khan-Article-Motivation for Change. pp. 25-28; Javed A. Kiyani-Article-Cultural Identity of Pakistan. pp. 29-33; Tariq Habib-The Delicious Art of Insult. pp. 30-36; Sulaiman Batalvi-Article-Writing about Films. pp. 37-43; Hussein Masood-Story-A Pledge is Honoured. pp. 44-45; Sajjad Sulaiman-Article-The Growing Menace of Political Terrorism. pp. 46-51; Muhammad Farooq-Strange but True. pp. 52-53; Shafiq Ahmad-Article-Helping Hands. pp. 54-57; Muhammad Zaheer Dogar-Poetry-Reveries, Ecstasy. pp. 58-59; Peter, Simon-Poetry-A Formanite in the Positive Sense. pp. 60-61; Asim Nabi-Essay-Justice in Society. pp. 62-63; Sajjad Sulaiman-Article-Development and Underdevelopment. pp. 64-67; Asif Nawaz-Essay-The Ends of the Earth. pp. 68-69; Essay-The Man Changing His View. pp. 70-72; Haroon-ur-Rasheed-Poetry-O �Mother, see me off. pp. 73-74; Rao Mohammad Zaheer Khan-Poetry-The Swan Song. pp. 75; Mohsin Sohail-A Character Certificate. pp. 76; Adnan-Cartoon. pp. 78-80; Folio 1981 [Urdu-Punjabi]. 176 p.Editorial Board. page 7; Students Union 1980-81. page 8; F.C. College Sports Association 1981-82. page 77; Cartoons. pp. 78-80; Students Union 1981-82. before page 9 (Urdu); Editorial Board. after Urdu Editoria
Organizational Culture and Performance: An Empirical Study of SMEs in Pakistan. Journal of Management and Research,
No full textThis study aims to identify the prevailing type of culture and its relationship with performance in SMEs operating in Pakistan. Using competing value framework, the cultural profile and dominant characteristics of SMEs are identified and investigated to ascertain their implied relationship with organizational performance on the basis of certain self-assessment variables. For this purpose, primary data was collected form SME employees through a self-administered survey questionnaire. The results revealed that ‘hierarchy’ culture is the prevailing type of culture and a statistically significant relationship exists between organizational culture and performance among the sampled SMEs. The study concludes with certain important insinuations for theory and practice especially concerned with SMEs
Construction and Optimization of Dynamic S-Boxes Based on Gaussian Distribution
Full text linkBlock ciphers are widely used for securing data and are known for their resistance to various types of attacks. The strength of a block cipher against these attacks often depends on the S-boxes used in the cipher. There are many chaotic map-based techniques in the literature for constructing the dynamic S-Boxes. While chaos-based approaches have certain attractive properties for this purpose, they also have some inherent weaknesses, including finite precision effect, dynamical degradation of chaotic systems, non-uniform distribution, discontinuity in chaotic sequences. These weaknesses can limit the effectiveness of chaotic map-based substitution boxes. In this paper, we propose an innovative approach for constructing dynamic S-boxes using Gaussian distribution-based pseudo-random sequences. The proposed technique overcomes the weaknesses of existing chaos-based S-box techniques by leveraging the strength of pseudo-randomness sequences. However, one of the main drawbacks of using Gaussian distribution-based pseudo-random sequences is the low nonlinearity of the resulting S-boxes. To address this limitation, we introduce the use of genetic algorithms (GA) to optimize the nonlinearity of Gaussian distribution-based S-boxes while preserving a high level of randomness. The proposed technique is evaluated using standard S-box performance criteria, including nonlinearity, bit independence criterion (BIC), linear approximation probability (LP), strict avalanche criterion (SAC), and differential approximation probability (DP). Results demonstrate that the proposed technique achieves a maximum nonlinearity of 112, which is comparable to the ASE algorithm
Influence of Bacterial Secondary Symbionts in Sitobion avenae on Its Survival Fitness against Entomopathogenic Fungi, Beauveria bassiana and Metarhizium brunneum
Full text linkThe research was focused on the ability of wheat aphids Sitobion avenae, harboring bacterial secondary symbionts (BSS) Hamiltonella defensa or Regiella insecticola, to withstand exposure to fungal isolates of Beauveria bassiana and Metarhizium brunneum. In comparison to aphids lacking bacterial secondary symbionts, BSS considerably increased the lifespan of wheat aphids exposed to B. bassiana strains (Bb1022, EABb04/01-Tip) and M. brunneum strains (ART 2825 and BIPESCO 5) and also reduced the aphids’ mortality. The wheat aphid clones lacking bacterial secondary symbionts were shown to be particularly vulnerable to M. brunneum strain BIPESCO 5. As opposed to wheat aphids carrying bacterial symbionts, fungal pathogens infected the wheat aphids lacking H. defensa and R. insecticola more quickly. When treated with fungal pathogens, bacterial endosymbionts had a favorable effect on the fecundity of their host aphids compared to the aphids lacking these symbionts, but there was no change in fungal sporulation on the deceased aphids. By defending their insect hosts against natural enemies, BSS increase the population of their host society and may have a significant impact on the development of their hosts
Embedding spanning subgraphs into large dense graphs
No full textIn this thesis we are going to present some results on embedding spanning subgraphs into large dense graphs. Spanning Trees Bollob'as conjectured that if is a graph on vertices, for some , and is a bounded degree tree on vertices, then is a subgraph of . The problem was solved in the affirmative by Koml'os, S'ark"ozy and Szemer'edi for large graphs. They then strengthened their result, and showed that the maximum degree of need not be bounded: there exists a constant such that is a subgraph of if , and is large. Both proofs are based on the Regularity Lemma-Blow-up Lemma Method. Recently, using other methods, it was shown that bounded degree trees embed into graphs with minimum degree , where is a constant depending on the maximum degree of . Here we show that in general is sufficient for every . We also show that this bound is tight for the two extreme values of i.e. when and when . Powers of Hamiltonian Cycles In 1962 P'osa conjectured that if then contains the square of a Hamiltonian cycle. Later, in 1974, Seymour generalized this conjecture: if then contains the th power of a Hamiltonian cycle. In 1998 the conjecture was proved by Koml'os, S'ark"ozy and Szemer'edi for large graphs using the Regularity Lemma. We present a ``deregularised" proof of the P'osa-Seymour conjecture which results in a much lower threshold value for , the size of the graph for which the conjecture is true. We hope that the tools used in this proof will push down the threshold value for to around 100 at which point we will be able to verify the conjecture for every .Ph.D.Includes bibliographical referencesIncludes vitaby Asif Jamshe
Effect of temporal data aggregation on the perceived structure of a quantitative plant-floral visitor network
Full text linkSeasonal turnover in plant and floral visitor communities changes the structure of the network of interactions they are involved in. Despite the dynamic nature of plant–visitor networks, a usual procedure is to pool year-round interaction data into a single network which may result in a biased depiction of the real structure of the interaction network. The annual temporal dynamics and the effect of merging monthly data have previously been described for qualitative data (i.e. describing the occurrence of interactions) alone, while its quantitative aspect (i.e. the actual frequency with which interactions occur) remain little explored. For this, we built a set of 12 monthly networks describing year-round plant–floral visitor interactions in a 30-hectare planted forest and its adjacent agricultural landscape at Bahauddin Zakariya University Multan, Pakistan. A total of 80 plant and 162 insect species, which engaged in 1573 unique interactions, were recorded. Most network properties (particularly the number of plants, visitors and unique interactions) varied markedly during the year. Data aggregation showed that while animal species, plant species, unique interaction, weighted nestedness, interaction diversity and robustness increased, connectance and specialization decreased. The only metric which seemed relatively unaffected by data pooling was interaction evenness. In general, quantitative metrics were relatively less affected by temporal data aggregation than qualitative ones. Avoiding data aggregation not only gives a more realistic depiction of the dynamic nature of plant–visitor community networks, but also avoids biasing network metrics and, consequently, their expected response to disturbances such as the loss of species.Fil: Sajjad, Asif. The Islamia University Of Bahawalpur; PakistánFil: Saeed, Shafqat. Muhammad Nawaz Shareef University Of Agriculture; PakistánFil: Ali, Mudssar. Muhammad Nawaz Shareef University Of Agriculture; PakistánFil: Khan, Fawad Zafar Ahmad. Muhammad Nawaz Shareef University Of Agriculture; PakistánFil: Kwon, Yong Jung. Kyungpook National University; Corea del SurFil: Devoto, Mariano. Universidad de Buenos Aires. Facultad de Agronomía. Cátedra de Botánica General; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin
Prediction of particle concentration profiles in binary-solid liquid fluidized bed
No full textA simple mixing rule is presented here to predict the concentration profile of individual particle species in a binary-solid liquid fluidized bed from the information about the total solid concentration in the bed. Using the experimental data available in the literature, the applicability of this approach is demonstrated for the presence of different size particles in the bed. For the case of binary-solid fluidized bed showing layer inversion behavior, this simple mixing rule is capable of predicting the concentration of two species from the total solid concentration data of the bed.Corresponding Author:
Dr. Mohammad Asif, Professor
Department of Chemical Engineering, College of Engineering, King Saud University,
P.O. Box 800, Riyadh-11421, Saudi Arabia.
Email: [email protected]
An efficient image encryption scheme based on double affine substitution box and chaotic system
No full textPrivacy of information is one of the most important and unavoidable issues in our digitally advance era. A huge amount of information transmitted over different servers and networking protocols. The sphere of digitally advanced world is tied with information in different forms of facilitations, which includes online banking systems, ecommerce and many more. Providing the ease of access, anything online makes our confidential information open to different threats. Therefore, to enjoy ease of access and at the same time secure our digital information from theft, we need a robust information security system. In this article, we have designed a novel and an efficient security system, which provides secrecy to our digital information. The designed encryption scheme is fundamentally a combination of chaos and nonlinear confusion components. We have developed a new mechanism of adding confusion, namely S8 permutation of double affine transformation to construct 40320 new substitution boxes (S-boxes) having nonlinearity 112 from a single S-box. Moreover, nonlinear Lorenz dynamical system is utilized to select any three S-boxes from 40320 newly generated nonlinear components. To add diffusion in our proposed algorithm, we have utilized Chirikov discrete iterative map. The excellence of an offered digital image encryption has been examined and evaluated with standard benchmarks. The simulation results reveal that the quality of the image encryption passes all these tests and is comparable to current benchmarks.The author Sajjad Shaukat Jamal extends his gratitude to Deanship of Scientific Research at King Khalid University for funding this work through research groups program under grant number. R. G. P. 2/150/42 .Scopu
Investigating Web Size Metrics for Early Web Cost Estimation
No full textContext Web engineering is a new research field which utilizes engineering principles to produce quality web applications. Web applications have become more complex with the passage of time and it's quite difficult to analyze the web metrics for the estimation due to a wide range of web applications. Correct estimates for web development effort play a very important role in the success of large-scale web development projects. Objectives In this study I investigated size metrics and cost drivers used by web companies for early web cost estimation. I also aim to get validation through industrial interviews and web quote form. This form is designed based on most frequently occurring metrics after analyzing different companies. Secondly, this research aims to revisit previous work done by Mendes (a senior researcher and contributor in this research area) to validate whether early web cost estimation trends are same or changed? The ultimate goal is to help companies in web cost estimation. Methods First research question is answered by conducting an online survey through 212 web companies and finding their web predictor forms (quote forms). All companies included in the survey used Web forms to give quotes on Web development projects based on gathered size and cost measures. The second research question is answered by finding most occurring size metrics from the results of Survey 1. List of size metrics are validated by two methods: (i) Industrial interviews are conducted with 15 web companies to validate results of the first survey (ii) a quote form is designed using validated results from industrial interviews and quote form sent to web companies around the world to seek data on real Web projects. Data gathered from Web projects are analyzed using CBR tool and results are validated with Industrial interview results along with Survey 1. Final results are compared with old research to justify answer of third research question whether size metrics have been changed. All research findings are contributed to Tukutuku research benchmark project. Results “Number of pages/features” and “responsive implementation” are top web size metrics for early Web cost estimation. Conclusions. This research investigated metrics which can be used for early Web cost estimation at the early stage of Web application development. This is the stage where the application is not built yet but just requirements are being collected and an expected cost estimation is being evaluated. List of new metrics variable is concluded which can be added in Tukutuku project
- …
