共查询到20条相似文献，搜索用时 15 毫秒
1.
L.O. Chua 《Journal of The Franklin Institute》1973,296(2):91-113
This paper presents a novel graph theoretic approach for deriving various stationary principles for single-element type nonlinear networks. The concepts of total content, co-content and hybrid content are generalized to that of total parametric content for resistive nonlinear networks containing multivalued elements. The results by Brayton and Moser on potential functions for complete m-ports are generalized to non-complete m-ports in terms of three pseudopotential functions; namely, the pseudo-content, pseudo- co-content and the pseudo-hybrid content. The precise criterion for which each of these pseudo-potential functions reduces to a legitimate potential function is shown to be the unique solvability of an implicit set of equations given explicitly in terms of standard topological matrices. Simple circuit theoretic sufficient conditions are given which require merely the positive-definiteness of the incremental resistance matrix of an auxiliary complete current-controlled p-port and the incremental conductance matrix of an auxiliary complete voltage-controlled q-port. These conditions also guarantee that a non-complete dynamic nonlinear network can be represented by a system of normal form differential equations in terms of a single mixed potential function. 相似文献
2.
Dean Karnopp 《Journal of The Franklin Institute》1980,310(6):303-316
Lumped parameter, undamped vibratory system models are studied starting from a vector bond graph representation which yields a symmetric set of equations of motion in terms of momenta and displacements. Four additional formulations are obtained depending upon the choices of displacement or impulse-momentum degrees of freedom including the classical formulation in terms of mass displacements. Differences in terms of forcing and response variables are found among the alternative formulations and differences in system order are explained. A new form of normal mode equations is developed using first order symmetric variables and a bond graph representation is given. Advantages in the use of the new model analysis for subsystem coupling are discussed. 相似文献
3.
This paper examines the factors affecting the performance of global query expansion based on term co-occurrence data and suggests a way to maximize the retrieval effectiveness. Major parameters to be optimized through experiments are term similarity measure and the weighting scheme of additional terms. The evaluation of four similarity measures tested in query expansion reveal that mutual information and Yule's Y, which emphasize low frequency terms, achieve better performance than cosine and Jaccard coefficients that have the reverse tendency. In the evaluation of three weighting schemes, similarity weight performs well only with short queries, whereas fixed weights of approximately 0.5 and similarity rank weights were effective with queries of any length. Furthermore, the optimal similarity rank weight achieving the best overall performance seems to be the least affected by test collections and the number of additional terms. For the efficiency of retrieval, the number of additional terms needs not exceed 70 in our test collections, but the optimal number may vary according to the characteristics of the similarity measure employed. 相似文献
4.
A network thermodynamic method is presented which utilizes SPICE2, a computer program for simulating nonlinear electrical circuits, to model and simulate a number of nonlinear, dynamic physiological systems. Ordinary circuit diagrams are presented along with bond graph representations to facilitate translation into the simulation language. Examples discussed are a compartmental model of sodium flow in frog skin, coupled salt and volume flow in kidney proximal tubule and a cancer chemotherapeutic agent's permeation and metabolism in a cancer cell. 相似文献
5.
Wai-kai Chen 《Journal of The Franklin Institute》1979,308(2):125-139
Topological formulas for the evaluation of the elements of the return difference and the null return difference matrices of a multiple-loop feedback amplifier are presented. They are expressed in terms of the directed-tree and directed-two-tree admittance products in the associated digraph. In the situation where the controlling parameters of all the controlled sources are chosen as the elements of interest, the associated digraph is simply the graph representing the feedback amplifier after the independent source and controlled sources have been removed. The significance of the present approach is that it not only provides a short-cut for the evaluation of the feedback matrices, but also gives an insight into the behavior of the feedback amplifier under consideration. 相似文献
6.
We introduce a new modified Mason-Coates graph (denoted by RMC-graph) specifically for discrete-time network analysis. The previously developed Mason-Coates graph (MC-graph), used for continuous-time networks, is summarized to simplify our presentation. The concise RMC-graph interpretation of a given digital network example is included. 相似文献
7.
A unified variational approach to network analysis is presented. From an initial classification of variables, expressed in topological terms, Lagrangian energy functions are generated which may be used in Hamilton's principles. This topological formalism allows extension into nonconservative networks and enables the complete retention of classical formalism in all networks.By using a topological version of the Brayton-Moser mixed potential function, several power variational principles are developed. These principles lead to comparison of the roles played by classical energy and power state functions in analytical mechanics. 相似文献
8.
In this paper, an interventional bipartite consensus problem is considered for a high-order multi-agent system with unknown disturbance dynamics. The interactions among the agents are cooperative and competitive simultaneously and thus the interaction network (just called coopetition network in sequel for simplicity) is conveniently modeled by a signed graph. When the coopetition network is structurally balanced, all the agents are split into two competitive subgroups. An exogenous system (called leader for simplicity) is introduced to intervene the two competitive subgroups such that they can reach a bipartite consensus. The unknown disturbance dynamics are assumed to have linear parametric models. With the help of the notation of a disagreement state variable, decentralized adaptive laws are proposed to estimate the unknown disturbances and a dynamic output-feedback consensus control is designed for each agent in a fully distributed fashion, respectively. The controller design guarantees that the state matrix of the closed-loop system can be an arbitrary predefined Hurwitz matrix. Under the assumption that the coopetition network is structurally balanced and the leader is a root of the spanning tree in an augmented graph, the bipartite consensus and the parameter estimation are analyzed by invoking a common Lyapunov function method when the coopetition network is time-varying according to a piecewise constant switching signal. Finally, simulation results are given to demonstrate the effectiveness of the proposed control strategy. 相似文献
9.
《Journal of The Franklin Institute》2022,359(16):9401-9421
This paper develops a distributed reconstruction algorithm, that can be implemented efficiently, for time-varying graph signals. The reconstruction problem is formulated as an unconstrained optimization problem that minimizes the weighted sum of the data fidelity term and the regularization term. The regularizer used is the nonsmoothness measure of the temporal difference signal. The classical Newton’s method can be used to solve the optimization problem. However, computation of the Hessian matrix inverse is required, and this does not scale well with the graph size. Furthermore, a distributed implementation is not possible. An approximation to the inverse Hessian, that exploits the graph topology, is developed here. The resulting iterative algorithm can be implemented in a distributed manner, and scales well with the graph size. Convergence analysis of the algorithm is presented, which shows convergence to the global optimum. Numerical results, using both synthetic and real world datasets, will demonstrate the superiority of the proposed reconstruction algorithm over existing methods. 相似文献
10.
Jacek Wojciechowski 《Journal of The Franklin Institute》1984,318(4):215-231
The method of tree generation of a graph decomposed into any number of parts is described in this paper. The decomposition of a graph is defined. The formula for the generation of trees of a decomposed graph is given in Theorem I. The necessary and sufficient conditions which a graph decomposition must satisfy to avoid duplications in the generated set of trees are discussed and results are summarized in Theorems II and III. A criterion for existence of such a decomposition is formulated in Theorem IV and also an appropriate algorithm for the graph decomposition is suggested. 相似文献
11.
《Information processing & management》2016,52(2):217-257
Transductive classification is a useful way to classify texts when labeled training examples are insufficient. Several algorithms to perform transductive classification considering text collections represented in a vector space model have been proposed. However, the use of these algorithms is unfeasible in practical applications due to the independence assumption among instances or terms and the drawbacks of these algorithms. Network-based algorithms come up to avoid the drawbacks of the algorithms based on vector space model and to improve transductive classification. Networks are mostly used for label propagation, in which some labeled objects propagate their labels to other objects through the network connections. Bipartite networks are useful to represent text collections as networks and perform label propagation. The generation of this type of network avoids requirements such as collections with hyperlinks or citations, computation of similarities among all texts in the collection, as well as the setup of a number of parameters. In a bipartite heterogeneous network, objects correspond to documents and terms, and the connections are given by the occurrences of terms in documents. The label propagation is performed from documents to terms and then from terms to documents iteratively. Nevertheless, instead of using terms just as means of label propagation, in this article we propose the use of the bipartite network structure to define the relevance scores of terms for classes through an optimization process and then propagate these relevance scores to define labels for unlabeled documents. The new document labels are used to redefine the relevance scores of terms which consequently redefine the labels of unlabeled documents in an iterative process. We demonstrated that the proposed approach surpasses the algorithms for transductive classification based on vector space model or networks. Moreover, we demonstrated that the proposed algorithm effectively makes use of unlabeled documents to improve classification and it is faster than other transductive algorithms. 相似文献
12.
裂隙化岩体广泛存在于地表浅层,为主要的地下水渗透介质之一,而裂隙网络构成地下水及溶质在裂隙化岩体中运移的主要甚至唯一导水通道.根据图论知识将裂隙网络概化为非连通图,采用图这种数据结构表示三维裂隙网络数据.编写了计算机程序识别裂隙化岩体中沿水力梯度方向的渗流路径,剔除对渗流无贡献的裂隙,可明显缩短裂隙网络地下水渗流与溶质运移数值模拟计算时间,使大尺度裂隙网络渗流与溶质运移模拟研究与工程应用的可行性显著提高. 相似文献
13.
This paper deals with the problem of finding graphs (directed and undirected) maximizing the number of spanning trees among the regular graphs with the same number of nodes and edges. The approach is based on heuristic algorithms such as k-optimal and evolutionary. The emphasis is rather on checking whether these techniques are applicable to solving extremal graph problems than investigating generic structures of optimal graphs. For this reason circulant graphs, for which computationally effective tree counting formulas exist, are discussed first and then the results extended to cover the class of regular graphs. 相似文献
14.
In the KL divergence framework, the extended language modeling approach has a critical problem of estimating a query model, which is the probabilistic model that encodes the user’s information need. For query expansion in initial retrieval, the translation model had been proposed to involve term co-occurrence statistics. However, the translation model was difficult to apply, because the term co-occurrence statistics must be constructed in the offline time. Especially in a large collection, constructing such a large matrix of term co-occurrences statistics prohibitively increases time and space complexity. In addition, reliable retrieval performance cannot be guaranteed because the translation model may comprise noisy non-topical terms in documents. To resolve these problems, this paper investigates an effective method to construct co-occurrence statistics and eliminate noisy terms by employing a parsimonious translation model. The parsimonious translation model is a compact version of a translation model that can reduce the number of terms containing non-zero probabilities by eliminating non-topical terms in documents. Through experimentation on seven different test collections, we show that the query model estimated from the parsimonious translation model significantly outperforms not only the baseline language modeling, but also the non-parsimonious models. 相似文献
15.
Pen-min Lin 《Journal of The Franklin Institute》1982,314(4):203-210
A two-person game related to the connectivity among all vertices of a graph is defined. Necessary and sufficient conditions for the short, cut and neutral games are given in terms of the principal partition of a graph. Winning strategies are described. 相似文献
16.
This paper tackles the problem of how one might select further search terms, using relevance feedback, given the search terms in the query. These search terms are extracted from a maximum spanning tree connecting all the terms in the index term vocabulary. A number of different spanning trees are generated from a variety of association measures. The retrieval effectiveness for the different spanning trees is shown to be approximately the same. Effectiveness is measured in terms of precision and recall, and the retrieval tests are done on three different test collections. 相似文献
17.
In a multi-agent framework, distributed optimization problems are generally described as the minimization of a global objective function, where each agent can get information only from a neighborhood defined by a network topology. To solve the problem, this work presents an information-constrained strategy based on population dynamics, where payoff functions and tasks are assigned to each node in a connected graph. We prove that the so-called distributed replicator equation (DRE) converges to an optimal global outcome by means of the local-information exchange subject to the topological constraints of the graph. To show the application of the proposed strategy, we implement the DRE to solve an economic dispatch problem with distributed generation. We also present some simulation results to illustrate the theoretic optimality and stability of the equilibrium points and the effects of typical network topologies on the convergence rate of the algorithm. 相似文献
18.
19.
《Information processing & management》1999,35(1):19-30
In this paper, we present a comparison of collocation-based similarity measures: Jaccard, Dice and Cosine similarity measures for the proper selection of additional search terms in query expansion. In addition, we consider two more similarity measures: average conditional probability (ACP) and normalized mutual information (NMI). ACP is the mean value of two conditional probabilities between a query term and an additional search term. NMI is a normalized value of the two terms' mutual information. All these similarity measures are the functions of any two terms' frequencies and the collocation frequency, but are different in the methods of measurement. The selected measure changes the order of additional search terms and their weights, hence has a strong influence on the retrieval performance. In our experiments of query expansion using these five similarity measures, the additional search terms of Jaccard, Dice and Cosine similarity measures include more frequent terms with lower similarity values than ACP or NMI. In overall assessments of query expansion, the Jaccard, Dice and Cosine similarity measures are better than ACP and NMI in terms of retrieval effectiveness, whereas, NMI and ACP are better in terms of execution efficiency. 相似文献
20.
数字音频编解码系统采用MDCT/IMDCT实现时间－频率域的互换,以消除音频分帧引起的时间域混叠效应。本文提出一种新的MDCT/IMDCT快速实现方案,基于N/8点FFT变换核,采用奇偶双路并行和蝶型单元技术,与现有快速算法相比,运算速度和吞吐能力均提高一倍,并且该方案既可以实现MDCT正变换,也可以实现相应的反变换。为了验证方案的正确性,在Altera FPGA开发板上完成了N=256点MDCT的实验,结果表明,该实现方案在运算速度和数据吞吐率等方面取得很大的改进。 相似文献