排序方式: 共有125条查询结果,搜索用时 15 毫秒
1.
提出了一种以互联结构基础的远程控制监视系统,使工作人员能够在互联网的任何一个节点上对转台进行远程控制监视,完成调试与诊断任务。这套系统利用控制逻辑与控制表示逻辑分离的思想实现系统拓扑分布于互联网上的结构,并利用发送端自适应调整接收端驱动的流控管理方案,保证控制的实时性和对互联网通讯时延和阻塞的鲁棒性。 相似文献
2.
基于Lagrange原理,建立了一套新的悬索大挠度动力特性和动力响应分析的有限体积法列式,推导了结点力向量、质量矩阵和单元刚度矩阵的显式表达式。该列式的一个显著特点是直接利用工程应变定义结构变形,其物理意义明确,列式简单,适用于各种垂度和荷载情况的悬索大挠度动力分析。实例动力特性和随机风振响应分析表明,该有限体积列式不仅计算效率高,而且具有良好的计算精度。 相似文献
3.
随着光学陀螺等对重力加速度不敏感的陀螺器件的逐渐完善,一种源于静电陀螺的旋转调制技术备受关注,从而建立基于相对廉价的光学陀螺的高精度惯性导航系统成为可能.通过对单轴和双轴旋转调制技术原理和局限性的分析,提出了一种四陀螺双单轴旋转调制捷联惯导系统,并详细分析了旋转轴的不对准误差、惯性器件测量轴的不对准误差、常值漂移误差、... 相似文献
4.
5.
Let G =(V,E) be a graph without isolated vertices.A set S V is a domination set of G if every vertex in V -S is adjacent to a vertex in S,that is N[S] = V .The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A set S V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S]has a perfect matching.The paired-domination number,denoted by γpr(G),is defined to be the minimum cardinality of a paired-domination set S in G.A subset S V is a power domination set of G if all vertices of V can be observed recursively by the following rules:(i) all vertices in N[S] are observed initially,and(ii) if an observed vertex u has all neighbors observed except one neighbor v,then v is observed(by u).The power domination number,denoted by γp(G),is the minimum cardinality of a power domination set of G.In this paper,the constructive characterizations for trees with γp = γ and γpr = γp are provided respectively. 相似文献
6.
7.
8.
关于城市出租车规划的模型及应用 总被引:8,自引:0,他引:8
运用增长率法,建立指数增长的模型,结合规划期的人口规模,预测规划期的居民出行量和居民出行强度,以及乘坐出租车人口,随后利用出租车空载率为主要参数,建立数学模型并预测出租车的最佳数量.利用经济学分析方法,用埃奇沃思盒式图描述交易双方的福利变化,建立均衡时的价格竞争模型,寻求使司机和乘客达到帕累托改进的可能性.分别就油价调整前后的情况,找出调整起租基价和综合单位里程车价能使双方都满意的次优方案.进一步分析了起租基价和里程的合理性,提出了数据采集的建议和方案,并向市公用事业管理部门概括介绍.模型对确定其他类似准公共产品的供应量和定价也具有一定的借鉴意义. 相似文献
9.
Path Decomposition of Graphs with Given Path Length 总被引:3,自引:0,他引:3
Ming-qing Zhai~ 《应用数学学报(英文版)》2006,22(4):633-638
A path decomposition of a graph G is a list of paths such that each edge appears in exactly onepath in the list.G is said to admit a {P_l}-decomposition if G can be decomposed into some copies of P_l,whereP_l is a path of length l-1.Similarly,G is said to admit a {P_l,P_k}=decomposition if G can be decomposed intosome copies of P_l or P_k.An k-cycle,denoted by C_k,is a cycle with k vertices.An odd tree is a tree of which allvertices have odd degree.In this paper,it is shown that a connected graph G admits a {P_3,P_4}-decompositionif and only if G is neither a 3-cycle nor an odd tree.This result includes the related result of Yan,Xu andMutu.Moreover,two polynomial algorithms are given to find {P_3}-decomposition and {P_3,P_4}-decompositionof graphs,respectively.Hence,{P_3}-decomposition problem and {P_3,P_4}-decomposition problem of graphs aresolved completely. 相似文献
10.