A modular system to recognize handwritten numerical strings is proposed. It uses a segmentation-based recognition approach and a Recognition and Verification strategy. The approach combines the outputs from different levels such as segmentation, recognition, and postprocessing in a probabilistic model. A new verification scheme which contains two verifiers to deal with the problems of oversegme...

Decision making problem is the process of finding the best option from all of the feasible alternatives. In this paper, from among multicriteria models in making complex decisions and multiple attribute models for the most preferable choice, technique for order preference by similarity to ideal solution (TOPSIS) approach has been dealt with. In real-word situation, because of incomplete or non-...

In the online bidding problem, a bidder is trying to guess a positive number T , by placing bids until the value of the bid is at least T . The bidder is charged with the sum of the bids. In the bounded online bidding problem, a parameter k is given, and the bidder is charged only with the largest k bids. It is known that the online bidding problem admits a 4-competitive deterministic algorithm...

Eliminating redundant messages in distributed programs leads to the reduction of communication overhead, and thus to the improvement of the overall performances of the distributed program. Therefore, a lot of work has been done recently to achieve this goal. In this paper, we present an algorithm for eliminating redundant messages in parallel programs that have been distributed automatically. T...

The purpose of this paper is to introduce a new way of choosing directions for the Mesh Adaptive Direct Search (MADS) class of algorithms. The advantages of this new ORTHOMADS instantiation of MADS are that the polling directions are chosen deterministically, ensuring that the results of a given run are repeatable, and that they are orthogonal to each other, therefore the convex cones of missed...

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the particular case of symmetric functions our bounds are matching and we exactly characterize the best possible competitiveness achievable by a deterministic algori...

In the problem of Online Call Admission in Optical Networks, briefly called oca, we are given a graph G = (V,E) together with a set of wavelengths W (χ := |W |) and a finite sequence σ = r1, r2, . . . of calls which arrive in an online fashion. Each call rj specifies a pair of nodes to be connected. A lightpath is a path in G together with a wavelength λ ∈ W . Upon arrival of a call, an online ...

objectives: the purpose of the present study was to investigate the effectiveness of cognitive-behavior education on decreasing deterministic thinking in mothers of children with autism spectrum disorders. methods: participants were 24 mothers of autistic children who were referred to counseling centers of tehran and their children’s disorder had been diagnosed at least by a psychiatrist and a ...

Lexical ambiguity and especially part-of-speech ambiguity is the source of much non-determinism in parsing. As a result, the resolution of lexical ambiguity presents deterministic parsing with a major test. If deterministic parsing is to be viable, it must be shown that lexical ambiguity can be resolved easily deterministically. In this paper, it is shown that Marcus's "diagnostics" can be hand...