Design and Applications of Multi-Frequency Holographic Subsurface Radar: Review and Case Histories

Holographic subsurface radar (HSR) is not currently in widespread usage. This is due to a historical perspective in the ground-penetrating radar (GPR) community that the high attenuation of electromagnetic waves in most media of interest and the inability to apply time-varying gain to the continuous-wave (CW) HSR signal preclude sufficient effective penetration depth. While it is true that the fundamental physics of HSR, with its use of a CW signal, does not allow amplification of later (i.e., deeper) arrivals in lossy media (as is possible with impulse subsurface radar (ISR)), HSR has distinct advantages. The most important of these is the ability to do shallow subsurface imaging with a resolution that is not possible with ISR. In addition, the design of an HSR system is simpler than for ISR due to the relatively low-tech transmitting and receiving antennae. This paper provides a review of the main principles of HSR through an optical analogy and describes possible algorithms for radar hologram reconstruction. We also present a review of the history of development of systems and applications of the RASCAN type, which is possibly the only commercially available holographic subsurface radar. Among the subsurface imaging and remote sensing applications considered are humanitarian demining, construction inspection, nondestructive testing of dielectric aerospace materials, surveys of historic architecture and artworks, paleontology, and security screening. Each application is illustrated with relevant data acquired in laboratory and/or field experiments

Measurements of Elastic Moduli of Silicone Gel Substrates with a Microfluidic Device

Thin layers of gels with mechanical properties mimicking animal tissues are widely used to study the rigidity sensing of adherent animal cells and to measure forces applied by cells to their substrate with traction force microscopy. The gels are usually based on polyacrylamide and their elastic modulus is measured with an atomic force microscope (AFM). Here we present a simple microfluidic device that generates high shear stresses in a laminar flow above a gel-coated substrate and apply the device to gels with elastic moduli in a range from 0.4 to 300 kPa that are all prepared by mixing two components of a transparent commercial silicone Sylgard 184. The elastic modulus is measured by tracking beads on the gel surface under a wide-field fluorescence microscope without any other specialized equipment. The measurements have small and simple to estimate errors and their results are confirmed by conventional tensile tests. A master curve is obtained relating the mixing ratios of the two components of Sylgard 184 with the resulting elastic moduli of the gels. The rigidity of the silicone gels is less susceptible to effects from drying, swelling, and aging than polyacrylamide gels and can be easily coated with fluorescent tracer particles and with molecules promoting cellular adhesion. This work can lead to broader use of silicone gels in the cell biology laboratory and to improved repeatability and accuracy of cell traction force microscopy and rigidity sensing experiments

A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization

This paper is concerned with solving the single machine scheduling problem with release dates and sequence-dependent setup times in order to minimize the makespan. For this purpose, a variable block insertion heuristic (VBIH) algorithm is applied to the pHUST Project by the National Natural Science Foundation of China in Wuhan [51435009]; Natural Science Foundation of China (NSFC)National Natural Science Foundation of China (NSFC) [51775216, 51825502]; Natural Science Foundation of Hubei ProvinceNatural SComputer Science, Artificial IntelligenceComputer Scienc

Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations

This paper considers the integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel turnover times and maximize the terFulbright Program; Bureau of Educational and Cultural Affairs of the United States Department of StateComputer Science, Artificial Intelligence; Computer Science, Software Engineering; Operations Research & Management ScienceComputer Science; Operations Research & Management Scienc

A Discrete Artificial Bee Colony Algorithm for the Assignment and Parallel Machine Scheduling Problem in DYO Paint Company

This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the DYO paint company by using theirComputer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & ElectronicComputer Science; Engineerin

A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion

In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search to theDepartment of Industrial Engineering, Yasar University, Izmir, 35100, Turkey; Department of Industrial and System Engineering, Istinye University, Istanbul, 34010, Turkey; Department of Industrial and Manufacturing System Engineering, Huazhong Universit

A populated local search with differential evolution for blocking flowshop scheduling problem

This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search algorithms are simple but extremelyIndustrial Engineering Department, Yasar University, Izmir, Turkey; State Key Laboratory, Huazhong University of Science and Technology, Wuhan, China; Industrial and Systems Engineering Department, Ohio UniversityOH, United State

A populated iterated greedy algorithm with inver-over operator for traveling salesman problem

In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction and construction. The basic idIndustrial Engineering Department, Yasar University, Izmir, Turkey; Software Engineering Department, Yasar University, Izmir, Turke