نتایج جستجو برای: compatible mapping
تعداد نتایج: 251425 فیلتر نتایج به سال:
It is important to cluster heterogeneous information networks. A fast clustering algorithm based on an approximate commute time embedding for heterogeneous information networks with a star network schema is proposed in this paper by utilizing the sparsity of heterogeneous information networks. First, a heterogeneous information network is transformed into multiple compatible bipartite graphs fr...
A design of rate-compatible polar codes suitable for HARQ communications is proposed in this paper. An important feature of the proposed design is that the puncturing order is chosen with low complexity on a base code of short length, which is then further polarized to the desired length. A practical ratematching system that has the flexibility to choose any desired rate through puncturing or r...
At compile time, pattern matching is applied to the structure of the C++ type of y. This yields two pieces of information: how to check for compatible structure in the Python type (e.g. a dictionary mapping strings to lists, tuples, arrays or sequences is compatible with map>) and which set of converters is applicable (e.g. sequences vs. dictionaries). Dynamic type checkers ...
With the increasing popularity of Service Oriented Architecture (SOA), service composition is gaining momentum as the potential silver bullet for application integration. However, services are not always perfectly compatible and therefore can not be directly composed. Service mediation, roughly classified into signature and protocol ones, thus becomes one key working area in SOA. As a challengi...
Banach contraction principle is a fundamental result in fixed point theory and has been applied and extended in many different directions. In 2002, Branciari [3] obtained a fixed point theorem for a single mapping satisfying an analogue of Banach’s contraction principle for an integral type inequality. Aliouche [2] established a common fixed point theorem for weakly compatible mappings in symme...
If Y is a subset of the space × , we call a pair of continuous functions U , V Y -compatible, if they map the space n into itself and satisfy Ux ·V y > 0, for all (x, y) ∈ Y with x · y > 0. (Dot denotes inner product.) In this paper a nonlinear two point boundary value problem for a second order ordinary differential n-dimensional system is investigated, provided the boundary conditions are giv...
The plasma facing surfaces in ITER must be aligned to millimeter accuracy with respect to the magnetic flux surfaces to prevent impurity influx into the plasma and to avoid component damage. Checking of in-vessel component alignment during initial assembly, operation, and subsequent maintenance is anticipated. A fully remote metrology system is necessary, particularly since major remote operati...
Short Read Alignment Mapping Metrics (SRAMM): is an efficient and versatile command line tool providing additional short read mapping metrics, filtering, graphs. aligners report MAPing Quality (MAPQ), but these methods generally are neither standardized nor well described in literature or software manuals. Additionally, third party quality programs typically computationally intensive designed f...
Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric tree whose vertex set is S. The main problem we consider in this work consists of finding a second plane geometric tree T ′ on S, such that T ′ is compatible with T and shares with T a minim...
The wheat Tsn1 gene on chromosome 5B confers sensitivity to a host-selective toxin produced by the pathogens that cause tan spot and Stagonospora nodorum blotch (SNB) known as Ptr ToxA and SnToxA, respectively (hereafter referred to as ToxA). A compatible Tsn1-ToxA interaction is known to play a major role in conferring susceptibility of hexaploid (common) wheat to SNB. However, a recent study ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید