(4) 栽植深度;(5)

盖。通过试验证明,除栽植季节外,其它几方面对枣树栽植成活率都有影响。林业科技开发CHINA FORESTRY SCIENCE AND TECHNOLOGY46-47S665.10     

智能控制的新进展(Ê )

对神经网络和遗传算法在控制和优化中的应用进行综述,着重讨论了模糊推理和神经网络的内在关系,并对智能控制的发展做了展望。     

(λ,μ)Vague商环

引入了[(λ,μ)]Vague环,[(λ,μ)]Vague理想的概念,利用截集给出了它们的等价刻画,研究了同态映射下它们的像与原像的问题,在此基础上通过构造陪集的方法引入了[(λ,μ)]Vague商环,给出了[(λ,μ)]Vague商环的同构定理,初步探索了[(λ,μ)]Vague环的理论。     

信息·支持·服务——企业电子商务实施之道(五)

作为全球最早拥有CTI产品的厂商,IBM自1998年以其成熟、先进的呼叫中心解决方案引入我国大陆,立即获得多个行业的广泛认可,并在2000年掀起呼叫中心的热潮。其实,IBM引进的不止是呼叫中心的技术,更多的是呼叫中心在国外先进和运营、业务经验,以及客户关系管理的理念。     

社会网络子集(θ, k)-匿名方法

针对目前社会网络邻域隐私保护相关研究并没有考虑对子集的保护,并且邻域子集中的特定属性分布情况也会造成个体隐私泄露这一问题,提出了一种新的(θ, k)-匿名模型。该模型移除社会网络中需要被保护的节点邻域子集标签后,基于k-同构思想,利用邻域组件编码技术和节点精炼方法处理候选集中的节点及其邻域子集信息,完成同构操作,其中考虑特定敏感属性分布问题。最终,该模型满足邻域子集中的每个节点都存在至少k-1个节点与其邻域同构,同时要求每个节点的属性分布在邻域子集内和在整个子集的差值不大于θ。实验结果表明,(θ, k)-匿名模型能够降低匿名成本并且最大化数据效用。     

<Emphasis Type="Italic">A Midsummer Night’s Dream</Emphasis> (with flying robots)

Seven flying robot “fairies” joined human actors in the Texas A&;M production of William Shakespeare’s A Midsummer Night’s Dream. The production was a collaboration between the departments of Computer Science and Engineering, Electrical and Computer Engineering, and Theater Arts. The collaboration was motivated by two assertions. First, that the performing arts have principles for creating believable agents that will transfer to robots. Second, the theater is a natural testbed for evaluating the response of untrained human groups (both actors and the audience) to robots interacting with humans in shared spaces, i.e., were believable agents created? The production used two types of unmanned aerial vehicles, an AirRobot 100-b quadrotor platform about the size of a large pizza pan, and six E-flite Blade MCX palm-sized toy helicopters. The robots were used as alter egos for fairies in the play; the robots did not replace any actors, instead they were paired with them. The insertion of robots into the production was not widely advertised so the audience was the typical theatergoing demographic, not one consisting of people solely interested technology. The use of radio-controlled unmanned aerial vehicles provides insights into what types of autonomy are needed to create appropriate affective interactions with untrained human groups. The observations from the four weeks of practice and eight performances contribute (1) a taxonomy and methods for creating affect exchanges between robots and untrained human groups, (2) the importance of improvisation within robot theater, (3) insights into how untrained human groups form expectations about robots, and (4) awareness of the importance of safety and reliability as a design constraint for public engagement with robot platforms. The taxonomy captures that apparent affect can be created without explicit affective behaviors by the robot, but requires talented actors to convey the situation or express reactions. The audience’s response to robot crashes was a function of whether they had the opportunity to observe how the actors reacted to robot crashes on stage, suggesting that pre-existing expectations must be taken into account in the design of autonomy. Furthermore, it appears that the public expect robots to be more reliable (an expectation of consumer product hardening) and safe (an expectation from product liability) than the current capabilities and this may be a major challenge or even legal barrier for introducing robots into shared public spaces. These contributions are expected to inform design strategies for increasing public engagement with robot platforms through affect, and shows the value of arts-based approaches to public encounters with robots both for generating design strategies and for evaluation.     

Identifying plant species using mid-wave infrared (2.5–6 μm) and thermal infrared (8–14 μm) emissivity spectra

Plant species discrimination using remote sensing is generally limited by the similarity of their reflectance spectra in the visible, NIR and SWIR domains. Laboratory measured emissivity spectra in the mid infrared (MIR; 2.5 μm–6 μm) and the thermal infrared (TIR; 8 μm–14 μm) domain of different plant species, however, reveal significant differences. It is anticipated that with the advances in airborne and space borne hyperspectral thermal sensors, differentiation between plant species may improve. The laboratory emissivity spectra of thirteen common broad leaved species, comprising 3024 spectral bands in the MIR and TIR, were analyzed. For each wavelength the differences between the species were tested for significance using the one way analysis of variance (ANOVA) with the post-hoc Tukey HSD test. The emissivity spectra of the analyzed species were found to be statistically different at various wavebands. Subsequently, six spectral bands were selected (based on the histogram of separable pairs of species for each waveband) to quantify the separability between each species pair based on the Jefferies Matusita (JM) distance. Out of 78 combinations, 76 pairs had a significantly different JM distance. This means that careful selection of hyperspectral bands in the MIR and TIR (2.5 μm–14 μm) results in reliable species discrimination.     

Corrigendum to “Note on covering monotone orthogonal polygons” [Inf. Process. Lett. 104(6) (2007) 220–227]

Recently, a gap in Step 4 of Algorithm Sweep3 (and thus in Step 4 of Algorithm Minimum-Guard-Cover) presented in our paper entitled “Note on covering monotone orthogonal polygons with star-shaped polygons”, which appeared in Information Processing Letters 104(6), pp. 220–227 (2007), was pointed out by Leonidas Palios. In this corrigendum, we fix this gap and update the correctness proof in accordance with the new version of the algorithm.     

Phase-equilibria investigation of the Dy-Mo-Si ternary system at 1173 K (900 °C)

The phase equilibria of the Dy-Mo-Si ternary system at 1173 K (900 °C) was experimentally determined in the entire concentration range by using x-ray powder diffraction (XRPD), scanning electron microscope equipped with energy dispersive spectrometer (SEM-EDS), and differential scanning calorimetry (DSC). The results show that there are 13 single-phase regions, 24 two-phase regions, and 12 three-phase regions in the studied isothermal section. Nine binary compounds, i.e., α-MoSi₂, Mo₅Si₃, Mo₃Si, α-DySi₂, β-DySi_1.67, Dy₃Si₄, DySi, Dy₅Si₄, and Dy₅Si₃ and one ternary compound Dy₂Mo₃Si₄ were confirmed to exist at this temperature. The highest solubilities of Dy in Mo₃Si and Mo in β-DySi_1.67 are both determined to be less than 1 at.%. While the solubilities of Dy in (Mo), Mo₅Si₃, and α-MoSi₂ and Mo in (α-Dy), α-DySi₂, Dy₃Si₄, DySi, Dy₅Si₄, and Dy₅Si₃ and Si in (α-Dy) and (Mo) are about 1–6.8 at.%. Combining both DSC analysis and XRPD results, it is concluded that the polymorphic transformation of α-DySi₂↔β-DySi₂ does not occur in the range of 573 K (300 °C) to 1323 K (1050 °C). DySi₂ phase exists as α-DySi₂ within the temperature range. β-DySi₂ is a metastable phase that exists in higher temperatures.     

(Φ,Φ<Superscript>*</Superscript>) Image Decomposition Models and Minimization Algorithms

We propose in this paper minimization algorithms for image restoration using dual functionals and dual norms. In order to extract a clean image u from a degraded version f=Ku+n (where f is the observation, K is a blurring operator and n represents additive noise), we impose a standard regularization penalty Φ(u)=∫ φ(|Du|)dx<∞ on u, where φ is positive, increasing and has at most linear growth at infinity. However, on the residual f−Ku we impose a dual penalty Φ^*(f−Ku)<∞, instead of the more standard fidelity term. In particular, when φ is convex, homogeneous of degree one, and with linear growth (for instance the total variation of u), we recover the (BV,BV ^*) decomposition of the data f, as suggested by Y. Meyer (Oscillating Patterns in Image Processing and Nonlinear Evolution Equations, University Lecture Series, vol. 22, Am. Math. Soc., Providence, 2001). Practical minimization methods are presented, together with theoretical, experimental results and comparisons to illustrate the validity of the proposed models. Moreover, we also show that by a slight modification of the associated Euler-Lagrange equations, we obtain well-behaved approximations and improved results.

An adaptive hierarchical master–worker (AHMW) framework for grids—Application to B&B algorithms

Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large computational grids. A natural way to improve the scalability is to add a layer of masters between the master and the workers making a hierarchical MW (HMW). In most existing HMW frameworks and algorithms, only a single layer of masters is used, the hierarchy is statically built and the granularity of tasks is fixed. Such frameworks and algorithms are not adapted to grids which are volatile, heterogeneous and large scale environments. In this paper, we revisit the HMW paradigm to match such characteristics of grids. We propose a new dynamic adaptive multi-layer hierarchical MW (AHMW  ) dealing with the scalability, volatility and heterogeneity issues. The construction and deployment of the hierarchy and the task management (deployment, decomposition of work, distribution of tasks, …$\dots$) are performed in a dynamic collaborative distributed way. The framework has been applied to the parallel Branch and Bound algorithm and experimented on the Flow-Shop scheduling problem. The implementation has been performed using the ProActive grid middleware and the large experiments have been conducted using about 2000 processors from the Grid’5000 French nation-wide grid infrastructure. The results demonstrate the high scalability of the proposed approach and its efficiency in terms of deployment cost, decomposition and distribution of work and exploration time. The results show that AHMW outperforms HMW and MW in scalability and efficiency in terms of deployment and exploration time.     

(<Emphasis Type="Italic">α</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-anonymous data publishing

Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the association of individuals to sensitive information. In this paper, we propose an (α, k)-anonymity model to protect both identifications and relationships to sensitive information in data. We discuss the properties of (α, k)-anonymity model. We prove that the optimal (α, k)-anonymity problem is NP-hard. We first present an optimal global-recoding method for the (α, k)-anonymity problem. Next we propose two scalable local-recoding algorithms which are both more scalable and result in less data distortion. The effectiveness and efficiency are shown by experiments. We also describe how the model can be extended to more general cases.     

电子数据交换(EDI)面面观(四)、(五)

招商局集团EDI应用已初具规模 (1)1986年6月开始陆续安装了IBMSYSTEM/38、IBM AS/400等11台电脑。