52 resultados para graph matching algorithms
Resumo:
Genetic Algorithms (GAs) were used to design triangular lattice photonic crystals with large absolute band-gap. Considering fabricating issues, the algorithms represented the unit cell with large pixels and took the largest absolute band-gap under the fifth band as the objective function. By integrating Fourier transform data storage mechanism, the algorithms ran efficiently and effectively and optimized a triangular lattice photonic crystal with scatters in the shape of 'dielectric-air rod'. It had a large absolute band gap with relative width (ratio of gap width to midgap) 23.8%.
Resumo:
Based on the conventional through-short-match (TSM) method, an improved TSM method has been proposed in this Letter. This method gives an analytical solution and has almost all the advantages of conventional TSM methods. For example, it has no phase uncertainty and no bandwidth limitation. The experimental results show that the accuracy can be significantly improved with this method. The proposed theory can be applied to the through-open-match (TOM) method. (C) 2002 Wiley Periodicals. Inc.
Resumo:
Comparing with the conventional CCFL (Cold Cathode Fluorescent Lamp) backlight, three-basic-color LEDs backlight has some advantages such as good color reproduction, long life and lead free etc. Theoretically, the color gamut is determined by x, y coordinates of the three basic colors in CIE chromaticity diagram, and the x, y coordinates of each basic color can derived from the relative spectrum distribution (RSD) of the LED. In this paper, the red, green and blue LEDs' RSD models are established to calculate and analyze the color gamut of a backlight. By simulating those models, the relationships that the color gamut of a LED backlight varies with each color are analyzed, and the optimum combination of three colors is obtained within the given wavelengths ranges. Moreover, the combinations of three colors for the gamut of 115% NTSC and 110% NTSC are plotted in pictures, respectively.
Resumo:
In this paper, a charge-pump based phase-locked loop (CPLL) that can achieve fast locking and tiny deviation is proposed and analyzed. A lock-aid circuit is added to achieve fast locking of the CPLL. Besides, a novel differential charge pump which has good current matching characteristics and a PFD with delay cell has been used in this PLL. The proposed PILL circuit is designed based on the 0.35um 2P4M CMOS process with 3.3V/5V supply voltage. HSPICE simulation shows that the lock time of the proposed CPLL can be reduced by over 72% in comparison to the conventional PILL and its charge pump sink and source current mismatch is only 0.008%.
Resumo:
LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.
Resumo:
A Function Definition Language (FDL) is presented. Though designed for describing specifications, FDL is also a general-purpose functional programming language. It uses context-free language as data type, supports pattern matching definition of functions, offers several function definition forms, and is executable. It is shown that FDL has strong expressiveness, is easy to use and describes algorithms concisely and naturally. An interpreter of FDL is introduced. Experiments and discussion are included.
Resumo:
A new algorithm for compiling pattern matching is presented. Different from the traditional traversal-based approaches, it can represent a sequence of patterns as an integer by an encoding method and translate equations into case-expressions. The algorithm is simple to implement, and efficient for a kind of patterns, i.e. simple and dense patterns. This method can be complementary to traditional approaches.
Resumo:
算法被誉为计算的“灵魂”(spirit of computing),算法程序的可靠性和正确性对软件系统的可信度起着至关重要的作用。动态规划、贪心、分支限界等传统的算法设计策略缺乏有效的选择标准,一些算法形式化开发方法和工具的应用水平和范围也很有限,因此算法的可靠性已成为高可信软件系统的一个主要瓶颈。 作为军事运筹学的一个重要分支,装备保障计算主要研究军事活动中装备领域的决策优化问题,保障计算软件特别是算法的可靠性在很大程度上决定了装备保障的效率乃至军事行动的成败。利用形式化软件工程的研究成果、特别是引入算法程序的形式化开发方法,对我军通用装备保障领域中的大量算法类问题进行有效求解,有利于优化保障结构、统筹保障资源、整合保障力量、提高保障时效,促进装备整体战斗力水平的提升。 本文以高可信软件开发方法PAR为基础,面向装备保障计算的领域需求,提出了一类离散最优化问题(discrete optimization problem, DOP)的结构模型和算法推演技术,并成功推演了一系列典型的装备保障算法。本论文的主要创新性贡献如下: (1)定义了DOP的结构模型,提出了基于单点结构(Singleton)的问题分划递推策略,进而通过PAR算法推演生成问题的高效求解算法,涵盖了多种传统算法设计策略,显著提高了算法程序设计的机械化水平。 (2)提出了描述DOP分划递推过程的问题简约图(problem reduction graph, PRG)模型,并针对典型DOP结构推演得到了一组PRG构造算法模式,其中每个算法模式都涵盖了满足特定代数结构性质的一大类具体问题。 (3)阐述了PAR算法推演的范畴模型,为算法设计和重用提供了抽象而有效的方法指导。 (4)对我军通用装备保障领域具有代表性的48个问题进行了形式化的算法推演,构建了领域算法库。 (5)在PAR平台的基础上设计了装备保障算法开发平台的原型COPALM,支持DOP算法推演和重用,进而提高了相关应用软件的开发效率。
Resumo:
Knowledge management is a critical issue for the next-generation web application, because the next-generation web is becoming a semantic web, a knowledge-intensive network. XML Topic Map (XTM), a new standard, is appearing in this field as one of the structures for the semantic web. It organizes information in a way that can be optimized for navigation. In this paper, a new set of hyper-graph operations on XTM (HyO-XTM) is proposed to manage the distributed knowledge resources.HyO-XTM is based on the XTM hyper-graph model. It is well applied upon XTM to simplify the workload of knowledge management.The application of the XTM hyper-graph operations is demonstrated by the knowledge management system of a consulting firm. HyO-XTM shows the potential to lead the knowledge management to the next-generation web.
Resumo:
随着越来越多的信息被表示为RDF格式,如何高效地对RDF信息进行分发和过滤成为一个重要的问题.在语义Web环境下的信息分发系统中,输入的RDF信息需要和大量的用户订阅条件进行匹配,而用户的订阅条件可以被表示为RDF图模式.根据RDF图的特点,并对其增加了一些约束.设计了一种新的RDF图模式匹配算法.实验结果表明,该算法的匹配效率远远高于传统的图模式匹配算法.