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

10th IEEE International Conference on High Performance Computing and Communications

作者： Yuan E Zhang Yun-quan Sun Xiangzheng Lab. of Parallel Computing ISCAS 100190 China Graduate University of Chinese Academy of Sciences 100190 China State Key Lab. of Computer Science CAS 100190 China

ISBN: (纸本)9780769533520

Sparse Matrix-Vector Multiplication is an important computational kernel in scientific applications, and CSR storage algorithm often performs poorly on modern computer systems. But the register-level blocking algorithm can optimize memory hierarchy access, reduce memory access time, and then improve the performance. RAM (h) is a computation model that has h-level memory hierarchies. It indicates that different implementation forms of the same algorithm can have different memory access complexity. In this paper, we try to analyze memory access compelxity of two implementation forms of SpMV(which are CSR storage algorithm and register-level blocking algorithm) and to predict the performance of SpMV through combining the memory access complexity analysis and the data movement/floating point operation ratio analysis. The performance data of two forms and Statistical results of miss number of L1, L2 and TLB on Pentium IV platform are listed. Model analytical results matched well with experimental results.

关键词： SpMV sparse matrix-vector multiplication RAM (h) model memory access complexity

来源：评论

学校读者我要写书评

暂无评论

Hierarchical diffusion curves for accurate automatic image vectorization

Hierarchical diffusion curves for accurate automatic image v...

引用

作者： Xie, Guofu Sun, Xin Tong, Xin Nowrouzezahrai, Derek University of Montreal Canada Microsoft Research United States State Key Laboratory of Computer Science ISCAS China

Diffusion curve primitives are a compact and powerful representation for vector images. While several vector image authoring tools leverage these representations, automatically and accurately vectorizing arbitrary raster images using diffusion curves remains a difficult problem. We automatically generate sparse diffusion curve vectorizations of raster images by fitting curves in the Laplacian domain. Our approach is fast, combines Laplacian and bilaplacian diffusion curve representations, and generates a hierarchical representation that accurately reconstructs both vector art and natural images. The key idea of our method is to trace curves in the Laplacian domain, which captures both sharp and smooth image features, across scales, more robustly than previous image- and gradient-domain fitting strategies. The sparse set of curves generated by our method accurately reconstructs images and often closely matches tediously hand-authored curve data. Also, our hierarchical curves are readily usable in all existing editing frameworks. We validate our method on a broad class of images, including natural images, synthesized images with turbulent multi-scale details, and traditional vector-art, as well as illustrating simple multi-scale abstraction and color editing results. Copyright © ACM.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

An Uncertainty Enhanced Trust Evolution Strategy for e-science

引用

Journal of computer science & Technology 2010年第6期25卷 1225-1236页

作者：杜薇崔国华刘伟 School of Computer Science and Technology Huazhong University of Science and Technology College of Computer Science and Technology Wuhan University of Technology State Key Lab of Software Engineering Wuhan University State Key Laboratory for Novel Software Technology Nanjing University

Resources shared in e-science have critical requirements on *** subjective trust management is essential to guarantee users＇ collaborations and communications on such a promising *** an important nature of subjective trust,uncertainty should be preserved and exhibited in trust definition,representation and *** the drawbacks of existing mechanisms based on random mathematics and fuzzy theory,this paper designs an uncertainty enhanced trust evolution strategy based on cloud model *** define subjective trust as trust *** we propose new algorithms to propagate,aggregate and update ***,based on the concept of similar cloud,a method to assess trust level is put *** simulation results show the effiectiveness,rationality and efficiency of our proposed strategy.

关键词： cloud model theory similar cloud operator subjective trust trust cloud

来源：评论

学校读者我要写书评

暂无评论

Development of yellow-light TiO2 integrated photonics

引用

Optics Letters 2025年第11期50卷 3489-3492页

作者： Chen, Zequn Tang, Yiheng Wei, Maoliang Li, Xiaojing Sun, Boshu Wu, Yingchun Zou, Sishuo Huang, Ji Si, Ke Gong, Wei Lin, Hongtao Li, Lan Institute of Advanced Technology Westlake Institute for Advanced Study Hangzhou310024 China Zhejiang Key Laboratory of 3D Micro Nano Fabrication and Characterization School of Engineering Westlake University Hangzhou310030 China The State Key Lab of Brain-Machine Intelligence College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China MOE Frontier Science Center for Brain Science & Brain-Machine Integration Zhejiang University Hangzhou310027 China Nanhu Brain-Computer Interface Institute Hangzhou311100 China College of Optical Science and Engineering Zhejiang University Hangzhou310027 China Westlake Institute for Optoelectronics Fuyang Zhejiang Hangzhou311421 China

Visible-light photonic integrated circuits (PICs) are rapidly emerging as a crucial technology to overcome the scaling challenges in quantum information processing and biosensing. Titanium dioxide (TiO2), with its high transparency in the visible range, is regarded as a promising material for facilitating the development of high-performance visible-light integrated systems. In this paper, we introduce a series of passive TiO2 integrated devices, which include waveguides, multimode interferometers (MMIs), and thermo-optic switches (TOSs), monolithically integrated for the first time to our knowledge at a working wavelength of 589 nm. A propagation loss of 5.46 ± 0.17 dB/cm demonstrates a significant improvement over previous reports on yellow-light TiO2 waveguides. This study marks the first fabrication of a TOS operating at 589 nm, featuring a TiO2 core and polymer cladding. Notably, it achieves a power consumption (Pπ) of 8.24 mW, which represents a threefold reduction compared to silicon nitride-based TOSs operating in the visible spectrum. These results offer new insight into the design and fabrication of visible waveguide-integrated devices, paving the way for future emerging applications, such as quantum information, sensors, and biomedical science. © 2025 Optica Publishing Group. All rights, including for text and data mining (TDM), Artificial Intelligence (AI) training, and similar technologies, are reserved.

关键词： Titanium dioxide

来源：评论

学校读者我要写书评

暂无评论

Adaptive Perception for Unified Visual Multi-modal Object Tracking

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Hu, Xiantao Zhong, Bineng Liang, Qihua Shi, Liangtao Mo, Zhiyi Tai, Ying Yang, Jian Guangxi Normal University Guangxi Key Lab of Multi-Source Information Mining Guilin541004 China Guangxi Normal University Security Guilin541004 China Guangxi Normal University Intelligent Technology Guilin541004 China Guangxi Normal University Ministry of Education Guilin541004 China Wuzhou University School of Data Science Wuzhou543002 China Wuzhou University Software Engineering Wuzhou543002 China Nanjing University State Key Laboratory for Novel Software Technology Suzhou215163 China Nanjing University of Science and Technology School of Computer Science Nanjing210094 China Nanjing University of Science and Technology Engineering Nanjing210094 China

Recently, many multi-modal trackers prioritize RGB as the dominant modality, treating other modalities as auxiliary, and fine-tuning separately various multi-modal tasks. This imbalance in modality dependence limits the ability of methods to dynamically utilize complementary information from each modality in complex scenarios, making it challenging to fully perceive the advantages of multi-modal. As a result, a unified parameter model often underperforms in various multi-modal tracking tasks. To address this issue, we propose APTrack, a novel unified tracker designed for multi-modal adaptive perception. Unlike previous methods, APTrack explores a unified representation through an equal modeling strategy. This strategy allows the model to dynamically adapt to various modalities and tasks without requiring additional fine-tuning between different tasks. Moreover, our tracker integrates an adaptive modality interaction (AMI) module that efficiently bridges cross-modality interactions by generating learnable tokens. Experiments conducted on five diverse multi-modal datasets (RGBT234, LasHeR, VisEvent, DepthTrack, and VOT-RGBD2022) demonstrate that APTrack not only surpasses existing state-of-the-art unified multi-modal trackers but also outperforms trackers designed for specific multi-modal tasks. © 2020 IEEE.

关键词： Multicarrier modulation

来源：评论

学校读者我要写书评

暂无评论

A high order collaboration and real time formal model for automatic testing of safety critical systems

引用

Frontiers of computer science 2015年第4期9卷 495-510页

作者： Jianghua LV ShUong MA Xianjun LI Jiangong SONG State Key Lab of Software Development Environment School of Computer Science Beihang University Beijing 100191 China

The need for safety critical systems （SCS） is both important and urgent, and their evaluation and verification are test-dependent. SCS are usually complex and very large, so manual testing of SCS are infeasible in practice, and develop- ing automatic test approaches for SCS has become an impor- tant trend. This paper defines a formal semantics model for automatic test of SCS, called AutTMSCS, which describes behaviors in SCS testing. The model accommodates the high order collaboration in real time and temporariness of SCS testing. Testing tasks, test equipment and products under test are abstracted and architected in three layers, and a method for automatic testing is given. Based on extended label tran- sition system （LTS）, the convergency and correctness of the model are proved to demonstrate the computability of the model, indicating that the testing process of SCS can be au- tomatic.

关键词： safety critical systems （SCS） test automatictest equipment collaboration high order calculus LTS realtime

来源：评论

学校读者我要写书评

暂无评论

Adaptive foreground and shadow segmentation using hidden conditional random fields

引用

Journal of Zhejiang University-science A(Applied Physics & Engineering) 2007年第4期8卷 586-592页

作者： CHU Yi-ping YE Xiu-zi QIAN Jiang ZHANG Yin ZHANG San-yuan School of Computer Science State Key Lab. of CAD ＆ CG Zhejiang University Hangzhou 310027 China

Video object segmentation is important for video surveillance, object tracking, video object recognition and video editing. An adaptive video segmentation algorithm based on hidden conditional random fields (HCRFs) is proposed, which models spatio-temporal constraints of video sequence. In order to improve the segmentation quality, the weights of spatio-temporal con- straints are adaptively updated by on-line learning for HCRFs. Shadows are the factors affecting segmentation quality. To separate foreground objects from the shadows they cast, linear transform for Gaussian distribution of the background is adopted to model the shadow. The experimental results demonstrated that the error ratio of our algorithm is reduced by 23% and 19% respectively, compared with the Gaussian mixture model (GMM) and spatio-temporal Markov random fields (MRFs).

关键词： Video segmentation Shadow elimination Hidden conditional random fields （HCRFs） On-line learning

来源：评论

学校读者我要写书评

暂无评论

Light Space Cascaded Shadow Maps Algorithm for Real Time Rendering

引用

Journal of computer science & Technology 2011年第1期26卷 176-186页

作者：梁晓辉马上岑丽霞于卓 State Key Lab.of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang University

Owing to its generality and efficiency, Cascaded Shadow Maps （CSMs） has an important role in real-time shadow rendering in large scale and complex virtual environments. However, CSMs suffers from redundant rendering problem -- objects are rendered undesirably to different shadow map textures when view direction and light direction are not perpendicular. In this paper, we present a light space cascaded shadow maps algorithm. The algorithm splits a scene into non-intersecting layers in light space, and generates one shadow map for each layer through irregular frustum clipping and scene organization, ensuring that any shadow sample point never appears in multiple shadow maps. A succinct shadow determination method is given to choose the optimal shadow map when rendering scenes. We also combine the algorithm with stable cascaded shadow maps and soft shadow algorithm to avoid shadow flicking and produce soft shadows. The results show that the algorithm effectively improves the efficiency and shadow quality of CSMs by avoiding redundant rendering, and can produce high-quality shadow rendering in large scale dynamic environments with real-time performance.

关键词： shadow mapping light space redundant rendering large scale dynamic environments

来源：评论

学校读者我要写书评

暂无评论

Mesh parameterization based on edge collapse

引用

Journal of Zhejiang University-science A(Applied Physics & Engineering) 2009年第8期10卷 1153-1159页

作者： Jiang QIAN Xiu-zi YE Cui-hao FANG San-yuan ZHANG State Key Lab of CAD & CG School of Computer Science and Technology Zhejiang University Hangzhou 310027 China

Parameterizations that use mesh simplification to build the base domain always adopt the vertex removal *** paper applies edge collapse to constructing the base domain *** inducing the parameterization of the original mesh over the base domain,new algorithms map the new vertices in the simplified mesh back to the original one according to the edge transition sequence to integrate the *** present a direct way,namely edge classification,to deduce the *** results show that the new parameterization features considerable saving in computing complexity and maintains smoothness.

关键词： Edge collapse Vertex removal Mapping Edge classification

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：