an algorithm for finding

... 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 mapping with ... (x) Formulations similar to (.) for different classes of nonlinear problems had been pre-sented by Kim and Xu [], Nilsrakoo and Saejung [], Ofoedu et al [], Yang and Su [], Zegeye and ... quasi-nonexpansive mappings was essentially introduced by Diaz and Metcalf [] Although Examples . and . guarantee the existence of a nonexpansive mapping which is not nonexpansive, we must

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

... problems for nonexpansive mappings, asymptotically nonexpansive mappings, and asymptotically pseudocontractive mappings were studied Trang 2in the setting of Hilbert spaces or uniformly convex Banach ... C and a ∈ K such that for all for r > 0 and x ∈ H let T r : H → C be a mapping defined by T r x   hz, y r   called resolvent of f and h. Then 1 T r x /  ∅; Proof Let x0 ∈ H For any ... Ceng, S Al-Homidan, Q H Ansari, and J.-C Yao, “An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings,” Journal of Computational and Applied Mathematics,

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

... Trang 1M E T H O D Open AccessTopHat-Fusion: an algorithm for discovery of novel fusion transcripts Abstract TopHat-Fusion is an algorithm designed to discover transcripts representing ... software (for example, Bowtie [13] and ELAND [14]) and rely on finding paired reads that map to either side of a fusion boundary They also rely on known annotation, searching known exons for possible ... unrestricted use, distribution, and Trang 2reads) that span a fusion event, and because it does notrely on annotation, it finds events involving novel splice variants and entirely novel genes Other

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

... expression patterns) and a method to filterhighly overlapping, and, therefore, redundant, biclusters We report results in real data showing the effectiveness ofthe approach and its relevance in the process ... work with a singletime series expression matrix and aim at finding biclusters defined as subsets of genes and subsets of contiguous Trang 3Algorithms for Molecular Biology 2009, 4:8 http://www.almob.org/content/4/1/8time ... CCC-Bicluster and maximal e-CCC-Bicluster We then for- mulate two problems: (1) finding all maximal e-CCC- Biclusters and (2) finding all maximal e-CCC-Biclusters (e-CCC-satisfying row and column

Ngày tải lên: 12/08/2014, 17: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

... The algorithm 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 ... < n − 1, 0, n > and < 0, n, 1 > 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 ... paths P4 and P2 with vertices labeled 15-0-16-2 and 1-14, respectively We also observe that for any graceful labeling f , Sn=< 0, n > and S1 = f Adding first (resp adding last) an element

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

... These findings suggest that the ability of ascorbic acid to reduce iron and thus to prevent the formation of less-soluble ferric compounds is probably an important mechanism of action for the ... informaabsorp-tion about the magnitude of the effect of meat in different types of meals and the possible mechanisms for the absorption-promot-ing effect of meat and fish In developing an algorithm ... cheese, and marmalade Trang 8An important difference between the 2 validation studies wasthat each absorption value in study 1 was the mean of 10 subjects (observed and calculated by using the algorithm;

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

... 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 ... 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 ... Nguyen Trai, Thanh Xuan, Ha Noi 2 Institute of Information Technology, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, Cau Giay, Ha Noi 3 University of Information and Communication

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

... consensus sequence” (TTGAC for S coelicolor A3(2) and TTGNC for P aeruginosa PA14) and the “-10 consensus sequence” (TANNNT for S coelicolor A3(2) and TANAAT for P aeruginosa PA14) for σ70-family factors ... 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 ... guanine 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

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

... k For every sublabeling S k of f (1 ≤ k ≤ n), our algorithm achieves S k exactly once The algorithm starts by looking for the edge label n Thus for the base case, k = n, S n = 0, n and the algorithm ... vertex cannot have a label in the set {4, 5, · · · , m − 1} We next show that this result holds for all m ≥ Theorem For m ≥ and for any graceful labeling of K1,m−1 ⊕ C4 , the central vertex cannot ... Congressus Numerantium, 188 (2007), 109-115 [3] J C Bermond, Graceful graphs, radio antennae and French windmills, Graph Theory and Combinatorics, Pitman, London (1979) 18-37 [4] G Chartrand and L Lesniak,

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

... learning and non-learning techniques Results MRI data from 50 preterm infants (mean PMA at birth 29.27 weeks, range 25.43–34.84 weeks) were scanned at term equivalent age (mean PMA 39.64 weeks, range ... reference brain masks, we manually segmented the MR images from 10 randomly chosen subjects The mean (SD) of the Dice coefficient and Hausdorff distance between the reference and manual segmentations ... (0.25)% and 4.94 (1.75) mm, respectively The mean (SD) of the Dice Coefficient and Hausdorff distance between the reference and manual segmentations of the second rater were 98.03 (0.29)% and 6.62

Ngày tải lên: 19/11/2022, 11:42

... Trang 1Tarjan DFS algorithm for finding Bridges and Articulation Points THUẬT TOÁN ỨNG DỤNG 1 Phạm Quang Dũng Bộ môn KHMTdungpq@soict.hust.edu.vn Trang 2Duyệt theo chiều sâu ... đỉnh con cháu nào đó của v 2 Trang 44 6 num[6] = 1, low[6] = 1 Trang 7num[6] = 1, low[6] = 1num[1] = 2, low[[1] = 2num[3] = 3, low[3] = 3num[2] = 4, low[2] = 4Trang 8num[6] = 1, low[6] = 1num[1] ... num[8] = 5num[4] = 9, low[4] = 9Trang 20Sample code20 void dfs(int s, int ps){ // DFS from s with ps is the parent of s in the DFS tree t++; } } } } Trang 21for(int i = 0; i < bridges.size();

Ngày tải lên: 22/11/2022, 22:37

... showed, click on “Change language” 2 System navigates to Change language screen; list languages were showed 3 User selects the language he wants 4 The system changes the current language accordingly ... plans for each day Table 16 Clear plans for each day usecase Name Clear plans for each day Short description In the day-by-day schedule screen, the user can choose to delete a location planning ... a plan with a voice assistant Table 28 Create a plan with a voice assistant usecase Name Create a plan with a voice assistant (Alan) Short description Users use voice to create trip plans

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

... Trang 1An Efficient Ant Colony Algorithm for DNA Motif Finding Xuan Huan Hoang1, The Hung Nguyen1, T Thu Ha Doan2, and T Anh Tuyet Duong1 1University of Engineering and Technology, VNU, Hanoi, ... of motif, many statements for motif finding problem and also developed a number of algorithms for finding motif [1,3,5,15] One of the widely used approaches is to use an approximate algorithm ... expanded by a random to the next vertex based on heuristics information and pheromone trail The ACO algorithm uses N ant artificial ants, in each iteration, each ant finds a solution by a randomized

Ngày tải lên: 14/10/2015, 15:27

... (worst) 271 EFFICIENT GENETIC ALGORITHM 31 Table Summary of the first 10 iterations of GA Iter Merge Draft Candidate Fitness Replace 10 and 4 and and and 2 and and and and and and 1-2-3-10-11-12 3-10-11-12 ... problem, optimal algorithms can solve some instances of the p-median problem with reasonable effort A typical approach is to combine Lagrangian relaxation with branch-and-bound (see, for example, ... Annals of Operations Research 122, 21–42, 2003  2003 Kluwer Academic Publishers Manufactured in The Netherlands An Efficient Genetic Algorithm for the p-Median Problem OSMAN ALP and ERHAN

Ngày tải lên: 08/08/2013, 08:38

... upon acceptance It can be downloaded, printed and distributed freely for any purposes (see copyright notice below) For information about publishing your research in Fixed Point Theory and Applications ... distribution, and reproduction in any medium, provided the original work is properly cited Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational ... available soon Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems Fixed Point Theory and Applications 2011, 2011:101 doi:10.1186/1687-1812-2011-101

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

... the national and international level to ensure and improve the safety and health of the workforce and other users of chemicals. Regulatory bodies for instance in the European Union and in the US ... databases, predominantly in English, its main language is German. A flow chart for finding toxicological information from the databasesFigure 1 A flow chart for finding toxicological information from ... finding and using information. Schaafsma, Bennett and others emphasize that professionals must learn which search engines and sites can be trusted [10-13]. The number of chemical substances and

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

... of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems Fixed Point Theory and Applications 2011 2011:101. Submit your manuscript to a journal and ... Trang 1R E S E A R C H Open AccessHierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems Yonghong Yao1, Yeol Je Cho2*and ... certain quasi-nonexpansive mappings Numer Funct Anal Optim 25, 619 –655 (2004) 19 Guo, G, Wang, S, Cho, YJ: Strong convergence algorithms for hierarchical fixed point problems and variational inequalities

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

... (1) where H {s(t)} is the Hilbert transformation of s(t), a(t)is the signal instantaneous amplitude, and φ(t) is the signal instantaneous phase. The instantaneous frequency (IF) describes the ... complex-valued Gaussian noise with mutually independent real and imaginary zero-mean parts of variance σ 2  /2, a m (n) is the mth component instantaneous amplitude, and φ m (n) is its instantaneous phase ... the mth component instantaneous amplitude, and φ m (t)isits instantaneous phase. When calculating the Hilbert transform of the signal s(t) in (1), the conditions of Bedrosian’s theorem need to

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

... reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon References [1] Y Wang, X Huang, C S Lee, et al., “High resolution acquisition, learning and transfer ... within a certain range of the given point, and for each sampled position, we will project it into the image planes of the main camera and another camera in the set, respectively Rectangular image ... Trang 1Volume 2010, Article ID 274269, 10 pagesdoi:10.1155/2010/274269 Research Article An Iterative Surface Evolution Algorithm for Multiview Stereo Yongjian Xi and Ye Duan Department

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