Hartvigsen, D. and E. Zemel, The complexity of lifted inequalities for the knapsack problem, Discrete Applied Mathematics 39 (1992) 11. 123. It is well known that one can obtain facets and valid inequalities for the knapsack polytope by lifting simple inequalities associated with minimal covers. We study the complexity of lifting. We show that recognizing integral lifted facets or valid inequal...

Given the recent explosion in the use of folksonomies to describe digital objects, it is important to study how users tag items in order to design online systems that best meet their needs. This small-scale study explored what music information facets users of the social music website last.fm might consider when assigning emotion-based tags to describe songs, as well as whether a small group of...

People search is an important search task where the goal is to find people instead of documents. Providing search facets in a people search system can help users better describe their search intents. Some systems provide checkboxes for the discrete values of each facet to assist users filtering search results. Some other systems in recent studies provide sliders to represent the continuous valu...

Least-cost modeling for focal species is the most widely used method for designing conservation corridors and linkages. However, these designs depend on today's land covers, which will be altered by climate change. We recently proposed an alternative approach based on land facets (recurring landscape units of relatively uniform topography and soils). The rationale is that corridors with high co...

هدف: این پژوهش با هدف ارائه مدل چالش‌های پرورش کودکان کم‌شنوای پیش‌دبستانی از دیدگاه مادران و متخصصان بر اساس نظریه داده‌بنیاد انجام ‌شده است. روش: نمونه 15 مادر کودک کم‌شنوا 4 تا 6 ساله انجمن والدین شهر تهران 5 متخصص حوزه ناشنوا بودند که در سال 1400 استفاده روش نمونه‌گیری هدفمند انتخاب شدند. چالش ­های طریق مصاحبه نیمه ساختاریافته عمیق رسیدن به اشباع نظری جمع‌آوری کدگذاری (کدگذاری باز، محوری ان...

This article studies the polyhedral structure of the 4-node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4-node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4-node NDP is important because it implies complete knowledge of 4-partition-based facets of larger NDPs. After ...