从知识传授到育人:高职“生活中的化学”教学实践*

深挖高职院校公选课“生活中的化学”的育人元素,精心设计教学内容,运用课堂主题辩论、趣味生活实验的设计与展示、探秘生活中的化学等理论知识传授与课内外实践相结合的教学方式,实现全过程育人,充分展现了公选课在立德树人方面的价值。     

A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

国家关键技术管理计算机系统研究

本文根据国家关键技术管理工作的特点，本着提高决策质量，满足用户要求的原则，分析和设计国家关键技术管理计算机系统，为高层次宏观决策提供丰富的信息支持。     

Quantum Key Distribution Using Four-Qubit W State

A new theoretical quantum key distribution scheme based on entanglement swapping is proposed, where four-qubit symmetric W state functions as quantum channel. It is shown that two legitimate users can secretly share a series of key bits by using Bell-state measurements and classical communication.     

基于内生信息的股票发售机制比较研究

本文在内生信息成本的基础上，通过引入投资银行的信息成本函数，考察了国际上主要股票发售机制的内在机理，并用一个统一的框架比较了各种发售机制的差异及演进趋势。本研究表明，在投资银行和投资者信息成本相同的情况下，由于固定价格发售机制须用额外的折价去解决投资者之间的信息问题，因而相对于累计投标询价制是一种处于劣势的机制选择。同时指出，具有信息成本优势的机构投资者的出现和发展，是固定价格发行向询价发行过渡的一个必要条件。     

Some New Results on Key Distribution Patterns and Broadcast Encryption

This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families.     

关系模式关键字的一个求解算法

本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。     

A NOVEL METHOD FOR CONSTRUCTION OF SIDE CHAIN OF BRASSINOSTEROIDS

Construction of the side chain of brassrnolide and its related compounds by the aldolreaction of lithofuran with 22-steroidal aldehyde obtained from hyodeoxycholic acid isdescribed. A key intermediate, 22R, 23R-γ-hydroxy-α, β-unsaturated lactone (16) wassynthesized.     

Fast folding and comparison of RNA secondary structures

Summary Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities.An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment.All computer codes are written in ANSI C. They include implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.

---

Schnelle Faltung und Vergleich von Sekundärstrukturen von RNA

Zusammenfassung Die im Vienna RNA package enthaltenen Computer Programme für die Berechnung und den Vergleich von RNA Sekundärstrukturen werden präsentiert. Ihren Kern bilden Algorithmen zur Vorhersage von Strukturen minimaler Energie sowie zur Berechnung von Zustandssumme und Basenpaarungswahrscheinlichkeiten mittels dynamischer Programmierung.Ein effizienter heuristischer Algorithmus für das inverse Faltungsproblem wird vorgestellt. Darüberhinaus präsentieren wir kompakte und effiziente Programme zum Vergleich von RNA Sekundärstrukturen durch Baum-Editierung und Alignierung.Alle Programme sind in ANSI C geschrieben, darunter auch eine Implementation des Faltungs-algorithmus für Parallelrechner mit verteiltem Speicher. Wie Tests auf einem Intel Hypercube zeigen, wird das Parallelrechnen umso effizienter je länger die Sequenzen sind.