On denoising and compression of DNA microarray images

We address the problems of noise and huge data sizes in microarray images. First, we propose a mixture model for describing the statistical and structural properties of microarray images. Then, based on the microarray image model, we present methods for denoising and for compressing microarray images. The denoising method is based on a variant of the translation-invariant wavelet transform. The compression method introduces the notion of approximate contexts (rather than traditional exact contexts) in modeling the symbol probabilities in a microarray image. This inexact context modeling approach is important in dealing with the noisy nature of microarray images. Using the proposed denoising and compression methods, we describe a near-lossless compression scheme suitable for microarray images. Results on both denoising and compression are included, which show the performance of the proposed methods. Further experiments using the results of the proposed near-lossless compression scheme in gene clustering using cell-cycle microarray data for S. cerevisiae showed a general improvement in the clustering performance, when compared with using the original data. This provides an indirect validation of the effectiveness of the proposed denoising method.     

电子商务中SET协议的安全缺陷研究

目前SET协议在电子商务交易中应用越来越广泛,因此,对SET协议的安全性的要求就越来越高。论文在SET协议的交易流程基础上,分析了其安全机制采用的技术和优点,指出了SET协议安全性存在的一些问题。     

Non-redundant data clustering

Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel, previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and computer vision.     

基于多信道预约可冲突避免的多址接入协议

本文为多跳分布多无线网络提出了一套灵活而有效的自适应获取冲突避免（AACA）的多址接入协议。在该协议中，各节点竞争公共信道，利用RTS/CTS对话形式来预约各业务信道，成功预约后的分组传输不会受到其他节点的干扰。它使用任意确定数目信道，以异步方式工作，并且使得各节点利用半双工无线电台就可以灵活、简便地实现资源预约。分析和比较结果说明，所提出的多信道预约协议可以有效地解决隐藏终端、暴露终端以及侵入终端的问题。     

ATM-PON光网络终端管理控制协议

遵照 ITU- TG.983建议 ,建立 ONT管理和控制通道 ,实现 ONT与 OLT间的管理控制信息传送。并校正了多信息流传送时可能会产生的并发消息错误     

并行程序设计环境MPICH的应用机理分析

阐述了在PC集群中运用消息传递接口MPICH（Message Passing Interface and Chameleon）进行并行程序设计的基本方法，并以计算圆周率π值的并行算法程序为例，介绍了MPICH中基本例程的功能和调用方法，并行程序设计的关键技术是如何处理好各个进程之间的通信问题，MPICH采用紧迫协议和约定协议来协调各个进程之间的通信，同时也提供了一些阻塞处理函数和非阻塞处理函数，它们能够使进程充分利用系统资源，大大增加用户编程的灵活性。     

Learning Recursive Bayesian Multinets for Data Clustering by Means of Constructive Induction

This paper introduces and evaluates a new class of knowledge model, the recursive Bayesian multinet (RBMN), which encodes the joint probability distribution of a given database. RBMNs extend Bayesian networks (BNs) as well as partitional clustering systems. Briefly, a RBMN is a decision tree with component BNs at the leaves. A RBMN is learnt using a greedy, heuristic approach akin to that used by many supervised decision tree learners, but where BNs are learnt at leaves using constructive induction. A key idea is to treat expected data as real data. This allows us to complete the database and to take advantage of a closed form for the marginal likelihood of the expected complete data that factorizes into separate marginal likelihoods for each family (a node and its parents). Our approach is evaluated on synthetic and real-world databases.     

水利电力自动化设备TCP/IP通信协议栈的选择

TCP/IP通信协议栈产品层出不穷,文中列举了几种适合水利电力行业使用的TCP/IP通信协议栈产品,进行了分析和测试比较,评价了各协议栈产品的优缺点,评估了其性价比和实用性,为水利电力行业设备的TCP/IP通信协议栈选择提供了参考依据.     

Question hard, answer simply: A comment on Storms et al. (2003).

It seems clear that, for whatever reasons, the dementia of the Alzheimer type patient group (as well as other patient groups) exhibits behavior that is different from the normal control group. G. Storms, T. Dirikx, J. Saerens, S. Verstraeten, and P. P. De Deyn (2003) rightfully argue that the observed behavior (similarity judgments) does not tell us the source (cause) of the differences between the 2 groups. Rather, the focus of the study should be placed more on finding the ways the 2 groups are different. They also point out various methodological problems in some of the previous attempts to characterize the nature of the differences. Further methodological issues in G. Storms et al.'s study are examined. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

一种应用于二次布局的有效划分方法

提出了一种基于二次布局的结合MFFC结群和hMETIS划分的算法.实验表明:这种方法能得到很好的布局结果,但是运行消耗的时间比较长.为了缩短划分在二次布局中运行的时间,提出了一种改进的结群算法IMFFC,用它在二次布局中做划分.与前者相比较,这种方法虽然布局质量稍差,但速度更快.