Analysis of Temperature Effect in Quadruple Gate Nano-scale FinFET

Silicon - Quadruple gate FinFET is a promising candidate among other multi-gate MOS devices due to it’s better scalability and higher short channel effect suppression capability in advanced...     

Identifying crop water stress using deep learning models

Neural Computing and Applications - The identification of water stress is a major challenge for timely and effective irrigation to ensure global food security and sustainable agriculture. Several...     

Predictive models for multibiometric systems

Recognizing a subject given a set of biometrics is a fundamental pattern recognition problem. This paper builds novel statistical models for multibiometric systems using geometric and multinomial distributions. These models are generic as they are only based on the similarity scores produced by a recognition system. They predict the bounds on the range of indices within which a test subject is likely to be present in a sorted set of similarity scores. These bounds are then used in the multibiometric recognition system to predict a smaller subset of subjects from the database as probable candidates for a given test subject. Experimental results show that the proposed models enhance the recognition rate beyond the underlying matching algorithms for multiple face views, fingerprints, palm prints, irises and their combinations.     

Initial Deposition of Colloidal Particles on a Rough Nanofiltration Membrane

The initial rate of colloid deposition onto semi‐permeable membranes is largely controlled by the coupled influence of permeation drag and particle‐membrane colloidal interactions. Recent studies show that the particle‐membrane interactions are subject to immense local variations due to the inherent morphological heterogeneity (roughness) of reverse osmosis (RO) and nanofiltration (NF) membranes. This experimental investigation reports the effect of membrane roughness on the initial deposition of polystyrene latex particles on a rough NF membrane during cross flow membrane filtration under different operating pressures and solution chemistries. Atomic force microscopy was used to characterize the roughness of the membrane and observe the structure of particle deposits. At the initial stages of fouling, the AFM images show that more particles preferentially accumulate near the “peaks” than in the “valleys” of the rough NF membrane surface.     

An algorithm for recognizing palm polygons

A polygonP is said to be apalm polygon if there exists a pointxP such that the Euclidean shortest path fromx to any pointyP makes only left turns or only right turns. The set of all such pointsx is called thepalm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygonP, whereE is the size of the visibility graph ofP. The algorithm recognizes the given polygonP as a palm polygon by computing the palm kernel ofP. If the palm kernel is not empty,P is a palm polygon.The extended abstract of this paper was reported at the Second Canadian Conference in Computational Geometry, pp. 246–251, 1990     

Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks

This paper presents a modeling framework for characterizing the feasibility and impacts of multi-hop packet routing in sensor networks with mobile sinks. Data collection in sensor networks using mobile sinks has recently been investigated to improve energy performance at the cost of collection delay. Although the data collection can be accomplished with varying degrees of multi-hop routing, for a given data generation rate, as the extent of multi-hop routing increases, the round traversal time of the sink decreases. At the same time, the interference experienced by the mobile sink-to-sensor links and the consequent upload time go up. This paper characterizes these competing effects and develops a methodology for determining the extent of multi-hop routing that is feasible for given network and application parameters such as sensor data generation rate, wireless link capacity between sensors and mobile sink, the speed of the mobile sink and node density.     

Algorithms for computing diffuse reflection paths in polygons

Let s be a point source of light inside a polygon P of n vertices. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of?P. A?diffuse reflection path is said to be optimal if it has the minimum number of reflections on the path. The problem of computing a diffuse reflection path from s to t inside P has not been considered explicitly in the past. We present three different algorithms for this problem which produce suboptimal paths. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algorithm uses the edge–edge visibility graph of?P. The first two algorithms are for polygons without holes, and they run in O(n+klogn) time, where k denotes the number of reflections in the constructed path. The third algorithm is for polygons with or without holes, and it runs in O(n ²) time. The number of reflections in the path produced by this third algorithm can be at most three times that of an optimal diffuse reflection path. Though the combinatorial approach used in the third algorithm gives a better bound on the number of reflections on the path, the first and the second algorithms stand on the merit of their elegant geometric approaches based on local geometric information.     

On routing in large WDM networks

An important problem in WDM network design is to construct a logical topology and determine an optimal routing over that topology. Mixed Integer Linear Program (MILP) formulations to generate optimal solutions for this problem have been presented. Such formulations are computationally intractable, even for moderate sized networks. A standard approach is to decouple the problem of logical topology design and the problem of routing the traffic on this logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation can be used to solve the routing problem over a given logical topology. We have found that such LP formulations become computationally infeasible for large networks. In this paper, we present a new formulation, based on the arc-chain representation, for optimally routing the specified traffic over a given logical topology to minimize the congestion of the network. We have used the revised simplex method incorporating an implicit column generation technique, and exploited the special Generalized Upper Bounding structure as well as the possibility of eta-factorization for efficiently updating the dual variables and finding the solution. Experimental results on a number of networks demonstrate the suitability of this approach.     

Impacts of user-selfishness on cooperative content caching in social wireless networks

Cooperative caching can be an effective mechanism for reducing electronic content provisioning cost in Social Wireless Networks (SWNETs). These networks are formed by a collection of mobile data enabled devices physically gathering in settings such as university campus, malls, airport and other public places. In this paper, we first propose an optimal collaborative object caching policy in order to minimize the object provisioning cost in SWNETs with homogenous user requests and a peer-rebate model for promoting collaboration. Then using an analytical model we study the impacts of user selfishness on the provisioning cost and the earned rebate when certain nodes in an SWNET selfishly deviate from the optimal policy. User selfishness is motivated in order to either increase individually earned rebate or to reduce content provisioning cost. The analytical model is validated by experimental results from simulated SWNETs using the network simulator ns2.