Given training sample, the problem of classifying Gaussian spatial data into one of two populations specified by conditional autoregressive model (CAR) with different mean functions is considered. This paper concerns with classification procedures associated with Bayes Discriminant Function (BDF) under deterministic spatial sampling design. In the case of complete parametric certainty, the overall misclassification probability associated with aforementioned BDF is derived. This is the extension of the previous one to the CAR case. Spatial weights based on inverse of Euclidean distance and the second and third order neighbourhood schemes on regular 2-dimensional lattice are used for illustrative examples.
The effect of the spatial sampling design, Mahalanobis distances and prior probabilities on the performance of proposed classification procedure is numerically evaluated.
Section 1 of this paper follows entirely a scenario from the article “Engineering Compliant Software: Advising Developers by Automating Legal Reasoning” by D. Oberle, F. Drefs, R. Wacker, C. Baumann and O. Raabe, SCRIPTed (2012) 9:3, 280–313, where it serves as a running example. It demonstrates that data transfer violates the law. This motivating scenario has added value in the education of software developers and is worth sharing with the computer communities of other countries including Lithuania. In the scenario, the continental law and EU law sways the particularities of the German law. The motivation for teaching the scenario can be compared with teaching concrete cases in the study of law. Legal reasoning is demonstrated by supplementing the provisions of the German Federal Data Protection Act (FDPA) with those of the Lithuanian Law on Legal Protection of Personal Data, which have the same meaning. In Section 3, we attempt to formulate the software compliance problem. Finally, we explain the notion of subsumption – a legal qualification of facts according to a norm’s circumstance. We consider subsumption to consist of two notions: terminological subsumption and normative subsumption.
Computational modelling of potential and resonant scattering for short range and Coulomb potentials was investigated in this study. The resonant scattering problem is formulated with the short range potential composed of a spherically symmetric square well and spherically symmetric square barrier. An iteration scheme of a continuous analogue of the Newton method for continuous spectral problem with correct asymptotic in uncoupled partial waves has been developed. The nonlinear representation of the scattering problem for the normalized radial Schrödinger equation is solved numerically using the difference sweep technique. The second order accuracy scheme developed allow to find scattering phases and wave functions as well as investigate their numerical evolution. The scattering phases and wave functions dependence on the scattering problem parameters have been studied.
This paper deals with the computational modeling of the pattern formation of luminous bacteria. Two bacterial self-organization models are investigated – Keller-Segel diffusion-advection-reaction type equations and the model with additional oxygen equation. These models were applied for the modeling of fluid cultures of lux-gene engineered Escherichia coli in the cylindrical container as seen from the side in 2 dimensions and in quasi-1 dimension along the top three phase contact line. The spatiotemporal patterns were simulated by using the finite difference technique. By applying these models the influence of the cylindrical container depth on the pattern formation was investigated.
Electrocardiograms and heart rate signals short distance transfer to mobile Android devices problem is examined. Energy saving and efficient use of bandwidth issues for signals transfer is discussed. Electrocardiograms and heart rate signaling proximity to mobile Android devices implementation possibilities is analyzed. Electrocardiograms and heart rate signals short distance transfer to mobile Android devices is proposed.
The popularity of the internet has led to a very rapid growth of IPv4 (Internet Protocol v4) users. This caused a shortage of IP addresses, so it was created a new version – IPv6 (Internet Protocol v6). Currently, there are two versions of IP for IPv4 and IPv6. Due to the large differences in addressing the protocols IPv4 and IPv6 are incompatible. It is therefore necessary to find ways to move from IPv4 to IPv6. To facilitate the transition from one version to another are developed various mechanisms and strategies. Comparative analysis is done for dual stack, 6to4 tunnel and NAT64 mechanisms in this work. It has helped to reveal the shortcomings of these mechanisms and their application in selection of realization decisions.
The purpose of this paper is to describe the computational algorithmic generation of the high-quality digital halftones (grey/colour patterns). At the beginning, the formal model for generation of the digital halftones, the so-called grey pattern problem (GPP) is introduced. Then, the heuristic algorithm for the solution, in particular, of the grey pattern problem is discussed. Although the algorithm employed does not guarantee the optimality of the solutions found, still superior-quality, near-optimal (and in some cases probably optimal) solutions can be achieved within reasonable computation time. Further, we provide the results of the extensive computational experiments with the newly proposed, extra-large size instance (data set) of the GPP — which is the main contribution of this work. As a confirmation of the quality of the solutions produced, we also give the visual representations of several fine-looking halftone patterns and the reader can judge about the perfection of the images obtained.
In this paper, we present a comparative analysis of hierarchical clustering and multidimensional scaling methods for genotype and phenotype data analysis. Fisher's exact test was applied to determinate dependencies between congenital anomalies. In order to determine the relationship between the dependences of congenital anomalies, deformations, these systems’ micro anomalies and congenital anomalies associated with orofacial clefs, the Spearman and Kendall correlation coefficients were applied. It has been detected which methods are better for genetic data visualization.
Breast cancer is the most frequent women cancer form and one of the leading mortality causes among women around the world. Patients with pathological mutation of a BRCA gene have 65% lifelong breast cancer probability. It is known that such patients have different cause of illness. In this study, we have proposed a new approach for the prediction of BRCA mutation carriers by methodically applying knowledge discovery steps and utilizing data mining methods. An alternative BRCA risk assessment model has been created utilizing decision tree classifier model. The biggest challenge was a very small size and imbalanced nature of the initial dataset, which have been collected by clinicians during 4 years of clinical trial. Iterative optimization of initial dataset, optimal algorithms selection and their parameterization have resulted in higher classifier model performance, with acceptable prediction accuracy for the clinical usage. In this study, three data mining problems have been analyzed using eleven data mining algorithms.
The issue of making contracts between services in Service-Oriented Architecture (SOA) arises naturally, because in real life services are subjects for negotiation and contracting. The notion of contract in SOA is rather misleading, because usually means just technical specification – input and output parameters, pre- and postconditions. However, there are also other aspects of contract. Service Level Agreements (SLAs) often are used together with technical contract. SLAs describes the level of service expected by a customer from a supplier, laying out the metrics by which that service is measured, the remedies or penalties in case the agreed-upon levels are not achieved. The paper aim to clear up the notions of contract and agreement in SOA, discusses the properties of languages that are used to specify contacts and agreements, paying special attention to their legal aspects and comparing contract features in WS-Agreement ir WSLA.