In normal subjects, negative pressure is created during blinking. In cases with epiphora due to NLD obstruction, the lacrimal pump is affected but its function is restored after successful DCR. The suction power of the pump mechanism is more effective after endoscopic than external DCR.

No abstract

No abstract

Abstract-In this paper, an algorithm for resource utilization problem in cloud computing based on greedy method is presented. A privately-owned cloud that provides services to a huge number of users is assumed. For a given resource, hundreds or thousands of requests accumulate over time to use that resource by different users worldwide via the Internet. A prior knowledge of the requests to use that resource is also assumed. The main concern is to find the best utilization schedule for a given resource in terms of profit obtained by utilizing that resource, and the number of time slices during which the resource will be utilized. The problem is proved to be an NP-Complete problem. A greedy algorithm is proposed and analyzed in terms of its runtime complexity. The proposed solution is based on a combination of the 0/1 Knapsack problem and the activityselection problem. The algorithm is implemented using Java. Results show good performance with a runtime complexity O((F-S)nLogn).

This paper proposes an enhancement for the ADRW algorithm to achieve dynamic fragmentation and object allocation in distributed databases. The algorithm adapts to the changing patterns of object requests with the objective to dynamically adjust the allocation schemes of objects in order to minimize the total servicing cost of all requests. Objects may be replicated or fragmented depending on patterns of reads and writes. Qualitative analysis was used to characterize the performance of the enhanced algorithm

No abstract

Mobile Ad-hoc network (MANET) is an infrastructure-less and dynamic network. Routing in such a network is a challenge due to the mobility of its nodes. Multipath routing protocols try to improve the performance by finding more than one path towards the destination which could be kept as alternatives should the main path breaks. Stability-based Partially Disjoint AOMDV (SPDA) protocol has been proposed to tackle problems resulted from the very dynamic topology of MANETs. SPDA finds partially disjoint paths that are more stable than the maximally disjoint ones in order to increase paths lifetime as well as the availability of such multipaths. When choosing partially disjoint paths, SPDA does not take into consideration the number of hops of each path. Moreover, SPDA transmits packets over the shortest path until it becomes invalid before it tries to utilize other alternative paths. In this paper we improve SPDA by adding the number of nodes each path passes through to the selection criteria. In the Improved SPDA (ISPDA), the available alternative paths have been utilized to transmit packets in parallel. We compare the SPDA and ISPDA regarding the throughput and delay. Results show the superiority of ISPDA over the original one.

This paper presents a semi-blind hybrid watermarking technique based on singular value decomposition (SVD) and discrete wavelet transformation (DWT). The proposed technique decomposes the host image using DWT and combines the singular values (SVs) of the watermark and the selected sub-bands. A binary watermark is used to be embedded in the greyscale original image. This watermark image passes through multiple operations before embedding. The watermark is converted into a vector, which is permuted into scrambled data by using a key as the initial random seed of this process. Experimental results show that the proposed technique is able to resist a variety of attacks.