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

Prediction of key pathways in hepatocellular carcinoma (HCC): A machine learning approach using a sample pathway information matrix

引用

Computational Biology and Chemistry 2025年 118卷 108481页

作者： Annadurai, Priyadharshini Isaac, Arnold Emerson Bioinformatics Programming Laboratory Department of Bioscience School of Bio Science and Technology Vellore Institute of Technology Katpadi Tamil Nadu Vellore632014 India

Hepatocellular carcinoma (HCC) represents the most prevalent form of primary liver cancer, accounting for 75 % of all cases. Individuals with metabolic dysfunctions are at risk of developing significant symptoms, including cirrhosis. To address this, we proposed a novel method to find the signalling pathway based on the patient's gene expression. The objective includes examining the predictive biomarkers associated with cirrhosis-related HCC. The study combines gene expression and pathway enrichment data to find the biologically important pathways in disease progression. The differential gene expression analysis showed 58 upregulated and 62 downregulating differentially expressed genes. These DEGs were utilized to construct a protein-protein interaction network, and then the clustered genes were determined. Subsequently, pathway enrichment analysis was performed for the clustered genes and the gene-pathway interaction matrix was developed. The sample-pathway information matrix (SPIM) was obtained by multiplying the gene-expression and gene-pathway matrix. The key pathways were predicted from the SPIM using random forest model and we achieved 94 % of accuracy. The arachidonic acid metabolism was the most important pathway and genes involved in this pathway includes CYP2C9, CYP2C8, CYP2B6. These genes are well known for promoting metabolic disorders in the liver. Hence, our novel method proves that it could distinguish the samples and extract important pathways that are involved in differentiating the diseased samples based on the gene expression. Therefore, integrating gene expression and their enriched biological pathways may effectively help in identifying the key signalling pathways. © 2025 Elsevier Ltd

关键词： Transcription

来源：评论

学校读者我要写书评

暂无评论

Practical Escape Analysis in an Open World

引用

电子学报(英文版) 2009年第1期18卷 31-36页

作者： SHI Xiaohua JIN Maozhong WU Gansha LUEH Gueiyuan Software Engineering Institute Beihang University Beijing 100083 China Programming System Laboratory Microprocessor Technology Laboratory Intel Corporation China

A novel escape analysis framework that handles the Java open-world features is proposed and evaluated. The novel approach analyzes a Java program with an optimistic view that the program is in a closed world and applies optimizations aggressively. The framework also provides a mechanism that controls the analysis complexity. The results show that the escape analysis framework, which has been implemented in Intel's Open Runtime Platform on X86, eliminated about 70% and 94% synchronization operations, and improved the runtime performance 15.77% and 31.28%, for SPECjbb2000 and 209_db respectively.

关键词：世界逃逸 Java程序运行性能同步操作开放式框架复杂性

来源：评论

学校读者我要写书评

暂无评论

A MESSAGE-DRIVEN programming SYSTEM FOR FINE-GRAIN MULTICOMPUTERS

引用

SOFTWARE-PRACTICE & EXPERIENCE 1994年第10期24卷 953-980页

作者： MASKIT, D TAYLOR, S Scalable Concurrent Programming Laboratory California Institute of Technology Computer Science Pasadena CA 91125 U.S.A.

This paper describes an experimental message-driven programming system for fine-grain multicomputers. The initial target architecture is the J-machine designed at MIT. This machine combines a unique collection of architectural features that include fine-grain processes, on-chip associative memory;and hardware support for process synchronization. The programming system uses these mechanisms via a simple message-driven process model that blurs the distinction between processes and messages: messages correspond to processes that are executed elsewhere in the network. This model allows code and data to be distributed across the computers in the machine, and is supported at every stage of the program development cycle. The prototype system we have developed includes a basic set of programming tools to support the model;these include a compiler, linker, archiver, loader and microkernel. Although the concepts are language independent, our prototype system is based on GNU-C.

关键词： FINE-GRAIN COMPUTING COMPILERS MESSAGE-PASSING CONCURRENCY MULTICOMPUTERS

来源：评论

学校读者我要写书评

暂无评论

Optimizations and Deoptimizations for Escape Analysis in Open World

引用

电子学报(英文版) 2010年第2期19卷 211-216页

作者： SHI Xiaohua WU Gansha JIN Maozhong LUEH Guei-Yuan School of Computer Science Beihang University Beijing China Programming System Laboratory Microprocessor Technology Labs Intel Corporation Beijing China

This paper introduced the optimization and deoptimization technologies for Escape analysis in open world. These technologies are used in a novel Escape analysis framework that has been implemented in Open runtime platform, Intel's opensource Java virtual machine. We introduced the optimization technologies for synchronization removal and object stack allocation, as well as the runtime deoptimization and compensation work. The deoptimization and compensation technologies are crucial for a practical Escape analysis in open world. We evaluated the runtime efficiency of the deoptimization and compensation work on benchmarks like SPECjbb2000 and SPECjvm98.

关键词：优化技术世界逃生 Java虚拟机运行平台补偿工作开放源码补偿技术

来源：评论

学校读者我要写书评

暂无评论

Derivation of axiomatic definitions of programming languages from algorithmic definitions

Derivation of axiomatic definitions of programming languages...

引用

1972 ACM Conference on Proving Assertions about Programs

作者： Allen, C. David Programming Technology Department IBM Product Test Laboratory Hursley United Kingdom

Language definitions by abstract interpreters are appropriate to the design and development of a language. Axiomatic definitions are more appropriate to proving program properties and verification of compilers. The proof methods of Manna and Ashcroft can be applied to an algorithmic definition in, e.g. The Vienna Definition Language to deduce theorems which constitute an axiomatic definition of precisely the same language. The process and techniques are explained, and illustrated on a simple language of assignment statements. © 1972 ACM.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Network virtualization for military application: Review and initial development of conceptual design

Network virtualization for military application: Review and ...

引用

14th International Conference on Advanced Communication technology, ICACT 2012

作者： Kerdsri, Jiradett Wipusitwarkun, Komwut Computer and Programming Laboratory Defense Technology Institute Thailand Sirindhorn International Institute of Technology Thailand

ISBN: (纸本)9788955191639

Networking technology, undoubtedly, plays a vital role in modern warfare especially in Network Centric Operations (NCOs) and Global Information Grid (GIG) concept. However, the current popular network infrastructure, mainly TCP/IP architecture, is in fact unsuitable with advanced military communication especially in tactical operation networks. The key characteristics of military communications are classified as delay/disruption/disconnection tolerant networks (DTNs) which are long and variable delays, high error rates and greatly heterogeneous. As a result a call for new type of network architecture emerges to support such peculiar characteristics of military communication network. This paper reviews the current approaches in network technology of military communication and proposes the conceptual design of Virtualization Network (VN) for military communication to address the limitation of current network infrastructure. The implementation of Military Network Virtualization Environment (MVNE) introduces the crucial two new key features of military tactical network: information classification and movable nodes. These features along with essential research challenges must be analyzed to realize a viable virtualization network for military communications. © 2012 GIRI.

关键词： Conceptual design

来源：评论

学校读者我要写书评

暂无评论

Ambient-oriented programming

Ambient-oriented programming

引用

OOPSLA'05 - 20th Annual ACM Conference on Object-Oriented programming, Systems, Languages, and Applications

作者： Dedecker, Jessie Van Cutsem, Tom Mostinckx, Stijn D'Hondt, Theo De Meuter, Wolfgang Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

A new field in distributed computing, called Ambient In-telligence, has emerged as a consequence of the increasing availability of wireless devices and the mobile networks they induce. Developing software for such mobile networks is extremely hard in conventional programming languages because the network is dynamically defined. This hardware phenomenon leads us to postulate a suite of characteristics of future Ambient-Oriented programming languages. A simple re ective programming language kernel, called AmbientTalk, that meets these characteristics is subsequently presented. The power of the re ective kernel is illustrated by using it to conceive a collection of high level tentative ambient-oriented programming language features. © 2005 ACM.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

AmbientOriented programming in AmbientTalk: Combining mobile hardware with simplicity and expressiveness

AmbientOriented Programming in AmbientTalk: Combining mobile...

引用

OOPSLA'05 - 20th Annual ACM Conference on Object-Oriented programming, Systems, Languages, and Applications

作者： Dedecker, Jessie Cutsem, Tom Van Mostinckx, Stijn De Meuter, Wolfgang D Hond, Theo Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

A new field in distributed computing, called Ambient Intelligence, has emerged as a consequence of the increasing availability of wireless devices and the mobile networks they induce. Developing software for such mobile networks is extremely hard in conventional programming languages because the network is dynamically defined. We demonstrate a new distributed programming language named AmbientTalk, a research vehicle to experiment with expressive high-level language constructs for Ambient-Oriented programming. © 2005 ACM.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Prefetch injection based on hardware monitoring and object metadata

Prefetch injection based on hardware monitoring and object m...

引用

Proceedings of the 2004 ACM SIGPLAN Conference on programming Language Design and Implementation (PLDI'04)

作者： Adl-Tabatabai, Ali-Reza Hudson, Richard L. Serrano, Mauricio J. Subramoney, Sreenivas Programming Systems Laboratory Microprocessor Technology Laboratory Intel Corporation Santa Clara CA United States

Cache miss stalls hurt performance because of the large gap between memory and processor speeds - for example, the popular server benchmark SPEC JBB2000 spends 45% of its cycles stalled waiting for memory requests on the Itanium® 2 processor. Traversing linked data structures causes a large portion of these stalls. Prefetching for linked data structures remains a major challenge because serial data dependencies between elements in a linked data structure preclude the timely materialization of prefetch addresses. This paper presents Mississippi Delta (MS Delta), a novel technique for prefetching linked data structures that closely integrates the hardware performance monitor (HPM), the garbage collector's global view of heap and object layout, the type-level metadata inherent in type-safe programs, and JIT compiler analysis. The garbage collector uses the HPM's data cache miss information to identify cache miss intensive traversal paths through linked data structures, and then discovers regular distances (deltas) between these linked objects. JIT compiler analysis injects prefetch instructions using deltas to materialize prefetch addresses. We have implemented MS Delta in a fully dynamic profile-guided optimization system: the StarJIT dynamic compiler and the ORP Java virtual machine, We demonstrate a 28-29% reduction in stall cycles attributable to the high-latency cache misses targeted by MS Delta and a speedup of 11-14% on the cache miss intensive SPEC JBB2000 benchmark.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

PartialRC: A Partial Recomputing Method for Efficient Fault Recovery on GPGPUs

引用

Journal of Computer Science & technology 2012年第2期27卷 240-255页

作者：徐新海杨学军薛京灵林宇斐林一松 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

GPGPUs are increasingly being used to as performance accelerators for HPC （High Performance Computing） applications in CPU/GPU heterogeneous computing systems, including TianHe-1A, the world＇s fastest supercomputer in the TOP500 list, built at NUDT （National University of Defense technology） last year. However, despite their performance advantages, GPGPUs do not provide built-in fault-tolerant mechanisms to offer reliability guarantees required by many HPC applications. By analyzing the SIMT （single-instruction, multiple-thread） characteristics of programs running on GPGPUs, we have developed PartialRC, a new checkpoint-based compiler-directed partial recomputing method, for achieving efficient fault recovery by leveraging the phenomenal computing power of GPGPUs. In this paper, we introduce our PartialRC method that recovers from errors detected in a code region by partially re-computing the region, describe a checkpoint-based faulttolerance framework developed on PartialRC, and discuss an implementation on the CUDA platform. Validation using a range of representative CUDA programs on NVIDIA GPGPUs against FullRC （a traditional full-recomputing Checkpoint-Rollback-Restart fault recovery method for CPUs） shows that PartialRC reduces significantly the fault recovery overheads incurred by FullRC, by 73.5% when errors occur earlier during execution and 74.6% when errors occur later on average. In addition, PartialRC also reduces error detection overheads incurred by FullRC during fault recovery while incurring negligible performance overheads when no fault happens.

关键词： GPGPU partial recomputing fault tolerance CUDA checkpointing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：