Design of Remote Controller Using Code Matching and Frequency Hopping Technology

2010 ◽  
Vol 44-47 ◽  
pp. 1412-1416
Author(s):  
Geng Sheng Zheng ◽  
Cheng Liang Li

This paper presents the design and implementation of a RF remote controller using code matching and frequency hopping technology. The proposed controller supports access to different random channels under disturbance environment. The work process of RF remote controller is composed of code matching, running state, handover state, and sleep state. Four system states can transform each other under corresponding external conditions. The suggested controller is more reliable than conventional ones especially during emergency condition such as noise and co-channel interference. The feasibility of the architecture has been demonstrated with a prototype implementation and presented in details.

2020 ◽  
pp. 57-75
Author(s):  
Larisa Karaseva ◽  
Sergey Dvoynikov

Currently, due to the changing external conditions that affect the organization of labor, most medical organizations are required to pay special attention to training nursing staff for the work process. The principles of nursing staff management are also subject to changes, which is the reason for the change in the personnel policy. The key point is training nursing staff in order to improve the specialists’ skills and the efficiency of the organization.


Author(s):  
Song Jiang

Most computer systems use the global page replacement policy based on the LRU principle to reduce page faults. The LRU principle for the global page replacement dictates that a Least Recently Used (LRU) page, or the least active page in a general sense, should be selected for replacement in the entire user memory space. However, in a multiprogramming environment under high memory load, an indiscriminate use of the principle can lead to system thrashing, in which all processes spend most of their time waiting for the disk service instead of making progress. In this chapter, we will rethink the application of the LRU principle on global paging to identify one of root causes for thrashing, and describe a mechanism, named as swap token, to solve the issue. The mechnism is simple in its design and implementation but highly effective in alleviating or removing thrashing. A key feature of the swap token mechanism is that it can distinguish the conditions for an LRU page, or a page that has not been used for relatively long period of time, to be generated and accordingly categorize LRU pages into two types: true and false LRU pages. The mechanism identifies false LRU pages to avoid use of the LRU principle on these pages, in order to remove thrashing. A prototype implementation of the swap token mechanism in the Linux kernel as well as some experiment measurements are presented. The experiment results show that the mechanism can consistently reduce the program execution slowdown in a multiprogramming environment including SPEC2000 programs and other memory-intensive applications by up to 67%. The slowdown reductions mainly come from reductions of up to 95% of total page faults during program interactions. This chapter also shows that the mechanism introduces little overhead to program executions, and its implementations on Linux (and Unix) systems are straightforward.


Sign in / Sign up

Export Citation Format

Share Document