Multi-layer Architecture For Storing Visual Data Based on WCF and Microsoft SQL Server Database

In this paper we present a novel architecture for storing visual data. Effective storing, browsing and searching collections of images is one of the most important challenges of computer science. The design of architecture for storing such data requires a set of tools and frameworks such as SQL database management systems and service-oriented frameworks. The proposed solution is based on a multi-layer architecture, which allows to replace any component without recompilation of other components. The approach contains five components, i.e. Model, Base Engine, Concrete Engine, CBIR service and Presentation. They were based on two well-known design patterns: Dependency Injection and Inverse of Control. For experimental purposes we implemented the SURF local interest point detector as a feature extractor and $K$-means clustering as indexer. The presented architecture is intended for content-based retrieval systems simulation purposes as well as for real-world CBIR tasks.Comment: Accepted for the 14th International Conference on Artificial Intelligence and Soft Computing, ICAISC, June 14-18, 2015, Zakopane, Polan

New variants of Perfect Non-crossing Matchings

Given a set of points in the plane, we are interested in matching them with straight line segments. We focus on perfect (all points are matched) non-crossing (no two edges intersect) matchings. Apart from the well known MinMax variation, where the length of the longest edge is minimized, we extend work by looking into different optimization variants such as MaxMin, MinMin, and MaxMax. We consider both the monochromatic and bichromatic versions of these problems and by employing diverse techniques we provide efficient algorithms for various input point configurations

First LIGO search for gravitational wave bursts from cosmic (super)strings

We report on a matched-filter search for gravitational wave bursts from cosmic string cusps using LIGO data from the fourth science run (S4) which took place in February and March 2005. No gravitational waves were detected in 14.9 days of data from times when all three LIGO detectors were operating. We interpret the result in terms of a frequentist upper limit on the rate of gravitational wave bursts and use the limits on the rate to constrain the parameter space (string tension, reconnection probability, and loop sizes) of cosmic string models.Comment: 11 pages, 3 figures. Replaced with version submitted to PR

Stacked Search for Gravitational Waves from the 2006 SGR 1900+14 Storm

We present the results of a LIGO search for short-duration gravitational waves (GWs) associated with the 2006 March 29 SGR 1900+14 storm. A new search method is used, "stacking'' the GW data around the times of individual soft-gamma bursts in the storm to enhance sensitivity for models in which multiple bursts are accompanied by GW emission. We assume that variation in the time difference between burst electromagnetic emission and potential burst GW emission is small relative to the GW signal duration, and we time-align GW excess power time-frequency tilings containing individual burst triggers to their corresponding electromagnetic emissions. We use two GW emission models in our search: a fluence-weighted model and a flat (unweighted) model for the most electromagnetically energetic bursts. We find no evidence of GWs associated with either model. Model-dependent GW strain, isotropic GW emission energy E_GW, and \gamma = E_GW / E_EM upper limits are estimated using a variety of assumed waveforms. The stacking method allows us to set the most stringent model-dependent limits on transient GW strain published to date. We find E_GW upper limit estimates (at a nominal distance of 10 kpc) of between 2x10^45 erg and 6x10^50 erg depending on waveform type. These limits are an order of magnitude lower than upper limits published previously for this storm and overlap with the range of electromagnetic energies emitted in SGR giant flares.Comment: 7 pages, 3 figure