Manual fingerprint classification algorithms are very time consuming, and usually not accurate. Fast and accurate fingerprint classification is essential to each AFIS (Automatic Fingerprint Identification System). This paper investigates a fingerprint classification algorithm that reduces the complexity and costs associated with the fingerprint identification procedure. A new structural algorit...

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...

Our work assessed the accuracy of the original zygosity classification in the Vietnam Era Twin (VET) Registry using new information from DNA markers on a subset of participants. We then constructed an updated zygosity classification algorithm. The VET Registry includes 7,375 male-male twin pairs who served in the military during the Vietnam era. During the mid-1980s 4,774 twin pairs completed a...

Educational Self-Selection, Tasks Assignment and Rising Wage Inequality This paper presents a general equilibrium assignment model of workers to tasks with endogenous human capital formation and multidimensionality of skills. The model has 2 key features. First, skills are endogenous and multidimensional. Second, two types of assignment occur, workers self-select their education and firms assig...

The present paper thoroughly explores second-best efficient allocations in an adverse selection insurance economy. We start from a natural extension of the classical model, assuming less than perfect risk perceptions. We propose first and second welfare theorems, by means of which we describe efficiencyenhancing policies. Notions of weak and strong adverse selection are promising for interpreti...

This paper presents a genetic algorithm to solve the orienteering problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are specified, so as to maximize the total score collected subject to a prescribed distance constraint. Employing several sets of test problems from the literature, the performance of the genetic algorithm i...