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

Co-metric： a metric learning algorithm for data with multiple views

Frontiers of computer science 2013年第3期7卷 359-369页

作者： Qiang QIAN Songcan CHEN Department of Computer Science and Engineering Nanjing University of Aeronautics and Astronautics Nanjing 210016 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

We address the problem of metric learning for multi-view data. Many metric learning algorithms have been proposed, most of them focus just on single view circumstances, and only a few deal with multi-view data. In this paper, motivated by the co-training framework, we propose an algorithm-independent framework, named co-metric, to learn Mahalanobis metrics in multi-view settings. In its implementation, an off-the-shelf single-view metric learning algorithm is used to learn metrics in individual views of a few labeled examples. Then the most confidently-labeled examples chosen from the unlabeled set are used to guide the metric learning in the next loop. This procedure is repeated until some stop criteria are met. The framework can accommodate most existing metric learning algorithms whether types-of- side-information or example-labels are used. In addition it can naturally deal with semi-supervised circumstances under more than two views. Our comparative experiments demon- strate its competiveness and effectiveness.

关键词： multi-view learning metric learning algorithm- independent framework

来源：评论

学校读者我要写书评

暂无评论

Energy-aware multipath routing for data aggregation in wireless sensor networks

Energy-aware multipath routing for data aggregation in wirel...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yingyuan Xiao Xinrong Zhao Hongya Wang Ching-Hsien Hsu Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin P.R. China School of Computer Science and Technology Donghua University Shanghai P.R. China Department of Computer Science and Information Engineering Chung Hua University Hsinchu Taiwan R.O.C

ISBN: (纸本)9781479976164

Data aggregation in wireless sensor networks is widely used to collect data in an energy efficient manner to eliminate redundant data transmission so that prolong the network lifetime. To meet the data aggregation needs in wireless sensor networks, this paper proposes a novel multi-path routing algorithm, called EAD, to process in-network data aggregation. For each sensor on the routing paths, EAD evaluates its neighbors based on the residual energy, deviation angle and distance, and selects the k neighbors with the minimal evaluation costs as its forwarding nodes in order to balance energy consumption of the wireless sensor network on the premise of ensuring the reliability and performance. Simulation results show that EAD can effectively prolong network lifetime, reduce latency and ensure the reliability by adjusting the weight of each influencing factor.

关键词： Monitoring Batteries Erbium Aggregates Standards

来源：评论

学校读者我要写书评

暂无评论

Scenario-Based Behavioral Nonexistent Consistency Checking for Cyber-Physical Systems

Scenario-Based Behavioral Nonexistent Consistency Checking f...

引用

International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

作者： Yan Zhang Xiangwei Liu Jin Shi Tian Zhang Zhuzhong Qian Department of Computer Science and Technology Beijing Electronic Science and Technology Institute Beijing P. R. China State Key Lab. for Novel Software TechnologyNanjing University Naniing P. R. China School of Information Management Nanjing University Nanjing P. R. China Department of Computer Science and Technology Nanjing University Nanjing P. R. China

Cyber-Physical Systems (CPS) play an important role in the safety-critical systems. It is very significant to verify whether some concerned behaviors exist in a CPS. Hybrid interface automata, extension of a non-hybrid version, are used to model a CPS. A scenario, described by MARTE sequence diagram, specifies the concerned behaviors. An algorithm is given for bounded checking the behavioral nonexistent consistency, namely, the behaviors specified by a scenario all do not exist in a hybrid interface automaton. The idea of the algorithm is, firstly, encoding the behavioral nonexistent consistency to an unconstrained dynamic programming, secondly, solving the unconstrained dynamic programming by a genetic algorithm. The algorithm can search the results on the real domain, and be applied to nonlinear as well as linear hybrid systems.

关键词： Unified modeling language Automata Trajectory Orbits Heuristic algorithms Dynamic programming Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Low illumination image Retinex enhancement algorithm based on guided filtering

Low illumination image Retinex enhancement algorithm based o...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Jingcao Yin Hongbo Li Junping Du Pengcheng He Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781467369541

It has been shown by Retinex theory that the object's color in the image is determined by its reflectance. Under this frame work, several Retinex-based algorithms have been developed to uncover the real appearance of objects by estimating their reflectance in image. In this paper we propose an algorithm of optimizing the illumination based on guided image filter theory, where bilateral filter is utilized to estimate the illumination image. The proposed algorithm removes the halo phenomenon precisely and strengthens the partial contrast gradient effectively. Examples are given to demonstrate the effectiveness of the proposed method.

关键词： Entropy Filtering Lighting Image edge detection Lubricating oils Standards

来源：评论

学校读者我要写书评

暂无评论

Physically based parallel ray tracer for the Metropolis light transport algorithm on the Tianhe-2 supercomputer

Physically based parallel ray tracer for the Metropolis ligh...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Changmao Wu Yunquan Zhang Congli Yang Yutong Lu University of Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Architecture CAS Beijing China Laboratory of Parallel Software & Computational Science CAS Beijing China Department of Computer Science & Technology National University of Defense Technology Changsha Hunan China

Developing an efficient and highly scalable ray tracer for the Metropolis light transport algorithm is becoming increasingly important as the request for photorealistic images becomes a common trend. Although the Metropolis light transport algorithm has produced some of the most realistic images to date, it usually takes a great amount of time to render an image. The development of an efficient and highly scalable ray tracer for the Metropolis light transport algorithm is hard due in large part to the irregular memory access patterns, the imbalanced workload of light-carrying paths and the complicated mathematical model and complex physical processes. In this paper, we present a highly scalable physically based parallel ray tracer for the Metropolis light transport algorithm. Firstly, we present the idea of snapshot and sub-snapshot, then propose a novel assignment partitioning algorithm for compute nodes and CPU cores since the demand-driven assignment partitioning algorithms don't work. Secondly, we propose a physically based parallel ray racing framework for the Metropolis light transport algorithm, which is based on a master-worker architecture. Finally, we discuss the issue of granularity of the assignment partitioning and some optimization strategies for improving overall performance, then a hybrid scheduling strategy combining a static and dynamic scheduling strategy is described. Experiments show that our physically based ray tracer almost reaches linear speedup by using 26,400 CPU cores on the Tianhe-2 supercomputer. Our ray tracer is more efficient and highly scalable.

关键词： Partitioning algorithms EMTP

来源：评论

学校读者我要写书评

暂无评论

Data consistency enforcement on business process transactions

Data consistency enforcement on business process transaction...

引用

2012 International Conference on Service-Oriented Computing, ICSOC 2012

作者： Liu, Xi State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9783642378034

Transactions are common in business processes (BPs). Consistency on data, which is defined as satisfaction of a set of data integrity constraints, is one of the basic properties for business process transactions (BPTs). This requires a BPT to bring the BP execution from one consistent state to another consistent state. It is desirable to ensure within BP executions that every BPT preserves data consistency. Besides, the earlier an inconsistency is detected the less recovery is necessary. It is studied in this paper how to detect and recover from potential future inconsistency as early as possible in a BPT execution. We propose a runtime proactive mechanism enforcing consistency on BPTs, called "transaction consistency guarding", based on symbolic execution of BPEL scopes for bounded length and correct design of fault and compensation handlers. © Springer-Verlag 2013.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Multi-facet community detection from bipartite networks

引用

Journal of Applied sciences 2013年第16期13卷 3137-3144页

作者： Xu, Yongcheng Chen, Ling Zou, Shengrong Department of Computer Science Yangzhou University Yangzhou 225009 China State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210093 China

Detecting communities from networks is one of the important and challenging research topics in social network analysis, especially from bipartite network. In unipartite network, communities are usually represented as sets of nodes within which connections are dense but between which connections are sparse. However, communities in unipartite networks are not suitable to bipartite network, because there is only one-to-one correspondence between communities of different types. In this study we propose an algorithm for detecting communities from bipartite network based on ant colony optimization. Present algorithm allows many-to-many correspondence between communities in different parts. Experimental results demonstrate that tour algorithm can extract multi-facet communities from bipartite networks and obtain high quality of community partitioning. © 2013 Asian Network for Scientific Information.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Combating NBTI-induced aging in data caches 13

Combating NBTI-induced aging in data caches

引用

23rd ACM International Conference of the Great Lakes Symposium on VLSI, GLSVLSI 2013

作者： Wang, Shuai Duan, Guangshan Zheng, Chuanlei Jin, Tao State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781450319027

The negative bias temperature instability (NBTI) in CMOS devices is one of most prominent sources of aging mechanisms, which can induce severe threats to the reliability of modern processors at deep submicron semiconductor technologies. Due to the unbalanced duty cycle ratio of the SRAM cells, the data cache suffers a heavy NBTI stress and this will further exacerbate the aging effect in the data cache. In this paper, an aging-aware design is proposed to combat the NBTI-induced aging in the data cache. First, the detailed lifetime behaviors of the cachelines in the data cache are studied. Then, different schemes are proposed to mitigate the negative aging effects by balancing the duty cycle ratio of the SRAM cells in the cachelines according to their different lifetime phases. By applying our proposed idle-time-based cacheline invalidation, early write-back, and bit-flipping schemes, the duty cycle ratio of the data cache can be well balanced. By adopting the drowsy scheme for invalidated cachelines, our design can also reduce the power consumption significantly, which will further optimize the thermal behavior and aging effect of data caches. © 2013 ACM.

关键词： Negative bias temperature instability

来源：评论

学校读者我要写书评

暂无评论

DroidAlarm: An all-sided static analysis tool for Android privilege-escalation malware 13

DroidAlarm: An all-sided static analysis tool for Android pr...

引用

8th ACM SIGSAC Symposium on Information, computer and Communications Security, ASIA CCS 2013

作者： Zhongyang, Yibing Xin, Zhi Mao, Bing Xie, Li State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781450317672

Since smartphones have stored diverse sensitive privacy information, including credit card and so on, a great deal of malware are desired to tamper them. As one of the most prevalent platforms, Android contains sensitive resources that can only be accessed via corresponding APIs, and the APIs can be invoked only when user has authorized permissions in the Android permission model. However, a novel threat called privilege escalation attack may bypass this watchdog. It's presented as that an application with less permissions can access sensitive resources through public interfaces of a more privileged application, which is especially useful for malware to hide sensitive functions by dispersing them into multiple programs. We explore privilege-escalation malware evolution techniques on samples from Android Malware Genome Project. And they have showed great effectiveness against a set of powerful antivirus tools provided by VirusTotal. The detection ratios present different and distinguished reduction, compared to an average 61% detection ratio before transformation. In order to conquer this threat model, we have developed a tool called DroidAlarm to conduct a full-spectrum analysis for identifying potential capability leaks and present concrete capability leak paths by static analysis on Android applications. And we can still alarm all these cases by exposing capability leak paths in them. © 2013 ACM.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Planning with multi-valued landmarks

Planning with multi-valued landmarks

引用

27th AAAI Conference on Artificial Intelligence, AAAI 2013

作者： Zhang, Lei Wang, Chong-Jun Wu, Jun Liu, Meilin Xie, Jun-Yuan State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University 210023 China

ISBN: (纸本)9781577356158

Landmark heuristics are perhaps the most accurate current known admissible heuristics for optimal planning. A disjunctive action landmark can be seen a form of at-least-one constraint on the actions it contains. In many domains, some critical propositions have to be established for a number of times. Propositional landmarks are too weak to express this kind of constraints. In this paper, we propose to generalize landmarks to multi-valued landmarks to represent the more general cardinality constraints. We present a class of local multi-valued landmarks that can be efficiently extracted from propositional landmarks. By encoding multi-valued landmarks into CNF formulas, we can also use SAT solvers to systematically extract multi-valued landmarks. Experiment evaluations show that multivalued landmark based heuristics are more close to h * and compete favorably with the state-of-the-art of admissible landmark heuristics on benchmark domains. Copyright © 2013, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：