《红楼梦》走向世界与世界走向《红楼梦》

《红楼梦》是一个能体现中华民族文化的精神本旨 ,寄托中华文化之精魂的文本。《红楼梦》走向世界与世界走向《红楼梦》是一个充满辩证性和悖论性机趣的话题。“人间红学”与专业研究者、翻译者等的相对专门性的工作应该有一种“良性互动”的关系     

Estimation of a quadratic regression functional using the sinc kernel

We use the sinc kernel to construct an estimator for the integrated squared regression function. Asymptotic normality of the estimator at different rates is established, depending on whether the regression function vanishes or not.     

略论魏晋风度对《红楼梦》的影响

狂放傲世、饮酒避世是魏晋风度的两个主要表现形式,曹雪芹及其《红楼梦》明显受到它们的影响,这在曹雪芹身上及《红楼梦》书中都有清楚的反映。     

论我国放松外资并购限制后制定《反垄断法》的现实意义

改革开放以后 ,我国虽然在立法方面对反垄断问题颁布了一些规章制度 ,在司法方面也取得了一定的成效 ,但我国的反垄断法律制度仍然存在着很大的局限性。我国目前全面放开了外资在华并购的种种限制 ,面对马上来临的跨国公司在华并购浪潮 ,我国应该从根本上解决问题 ,尽快制定出《反垄断法》。     

20世纪《红楼梦》研究学术争鸣述要（上篇）

王国维引进西方文化思想评论《红楼梦》是20世纪红学学术争鸣的肇始,20世纪学人对王氏关于《红楼梦》之思想倾向与悲剧观的论说有不同的评判。红学中索隐与自传两派的争论是延续百年的世纪之争。1954年对俞平伯《红楼梦》研究的大批判运动以及其后“市民说”与“共名说”的争论有得有失,对得或失的不同评估与时代意识形态的变化密切相关。脂批本与程高本的优劣真伪之争是20世纪红学争鸣中延续莳间最长、争论程度最激烈、参与争论人数最多、最具有学术本体性的争论。对曹雪芹生卒年的争论以壬午说、癸未说、甲申说为重镇。     

智力资源的两个特殊的思维模式——关于形象思维有限量问题的探索

以现代认知科学与思维科学为背景,通过对形象思维有限量化问题中的G·米勒参数和A·西蒙参数进行比较和分析,建构出形象思维有限量化Ⅰ、Ⅱ级模式,并指出了相应的应用前景.     

托收方式下的风险与防范研究

托收方式下买卖双方的履约行为依赖双方之间的商业信用,买卖双方就防范一方的故意或非故意的行为导致的钱、货两空的风险成为结算过程中重要工作。付款交单与承兑交单面临的风险不同,所以两者的风险防范工作也不同。     

The use of the psychosocial maturity inventory in evaluations of youth conservation corps programs

Although work experience has been widely recommended as beneficial to adolescent development, there is little empirical support for this recommendation. The Youth Conservation Corps (YCC), combining as it does some of the best features of both paid work and unpaid community service, offers an opportunity to explore the developmental impact of work experience. However, the need to pay as much attention to the problems of measurement as to the programs themselves dictates simultaneous evaluation of both programs and measures.     

Defining the severely mentally disabled

A definition of the "known target population of severely mentally disabled" in community mental health centers is examined. Criteria include intensive treatment contact and persistent, severe disability, but not diagnosis. Feasible and reliable screening procedures are demonstrated. In the identified population, most subjects at some time had received a diagnosis of schizophrenia and had been on public assistance. These criteria apply to catchmented treatment systems and should be useful in services research.     

Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis

We considered the problem of clustering binarized oligonucleotide fingerprints that attempts to identify clusters. Oligonucleotide fingerprinting is a powerful DNA array based method to characterize cDNA and rRNA libraries and has many applications including gene expression profiling and DNA clone classification. DNA clone classification is the main application for the problem considered in this paper. Most of the existing approaches for clustering use normalized real intensity values and thus do not treat positive and negative hybridization signals equally. This is demonstrated in a series of recent publications where a discrete approach typically useful in the classification of microbial rRNA clones has been proposed. In the discrete approach, hybridization intensities are normalized and thresholds are set such that a value of 1 represents hybridization, a value of 0 represents no hybridization, and an N represents unknown, which is also called a missing value. A combinatorial optimization problem is then formulated attempting to cluster the fingerprints and resolve the missing values simultaneously. It has been examined that missing values cause much difficulty in clustering analysis and most clustering methods are very sensitive to them. In this paper, we turned a little back to the traditional clustering problem, which takes in no missing values but with the revised goal to stabilize the number of clusters and maintain the clustering quality. We adopted the binarizing scheme used in the discrete approach as it is shown to be typically useful for the clone classifications. We formulated such a problem into another combinatorial optimization problem. The computational complexity of this new clustering problem and its relationships to the discrete approach and the traditional clustering problem were studied. We have designed an exact algorithm for the new clustering problem, which is an A* search algorithm for finding a minimum number of clusters. The experimental results on two commonly tested real datasets demonstrated that the A* search algorithm runs fast and performs better than some popular hierarchical clustering methods, in terms of separating clones that have different characteristics with respect to the given oligonucleotide probes.Supported by NSERC and CFI.Supported by NSERC.Supported partially by NSERC, CFI, and NNSF Grant 60373012.