浅谈金属着色在现代首饰设计中的应用

金属着色工艺在现代工业技术的条件下已经发展到了很高的水平,有了技术的支撑,金属的固有色可以轻易得到改变,这就为现代首饰设计中各种金属的运用提供了自由空间,从此,色彩在现代首饰设计中真正扮演了主角,真正成为了现代首饰艺术中的关键造型因素,极大地丰富了现代首饰艺术的造型语言和表现力。     

大平面彩色不锈钢花纹装饰板的制备

采用丝网印刷技术在不锈钢板表面印制花纹图案耐蚀墨膜，采用表面氧化法(INCO法)进行着色，通过控制丝网印刷参数，选择合理的着色液配方和着色时间，获得了大平面的彩色不锈钢花纹装饰板。该方法具有成本低、工艺简单、生产效率高的优点。     

An exact algorithm with learning for the graph coloring problem

Given an undirected graph G=(V,E), the Graph Coloring Problem (GCP) consists in assigning a color to each vertex of the graph G in such a way that any two adjacent vertices are assigned different colors, and the number of different colors used is minimized. State-of-the-art algorithms generally deal with the explicit constraints in GCP: any two adjacent vertices should be assigned different colors, but do not specially deal with the implicit constraints between non-adjacent vertices implied by the explicit constraints. In this paper, we propose an exact algorithm with learning for GCP which exploits the implicit constraints using propositional logic. Our algorithm is compared with several exact algorithms among the best in the literature. The experimental results show that our algorithm outperforms other algorithms on many instances. Specifically, our algorithm allows to close the open DIMACS instance 4-Fullins_5.     

人工神经网络在图论中的应用

人工神经剐络与图论之闻有密切的联系。本文把人工神经网络应用于图论的问题求解中,利用Hopfield网络对图的着色、图的最大独立集和最大团进行求解,构造了各自的能量函数,进而得出网络的运行方程。     

STM多事务竞争冲突下竞争管理策略的研究

事务存储系统是一种高层次抽象并行编程模型,目的为方便开发并行程序。事务存储系统中的竞争管理模块用于解决事务之间的冲突。传统的事务竞争管理策略只负责仲裁两个冲突事务之间的冲突．提出将多个事务及事务冲突关联转换成一张无向图,基于全局事务冲突情景,利用图顶点着色技术求解无向图中最大独立集。最大独立集中事务相互不冲突,CM仲裁处理并发执行,实现系统并发最大化。     

用顶点着色问题的贪婪算法解决排课问题

顶点着色的贪婪算法中＂按给定的顺序、满足一定的条件依次对顶点着色过程＂可视为＂按给定的顺序、满足一定的条件依次将顶点放入不同（颜色）的盒子中的过程＂,受此启发,设计相应的排课算法,首先提出＂数量约束＂的概念,给出该问题的具体需满足数量约束的项;然后将总表中的每条记录看成一个＂顶点＂,将一张课表中每一个具体的表格视为不同（颜色）的＂盒子＂,设计相应的启发式规则;最后把排课的过程巧妙的变成把每个＂顶点＂按相应的规则、在满足＂数量约束＂的要求的前提下放入上述＂盒子＂中的过程。     

密集型WSN冲突避免的MAC协议

无线传感器网络媒体接触控制层存在2种冲突。提出基于概率的时隙选择算法,使不同节点在相同时隙发送概率不同,从而降低域内冲突。实验结果显示,该算法的有效能量和损失能量相比Sift协议节省了17.6%和43.9%,能量有效率提高了14.3%。提出染色预防算法,通过提前确定节点活动时序解决域间冲突问题。实验结果显示,该算法的节点平均睡眠时间在87%以上,空闲侦听导致的能量消耗仅占总能量的7%。     

非线性DEDS的周期时间配置与凝着色图

对于用极大极小函数描述的非线性离散事件动态系统(DEDS)，提出一种凝着色图方法。用该方法证明了不同周期时间的数日等于凝点的数日。在此基础上给出了能用状态反馈(独立)配置周期时间的充要条件，解决了与传统线性控制系统极点配置问题完全对应的问题。将该结果应用于线性DEDS，得到了配置域及缩短的周期时间。     

Routing on Meshes with Buses

We consider the problem of routing packets on an MIMD mesh-connected array of processors augmented with row and column buses. We give lower bounds and randomized algorithms for the problem of routing k-permutations (where each processor is the source and destination of exactly k packets) on a d-dimensional mesh with buses, which we call the (k,d)-routing problem. We give a general class of ``hard' permutations which we use to prove lower bounds for the (k,d)-routing problem, for all k,d≥ 1. For the (1,1)- and (1,2)-routing problems the worst-case permutations from this class are identical to ones published by other authors, as are the resulting lower bounds. However, we further show that the (1,d)-routing problem requires 0.72 ... n steps for d=3, 0.76 ... n steps for d=4, and slightly more than steps for all d≥ 5. We also obtain new lower bounds for the (k,d)-routing problem for k,d > 1, which improve on the bisection lower bound in some cases. These lower bounds hold for off-line routing as well. We develop efficient algorithms for the (k,1)-routing problem and for the problem of routing k-randomizations (where each processor has k packets initially and each packet is routed to a random destination) on the one-dimensional mesh and use them in a general (k,d)-routing algorithm which improves considerably on previous results. In particular, the routing time for the (1,d)-routing problem is bounded by steps with high probability (whp), whenever for some constant ε > 0, and the routing time for the (k,d)-routing problem is steps whp whenever for some constant ε > 0 and k≥ 3.6 ... d, matching the bisection lower bound. We then present a simple algorithm for the (2,2)-routing problem running in 1.39 ... n+o(n) steps whp. Finally, for the important special case of routing permutations on two-dimensional meshes with buses, the (1,2)-routing problem, we give a more sophisticated algorithm that runs in 0.78 ... n+o(n) steps whp. Received May 18, 1994; revised June 23, 1995.