录象机定时录象功能的实现

简要介绍了松下录象机的定时录象功能。对录象中定时录象功能 凤及设计中 当注意的问题作了较为详细的叙述。     

一种土壤湿度检测系统设计

本文设计了一种无线土壤湿度采集装置,该装置通过湿度传感器HS1101对土壤湿度进行采集,然后将采集到的数据通过无线模块PTR2000发送出去,接收方接收到数据后解包,计算出湿度值并在液晶屏上显示。系统发射部分以AT89S52为核心,包括湿度采集、无线发射。接收部分也以AT89S52为核心,将无线接收、液晶显示结合起来,通过适当的软、硬件抗干扰处理,该系统具有实用性、小型化等特点。     

多媒体定时器方法中MFC跨线程传递窗口类消息的实现

为实现高频数据采集,采用多媒体定时器的方法实现上位机精确定时,同时研究实现了MFC中跨线程窗口类消息传递问题的解决方案。实验表明,定时精度高,达到10毫秒精确定时,不会出现数据丢失,运行良好。     

一道数字排列题算法演示的C#实现

编程解决实际问题,不仅通过大量的编程实践,掌握一定的编程技巧,同时也需要找到解决问题的正确方案。通过一道数字排列题的解决演示,灵活运用C#语言编程实现该问题算法的可视化演示。     

用VB标签控件实现动态效果

在VB程序设计里．标签通常是作为在窗口里显示文字信息的。用活标签的常用属性。并合理使用计时器控件。就能够呈现出动态的文字效果。为窗口界面增添活力。     

一种基于UMTS核心网的定时器实现方案

针对UMTS核心网呼叫连接协议的实现,提出了一种软件定时器的实现方案。该方案以WinCE实时嵌入式系统作为开发环境,采用单链表队列和相对时间项方式的定时器数据结构,基于时间相对算法建立了定时器单一线程和插入、删除程序,以实现协议所规定的多定时器逻辑功能。在嵌入式系统编程过程中,运用互斥量机制完成定时器线程与插入、删除程序的通信同步;运用堆管理机制完成系统内存的动态分配与释放。对该方案的主要技术和实现结构作了论述,并给出了关键代码;还对UMTS协议结构和WinCE相关机制作了分析。实验表明,该设计方案具有编程效率高、实时性能好和系统开销小的特点,适合基于嵌入式系统的通信协议定时器编程。     

抑制NACK的定时器设置方法

FEC can be combined with ARQ to achieve large scalable reliable mutlicast. The NACK im-plosion is a major problem in receiver-initiated reliable multicast when a large, number of receivers sendsNACK to the sender. The method that receivers send NACK to the sender based on timer can avoid theNACK implosion. We propose a method to set timers. The method of time divided unequally and basedon exponential distribution to set timers has the better perfornance. By analysis for up to 10^10 receivers,we show the NACK implosion is avoided and feedback delay due to timers is low.     

基于Windows 9X系统下I~2C总线的软件实现

由于Ｉ２Ｃ总线接口的便捷经济,自从Ｐｈｉｌｉｐｓ公司提出以来就显示出它强大的生命力。该文提出了一种基于Ｗｉｎｄｏｗｓ ９Ｘ操作平台下Ｉ２Ｃ 总线的软件实现方法,并给出了一种微秒级定时器的实现方法。     

Windows98环境下实时控制系统的开发

针对Windows98环境下开发实时控制系统等有关内容进行了分析,指出仅仅通过Windows中提供的定时器要完成高精度的实时控制是不可能的,必须从软、硬件两方面加以解决,提出了两种编写中断处理程序的方法;开发虚拟设备驱动程序和使用TVicHW32控件。     

Efficient clustering algorithms for self-organizing wireless sensor networks

Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy resources available in these networks. In this paper, we make contributions towards improving the efficiency of self-organization in wireless sensor networks. We first present a novel approach for message-efficient clustering, in which nodes allocate local “growth budgets” to neighbors. We introduce two algorithms that make use of this approach. We analyze the message complexity of these algorithms and provide performance results from simulations. The algorithms produce clusters of bounded size and low diameter, using significantly fewer messages than the earlier, commonly used, Expanding Ring approach. Next, we present a new randomized methodology for designing the timers of cluster initiators. This methodology provides a probabilistic guarantee that initiators will not interfere with each other. We derive an upper bound on the expected time for network decomposition that is logarithmic in the number of nodes in the network. We also present a variant that optimistically allows more concurrency among initiators and significantly reduces the network decomposition time. However, it produces slightly more clusters than the first method. Extensive simulations over different topologies confirm the analytical results and demonstrate that our proposed methodology scales to large networks.