The amount of information on the internet grows exponentially. It isnot enough anymore just to have a general access to this huge amount of data,instead it is becoming a necessity to be able to use different kinds ofautomatic filters to retrieve just the information you actually want. One solution for the information filtering and retrieval is context analysis in which one of the contexts of interest is the geographic context. This paper studies the problem and methodology of geoparsing – recognition of geographic names in unstructured textual content for the aim of extracting geographic context. A prototype implementation of a geoparsing system, capable of automatically analyzing unstructured text, recognizing geographic information and marking geographic names, is developed. Empirical evaluation of the system using articles from real-world news showed that the average quality of its geographic name recognition varies around 75-100%. Possible applications of the developed prototype include automated grouping of any texts by their geographic contexts (e.g., in news portals) and location-based search. Preliminary results of empirical evaluation showed that the average rate of its geographic name recognition varies around 75-100%.
Service oriented architecture (SOA) is an architecture for distributed applications composed of distributed services with weak coupling that are designed to meet business requirements. One of the research priorities in the field of SOA is creating such software design and development methodology (SDDM) that takes into account all principles of this architecture and allows for effective and efficient application development. A lot of investigation has been carried out to find out whether can one of popular SDDM, such as agile methodologies or RUP suits, be adapted for SOA or there is a need to create some new SOA-oriented SDDM. This paper compares one of SOA-oriented SDDM – SOUP – with RUP and XP methodologies. The aim is to find out whether the SOUP methodology is already mature enough to assure successful development of SOA applications. This aim is accomplished by comparing activities, artifacts of SOUP and RUP and emphasizing which XP practices are used in SOUP.
The article deals with interaction of tumour cells and leucocytes in the cylindrical cavities. This type of interaction is typical in the cases of development of a tumour in the intestine, blood vessel or in a bone cavity. Two cases are separated: the case of soft and hard tumour. In the case of a solid tumour, leucocytes can interact only with the surface cells of the tumour. This type of interaction is described by the system of two nonlinear first degree differential equations. The expressions of stationary points are obtained and analysis of their stability is performed. In the case of a soft tumour the system of two partial differential equations with first order derivatives and initial and boundary conditions is proposed. An algorithm for computing the numeric solution of the mathematical model is applied. In this case the diffusion of leucocytes and their ability to reach the tumour cells in the whole volume of the tumour is included. The algorithm is constructed and the system is solved numerically. Bifurcation curve is obtained. It separates two qualitatively different areas on the two parameter plane. Under the same initial parameters in the first area development of the tumour cells cannot be stopped, whereas in the second area leukocytes defeat the tumour cells.
Mathematical model of biosensor with competitive substrates conversion is analysed in this work. Model is described by partial differential reaction-diffusion equations with non-linear reaction term. Because of the non-linearity the analytical solutions exist only for extreme parameter values and thus the model in general case is solved by finite difference methods. The validity of the computational model is checked by comparing numerically obtained results to the known analytical solutions at the mentioned extreme parameter values. The purpose of this work is to determine the values of model parameters at which the impact of one of the substrates on the biosensor response can be minimized.
The current paper illustrates the importance of clustering the frequent items of code coverage during test suite reduction. A modular Most maximal frequent sequence clustered algorithm has been used along with a Requirement residue based test case reduction process. DU-pairs form the basic code coverage requirement under consideration for test suite reduction. This algorithm farewell when compared with few other algorithms like Harrold Gupta and Soffa (HGS) and Bi-Objective Greedy (BOG) algorithms and Greedy algorithms in covering all the DU-Pairs. The coverage criteria achieved is 100% in many cases, except for few insufficient and incomplete test suites.