Challenging Students to View the Concept of Area in Triangles in a Broad Context: Exploiting the Features of Cabri-II

This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Extrusion of pastes with a piston extruder for the determination of the local solid and fluid concentration, the local porosity and saturation and displacement profiles by means of NMR imaging

 Nuclear Magnetic Resonance (NMR) was used to investigate the extrusion behaviour of PTFE pastes in a ram extruder. By means of ¹H-NMR imaging (MRI) it is possible to determine the local proton density and therefore, the local fluid concentration. The ¹⁹F-MRI provides the local solid concentration. Thus the local saturation and the local porosity can be calculated with the information of the local fluid and solid concentration. Furthermore displacement profiles can be derived from NMR images by means of correlation techniques without any preparation or marking of the pastes. Received: 8 May 2000   Accepted: 1 May 2001     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Remote stereocontrol by the sulfinyl group: Mukaiyama aldol reactions of (S)-2-[2-(p-tolylsulfinyl)phenyl]acetaldehyde in the asymmetric synthesis of β-hydroxyacids and 1,3-diols

(S)-2-[2-(p-Tolylsulfinyl)phenyl]acetaldehyde reacts with different O-silylated ketenethioacetals in the presence of Yb(OTf)₃ yielding β-hydroxythioesters in high yields and diastereoselectivities. The obtained compounds were readily transformed into β-hydroxyacids and their corresponding diols. These Mukaiyama aldol reactions are a direct evidence of the ability of the sulfinyl group to control 1,5- and 1,6-asymmetric induction processes.     

配送量不定的供应链协调

本文研究供应链管理中配送量不确定时，制造商和分销商之间的协调问题。通过建立惩罚和奖励机制模型来协调供应链各部分的运作，使得分散系统就如一个整体。同时分析供应链的利润分配问题，分别得出各个机制下分销商的最优决策。     

Hankel convolution operators on entire functions and distributions

In this paper we study the Hankel convolution operators on the space of even and entire functions and on Schwartz distribution spaces. We characterize the Hankel convolution operators as those ones that commute with Hankel translations and with a Bessel operator. Also we prove that the Hankel convolution operators are hypercyclic and chaotic on the spaces under consideration.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

超临界流体触媒作用下石墨-金刚石转变

 研究了超临界流体CO₂在石墨-金刚石转变中的触媒作用。实验中，采用Ag₂O作为流体触媒的先驱材料，在7.7 GPa压力下，Ag₂O在1 200 ℃分解成Ag和O₂，O₂与石墨套管在高温高压下反应形成CO₂超临界流体。研究结果表明，在7.7 GPa和1 500 ℃以上温度条件下，石墨在CO₂流体触媒的作用下可转变为金刚石晶体，在1 500～1 700 ℃温度范围内合成出的金刚石具有完好的八面体形貌，与天然金刚石的生长特征非常相似。