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

11th Annual International Symposium on Algorithms and Computation, ISAAC 2000

作者： Lu, Chin Lung Peng, Sheng-Lung Tang, Chuan Yi National Center for High-Performance Computing P.O. Box 19-136 Hsinchu300 Taiwan Department of Computer Science and Information Engineering National Dong Hwa University Hualien Taiwan Department of Computer Science National Tsing Hua University Hsinchu300 Taiwan

ISBN: (纸本)3540412557

We show that the efficient minus (resp., signed) domination problem is NP-complete for chordal graphs, chordal bipartite graphs, planar bipartite graphs and planar graphs of maximum degree 4 (resp., for chordal graphs). Based on the forcing property on blocks of vertices and automata theory, we provide a uniform approach to show that in a special class of interval graphs, every graph (resp., every graph with no vertex of odd degree) has an efficient minus (resp., signed) dominating function. Besides, we show that the efficient minus domination problem is equivalent to the efficient domination problem on trees. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Measuring the effect of intervening early for academically at risk students in a CS1 course

Measuring the effect of intervening early for academically a...

引用

2010 ASEE Annual Conference and Exposition

作者： Punch, William Enbody, Richard McDonough, Colleen Sticklen, Jon Department of Computer Science Michigan State's High Performance Computing Center Michigan State University United States Department of Computer Science and Engineering Michigan State University United States College of Engineering Michigan State University United States Center for Engineering Education Research Michigan State University United States

We recently converted a CS1 (Introduction to computing) class to use the Python language in place of C++. Among other reasons, we hoped that the new language would help students who typically struggled with the course. Our typical drop+fail rate was around 25%-30% for C++, and we hoped the conversion would reduce this number. Though it did reduce slightly, 15%-25%, it was not as significant as we had hoped. We therefore tried an early intervention strategy to help those students whom we could identify as struggling. We provided extra tutoring for only those students. We then calculated statistics on the effects this extra tutoring. The results were not good: we found no significant difference between the group of students who used the tutoring and those that did not. We review some of the potential reasons for this result. © American Society for engineering Education, 2010.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

An efficient group communication architecture over ATM networks

An efficient group communication architecture over ATM netwo...

引用

Heterogeneous computing Workshop

作者： Sung-Yong Park Joohan Lee S. Hariri High Performance Distributed Computing Laboratory Department of Electrical Engineering and Computer Science Syracuse University Syracuse NY USA

NYNET (ATM wide-area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing tool developed at Syracuse University that provides low-latency and high-throughput communication services over Asynchronous Transfer Mode (ATM)-based high-performance distributed computing (HPDC) environments. NCS provides flexible and scalable group communication services based on dynamic grouping and tree-based multicasting. The NCS architecture, which separates the data and control functions, allows group operations to be implemented efficiently by utilizing the control connections when transferring status information (e.g. topology information, routing information). Furthermore, NCS provides several different algorithms for group communication and allows programmers to select an appropriate algorithm at runtime. The authors overview the general architecture of NCS and present the multicasting services provided by NCS. They analyze and compare the performance of NCS with that of other message-passing tools such as p4, PVM, and MPI in terms of primitive performance and performance.

关键词： Asynchronous transfer mode computer architecture Communication system control Multicast algorithms System testing Distributed computing Topology Routing Programming profession Runtime

来源：评论

学校读者我要写书评

暂无评论

Incorporate Proactive Data Protection in ZFS Towards Reliable Storage Systems

Incorporate Proactive Data Protection in ZFS Towards Reliabl...

引用

IEEE International Symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Zhi Qiao Jacob Hochstetler Shuwen Liang Song Fu Hsing-bung Chen Bradley Settlemyer Department of Computer Science and Engineering University of North Texas High Performance Computing Division Los Alamos National Laboratory

ISBN: (纸本)9781538675199

Disk drive failure related data lost remains a major threat to storage system reliability. Current counter-measurement all focused on reactive data protection, such as using RAID or erasure coding to reconstruct data after failure occurs. We argue that post-failure recovery will not scalable when the storage demand keep increase. In this paper, we present a proactive data protection (PDP) framework within the ZFS file system to rescue data from disks before actual failure onset. By reducing the risk of data loss and mitigating the prolonged disk rebuilds caused by disk failures, PDP is designed to enhance the overall storage reliability. We extensively evaluate the recovery performance of ZFS with diverse configurations, and further explore disk failure prediction techniques to develop a proactive data protection mechanism in ZFS. We further compare the performance of different data protection strategies, including post-failure disk recovery, proactive disk cloning, and proactive data recovery. We propose an analytic model that uses storage utilization and contextual system information to select the best data protection strategy that can save up to 70% of data rescue time.

关键词： Data protection Reliability Disk drives Arrays Random access memory Throughput Software

来源：评论

学校读者我要写书评

暂无评论

Graph visualization for the analysis of the structure and dynamics of extreme-scale supercomputers

引用

Information Visualization 1997年第3期3卷 209-222页

作者： Summers, Kenneth L. Caudell, Thomas Preston Berkbigler, Kathryn Bush, Brian Davis, Kei Smith, Steve Center for High Performance Computing University of New Mexico Albuquerque NM United States Department of Electrical & Computer Engineering University of New Mexico Albuquerque NM United States Los Alamos National Laboratory Los Alamos NM United States

We are exploring the development and application of information visualization techniques for the analysis of new massively parallel supercomputer architectures. Modern supercomputers typically comprise very large clusters of commodity SMPs interconnected by possibly dense and often non-standard networks. The scale, complexity, and inherent non-locality of the structure and dynamics of this hardware, and the operating systems and applications distributed over them, challenge traditional analysis methods. As part of the á la carte (A Los Alamos computer Architecture Toolkit for Extreme-Scale Architecture Simulation) team at Los Alamos National laboratory, who are simulating these new architectures, we are exploring advanced visualization techniques and creating tools to enhance analysis of these simulations with intuitive three-dimensional representations and interfaces. This work complements existing and emerging algorithmic analysis tools. In this paper, we give background on the problem domain, a description of a prototypical computer architecture of interest (on the order of 10,000 processors connected by a quaternary fat-tree communications network), and a presentation of three classes of visualizations that clearly display the switching fabric and the flow of information in the interconnecting network. © 2004, SAGE Publications. All rights reserved.

关键词： graph visualization scalable representations virtual environments

来源：评论

学校读者我要写书评

暂无评论

AsT: An Asymmetric-Sensitive Transformer for Osteonecrosis of the Femoral Head Detection 37

AsT: An Asymmetric-Sensitive Transformer for Osteonecrosis o...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Chen, Haoyang Liu, Shuai Lu, Feng Li, Wei Sheng, Bin Li, Mi Jin, Hai Zomaya, Albert Y. National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Computer Science The University of Sydney Australia Department of Computer Science and Engineering Shanghai Jiao Tong University China Tongji Hospital Tongji Medical College Huazhong University of Science and Technology China

ISBN: (纸本)9781577358800

Early diagnosis of osteonecrosis of the femoral head (ONFH) can inhibit the progression and improve femoral head preservation. The radiograph difference between early ONFH and healthy ones is not apparent to the naked eye. It is also hard to produce a large dataset to train the classification model. In this paper, we propose Asymmetric-Sensitive Transformer (AsT) to capture the uneven development of the bilateral femoral head to enable robust ONFH detection. Our ONFH detection is realized using the self-attention mechanism to femoral head regions while conferring sensitivity to the uneven development by the attention-shared transformer. The real-world experiment studies show that AsT achieves the best performance of AUC 0.9313 in the early diagnosis of ONFH and can find out misdiagnosis cases firmly. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Identification of Key Genes as Potential Drug Targets for Gastric Cancer

引用

Tsinghua science and Technology 2023年第4期28卷 649-664页

作者： Md.Tofazzal Hossain Md.Selim Reza Yin Peng Shengzhong Feng Yanjie Wei Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis TechnologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Statistics Bangabandhu Sheikh Mujibur Rahman Science and Technology UniversityGopalganj 8100Bangladesh Guangdong Provincial Key Laboratory for Genome Stability and Disease Prevention and Regional Immunity and Diseases Department of PathologyShenzhen UniversityShenzhen 518060China

Gastric cancer(GC)is one of the most common cancers and ranks the third in cancer mortality all over the *** goal of this study was to identify potential hub-genes,highlighting their functions,signaling pathways,and candidate drugs for the treatment of GC *** used publicly available next generation sequencing(NGS)data to identify differentially expressed(DE)*** top DE genes were mapped to STRING database to construct the protein-protein interaction(PPI)network and top hub genes were selected for further *** found a total of 1555 DE genes with 870 upregulated and 685 downregulated genes in *** selected the top 400(200 upregulated and 200 downregulated)genes to construct a PPI network and extracted the top 15 hub *** gene ontology(GO)term and kyoto encyclopedia of genes and genomes(KEGG)pathway enrichment analyses of the 15 hub genes exposed some important functions and signaling pathways that were significantly associated with GC *** survival analysis of the hub genes disclosed that the lower expressions of the three hub genes CDH2,COL4A1,and COL5A2 were associated with better survival of GC *** three genes might be the candidate biomarkers for the diagnosis and treatment of ***,we considered 3 key proteins(genomic biomarkers)(COL4A1,CDH2,and CO5A2)as the drug target proteins(receptors),performed their docking analysis with the 102 meta-drug agents,and found Everolimus,Docetaxel,Lanreotide,Venetoclax,Temsirolimus,and Nilotinib as the top ranked 6 candidate drugs with respect to our proposed target proteins for the treatment against GC ***,the proposed drugs might play vital role for the treatment against GC patients.

关键词： gastric cancer hub genes candidate genes molecular docking candidate drugs

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel loop self-scheduling on grid environments

引用

IFIP International Conference on Network and Parallel computing, NPC 2004

作者： Yang, Chao-Tung Cheng, Kuan-Wei Li, Kuan-Ching High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Shalu Taichung433 Taiwan

ISBN: (纸本)3540233881

The approaches to deal with scheduling and load balancing on PC-based cluster systems are famous and well-known. Self-scheduling schemes, which are suitable for parallel loops with independent iterations on cluster computer system, they have been designed in the past. In this paper, we propose a new scheme that can adjust the scheduling parameter dynamically on an extremely heterogeneous PC-based cluster and grid computing environments in order to improve system performance. A grid computing environment consists of multiple PC-based clusters is constructed using Globus Toolkit and SUN Grid Engine middleware. The experimental results show that our scheduling can result in higher performance than other similar schemes. © IFIP International Federation for Information Processing 2004.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

FlyDB: Query Optimization of Blockchain System Based on Hybrid Storage Architecture 4

FlyDB: Query Optimization of Blockchain System Based on Hybr...

引用

4th International Seminar on Artificial Intelligence, Networking and Information Technology, AINIT 2023

作者： Liu, Yang Xie, Zehui Xiao, Nong Chen, Zhiguang Ou, Yang Institute for Quantum Information and State Key Laboratory of High-Performance Computing College of Computer National University of Defense Technology Changsha China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9798350314526

The hybrid storage architecture incorporates a blockchain dual-index structure optimized for byte addressing in non-volatile memory, low-latency features, and the large capacity of SSD. This paper presents a novel LSM-Tree architecture that leverages the byte-Addressing characteristics of non-volatile memory. The layers of the level0 and level1 are stored in non-volatile memory while employing a local key-value separation strategy to minimize read and write operations during compaction. A logic compression strategy is proposed to handle data compression tasks efficiently. A dual-index structure design is introduced for users to address the scope and multi-keyword queries in the blockchain system. During the compression process, keyword switching occurs during data reordering, ensuring that data within the same SSTable is rearranged according to user preferences. By effectively harnessing the advantages of each level in the hybrid storage architecture, this design significantly reduces both databases write time and the response time for complex queries. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A probabilistic model for the evaluation of fault-tolerant multiprocessor systems using concurrent error detection

A probabilistic model for the evaluation of fault-tolerant m...

引用

Advanced Signal Processing Algorithms, Architectures, and Implementations 1990

作者： Nair, V.S.S. Abraham, J.A. Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois at Urbana-Champaign UrbanaIL61801 United States Computer Engineering Research Center University of Texas at Austin AustinTX78758 United States

The analysis of fault-tolerant multiprocessor systems that use concurrent error detection (CED) schemes is much more difficult than the analysis of conventional fault-tolerant architectures. Various analytical techniques have been proposed to evaluate CED schemes deterministically. However, these approaches are based on the worst-case assumptions related to the failure of system components. Often, the evaluation results are not good measures for comparing the fault tolerance capabilities of a system. In this paper, we develop a probabilistic approach to evaluate and compare fault-tolerant multiprocessor systems. Various probabilities associated with CED schemes are identified and used in the framework of the matrix-based model which we had proposed previously. Based on these probabilistic matrices, we analytically derive estimates for the fault tolerance capabilities of various systems. © 1990 SPIE. All rights reserved.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：