Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 6 )

2019 ( 61 )

2018 ( 59 )

2017 ( 52 )

Custom range...

Search Results: 1 - 10 of 3702 matches for " Ashikur Rahman "
All listed articles are free for downloading (OA Articles)
Page 1 /3702
Display every page Item
A Discussion of the Suitability of Only One vs More than One Theory for Depicting Corporate Governance  [PDF]
Abdullah Al Mamun, Qaiser Rafique Yasser, Md. Ashikur Rahman
Modern Economy (ME) , 2013, DOI: 10.4236/me.2013.41005

Agency theory predicts that the Chief Executive Officer (CEO) and the chairman positions should be held by different individuals in order to protect shareholder’s interest. Though there are mixed evidences on CEO duality and firm performance, most research have found that there is negative relationship between CEO duality and firm performance.  Although, in the last decades of the twentieth century, agency theory became the dominant force in the theoretical understanding of corporate governance, it does not however cover all aspects of corporate governance. This paper aims to explore whether it is better to combine various theories in order to describe effective and good corporate governance or theorizing corporate governance based on one theory only. This will cover corporate governance theories which include agency theory, stakeholder theory, stewardship theory, and institutional theory.

On Reliable Transmission of Data over Simple Wireless Channels
Pawel Gburzynski,Bozena Kaminska,Ashikur Rahman
Journal of Computer Networks and Communications , 2009, DOI: 10.1155/2009/409853
Abstract: Standard protocols for reliable data transmission over unreliable channels are based on various Automatic Repeat reQuest (ARQ) schemes, whereby the sending node receives feedback from the receiver and retransmits the missing data. We discuss this issue in the context of one-way data transmission over simple wireless channels characteristic of many sensing and monitoring applications. Using a specific project as an example, we demonstrate how the constraints of a low-cost embedded wireless system get in the way of a workable solution precluding the use of popular schemes based on windows and periodic acknowledgments. We also propose an efficient solution to the problem and demonstrate its advantage over the traditional protocols.
Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks  [PDF]
Raqeebir Rab, Shaheed Ahmed Dewan Sagar, Nazmus Sakib, Ahasanul Haque, Majedul Islam, Ashikur Rahman
Wireless Sensor Network (WSN) , 2017, DOI: 10.4236/wsn.2017.92004
Abstract: Reducing number of forwarding nodes is the main focus of any broadcasting algorithm designed for ad-hoc wireless networks. All reliable broadcasting techniques can be broadly classified under proactive and reactive approaches. In proactive approach, a node selects a subset of its neighbors as forwarding node and announces the forwarding node list in the packet header during broadcast. On the other hand, no such forwarding list is generated in reactive approach. Rather, a node (cognitively) determines by itself whether to forward the packet or not based on neighbor information. Dominant pruning and Self-pruning are two example techniques that fall under proactive and reactive approach respectively. Between the two methods, dominant pruning shows better performance than self-pruning in reducing number of forwarding nodes as they work with extended neighbor knowledge. However, appended forwarding node list increases message overhead and consumes more bandwidth. As a result, the approach becomes non-scalable in large networks. In this paper, we propose a reactive broadcasting technique based on self-pruning. The proposed approach dubbed as “Improved Self-pruning based Broadcasting (ISB)” algorithm completes the broadcast with smaller packet header (i.e., with no overhead) but uses extended neighbor knowledge. Simulation results show that ISB outperforms dominant pruning and self-pruning. Furthermore, as the network gets more spread and denser, ISB works remarkably well.
Rahman Md. Ashikur,Md. Hasanuzzaman,Rahman Md,Rahman Md. Mofizur
International Research Journal of Pharmacy , 2011,
Abstract: Phytochemical analysis of the dried leaves of Tabernaemontana divaricata (L). (Apocynaceae) indicated the presence of a steroids,tannins, saponins, gums and reducing sugar. The pharmacological interest of these compounds, coupled with the use of this plant in traditional medicine prompted the authors to check for its possible antibacterial activity. The extracts (ethanol, petroleum ether, diethyl ether, methanol and aqueous) were found to possess maximum potency against infectious pathogens Staphylococcus saprophyticus, Staphylococcus aureus, Enterococcus facealis, Staphylococcus pyogenes, Streptococcus agalactae, Salmonella typhi, Escherichia coli, Shigella boydii, Shigella dysenteriae and Pseudomonas aeruginosa. The zone of inhibition was observed with almost all bacteria with some exceptions. Minimum inhibitory concentrations of the extracts were found to be significant. The obtained results provide a support for the use of this plant in traditional medicine and its further investigation.
Enhanced Partial Dominant Pruning (EPDP) Based Broadcasting in Ad hoc Wireless Networks
Ashikur Rahman,Md. Endadul Hoque,Farzana Rahman,Sabuj Kumar Kundu
Journal of Networks , 2009, DOI: 10.4304/jnw.4.9.895-904
Abstract: In many applications of ad-hoc wireless networks, one often has to broadcast the same message to all nodes. The major goal of any broadcasting algorithm is to minimize the number of retransmissions, i.e., to accomplish the goal with the minimum amount of traffic in the network. In addition to reducing the bandwidth expense needed to convey the message to all the nodes, this objective will try to minimize the total amount of energy spent by the nodes on this communal task. This is of paramount importance in sensor networks, which are often built of disposable nodes, whose life-time is directly determined by the efficiency of their power management scheme. In this paper, we present a heuristic broadcast algorithm dubbed EPDP, for Enhanced Partial Dominant Pruning, and demonstrate its superiority, in terms of the total number of retransmissions, over other solutions addressing the same issue.
Evaluation of Anthelmintic Activity of Aqueous Leaf Extract of Clitoria ternatea Linn.
Kamrun Nahar,Muhammad Ashikur Rahman,Most. Nazma Parvin,Shammy Sarwar
Stamford Journal of Pharmaceutical Sciences , 2010,
Abstract: Development of anthelmintic resistance and high cost of conventional anthelmintic drugs led to the evaluation of medicinal plants as an alternative source of anthelmintics. The current study was aimed to evaluate the possible anthelmintic effects of crude fresh juice of leaves of Clitoria ternatea Linn. using of adult earth worm Pheretima Posthuma. Three concentrations (25, 50, 100mg/ml) of juice were studied for the determination of time of paralysis and death of the earth worms. Albendazole in same concentration as that of juice was considered as standard reference and normal saline as control. The result of the present study reveals that fresh juice significantly showed paralysis and also caused death of worms especially at higher concentraton of 100mg/ml, as compared to standard reference Albendazole.
On Balanced k-coverage in Visual Sensor Network
Md. Muntakim Sadik,Sakib Md. Bin Malek,Ashikur Rahman
Computer Science , 2015,
Abstract: Given a set of directional visual sensors, the $k$-coverage problem determines the orientation of minimal directional sensors so that each target is covered at least $k$ times. As the problem is NP-complete, a number of heuristics have been devised to tackle the issue. However, the existing heuristics provide imbalance coverage of the targets--some targets are covered $k$ times while others are left totally uncovered or singly covered. The coverage imbalance is more serious in under-provisioned networks where there do not exist enough sensors to cover all the targets $k$ times. Therefore, we address the problem of covering each target at least $k$ times in a balanced way using minimum number of sensors. We study the existing Integer Linear Programming (ILP) formulation for single coverage and extend the idea for $k$-coverage. However, the extension does not balance the coverage of the targets. We further propose Integer Quadratic Programming (IQP) and Integer Non-Linear Programming (INLP) formulations that are capable of addressing the coverage balancing. As the proposed formulations are computationally expensive, we devise a faster Centralized Greedy $k$-Coverage Algorithm (CGkCA) to approximate the formulations. Finally, through rigorous simulation experiments we show the efficacy of the proposed formulations and the CGkCA.
Computational Modeling of Government Policy to Attain Long-Term Higher Voter Turnout for Sustainable Democracy  [PDF]
Mizan Rahman
American Journal of Computational Mathematics (AJCM) , 2013, DOI: 10.4236/ajcm.2013.32016

People power is the fundamental concept of democracy and power of the people is exercised though voting. People decide who should be elected to make decisions for them. However, if people do not properly participate in the voting process and only two-thirds of all eligible voters participate in an election, the democratic institution loses its credibility and becomes vulnerable. This paper investigates various changes in voting institutions throughout the USAwith a simulation model that analyzes the efficacy of such methods to attain higher voter turnout.

Introducing “Arithmetic Calculus” with Some Applications: New Terms, Definitions, Notations and Operators  [PDF]
Rahman Khatibi
Applied Mathematics (AM) , 2014, DOI: 10.4236/am.2014.519277
Abstract: New operators are presented to introduce “arithmetic calculus”, where 1) the operators are just obvious mathematical facts, and 2) arithmetic calculus refers to summing and subtracting operations without solving equations. The sole aim of this paper is to make a case for arithmetic calculus, which is lurking in conventional mathematics and science but has no identity of its own. The underlying thinking is: 1) to shift the focus from the whole sequence to any of its single elements; and 2) to factorise each element to building blocks and rules. One outcome of this emerging calculus is to understand the interconnectivity in a family of sequences, without which they are seen as discrete entities with no interconnectivity. Arithmetic calculus is a step closer towards deriving a “Tree of Numbers” reminiscent of the Tree of Life. Another windfall outcome is to show that the deconvolution problem is explicitly well-posed but at the same time implicitly ill-conditioned; and this challenges a misconception that this problem is ill-posed. If the thinking in this paper is not new, this paper forges it through a mathematical spin by presenting new terms, definitions, notations and operators. The return for these out of the blue new aspects is far reaching.
Symptomatic Trigeminal Neuralgia Pain Treatment Options—A Case Report  [PDF]
Abed Rahman
Open Journal of Anesthesiology (OJAnes) , 2015, DOI: 10.4236/ojanes.2015.59038
Abstract: Background: Severe pain is present in trigeminal neuralgia and may be devastating and debilitating. There are multiple modalities of nonsurgical techniques to help with pain and functionality. Patient: 47 year old male with 6 year history of facial pain due to trigeminal neuralgia. Treated at outside institution with medical management. Intervention: Left gasserian ganglion pulsed radiofrequency with acupuncture and biofeedback by pain psychologist. Results: >50% pain relief for greater than 12 months with improved quality of life. Conclusions: Trigeminal neuralgia may be one of the most challenging disorders to treat in the field of pain management due to the refractory and prolonged course of pain. The purpose of this article is to report the difficult treatment requiring true multidisciplinary treat to treat the severity of the patients pain. Due to his young age we opted for the pulsed radiofrequency as opposed to the thermal radiofrequency.
Page 1 /3702
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.