n this paper, we apply picard’s iteration method followed by adomian decomposition method to solve a nonlinear singular cauchy problem of euler- poisson- darboux equation. the solution of the problem is much simplified and shorter to arriving at the solution as compared to the technique applied by carroll and showalter (1976)in the solution of singular cauchy problem.

this paper presents time domain fundamental solutions for the extended biot's dynamic formulations of two-dimensional (2d) unsaturated poroelasticity. unsaturated porous media is considered as a porous media in which the voids are saturated with two immiscible fluids, i.e. liquid and gas. at first, the corresponding explicit laplace transform domain fundamental solution is obtained in term...

We consider the streaming complexity of a fundamental task in approximate pattern matching: the k-mismatch problem. It asks to compute Hamming distances between a pattern of length n and all length-n substrings of a text for which the Hamming distance does not exceed a given threshold k. In our problem formulation, we report not only the Hamming distance but also, on demand, the full mismatch i...

Networks on Chip (NoCs) have been steadily investigated from reliability, efficiency, and performance perspectives.However, little effort has been directed towards the security of complex on-chip networks. These networks are prone to attacks similar to those perpetrated against large scale networks such as datacenters and the internet. If a single core within an NoC is compromised, it can be us...

Over the past two decades researchers have increasingly become aware of the fact that language teaching can benefit from the field of discourse analysis and pragmatics. This paper analyzes the applicability of the so called problem-solution pattern to the teaching of writing. An experiment was conducted in order to test M. Hoey’s (2001) belief that the pattern can serve as a ready-made template...

We review previous solutions of problem nr. 10769 posed by Christian Blatter A 1988 paper by C. D. Godsil and J. Zaks [1] states the following result, which is the solution of problem nr. 10769: “Let G be the graph with the points of the unit sphere in three dimensions as its vertices, and two vertices adjacent if and only if they are orthogonal as unit vectors (i.e., their spherical distance i...

  Background: The sale of food by street vendors is an activity of economic, sanitary, and nutritional importance, but these foods can pose a high risk to the health of consumers in inadequate conditions of preparation and storage. The aim of this study was to investigate the preparation conditions and the hygienic-sanitary quality of food sold by street vendors in the vicinity of four campuse...

We consider the problem of linear regular tree pattern matching and describe a new solution based on a bottom up technique. Current bottom up techniques preprocess the patterns and construct a nite state tree pattern matching automaton for the purpose. Though matching time is linear in the size of the subject tree, the size of the automaton can be exponential in the sum of the sizes of all patt...

Symbolic pattern solving is a new approach for nding symbolic solutions of equa-tional constraints over arbitrary algebraic structures. Despite the deep results and methods already produced in equational constraint solving, real-world applications still cannot be tackled. To reduce the original complexity, the approach advocated here uses the solution pattern, the skeleton of the solution often...