نتایج جستجو برای: matching numbers
تعداد نتایج: 295841 فیلتر نتایج به سال:
OBJECTIVE An event-related potential (ERP) correlate of visual short-term memory (VMP) has been identified in our laboratory. This study aims to determine how stimulus load modulates recognition processing of digits. METHODS ERPs were recorded from 117 healthy right-handed subjects during a delayed matching-to-sample paradigm, using number stimuli that were either low load (three digits long)...
We call a graph matching-covered if every line belongs to a perfect matching. We study the technique of "ear-decompositions" of such graphs. We prove that a non-bipartite matchingcovered graph contains K~ or K2@Ka (the triangular prism). Using this result, we give new characterizations of those graphs whose matching and covering numbers are equal. We apply these results to the theory of r-criti...
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2 3 -approximation to the maximum matching, and expected to get more matching pairs than a maximal matching, which only guarantees a 1 2 -approximation. The time complexity of t...
In the paper a model to predict the concentrations of particulate matter PM10, PM2.5, SO2, NO, CO and O3 for a chosen number of hours forward is proposed. The method requires historical data for a large number of points in time, particularly weather forecast data, actual weather data and pollution data. The idea is that by matching forecast data with similar forecast data in the historical data...
The anti-Kekulé number is the smallest number of edges that must be removed from a connected graph with a perfect matching so that the graph remains connected, but has no perfect matching. In this paper the values of the Anti-Kekulé numbers of the infinite triangular, rectangular and hexagonal grids are found, and they are, respectively, 9, 6 and 4.
BACKGROUND National Strategic Plans (NSPs) for HIV have become foundational documents that frame responses to HIV. Both Global Fund and PEPFAR require coordination with NSPs as a component of their operations. Despite the role of NSPs in country planning, no rigorous assessment of NSP targets and performance outcomes exists. We performed a quantitative analysis of the quality of NSP indicators ...
Generic Framework. Ontology matching is the process that takes two or more ontologies to identify semantically corresponding entities across them. As the numbers of developed ontologies as well as the number of entities in each ontology are increasing, traditional approaches to ontology matching fail or are not able to scale. Therefore, there is a growing need for new matching algorithms. A com...
عملیات تناظریابی عکسی (image matching) در تولید مدل رقومی زمین (dtm) همواره با مشکلات و تنگناهایی مواجه بوده است . برای حل مسئله تناظریابی، الگوریتمها و روشهای متنوعی پیشنهاد گردیده است اما عواملی از قبیل شیب سطوح شیء، اختلاف در موقعیت و حالات دوربین در دو لحظه عکسبرداری، شرایط روشنایی، انعکاس و ... تا حد قابل توجهی شباهت دو عکس را مخدوش می نماید بطوریکه دستیابی به نقاط متناظر را دچار اشکال می ...
Many real matching markets are subject to distributional constraints. To guide market designers faced with constraints, we propose new stability concepts. A matching is strongly stable if satisfying blocking pairs inevitably violates a constraint. We show that a strongly stable matching may not exist, and that existence is guaranteed if and only if all distributional constraints are trivial. To...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید