نتایج جستجو برای: انتقال بحران move crisis

تعداد نتایج: 183440  

Journal: : 2022

نخستین گام در راستای تحلیل و ارزیابی ریسک‌های زنجیره تأمین شناسایی این ریسک‌ها است. روش‌های مرسوم بر اساس فیلترهای دستی یا خودکار داده‌­محور ارائه شده فیلتر به‌­دلیل محدودیت‌های نمونه‌گیری دارای مشکلات اعتبارسنجی هستند از طرف دیگر مبتنی داده، داده‌های ریسک که پیچیده مبهم هستند، عملکرد ضعیفی دارند. برای پرکرده خلل پژوهشی، پژوهش، چارچوبی تعاملی بین تحلیل‌­گر ماشین حجم وسیعی حوزه مواد غذایی با است...

Journal: : 2021

اثرات ویرانگر بلایای طبیعی، اهمیت لجستیک و برنامه‌ریزی منابع انسانی را در مراحل قبل بعد از بحران نشان می‌دهد. هنگام بروز به ‌منظور امدادرسانی سریع، شبکه سلسله ‌مراتبی سلامت که شامل درمانگاه‌ها بیمارستان‌ها است، فعال می‌شود. این پژوهش با استفاده مدل ریاضی مختلط عدد صحیح درنظرگرفتن موقعیت فعلی درمانگاه‌ها، مکان‌های بهینه‌ای عنوان «مراکز درمان موقت» تعیین نحوه تخصیص بهینه مصدومان ناحیه‌های شهری مر...

Journal: :Social Sciences 2022

This Special Issue on Crisis, (Im)mobilities and Young Life Trajectories examines the intersections of developmental trajectories (im)mobility amidst crises, with a focus ruptures, transitions, disruptions continuities in life course children young people who have been forced to move due various man-made natural crises [...]

Journal: :CoRR 2009
Kumiko Hattori Tetsuya Hattori

We study a hydrodynamic limit approach to move-to-front rules, namely, a scaling limit as the number of items tends to infinity, of the joint distribution of jump rate and position of items. As an application of the limit formula, we present asymptotic formulas on search cost probability distributions, applicable for general jump rate distributions.

Journal: :Softw., Pract. Exper. 2002
Sebastian Deorowicz

In this paper we fix our attention on the second step algorithms of the Burrows–Wheeler compression algorithm, which in the original version is the Move To Front transform. We discuss many of its replacements presented so far, and compare compression results obtained using them. Then we propose a new algorithm that yields a better compression ratio than the previous ones.

2004
OLA M. FINCKE

For mate-searching species, the learnedmate recognition (LMR) hypothesis assumes that sexual harassment favours signal variation among females, which exploits the receiver ability of males. Themodel predicts that coevolving males have responded to the female sexual foil by learning to recognize female variants as potential mates. I translate the LMR hypothesis into the language of signal detect...

Journal: :ICGA Journal 2000
Thomas Thomsen

This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequences (so-called lambda-trees), focusing the search on threats and threat-aversions, but still guaranteeing to find the minimax value (provided that the game-rules allow passing or zugzwang is not a motive). Using neg...

2016
Dain Kaplan Neil Rubens Simone Teufel Takenobu Tokunaga

Active learning (AL) is often used in corpus construction (CC) for selecting “informative” documents for annotation. This is ideal for focusing annotation efforts when all documents cannot be annotated, but has the limitation that it is carried out in a closed-loop, selecting points that will improve an existing model. For phenomena-driven and exploratory CC, the lack of existing-models and spe...

2006
Loredana Laera Valentina A. M. Tamma Jérôme Euzenat Trevor J. M. Bench-Capon Terry R. Payne

In open and dynamic environments, agents will usually differ in the domain ontologies they commit to and their perception of the world. The availability of Alignment Services, that are able to provide correspondences between two ontologies, is only a partial solution to achieving interoperability between agents, because any given candidate set of alignments is only suitable in certain contexts....

2001
Florian Kandler

The work described in this paper presents an approach on scheduling in a virtual enterprise in the tourism sector. This scheduling scenario has to reconcile customers’ and service providers’ interests. That is, the customer’s temporal constraints on when to consume the service, and the service provider’s preferences on when to accept a booking. An algorithm is being developed for this situation...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید