Abs t rac t . In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We obtain a closed formula that expresses the minimum number of searchers required to search a pseudo 3-sided solid orthoconvex grid. From that formula and a rather straight forward algorithm we show that the problem is in P. We obtain a parallel version of that algorithm that places the...

0

Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...

This paper explores the feasibility of detecting damage within structures such as air foils by application of eddy current based techniques and reduced order modeling. To identify the geometry of a damage, an optimization algorithm is employed which requires solving the forward problem numerous times. Therefore, the forward algorithm must be solved with extremely fast and accurate solution meth...

This paper deals with the recognition of spelled names over the telephone. It introduces an efficient way of handling the spelling grammar, that is the lexicon of the allowed spelled names. The proposed approach is based on a forward-backward algorithm. The constraints on the sequences of letters are derived from the lexicon and are used by the A* algorithm in the backward pass. This forward-ba...

We introduce an iterative approach to recognizing two-dimensional grammatical structure within digital images, which we term “turbo recognition.” Inspired by the success of turbo decoding for channel coding of one-dimensional sequences, we develop a recognition scheme for images based on two independent views of the same underlying message. These correspond to two independent image sources, one...

Forward-backward pursuit (FBP) algorithm is a novel two-stage greedy approach. However once its forward and backward steps were determined during iteration, it would make computing time increased and affected the reconstruction efficiency. This paper presents a algorithm called forward-backward pursuit algorithm based on weak selection (SWFBP) by introducing threshold strategy into FBP algorith...

We begin with a survey on well structured transition systems and, in particular, we present the ideal framework [FG09a,BFM14] which was recently used to obtain new deep results on Petri nets and extensions. We argue that the theory of ideals prompts a renewal of the theory of WSTS by providing a way to define a new class of monotonic systems, the so-called Well Behaved Transition Systems, which...