نتایج جستجو برای: covering generating families
تعداد نتایج: 278127 فیلتر نتایج به سال:
abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...
Geographically contours are virtual lines drawn across the terrain to join points that are at same elevation from certain reference point. Contours are essential morphological features that are used along with the associated elevation as basis for generating Terrain Model or Digital Elevation Model for the area of interest. These lines are represented at different scales depending upon the scal...
An almost Belyi covering is an algebraic covering of the projective line, such that all ramified points except one simple ramified point lie above a set of 3 points of the projective line. In general, there are 1-dimensional families of these coverings with a fixed ramification pattern. (That is, Hurwitz spaces for these coverings are curves.) In this paper, three almost Belyi coverings of degr...
This paper develops a new abstraction technique for processor microarchitecture validation. An abstract finite-state machine model is derived directly from the processor HDL description. This model, along with information about the instruction set is used for validation coverage analysis. We also present automatic test generation algorithms for generating sequences for traversing state transiti...
A scheme for generating multiwavelength laser source based on a linear optical amplifier (LOA) is demonstrated for potential applications in dense-wavelength division multiplexing (DWDM) communication systems. The laser output shows up to 80 laser lines (SNR at least 20 dB) with 0.4 nm channel spacing covering C and L band. Simultaneous tuning of muti-wavelengths is also demonstrated.
Domains of unknown function (DUFs) are a large set of uncharacterized protein families that are found in the Pfam database. Here, the scale and growth of functionally uncharacterized families in biological databases are surveyed and the prospects for discovering their function are examined. In particular, the important role that structural genomics can play in identifying potential function is ...
We use the Rosetta de novo structure prediction method to produce three-dimensional structure models for all Pfam-A sequence families with average length under 150 residues and no link to any protein of known structure. To estimate the reliability of the predictions, the method was calibrated on 131 proteins of known structure. For approximately 60% of the proteins one of the top five models wa...
There are many results about generating pair-wise covering arrays with strength τ=2 have been reported, but fewer results are published for high-strength covering arrays with a higher-strength τ>2. In configuration testing of sensor networks, high-strength covering array is required to construct combinatorial test cases. To generate combinatorial test suite with higher-strength, a backtracking ...
This paper studies a covering problem on graph which is a variant of facility location problem. In this research, constraints are considered to improve the previous model. These constraints have not considered previously. The first constraint limits the capacity of the facilities and the other one considers different coverage distances. The objective is to determine the optimal subset of candid...
The first part of the talk will be a quick survey on the homotopy type of the group of Diffeomorphisms of a 3-manifold. Pioneering work was done by Hatcher and Ivanov in the late 70s and early 80s, computing this for Haken 3-manifolds and famously the Smale conjecture. Following Thurston, the natural question is whether Diff is homotopy equivalent to the group of isometries, for geometric 3-man...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید