Sensing Models and Its Impact on Network Coverage in Wireless Sensor Network

Network coverage of wireless sensor network (WSN) means how well an area of interest is being monitored by the deployed network. It depends mainly on sensing model of nodes. In this paper, we present three types of sensing models viz. Boolean sensing model, shadow-fading sensing model and Elfes sensing model. We investigate the impact of sensing models on network coverage. We also investigate network coverage based on Poisson node distribution. A comparative study between regular and random node placement has also been presented in this paper. This study will be useful for coverage analysis of WSN.Comment: 5 pages, 5 figures, IEEE Region 10 Colloquium and the Third ICIIS, Kharagpur, INDIA December 8-10, 200

Shear capacity of reinforced concrete beams using neural network

NoOptimum multi-layered feed-forward neural network (NN) models using a resilient back-propagation algorithm and early stopping technique are built to predict the shear capacity of reinforced concrete deep and slender beams. The input layer neurons represent geometrical and material properties of reinforced concrete beams and the output layer produces the beam shear capacity. Training, validation and testing of the developed neural network have been achieved using 50%, 25%, and 25%, respectively, of a comprehensive database compiled from 631 deep and 549 slender beam specimens. The predictions obtained from the developed neural network models are in much better agreement with test results than those determined from shear provisions of different codes, such as KBCS, ACI 318-05, and EC2. The mean and standard deviation of the ratio between predicted using the neural network models and measured shear capacities are 1.02 and 0.18, respectively, for deep beams, and 1.04 and 0.17, respectively, for slender beams. In addition, the influence of different parameters on the shear capacity of reinforced concrete beams predicted by the developed neural network shows consistent agreement with those experimentally observed

The Impact of Revenue Diversification on Bank Profitability and Stability: Empirical Evidence from South Asian Countries

This paper is a contribution to the ongoing debate on the benefits and drawbacks of bank revenue diversification. Revenue diversification may benefit banks if diversified activities are inherently less risky and possess high returns, while it may hurt banks if diversified activities are more risky and have low returns. Analyzing a panel dataset of 200 commercial banks from all South Asian countries, we found that overall revenue diversification into non-interest income has a positive impact on the profitability and stability of South Asian commercial banks. We further observed that different types of non-interest income-generating activities have different impacts on bank performance and stability. While fees and commission incomes have a negative impact on the profitability and stability of South Asian commercial banks, other non-interest income has a positive impact. Our results imply that banks can benefit from revenue diversification if they diversify into specific types of non-interest income-generating activities. Our findings are robust and relevant to the use of alternative measures of revenue diversification, profitability and stability

File management in a mobile DHT-based P2P environment

The emergence of mobile P2P systems is largely due to the evolution of mobile devices into powerful information processing units. The relatively structured context that results from the mapping of mobile patterns of behaviour onto P2P models is however constrained by the vulnerabilities of P2P networks and the inherent limitations of mobile devices. Whilst the implementation of P2P models gives rise to security and reliability issues, the deployment of mobile devices is subject to efficiency constraints. This paper presents the development and deployment of a mobile P2P system based on distributed hash tables (DHT). The secure, reliable and efficient dispersal of files is taken as an application. Reliability was addressed by providing two methods for file dispersal: replication and erasure coding. Security constraints were catered for by incorporating an authentication mechanism and three encryption schemes. Lightweight versions of various algorithms were selected in order to attend to efficiency requirements

Behavior of laterally loaded small scale barrettes in sand

AbstractThis paper aims to investigate the response of laterally loaded rectangular cross sectional barrettes. Twenty-eight model tests for laterally loaded barrette were investigated to study the effect of sand relative density, aspect ratio of pile cross section, loading direction and load eccentricity. Based on this study, the lateral resistance of the barrette that loaded in the direction of major axis is higher than that loaded in the direction of minor axis. Sand relative density has significant effect on the lateral capacity of the barrettes. The ratio of the lateral capacity of the barrettes loaded in the direction of major axis compared to the barrettes loaded in the direction of minor axis is reduced as the sand relative density increases. Increasing the flexure stiffness of the barrette cross section causes a reduction in the lateral displacement of the barrette head. Increasing load eccentricity causes a significant reduction in the barrette lateral resistance

SOME NEW RESULTS ON INTEGER ADDITIVE SET-VALUED SIGNED GRAPHS

International audienceLet X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective set-valued function f : V (G) → P(X) − {∅} such that the induced function f+ : E(G) → P(X) − {∅} is defined by f+(uv) = f(u) + f(v); ∀ uv ∈ E(G), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL of a signed graph is an IASL of its underlying graph G together with the signature σ defined by σ(uv) = (−1)|f+(uv)|; ∀ uv ∈ E(Σ). In this paper, we discuss certain characteristics of the signed graphs which admits certain types of integer additive set-labelings