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

1st Annual International computing and Combinatorics Conference, COCOON 1995

作者： Chan, Chi-Lok Young, Gilbert H. High Performance Computing Laboratory Department of Computer Science The Chinese University of Hong Kong ShatinNT Hong Kong

ISBN: (纸本)354060216X

The problem of single-vehicle scheduling with ready time and deadline constraints can be apphcable to many practical transportation problems. But the general case is a generalization of classical Traveling Salesman Problem and it is NP-hard. Psaraftis et al. [5] presented an O(n 2) algorithm for vehicle scheduling problems where the topological structure of sites are restricted to straight hne and there is no deadline for each site. They conjectured that this problem is NP-hard if each site has an arbitrary ready time and deadline (called time window). In this paper, we prove the conjecture and show that the decision versions of vehicle scheduling problems on a straight hne topology with time window are NP-complete for both path and tour versions. We also give an O(n 2) algorithm to solve a special case of this problem in which all sites have a common ready time. This algorithm is applicable to both path and tour versions. Keywords: deadline, NP-complete, optimal schedule, ready time, vehicle scheduling problem, time windows. © 1995, Springer-Verlag. All Rights Reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Parseval Frame Wavelet Multipliers in L^2(R^d)

引用

Chinese Annals of Mathematics,Series B 2012年第6期33卷 949-960页

作者： Zhongyan LI Xianliang SHI College of Mathematics and Computer Science Key Laboratory of High Performance Computing and Stochastic Information Processing(HPCSIP)Ministry of Education of ChinaHunan Normal Univer-sity Department of Mathematics and Physics North China Electric PowerUniversity

Let A be a d x d real expansive matrix. An A-dilation Parseval frame wavelet is a function φ E n2 （Rd）, such that the set {｜det A｜n/2φ（Ant -l）：n ∈ Z, l∈ Zd} forms a Parseval frame for L2 （Rd）. A measurable function f is called an A-dilation Parseval frame wavelet multiplier if the inverse Fourier transform of fφ is an A-dilation Parseval frame wavelet whenever φ is an A-dilation Parseval frame wavelet, where φ denotes the Fourier transform of φ. In this paper, the authors completely characterize all A-dilation Parseval frame wavelet multipliers for any integral expansive matrix A with ｜ det（A）｜= 2. As an application, the path-connectivity of the set of all A-dilation Parseval frame wavelets with a frame MRA in L2（Rd） is discussed.

关键词： Parseval frame wavelet Wavelet multiplier Frame multiresolutionanalysis

来源：评论

学校读者我要写书评

暂无评论

Stabilizing Residual Monomers within In Situ Polymerized Electrolytes for high-Voltage Lithium Metal Batteries

引用

Journal of the American Chemical Society 2025年 2025 May 16页

作者： Sun, Zejun Yang, Jinlin Wu, Yao Meng, Fanbin Niu, Yuxiang Xu, Hongfei Zhu, Yupeng Hong, Bolong Chen, Zhiyu Zhu, Jinlong He, Qian Wu, Gang Chen, Wei Department of Chemistry National University of Singapore 12 Science Drive 2 Singapore 117549 Singapore Department of Materials Science and Engineering National University of Singapore 9 Engineering Drive 1 Singapore 117575 Singapore Joint School National University of Singapore Tianjin University International Campus of Tianjin University Fuzhou 350207 China College of Semiconductors National Graduate College for Engineers Southern University of Science and Technology Shenzhen 518055 China Shenzhen Key Laboratory of Solid State Batteries Southern University of Science and Technology Shenzhen 518055 China Department of Chemistry Southern University of Science and Technology Shenzhen 518055 China Department of Physics Southern University of Science and Technology Shenzhen 518055 China Agency for Science Technology and Research Institute of High-Performance Computing 1 Fusionopolis Way #16-16 Connexis Singapore 138632 Singapore Department of Physics National University of Singapore 2 Science Drive 3 Singapore 117542 Singapore

Poly(1,3-dioxolane) (PDOL)-based electrolyte has gained wide attention due to its high compatibility with the lithium metal anode, intimate contact with electrodes, and high ionic conductivity. However, its application in high-voltage batteries is limited because the residual DOL monomers are prone to oxidation at high voltage. Here, we report that LiDFOB-initiated in situ polymerization stabilizes these residual monomers, thus overcoming the oxidation-related limitations of PDOL-based electrolytes. This approach promotes the formation of a thermodynamically stable Li⁺-DOL-DFOB^- solvation structure and DOL-PDOL clusters, reducing the oxidative decomposition of the residual DOL monomers and extending the electrochemical stability window up to 5.0 V vs Li⁺/Li. It also enhances ionic conductivity (4.39 mS cm^-1), and facilitates the formation of a uniform, F-rich cathode-electrolyte interphase. Electrochemical tests and computational simulations reveal that the reduced Li⁺-PDOL interactions in the designed PDOL promote higher ionic mobility and electrochemical stability. Consequently, Li||LiCoO₂ cells using the designed PDOL exhibit remarkable cycling performance, maintaining 80% capacity retention over 760 cycles at a cut-off voltage of 4.35 V. These findings establish PDOL as a transformative electrolyte for high-voltage lithium metal batteries. © 2025 American Chemical Society.

关键词： Electropolymerization

来源：评论

学校读者我要写书评

暂无评论

Efficient runtime thread management for the nano-threads programming model 12th

引用

10 Workshops held in conjunction with 12th International Parallel Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998

作者： Nikolopoulos, Dimitrios S. Polychronopoulos, Eleftherios D. Papatheodorou, Theodore S. High Performance Computing Architectures Laboratory Department of Computer Engineering and Informatics University of Patras Rio Patras26500 Greece

ISBN: (纸本)3540643591

The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelism from standard applications. A prerequisite for the applicability of the nano-threads programming model is the ability of the runtime environment to manage parallelism at any level of granularity with minimal overheads. In this paper, we introduce runtime techniques for efficient memory management and user-level scheduling in an experimental runtime system designed to support the nano-threads programming model. We evaluate the exploitation of processor affinity for the management of nano-thread contexts, and the use of hierarchical queues to implement user-level scheduling strategies for applications with inherent multilevel parallelism. The proposed mechanisms attempt to obtain maximum benefits from data locality on cache-coherent NUMA multip'rocessors. Through the use of synthetic benchmarks, we find that our mechanism for memory management in the runtime system reduces overheads by 52% on average, compared to other known mechanisms. The use of hierarchical queues gives significant performance improvements between 17% and 40%, compared to scheduling strategies that use local queues. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Multiprogramming

来源：评论

学校读者我要写书评

暂无评论

On the Eigenvalues of General Sum-Connectivity Laplacian Matrix

引用

Journal of the Operations Research Society of China 2013年第3期1卷 347-358页

作者： Hanyuan Deng He Huang Jie Zhang College of Mathematics and Computer Science Key Laboratory of High Performance Computing and Stochastic Information Processing(HPCSIP)(Ministry of Education of China)Hunan Normal UniversityChangshaHunan 410081China Computer Science Department Aarhus UniversityAarhusDenmark

The connectivity index was introduced by Randi´c(***.97(23):6609–6615,1975)and was generalized by Bollobás and Erdös(Ars Comb.50:225–233,1998).It studies the branching property of graphs,and has been applied to studying network *** this paper we focus on the general sum-connectivity index which is a variant of the connectivity *** characterize the tight upper and lower bounds of the largest eigenvalue of the general sum-connectivity matrix,as well as its spectral *** show the corresponding extremal *** addition,we show that the general sum-connectivity index is determined by the eigenvalues of the general sum-connectivity Laplacian matrix.

关键词： Connectivity index Eigenvalue Laplacian matrix

来源：评论

学校读者我要写书评

暂无评论

Enhancing the performance of autoscheduling in Distributed Shared Memory multiprocessors

引用

4th International Conference on Parallel Processing, Euro-Par 1998

ISBN: (纸本)3540649522

Autoscheduling is a parallel program compilation and execution model that combines uniquely three features: Automatic extraction of loop and functional parallelism at any level of granularity, dynamic scheduling of parallel tasks, and dynamic program adaptability on multi-programmed shared memory multiprocessors. This paper presents a technique that enhances the performance of autoscheduling in Distributed Shared Memory (DSM) multiprocessors, targetting mainly at medium and large scale systems, where poor data locality and excessive communication impose performance bottlenecks. Our technique partitions the application Hierarchical Task Graph and maps the derived partitions to clusters of processors in the DSM architecture. Autoscheduling is then applied separately for each partition to enhance data locality and reduce communication costs. Our experimental results show that partitioning achieves remarkable performance improvements compared to a standard autoscheduling environment and a commercial parallelizing compiler.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Green supercomputing comes of age

引用

IT Professional 2008年第1期10卷 17-23页

作者： Feng, Wu-Chun Feng, Xizhou Ge, Rong Department of Computer Science and Electrical and Computer Engineering Virginia Tech. Network Dynamics and Simulation Science Laboratory Virginia Tech. Center for High-End Computing Systems Virginia Tech.

Energy-efficient (green) supercomputing has evolved to improve system reliability and provide better availability and productivity. Green Destiny supercomputing system is a Linux-based cluster that uses low-power components whose performance could be optimized for supercomputing. Low-power supercomputing focuses on energy efficiency at system integration time, selects low-power chips as the building blocks for power reduction and system reliability, and achieves better performance by scaling up to a larger number of processors. Researchers have implemented various power-aware software prototypes for commodity supercomputing starting with cluster of high-performance, high-power processors that support mechanism called dynamic voltage and frequency scaling (DVFS). Various approaches for parallel supercomputing nodes are studied by aiming execution phases that are not on the critical execution path.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Models of parallel computation :a survey and classification

引用

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

Designing topology-aware collective communication algorithms for large scale InfiniBand clusters: Case studies with Scatter and Gather

Designing topology-aware collective communication algorithms...

引用

2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

作者： Kandalla, Krishna Subramoni, Hari Vishnu, Abhinav Panda, Dhabaleswar K. Department of Computer Science and Engineering Ohio State University United States Pacific Northwest National Laboratory High Performance Computing Group United States

ISBN: (纸本)9781424465347

Modern high performance computing systems are being increasingly deployed in a hierarchical fashion with multi-core computing platforms forming the base of the hierarchy. These systems are usually comprised of multiple racks, with each rack consisting of a finite number of chassis, and each chassis having multiple compute nodes or blades, based on multi-core archi- tectures. The networks are also hierarchical with mul- tiple levels of switches. Message exchange operations between processes that belong to different racks involve multiple hops across different switches and this directly affects the performance of collective operations. In this paper, we take on the challenges involved in detecting the topology of large scale InfiniBand clusters and leveraging this knowledge to design efficient topology-aware algorithms for collective operations. We also propose a communication model to analyze the communication costs involved in collective operations on large scale supercomputing systems. We have analyzed the performance characteristics of two collectives, MPI Gather and MPI Scatter, on such systems and we have proposed topology-aware algorithms for these operations. Our experimental results have shown that the proposed algorithms can improve the performance of these collective operations by almost 54% at the micro-benchmark level. © 2010 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：