检索结果-内蒙古大学图书馆

41st International Conference on Parallel Processing, ICPP 2012

作者： Yuan, Liang Ding, Chen Štefankovič, Daniel Zhang, Yunquan Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China Computer Science Department University of Rochester United States

ISBN: (纸本)9780769547961

An increasing number of applications in physical and social sciences require the analysis of large graphs. The efficiency of these programs strongly depends on their memory usage especially the locality of graph data access. Intuitively, the locality in computation should reflect the locality in graph topology. Existing locality models, however, operate either at program level for regular loops and arrays or at trace level for arbitrary access streams. They are not sufficient to characterize the relation between locality and connectivity. This paper presents a new metrics called the vertex distance and uses it to model the locality in breadth-first graph traversal (BFS). It shows three models that use the average node degree and the edge distribution to predict the number of BFS levels and the reuse distance distribution of BFS. Finally, it evaluates the new models using random and non-random graphs. © 2012 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A new one-bit diFFerence collision attack on HAVAL-128

引用

science China(Information sciences) 2012年第11期55卷 2521-2529页

作者： ZHANG WenYing1,2,3,LI YanYan1 & WU Lei1 1School of Information science and Engineering,Shandong Normal University,Jinan 250014,China 2state key lab of Information Security,Institute of Information Engineering,Chinese Academy of sciences,Beijing 100093,China 3Shandong Provincial key laboratory for Novel Distributed computer Software Technology,Jinan 250014,China 1. School of Information Science and Engineering Shandong Normal University Jinan 250014 China2. State Key Lab of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China3. Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 250014 China

In this paper,we give a new fast attack on *** attack includes many present methods of constructing hash ***,we present a neighborhood *** propose a new difference path different from the previous *** conclusion is that,when the output of each step satisfies our condition,the message m can collide with m'= m + Δm,where Δm =(0,0,0,0,231,0,...,0).There is only one bit difference between m and m'.Two pairs of collision examples for HAVAL-128 are *** order to improve the probability of collision,we use four tricks of message *** attack's running time is less than 225.83 2-pass HAVAL computations,which is the best result for one-bit collision of HAVAL so far.

关键词： cryptography hash function HAVAL-128 collision message modification

来源：评论

学校读者我要写书评

暂无评论

Two new local search strategies for minimum vertex cover 26

Two new local search strategies for minimum vertex cover

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Cai, Shaowei Su, Kaile Sattar, Abdul Key Laboratory of High Confidence Software Technologies Peking University Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD Australia ATOMIC Project Queensland Research Lab. NICTA Australia

ISBN: (纸本)9781577355687

In this paper, we propose two new strategies to design efficient local search algorithms for the minimum vertex cover (MVC) problem. There are two main drawbacks in state-of-the-art MVC local search algorithms: First, they select a pair of vertices to be exchanged simultaneously, which is time consuming;Second, although they use edge weighting techniques, they do not have a strategy to decrease the weights. To address these drawbacks, we propose two new strategies: two stage exchange and edge weighting with forgetting. The two stage exchange strategy selects two vertices to be exchanged separately and performs the exchange in two stages. The strategy of edge weighting with forgetting not only increases weights of uncovered edges, but also decreases some weights for each edge periodically. We utilize these two strategies to design a new algorithm dubbed NuMVC. The experimental results show that NuMVC significantly outperforms existing state-of-the-art heuristic algorithms on most of the hard DIMACS instances and all instances in the hard random BHOSLIB benchmark. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Kernel Approach to Multi-Task Learning with Task-Specific Kernels

引用

Journal of computer science & Technology 2012年第6期27卷 1289-1301页

作者：武威李航胡云华金榕 MOE-Microsoft Key Laboratory of Statistics and Information Technology Department of Probability and Statistics School of Mathematical SciencesPeking University Beijing International Center for Mathematical Research Peking University Noah's Ark Lab HuaweiHong Kong Science Park Microsoft Research Asia Department of Computer Science and Engineering Michigan State UniversityEast LansingMI 48824U.S.A.

Several kernel-based methods for multi-task learning have been proposed, which leverage relations among tasks as regularization to enhance the overall learning accuracies. These methods assume that the tasks share the same kernel, which could limit their applications because in practice different tasks may need different kernels. The main challenge of introducing multiple kernels into multiple tasks is that models from different reproducing kernel Hilbert spaces （RKHSs） are not comparable, making it difficult to exploit relations among tasks. This paper addresses the challenge by formalizing the problem in the square integrable space （SIS）. Specially, it proposes a kernel-based method which makes use of a regularization term defined in SIS to represent task relations. We prove a new representer theorem for the proposed approach in SIS. We further derive a practical method for solving the learning problem and conduct consistency analysis of the method. We discuss the relationship between our method and an existing method. We also give an SVM （support vector machine）- based implementation of our method for multi-label classification. Experiments on an artificial example and two real-world datasets show that the proposed method performs better than the existing method.

关键词： multi-task learning kernel method square integrable space support vector machine

来源：评论

学校读者我要写书评

暂无评论

Resource-distortion modeling for video streaming over mesh networks with priority-based packet scheduling

Resource-distortion modeling for video streaming over mesh n...

引用

2012 13th IEEE International Conference on Multimedia and Expo, ICME 2012

作者： Zhang, Yongfei Zhang, Yunsheng Qin, Shiyin He, Zhihai Beijing Key Lab. of Digital Media School of Computer Science and Engineering Beihang University Beijing 100191 China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing 100191 China School of Automation Science and Electrical Engineering Beihang University Beijing 100191 China Graduate School at Shenzhen Tsinghua University Shenzhen 518055 China Department of Electrical and Computer Engineering University of Missouri Columbia MO 65211 United States

ISBN: (纸本)9781467316590

Video streaming over mesh networks operates under stringent network resource constraints, with a large number of video sessions competing for limited network resources. In this work, we aim to establish so-called resource-distortion models to characterize the inherent relationship between the allocated network resources to each video session and its end-to-end video distortion or presentation quality at the receiver end. We observed that priority-based packet scheduling has significant impact on such resource-distortion relationship. Using ANN-based learning methods, we develop an end-to-end packet delay bound violation (PDBV) probability model for video streaming over multi-hop networks with priority-based packet scheduling. We then derive a quadratic video transmission distortion model to capture the unique behavior of priority-based packet scheduling and its impact on the end-to-end video distortion. Based on these resource-distortion models, we are able to predict the end-to-end distortion for video streaming over multi-hop networks with priority-based packet scheduling. Our extensive experimental results demonstrate that the proposed method is very accurate. © 2012 IEEE.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

Finger vein verification using Occurrence Probability Matrix (OPM)

Finger vein verification using Occurrence Probability Matrix...

引用

International Joint Conference on Neural Networks

作者： Darun Tang Beining Huang Rongfeng Li Wenxin Li Xiaoming Li Key Laboratory of Machine Perception (MOE) School of Electronics Engineering and Computer Science Peking University State Key Lab of Virtual Reality Technology and Systems Beihang University

ISBN: (纸本)9781467314886

We found that the discrepancy between different finger vein templates of the same finger affects the identification results more seriously than the similarity of templates of different fingers does. Some areas on templates have stable values while some other areas are variable. We propose the Occurrence Probability Matrix (OPM), which is a property of a finger, to define the stability. When matching two templates using OPM, the areas of higher stability make more contribution to the result and those of lower stability make less contribution. In this way, OPM can enhance the similarity of templates of the same finger and drop off the influence of the unsteady areas. In a finger vein verification system running for a long time, we can get enough templates of every finger to generate an effective OPM. But it does not mean that using more templates can get a better OPM. So, we fatherly propose a strategy to select typical templates purposely from all templates of a finger to calculate the OPM. Experimental results show that by simply using OPM calculated from all existing templates, the EER of the system is reduced from 9.8% to 7.6%. And by using the OPM calculated from selected typical templates by our strategy, the EER of the system is further reduced from 7.6% to 3.1%.

关键词： OPM Finger vein Template Stability Selection

来源：评论

学校读者我要写书评

暂无评论

Context-based requirement modeling for self-adaptive service software

引用

Journal of Computational Information Systems 2012年第24期8卷 10131-10140页

作者： Liu, Wei Feng, Zaiwen School of Computer Science and Engineering Hubei Key Laboratory of Intelligence Robot Wuhan Institute of Technology Wuhan 430073 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China

Service-oriented self-adaptation software (SoSAS) utilizes services as fundamental elements for developing applications that have the capability to autonomously modify their behavior at run-time in response to changes in their environment. While a few techniques have been developed to support the modeling and analysis of requirements for self-adaptive systems, limited attention has been paid to the description of service requirements and uncertainty in requirements of SoSAS. In this paper, we propose a context-based requirement representing and modeling framework as a fundamental of self-adaptation evolution. We introduce a context snapshot model to represent uncertainty in requirement with domain knowledge;goal-oriented context requirement to model user requirements and process-oriented context requirement to model service requirements;and finally, propose means-c-end analysis to relate user and service requirement with context condition. We illustrate and evaluate our approach through three scenarios of city intelligent traffic domain in the support tool ConUSER. © 2011 by Binary Information Press.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

SEARCH ENGINE CLICK SPAM DETECTION

SEARCH ENGINE CLICK SPAM DETECTION

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Xin Li Min Zhang Yiqun Liu Shaoping Ma Yijiang Jin Liyun Ru State Key Lab of Intelligent Tech. and Sys Tsinghua National Laboratory for Information Sci. & Tech.Department of Computer Science and TechnologyTsinghua University

Using search engine to retrieve information has become an important part in people's daily life. For most search engines, click information is a significant factor in document ranking. As a result, some websites use cheating methods to get a higher rank by increasing clicks on its page fraudulently in search results to earn huge commercial interest, which is called "Click Spam". Based on the analysis of features of cheating clicks, a novel automatic click spam detection approach is proposed in this paper, which consists of: 1) detect the single click record spam, by which 0.54% of all the clicks are detected as spams;2) model user sessions with a triple sequence which by the first time, to be best of our knowledge, takes not only user action, but also action object and time interval between actions into consideration in related research;3) based on the detected single click record spam and other features, find seed cheating session modes;and then use bipartite graph iterative algorithm to get higher precision and recall of click spam detection. Experiments have been made on Chinese commercial search engine real log data, containing around 80 million user clicks per day. As a result, 2.1% of all the clicks can be detected as spams, and the precision reaches to 97%. The proposed framework is with the high capability to detect click spam precisely and efficiently, which can be easily implemented in real world commercial search engine service.

关键词： Click spam User session Bipartite graph iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Pricing of Multi-model Hybrid System for PaaS Cloud Computing

Optimal Pricing of Multi-model Hybrid System for PaaS Cloud ...

引用

International Conference on Cloud and Service Computing (CSC)

作者： Hao Lu Xing Wu Wu Zhang Jin Liu School of Computer Engineering and Science Shanghai University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China State Key Lab. Of Software Engineering Wuhan University Wuhan China

Success of cloud computing service depends on an acceptable pricing model, especially in the PaaS. As a dynamic platform, PaaS layer depends on the infrastructure layer and extends to the application layer. How to find an optimal pricing policy is the problem for the cloud providers in face of stochastic and dynamic demand. In this paper, we present an approach of dynamic pricing model in order to get max profits. We analyze the model by a multi-condition hybrid system. But we also use a theory of revenue maximization and cost minimization. When at a current state, the system content cost minimization to build a hybrid system for revenue maximization, we will get the most profits.

关键词： Pricing Cloud computing Computational modeling Mathematical model Educational institutions Optimal control Equations

来源：评论

学校读者我要写书评

暂无评论

Robust Maximum Likelihood estimation by sparse bundle adjustment using the L1 norm

Robust Maximum Likelihood estimation by sparse bundle adjust...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhijun Dai Fengjun Zhang Hongan Wang Intelligence Engineering Laboratory Institute of Software Chinese Academy of Sciences China Intelligence Engineering Lab Institute of Software State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China

Sparse bundle adjustment is widely used in many computer vision applications. In this paper, we propose a method for performing bundle adjustments using the L 1 norm. After linearizing the mapping function in bundle adjustment on its first order, the kernel step is to compute the L 1 norm equations. Considering the sparsity of the Jacobian matrix in linearizing, we find two practical methods to solve the L 1 norm equations. The first one is an interior-point method, which transfer the original problem to a problem of solving a sequence of L 2 norm equations, and the second one is a decomposition method which uses the differentiability of linear programs and represents the optimal updating of parameters of 3D points by the updating variables of camera parameters. The experiments show that the method performs better for both synthetically generated and real data sets in the presence of outliers or Laplacian noise compared with the L 2 norm bundle adjustment, and the method is efficient among the state of the art L 1 minimization methods.

关键词： Cameras Noise Equations Mathematical model Laplace equations Minimization Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：