共查询到20条相似文献,搜索用时 93 毫秒
1.
变频调速恒压供水系统新方法 总被引:1,自引:0,他引:1
针对当前多数恒压供水系统水泵运行状态单一、不能自动完成多台水泵循环工作,影响水泵使用寿命且使其它水泵长期停歇造成资源浪费的问题。提出了采用支持图形化逻辑电路编程的LOGO!可编程控制器,依据增泵条件和减泵条件,实现了变频恒压供水系统多泵自动循环工作和定时自动切换的控制功能。实际运行结果表明,该方法控制有效,系统运行稳定可靠、功能完善。 相似文献
2.
3.
4.
5.
6.
变频调速技术在水泵控制系统中的应用 总被引:16,自引:0,他引:16
介绍了水泵变频调速控制系统的节能原理、系统结构及节能效果。系统运行结果表明:水泵采用变频调速控制,节能效果显著,具有明显的经济效益和社会效益。 相似文献
7.
针对供水企业降低水泵的能耗和维护成本,设计了一种基于DSP变频自动恒压供水系统。采用TMS320F240 DSP和一台160kW大功率变频器控制三台大功率水泵电机实现对某水厂的变频自动恒压供水控制;详细分析了其硬件组成和DSP编程原理。实验运行表明,此系统运行稳定可靠、稳压精度高、节能效果明显,具有很好的经济效益。 相似文献
8.
9.
多泵自动循环切换恒压供水变频调速系统 总被引:4,自引:0,他引:4
陈成勇 《自动化技术与应用》2010,29(1):114-117,123
本文采用变频调速方式自动调节水泵转速或加、减泵。自动完成泵组软启动及无冲击切换,使水压平稳过渡。变频器故障时系统仍可运行,保证不间断供水。系统断电恢复后可自启动。并详细说明系统硬件构成、软件设计、工作原理、运行方式、参数整定等.系统主要采用三菱PLC和西门子变频,来实现所需要的功能. 相似文献
10.
11.
蔡玉硕 《数码设计:surface》2009,(8):174-176
近几年来,无论是学校还是社会在谈到大学生素质时,常常会涉及诸如缺乏创新能力、知识面狭窄、缺乏独立生活的能力、缺乏团队精神、心理承受力有限等问题。本文将结合教学实践和相关调查从社会需求与学生对团队精神认知之间的矛盾、设计与团队精神的关系入手,探讨如何培养高校设计专业学生团队精神以适应知识经济时代社会对设计人才需求的问题。 相似文献
12.
Piek Vossen Laura Bloksma Antonietta Alonge Elisabetta Marinai Carol Peters Irene Castellon Antonia Marti German Rigau 《Computers and the Humanities》1998,32(2-3):153-184
This paper describes how the Euro WordNet project established a maximum level of consensus in the interpretation of relations, without loosing the possibility of encoding language-specific lexicalizations. Problematic cases arise due to the fact that each site re-used different resources and because the core vocabulary of the wordnets show complex properties. Many of these cases are discussed with respect to language internal and equivalence relations. Possible solutions are given in the form of additional criteria. 相似文献
13.
随着IT技术的发展,许多企事业单位都开发了自己的网站。但随着时间的推移,经常需要对网站进行优化。在对网站进行内容审查市,可从客户对网站内容的看法、分析网站内容、重新规划网站内容、对网站原先内容重新优化四个方面进行。对企事业单位进一步提升网站的知名度有较强的指导意义。 相似文献
14.
The importance of curriculum development on archives and records management in the digital era, especially on the African continent, cannot be overemphasized. While many universities in the global hub have included studies on all aspects of archives and records management programs with many emphasizing records created in networked environments, the same cannot be said about universities on the African continent. In Africa, education and training of archives and records professionals can be traced back several decades. Archives and records practitioners in Africa’s different countries have, over the years, taken varying paths to attain their professional qualifications. This study outlines progress on an ongoing study by InterPARES Trust Africa Team that examines the curricula in different African educational institutions and investigates the extent to which they address the increasingly complex environment that includes the management of digital records in networked environments. It is hoped that the study will inform curriculum development and review in the area of digital records at the institutions of higher learning in Africa. 相似文献
15.
16.
17.
18.
移动IP为移动主机在移动过程中保持其通信不间断提供了实现方法,隧道技术是移动IP的关键技术之一,当通信节点向移动节点发送数据报时,需要使用到隧道技术。介绍了移动IP中隧道技术的基本原理,并给出了一种在Linux系统下的实现方法,对于移动IP相关软件的研究和开发具有一定的借鉴作用。 相似文献
19.
20.
Jérémie Chalopin Yoann Dieudonné Arnaud Labourel Andrzej Pelc 《Distributed Computing》2016,29(3):187-205
Two mobile agents, starting from different nodes of an unknown network, have to meet at a node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability \(0<p<1\)), unbounded adversarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals. For random faults, we show an algorithm with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks. By contrast, for unbounded adversarial faults we show that rendezvous is not possible, even in the class of rings. Under this scenario we give a rendezvous algorithm with cost \(O(n\ell )\), where \(\ell \) is the smaller label, working in arbitrary trees, and we show that \(\varOmega (\ell )\) is the lower bound on rendezvous cost, even for the two-node tree. For bounded adversarial faults, we give a rendezvous algorithm working for arbitrary networks, with cost polynomial in n, and logarithmic in the bound c and in the larger label L. 相似文献