an algorithm for finding best matches in logarithmic

... mapping T with domain D(T) and range R(T) in H is called a quasi-nonexpansive mapping if and only if Fix(T) = ∅ and for any x ∈ D(T), for any u ∈ Fix(T), Tx – u ≤ x – u. Every nonexpansive ... Hilbert space A mapping T with domain D(T) and range R(T) in H is called an L-Lipschitzian mapping (or simply a Lipschitz mapping) if and only if there exists L≥  such that for all x, y ∈ D(T), ... mapping T with domain D(T) and range R(T) in H is called pseudocontractive if and only if for all x, y ∈ D(T), the following inequality holds: x – y ≤( + r)(x – y) – r(Tx – Ty) (.) for

Ngày tải lên: 02/11/2022, 08:57

... residues can associate through Hoogsteen hydrogen binding to form a square planar structure called a guanine tetrad, and two or more guanine tetrads can stack on top of each other to form a G-quadrulpex ... was optimized for E coli, PromPredict for both E coli and B subtilis, while bTSSfinder for E coli and Cyanobacteria Implementation Programming language and data sets G4PromFinder algorithm was ... to obtain the mean values reported in Table 2 (column 1 and 2) We observed good performances in both bacterial ge-nomes In fact the F1-scores obtained in S coelicolor A3(2) and P aeruginosa PA14

Ngày tải lên: 25/11/2020, 15:07

... significant growth in recent years, with a steady increase in both domestic and international visitors This rising interest in tourist destinations has led to a surge in travel and information ... coding time High performance for applications with constantly changing data, easy maintenance and debugging ReactJS is primarily a View library, focusing solely on the View layer rather than ... service, and a strong reputation These factors are crucial for managers when evaluating advertising and information campaigns.Research scopeThe study gets location information, mainly in Ho Chi Minh

Ngày tải lên: 17/07/2023, 15:29

... marking mechanism and show its linear complexity for each iteration A natural approach is to perform both marking and un-marking within an iteration This approach is best explained with an example ... studied minimum energy routing problem (for a single message) by exploiting both wireless broadcast advantage and CC However, their proposed solu-tions cannot provide any performance guarantee for ... corresponding source as s BEGIN Find_Another_Relay(s ) YES NO Is this relay already assigned? Can we find an unmarked relay for s with data rate larger than Cmin? For s , use Find_Another_Relay(s

Ngày tải lên: 08/07/2014, 17:06

... finding e-CCC-Biclusters and the Com-mon Motifs Problem, as explained below. Finding e-CCC-Biclusters and the common motifs problem There is an interesting relation between the problem of finding ... Definition 7 (MaxNode) An internal node v in T is called a MaxNode iff it satisfies one of the following conditions: a) It does not have incoming suffix links. b) It has incoming suffix links ... expression pattern in the time points in J Being able to find all max-imal CCC-Biclusters using efficient algorithms is useful to identify potentially interesting expression patterns and can be used

Ngày tải lên: 12/08/2014, 17:20

... constructed incremental mechanisms for updating positive region and developed incremental algorithms when adding and deleting an object set Yu et al [14] constructed incremental formula for computing information ... Trang 1A DISTANCE BASED INCREMENTAL FILTER-WRAPPER ALGORITHM FOR FINDING REDUCT IN INCOMPLETE DECISION TABLES Nguyen Ba Quang1, Nguyen Long Giang2, *, Dang Thi Oanh3 1 Hanoi Architectural ... adding and deleting object set [3-8], adding and deleting conditional attribute set [9, 10], varying attribute values [11-13] In recent years, some incremental attribute reduction algorithms in

Ngày tải lên: 12/02/2020, 13:46

... Trang 1R E S E A R C H A R T I C L E Open AccessProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies Yuanfang Ren*, Aisharjya Sarkar and Tamer ... Identifying motifs in biological networks is essential in uncovering key functions served by these networks Finding non-overlapping motif instances is however a computationally challenging task ... of transcrip-tion and transmission of signals [1] Biological networks are often modeled as graphs, with nodes and edges rep-resenting interacting molecules (e.g., protein or gene) and the interactions

Ngày tải lên: 25/11/2020, 14:03

... for nonexpansive mappings, asymptotically nonexpansive mappings, and asymptotically pseudocontractive mappings were studied Trang 2in the setting of Hilbert spaces or uniformly convex Banach spaces ... minimization problems; in other words, equilibrium problems are a unified model for problems arising in physics, engineering, economics, and As in the case of nonexpansive mappings, also in the case of ... fixed points of nonlinear mappings in Hilbert space,” Journal of Mathematical Analysis and Applications, vol 20, pp 197–228, 1967. 3 F E Browder, “Nonexpansive nonlinear operators in a Banach

Ngày tải lên: 21/06/2014, 20:20

... nonexpansive mappings see, e.g., 21,22 The problem of finding an optimal point that minimizes a given costfunction over∩N i1 FT i is of wide interdisciplinary interest and practical importance ... frequently in various areas of mathematical sciences andengineering For example, the well-known convex feasibility problem reduces to finding a point in the intersection of the fixed-point sets ... the fixed-point set of T i , that is, FT i  : {x ∈ C : T i x  x} Finding an optimal point in the intersection∩N i1 FT i of the fixed-point sets of a family of nonexpansivemappings is a task

Ngày tải lên: 22/06/2014, 03:20

... Although such binary expression is very simple, it can retain meaningful biological information con- tained in the real continuous-domain gene expression pro- files. For instance, it can be applied ... be useful for designing algorithms for finding steady states in other models and for theoretical analysis of such algorithms For instance, Mochizuki performed theoretical analysis ... proved in 1998 that finding a singleton attractor is NP-hard [24]. Independently, Milano and Roli showed in 2000 that the satisfiability problem can be transformed into the problem of finding a singleton

Ngày tải lên: 22/06/2014, 19:20

... and Computer Engineering, McMaster University, Hamilton, Canada, where he became a Professor in 1998 and held the Canada Research Chair in information processing since 2001 Starting April 2003, ... Noma, and A Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complemen-tarity Problems, vol 538 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 1991 Zhi-Quan ... Kanagawa, Japan, June–July 2003 [6] S T Chung, “Transmission schemes for frequency selective Gaussian interference channels,” Doctral disseration, Depart-ment of Electrical Engineering, Stanford

Ngày tải lên: 22/06/2014, 23:20

... still an important task to be solved; in disparate applications ranging from pattern recognition to image sequence analysis, passing through object tracking and video coding, determin- ing trajec ... segmentation, as for example, for reducing the motion description burden in coding oper- ation (video coding), for describing the behavior of moving objects (event detection), for estimating the 3D ... Figure 5g contains very interesting infor- mation because it clearly indicates that there is an object with an anticlockwise rotation (bright gray pixels) and its rotation center can easily be

Ngày tải lên: 23/06/2014, 01:20

... mapping of unmapped reads Identifying candidate fusions using segment and read mappings Constructing and indexing spliced fusion con-tigs, and then remapping segments against them Stitching segments ... SKBR3 and MCF7 cell lines Sample ID Fusion genes (left-right) Chromosomes (left-right) Spanning reads Spanning pairs Spanning reads Spanning pairs Comparisons of the number of spanning reads and ... pipeline TopHat-Fusion consists of two main modules: (1) finding candidate fusions and aligning reads across them; and (2) filtering out false fusions using a series of post-processing routines.

Ngày tải lên: 09/08/2014, 23:20

... 451 AND 452 AND 453 AND 454 AND 455 AND 456 AND 457 AND AND 459 AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND AND ... 420 AND AND 421 424 425 426 AND AND AND AND 428 AND 429 AND 431 AND AND AND 433 AND 434 AND AND 435 436 AND 438 AND 439 AND 440 AND 441 442 AND 443 444 AND 445 AND AND 446 AND 447 AND AND 448 AND ... 313 AND 314 315 317 AND 318 AND 320 AND AND 321 324 325 AND AND 326 329 AND AND 330 AND 331 332 AND AND 335 336 AND 337 AND AND 339 AND 340 AND 341 342 AND AND 343 AND 344 345 AND 346 AND AND

Ngày tải lên: 14/08/2014, 16:21

... continues in this way, computing sublabelings for L= n − 2 by splitting into several branches each time and recursively calling each branch The computation for a particular branch continues until ... The algorithm splits the computation into two branches The left branch uses the sublabeling < n − 1, 0, n > and the right branch uses the sublabeling < 0, n, 1 > The algorithm continues ... labeling of G 3 Enumerating graceful labelings of graphs In this section, we describe an algorithm for enumeration of graceful labelings of unicyclic graphs and use it to enumerate graceful labelings

Ngày tải lên: 13/08/2015, 10:00

... composition and properties of diets in developing countries is needed In the screening for unknown dietary factors influencing iron absorption, new starting points can be obtained by comparing actual ... estimated for the 24 meals in study 1 by using the 2 previously published algorithms, in which effects of both enhancers and inhibitors were included In the ear-liest study (7), there was a significant ... present algorithm 1) is based on continuous variables for con-tent of enhancers and inhibitors, 2) takes into consideration inter-actions between factors, and 3) includes more factors In study

Ngày tải lên: 07/07/2018, 09:48

... kind of dwelling, source [6] 57Table 4.8 Financial indicators for a PV installation in Malta with residential or domestic tariff 57Table 4.9 Financial indicators for a PV installation in ... thanin winter because of the high need in air conditioning But in many other Europeancountries the contrary happens, the consumption of heating systems causes a higherdemand in winter than in ... determined in function of the installed capacity required For instance,for a 2 kWp installed capacity 8 modules are needed The modules are made of Fig 3.6 Electric load per fil for Spain and for France

Ngày tải lên: 20/01/2020, 11:01

... kind of dwelling, source [6] 57Table 4.8 Financial indicators for a PV installation in Malta with residential or domestic tariff 57Table 4.9 Financial indicators for a PV installation in ... thanin winter because of the high need in air conditioning But in many other Europeancountries the contrary happens, the consumption of heating systems causes a higherdemand in winter than in ... determined in function of the installed capacity required For instance,for a 2 kWp installed capacity 8 modules are needed The modules are made of Fig 3.6 Electric load per fil for Spain and for France

Ngày tải lên: 03/03/2020, 10:48

... depot (that is, perform part of a shift in the morning and another part in the afternoon or evening This constraint avoids shifts that require all the driver’s time and avoids forcing a driver who ... feeder lines and 21 to main lines, for a total of 2899 services and a r i r j r i r j r i U r j Trang 10 528 total programmed time of 692 hours and 20 minutes The tests were performed during 10 ... (2017) and Xie & Suhl (2015) The Flexible Vehicle and Crew Scheduling Problem for urban bust transport are studied by Boyer et al (2018) A mixed- integer linear programming model and a variable

Ngày tải lên: 26/05/2020, 22:39

... continues in this way, computing sublabelings for L= n − 2 by splitting into several branches each time and recursively calling each branch The computation for a particular branch continues until ... The algorithm splits the computation into two branches The left branch uses the sublabeling < n − 1, 0, n > and the right branch uses the sublabeling < 0, n, 1 > The algorithm continues ... labeling of G 3 Enumerating graceful labelings of graphs In this section, we describe an algorithm for enumeration of graceful labelings of unicyclic graphs and use it to enumerate graceful labelings

Ngày tải lên: 17/03/2021, 20:28