基于SQL的多条件选择智能实现算法

B/S架构的信息系统开发中,一般情况下,根据用户的选择,n个条件的输入组合数是2n个。但是,该文中提出的算法,其组合数仅为n到n(n+1)/2,大大简化了编程。     

A comparative study of two techniques for improving power‐handling capability of CMOS T/R switches

This article proposes an asymmetric topology for transmit/receive (T/R) switches and more importantly presents a comparative study of both LC‐tuned and resistive body‐floating techniques for improving the power‐handling capability of the T/R switches in the same 0.18‐μm triple‐well CMOS. It is shown from simulations and measurements that the switches adopting either technique achieve comparable performances. For instance, the switch employing the LC‐tuned body‐floating technique exhibits insertion loss of 1.5 dB, isolation of 23.5 dB, and power‐handling capability of 22.5 dBm at 5.2 GHz, whereas the switch using the resistive body‐floating technique exhibits insertion loss of 1.3 dB, isolation of 24 dB, and power‐handling capability of 22.2 dBm, respectively. Therefore, one can conclude that the asymmetric topology with the resistive body‐floating technique is more suitable for designing T/R switches for wireless local area network applications as it consumes smaller silicon area. © 2010 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2010.     

Invariant-driven specifications in Maude

This work presents a general mechanism for executing specifications that comply with given invariants, which may be expressed in different formalisms and logics. We exploit Maude’s reflective capabilities and its properties as a general semantic framework to provide a generic strategy that allows us to execute Maude specifications taking into account user-defined invariants. The strategy is parameterized by the invariants and by the logic in which such invariants are expressed. We experiment with different logics, providing examples for propositional logic, (finite future time) linear temporal logic and metric temporal logic.     

基于PicoBlaze的多软核网络处理结构研究

介绍一种基于多个8位CPU软核PicoBlaze的网络处理结构.该结构利用现场可编程门阵列(FPGA)的并行性和网络协议分层结构的特点,可以实现一些相对复杂的网络处理功能,并且易于扩展和开发.通过在FPGA上完整实现一个远程启动服务器端的设计实例,阐明具体的设计方法.     

A method for stochastic multiple criteria decision making based on dominance degrees

This paper proposes a method for solving the stochastic multiple criteria decision making (SMCDM) problem, where consequences of alternatives with respect to criteria are represented by random variables with probability distributions. Firstly, definitions and related analysis of dominance degree of one probability distribution over another are given. Then, by calculating the dominance degrees, the dominance degree matrix of alternative pairwise comparisons with respect to each criterion is built. Further, using PROMETHEE II method, an overall dominance degree matrix of alternative pairwise comparisons is constructed, and a net flow of each alternative is calculated. Based on the obtained net flows, a ranking of alternatives is determined. Finally, numerical examples for the three cases are given to illustrate the use of the proposed method.     

On the implication problem for cardinality constraints and functional dependencies

In database design, integrity constraints are used to express database semantics. They specify the way by that the elements of a database are associated to each other. The implication problem asks whether a given set of constraints entails further constraints. In this paper, we study the finite implication problem for cardinality constraints. Our main result is a complete characterization of closed sets of cardinality constraints. Similar results are obtained for constraint sets containing cardinality constraints, but also key and functional dependencies. Moreover, we construct Armstrong databases for these constraint sets, which are of special interest for example-based deduction in database design.     

A Constraint-Based Approach for Deriving 3-D Structures of Cyclic Polypeptides

This paper presents an hybrid algorithm for deriving 3-D structures of cyclic polypeptides. The algorithm combines constraint-based techniques with the most widely used methods for non-cyclic polypeptides. The empirical results demonstrate that the proposed hybrid algorithm outperforms traditional methods especially with respect to running times.     

Evolving Teams of Predictors with Linear Genetic Programming

This paper applies the evolution of GP teams to different classification and regression problems and compares different methods for combining the outputs of the team programs. These include hybrid approaches where (1) a neural network is used to optimize the weights of programs in a team for a common decision and (2) a realnumbered vector (the representation of evolution strategies) of weights is evolved with each term in parallel. The cooperative team approach results in an improved training and generalization performance compared to the standard GP method. The higher computational overhead of team evolution is counteracted by using a fast variant of linear GP.