The opposite direction, that for any given P, e, h and q, the language L satisfying (2) is Turing-computable, follows from the fact that we can enumerate all points of P that are reachable from a given point 2 e (the algorithm has to follow the structure of P inductively, simplex for simplex, by marking the already detected reachable areas). 5. Future work. We think that the ideas, which we dev...

Background: There is no method to quantify the spatial complexity within colon polyps. This paper describes a spatial transformation that translates the tissue architecture within a polyp, or a normal colon lining, into a complex sinusoid wave composed of discrete points. This sinusoid wave can then undergo the Fast Fourier Transform to obtain a spectrum of frequencies that represents the sinus...

background and aims: bilirubin has been considered an antioxidant that protects against atherosclerosis. the aim of this study was to evaluate the relationship of serum bilirubin level with the severity and complexity of coronary artery disease (cad) and long-term outcome in the patients undergoing primary percutaneous coronary intervention (pci). materials and methods: this prospective cohort ...

undoubtedly, information technology (it) has undergone extensive developments in various social and economic spheres; its effect on human society is in such a way that the world today is referred as information society. besides, information technology, attributed as the main agent of global change, is to achieve meta- organization purposes. it also pertains to appropriate information formulated...

In this paperwe consider the problemof reconstructing a binarymatrix fromabsorbedprojections, as introduced in [Kuba and Nivat, LinearAlgebraAppl. 339 (2001) 171–194]. In particular we prove that two left and right horizontal absorbed projections along a single direction uniquely determine a row of a binary matrix for a specific absorption coefficient. Moreover, we give a linear time algorithm ...

A generalized class of infeasible-interior-point methods for solving horizontal linear complementarity problem is analyzed and suucient conditions are given for the convergence of the sequence of iterates produced by methods in this class. In particular it is shown that the largest step path following algorithms generates convergent iterates even when starting from infeasible points. The comput...