新型高选择性水杨酸根离子选择性电极的研究

首次研究了基于苯甲醛甘氨酸合镍(Ⅱ)金属配合物[Ni(Ⅱ)-BBAG]为中性载体的阴离子选择性电极.该电极对水杨酸根(Sal-)具有优良的电位响应性能,并呈现出反Hofmeister选择性行为,其选择性次序为Sal-＞C1O4-＞SCN-＞I-＞NO2-＞Br-＞NO3-＞SO32-＞SO42-＞Cl-.在pH5.0的磷酸盐缓冲体系中,电极电位呈现近能斯特响应,线性响应范围为5.0×10-5～1.0×10-1mol/L,斜率为-58.5 mV/dec(20℃),检测下限为2.0×10-5mol/L.采用交流阻抗技术和紫外可见光谱技术研究了电极的响应机理,结果表明配合物中心金属原子的结构以及载体本身的结构与电极的响应行为之间有非常密切的构效关系.并将电极用于药品分析,其结果令人满意.     

新型高选择性硫氰酸根离子电极的研究

首次研制了基于二苯甲酮缩氨基硫脲合铜(Ⅱ)金属配合物[Cu(Ⅱ)-BBKT]为中性载体的阴离子选择性电极.该电极对硫氰酸根(SCN-)具有优良的电位响应性能,并呈现出反Hofmeister选择性行为,其选择性次序为:SCN-＞I-≈Sal-＞ClO4-＞Br-＞NO3-＞NO2-＞F-＞SO32-＞SO42-.在pH 5.0的磷酸盐缓冲体系中,电极电位呈现近能斯特响应,线性响应范围为8.0×10-6～1.0×10-1mol/L,斜率为-55.2mY/dec(20℃),检测下限是4.5×10-6mol/L.采用交流阻抗技术和紫外可见光谱技术研究了电极的响应机理,结果表明配合物中心金属原子的结构以及载体本身的结构与电极的响应行为之间有非常密切的构效关系.并将该电极用于实验室废水硫氰酸根检测,其结果令人满意.     

乙酰基吡啶Schiff碱Cu(Ⅱ)配合物为载体的硫氰酸根离子电极的研究

以乙酰基吡啶Schiff碱铜配合物为中性载体制备了一种具有优良电位响应特性的PVC膜阴离子电极,该电极对硫氰酸根离子(SCN-)呈现出反Hofmeister序列行为,其选择性顺序为:SCN-＞ClO4-＞Sal-＞I-＞Br-＞SO42-＞HCO3-＞SO32-＞NO3-＞NO2-＞Cl-＞F-.电极在pH5.0的磷酸盐缓冲溶液体系中对SCN-在2.0×10-6～1.0×10-1 mol/L浓度范围内呈现近能斯特响应,斜率为-55.5 mV/dec,检出限为9.0×10-7 mol/L.采用交流阻抗技术研究了阴离子与载体的作用机理,并将电极应用于银离子的定量分析.     

基于新型Schiff碱铜配合物为中性载体高选择性硫氰酸根离子电极的研究

首次研究了基于水杨醛缩亚辛胺合铜(Ⅱ)金属配合物[Cu(Ⅱ)-SADOA]为中性载体的PVC膜电极.该电极对硫氰酸根离子具有优良的电位响应性能和选择性并呈现出反Hofmeister选择性行为,其选择性次序为SCN-＞ClO4-＞Sal-＞I-＞Br-＞NO2-＞NO3-＞SO32-＞Cl-＞SO42-＞H2PO4-.在pH=5的磷酸盐缓冲体系中,电极电位呈现近能斯特响应,线性响应范围为3.0×10-6～1.0×10-1 mol/L,斜率为-55.7mV/dec(20℃),检出下限为1.0×10-6 mol/L.采用交流阻抗技术和紫外可见光谱技术研究了电极的响应机理,结果表明配合物与电极的响应行为之间有非常密切的构效关系.该电极具有响应快、重现性好、检出限低、制备简单等优点.将电极用于实际样品分析,其结果令人满意.     

N，N-双（2-氨基苯基）草酸二酰胺合铜（Ⅱ）配合物为中性载体的高选择性硫氰酸根电极的研究

该文以N,N-双(2-氨基苯基)草酸二酰胺合铜(Ⅱ)[Cu(Ⅱ)-BAPO]为中性载体,制备了一种对硫氰酸根(SCN-)具有优良的电位响应特性并呈现出反Hofmeister选择性行为的离子电极,其选择性次序为:SCN-＞ClO4-＞I-＞Sal-＞NO3-＞Cl-＞NO2-＞CH3COO-＞SO42-＞F-＞PO43-.该电极在pH=5.0的磷酸盐缓冲体系中具有最佳的电位响应,在1.0×10-5～1.0×10-1mol/L SCN-浓度范围呈近能斯特响应,斜率为-67.5 mV/pSCN-(25℃),检测下限为4.0×10-6mol/L.采用紫外光谱分析技术研究了配合物中心金属原子以及配合物本身的结构对电极电位响应行为的作用机理.将该电极用于废水分析,结果令人满意.     

基于铜(Ⅱ)席夫碱配合物为中性载体的高选择性水杨酸根传感器的研究

该文合成了双水杨醛缩4,4,-二氨二苯甲烷铜(Ⅱ)金属有机配合物,并以此配合物为中性载体,制得PVC膜离子选择性电极.该电极在pH值为4.0～8.5范围内对水杨酸根离子有较好的Nernst响应,且呈现反Hofmeister序列行为.电极具有良好的选择性、稳定性和重现性,其线性范围为2.7×10-5～1.0×10-1 mol/L.通过UV-Vis、交流阻抗技术分析了电极响应机理,将该电极初步应用于药品分析中,其测定结果与经典滴定法测定结果基本一致.     

以异双四齿Schiff碱金属铜(Ⅱ)配合物为载体的高选择性硫氰酸根电极的研究

该文研究了异双四齿Schiff碱铜(Ⅱ)金属配合物[Cu(Ⅱ)-USTT],研究了基于该种金属配合物为中性载体的阴离子选择性电极的电位响应特性.该电极对硫氰酸根离子呈现出优良的电位响应性能和选择性,其选择性序列为:SCN-＞C104-＞I-＞NO3-＞SO32-＞NO2-＞Cl-＞CH3COO-＞Br-＞SO42-,电极在pH=4.0的磷酸盐缓冲体系中对SCN-在1.0×10-1～1.0×10-6 mol/L浓度范围内呈近能斯特响应,斜率为-54.8 mV/dec,检测下限为2.6×10-6 mol/L.采用紫外光谱分析技术研究了阴离子与载体的作用机理.电极制作简便,响应快,重现性和稳定性好.将该电极用于环境废水中SCN-的监测,获得满意的结果.     

基于安息香缩硫代氨基脲合铜(Ⅱ)为中性载体新型硫氰酸根离子选择性电极的研究

该文研究了以安息香缩硫代氨基脲合铜(Ⅱ)为中性载体的硫氰酸根离子(SCN-)选择性电极,其选择性次序为:SCN-＞Ⅰ-＞ClO4-＞NO3-＞Br-＞SO32-＞Cl-＞NO2-＞SO42-.该电极在pH 5.0的磷酸盐缓冲体系中对SCN-具有最佳的电位响应,在1.0×10-1～8.0×10-5mol/L SCN-浓度范围呈近能斯特响应,斜率为-55.0 mV/pSCN-(25℃),检测下限为4.0×10-5mol/L.采用交流阻抗和紫外光谱分析技术研究了配合物中心金属原子以及配合物本身的结构对电极电位响应行为的作用机理.将该电极用于工业废水中硫氰酸根离子含量的测定,得到了满意的结果.     

以双核有机锡(Ⅳ)配合物为中性载体高选择性硫氰酸根电极的研究

研究了双核三苄基甲醇锡(Ⅳ)哌嗪荒酸酯配合物[Sn(Ⅳ)-BTMTP]为中性载体的PVC膜阴离子选择性电极.这类电极对硫氰酸根离子呈现出优良的电位响应性能和选择性,并呈现出反Hofmeister选择性行为.其选择性序列为:SCN->I->ClO4->NO2->NO3->Cl->SO42-＞AC-,该电极在pH=4.0的磷酸盐缓冲体系中对SCN-呈超能斯特响应,响应范围为1.0×10-1～3.2×10-5mol/L,斜率为-72.4mV/dec,检出限为1.28×10-5mol/L.采用交流阻抗及紫外光谱研究了阴离子与载体的作用机理.将该电极用于废水分析,结果令人满意.     

稀土三元配合物中性载体水杨酸根离子电极的研究

以8-羟基喹啉-邻菲罗啉-La(Ⅲ)稀土配合物[La(Ⅲ)(Phen)(Oxine)]为中性载体的PVC膜电极对水杨酸根具有良好的电位响应性能和选择性,其选择性次序为Sal-＞ClO4-＞SCN-＞I-＞Br-＞NO2-＞SO32-＞Cl-＞SO42-.在pH4.0的磷酸盐缓冲体系中,电极电位呈现近能斯特响应,线性响应范围为1.0×10-5～1.0×10-1 mol/L,斜率为-58.5 mV/dec(20℃),检测下限为9.8×10-6 mol/L.采用交流阻抗技术研究了电极的响应机理,结果表明,配合物中心金属原子的结构以及载体本身的结构与电极的响应行为之间有非常密切的构效关系.电极可用于药品分析.     

Highly Sensitive!

Alpha Versionen sind Lehrbücher, Gesetze, Produkthochglanzprospekte, Aktienneuemissionsanzeigen, Regierungserklärungen. Dahinter ist das Reale. Hinter den Lehrbüchern die vorlesende Forscherpersönlichkeit, hinter dem Prospekt der Rat des erfahrenen Fachverkäufers. Alpha Versionen meiden Urteile, Meinungen und Leidenschaftlichkeit. Diese Kolumne ist kompromißlos beta.     

Highly stylised animation

In this paper we argue for our NPAR system as an effective 2D alternative to most NPR research, which is focused on frame coherent stylised rendering of 3D models. Our approach gives a highly stylised look to images without the support of 3D models. Nevertheless, they still behave as though they are animated by drawing, which they are. First, a stylised brush tool is used to freely draw extreme poses of characters. Each character is built of 2D drawn brush strokes which are manually grouped into layers. Each layer is assigned its place in a drawing hierarchy called a hierarchical display model (HDM). Next, multiple HDMs are created for the same character, each corresponding to a specific view. A collection of HDMs essentially reintroduces some correspondence information to the 2D drawings needed for inbetweening and, in effect, eliminates the need for a true 3D model. Once the models are composed the animator starts by defining keyframes from extreme poses in time. Next, brush stroke trajectories defined by the keyframe HDMs are inbetweened automatically across intermediate frames. Finally, each HDM of each generated inbetween frame is traversed and all elements are drawn one on another from back to front. Our techniques support highly rendered styles which are particularly difficult to animate by traditional means including the ‘airbrushed’, scraperboard, watercolour, Gouache, ‘ink-wash’, pastel, and the ‘crayon’ styles. In addition, we describe the data path to be followed to create highly stylised animations by incorporating real footage. We believe our system offers a new fresh perspective on computer-aided animation production and associated tools.     

Highly reliable symmetric networks

We generalize directed loop networks to loop-symmetric networks in which there are N nodes and in which each node has in-degree and out-degree k, subject to the condition that 2^k does not exceed N. We show that by proper selection of links one can obtain generalized loop networks with optimal or close to optimal diameter and connectivity. The optimized diameter is less than k[N¹k/], where [x] indicates the ceiling of x. We also show that these networks are rather compact in that the diameter is not more than twice the average distance. Roughly 1/2(k-1)N¹k/ nodes can be removed such that the network of remaining nodes is still strongly connected, if all remaining nodes have at least one incoming and one outgoing link left     

Highly Constrained Unification Grammars

Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, off-line parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity and allow for efficient processing. We first show that non-reentrant unification grammars generate exactly the class of context-free languages. We then relax the constraint and show that one-reentrant unification grammars generate exactly the class of mildly context-sensitive languages. We thus relate the commonly used and linguistically motivated formalism of unification grammars to more restricted, computationally tractable classes of languages.     

Highly interactive distributed visualization

We report on our iGrid2005 demonstration, called the “Dead Cat Demo”; an example of a highly interactive augmented reality application consisting of software services distributed over a wide-area, high-speed network. We describe our design decisions, analyse the implications of the design on application performance and show performance measurements.     

Highly concurrent multi-word synchronization

The design of concurrent data structures is greatly facilitated by the availability of synchronization operations that atomically modify $k$ arbitrary items, such as $k$-read–modify–write ($k\text{<mi mathsize="small" is="true">RMW</mi>}$). Aiming to increase concurrency in order to exploit the parallelism offered by today’s multi-core and multi-processing architectures, we propose a highly concurrent software implementation of $k\text{<mi mathsize="small" is="true">RMW</mi>}$, with only constant space overhead. Our algorithm ensures that two operations delay each other only if they are within distance $O\left(k\right)$ in the conflict graph, induced by the operations’ data items.The algorithm uses double compare-and-swap (dcas). When dcas is not supported by the architecture, the algorithm of Attiya and Dagan (2001) [3] can be used to replace dcas with (unary) cas, with only a slight increase in the interference among operations.     

Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems

In recent years, constraint satisfaction techniques have been successfully applied to disjunctive scheduling problems, i.e., scheduling problems where each resource can execute at most one activity at a time. Less significant and less generally applicable results have been obtained in the area of cumulative scheduling. Multiple constraint propagation algorithms have been developed for cumulative resources but they tend to be less uniformly effective than their disjunctive counterparts. Different problems in the cumulative scheduling class seem to have different characteristics that make them either easy or hard to solve with a given technique. The aim of this paper is to investigate one particular dimension along which problems differ. Within the cumulative scheduling class, we distinguish between highly disjunctive and highly cumulative problems: a problem is highly disjunctive when many pairs of activities cannot execute in parallel, e.g., because many activities require more than half of the capacity of a resource; on the contrary, a problem is highly cumulative if many activities can effectively execute in parallel. New constraint propagation and problem decomposition techniques are introduced with this distinction in mind. This includes an O(n²) edge-finding algorithm for cumulative resources (where n is the number of activities requiring the same resource) and a problem decomposition scheme which applies well to highly disjunctive project scheduling problems. Experimental results confirm that the impact of these techniques varies from highly disjunctive to highly cumulative problems. In the end, we also propose a refined version of the edge-finding algorithm for cumulative resources which, despite its worst case complexity in O(n³) , performs very well on highly cumulative instances.     

Highly dynamic text display system

A new text-handling display system (the QMC text terminal) is described. Its main features are the ability to subdivide the screen into pages and a colour display. In this way, the user is able to consult a number of pages at one time, extract them, update them and file them. This represents a step towards the ‘electronic desk’.     

基于代理的高性能目录服务的设计和实现

目录服务能有效解决虚拟组织中动态多样的资源管理问题。在分布式系统环境下,目录服务的可用性和安全性必须得到保障。本文提出了一种基于代理的目录服务模型,该模型以基于虚拟组织的分布式商业应用为背景,在提高目录服务自身保护能力的同时,保障了目录服务的稳定和高效。     

高效均值滤波算法*

为了提高现有均值滤波算法的速度,减少冗余操作,提出了一种高效的均值滤波算法。首先建立一个辅助数组,结合滤波窗口在按行滑动时相邻窗口之间的递归关系和按列移动时相邻两行对应的辅助数组之间的递归关系,设计出更新辅助数组元素和新窗口中心点对应均值的递归式,根据这两个递归式,设计出了高效的均值滤波算法。理论分析表明该算法极大地减少了冗余操作,且算法效率不受窗口大小变化的影响。实验结果证明,在滤波效果一致的前提下,本算法比现有快速均值滤波算法更高效。