Topologias maximais com respeito a algumas famílias de subconjuntos

Seja (X; t) um espaço topológico e seja F a família de todos os subconjuntos de X que satisfazem uma propriedade topológica dada P (invariante por homeomorfismos). Se acrescentarmos abertos novos à topologia e se F\' é a família de todos os subconjuntos do novo espaço que satisfazem a propriedade P, podemos ter que F ≠ F\'. Se isto sempre acontece, dizemos que o espaço (X; t) é maximal com respeito à família F. Neste trabalho estudaremos os espaços topológicos maximais com respeito a algumas famílias de subconjuntos: discretos, compactos, densos, conexos e das sequências convergentes.

The Lindelöf number greater than continuum is u-invariant

2000 Mathematics Subject Classification: 54C35, 54D20, 54C60.

Note on similarity solutions for viscous flow over an impermeable and non-linearly (quadratic) stretching sheet

Similarity solutions for flow over an impermeable, non-linearly (quadratic) stretching sheet were studied recently by Raptis and Perdikis (Int. J. Non-linear Mech. 41 (2006) 527–529) using a stream function of the form ψ=αxf(η)+βx2g(η). A fundamental error in their problem formulation is pointed out. On correction, it is shown that similarity solutions do not exist for this choice of ψ

Security analysis of linearly filtered NLFSRs

Non-linear feedback shift register (NLFSR) ciphers are cryptographic tools of choice of the industry especially for mobile communication. Their attractive feature is a high efficiency when implemented in hardware or software. However, the main problem of NLFSR ciphers is that their security is still not well investigated. The paper makes a progress in the study of the security of NLFSR ciphers. In particular, we show a distinguishing attack on linearly filtered NLFSR (or LF-NLFSR) ciphers. We extend the attack to a linear combination of LF-NLFSRs. We investigate the security of a modified version of the Grain stream cipher and show its vulnerability to both key recovery and distinguishing attacks.

Short-term traffic volume forecasting : a k-nearest neighbor approach enhanced by constrained linearly sewing principle component algorithm

To enhance the performance of the k-nearest neighbors approach in forecasting short-term traffic volume, this paper proposed and tested a two-step approach with the ability of forecasting multiple steps. In selecting k-nearest neighbors, a time constraint window is introduced, and then local minima of the distances between the state vectors are ranked to avoid overlappings among candidates. Moreover, to control extreme values’ undesirable impact, a novel algorithm with attractive analytical features is developed based on the principle component. The enhanced KNN method has been evaluated using the field data, and our comparison analysis shows that it outperformed the competing algorithms in most cases.

Transient state work fluctuation theorem for a classical harmonic oscillator linearly coupled to a harmonic bath

Based on a Hamiltonian description we present a rigorous derivation of the transient state work fluctuation theorem and the Jarzynski equality for a classical harmonic oscillator linearly coupled to a harmonic heat bath, which is dragged by an external agent. Coupling with the bath makes the dynamics dissipative. Since we do not assume anything about the spectral nature of the harmonic bath the derivation is not restricted only to the Ohmic bath, rather it is more general, for a non-Ohmic bath. We also derive expressions of the average work done and the variance of the work done in terms of the two-time correlation function of the fluctuations of the position of the harmonic oscillator. In the case of an Ohmic bath, we use these relations to evaluate the average work done and the variance of the work done analytically and verify the transient state work fluctuation theorem quantitatively. Actually these relations have far-reaching consequences. They can be used to numerically evaluate the average work done and the variance of the work done in the case of a non-Ohmic bath when analytical evaluation is not possible.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

Bearing Capacity of Clays whose Cohesion Increases Linearly with Depth

Experimental studies (Bishop 1966) show that for saturated normally consolidated clay the cohesion varies linearly with depth. The ultimate bearing capacity in such soil is generally obtained by limit equilibrium and limit analysis methods. Sokolovski's (1960) approach to the method of characteristics is used to find the ultimate bearing capacity of saturated clay whose cohesion is homogeneous and isotropic. In this technical note, the method of characteristics is further developed to determine ultimate bearing capacity of clay whose cohesion varies linearly with depth.

Features in visual search combine linearly

Single features such as line orientation and length are known to guide visual search, but relatively little is known about how multiple features combine in search. To address this question, we investigated how search for targets differing in multiple features ( intensity, length, orientation) from the distracters is related to searches for targets differing in each of the individual features. We tested race models (based on reaction times) and coactivation models ( based on reciprocal of reaction times) for their ability to predict multiple feature searches. Multiple feature searches were best accounted for by a co-activation model in which feature information combined linearly (r = 0.95). This result agrees with the classic finding that these features are separable i.e., subjective dissimilarity ratings sum linearly. We then replicated the classical finding that the length and width of a rectangle are integral features-in other words, they combine nonlinearly in visual search. However, to our surprise, upon including aspect ratio as an additional feature, length and width combined linearly and this model outperformed all other models. Thus, length and width of a rectangle became separable when considered together with aspect ratio. This finding predicts that searches involving shapes with identical aspect ratio should be more difficult than searches where shapes differ in aspect ratio. We confirmed this prediction on a variety of shapes. We conclude that features in visual search co-activate linearly and demonstrate for the first time that aspect ratio is a novel feature that guides visual search.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

Potential energy model for turbulent entrainment across density interface in a linearly stratified fluid

A potential energy model is developed for turbulent entrainment in the absence of mean shear in a linearly stratified fluid. The relation between the entrainment distance D and the time t and the relation between dimensionless entrainment rate E and the local Richardson number are obtained. An experiment is made for examination. The experimental results are in good agreement with the model, in which the dimensionless entrainment distance D is given by DBAR = A(i)(SBAR)-1/4(fBAR)1/2(tBAR)1/8, where A(i) is the proportional coefficient, S is the dimensionless stroke, fBAR is the dimensionless frequency of the grid oscillation, tBAR the dimensionless time.

Probing single-molecule by surface-enhanced resonance Raman scattering with linearly and circularly polarized laser

Rhodamine 6G (R6G) was incubated in silver sols with different low concentrations and its surface-enhanced resonance Raman scattering (SERRS) spectra, excited by linearly and circularly polarized light, respectively, were studied. At the single-molecule level the SERRS spectra were recorded in 10(-13) M dye colloidal solution. Spectral inhomogeneous behaviors from single-molecule were observed such as spectral polarization, spectral diffusion and intensity fluctuations of vibrational lines. Difference between SERRS spectra of R6G excited by linearly and circularly polarized light and the effect of the polarizing angle of Raman signal relative to the slit of spectrograph on the Raman spectral polarization were analyzed and measured experimentally. Circularly polarized laser and the correction of the polarizing angle of Raman signal are necessary to avoid fake results in the measuring of Raman spectral of single-molecule, which was not noticed in initial papers. (c) 2005 Elsevier B.V. All rights reserved.