平板型太阳热水器板芯高温耐久性实验方法研究

为了研究平板型太阳热水器板芯表面的高温耐久性,结合国外的实验方法及国内的应用特点设计了本实验方法.该方法以板芯表面光学性能的衰减来推断系统的寿命,即在一定的高温实验条件下模拟加速衰减过程,以板芯表面光学性能衰减小于5%作为判断板芯合格标准.     

Average size of -Selmer groups of elliptic curves, I

In this paper, we study a class of elliptic curves over with -torsion group , and prove that the average order of the -Selmer groups is bounded.

     

Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

Copula models for insurance claim numbers with excess zeros and time-dependence

This paper develops two copula models for fitting the insurance claim numbers with excess zeros and time-dependence. The joint distribution of the claims in two successive periods is modeled by a copula with discrete or continuous marginal distributions. The first model fits two successive claims by a bivariate copula with discrete marginal distributions. In the second model, a copula is used to model the random effects of the conjoint numbers of successive claims with continuous marginal distributions. Zero-inflated phenomenon is taken into account in the above copula models. The maximum likelihood is applied to estimate the parameters of the discrete copula model. A two-step procedure is proposed to estimate the parameters in the second model, with the first step to estimate the marginals, followed by the second step to estimate the unobserved random effect variables and the copula parameter. Simulations are performed to assess the proposed models and methodologies.     

A segmentation procedure of the pervious area of the aorta artery from CT images without contrast medium

In this paper, we develop an algorithm for the segmentation of the pervious lumen of the aorta artery in computed tomography (CT) images without contrast medium, a challenging task due to the closeness gray levels of the different zones to segment. The novel approach of the proposed procedure mainly resides in enhancing the resolution of the image by the application of the algorithm deduced from the mathematical theory of sampling Kantorovich operators. After the application of suitable digital image processing techniques, the pervious zone of the artery can be distinguished from the occluded one. Numerical tests have been performed using 233 CT images, and suitable numerical errors have been computed and introduced ex novo to evaluate the performance of the proposed method. The above procedure is completely automatic in all its parts after the initial region of interest (ROI) selection. The main advantages of this approach relies in the potential possibility of performing diagnosis concerning vascular pathologies even for patients with severe kidney diseases or allergic problems, for which CT images with contrast medium cannot be achieved.     

Weak stability of the Ishikawa iteration procedures for -hemicontractions and accretive operators

Let X be an arbitrary Banach space, K be a nonempty closed convex subset of X, and T : K → K be a Lipschitzian and hemicontractive mapping with the property lim inf_t→∞((t)/t) > 0. It is shown that the Ishikawa iteration procedures are weakly T-stable. As consequences, several related results deal with the weak stability of these procedures for the iteration proximation of solutions of nonlinear equations involving accretive operators. Our results improve and extend those corresponding results announced by Osilike.     

A Wavelet-Balance Method to Investigate the Vibrations of Nonlinear Dynamical Systems

The scope of this paper is to introduce a new wavelet-balanceprocedure allowing to give a genuine time-scale representation ofvibrations of nonlinear dynamical systems by adopting a waveletmultiresolution approach. In a former paper, a wavelet-Galerkinoriented procedure was developed to analyze vibrations of lineartime-periodic systems. The topic is here to extend the process tothe nonlinear case using a perturbation technique. The underlyingidea consists in successively balancing the linearized equationsof motion into wavelet spaces with increasing resolution scales.Here we demonstrate the wavelet-balance procedure may accuratelyexhibit both transient and stationary vibrations of any nonlinearproblem in general, whatever smooth nonlinearity shape or externalforcing may be. In addition, wavelets inherit of fairly goodtime-frequency localization properties that are likely to permitthe investigation of strong nonlinear problems. Numericalexperiments achieved on a well known Duffing oscillator involvinga cubic nonlinearity then illustrate the procedure. Simulationsattest the relevance of the method by comparison with eitherpurely numerical results obtained with a Runge–Kutta integrationscheme or with an analytical study based on the multiple scalesmethod. We demonstrate that this semi-analytical semi-numericalperturbation method permits to capture stable limit cycles of theDuffing oscillator and its related amplitude spectrum response orstill responses to pulse-like excitations. Finally, key propertiesof the method are discussed and future prospective works areoutlined.     

An oriented coloring of planar graphs with girth at least five

An oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph H of order k. We prove that every oriented graph with a maximum average degree less than and girth at least 5 has an oriented chromatic number at most 16. This implies that every oriented planar graph with girth at least 5 has an oriented chromatic number at most 16, that improves the previous known bound of 19 due to Borodin et al. [O.V. Borodin, A.V. Kostochka, J. Nešet?il, A. Raspaud, É. Sopena, On the maximum average degree and the oriented chromatic number of a graph, Discrete Math. 206 (1999) 77-89].