高聚物溶液粘度的建模与估算

粘度是高聚物溶液的重要性质.首先通过实验测得高聚物溶液不同浓度下的粘度数据,其次运用Polymer Plus工程模拟软件建立高聚物溶液的粘度模型和用户自定义模型,最后将所建立的模型通过1个闪蒸罐进行模拟计算的实例中进行验证,结果表明该粘度模型在稀溶液时,误差较小,浓度较高时,误差较大;而用户自定义模型能够估算高聚物溶液的粘度,结果准确可靠.所建立的粘度模型能够准确估算溶液的粘度,为聚合工业节省大量的人力物力,增加经济效益.     

Asymptotic powers for matched trend tests and robust matched trend tests in case-control genetic association studies

The matched trend test (MTT), developed using a conditional logistic regression, has been proposed to test for association in matched case-control studies to control the bias of known confounding effects and reduce the potential impact of population stratification. The MTT requires a known genetic model. When the genetic model is unknown, a Monte Carlo robust test, MAX, has been proposed for the analysis of matched case-control studies. The MAX statistic takes the maximum of three MTTs optimal for three common genetic models. We derive the asymptotic power for MTTs and robust tests. In particular, we derive the asymptotic p-value for MAX. Using these analytical results, we conduct simulation studies to compare the performance of MAX and the two-degree-of-freedom Chi-square test for matched case-control studies, where the latter is implemented in most computing software. Our simulation results show that MAX is always asymptotically more powerful than the two-degree-of-freedom Chi-square test under common genetic models. Our results provide guidelines for the analysis of genetic association using matched case-control data. An illustration of our results to a real matched pair case-control etiologic study of sarcoidosis is given.     

Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow

This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but require careful and tedious input from the user. Others need little user input however they are sensitive to user input and need a postprocessing step to smooth the generated jaggy cutting contours. The popular geometric snake can be used to optimize the cutting contour, but it cannot deal with the topology change. In this paper, we propose a geodesic curvature flow based framework to overcome all these problems. Since in many cases the meaningful cutting contour on a 3D mesh is locally shortest in the sense of some weighted curve length, the geodesic curvature flow is an ideal tool for our problem. It evolves the cutting contour to the nearby local minimum. We should mention that the previous numerical scheme, discretized geodesic curvature flow (dGCF) is too slow and has not been applied to mesh segmentation. With a careful observation to dGCF, we devise here a fast computation scheme called fast geodesic curvature flow (FGCF), which only needs to solve a smaller and easier problem. The initial cutting contour is generated by a variant of random walks algorithm, which is very fast and gives reasonable cutting result with little user input. Experiment results on the benchmark mesh segmentation data set show that our proposed framework is robust to user input and capable of producing good results reflecting geometric features and human shape perception.     

Mesh Decomposition with Cross‐Boundary Brushes

We present a new intuitive UI, which we call cross‐boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our system automatically returns a best cut running through all the strokes. By the different natures of part components (i.e., semantic parts) and patch components (i.e., flatter surface patches) in general models, we design two corresponding brushes: part‐brush and patch‐brush. These two types of brushes share a common user interface, enabling easy switch between them. The part‐brush executes a cut along an isoline of a harmonic field driven by the user‐specified strokes. We show that the inherent smoothness of the harmonic field together with a carefully designed isoline selection scheme lead to segmentation results that are insensitive to noise, pose, tessellation and variation in user's strokes. Our patch‐brush uses a novel facet‐based surface metric that alleviates sensitivity to noise and fine details common in region‐growing algorithms. Extensive experimental results demonstrate that our cutting tools can produce user‐desired segmentations for a wide variety of models even with single strokes. We also show that our tools outperform the state‐of‐art interactive segmentation tools in terms of ease of use and segmentation quality.     

基于ADF4360-8的频率合成系统

用ADF4360-8和AD8343芯片作为变频核心器件,将70MHz信号转变为具有频率稳定、波形完整的11.4MHz中频信号。实验证明,该方案设计对接收机的稳定工作起到重要的作用,变频系统具有结构简单、操作方便、稳定性高等特点。     

An overview of dynamic parameter identification of robots

Due to the importance to model-based control, dynamic parameter identification has attracted much attention. However, until now, there is still much work for the identification of dynamic parameters to be done. In this paper, an overview is given of the existing work on dynamic parameter identification of serial and parallel robots. The methods for estimating the dynamic parameters are summarized, and the advantages and disadvantages of each method are discussed. The model to be identified and the trajectory optimization are reviewed. Further, the methods for validating the estimated model are summarized and the application of dynamic parameter identification is mentioned. The results of this review are useful for manufacturers of robots in selecting proper identification method and also for researchers in determining further research areas.     

Distributed bandwidth allocation based on alternating evolution algorithm

In a network, end nodes have to compete for bandwidth through some distributed congestion control algorithms. It is a great challenge to ensure the efficiency and fairness of the distributed control algorithms. TCP congestion control algorithms do not perform well in terms of their efficiency and fairness in high speed networks. In this paper, we propose a novel asymptotic evolution algorithm based on the Logistic Model to allocate limited bandwidth resource. The algorithm introduces an explicit bandwidth pre-allocation factor. The factor is carried by the packet and is computed in routers based on the information of the router capacity, the aggregate load, and the instantaneous queue length; therefore the algorithm does not require the routers to keep the per-flow state. According to this pre-allocation bandwidth factor, the senders asymptotically adjust their sending rate and the bandwidth factor changes asymptotically along with the variation of the aggregate load and the queue length in the routers; therefore the sending rate and the pre-allocation bandwidth factor form alternating evolution and eventually reach a steady state.     

An adaptive task-level fault-tolerant approach to Grid

A strong failure recovery mechanism handling diverse failures in heterogeneous and dynamic Grid is so important to ensure the complete execution of long-running applications. Although there have been various efforts made to address this issue, existing solutions either focus on employing only one single fault-tolerant technique without considering the diversity of failures, or propose some frameworks which cannot deal with various kinds of failures adaptively in Grid. In this paper, an adaptive task-level, fault-tolerant approach to Grid is proposed. This approach aims at handling quite a complete set of failures arising in Grid environment by integrating basic fault-tolerant approaches. Moreover, this paper puts forward that resource consumption (not received enough attention) is also an important evaluation metric for any fault-tolerant approach. The corresponding evaluation models based on mean execution time and resource consumption are constructed to evaluate any fault-tolerant approach. Based on the models, we also demonstrate the effectiveness of our approach and illustrate the performance gains achieved via simulations. The experiments based on a real Grid have been made and the results show that our approach can achieve better performance and consume less resource.     

Dynamically modulated intensity interrogation scheme using waveguide coupled surface plasmon resonance sensors

An electro-optically modulated intensity interrogation method based on tunable waveguide coupled surface plasmon resonance sensors has been proposed. It has been theoretically and experimentally demonstrated that the proposed scheme can enable sensitive measurement of measurand variations. By modulating the refractive index in the waveguide layer, this interrogation method yields modulated signal whose amplitude is related to measurand's refractive index. This amplitude modulated signal offers a higher signal to noise ratio and eliminates additive noise in the sensor system. A preliminary investigation using saline buffers with different NaCl concentrations shows a resolution of 2.3 × 10^?6 refractive index unit by our approach. Resolution can be controlled by the amplitude of the applied modulation voltage and can be further enhanced by optimizing the device structure or improving the electro-optical (E-O) coefficient of the E-O material. This approach is simple, stable, and promising for low-cost or multi-channel SPR biosensor applications.