嘧啶硫苯甲酸类的三维构效关系研究

利用比较分子场分析（ＣｏＭＦＡ）对１６嘧啶硫苯甲酸类化合物进行了三维定量构效关系研究，得到了具有较强预测能力的ＱＳＡＲ模型。研究结果表明袖章效应是影响构效关系的主要因素，为更好地解释结构与活性的关系，设计新型嘧啶苯甲酸类除草剂提供了有益的指导。     

用Borland C＋＋4.5设计Windows应用程序

本文介绍了一种用ＢｏｒｌａｎｄＣ＋４．５提供的Ｂｏｒｌａｎｄ ＡｐｐｌｉｃａｔｉｏｎＥｘｐｅｒｔ（ＡｐｐＥｘｐｅｒｔ）和ＣｌａｓｓＥｘｐｅｒｔ专家系统工具建立Ｗｉｄｎｏｗｓ应用程序的简单方法。分两步进行，首先建立应用程序外壳，然后修改各项，增加新功能，以满足程序的所有要求。     

Object-oriented CAD for Hydraulic Circuits of Pressing Machines

１ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｅｘｐｅｒｔｓｙｓｔｅｍｓａｐｐｒｏａｃｈｉｓｃｕｒｅｎｔｌｙｂｅｉｎｇａｐｐｌｉｅｄｔｏｃｏｍｐｕｔｅｒ－ａｉｄｅｄｄｅｓｉｇｎ（ＣＡＤ）ｆｏｒｓｉｍｐｌｅｈｙｄｒａｕｌｉｃｃｉｒｃｕｉｔｓ．Ｍｏｓｔｏｆｔｈｅｅｘｐ...     

基于MFC封装的Windows通信API的研究

本文介绍 Ｗｉｎｄｏｗｓ环境下网络编程的多种通信 ＡＰＩ及 ＭＦＣ（微软基础类库）对它们的封装类,重点阐述封装 ＷｉｎＳｏｃｋ ＡＰＩ的 ＭＦＣ类 ＣＡＳｙｎｃＳｏｃｋｅｔ和Ｃｓｏｃｋｅｔ的编程模型。     

ADSL企业类路由器

Ｃｉｓｃｏ １４００．系列非对称数字用户线 路（ＡＤＳＬ）企业类路由器为Ｃｉｓｃｏ端到端ＤＳＬ解决方案的一个关键组件,能向企业客户提供连续的高速Ｉｎｔｅｒｎｅｔ和企业局域网访问。由于 Ｃｉｓｃｏ ＩＯＳ的功能, Ｃｉｓｃｏ １４００系列还提供增强的安全性,拥有 Ｃｉｓｃｏ ＩＯＳ防火墙、 ＡＴＭ和 ＩＰ服务质量（ＱｏＳ）、扩展的多媒体功能以及易于使用和管理功能。 Ｃｉｓｃｏ １４００系列能使服务供应商降低他们的部署运营成本,并能使服务供应商和经销商提供创收的增值服务,例如管理化网络服务、管理化安全服务和虚拟…     

MFC下实现局域网内部数据传送

１套接字编程概述 套接字（ｓｏｃｋｅｔ）最初是由加州大学Ｂｅｒｋｅｌｅｙ学院为ＵＮＩＸ操作系统开发的基于 ＴＣＰ／ＩＰ协议的网络通信接口,随着ＵＮＩＸ操作系统的广泛使用,套接字成为当前最流行的网络通信应用程序接口之一。 Ｗｉｎｄｏｗｓ Ｓｏｃｋｅｔｓ是 Ｂｅｒｋｅｌｅｙ Ｓｏｃ－ｋｅｔｓ在Ｗｉｎｄｏｗｓ环境下的移植,它包括一个标准的ＢｅｒｋｅｌｅｙＳｏｃｋｅｔｓ功能调用的集合,以及为Ｗｉｎｄｏｗｓ 所作的重要扩充。 ＭＦＣ通过两个类ＣＡｓｙｎｃＳｏｃｋｅｔ和ＣＳｏｃｋｅｔ对ＷｉｎｓｏｃｋｅｔＡＰＩ进行了…     

注册表修改十法

给程序配乐 １．在 ＨＫＥＹ_ ＣＵＲＲＥＮＴ_ ＵＳＥＲ＼ＡｐｐＥｖｅｎｔｓ＼Ｓｃｈｅｍｅｓ＼Ａｐｐｓ下分别建立以下主键： ｗｉｎｗｐｓ３２（注意：这个主键必须是可以执行的程序名称,不要加扩展名）。 ２．在右边的默认命令行输入一个标识,比如就叫“ ＷＰＳ２０００”。 ３．在ｗｉｎｗｐｓ３２下建立两个主键“ＯＰＥＮ”、“ＣＬＯＳＥ” ４．到“控制面板”→“声音”中对ＷＰＳ２０００设置相关的音乐。二 在鼠标右键中加入“记事簿” １．在ＨＫＥＹ_ ＬＯＣＡＬ_ＭＡＣＨＩＮＥ＼Ｓｏｆｔｗａｒｅ＼ＣＬＡＳＳＥＳ＼* 下新…     

如何安装Win98和Linux双操作系统

我前些日子得到一张Ｌｉｎｕｘ ２．０版系统安装盘,在Ｗｉｎ ９８系统下启动光盘,进入后即出现以下文字： “ＳＹＳＬｉｎｕｘ１．４８ ｏｘ３８ｄｆ２６ｅ４ Ｃｏｐｙｒｉｇｈｔ（ｃ）１９６４～ １９９９Ｈ． Ｐｅｔｅｒ Ａｎｖｉｎ Ｉｔ ａｐｐｅａｒｓ ｙｏｕｒ ｃｏｍｐｕｔｅｒ ｈａｄ ｌｅｓｓ ｔｈａｎ ６０８Ｋｌｏｗ（“Ｄｏｓ”）ＲＡＭ．Ｌｉｎｕｘ ｎｅｅｄｓ ａｔ ｌｅａｓｔ ｔｈｉｓ ａｍｏｕｎｔｔｏ ｂｏｏｔ．Ｉｆ ｙｏｕ ｇｅｔ ｔｈｉｓ ｍｅｓｓａｇｅ ｉｎ ｅｒｒｏｒ,ｈｏｌｄｄｏｗｎ ｔｈｅ Ｃｔｒｌ ｋｅｙ…     

含磷类血管紧张素转化酶抑制剂的3D—QSAR研究

文章利用限制性构象搜寻（Ｃｏｎｓｔｒａｉｎｔｓ Ｓｅａｒｃｈ）,确定了血管紧张素转化酶（ＡＣＥ）掏剂的药效团模型（活性构象或重叠规则）。用比较分子场分析法（Ｃｏｍｐａｒａｔｉｖｅ ＭｏｌｅｃｕｌａｒＦｉｄｌｄ Ａｎａｌｙｓｉｓ,ＣｏＭＦＡ）建立了含磷类ＡＣＥ掏剂的３Ｄ－ＱＳＡＲ模型。较高的交叉验证回归系数（q＾２＝０． ７２１）及此模型对不同类型抑制剂活性的预测结果,说明了其可靠性和较好的活性预测能     

Two Algorithms for Fast Polyhedron Ray-Tracing

ＴｗｏＡｌｇｏｒｉｔｈｍｓｆｏｒＦａｓｔＰｏｌｙｈｅｄｒｏｎＲａｙ－ＴｒａｃｉｎｇＺｈａｎｇＱｉａｎＳｈｉＪｉａｏｙｉｎｇＣａｉＨｏｎｇＣＡＤ＆ＣＧＳｔａｔｅＫｅｙＬａｂ．，ＺｈｅｊｉａｎｇＵｎｉｖｅｒｓｉｔｙ，３１００２７ＦｏｓｈａｎＥｎｔｅｒｐｒ...     

AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS

Some practical planning problems can be interpreted as set-to-set shortest path problem ( spp ), i.e., as search of a shortest path between two sets of nodes, A and B , of a graph G . A straightforward reduction of such a problem to the search of solutions for point-to-point spp s is impractical because the computational complexity is too high for a huge G . This paper presents a new approach to set-to-set spp for the case of not arbitrary A and B , but those which are represented by some nodes of an additional graph T . The graph T simulates a "geographic system" on G . Under some assumptions natural for many applications, this approach leads to a competitive algorithm for this kind of set-to-set spp . As prospective areas for this technique, two applications are discussed - the problem of route planning for a visually guided robot in a static environment, and the problem of planning a fastest trip by means of all available timetables of all kinds of transport.     

Decomposition for a new kind of imprecise information system

In this paper, we first propose a new kind of imprecise information system, in which there exist conjunctions (∧’s), disjunctions (∨’s) or negations (¬’s). Second, this paper discusses the relation that only contains ∧’s based on relational database theory, and gives the syntactic and semantic interpretation for ∧ and the definitions of decomposition and composition and so on. Then, we prove that there exists a kind of decomposition such that if a relation satisfies some property then it can be decomposed into a group of classical relations (relations do not contain ∧) that satisfy a set of functional dependencies and the original relation can be synthesized from this group of classical relations. Meanwhile, this paper proves the soundness theorem and the completeness theorem for this decomposition. Consequently, a relation containing ∧’s can be equivalently transformed into a group of classical relations that satisfy a set of functional dependencies. Finally, we give the definition that a relation containing ∧’s satisfies a set of functional dependencies. Therefore, we can introduce other classical relational database theories to discuss this kind of relation.     

3-甲基-7-二乙氨基-1,4-氧氮杂萘-2-酮的波谱性质量子化学从头计算

以合成的重要荧光材料3-甲基-7-二乙氨基-1,4-氧氮杂萘-2-酮为例子,进行了一些有机含氮杂环化合物的红外、核磁性质Hartree-Fock(HF)和密度泛函(DFT)量子化学从头计算研究。通过系统构象搜寻,对低能量稳定构象进行了红外振动频率和1H、13C-NMR及偶合常数等光谱学性质的计算,并对计算结果进行详细的归属和解析。在化学位移计算方面,HF／631g(d)和DFT／BG3LYP／6311 g(2d,p)方法计算结果相当。但对于自旋偶合常数的计算,用HF／631g(d)方法不能得到准确的结果,只能用密度泛函大基组的方法才能得到比较准确的结果。计算结果表明有机分子光谱性质的理论计算尤其是核磁性质的计算是一种非常有效的辅助结构确定方法。     

On Weakly Cancellative Fuzzy Logics

Starting from a decomposition result of monoidal t-norm-basedlogic (MTL)-chains as ordinal sums, we focus our attention ona particular kind of indecomposable semihoops, namely weaklycancellative semihoops. The weak cancellation property is provedto be the difference between cancellation and pseudocomplementation,so it gives a new axiomatization of product logic and MTL. Byadding this property, some new fuzzy logics (propositional andfirst-order) are defined and studied obtaining some resultsabout their (finite) strong standard completeness and otherlogical and algebraic properties.     

Time-resolved absorption as optical method for herbicide detection

A new sensing system for the detection of photosynthetic herbicides in water has been developed, based on the use of a trans-membrane protein complex, the reaction centre (RC) isolated from Rhodobacter sphaeroides. The stationary and excited state of this protein are characterised by different absorption properties. The path followed by the protein to return to the stationary state is influenced by the presence of photosynthetic herbicides. Therefore the concentration of herbicides could be measured by monitoring the temporal changes of absorption following optical excitation. For this purpose, an optoelectronic system has been realised. It makes use of a 860 nm light emitting diode and a hybrid photodetector and is coupled to a 5 cm-long optical cell containing the RC solution through optical fibres. The system was tested with atrazine and a limit of detection of 10 nM was obtained.     

基于网际组态技术的物业管理系统的设计

鉴于在目前通用的物业管理系统中,处理的数据仅仅是一些常规物业数据,而对于现代智能建筑来说,其内部所包含的各种系统非常之多,此时再利用常规物业管理系统对建筑物内的各设备层且与物业管理密切有关的数据进行收集、处理,就显得无能为力。为改变这种状况,文中将结合网际组态(WebAccess)技术在智能建筑物业管理系统(IPMS)中的具体应用,对如何解决上述问题进行有关探讨,并给出了具体的应用模型。     

基于相容粗糙集的图形图像信息预检索

早期的利用粗糙集理论进行信息检索都是以“等价粗糙集模型”为基础的，但是等价粗糙集的性质限制了该方法的应用范围，为此有些研究者提出以“相容粗糙集模型”代替“等价粗糙集模型”的新的信息检索的概念，此概念的关键在于“关键词的同时发生”和关于相容粗包含的“匹配算法”，提出了一种利用“相容粗糙集”的理论对图形图像进行预检索的新方法，即在相容类的近似空间里对图形图像进行预检索。为了验证这种新方法的有效性，在人脸图形和图像库中做了若干实验，实验结果表明，该方法可以有效地克服等价粗糙集在图形图像检索方面的限制，对提高图形图像的检索效率具有一定的作用。     

Recursive identification of nonlinear plants operating in closed loop using kernel representations

In this paper, we extend the family of algorithms presented in Algorithms for identification of continuous time nonlinear systems. A passivity approach. In A. Isidori, F. Ramnabhi-Lagarrigue, & W. Respondek (Eds.), Nonlinear control in the year 2000, vol. 2 (pp. 13-44) Berlin: Springer; (Automatica 37 (2000) 469) for the identification of continuous time nonlinear plants operating in closed loop. The new algorithms presuppose that one can construct a stable kernel representation for the “to be identified model” structure. The new theory results in a less restrictive passivity condition. The main novelty is that the identification of unstable plants can be tackled by an appropriate choice of the kernel representation, i.e. there is an additional degree of freedom when constructing the kernel representation. The implicit stability of the controller is still required by the new passivity condition.     

Spectral characterization of necrosis from reflectance of Eucalyptus globulus leaves with Mycosphaerella leaf disease or subjected to artificial lesions

Necrosis is one of a range of symptoms resulting from a number of different biotic and abiotic damage agents that may be detected and quantified with remote sensing as part of an operational forest health monitoring system. Mycosphaerella leaf disease (MLD) caused by Teratosphaeria spp. (formerly known as Mycosphaerella spp.) is the most common foliar disease in young Australian Eucalyptus globulus plantations. Necrosis often occurs in conjunction with other visible symptoms such as chlorosis and reddening, and we have tested whether these symptoms alter the ability of spectral approaches to detect necrosis. We completed two studies of necrosis with pot-grown E. globulus plants; one in which necrosis was induced by artificial infection of Teratosphaeria spp. and one in which necrosis was induced by injury, superimposed on plants with established reddening or chlorosis. Using spectral sensitivity analysis we found that across the two studies, wavelengths between 679 and 695 nm were most sensitive to the presence of necrosis and those between 706 and 726 nm were least sensitive. A new vegetation index (VI) was able to statistically group necrotic treatments together while grouping non-necrotic treatments together, regardless of reddening and chlorosis, which other relevant indices could not. Multivariate methods utilized many wavelengths throughout the spectrum and enabled much greater distinction of all treatment groups related to necrosis, compared with the VIs. Wavelengths in the 679–695 nm range were only occasionally selected as key wavelengths; therefore, results were not similar to the spectral sensitivity data.     

A new spectral conjugate gradient method for large-scale unconstrained optimization

The spectral conjugate gradient methods, with simple construction and nice numerical performance, are a kind of effective methods for solving large-scale unconstrained optimization problems. In this paper, based on quasi-Newton direction and quasi-Newton condition, and motivated by the idea of spectral conjugate gradient method as well as Dai-Kou's selecting technique for conjugate parameter [SIAM J. Optim. 23 (2013), pp. 296–320], a new approach for generating spectral parameters is presented, where a new double-truncating technique, which can ensure both the sufficient descent property of the search directions and the bounded property of the sequence of spectral parameters, is introduced. Then a new associated spectral conjugate gradient method for large-scale unconstrained optimization is proposed. Under either the strong Wolfe line search or the generalized Wolfe line search, the proposed method is always globally convergent. Finally, a large number of comparison numerical experiments on large-scale instances from one thousand to two million variables are reported. The numerical results show that the proposed method is more promising.