关于复模态参数的冗余性

生成仿真传递函数是考核模态识别算法和评估模态分析软件的不可缺少的环节．比较可行的3种计算方案表明:若选择将传递函数表示为复模态参数的展开式,则可以自由设定仿真模态的特性,如密频、大阻尼和复模态;然而,即使采用这种格式也不能随意设置一组复模态振型,因为这种格式的表观参数个数大于物理参数个数;故而,若对应的物理参数有意义,那么复模态参数必须满足一组约束关系．通过分析复模态系统的特征值问题,和复模态参数反演物理参数的方程式,给出了复模态参数间的一组非线性冗余约束．讨论了实模态、无阻尼和不完全模态等特殊情形的冗余约束具体形式与独立参数的个数,值得注意的是,对于实模态系统,冗余约束自动满足．给出冗余约束在传递函数矩阵和一列传递函数上的等价形式．这些结果有助于产生仿真传递函数,实施优化型识别算法,以及评估识别结果;还可用来评价残余模态和识别完整性．     

Explaining modal intuition

The paper defends causal explanationism concerning our modal intuitions and judgments, and, in particular, the following claims. If a causally explainable mirroring or “pre-established harmony” between our mind and modal reality obtains, we are justified in believing it does. We do not hold our modal beliefs compulsively and blindly but with full subjective and objective justification. Therefore, causal explanation of our modal beliefs does not undermine rational trust in them. Explanation and trust support each other. In contrast, anti-explanationists (from Kant, through neo-wittgensteinians to T. Nagel and J. Pust), claim that causal explanation of intuitions and judgments undermines rational trust in them. They especially target causal explanation in terms of pre-established harmony between our mind, shaped by causal processes, and the underlying modal structure of reality. The paper argues against them. The argument builds upon the claim that the appeal to modal facts is indispensable for systematization and explanation of non-modal ones. Therefore, we should assume that modal facts exist and are not disjoint and isolated from actual facts. The modal structure of the universe intervenes in the non-modal reality. Causal processes indirectly carry information about deep modal structure. Any (reasonable candidate) causal explanation of our intuitional modal beliefs should start from this indirect contact with and information about modal facts. Therefore, if our intuitional modal beliefs are true and causally explainable (by a factual, non-modal explanans), they are true in virtue of the deep underlying modal structure. They are sensitive to modal reality and track it. We can come to know this fact, and thus strengthen our spontaneous trust in our modal intuitions.     

On the problem of observation spillover in self-adjoint distributed-parameter systems

The problem of observation spillover in self-adjoint distributed-parameter systems is investigated. Observation spillover occurs when the output of a limited number of sensors, located at various points on the distributed domain, cannot synthesize the modal coordinates exactly. To this end, two techniques of state estimation (namely, observers and modal filters) are described. Both techniques can be used to extract modal coordinates from the system output and to implement feedback controls. It is shown that, if the residual modes are included in the observer dynamics, observation spillover cannot lead to instability in the residual modes. The problem of the unmodeled modes does remain, however. It is also shown that the modal filters have some very attractive features. In particular, modal filters can be designed to estimate the modal coordinates with such accuracy that observation spillover can be virtually eliminated. In addition, when modal filters are used, in conjunction with a sufficiently large number of sensors, the entire infinity of the system modes can be regarded as modeled, which implies that actual distributed control of the system is possible. It is also demonstrated that modal filters are quite easy to design and are not plagued by instability problems.     

Construction of universal modal worlds based on hyperset theory

Knowledge modal formulas are interpreted by a universal modal world in the hypersets universe [A]. This remedies the limitation of the interpretation of knowledge formulas by a tower of modal worlds in the well founded universe [F], where each world can interpret only a portion of knowledge modal formulas. Received: 21 August 1995     

Prefixed tableaus and nested sequents

Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants of each other, roughly in the same way that Gentzen sequent calculi and tableaus are notational variants. This immediately gives rise to new modal nested sequent systems which may be of independent interest. We discuss some of these, including those for some justification logics that include standard modal operators.     

Actualism and Modal Semantics

According to actualism, modal reality is constructed out of valuations (combinations of truth values for all propositions). According to possibilism, modal reality consists in a set of possible worlds, conceived as independent objects that assign truth values to propositions. According to possibilism, accounts of modal reality can intelligibly disagree with each other even if they agree on which valuations are contained in modal reality. According to actualism, these disagreements (possibilist disagreements) are completely unintelligible. An essentially actualist semantics for modal propositional logic specifies which sets of valuations are compatible with the meanings of the truth-functional connectives and modal operators without drawing on formal resources that would enable us to represent possibilist disagreements. The paper discusses the availability of an essentially actualist semantics for modal propositional logic. I argue that the standard Kripkean semantics is not essentially actualist and that other extant approaches also fail to provide a satisfactory essentially actualist semantics. I end by describing an essentialist actualist semantics for modal propositional logic.     

Interval modal superposition method for impulsive response of structures with uncertain-but-bounded external loads

This paper is concerned with the problem of the dynamic response of structures with uncertain-but-bounded external loads. Based on the theory of complex modal analysis, and interval mathematics, a new non-probabilistic method-interval modal superposition method is proposed to find the least favorable impulsive response and the most favorable impulsive response of structures. Through mathematical analysis and numerical calculation, comparisons between interval modal superposition method and probabilistic approach are made. Instead of probabilistic density distribution or statistical quantities, in the presented method, only the bounds on uncertain parameters are needed, Numerical examples indicate that the width of the region of the dynamic response yielded by the interval modal superposition method is larger than those produced by probabilistic approach while the interval modal superposition method will required less computation effort.     

Modal control of hybrid differential-difference systems and associated delay systems of neutral type in scales of differential-difference controllers

We study the statements and solvability of the modal control problem (the pole assignment problem) for linear time-invariant hybrid difference-differential systems in symmetric form and for the associated delay systems of neutral type. We obtain constructive necessary and sufficient parametric conditions for the modal controllability of the systems in question in various scales of difference-differential controllers. Methods for the construction of such controllers solving the corresponding modal controllability problem are indicated. The results are illustrated by examples and counterexamples.     

Frame definability in finitely valued modal logics

In this paper we study frame definability in finitely valued modal logics and establish two main results via suitable translations: (1) in finitely valued modal logics one cannot define more classes of frames than are already definable in classical modal logic (cf. [27, Thm. 8]), and (2) a large family of finitely valued modal logics define exactly the same classes of frames as classical modal logic (including modal logics based on finite Heyting and MV-algebras, or even BL-algebras). In this way one may observe, for example, that the celebrated Goldblatt–Thomason theorem applies immediately to these logics. In particular, we obtain the central result from [26] with a much simpler proof and answer one of the open questions left in that paper. Moreover, the proposed translations allow us to determine the computational complexity of a big class of finitely valued modal logics.     

The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions

The Gödel-McKinsey-Tarski embedding allows to view intuitionistic logic through the lenses of modal logic. In this work, an extension of the modal embedding to infinitary intuitionistic logic is introduced. First, a neighborhood semantics for a family of axiomatically presented infinitary modal logics is given and soundness and completeness are proved via the method of canonical models. The semantics is then exploited to obtain a labelled sequent calculus with good structural properties. Next, soundness and faithfulness of the embedding are established by transfinite induction on the height of derivations: the proof is obtained directly without resorting to non-constructive principles. Finally, the modal embedding is employed in order to relate classical, intuitionistic and modal derivability in infinitary logic extended with axioms.     

Modal Fictionalism, Possible Worlds, and Artificiality

Accounts of modality in terms of fictional possible worlds face an objection based on the idea that when modal claims are analysed in terms of fictions, the connection between analysans and analysandum seems artificial. Strong modal fictionalism, the theory according to which modal claims are analysed in terms of a fiction, has been defended by, among others, Seahwa Kim, who has recently claimed that the philosophical objection that the connection between modality and fictions is artificial can be met. I propose a new way of spelling out the intuition of artificiality and show that strong modal fictionalism should be rejected.     

Criteria for Modal Controllability of Completely Regular Differential-Algebraic Systems with Aftereffect

The problem of control of the coefficients of the characteristic quasipolynomial is studied for linear autonomous completely regular differential-algebraic systems with commensurate delays. Several criteria for modal controllability and weak modal controllability are obtained, schemes for synthesis of the corresponding controllers are proposed, and illustrative examples are given.     

粘性阻尼线性振动系统的复模态特征值问题的一种新的矩阵摄动分析解法

本文提出了对粘性阻尼线性振动系统的复模态二次广义特征值问题进行高效近似求解的一种新的矩阵摄动分析方法,即先将阻尼矩阵分解为比例阻尼部分和非比例阻尼部分之和,并求得系统的比例阻尼实模态特征解;然后以此为初始值,将阻尼矩阵的非比例部分作为对其比例部分的小量修改,利用摄动分析方法简捷地得到系统的复模态特征值问题的近似解.这一新方法适用于振系阻尼分布不十分偏离比例阻尼情况的问题,因此对大阻尼(非过阻尼)振动系统也有效.这是它优于以前提出的基于无阻尼实模态特征解的类似摄动分析方法的重要特点.文中建立了复模态特征值和特征向量的二阶摄动解式,并通过算例证实了其有效性.此外还讨论了利用比例阻尼假定估计阻尼系统固有振动的复特征值的可行性.     

输液管道流固耦合非线性动力稳定分析

将弱约束输流管道非定常流液固耦合运动按波-流-振动系统建模成由4个非线性微分方程组成的分析模型,按模态进行分解研究系统在多种耦合状态下具有的运动稳定特性.以悬臂梁管道为例分析了耦合系统奇点的属性,得到了前四阶模态运动的相图.结果说明,多种耦合条件下输流管道的稳定性变得更为复杂,各阶模态运动具有不同的稳定特性.     

Application of modal analysis in assessing attack vulnerability of complex networks

In this paper we propose an alternative way to study robustness and vulnerability of complex networks, applying a modal analysis. The modal weights of the network nodes are considered as a measure for their busyness, which is further used for preferential removal of nodes and attack simulation. Analyses of the attack vulnerability are carried out for several generic graphs, generated according to ER and BA algorithms, as well as for some examples of manmade networks. It was found that a modal weight based attack causes significant disintegration of manmade networks by removing a small fraction of the busiest nodes, comparable to the one based on the node degree and betweenness centrality.     

Modal exact linearization of a class of second-order switched nonlinear systems

This paper considers the problem of stabilizing single-input affine switched nonlinear systems. The main idea is to transform a switched nonlinear system to an equivalent controllable switched linear system. First, we define the notion of modal state feedback linearization. Then, we develop a set of conditions for modal state feedback linearizability of a certain class of second order switched nonlinear systems. Considering two special structures, easily verifiable conditions are proposed for the existence of suitable state transformations for modal feedback linearization. The results are constructive. Finally, the method is illustrated with two examples, including a Continuous Stirred Tank Reactor (CSTR) to demonstrate the applicability of the proposed approach.     

有穷模态系统的基本系统

<正> 引论本文是继作者前文“具有有穷个模态外的模态系统”(以后省称“前文”)而作的,但同时又是自足的;为此,我们把模态数列的基本性质(见§1)以及求加强系统的方法(见§3)重述一遍,这样,读者可以不靠前文而完全很順利地阅读本文.除这两处以外,本文基本上又与前文沒有重复,这样,有好些需要详释或需与其它部门相联系的地方(例如,模     

二人谈判问题

本文避开了Nash谈判公理,根据实际情况建立了支付可转让和支付不可转让两类谈判问题模型,并通过引入谈判因子,给出了类似的谈判解.     

Barwise's Information Frames and Modal Logics

The article studies Barwise's information frames and settles the problem of Barwise dealing in finding axiomatizations for the modal logics generated by information frames. We find axiomatic systems for: (i) the modal logic of all complete information frames; (ii) the logic of all sound and complete information frames; (iii) the logic of all hereditary and complete information frames; (iv) the logic of all complete, sound, and hereditary information frames; (v) the logic of all consistent and complete information frames. The notion of weak modal logics is also proposed, and it is shown that the weak modal logics generated by all information frames and by all hereditary information frames are K and K4, respectively. Toward a general theory, we prove that any Kripke complete modal logic is a modal logic of a certain class of information frames, and that every modal logic generated by any given class of complete, rarefied, and fully classified information frames is Kripke complete.     

Modal Regression Based on Nonparametric Quantile Estimator

Modal regression based on nonparametric quantile estimator is given. Unlike the traditional mean and median regression, modal regression uses mode but not mean or median to represent the center of a conditional distribution, which helps the model to be more robust for outliers, asymmetric or heavy-taileddistribution. Most of solutions for modal regression are based on kernel estimation of density. This paper studies a new solution for modal regression by means of nonparametric quantile estimator. This method builds on the fact that the distribution function is the inverse of the quantile function, then the flexibility of nonparametric quantile estimator is utilized to improve the estimation of modal function. The simulations and application show that the new model outperforms the modal regression model via linear quantile function estimation.