one of the most remarkable basis of the gravity data inversion is the recognition of sharp boundaries between an ore body and its host rocks during the interpretation step. therefore, in this work, it is attempted to develop an inversion approach to determine a 3d density distribution that produces a given gravity anomaly. the subsurface model consists of a 3d rectangular prisms of known sizes ...

Two fundamental factors affecting the speed of spoken word production are lexical frequency and sentential constraint, but little is known about their timing and electrophysiological basis. In the present study, we investigated event-related potentials (ERPs) and oscillatory brain responses induced by these factors, using a task in which participants named pictures after reading sentences. Sent...

The problem of extracting sinusoid signals from noisy observations made at equally spaced times is considered. Eigenanalysis methods, such as Pisarenko’s method and the extended Prony method, find the eigenvector with minimum eigenvalue of a suitably chosen matrix, and then obtain the complex sinusoids as the roots of the polynomial which has the components of the eigenvector as coefficients. F...

As a representative sequential pattern mining problem, counting the frequency of serial episodes from a streaming sequence has drawn continuous attention in academia due to its wide application in practice, e.g., telecommunication alarms, stock market, transaction logs, bioinformatics, etc. Although a number of serial episodes mining algorithms have been developed recently, most of them are nei...

Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this survey paper we discuss an algebraic approach that has proved to be very successful in studying the complexity of constraint problems. 1 Constraint satisfaction problems The constraint satisfaction problem (CSP) is a powe...

This paper introduces a new framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. Contrary to previous work (SPIRIT algorithms), we represent REs by tree structures and our algorithm can choose dynamically an extraction method according to the local selectivity of the sub-REs. Interestingly, pruning can rely not only on the anti-monotonic mini...

We study an equilibrium in which agents face surprise liquidity shocks and invest in liquid and illiquid riskless assets. The random holding horizon from liquidity shocks makes the return of the illiquid security risky. The equilibrium premium for such risk depends on the constraint that agents face when borrowing against future income; it is insignificant without borrowing constraint, but can ...