Based on FP-tree algorithm, this article introduced the method of multi-thread processing and a Multi-Threaded Paralleled frequent item-set mining Algorithm - MTPA was proposed. It has been applied to an enterprise hu...
详细信息
Based on FP-tree algorithm, this article introduced the method of multi-thread processing and a Multi-Threaded Paralleled frequent item-set mining Algorithm - MTPA was proposed. It has been applied to an enterprise human resources management system. Through the experiments of paralleled mining by using increasing multi-thread processing, it has been proved that MTPA which on the condition of multi-core processors can improve the efficiency of frequent item-set mining effectively.
As the streaming media files growing larger and larger in size, it inevitably aggravates the network congestion and user perceive latency, to settle problem lots of caching algorithms have been applied in video-on-dem...
详细信息
As the streaming media files growing larger and larger in size, it inevitably aggravates the network congestion and user perceive latency, to settle problem lots of caching algorithms have been applied in video-on-demand (VOD)system. However, different algorithm is correspondence to an unique caching replacement policy, which limits its applications and the effects are not very satisfied, so in VOD aspect it is necessary to find a common replacement algorithm. In this paper, we propose a Common Caching Replacement Algorithm (CCRA). As a unification replacement algorithm, it sufficiently considers the recent visit and segment size, effectively solves the disk I/O bandwidth bottleneck limitation and improves byte hit rate. We respectively replace the previous caching replacement policy in Uniform segmentation algorithm and Exponential segmentation algorithm with CCRA. From the experimental comparison, Uniform segmentation with CCRA improves almost 5\% in disk reduce ratio, and exponential segmentation with CCRA increases near 8\% in byte hit ratio.
Due to the decoding dependency of MPEG coded frames, lots of dependent frames are transmitted at video cassette recording (VCR) operations, thus more computation resource, hard disk and network bandwidth are consumed ...
详细信息
Due to the decoding dependency of MPEG coded frames, lots of dependent frames are transmitted at video cassette recording (VCR) operations, thus more computation resource, hard disk and network bandwidth are consumed on streaming media server, and higher decoding complexity on Set-Top Box (STB). To tackle this problem, our scheme of supporting VCR functionalities with adaptive rate adjustment in streaming media server is proposed. The scheme includes a general VCR functionalities supporting method called GVFR which selects frames based on Group of Pictures (GOP) and uses Variable Frame Rate (VFR). Selecting frames based on GOP can efficiently eliminate the transmission of dependent frames, and the realization of VFR leads to optional transmission rate. Then an intelligent decision mode is introduced which automatically picks the appropriate GVFR strategies with suitable transmission rate based on the congestion status of the link. The experimental results demonstrate that GVFR can greatly decrease the transmission rate of fast forward/backward, to 22% of that of normal playback at least, and by varying GVFR strategies, VCR with optional transmission rate is achieved.
Numerous studies have reported that the timeseries terrestrial parameters such as the Normalized Difference Vegetation Index (NDVI), Leaf Area of Index (LAI), Fraction of Absorbed Photosynthetic Active Radiation (FPAR...
详细信息
Parallel association rules mining has been improved the efficiency of data mining, and meanwhile concerned with the privacy preserving problem. A simple and effective method of parallel association rules mining which ...
详细信息
Parallel association rules mining has been improved the efficiency of data mining, and meanwhile concerned with the privacy preserving problem. A simple and effective method of parallel association rules mining which based on privacy protection----parallel association rules mining algorithm with privacy preserving (PARMA-P) has been introduced in this paper. It could achieve effective concealment of frequent item-set and then the association rules by the means of using imported hash assignment strategy in frequent item sets of FP sub tree could be protected. It has been used in HRM of an enterprise and experiments show that the algorithm can be simple and effective in protection of data privacy.
The water problem in north China is serious. Agriculture water consumption is very high that led to a serious drop in water table. So research on real water saving in the region is very important. The study improved s...
详细信息
In this paper, we use the method proposed by Eisen to analyze the genomic data collected from the State keylaboratory of Reproductive Biology, Chinese Academy of sciences. The analysis shows that the clustering metho...
详细信息
In this paper, we use the method proposed by Eisen to analyze the genomic data collected from the State keylaboratory of Reproductive Biology, Chinese Academy of sciences. The analysis shows that the clustering metho...
详细信息
In this paper, we use the method proposed by Eisen to analyze the genomic data collected from the State keylaboratory of Reproductive Biology, Chinese Academy of sciences. The analysis shows that the clustering methods effectively group genes of similar functions.
With the emergence of edge computing, there’s a growing need for advanced technologies capable of real-time, efficient processing of complex data on edge devices, particularly in mobile health systems handling pathol...
详细信息
With the emergence of edge computing, there’s a growing need for advanced technologies capable of real-time, efficient processing of complex data on edge devices, particularly in mobile health systems handling pathological images. On edge computing devices, the lightweighting of models and reduction of computational requirements not only save resources but also increase inference speed. Although many lightweight models and methods have been proposed in recent years, they still face many common challenges. This paper introduces a novel convolution operation, Dynamic Scalable Convolution (DSC), which optimizes computational resources and accelerates inference on edge computing devices. DSC is shown to outperform traditional convolution methods in terms of parameter efficiency, computational speed, and overall performance, through comparative analyses in computer vision tasks like image classification and semantic segmentation. Experimental results demonstrate the significant potential of DSC in enhancing deep neural networks, particularly for edge computing applications in smart devices and remote healthcare, where it addresses the challenge of limited resources by reducing computational demands and improving inference speed. By integrating advanced convolution technology and edge computing applications, DSC offers a promising approach to support the rapidly developing mobile health field, especially in enhancing remote healthcare delivery through mobile multimedia communication.
暂无评论