Time evolving graph (TEG) is increasingly being used as a paradigm for modeling and analyzing dynamic relationships in many emerging domains such as online social networks, World Wide Web and evolutionary genomics. A ...
详细信息
ISBN:
(纸本)9781467327404;9781467327404
Time evolving graph (TEG) is increasingly being used as a paradigm for modeling and analyzing dynamic relationships in many emerging domains such as online social networks, World Wide Web and evolutionary genomics. A time-evolving graph consists of a sequence of snapshots of the graph as it evolves over time. the ability to scalably process various types of queries on massive TEGs is central to building powerful analytic applications for these domains. Unfortunately, indexing techniques and cluster computing schemes that have been designed for static graphs are not very effective for processing massive TEGs. Towards designing scalable mechanisms for answering TEG queries, this paper studies three important problems. the first is the distribution of TEG data on the nodes of a cluster computing framework such as Pregel or Giraph so that the computing and communication resources of the cluster are effectively harnessed. the second is the answering of reachability queries on any snapshot of a TEG and the third is that of processing pattern matching queries in TEGs. For each problem, we provide a brief literature survey and explain why trivial extensions of static graph techniques are not adequate for TEGs. We also present our preliminary ideas towards addressing these problems and discuss their benefits.
Short term load forecasting is an essential part of electric power system planning and operation. Effective load forecasting is difficult due to the complicated effects on load by variety of factors. this paper presen...
详细信息
We can face withthe patternrecognition problems where the influence of hidden context leads to more or less radical changes in the target concept. this paper proposes the mathematical and algorithmic framework for t...
详细信息
Molecular dynamics (MD) simulations are useful in various areas. In this paper, we parallelize and optimize the grid-based MD algorithm on Many Integrated Core (MIC) Architecture. To get full play of the hardware and ...
详细信息
ISBN:
(纸本)9780769548968;9781467347259
Molecular dynamics (MD) simulations are useful in various areas. In this paper, we parallelize and optimize the grid-based MD algorithm on Many Integrated Core (MIC) Architecture. To get full play of the hardware and accelerate computation of MD simulation, we design the parallel structure using multi-threads with OpenMP. Also, various or method such as Array Notification, intrinsic and so on are used to vectorize the application according to the character of MIC for a higher performance. Due that multi-core is also a trendy of CPU and High Performance computing, our method can be followed by other similar applications and provide a more choice.
Recently identified low-rate TCP-targeted DoS attacks can cause failures of Border Gateway Protocol sessions and route flappings without being detected by current defense mechanisms. Deliberately constructed Distribut...
详细信息
Withthe development of Internet and computer technology, the digital videos increase explosively, so how to get the interesting video clips from the massive video dataset quickly and efficiently has become an urgent ...
详细信息
ISBN:
(纸本)9780769548968;9781467347259
Withthe development of Internet and computer technology, the digital videos increase explosively, so how to get the interesting video clips from the massive video dataset quickly and efficiently has become an urgent problem in the field of information retrieval (IR). In this paper, a new Instance-based video search (INS) engine is proposed to solve the urgent problem. Firstly, video key-frames are extracted and grouped from queries and video dataset. Secondly, robust low-level visual features are extracted and projected to multiple visual codebooks. Finally, after similarity computing and feature fusion, a re-ranking scheme is implemented to vote the final search results. the proposed framework was evaluated at TRECVID 2011 on instance search task(INS), and achieved the 2nd place among 47 participants around the world, which indicated the effectiveness of our system.
We propose a fast algorithm which is based on the beamlet decomposition for real-time rendering of scenes in participating media with multiple scattering. Firstly, the light source radiation is considered as composed ...
详细信息
ISBN:
(纸本)9780769548968;9781467347259
We propose a fast algorithm which is based on the beamlet decomposition for real-time rendering of scenes in participating media with multiple scattering. Firstly, the light source radiation is considered as composed by all particles in the media and each particle radiation is decomposed along different forward directions using the plane decomposition method. then the multiple scattering radiation of one particle is calculated by the decomposition radiations from its adjacent particles and the light source. Finally, according to the multiple scattering radiation value of each particle, the radiation of the ray which is from viewpoint is calculated using ray marching method, which can be implemented on the graphics processing unit (GPU), and rendering process is highly parallel. the experimental results show that the algorithm can achieve real-time rendering efficiency and enhance the practicality of multiple scattering.
the method of three dimensional mesh reconstruction is used to supplementing the 3D reconstruction or 3D scanning method, which only provide with point cloud in 3D model. However, the 3D models in mesh mode illustrate...
详细信息
Multiple instance learning, when instances are grouped into bags, concerns learning of a target concept from the bags without reference to their instances. In this paper, we advance the problem with a novel method bas...
详细信息
In this paper, an effective method based on multi-scale overlapped block LBP is proposed for plant leaf image recognition. Firstly, multi-scale pyramid is employed in order to improve the leaf data utilization. For ea...
详细信息
ISBN:
(纸本)9783642315756;9783642315763
In this paper, an effective method based on multi-scale overlapped block LBP is proposed for plant leaf image recognition. Firstly, multi-scale pyramid is employed in order to improve the leaf data utilization. For each scale, each training image is divided into several equal overlapping blocks to extract the LBP histograms. then, the PCA method is used for LBP feature dimension reduction. Finally, the recognition experiments are performed by using the SVM classifier. We compare the proposed method with Histogram of Oriented Gradients (HOG) method and Inner-Distance Shape Context (IDSC) method on Swedish leaf dataset and our ICL leaf dataset. the experimental results show that the proposed method achieves better performance than IDSC and HOG.
暂无评论