as a sequel of the recent works, we would like to discuss another stage for the solution of the mixed problem which considers the concepts of well operated conditions applicable to the solution of mixed problem, i.e. the existence and uniqueness of the solution must always conformable with some assumptions.

Consider a class of optimization problems for which the cardinality of the set of feasible solutions is m and the size of every feasible solution is N. We prove in a general probabilistic framework that the value of the optimal solution and the value of the worst solution are asymptotically almost surely (a.s.) the same provided log m = o(N) as N and m become large. This result implies that for...

This chapter presents a security engineering process based on UML security problem frames and concretized UML security problem frames. Both kinds of frames constitute patterns for analyzing security problems and associated solution approaches. They are arranged in a pattern system that makes dependencies between them explicit. The authors describe step-by-step how the pattern system can be used...

Abstract The Singleton pattern [1] is a solution to (some of) the drawbacks of using global variables. Among its advantages is that the instance is always created prior to being referenced (this effectively solves the problem of initialization order when several interdependent instances are involved). This article examines some of the existing Singleton realizations in C++ and their drawbacks, ...

General object recognition is a difficult problem. In [2], we proposed a novel solution for object recognition in an unconstrained environment. We simplified the recognition problem by attaching a special planar pattern on objects of interest. This approach allows us to determine the pose easily. A robust detector for the pattern was developed for the first stage of the solution (Soh[3]). This ...

We consider two-dimensional cutting stock problems where single rectangular stocks have to be cut into some smaller rectangular so that the number of stocks needed to satisfy the demands is minimum. In this paper we focus our study to the problem where the stocks have to be cut with guillotine cutting type and fixed orientation of finals. We formulate the problem as an integer programming, wher...

The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks to compute, for every text location with a swapped match of P , the number of swaps necessary to obtain a match at the location. In this paper, we present new efficient algo...

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

The Manager-Workers pattern is an architectural pattern for parallel programming, used when a design problem can be understood in terms of activity parallelism. This pattern proposes a solution in which the same operations are performed simultaneously and independently on different pieces of data. Operations carried out by each component are independent of operations by other components.

The longest common subsequence is a classical problem which is solved by using the dynamic programming approach. The LCS problem has an optimal substructure: the problem can be broken down into smaller, simple "subproblems", which can be broken down into yet simpler subproblems, and so on, until, finally, the solution becomes trivial. The LCS problem also has overlapping subproblems: the soluti...