Patterns for multigrid equidistributed functions: Application to general parabolas and length estimation

We show that for some special functions (called k-multigrid equidistributed functions), we can compute the limit of the frequency of patterns in the discretization of their graph, when the resolution tends to zero. This result is applied to parabolas. We deduce also that local length estimators almost never converge to the length for the parabolas.     

一种新型数据记录仪的设计与应用

提出了一种基于PDA的新型数据记录仪的设计方案。以 89c52单片机为核心设计了前端数据采集器 ,开发了基于PDA的数据记录应用程序。应用实验表明 ,该方案是可行的     

生产管理系统的设计与实施

灵活实施是开发生产管理系统的成功关键。介绍了开发生产 管理系统软件设计方案的主要内容,并且在实践的基础上总结出若干值得参考的经验。     

An alternative approach to carbon nanotube sample preparation for TEM investigation

A two-stage replication technique (positive replica) is shown to be suitable for transmission electron microscopy (TEM) examination of carbon nanotubes (CNTs) and other one-dimensional nanostructures in their longitudinal direction. This method enables handling the fragile nanostructures, is fast and simple and allows to study the growth mechanism of nanofeatures, including the early stages of their growth. CNTs may also be examined when the growth layers are very thin, and even when only a few nanotubes are on a substrate. Replicas can be taken from various substrate shapes covered with nanostructures and from minute or specifically selected areas of the substrates. CNTs extracted by the replica are not disturbed, and their nanostructures are preserved. It is demonstrated that using positive replicas, HRTEM images from the nanosized carbon forms can also be obtained.     

On delay-derivative-dependent stability of systems with fast-varying delays

Stability of linear systems with uncertain bounded time-varying delays is studied under the assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound of the L₂-norm of a certain integral operator. There exists a bound on this operator norm in two cases: in the case where the delay derivative is not greater than 1 and in the case without any constraints on the delay derivative. In the present note we fill the gap between the two cases by deriving a tight operator bound which is an increasing and continuous function of the delay derivative upper bound d?1. For d→∞ the new bound corresponds to the second case and improves the existing bound. As a result, for the first time, delay-derivative-dependent frequency domain and time domain stability criteria are derived for systems with the delay derivative greater than 1.     

micrOMEGAs 2.0: A program to calculate the relic density of dark matter in a generic model

micrOMEGAs 2.0 is a code which calculates the relic density of a stable massive particle in an arbitrary model. The underlying assumption is that there is a conservation law like R-parity in supersymmetry which guarantees the stability of the lightest odd particle. The new physics model must be incorporated in the notation of CalcHEP, a package for the automatic generation of squared matrix elements. Once this is done, all annihilation and coannihilation channels are included automatically in any model. Cross-sections at v=0, relevant for indirect detection of dark matter, are also computed automatically. The package includes three sample models: the minimal supersymmetric standard model (MSSM), the MSSM with complex phases and the NMSSM. Extension to other models, including non-supersymmetric models, is described.

Program summary

Title of program:micrOMEGAs2.0Catalogue identifier:ADQR_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADQR_v2_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputers for which the program is designed and others on which it has been tested:PC, Alpha, Mac, SunOperating systems under which the program has been tested:UNIX (Linux, OSF1, SunOS, Darwin, Cygwin)Programming language used:C and FortranMemory required to execute with typical data:17 MB depending on the number of processes requiredNo. of processors used:1Has the code been vectorized or parallelized:noNo. of lines in distributed program, including test data, etc.:91 778No. of bytes in distributed program, including test data, etc.:1 306 726Distribution format:tar.gzExternal routines/libraries used:noCatalogue identifier of previous version:ADQR_v1_3Journal reference of previous version:Comput. Phys. Comm. 174 (2006) 577Does the new version supersede the previous version:yesNature of physical problem:Calculation of the relic density of the lightest stable particle in a generic new model of particle physics.Method of solution: In numerically solving the evolution equation for the density of dark matter, relativistic formulae for the thermal average are used. All tree-level processes for annihilation and coannihilation of new particles in the model are included. The cross-sections for all processes are calculated exactly with CalcHEP after definition of a model file. Higher-order QCD corrections to Higgs couplings to quark pairs are included.Reasons for the new version:There are many models of new physics that propose a candidate for dark matter besides the much studied minimal supersymmetric standard model. This new version not only incorporates extensions of the MSSM, such as the MSSM with complex phases, or the NMSSM which contains an extra singlet superfield but also gives the possibility for the user to incorporate easily a new model. For this the user only needs to redefine appropriately a new model file.Summary of revisions:

•

Possibility to include in the package any particle physics model with a discrete symmetry that guarantees the stability of the cold dark matter candidate (LOP) and to compute the relic density of CDM.

•

Compute automatically the cross-sections for annihilation of the LOP at small velocities into SM final states and provide the energy spectra for final states.

•

For the MSSM with input parameters defined at the GUT scale, the interface with any of the spectrum calculator codes reads an input file in the SUSY Les Houches Accord format (SLHA).

•

Implementation of the MSSM with complex parameters (CPV-MSSM) with an interface to CPsuperH to calculate the spectrum.

•

Routine to calculate the electric dipole moment of the electron in the CPV-MSSM.

•

In the NMSSM, new interface compatible with NMHDECAY2.1.

Typical running time:0.2 secUnusual features of the program:Depending on the parameters of the model, the program generates additional new code, compiles it and loads it dynamically.     

Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact

We define the notion of rational presentation of a complete metric space, in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some representations of the space C[0,1] of uniformly continuous real functions over [0,1] with the usual norm: ||f||_∞ = Sup{|f(x)|; 0x1}. This allows us to have a comparison of global kind between complexity notions attached to these presentations. In particular, we get a generalization of Hoover's results concerning the Weierstrass approximation theorem in polynomial time. We get also a generalization of previous results on analytic functions which are computable in polynomial time.     

A reactive GRASP and path relinking for a combined production–distribution problem

An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory levels and distribution into account. An integer linear model is proposed as a compact problem specification but it cannot be solved to optimality for large instances. Instead of using a classical two-phase approach (production planning and then route construction for each day), metaheuristics that simultaneously tackle production and routing decisions are developed: a GRASP (greedy randomized adaptive search procedure) and two improved versions using either a reactive mechanism or a path-relinking process. These algorithms are evaluated on 90 randomly generated instances with 50, 100 and 200 customers and 20 periods. The results confirm the interest of integrating production and distribution decisions, compared to classical two-phase methods. Moreover, reaction and path-relinking give better results than the GRASP alone.     

A method of predicting the number of clusters using Rand's statistic

Distributional and asymptotic results on the moment of Rand's C_k statistic were derived by DuBien and Warde [1981. Some distributional results concerning a comparative statistic used in cluster analysis. ASA Proceedings of the Social Statistics Section, 309–313.]. Based on those results, a method to predict the number of clusters is suggested by applying various agglomerative clustering algorithms. In the procedure, the methods using different indexes are examined and compared based on the concept of agreement (or, disagreement) between clusterings generated by different clustering algorithms on the set of data. Our method having practical generality works better than the other methods and assigns statistical meaning to C_k values in determining the number of clusters from the comparison.     

“任务驱动”模式下高职精细化工课程的教学实践

针对高职学生的基础知识薄弱和学习能动性较低等特点,从高职院校人才培养实际情况和教学改革入手,依据建构主义学习理论,采用"任务驱动"课堂教学模式,笔者经过三年《精细化工》课程教学实践磨砺,摸索出较系统完整的"三步驱动教学法",即通过"任务驱动"、"轮值主持"和"即时考核"三步骤的驱动教学,极大地激发了学生自主学习的能动性,该模式的教学过程使课堂充满生机和活力,产生了积极良好的教学效果。"任务驱动"课堂教学模式,不仅需要教师备好课,还要时时把握学生的心理和学习进展,这对教师的专业知识掌握程度、教学业务能力、课堂组织能力、专业实践能力等提出了更高的要求。