نتایج جستجو برای: dense element

تعداد نتایج: 267224  

2012
Tomonori Nagayama

Functionalities of wireless sensors to measure bridge dynamic behavior are maturing; dense measurements of large structures are expected to reveal details of the behavior of existing structures. Traffic-induced vibrations at an arch bridge, instrumented by 48 wireless smart sensors, were measured before and after seismic retrofit of the structure. The differences between the measured dynamic ch...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه مراغه - دانشکده علوم پایه 1389

assume ? ? l2(rd) has fourier transform continuous at the origin, with ˆ ?(0) = 1, and thatcan be represented by an affine series f = j>0 k?zd c j,k?j,k for some coefficients satisfying c 1(2) = j>0 k?zd |c j,k|2 1/2 <?. here ?j,k(x) = |deta j |1/2?(a jx ?k) and the dilation matrices a j expand, for example a j = 2j i. the result improves an observation by daubechies that t...

A mathematical model considering mass and momentum transfer was developed for simulation of ethanol dewatering via pervaporation process. The process involves removal of water from a water/ethanol liquid mixture using a dense polymeric membrane. The model domain was divided into two compartments including feed and membrane. For a description of water transport in ...

1991
Roger D. Maddux

The central result of this paper is that every pair-dense relation algebra is completely representable. A relation algebra is said to be pair-dense if every nonzero element below the identity contains a \pair". A pair is the relation algebraic analogue of a relation of the form fha; ai ; hb; big (with a = b allowed). In a simple pair-dense relation algebra, every pair is either a \point" (an al...

2010
Victor E. Lee Ning Ruan Ruoming Jin Charu C. Aggarwal

In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clustering is largely concerned with that of finding a fixed partition in the data, whereas the problem of dense subgraph discovery defines these dense comp...

2009
YUN-SU KIM

An important open problem in operator theory is the invariant subspace problem. Since the problem is solved for all finite dimensional complex vector spaces of dimension at least 2, H denotes a separable Hilbert space whose dimension is infinite. It is enough to think for a contraction T , that is, ‖T‖ ≤ 1 on H . Thus, T ( 6= 0) denotes a contraction in L(H). Let λ always denote an element of t...

2011
Qilong SUN Hirohisa MORIKAWA Keiichi UEDA Hirokazu MIYAHARA Motomu NAKASHIMA

The aim of this paper is to study the bending properties of tail flukes of a dolphin. The bending test was carried out to obtain the displacements on different test points of a fluke. The Young’s moduli of the ligamentous layer and the dense connective tissue in the flukes were obtained from the tensile test and the compression test. In order to establish an FEM model for bending deformation of...

2006
Sean McNamara Martin Strauß Florian Zeller Hans J. Herrmann

Dense phase pneumatic conveying has been investigated through simulation, using a discrete element approach for the granular particles and a finite difference method for the pressure field. Both horizontal and vertical conveying are studied and compared. Studies of single plugs or slugs promise to give insight into the performance of pneumatic conveying systems.

1999
M. HAVIAR

Boolean algebras are affine complete by a well-known result of G. Grätzer. Various generalizations of this result have been obtained. Among them, a characterization of affine complete Stone algebras having a smallest dense element was given by R. Beazer. In this paper, generalizations of Beazer’s result are presented for algebras abstracting simultaneously Kleene and Stone algebras.

2009

Rudin, Chapter 4, Problem #3. The space L(T ) is separable since the trigonometric polynomials with complex coefficients whose real and imaginary parts are rational form a countable dense subset. (Denseness follows from Theorem 3.14 and Theorem 4.25; countability is clear since {e | n ∈ Z} is a countable basis of the trigonometric polynomials.) Meanwhile the space L(T ) is not separable. To see...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید