background and objective: high-level gentamicin resistance (hlgr: mic ≥ 500 µg/ml) in enterococci is mediated by aminoglycoside modifying enzymes which is mainly encoded by aac(6′)-ie-aph(2′′)-ia gene. the aim of this study was to evaluate the frequency of   aac(6′)-ie-aph(2′′)-ia gene in clinical isolates of enterococcus facium and enterococcus faecalis collected from hospitals in northwest of...

This paper presents a framework for implementing novel perfectly matching layer and infinite element (PML+IE) combination boundary condition unbounded elastic wave problems in the time domain. To achieve this, traditional hexahedral finite elements are used to model propagation inner domain IE test functions implemented exterior Two alternative implementations of PML formulation studied: case w...

This paper introduces the hierarchical interpolative factorization for integral equations (HIF-IE) associated with elliptic problems in two and three dimensions. This factorization takes the form of an approximate generalized LU decomposition that permits the efficient application of the discretized operator and its inverse. HIF-IE is based on the recursive skeletonization algorithm but incorpo...

The emergence of the Open-IE paradigm has given way to domain independent techniques for information extraction. Its capability of extraction new relations from text shows potential towards the task of building a knowledge base. However, its advantages also come with its disadvantages such as the lack of context expressed by the relations extracted by Open-IE systems. This research attempts to ...

Available online 24 December 2008

In this paper we consider the following covering problem. Given a set S of n points in d-dimensional space, d 2, nd two axis-parallel boxes that together cover the set S such that the measure of the largest box is minimized, where the measure is a monotone function of the box. We present a simple algorithm for nding boxes in O(n log n + n d?1) time and O(n) space.