查询词典 complexity of things

You will understand what I mean by COMPLEXITYby noting these three aspects. Firstly, it refers tothe complexity in form. When CAD becameinvolved in the design process Architect's wereenabled with a higher level of control over evermore complex geometry. Consequently it canand will generate infinite possibilities in the futurefor form finding, which has shifted in emphasis asa more logical design process based onsystematic theories away from intuitive designtechniques. Secondly, it illustrates our growingsocial complexity. As technologies allow peopleto send and receive more information than before,in ever shorter time frames, the function ofarchitecture and urban space will increasinglybecoming ambiguous. Emergent, adaptive andtransformable spaces are replacing limitedfunction spaces gradually. Even a single spacewould afford more potential functions. Lastly, Iam referring to the complexity of collective design team organizations working on different projects.The fact is that our social work division is moreintricate and variegated today; Architects mustby necessity negotiate with governmentalauthorities, material suppliers, engineeringconsultants, quantity surveyor, contractors,planning authorities, landscape architects, interiordesigners, acoustical engineers, et cetera besidesjust our clients. Meanwhile, projects and designteams tend now to be a globally dispersednetwork. All of these things are challenging theconventional architectural practice, it'sorganization, and administration significantly.

Complex可以从3个层面上理解：首先是指设计形式上的复杂性，即引入计算机数字化技术后，建筑师可以设计和控制更高级、更复杂的几何形体，而不是简单地发挥计算机复制、粘贴的画图优势，让计算机真正参与到设计过程中，带来更多设计形式上的可能性（需要指出的是，这种形式上的演进已经从开始的直觉行为转成由系统理论指导的理性应用）；第二，是指与社会学相关的复杂性，科技让人们更多更快地接受和传递信息，建筑和城市空间的功能性变得越来越模糊，无法预知，随时间调整自身、不断变化的空间正在不自觉地逐步取代原有功能确定的传统空间，或者说一个空间要承受比以前晰释复杂性ARTICULATING COMPLEXITY多得多的功能要求；最后，是指在一个建筑方案内团队组织的复杂性，社会分工越来越详尽，建筑师要面对的除了甲方和使用者，还有政府权力部门、材料供应商、工程技术部门、合同签约顾问、城市规划部门、景观设计师、室内设计师、音响设计师等等相关的合作单位，同时，在项目和设计职员的地域分布上更趋向全球化，这些都带给建筑事务所内部管理和组织上前所未有的复杂性。

Based on the two normal forms, the decidability theorem in L is then proved and a deduction-based decision algorithm P is designed. The time complexity O(n3) of P is much less than the complexity O(2n) of the true value table method and the complexity O(n5) of HAL based on the tactic scheme.

首先定义了消解复杂性的两种范式：最简范式和文字范式，在此基础上采用演绎方法证明了L中的可判定性定理，并设计了命题公式的演绎判定算法P。P的时间复杂度为O(n^3)，远远小于基于真值表法的O(2^n)和基于策略方案HAL的O(n^5)。

This dissertation investigates the construction of pseudo-random sequences (pseudo-random numbers) from elliptic curves and mainly analyzes their cryptographic properties by using exponential sums over rational points along elliptic curves. The main results are as follows:(1) The uniform distribution of the elliptic curve linear congruential generator is discussed and the lower bound of its nonlinear complexity is given.(2) Two large families of binary sequences are constructed from elliptic curves. The well distribution measure and the correlation measure of order k of the resulting sequences are studied. The results indicate that they are "good" binary sequences which give a positive answer to a conjecture proposed by Goubin et al.(3) A kind of binary sequences from an elliptic curve and its twisted curves over a prime field F_p. The length of the sequences is 4p. The "1" and "0" occur almost the same times. The linear complexity is at least one-fourth the period.(4) The exponential sums over rational points along elliptic curves over ring Z_ are estimated and are used to estimate the well distribution measure and the correlation measure of order k of a family of binary sequences from elliptic curves over ring Z_.(5) The correlation of the elliptic curve power number generator is given. It is proved that the sequences produced by the elliptic curve quadratic generator are asymptotically uniformly distributed.(6) The uniform distribution of the elliptic curve subset sum generator is considered.(7) We apply the linear feedback shift register over elliptic curves to produce sequences with long periods. The distribution and the linear complexity of the resulting sequences are also considered.

本文研究利用椭圆曲线构造的伪随机序列，主要利用有限域上椭圆曲线有理点群的指数和估计讨论椭圆曲线序列的密码性质——分布、相关性、线性复杂度等，得到如下主要结果：(1)系统讨论椭圆曲线-线性同余序列的一致分布性质，即该类序列是渐近一致分布的，并给出了它的非线性复杂度下界；(2)讨论两类由椭圆曲线构造的二元序列的"良性"分布与高阶相关性(correlation of order κ)，这两类序列具有"优"的密码性质，也正面回答了Goubin等提出的公开问题；(3)利用椭圆曲线及其挠曲线构造一类二元序列，其周期为4p(其中椭圆曲线定义在有限域F_p上)，0-1分布基本平衡，线性复杂度至少为周期的四分之一；(4)讨论了剩余类环Z_上的椭圆曲线的有理点的分布估计，并用于分析一类由剩余类环Z_上椭圆曲线构造的二元序列的伪随机性；(5)讨论椭圆曲线-幂生成器序列的相关性及椭圆曲线-二次生成器序列的一致分布；(6)讨论椭圆曲线-子集和序列的一致分布；(7)讨论椭圆曲线上的线性反馈移位寄存器序列的分布，线性复杂度等性质。

Morin did not give a definition of the complexity, but he pointed seven methods to get to the complexity. He answered the question that what is the complexity by this manner.

莫兰没有对复杂加以定义，而是给出了七种复杂化的途径，借此他回答了什么是复杂的问题。

The estimation problem of the fuzzy nonlinear complexity of the random vector is studied, and some upper bounds are given. The limit properties of fuzzy nonlinear complexity of random vector are studied, and the limit theorem and the upper bound of variance limit of the fuzzy nonlinear complexity of random vector are given.(3) Enumeration of lst-order correlation-immune functions is discussed further.

首次提出了模糊非线性复杂度的概念，对随机向量的模糊非线性复杂度的均值进行了估计，给出了若干上界估计公式，并研究了随机向量模糊非线性复杂度的极限性质，给出了随机向量模糊非线性复杂度的极限定理及其方差极限的上界。

The ARIMA model has been applied to evaluate and predict the time series of macroscopic traffic volume.Complexity and prediction errors of 5 actual time series have been calculated.Based on the comparison of the calculated results,it is assumed that complexity is negatively correlated with predictability in macroscopic transportation system. complexity,prediction,transportation,Lempel-Ziv algorithm

针对这个问题，本文对宏观交通运输系统进行复杂性测度和时间序列模型估计，进而研究系统复杂度和可预测性之间的关系。1宏观交通运输系统的复杂性测度从上世纪末开始，关于交通运输系统非线性关系判据的研究方兴未艾，而对于如何实现交通运输系统可比化的复

The SPLT is shown to explain a wide range of processing complexity phenomena not previously accounted for under a single theory, including (1) the lower complexity of subject-extracted relative clauses compared to object-extracted relative clauses,(2) numerous processing overload effects across languages, including the unacceptability of multiply center-embedded structures,(3) the lower complexity of cross-serial dependencies relative to center-embedded dependencies,(4) heaviness effects, such that sentences are easier to understand when larger phrases are placed later and (5) numerous ambiguity effects, such as those which have been argued to be evidence for the Active Filler Hypothesis.

SPLT可解释范围宽广的，非先前在一个单一理论下可说明的处理复杂性现象，包括（1）与受词抽离关系子句相较，主词抽离关系子句的低复杂度，（2）为数众多的跨语言间的处理超载效果，包括多层中心嵌入架构的不可接受性，（3）相对於中心嵌入依赖性，跨序列依赖性的低复杂度，（4）当较大的片语放在后面时，使句子较易理解之沈重效果，以及（5）许多的模糊效果，例如那些被争论为主动充填理论之证据者。

This dissertation investigates the construction of pseudo-random sequences (pseudo-random numbers) from elliptic curves and mainly analyzes their cryptographic properties by using exponential sums over rational points along elliptic curves. The main results are as follows:(1) The uniform distribution of the elliptic curve linear congruential generator is discussed and the lower bound of its nonlinear complexity is given.(2) Two large families of binary sequences are constructed from elliptic curves. The well distribution measure and the correlation measure of order k of the resulting sequences are studied. The results indicate that they are "good" binary sequences which give a positive answer to a conjecture proposed by Goubin et al.(3) A kind of binary sequences from an elliptic curve and its twisted curves over a prime field F_p. The length of the sequences is 4p. The "1" and "0" occur almost the same times. The linear complexity is at least one-fourth the period.(4) The exponential sums over rational points along elliptic curves over ring Z_ are estimated and are used to estimate the well distribution measure and the correlation measure of order k of a family of binary sequences from elliptic curves over ring Z_.(5) The correlation of the elliptic curve power number generator is given. It is proved that the sequences produced by the elliptic curve quadratic generator are asymptotically uniformly distributed.(6) The uniform distribution of the elliptic curve subset sum generator is considered.(7) We apply the linear feedback shift register over elliptic curves to produce sequences with long periods. The distribution and the linear complexity of the resulting sequences are also considered.

本文研究利用椭圆曲线构造的伪随机序列，主要利用有限域上椭圆曲线有理点群的指数和估计讨论椭圆曲线序列的密码性质——分布、相关性、线性复杂度等，得到如下主要结果：(1)系统讨论椭圆曲线-线性同余序列的一致分布性质，即该类序列是渐近一致分布的，并给出了它的非线性复杂度下界；(2)讨论两类由椭圆曲线构造的二元序列的&良性&分布与高阶相关性(correlation of order κ)，这两类序列具有&优&的密码性质，也正面回答了Goubin等提出的公开问题；(3)利用椭圆曲线及其挠曲线构造一类二元序列，其周期为4p(其中椭圆曲线定义在有限域F_p上)，0-1分布基本平衡，线性复杂度至少为周期的四分之一；(4)讨论了剩余类环Z_上的椭圆曲线的有理点的分布估计，并用于分析一类由剩余类环Z_上椭圆曲线构造的二元序列的伪随机性；(5)讨论椭圆曲线-幂生成器序列的相关性及椭圆曲线-二次生成器序列的一致分布；(6)讨论椭圆曲线-子集和序列的一致分布；(7)讨论椭圆曲线上的线性反馈移位寄存器序列的分布，线性复杂度等性质。

On the basis of a civil aviation calamity,which is a complex system, its complexity is probed with the help of the complexity theory's tools (such as chaos, fractal, ANN and so on) and the method of early-warning management , and a primary theoretic frame of complexity research of the civil aviation cala.

提出将民航灾害看作一个复杂系统，借助分形理论、混沌理论、人工神经网络等复杂性科学的工具，并结合预警管理方法，对民航灾害的复杂性进行探索，初步构造了民航灾害复杂性研究的理论框架。

An entropy-based complexity metrics is presented, and the complexity of entities, dependency relationships and business models can be calculated recursively by calculating the complexity of BMUs.

提出一种基于熵的复杂性度量方法，通过计算基本模型单元的复杂度递归得到实体、依赖关系及模型的复杂性。

More direct, directer ; most direct, directest

径直的，笔直的

Do you know how to use a chain saw?

你知道如何使用链锯吗？