Due to the huge amount of data published on the Web, the Web search process has become more difficult, and it is sometimes hard to get the expected results, especially when the users are less certain about their information needs. Several efforts have been proposed to support exploratory search on the web by using query expansion, faceted search, or supplementary information extracted from exte...

Observations: A young woman was observed to have clinical lightening of her garment nevus and satellite nevi during 2 sequential pregnancies. Postpartum, the patient experienced darkening and repigmentation in her large garment nevus, with continued lightening of nearby satellite lesions. In addition to photographic documentation of these changes, biopsy samples taken during pregnant and nonpre...

Bleaching tetracycline-stained teeth is the most challenging form of tooth lightening. This article reports on 44 subjects who bleached their tetracycline-stained teeth for 6 months using trays with reservoirs overnight in a half-mouth designed study and 2 of 3 different concentrations of carbamide peroxide (10%, 15% or 20%). The subjects were followed for 5 years. The area evaluated was the mi...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...

A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...