geophysical data are always affected by different sources of anomaly. these sources are classified in to three groups: first group is relatively deep sources commonly called as regional effects, second group is near surface sources or local effects and third group is high frequency noises. the only common way to separate the anomaly is separation with respect to the signal frequency. there are ...

With the help of the continuation theorem of the coincidence degree, a priori estimates, and differential inequalities, we make a further investigation of a class of planar systems, which is generalization of some existing neural networks under a time-varying environment. Without assuming the smoothness, monotonicity, and boundedness of the activation functions, a set of sufficient conditions i...

This is in general a hard problem The problem is NP complete Knuth cf even if we restrict ourselves to planar undirected graphs Lynch assuming that k is variable On the other hand it is a deep result of Robertson and Seymour that for each xed k the problem can be solved in polynomial time in any undirected graph However for directed graphs the problem remains di cult even for k This was shown b...

We show that computing the lexicographically first four-coloring for planar graphs is ∆p 2 hard. This result optimally improves upon a result of Khuller and Vazirani who prove this problem to be NP-hard, and conclude that it is not self-reducible in the sense of Schnorr, assuming P 6= NP. We discuss this application to non-self-reducibility and provide a general related result.

The 1999 Chi-Chi earthquake (MW 7.6) (20 September 1999, 17:47:15.9 UTC) (located at 23.853 N, 120.816 E, and depth of 7.5 km) inflicted severe regional scale damage to Taiwan. The strong-motion wavefield was captured by a dense network of stations (with average station spacing of 5 km), which represents the most complete strong-motion dataset to date to use to study the kinematic source proces...

An intelligent strategy for the protection of AC microgrids is presented in this paper. This method was halving to an initial signal processing step and a machine learning-based forecasting step. The initial stage investigates currents and voltages with a window-based approach based on the dynamic decomposition method (DDM) and then involves the norms of the signals to the resultant DDM data. T...

the nnw-trending dena fault, with 140 km length, cuts the major structures of zagros fold-thrust belt in borujen region. the fault has divided the region in two zones, in which different structural, andmorphological features as well assedimentation and seismtectonic characteristics have developed. this study presents a new interpretation for the kinematics of dena fault based on field evidence....

We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of this result is that Planar Connected Vertex Cover has no kernel with at most (9/8 − ǫ)k vertices, for any ǫ > 0, assuming P 6= NP. We also show a very simple...

This note is part of implementation of a programme in foundations of mathematics to find exact threshold versions of all mathematical unprovability results known so far, a programme initiated by A. Weiermann. Here we find the exact versions of unprovability of the finite graph minor theorem with growth rate condition restricted to planar graphs, connected planar graphs and graphs embeddable int...

Given a tesselation of the plane, defined by a planar straightline graph G, we want to find a minimal set S of points in the plane, such that the Voronoi diagram associated with S ‘fits’ G. This is the Generalized Inverse Voronoi Problem (GIVP), defined in [12] and rediscovered recently in [3]. Here we give an algorithm that solves this problem with a number of points that is linear in the size...