Micro-structural study of Yaozhou celadons (Tang to Yuan Dynasty): probing crystalline and glassy phases

The Yaozhou kiln complex is a representative production center of ancient northern China, famous for the celadon production. In this work, bubbles, glassy matrix and residual crystals of celadon glazes produced from the Tang to Yuan Dynasty were analyzed by using optical microscopy, Raman spectroscopy and scanning electron microscopy-energy dispersive X-ray spectroscopy (SEM-EDS). The results revealed that the Song, Jin and Yuan productions present bigger bubble and higher area ratios of the Si-O bending over stretching modes than the Tang and Wudai productions. This is consistent with firings at higher temperatures during Song, Jin and Yuan Dynasties. It is also in agreement with the historical studies, which revealed the change from wood-firing to coal-firing during Song Dynasty. The observation of calcium phosphate in Yaozhou productions indicated that the glaze ash had been used. No iron-based particle was identified by Raman spectroscopy in the glazes of all periods. The green color is certainly due to iron ion dispersed in the glassy matrix. Our study also confirmed no significant change in glaze raw materials used for Yaozhou productions from Tang to Yuan Dynasty.     

加强民用电管理的技术措施

提出并实施了住宅楼集中计量配电系统，为加强民用电管理提供了技术措施。     

WuSH—86分布式操作系统中的几个问题

本文主要论述了一个面向科学计算,支撑“异步并行算法”解题的分布式操作系统中的某些基本问题.采用一种拟层次结构的对称形式、无主从关系.对并发进程的派生调度、进程间的通信和同步、共享资源的互斥等方面的问题,提出了一些新的有效方法,致使并行解题加速效率最高达0.87.     

网络协同工作环境中应用共享发言权控制的研究

FloorControl是在大型网络实时交互平台下对共享资源进行控制管理的一项技术。FloorControl的概念分为机制和策略两个部分,协议属于机制,而策略则是具体的控制办法。本文着重介绍了在共享应用中使用FloorControl的技术要点,分析了目前常用的FloorControl协议,并给出了若干具体的FloorControl策略,这些策略的共同作用结果是具有公平、灵活和协同性。     

A Novel Segmentation and Feedback Model for Resolving Contention in Optical Burst Switching

A novel segmentation and feedback model (SFM) applied to resolve contention is proposed. Simulation and performance analyses show that the SFM effectively avoids contentions in optical burst switching (OBS). The long delay time of deflection routing and the immature technology of wavelength converters and optical buffers are not deployed in the SFM. The SFM does not only realize fast switching but also allows preemption by higher priority bursts.     

Applications of Telos

EuLisp has an integrated object system with reflective capabilities. We discuss some example applications which use these facilities to experiment with some advanced and powerful concepts, namely, finalization, virtual shared memory and persistence. A secondary goal is to attempt to illustrate the additional possibilities of metaobject programming over non-metalevel techniques.     

The Importance of Shared Environment in Infant-Father Attachment: A Behavioral Genetic Study of the Attachment Q-Sort.

In this first behavior genetic study on infant-father attachment, we estimated genetic and environmental influences on infant-father attachment behaviors and on temperamental dependency, both assessed with the Attachment Q-Sort (AQS; B. E.Vaughn & E. Waters, 1990; E. Waters, 1995). Mothers of mono- and dizygotic twins (N = 56 pairs) sorted the AQS with a focus on the infant's behaviors in the presence of the father. Genetic modeling showed that attachment was largely explained by shared environmental (59%) and unique environmental (41%) factors. For dependency, genetic factors explained 66% of the variance, and unique environmental factors including measurement error explained 34%. Attachment to father appears to be, to a significant degree, a function of the environment that twins share. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Parallel-access memory management using fast-fits

The two most common approaches to managing shared-access memory-free lists and buddy systems-have significant drawbacks. Free list algorithms have poor memory access characteristics, and buddy systems utilize their space inefficiently. In this paper, we present an alternative approach to parallel-access memory management based on the fast-fits algorithm. A fast-fits memory manager stores free blocks in a tree structure, providing fast access and efficient space use. Since the fast-fits algorithm accesses fewer blocks than a free list algorithm, it reduces the amount of cache invalidation overhead due to the memory manager. Our performance experiments show that the parallel-access fast-fits memory manager allows significantly greater access rates than a serial-access fast-fits memory manager does. We note that shared-memory multiprocessor systems need efficient dynamic storage allocators, both for system purposes and to support parallel programs.