连续时间广义边值系统的状态结构

连续时间广义边值系统被描述为：Ｅｘ（ｔ）＝Ａｘ（ｔ）＋Ｂｕ（ｔ），Ｍｘ（Ｔ）＝η，其中Ｅ是奇异方阵；ｕ（ｔ）满足任意次可微，本文讨论了这类系统的定义，可解性及其状态结构。     

滞后不确定性系统的鲁棒控制

１主要结果本文将文［１］的结论推广到具有多重状态时滞和多重控制时滞的不确定性系统ｘ（ｔ）＝（Ａ０＋Ｂ０ΔＡ０（ｒ０（ｔ）））ｘ（ｔ）＋∑Ｎｉ＝１Ｂ０（Ａｉ＋ΔＡｉ（ｒｉ（ｔ）））ｘ（ｔ－ｄｘｉ（ｔ））＋（Ｂ０＋Ｂ０ΔＢ０（ｓ０（ｔ）））ｕ（ｔ）＋∑Ｍ...     

一类连续时间广义边值系统的能控性和能观性

连续时间广义边值系统被描述为Ｅｘ（ｔ）＝Ａｘ（ｔ）＋Ｂｕ（ｔ），Ｖ０ｘ（０）＋Ｖｒｘ（Ｔ）＝ｖ，其中Ｅ是奇异方阵，ｕ（ｔ）满足任意次可微，本文讨论了一类连续时间广义边值系统的有关向内和向外边值过程的两个重要概念，并在此基础上给出了能控性和能观性定义和判别准则．     

密技大放送

在一般状态下同时按住ＣＴＲＬ及Ｉｎｓｅｒｔ,再输入密技 ＯＤＤＭ＝战斗中按Ｆ５键补ＨＰ,ＭＰ,ＤＰ（每按次,就可以使用 必杀技且可以使死去的人复活） ＯＤＦＵＬＬＳＫＩＬＬ＝能学会所有的必杀技、魔法、技能 ＯＤＮＯＢＡＴ＝不会遇到机率战斗 ＯＤＦＲＥＥＳＡＶＥ＝随时存档 ＯＤＧＥＴＧＯＬＤｎ＝增加金钱,ｎ为金钱数值（要空一格）ＯＤＧＥＴＤＮＡｎ１ｎ２＝获得物品,ｎ１是物品代码,ｎ２是数量（最　是数量（最多９９） ＯＤＧＥＴＩＴＥＭｎ１　ｎ２＝获得物品,ｎ１是物品代码,ｎ２是数量（最　多９９） ｇｉ－－ｉ…     

UP,βn和FewP完全问题的相对同构性

本文引进相对的多项式化归和相对多一多项式同构等概念，对ＵＰ、βｎ的ＦｅｗＰ的相对完全集讨论它们的相对同构问题。并得到如下结果：１（１）对任何≤ｍ＾Ｐ，Ｂｎ－βｎ＾Ｂｎ完全集Ｃ，Ｃ≈Ｐ＾ＢｎＡｎ←→Ｃ为Ｐ＾Ｂｎ柱。（２）对任何≤ｍ＾Ｐ，Ｂ－ＦｅｗＰ＾Ｂ完全集Ｃ，Ｃ≈Ｐ＾Ｂ∪Ａｎ←→Ｃ为Ｐ＾Ｂ柱，其中Ｂ＝ＳＡＴ－∪Ａｎ。 ｎ∈Ｎ ｎ∈Ｎ     

一类不确定对象的扩张状态观测器

利用观测器形式的跟踪一微分器,对形如ｘ＾（ｎ）＝ｆ（ｘ,ｘ,．．．Ｘ＾（ｎ－１）,ｔ）＋Ｗ（ｔ）的不确定系统给出了“扩张状态观测器”。只要适当选取观测器中的非线性函数和相应参数,它能很好地跟踪一批不确定对象的扩张状态。     

金额大写转换程序设计的改进

１转换算法 为实施转换方便，把需转换的阿拉伯数金额ｘ转化为带两位小数的字符串ｎｃ（共ｔ个字符，含小数点），然后应用取子串函数（ｓｕｈｓｔ（ｎｃ，ｉ，１）（ｉ＝１，２…，ｔ，但除去ｔ—２）从左至右对ｎｃ的每一个数字字符实施转换，转换分为两个步骤：１．１数字转换为大写汉字 设 ｃ１＝“零壹贰叁肆伍陆染捌玖”，数字 ｙ（ ０— ９）通过 ｓｕｂｓｔ（ｃ１，２*ｙ十１，２）即转换为对应的大写汉字。 例如，ｙ＝３时，ｓｕｂｓｔ（ｃ１，２*。３＋１，２）为“叁”，即３转换为“叁”１.２依据数字所在位置转化单位汉字 设ｃ…     

在I-DEAS软件上开发的两个实用程序

一．倒角标注 Ｉ－ＤＥＡＳ的倒角标注方式,不符合国标,以下程序可以实现国标标注： ＃ｄｅｌｅｔｅ ａｌｌ ＃ｇｅｔ ｄｉｇｔｉｚｅ （ｘｌ,ｙｌ,ｓｔｌ） ＃ｉｆ （ｓｔｌ ｎｅ ０） ｔｈｅｎ ｇｏｔｏｔｈｅｅｎｄ ＃ｇｅｔ ｄｉｇｔｉｚｅ （ｘ２,ｙ２,ｓｔ２） ＃ｉｆ（ｓｔ２ ｎｅ ０） ｔｈｅｎ ｇｏｔｏｔｈｅｅｎｄ ＃ａｌｐｈ＝ａｔａｎ（（ｙ２－ｙ１）／（ｘ２－Ｘ１）） ＃ａ＝Ｉｎｔｔｏｓｔｒ（ＴＲＵＮ（ａｂｓ（ａｌｐｈ））） ＃１＝ａｂｓ（ｘ２－ｘ１） ＃ｉｆ（１ｎｅ ＴＲＵＮＣ（１）） ｔｈｅｎｓｅｔ ｐｒ…     

掺锶锰酸镧—二氧化锆氧气传感器的制备及其性能测试

利用喷雾热解所制务的Ｌａ０．８Ｓｒ０．２ＭｎＯ３超微粉末制作电极材料，用８ＹＳＺ超微粉制作固体电解质，制成了氧传感器，以Ｎ２－Ｏ２混合气体为待测气体，以空气为参比气体在不同的温度及氧分压下测量了该氧传感器浓差电势的大小。实验结果表明该氧传感器的输出电势与温度和氧分压的关系符合Ｎｅｒｎｓｔ方程并对氧分压的微量变化反应灵敏。回归得到的该氧传感器的实际刻度方程为：Ｅｍ（ｍＶ）＝０．０２４６Ｔ＋０．０４９     

玉米弯孢菌叶斑病产量损失估计模型的研制

采用不同菌源梯度人工接种的方法,在田间造成玉米弯孢菌叶斑病流行动态不同的１８个发病小区,分析各期病情指数与产量构成因子之间的相关性,结果表明：玉米弯孢菌叶斑病对玉米面粒重、单穗重和产量都有显著影响,产量损失率与病情指数呈正相关,产量损失率最高可达３８．２４％,而病情指数对穗数没有直接影响。利用电子计算机ＳＰＳＳ统计分析软件构建了两个玉米弯孢菌叶斑病产量损失估计模型：（１）关键期病情模型（ＣＰＭ）,Ｌ＝２．８２１９＋０．７４０２ｘ１（Ｒ＝０．８７９９,ＳＤ＝５．２１４９,Ｎ＝１８）。（２）多期病情模型（ＭＰＭ）：Ｌ＝１．０７３＋０．４２６ｘ１＋０．１７０ｘ２（Ｒ＝０．８９２,ＳＤ＝５．２８９８,Ｎ＝１８）。式中：Ｌ为玉米产量损失率;ｘ１为授粉期病情指数;ｘ２为灌浆后期病情指数。     

集成偏好的高维多目标最优软件产品选择算法

在基于搜索的软件工程研究领域,高维多目标最优软件产品选择问题是当前的一个研究热点.既往工作主要采用后验方式（即先搜索再选择）处理软件工程师或终端用户的偏好.与此不同,将用户偏好集成于优化过程,提出了一种新算法以定向搜索用户最感兴趣的软件产品.在算法中,运用权向量表达用户偏好,采用成就标量化函数（achievement scalarizing function,简称ASF）集成各个优化目标,并定义一种新关系比较个体之间的优劣.为了增强算法快速搜索到有效解的能力,分别采用DPLL/CDCL类型和随机局部搜索（SLS）类型可满足性（SAT）求解器实现了替换算子和修复算子.为了验证新算法的有效性,采用21个广泛使用的特征模型进行仿真实验,其中最大特征数为62482,最大约束数为343 944.实验结果表明,基于DPLL/CDCL类型SAT求解器的替换算子有助于算法返回有效软件产品;基于SLS类型SAT求解器的修复算子有助于快速搜索到尽可能满足用户偏好的最终产品.在处理带偏好的高维多目标最优软件产品选择问题时,综合运用两类SAT求解器是一种行之有效的方法.     

Towards improved parallelism through order reduction of accessing data in nD matrices

This paper encompasses the presentation of an enhanced approach with the capacity to reduce the time complexity of accessing nodes in m-dimensional matrices from \(O(n^m)\) to \(O(n\log n)\) . The accomplishment of this process is attained by the serialization of nD (nD) matrices to single-dimensional arrays followed by the access of nodes accordingly. Linear representation of nD matrix data structure induces a superior parallelism of matrix calculations over dense, parallel core micro-architecture computers, including NVIDIA GPGPU Supercomputing and Intel Xeon Phi processing boards. This approach is feasibly implemented as the core of matrix data representation in Math software such as Matlab, Mathematica and Maple, in IDEs for more optimized code generation and in Parallel Computing Libraries such as CUBLAS and Magma.     

Complete problems for space bounded subclasses of NP

Summary Several problems are shown to be log space complete, when restricted to bandwidth f(n), for the subclass of NP defined by nondeterministic polynomial time bounded Turing machines with a simultaneous f(n) space restriction, denoted by NTISP(poly, f(n)). These problems are NOT-ALL-EQUAL 3SAT, MONOCHROMATIC TRIANGLE, CUBIC SUBGRAPH, DOMINATING SET, ONE-IN-THREE 3SAT and MONOTONE 3SAT. The problems DOMATIC NUMBER, PARTITION INTO FORESTS and DISJOINT CONNECTING PATHS restricted to bandwidth f(n) are shown to be log space hard for NTISP(poly, f(n)). Their membership in the class NTISP(poly, f(n)) is currently open. As one application of these results, we note that the first six of the problems mentioned are examples of NSPACE(log n) complete problems when restricted to bandwidth log n.All of the authors were partially supported by NSF grants MCS 79-08919 and MCS 81-09280     

On k-Positive Satisfiability Problem

1IntroductionThesatisfiabilityproblem(SAT)isthedecisionproblemwhetheragivenpropositionalformulainconjunctivenormalform(CNF)couldbesatisfiedbyanyassignmenttotheatoms.ItiswellknownthatSATisNP-complete[1].SounderthehypothesisthatP/NP,thereisnopolynomialtimealgorithmforsolvingSAT121.Letk-SATbethesubproblemrestrictingtheclausesnotlongerthank.Thenk-SATisNP-completefork23['],andislineartimesolvablefork<213'4].Thefirstnontrivialupperboundontimecomplexityofk--SAT(k23)wasgivenin[5].Thereaki…     

“LIGA2.X” process for mass production of single polymeric LIGA micro parts

The new modification of the LIGA process “LIGA2.X” is a promising process chain to replicate high accuracy single polymeric LIGA micro parts in large scale to feasible costs. The advantages of this new approach compared to the standard LIGA process are the reduction of fabrication costs, the elimination of any rework after replication, industry suitable mold technology for injection molding using a new developed demolding concept, optimized injection molding parameters for every single cavity, shot volumes of the parts below 0.5 mm³ and a new freedom in the arrangement of structure cavities in multicavity molds. Aspects covered in this paper are the introduction of the complete process chain of the new “LIGA2.X” process and the used mold concept for the micro-män 50 micro injection molding machine. Furthermore replicated single polymeric LIGA microparts fabricated using the new process chain are shown. To conclude, potential process improvements and future work will be outlined.     

求解SAT问题的线性半定规划算法

将线性半定规划应用到SAT问题的求解过程中。首先将SAT实例转化为整数规划问题,然后松弛为线性规划模型,最后再转化为一般的线性半定规划模型去求解。用SDPA-M软件求解线性半定规划问题后,规定了如何根据目标函数值去判定SAT实例和当CNF公式可满足时如何根据最优指派的概率X^＊i（i=1,…,n）去进行变元赋值,以期求得该公式的可满足指派。上述算法不仅可以判定SAT问题,而且对于符合算法规定可满足的CNF公式皆可给出一个可满足指派。求解SAT问题的线性半定规划算法在文章中被描述并被给予相应算例。     

随机k-SAT问题的回溯算法分析

通过研究搜索树的平均节点数,分析了回虎法求解随机ｋ－ＳＡＴ问题的平均复杂性,结果表明：找到实例所有的解或证明其无解所需的平均节九随变量数ｎ的增加而指数增长;随着ｒ的增大,求解将变得越来越容易,而且当ｒ趋近于无穷大时,以ｎ为指数。平均节点数的底数将无限地趋势于１。     

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems

Given a 2-edge-connected, real weighted graph G with n vertices and m edges, the 2-edge-connectivity augmentation problem is that of finding a minimum weight set of edges of G to be added to a spanning subgraph H of G to make it 2-edge-connected. While the general problem is NP-hard and 2 -approximable, in this paper we prove that it becomes polynomial time solvable if H is a depth-first search tree of G . More precisely, we provide an efficient algorithm for solving this special case which runs in O(M · α(M,n)) time, where α is the classic inverse of Ackermann's function and M=m · α(m,n) . This algorithm has two main consequences: first, it provides a faster 2 -approximation algorithm for the general 2 -edge-connectivity augmentation problem; second, it solves in O(m · α(m,n)) time the problem of restoring, by means of a minimum weight set of replacement edges, the 2 -edge-connectivity of a 2-edge-connected communication network undergoing a link failure.     

Some structural properties of SAT

The following four conjectures about structural of SAT are studied in this paper.(1) SAT∈P^SPARSE∩NP;(2)SAT∈SRTDtt;(3)SAT∈Ptt^bAPP;(4)FPtt^SAT=FTlog^SAT.It is proved that some pairs of these conjectures imply P=NP ,for example,if SAT∈P^SPARSE∩NP and SAT∈Ptt^bAPP,or if SAT∈SRTDtt and SAT∩PttbAPP,then P=NP.This improves previous results in literature.     

Time-slot assignment for TDMA-systems

In satellite communication as in other technical systems using the TDMA-technique (time division multiple access) the problem arises to decompose a given (n×n)-matrix in a weighted sum of permutation matrices such that the sum of the weights becomes minimal. We show at first that an optimal solution of this problem can be obtained inO(n ⁴)-time using at mostO(n ²) different permutation matrices. Thereafter we discuss shortly the decomposition inO(n) different matrices which turns out to be NP-hard. Moreover it is shown that an optimal decomposition using a class of 2n permutation matrices which are fixed in advance can be obtained by solving a classical assignment problem. This latter problem can be generalized by taking arbitrary Boolean matrices. The corresponding decomposition problem can be transformed to a special max flow min cost network flow problem, and is thus soluble by a genuinely polynomial algorithm.