This paper presents a Zynq-based system to compute Run-Length encoding Matrix features for retinal image texture analysis. In order to improve the performance of the software implementation, we propose a co-processor ...
详细信息
Parametric search is a useful tool in geometric optimization. Invented by Nimrod Megiddo in 1983, it has been widely used in computational geometry. Unfortunately, this technique has rarely been used in the combinator...
详细信息
Parametric search is a useful tool in geometric optimization. Invented by Nimrod Megiddo in 1983, it has been widely used in computational geometry. Unfortunately, this technique has rarely been used in the combinatorial optimization community in China. In this paper, we introduce parametric search via three new geometric optimization applications.
Keywords Parametric search - geometric optimization - facility location
Engagement and motivation is always a challenge in online learning environments. The benefits of learning environments have proven its history for many years, but effectively engaging users with these environments and...
详细信息
This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigati...
详细信息
This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigation is popular with drivers either for efficient driv- ing in unfamiliar road networks or for a better route, even in familiar road networks with heavy traffic. In this paper, we describe how to take advantage of vehicle trajectories in order to design data-forwarding schemes for information exchange in vehicular networks. The design of data-forwarding schemes takes into account not only the macro-scoped mobility of vehicular traffic statistics in road net- works, but also the micro-scoped mobility of individual vehicle trajectories. This paper addresses the importance of vehicle trajectory in the design of multihop vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes. First, we explain the modeling of packet delivery delay and vehicle travel delay in both a road segment and an end-to-end path in a road net- work. Second, we describe a state-of-the-art data forwarding scheme using vehicular traffic statistics for the estimation of the end-to- end delivery delay as a forwarding metric. Last, we describe two data forwarding schemes based on both vehicle trajectory and vehicu- lar traffic statistics in a privacy-preserving manner.
Reputation is a key factor to enhance reliability and performance of transactions in the network. Many works have focused on rating the reputation of the entities through kinds of technologies. The entities send the r...
详细信息
Most embedded systems are equipped with flash memory owing to its shock re- sistance, fast access, and low power consumption. However, some of its distinguishing characteristics, including out-of-place updates, an asy...
详细信息
Most embedded systems are equipped with flash memory owing to its shock re- sistance, fast access, and low power consumption. However, some of its distinguishing characteristics, including out-of-place updates, an asymmetric read/write/erase speed, and a limited number of write/erase cycles, make it necessary to reconsider the existing sys- tem designs to explore its performance potential. For example, the buffer replacement policy of flash-based systems should not only consider the cache hit ratio, but also the relative heavy write and erase costs that are caused by flushing dirty pages. Most of the recent studies on buffer designs have focused on a Clean-First LRU strategy that evicts clean pages preferentially to reduce the number of writes to flash memory. However, each of them fails to distinguish dirty pages, which may have a different effect on the flash memory. In this paper, we propose a Lazy-Split LRU-based buffer management scheme that not only considers an imbalance of the read and write speeds but also differ- ent effects of different dirty pages and frequent changes of the B+-tree index structure caused by intensive overwrites. Specifically, it introduces a semi-clean state to further classify some dirty pages into clean part and dirty part and several efficient replacement policies to reduce the number of B+-tree splits. The experimental results show that our solution outperforms other algorithms including pure LRU and CFDC, and is effective and efficient for improving the performance of B+-tree on flash memory.
We present a unique Geographical Information System (GIS) that seamlessly integrates 2D and 3D views of the same spatial and aspatial data. Multiple layers of information are continuously transformed between the 2D an...
详细信息
Artificial Intelligence has been playing a profound role in the global economy,social progress,and people’s daily *** the increasing capabilities and accuracy of AI,the application of AI will have more impacts on man...
详细信息
Artificial Intelligence has been playing a profound role in the global economy,social progress,and people’s daily *** the increasing capabilities and accuracy of AI,the application of AI will have more impacts on manufacturing and service areas in the era of industry *** study conducts a systematic literature review to study the state-of-the-art on AI in industry *** paper describes the development of industries and the evolution of *** paper also identifies that the development and application of AI will bring not only opportunities but also challenges to industry *** findings provide a valuable reference for researchers and practitioners through a multi-angle systematic analysis of *** the era of industry 4.0,AI system will become an innovative and revolutionary assistance to the whole industry.
The fast spreading worm is becoming one of the most serious threats to today's networked information systems. A fast spreading worm could infect hundreds of thousands of hosts within a few minutes. In order to sto...
详细信息
ISBN:
(纸本)1595935800
The fast spreading worm is becoming one of the most serious threats to today's networked information systems. A fast spreading worm could infect hundreds of thousands of hosts within a few minutes. In order to stop a fast spreading worm, we need the capability to detect and contain worms automatically in real-time. While signature based worm detection and containment are effective in detecting and containing known worms, they are inherently ineffective against previously unknown worms and polymorphic worms. Existing traffic anomaly pattern based approaches have the potential to detect and/or contain previously unknown and polymorphic worms, but they either impose too much constraint on normal traffic or allow too much infectious worm traffic to go out to the Internet before an unknown or polymorphic worm can be *** this paper, we present WormTerminator, which can detect and completely contain, at least in theory, almost all fast spreading worms in real-time while blocking virtually no normal traffic. WormTerminator detects and contains the fast spreading worm based on its defining characteristic - a fast spreading worm will start to infect others as soon as it successfully infects one host. WormTerminator also exploits the observation that a fast spreading worm keeps exploiting the same set of vulnerabilities when infecting new machines. To prove the concept, we have implemented a prototype of WormTerminator and have examined its effectiveness against the real Internet worm Linux/Slapper. Copyright 2006 ACM.
暂无评论