in this article, we apply two new fixed point theorems to investigate the existence of mild solutions for a nonlocal fractional cauchy problem with an integral initial condition in banach spaces.

in this paper, two inverse problems of stephen kind with local (dirichlet) boundary conditions are investigated. in the first problem only a part of boundary is unknown and in the second problem, the whole of boundary is unknown. for the both of problems, at first, analytic expressions for unknown boundary are presented, then by using these analytic expressions for unknown boundaries and bounda...

structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. biggest class of the repetitive subsequences is “transposable elements” which has its own sub-classes upon contexts’ structures. many researches have been performed to criticality determine the structure and function of repetitive su...

an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...

Multi-voxel pattern recognition techniques combined with Hidden Markov models can be used to discover the mental states that people go through in performing a task. The combined method identifies both the mental states and how their durations vary with experimental conditions. The paper applies this method to a task where participants solve novel mathematical problems. It identifies four states...

In order to retrieve, select and apply design patterns in a tool-supported way, we suggest to construct and document a problemcontext pattern that reflects the essence of the problems that the design pattern is meant to solve. In our approach, software engineers can choose examples of source code or UML models from the special domains that they are experts in. We present a method that enables s...

The Jumbled Pattern Matching problem consists on finding substrings which can be permuted to be equal to a given pattern. Similarly the δ Approximate Jumbled Pattern Matching problem asks for substrings equivalent to a permutation of the given pattern, but allowing a vector of possible errors δ. Here we provide a new efficient solution for the δ Approximate Jumbled Pattern Matching problem usin...