Nowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions an...

Mug-shot search is the classic example of the general problem of searching a large facial image database when starting out with only a mental image of the soughtafter face. We have implemented a prototype content-based image retrieval system that integrates composite face creation methods with a face-recognition technique (Eigenfaces) so that a user can both create faces and search for them aut...

We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y ∈ [0, 1] with as little uncertainty as possible, using some given number k of probes. Each probe is specified by a real number r ∈ [0, 1]. After a probe at r , we are told whether x ≤ r or x ≥ r , and whether y ≤ r or y ≥ r . We derive the optimal s...

This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...

Our work is confined to word access, that is, we present here our ideas of how to improve electronic dictionaries in order to help language producers (speaker/writer) to find the word they are looking for. Our approach is based on psychological findings (representation, storage and access of information in the human mind), observed search strategies and typical navigational behavior. If one agr...

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

In STOC’16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important box, then one would like to find it faster. Assuming there are many searchers, the authors suggest that using an algorithm that requires no coordination between searchers can be highly beneficial. Indeed, besides savin...

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...

the gravitational search algorithm (gsa) is a novel optimization methodbased on the law of gravity and mass interactions. it has good ability to search forthe global optimum, but its searching speed is really slow in the last iterations. sothe hybridization of particle swarm optimization (pso) and gsa can resolve theaforementioned problem. in this paper, a modified pso, which the movement ofpar...