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

2003 ACM/IEEE Conference on Supercomputing, SC 2003

作者： Wang, Kai Zhang, Jun Shen, Chi Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky Lexington KY 40506-0046 United States

ISBN: (纸本)1581136951

We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for solving difficult problems. Forward and backward preconditioning iteration and two Schur complement preconditioning strategies are proposed to improve the performance and to reduce the storage cost of the multilevel preconditioners. One version of the parallel multilevel SAI preconditioner based on the MSP strategy is implemented. Numerical experiments for solving a few sparse matrices on a distributed memory parallel computer are reported. © 2003 ACM.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Addressing accuracy issues in privacy preserving data mining through matrix factorization

Addressing accuracy issues in privacy preserving data mining...

引用

ISI 2007: 2007 IEEE Intelligence and Security Informatics

作者： Wang, Jie Zhang, Jun Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Sciences University of Kentucky Lexington KY 40506-0046 United States

ISBN: (纸本)1424413303

Maintaining data mining accuracy on distorted datasets is an important issue in privacy preserving data mining. Using matrix approximation, we propose several efficient and flexible techniques to address this issue, and utilize unique characteristics of matrix factorization to maintain data pattern. We use the support vector machine classification to compare accuracy maintenance after data distortion by different methods. With better performance than some classical data perturbation approaches, nonnegative matrix factorization and singular value decomposition are considered to be promising techniques for privacy preserving data mining Experimental results demonstrate that mining accuracy on the distorted data used these methods is almost as good as that on the original data, with added property of privacy preservation. It indicates that the matrix factorization-based data distortion schemes perturb only confidential attributes to meet privacy requirements while preserving general data pattern for knowledge extraction. © 2007 IEEE.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Path problems in temporal graphs 40th

Path problems in temporal graphs

引用

Proceedings of the 40th International Conference on Very Large Data Bases, VLDB 2014

作者： Wu, Huanhuan Cheng, James Huang, Silu Ke, Yiping Lu, Yi Xu, Yanyan Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Institute of High Performance Computing Singapore

Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various concepts of "shortest" path for temporal graphs. computing these temporal paths is challenging as subpaths of a "shortest" path may not be "shortest" in a temporal graph. We investigate properties of the temporal paths and propose efficient algorithms to compute them. We tested our algorithms on real world temporal graphs to verify their efficiency, and also show that temporal paths are essential for studying temporal graphs by comparing shortest paths in normal static graphs. © 2014 VLDB Endowment.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Towards a performance-portable fft library for heterogeneous computing 14

Towards a performance-portable fft library for heterogeneous...

引用

11th ACM International Conference on computing Frontiers, CF 2014

作者： Del Mundo, Carlo Feng, Wu-Chun NSF Center for High-Performance Reconfigurable Computing Department of Electrical and Computer Engineering United States Department of Computer Science Blacksburg VA United States

ISBN: (纸本)9781450328708

The fast Fourier transform (FFT), a spectral method that computes the discrete Fourier transform and its inverse, per-vades many applications in digital signal processing, such as imaging, tomography, and software-dened radio. Its impor-tance has caused the research community to expend signi-cant resources to accelerate the FFT, of which FFTW is the most prominent example. With the emergence of the graph-ics processing unit (GPU) as a massively parallel computing device for high performance, we seek to identify architecture-aware optimizations across two different generations of high-end AMD and NVIDIA GPUs, namely the AMD Radeon HD 6970 and HD 7970 and the NVIDIA Tesla C2075 and K20c, respectively, to accelerate FFT performance. Despite architectural differences across GPU generations and vendors, we identify the following optimizations, when applied individually and in isolation of one another, as be-ing the most effective in accelerating FFT performance: (1) register preloading, (2) transposition via local memory, and (3) 8-or 16-byte vector access and scalar arithmetic. We then demonstrate the effcacy of combining individual opti-mizations together and nd that the most effective combi-nation of optimizations across all architectures encompasses register preloading, transposition via local memory, and use of constant memory. Our study suggests that FFT per-formance on GPUs is primarily limited by global memory data transfer. Overall, our optimizations deliver speed-ups as high as 31.5 over a baseline GPU implementation and 9.1 over a multithreaded FFTW CPU implementation with AVX vector extensions. © is held by the owner/authors.

关键词： Digital radio

来源：评论

学校读者我要写书评

暂无评论

How can network coding help P2P content distribution?

How can network coding help P2P content distribution?

引用

2009 IEEE International Conference on Communications, ICC 2009

作者： Ma, Guanjun Xu, Yinlong Kaiqian, Ou Wen, Luo Department of Computer Science and Technology University of Science and Technology of China Key Laboratory on High Performance Computing Anhui Province China

ISBN: (纸本)9781424434350

It is well known that network coding can enhance the performance of Peer-to-Peer (P2P) content distribution systems since it benefits block scheduling. In this paper, we introduce our P2P content distribution system "SmartCode" with sparse network coding on PlanetLab. SmartCode uses pre-checking to avoid linearly dependent blocks being transmitted. Under the same system architecture, we also implement two systems "Ecode" and "LRF". Ecode is also based on sparse network coding, but without pre-checking. LRF is BitTorrent-like, using local-rarest-first for block scheduling. We conduct extensive experiments to compare the performances among the three systems. Experimental results show that the distributing time of SmartCode is reduced by 11% on average and up to 19% compared with LRF, and by 7% on average and up to 16% compared with Ecode. We also conduct experiments to analyze robustness among the three systems under the assumption that peers join in and leave a content distribution session dynamically and the seed leave the session after it has transmitted a fixed percentage of blocks over the total blocks of the content. In dynamical cases, SmartCode outperforms evidently than Ecode and LRF in downloading time and the times of peers completing the downloading. ©2009 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Dasher: A peer-to-peer content distribution system based on combined network coding

Dasher: A peer-to-peer content distribution system based on ...

引用

2009 2nd IEEE International Conference on Broadband Network and Multimedia Technology, IEEE IC-BNMT2009

作者： Kaiqian, Ou Yinlong, Xu Guanjun, Ma Yulin, Zhu Department of Computer Science and Technology University of Science and Technology of China Key Laboratory on High Performance Computing Anhui Province China

ISBN: (纸本)9781424450053

Network coding can ease the block scheduling and thus makes the distribution more efficient. However, the complexities of encoding and decoding increase sharply as the content size scales up. In this paper, we propose a coding scheme which combines chunked coding and sparse linear network coding to reduce both encoding and decoding costs of content distribution. Based on the combined scheme, we implement a P2P content distribution system, named Dasher, where Local-Rarest-First scheme is adopted for chunk scheduling. Under the same system architecture, we implement three comparative systems, a BitTorrent-like system, named Mybt, a system only with sparse coding, named Sparser and a system using chunked coding, named Chunker. We conduct extensive experiments to compare the performance among these four systems. The experimental results show that Dasher with certain chunk sizes can reduce the average downloading time up to 15% compared with Mybt, and up to 43% with Chunker. With proper chunk sizes, the downloading time of Dasher is almost the same with Sparser. The average decoding rate of Dasher is the same with Chunker, and is nearly m times as fast as Sparser, where m is the number of chunks. Moreover, with respect to robustness, Dasher performs almost as well as Chunker, better than Mybt, but worse than Sparser. ©2009 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Lexicographically fair bandwidth allocation in multi-session layered media multicast using network coding

Lexicographically fair bandwidth allocation in multi-session...

引用

2009 2nd IEEE International Conference on Broadband Network and Multimedia Technology, IEEE IC-BNMT2009

作者： Xiaobin, Lin Yinlong, Xu Yulin, Zhu Kaiqian, Ou Department of Computer Science and Technology University of Science and Technology of China Key Laboratory on High Performance Computing Anhui Province China

ISBN: (纸本)9781424450053

Layering techniques effectively cope with network heterogeneity encountered in media distribution. Recent work on network coding shows that the multicast throughput can be greatly improved by allowing coding operation at the intermediate nodes in the network. In this paper, we study the problem of lexicographically fair bandwidth allocation to make the receivers of different sessions share network bandwidth fairly in multi-session layered media multicast using network coding and formulate it into an integer linear programming (ILP). Because the ILP is not time efficient when the network is large, a LP-based polynomial time algorithm ApprOpt is proposed to approximate the optimal solution of the ILP. Numerical results show that the throughput of all media multicast sessions is significantly improved by network coding, and that algorithm ApprOpt allocates network bandwidth very close to the optimal solution of the ILP and utilizes network bandwidth efficiently. ©2009 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

A scalable inline cluster deduplication framework for big data protection

A scalable inline cluster deduplication framework for big da...

引用

13th ACM/IFIP/USENIX International Middleware Conference, Middleware 2012

作者： Fu, Yinjin Jiang, Hong Xiao, Nong State Key Laboratory of High Performance Computing National University of Defense Technology China Department of Computer Science and Engineering University of Nebraska-Lincoln United States

ISBN: (纸本)9783642351693

Cluster deduplication has become a widely deployed technology in data protection services for Big Data to satisfy the requirements of service level agreement (SLA). However, it remains a great challenge for cluster deduplication to strike a sensible tradeoff between the conflicting goals of scalable deduplication throughput and high duplicate elimination ratio in cluster systems with low-end individual secondary storage nodes. We propose ?-Dedupe, a scalable inline cluster deduplication framework, as a middleware deployable in cloud data centers, to meet this challenge by exploiting data similarity and locality to optimize cluster deduplication in inter-node and intra-node scenarios, respectively. Governed by a similarity-based stateful data routing scheme, ?-Dedupe assigns similar data to the same backup server at the super-chunk granularity using a handprinting technique to maintain high cluster-deduplication efficiency without cross-node deduplication, and balances the workload of servers from backup clients. Meanwhile, ?-Dedupe builds a similarity index over the traditional locality-preserved caching design to alleviate the chunk index-lookup bottleneck in each node. Extensive evaluation of our ?-Dedupe prototype against state-of-the-art schemes, driven by real-world datasets, demonstrates that -Dedupe achieves a cluster-wide duplicate elimination ratio almost as high as the high-overhead and poorly scalable traditional stateful routing scheme but at an overhead only slightly higher than that of the scalable but low duplicate-elimination-ratio stateless routing approaches. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Vision transformer-based stratification of pre/diabetic and pre/hypertensive patients from retinal photographs for 3PM applications

引用

EPMA Journal 2025年 1-15页

作者： Pushpanathan, Krithi Bai, Yang Lei, Xiaofeng Goh, Jocelyn Hui Lin Xue, Can Can Yew, Samantha Min Er Chee, Miaoli Quek, Ten Cheer Peng, Qingsheng Soh, Zhi Da Yu, Marco Chak Yan Zhou, Jun Wang, Yaxing Jonas, Jost B. Wang, Xiaofei Sim, Xueling Tai, E. Shyong Sabanayagam, Charumathi Goh, Rick Siow Mong Liu, Yong Cheng, Ching-Yu Tham, Yih-Chung Department of Ophthalmology Yong Loo Lin School of Medicine National University of Singapore Singapore Singapore Centre for Innovation and Precision Eye Health Yong Loo Lin School of Medicine National University of Singapore Singapore Singapore Institute of High Performance Computing (IHPC) Agency for Science Technology and Research (A*STAR) Singapore Singapore Singapore Eye Research Institute Singapore National Eye Centre Singapore Singapore Ophthalmology & Visual Sciences Academic Clinical Programme (EYE ACP) Duke-NUS Medical School Singapore Singapore Ophthalmology and Visual Science Key Lab Beijing Institute of Ophthalmology Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University BeijingBeijing China Rothschild Foundation Hospital Institut Français de Myopie Paris France Key Laboratory of Biomechanics and Mechanobiology Ministry of Education Beijing Advanced Innovation Center for Biomedical Engineering School of Biological Science and Medical Engineering Beihang University Beijing China Saw Swee Hock School of Public Health National University of Singaporeand National University Health System Singapore Singapore Duke-NUS Medical School Singapore Singapore Precision Health Research Singapore Singapore Department of Medicine Yong Loo Lin School of Medicine National University of Singapore Singapore Singapore

Objective: Diabetes and hypertension pose significant health risks, especially when poorly managed. Retinal evaluation though fundus photography can provide non-invasive assessment of these diseases, yet prior studies focused on disease presence, overlooking control statuses. This study evaluated vision transformer (ViT)-based models for assessing the presence and control statuses of diabetes and hypertension from retinal images. Methods: ViT-based models with ResNet-50 for patch projection were trained on images from the UK Biobank (n = 113,713) and Singapore Epidemiology of Eye Diseases study (n = 17,783), and externally validated on the Singapore Prospective Study Programme (n = 7,793) and the Beijing Eye Study (n = 6064). Model performance was evaluated using the area under the receiver operating characteristic curve (AUROC) for multiple tasks: detecting disease, identifying poorly controlled and well-controlled cases, distinguishing between poorly and well-controlled cases, and detecting pre-diabetes or pre-hypertension. Results: The models demonstrated strong performance in detecting disease presence, with AUROC values of 0.820 for diabetes and 0.781 for hypertension in internal testing. External validation showed AUROCs ranging from 0.635 to 0.755 for diabetes, and 0.727 to 0.832 for hypertension. For identifying poorly controlled cases, the performance remained high with AUROCs of 0.871 (internal) and 0.655–0.851 (external) for diabetes, and 0.853 (internal) and 0.792–0.915 (external) for hypertension. Detection of well-controlled cases also yielded promising results for diabetes (0.802 [internal];0.675–0.838 [external]), and hypertension (0.740 [internal] and 0.675–0.807 [external]). In distinguishing between poorly and well-controlled disease, AUROCs were more modest with 0.630 (internal) and 0.512–0.547 (external) for diabetes, and 0.651 (internal) and 0.639–0.683 (external) for hypertension. For pre-disease detection, the models achieved AUROCs of 0.746

关键词： Deep learning Diabetes Health risk assessment Hypertension Improved individual outcomes Innovative screening programs Opportunistic screening Predictive Preventive Personalized Medicine (PPPM / 3PM) Preventable diseases Protection against health-to-disease transition Retinal image Risk stratification

来源：评论

学校读者我要写书评

暂无评论

RATC: A robust topology control algorithm for heterogeneous wireless sensor networks

RATC: A robust topology control algorithm for heterogeneous ...

引用

2009 4th International Design and Test Workshop, IDT 2009

作者： Nickray, Mohsen Afzali-Kusha, Ali Low-Power High-Performance Nanosystems Laboratory Department of Electrical and Computer Engineering University of Tehran Iran

ISBN: (纸本)9781424457489

In this paper a robust distributed and localized algorithm is presented that sensors incrementally adjusts their transmission range by collaborating with other neighbors. Normally, WSNs are set up in adverse environmental conditions, so robustness is one of the most important objectives of the WSN algorithms. This paper addresses the problem of power control in a heterogeneous wireless network which containing nodes with different transmission ranges. Our algorithm results an asymmetric network topology which not only increases network life time by reducing transmission power, and preserves the reachability, and reduces traffic interference by having low average node degrees but also is more tolerable on packet losses comparison with similar algorithms. In scenarios with high packet loss, algorithm will operate correctly but not with maximum efficiency. Finally, the algorithm will evaluate and compare with similar works using simulation. ©2009 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：