首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We give a new representation theorem of negation based on the generator function of the strict operator. We study a certain class of strict monotone operators which build the DeMorgan class with infinitely many negations. We show that the necessary and sufficient condition for this operator class is fc(x)fd(x) = 1, where fc(x) and fd(x) are the generator functions of the strict t-norm and strict t-conorm.  相似文献   

2.
A numerical simulation of the flow past a circular cylinder which is able to oscillate transversely to the incident stream is presented in this paper for a fixed Reynolds number equal to 100. The 2D Navier-Stokes equations are solved by a finite volume method with an industrial CFD code in which a coupling procedure has been implemented in order to obtain the cylinder displacement. A preliminary work is first conducted for a fixed cylinder to check the wake characteristics for Reynolds numbers smaller than 150 in the laminar regime. The Strouhal frequency fS and the aerodynamic coefficients are thus controlled among other parameters. Simulations are then performed with forced oscillations characterized by the frequency ratio F = f0/fS, where f0 is the forced oscillation frequency, and by the adimensional amplitude A. The wake characteristics are analyzed using the time series of the fluctuating aerodynamic coefficients and their power spectral densities (PSD). The frequency content is then linked to the shape of the phase portraits and to the vortex shedding mode. By choosing interesting couples (AF), different vortex shedding modes have been observed, which are similar to those of the Williamson-Roshko map. A second batch of simulations involving free vibrations (so-called vortex-induced vibrations or VIV) is finally carried out. Oscillations of the cylinder are now directly induced by the vortex shedding process in the wake and therefore, the time integration of the motion is realized by an explicit staggered algorithm which provides the cylinder displacement according to the aerodynamic charges exerted on the cylinder wall. Amplitude and frequency response of the cylinder are thus investigated over a wide range of reduced velocities to observe the different phenomena at stake. In particular, the vortex shedding modes have also been related to the frequency response observed and our results at Re = 100 show a very good agreement with other studies using different numerical approaches.  相似文献   

3.
In this article, a wide stopband 20 dB harmonically suppressed low‐pass filter (LPF) using novel defected ground structures (DGSs) is proposed. The DGSs has been analyzed as a low pass filter which shows a significant harmonics suppression in the stopband. The lumped parameter equivalent of the DGSs has been developed to show its effectiveness. The modified equivalent circuit model of the filter helps in placing the transmission zero near ?3 dB cutoff frequency. The LPF is designed on a 0.10 λg× 0.09 λg substrate size where λg is guided wavelength at ?3 dB cut‐off frequency (fc) equal to1 GHz. The simulation shows a 20 dB harmonic suppression up to 50 fc. The prototype of the LPF has been developed and with the available vector network analyser, the S‐parameters have been measured upto 20 GHz (20 fc).The state of the art comparison of the LPF shows a high figure of merit equal to 26 250 which is higher than many recently published works.  相似文献   

4.
The k-ary n-cube has been one of the most popular interconnection networks for massively parallel systems. In this paper, we investigate the edge-bipancyclicity of k-ary n-cubes with faulty nodes and edges. It is proved that every healthy edge of the faulty k-ary n-cube with fv faulty nodes and fe faulty edges lies in a fault-free cycle of every even length from 4 to kn − 2fv (resp. kn − fv) if k ? 4 is even (resp. k ? 3 is odd) and fv + fe ? 2n − 3. The results are optimal with respect to the number of node and edge faults tolerated.  相似文献   

5.
We describe a compact luminescent gaseous oxygen (O2) sensor microsystem based on the direct integration of sensor elements with a polymeric optical filter and placed on a low power complementary metal-oxide semiconductor (CMOS) imager integrated circuit (IC). The sensor operates on the measurement of excited-state emission intensity of O2-sensitive luminophore molecules tris(4,7-diphenyl-1,10-phenanthroline) ruthenium(II) ([Ru(dpp)3]2+) encapsulated within sol-gel derived xerogel thin films. The polymeric optical filter is made with polydimethylsiloxane (PDMS) that is mixed with a dye (Sudan-II). The PDMS membrane surface is molded to incorporate arrays of trapezoidal microstructures that serve to focus the optical sensor signals on to the imager pixels. The molded PDMS membrane is then attached with the PDMS color filter. The xerogel sensor arrays are contact printed on top of the PDMS trapezoidal lens-like microstructures. The CMOS imager uses a 32 × 32 (1024 elements) array of active pixel sensors and each pixel includes a high-gain phototransistor to convert the detected optical signals into electrical currents. Correlated double sampling circuit, pixel address, digital control and signal integration circuits are also implemented on-chip. The CMOS imager data is read out as a serial coded signal. The CMOS imager consumes a static power of 320 μW and an average dynamic power of 625 μW when operating at 100 Hz sampling frequency and 1.8 V DC. This CMOS sensor system provides a useful platform for the development of miniaturized optical chemical gas sensors.  相似文献   

6.
This paper proposes a power-efficient drive circuit for plasma display panels (PDPs). The proposed circuit reduces reactive power consumption by varying the inductance for energy recovery and by separating the grounds of the sustain and data drivers. Power consumption due to discharge current is reduced by using two soft-switching inductors for the pull-up switches in the bridge circuit. Power consumption for data addressing is reduced by using a dc voltage source to bias the ground for the sustain driver. The proposed circuit was tested on a 50″ full-HD single-scan PDP which had a sustain discharge gap of 80 μm; total power consumption to display the dynamic broadcasting content of IEC 62087 was ∼40 W (14.5%) less than that required by the conventional drive circuit, and the EMI level for 2 < f < 9 MHz was reduced significantly. The experimental results demonstrate that a high performance power-efficient PDP drive circuit can be built using the proposed method.  相似文献   

7.
The position of the inflexion point in the red edge region (680 to 780 nm) of the spectral reflectance signature, termed the red edge position (REP), is affected by biochemical and biophysical parameters and has been used as a means to estimate foliar chlorophyll or nitrogen content. In this paper, we report on a new technique for extracting the REP from hyperspectral data that aims to mitigate the discontinuity in the relationship between the REP and the nitrogen content caused by the existence of a double-peak feature on the derivative spectrum. It is based on a linear extrapolation of straight lines on the far-red (680 to 700 nm) and NIR (725 to 760 nm) flanks of the first derivative reflectance spectrum. The REP is then defined by the wavelength value at the intersection of the two lines. The output is a REP equation, REP = − (c1 − c2) / (m1 − m2), where c1 and c2, and m1 and m2 represent the intercepts and slopes of the far-red and NIR lines, respectively. Far-red wavebands at 679.65 and 694.30 nm in combination with NIR wavebands at 732.46 and 760.41 nm or at 723.64 and 760.41 nm were identified as the optimal combinations for calculating nitrogen-sensitive REPs for three spectral data sets (rye canopy, and maize leaf and mixed grass/herb leaf stack spectra). REPs extracted using this new technique (linear extrapolation method) showed high correlations with a wide range of foliar nitrogen concentrations for both narrow and wider bandwidth spectra, being comparable with results obtained using the traditional linear interpolation, polynomial and inverted Gaussian fitting techniques. In addition, the new technique is simple as is the case with the linear interpolation method, but performed better than the latter method in the case of maize leaves at different developmental stages and mixed grass/herb leaves with a low nitrogen concentration.  相似文献   

8.
The n-dimensional folded hypercube FQn, a variation of the hypercube proposed by Ahmed et al. [A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel and Distributed Systems 2(3) (1991) 31-42], is an (n + 1)-regular (n + 1)-connected graph. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [Pao-Lien Lai, Jimmy J.M. Tan, Chien-Ping Chuang, Lih-Hsing Hsu, Conditional diagnosability measures for large multiprocessor systems, IEEE Transactions on Computers 54(2) (2005) 165-175] can better measure the diagnosability of regular interconnection networks. This paper determines that under PMC-model the conditional diagnosability of FQn (tc(FQn)) is 4n − 3 when n = 5 or n ? 8; tc(FQ3) = 3, tc(FQ4) = 7.  相似文献   

9.
The twisted cube TQn is an alternative to the popular hypercube network. Recently, some interesting properties of TQn were investigated. In this paper, we study the pancycle problem on faulty twisted cubes. Let fe and fv be the numbers of faulty edges and faulty vertices in TQn, respectively. We show that, with fe + fv ? n − 2, a faulty TQn still contains a cycle of length l for every 4 ? l ? ∣V(TQn)∣ − fv and odd integer n ? 3.  相似文献   

10.
Meijie Ma 《Information Sciences》2010,180(17):3373-3379
A k-container of a graph G is a set of k internally disjoint paths between u and v. A k-container of G is a k∗-container if it contains all vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices, and a bipartite graph G is k∗-laceable if there exists a k∗-container between any two vertices u and v from different partite sets of G for a given k. A k-connected graph (respectively, bipartite graph) G is f-edge fault-tolerant spanning connected (respectively, laceable) if G − F is w∗-connected for any w with 1 ? w ? k − f and for any set F of f faulty edges in G. This paper shows that the folded hypercube FQn is f-edge fault-tolerant spanning laceable if n(?3) is odd and f ? n − 1, and f-edge fault-tolerant spanning connected if n (?2) is even and f ? n − 2.  相似文献   

11.
The predictability of the vegetation cycle is analyzed as a function of the spatial scale over West Africa during the period 1982-2004. The NDVI-AVHRR satellite data time series are spatially aggregated over windows covering a range of sizes from 8 × 8 km2 to 1024 × 1024 km2. The times series are then embedded in a low-dimensional pseudo-phase space using a system of time delayed coordinates. The correlation dimension (Dc) and entropy of the underlying vegetation dynamics, as well as the noise level (σ) are extracted from a nonlinear analysis of the time series. The horizon of predictability (HP) of the vegetation cycle defined as the time interval required for an n% RMS error on the vegetation state to double (i.e. reach 2n% RMS) is estimated from the entropy production. Compared to full resolution, the intermediate scales of aggregation (in the range of 64 × 64 km2 to 256 × 256 km2) provide times series with a slightly improved signal to noise ratio, longer horizon of predictability (about 2 to 5 decades) and preserve the most salient spatial patterns of the vegetation cycle. Insights on the best aggregation scale and on the expected vegetation cycle predictability over West Africa are provided by a set of maps of the correlation dimension (Dc), the horizon of predictability (HP) and the level of noise (σ).  相似文献   

12.
In this paper we study the initial boundary value problem of semilinear parabolic equations with semilinear term f(u). By using the family of potential wells method we prove that if f(u) satisfies some conditions, J(u0) ≤ d and I(u0) > 0, then the solution decays to zero exponentially as t → ∞. On the other hand, if J(u0) ≤ d, I(u0) < 0, then the solution blows up in finite time.  相似文献   

13.
Measurement of the transverse piezoelectric coefficient (e31,f) in thin films is crucial for the development of microfabricated sensors, actuators, and transducers. Here, a method is described such that lithographically defined strain gauges enable non-destructive, position-dependent characterization of e31,f in conjunction with the wafer flexure technique. Measurements of 100 nm thick Pt gauges deposited on 1 μm thick PbZr0.52Ti0.48O3 thin films yield gauge factors of 6.24, with a gauge-to-gauge variation that is 5% of this value. The system allows for simultaneous measurement of the charge and strain, improving the overall accuracy of measurement. The small footprint of the combined strain gauge array/electrode pattern used for determining e31,f, allows for a non-destructive mapping of the transverse piezoelectric coefficient across large-area wafers. Due to the clamping configuration used in wafer flexure experiments, e31,f values can accurately be obtained within the central ∼2/3 of a full wafer. Measurements performed on a 1.3 μm thick randomly oriented polycrystalline PbZr0.52Ti0.48O3 film made deposited on a 4 in. platinized silicon wafer by the sol-gel process show a high degree of uniformity, with e31,f of −6.37 ± 0.60 C/m2 for points measured within r = 3 cm.  相似文献   

14.
The n-dimensional locally twisted cube LTQn is a new variant of the hypercube, which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of LTQn, and shows that if LTQn (n ? 3) contains at most n − 3 faulty vertices and/or edges then, for any fault-free edge e and any integer ? with 6 ? ? ? 2n − fv, there is a fault-free cycle of length ? containing the edge e, where fv is the number of faulty vertices. The result is optimal in some senses. The proof is based on the recursive structure of LTQn.  相似文献   

15.
The star graph is an attractive underlying topology for distributed systems. Robustness of the star graph under link failure model is addressed. Specifically, the minimum number of faulty links, f(nk), that make every (n − k)-dimensional substar Snk faulty in an n-dimensional star network Sn, is studied. It is shown that f(n,1)=n+2. Furthermore, an upper bound is given for f(n, 2) with complexity of O(n3) which is an improvement over the straightforward upper bound of O(n4) derived in this paper.  相似文献   

16.
The low-frequency characteristics of planar Hall effect bridge sensors are investigated as function of the sensor bias current and the applied magnetic field. The noise spectra reveal a Johnson-like spectrum at high frequencies, and a 1/f-like excess noise spectrum at lower frequencies, with a knee frequency of around 400 Hz. The 1/f-like excess noise can be described by the phenomenological Hooge equation with a Hooge parameter of γH = 0.016. The detectivity is shown to depend on the total length, width and thickness of the bridge branches. The detectivity is improved by the square root of the length increase. Moreover, the detectivity is shown to depend on the amplitude of the applied magnetic field, revealing a magnetic origin to part of the 1/f noise.  相似文献   

17.
Generalized Jacobi (GJ) diagonal preconditioner coupled with symmetric quasi-minimal residual (SQMR) method has been demonstrated to be efficient for solving the 2 × 2 block linear system of equations arising from discretized Biot’s consolidation equations. However, one may further improve the performance by employing a more sophisticated non-diagonal preconditioner. This paper proposes to employ a block constrained preconditioner Pc that uses the same 2 × 2 block matrix but its (1, 1) block is replaced by a diagonal approximation. Numerical results on a series of 3-D footing problems show that the SQMR method preconditioned by Pc is about 55% more efficient time-wise than the counterpart preconditioned by GJ when the problem size increases to about 180,000 degrees of freedom. Over the range of problem sizes studied, the Pc-preconditioned SQMR method incurs about 20% more memory than the GJ-preconditioned counterpart. The paper also addresses crucial computational and storage issues in constructing and storing Pc efficiently to achieve superior performance over GJ on the commonly available PC platforms.  相似文献   

18.
In this study, a combination of low and high density airborne LiDAR and satellite SPOT-5 HRG data were used in conjunction with ground measurements of forest structure to parameterize four models for zero-plane displacement height d(m) and aerodynamic roughness length z0m(m), over cool-temperate forests in Heihe River basin, an arid region of Northwest China. For the whole study area, forest structural parameters including tree height (Ht) (m), first branch height (FBH) (m), crown width (CW) (m) and stand density (SD)(trees ha− 1) were derived by stepwise multiple linear regressions of ground-based forest measurements and height quantiles and fractional canopy cover (fc) derived from the low density LiDAR data. The high density LiDAR data, which covered a much smaller area than the low density LiDAR data, were used to relate SPOT-5's reflectance to the effective plant area index (PAIe) of the forest. This was done by linear spectrum decomposition and Li-Strahler geometric-optical models. The result of the SPOT-5 spectrum decomposition was applied to the whole area to calculate PAIe (and leaf area index LAI). Then, four roughness models were applied to the study area with these vegetation data derived from the LiDAR and SPOT-5 as input. For validation, measurements at an eddy covariance site in the study area were used. Finally, the four models were compared by plotting histograms of the accumulative distribution of modeled d and z0m in the study area. The results showed that the model using by frontal area index (FAI) produced best d estimate, and the model using both LAI and FAI generated the best z0m. Furthermore, all models performed much better when the representative tree height was Lorey's mean height instead of using an arithmetic mean.  相似文献   

19.
Surface chlorophyll a concentrations (Ca, mg m− 3) in the Southern Ocean estimated from SeaWiFS satellite data have been reported in the literature to be significantly lower than those measured from in situ water samples using fluorometric methods. However, we found that high-resolution (∼ 1 km2/pixel) daily SeaWiFS Ca (CaSWF) data (SeaDAS4.8, OC4v4 algorithm) was an accurate measure of in situ Ca during January-February of 1998-2002 if concurrent in situ data measured by HPLC (CaHPLC) instead of fluorometric (CaFluor) measurements were used as ground truth. Our analyses indicate that CaFluor is 2.48 ± 2.23 (n = 647) times greater than CaHPLC between 0.05 and 1.5 mg m− 3 and that the percentage overestimation of in situ Ca by fluorometric measurements increases with decreasing concentrations. The ratio of CaSWF/CaHPLC is 1.12 ± 0.91 (n = 96), whereas the ratio of CaSWF/CaFluor is 0.55 ± 0.63 (n = 307). Furthermore, there is no significant bias in CaSWF (12% and − 0.07 in linear and log-transformed Ca, respectively) when CaHPLC is used as ground truth instead of CaFluor. The high CaFluor/CaHPLC ratio may be attributed to the relatively low concentrations of chlorophyll b (Cb/Ca = 0.023 ± 0.034, n = 482) and relatively high concentrations of chlorophyll c (Cc/Ca = 0.25 ± 0.59, n = 482) in the phytoplankton pigment composition when compared to values from other regions. Because more than 90% of the waters in the study area, as well as in the entire Southern Ocean (south of 60° S), have CaSWF between 0.05 and 1.5 mg m− 3, we consider that the SeaWiFS performance of Ca retrieval is satisfactory and for this Ca range there is no need to further develop a “regional” bio-optical algorithm to account for the previous SeaWiFS “underestimation”.  相似文献   

20.
The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2n − 2f − 1 (or 2n − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号