Search

A biography of Rosa Obermayer Mayreder, theorist and activist of the Austrian women's movement and author, is presented. Mayreder was born in Vienna on November 30, 1858 and was raised in a family of 13 children. Mayreder broke out of the constraints imposed on her sex by acquiring knowledge and education, a privilege refused to the girls. As an author, she focused her essays on contemporary themes such as 19th century ideas of femininity.

In this paper, we propose a robust watermarking method for 3-D triangle surface meshes. Most previous methods based on the wavelet analysis can process only semi-regular meshes. Our proposal can be applied to irregular as well as regular meshes by using recently introduced irregular wavelet analysis scheme. L2-Norm of the wavelet coefficients is modified in various multi-resolution levels to embed the watermark. We also introduced a vertex and face re-ordering process as pre-processing in both watermark embedding and extraction for the robustness against connectivity reordering attacks. In addition, our proposal employs blind watermark detection scheme, which can extract the watermark without reference of cover mesh model. Through the simulations, we prove that our approach is robust against connectivity reordering as well as various kinds of geometrical attacks such as lossy compression and affine transform. [ABSTRACT FROM AUTHOR]

Most watermarking techniques for 3-D mesh models have mainly focused on robustness against various attacks, such as adding noise, smoothing, simplification, re-meshing, clipping, and so on. These attacks perceptually damage the stego model itself. Unlike watermarking of other multimedia data, serious attacks for 3-D meshes includes similarity transform and vertex re-ordering. They can fatally destroy the watermark without any perceptual degradation of the stego model. In this paper, we propose a new watermarking technique for 3-D polygonal mesh model, which modifies the distribution of vertex norms according to watermark bit to be embedded. In particular, the proposed employs blind watermark detection technique, which extracts the watermark without referring to cover meshes. The simulation results show that the proposed is remarkably robust against similarity transform and vertex re-ordering. [ABSTRACT FROM AUTHOR]

This paper is concerned with the question of quantifying gradient degrees of acceptability by introducing the notion of Density in the context of constructional constraint language processing. We first present here our framework for language processing, where all linguistic knowledge is represented by means of constraints. The grammar itself is a constraint system. A constraint is a relation among categories, which encodes a linguistic property. But in contrast to more traditional constraint-based approaches, a constraint can hold and be assessed independently from the structure. In this context, we then introduce the notion of density, based on proportions of satisfied and violated linguistic properties. Our intuition is that density can be used as a means to measure fuzzy notions such as syntactic complexity or as a criterion to identify gradient levels of acceptability. We present and discuss early experimental results concerning density. [ABSTRACT FROM AUTHOR]

An important property of strategies used to solve goals in functional logic programming (FLP) languages is the complete exploration of the solution space. Integrating constraints into FLP proved to be useful in many cases, as the resulting constraint functional logic programming (CFLP) offers more facilities and more efficient operational semantics. CFLP can be achieved by means of conditional rewrite systems with a narrowing-based operational semantics. A common idea to improve the efficiency of such operational semantics is to use specific algorithms from operations research as constraint solvers. If the algorithm does not return a complete set of solutions, the property of completeness might be lost. We present a real world timetabling problem illustrating this approach. We propose an algorithm, obtained as an integration of three known optimization algorithms for the linear assignment problem (LAP), enumerating solutions to the LAP in order of increasing weight, such that resolution of goals is complete again. We show, how the narrowing process can be tailored to use this algorithm and provide an efficient way to solve the timetable generation problem. Keywords: Functional-logic programming, Constraints, Narrowing,Timetable generation. [ABSTRACT FROM AUTHOR]

The article focuses on the magnetic resonance imaging (MRI). The principal use of MRI is to create an image of the distribution of certain physical properties of a substance. Magnetic resonance phenomena occur on a timescale that is short as related to many chemical reactions and can often be used to investigate the kinetics of chemical reactions. All solid or liquid objects, that bear suitable nuclei can be imaged. An important use of the MR phenomenon is in medical imaging. A constant magnetic field on a group or ensemble of spins creates a slight polarization. Detectable signal can be produced by rotating the spin vector partially into the transverse plane.

Dynamic light scattering measurements on oriented samples of dilute lyotropic smectics have been performed. The hydrodynamics of a two-component smectic A is reviewed and applied to describe the fluctuation spectrum in our multi-component samples. The layer compressibility modulus (at constant chemical potential) $$\bar B$$ is extracted from the anisotropic dispersion relation of the so-called slip mode, which arises from the coupling between concentration and layer displacement fluctuations. The samples, diluted with three different solvents, afford repeat distances of 50-800 Å; the behavior of $$\bar B$$ suggests either undulation or electrostatic repulsions between membranes, depending on the swelling solvent. [ABSTRACT FROM AUTHOR]