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

Stochastic Learning of computational resource Usage as Graph-Structured Multimarginal Schrodinger Bridge

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2025年

作者： Bondar, Georgiy A. Gifford, Robert Phan, Linh Thi Xuan Halder, Abhishek Univ Calif Santa Cruz Dept Appl Math Santa Cruz CA 95064 USA Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA Iowa State Univ Dept Aerosp Engn Ames IA 50011 USA

We propose to learn the time-varying stochastic computational resource usage of software as a graph-structured Schr & ouml;dinger bridge problem (SBP). In general, learning the computational resource usage from data is challenging because resources, such as the number of CPU instructions and the number of last level cache requests are both time-varying and statistically correlated. Our proposed method enables learning the joint time-varying stochasticity in computational resource usage from the measured profile snapshots in a nonparametric manner. The method can be used to predict the most-likely time-varying distribution of computational resource availability at a desired time. We provide detailed algorithms for stochastic learning in both single-core and multicore cases, discuss the convergence guarantees, computational complexities, and demonstrate their practical use in two case studies: a single-core nonlinear model predictive controller (NMPC) and a synthetic multicore software.

关键词： Multicore processing Stochastic processes Software Vectors Tensors Indexes Bridges Hardware Dynamic scheduling Predictive models computational resource multicore hardware multimarginal Schr & ouml dinger bridge stochastic learning

来源：评论

学校读者我要写书评

暂无评论

Overcoming computational resource Limitations in Deep Learning for Healthcare: Strategies Targeting Data, Model, and Computing

Medicine Advances

引用

Medicine Advances 2025年

作者： Han Yuan Duke-NUS Medical School National University of Singapore Singapore

来源：评论

学校读者我要写书评

暂无评论

A joint computational and resource allocation model for fast parallel data processing in fog computing

引用

JOURNAL OF SUPERCOMPUTING 2022年第10期78卷 12662-12685页

作者： Lakzaei, Mahmood Sattari-Naeini, Vahid Molahosseini, Amir Sabbagh Javadpour, Amir Islamic Azad Univ Dept Comp Engn Kerman Branch Kerman Iran Shahid Bahonar Univ Kerman Dept Comp Engn Kerman Iran Guangzhou Univ Sch Comp Sci & Technol Guangzhou 510006 Peoples R China

Fog computing can be an effective way to improve quality of services and solve network problems, with the demand for real-time, latency-sensitive applications increasing as well as limitations such as network bandwidth and Internet of Things users' resources. Due to the fact that different tasks in a network can create overhead that can reduce the quality of service, dynamic voltage, and frequency scaling along with a ranking function and a high number of physical and virtual machines were used in this research. A profit function phase is used to analyze network tasks in order to improve QoS by sending them to physical machines and sending them via the network to physical machines. The simulation results demonstrate that this method is the most effective in allocating radio and computational resources to IoT devices in fog computing. A comparison is presented in the results section between the proposed method and the SPA, Markov-Fog, and TRAM methods. Criteria for evaluating performance include the response time for heterogeneous environments, energy consumption against tasks and users, memory processing, energy consumption for physical and virtual machines, and network profitability.

关键词： Fog computing IoT Cloud computing computational resource Quality of service DVFS

来源：评论

学校读者我要写书评

暂无评论

computational and Communication resource Allocation for Mobile Cooperative Cloudlet Computing Systems

Computational and Communication Resource Allocation for Mobi...

引用

International Conference on Wireless Communications and Signal Processing

作者： Xingyu Zhao Yuan Zhang Lei Wei Min Lu Nat. Mobile Commun. Res. Lab. Southeast Univ. Nanjing China

ISBN: (纸本)9781467376884

Mobile users expect mobile device to work as static computers. However, the limited computational resource of mobile devices can not satisfy users' requirements. To solve this problem, a novel mobile cooperative cloudlet computing (M3C) model is studied in this paper which utilizes computational resource distributed in nearby cloudlet access points (APs) to shorten users' waiting time. A partial critical path (PCP) based workflow scheduling algorithm is proposed to assign tasks of mobile application workflow to APs, a dynamic programming based algorithm is proposed to select placements for APs, and a channel allocation algorithm is proposed to allocate wireless communication resource to radio links between APs. Simulation results show that the M3C model can achieve a shorter users' waiting time compared with the independent cloudlet computing (Icloudlet) model.

关键词： channel allocation cloud computing dynamic programming mobile computing mobile handsets mobile radio resource allocation AP placements Icloudlet model M3C model PCP based workflow scheduling algorithm channel allocation algorithm cloudlet access points communication resource allocation computational resource computational resource allocation dynamic programming based algorithm independent cloudlet computing model mobile application workflow mobile cooperative cloudlet computing systems mobile device mobile users partial critical path based workflow scheduling algorithm radio links static computers user requirements user waiting time wireless communication resource allocation Channel allocation Cloud computing computational modeling Mobile applications Mobile communication Radio link resource management Channel allocation Radio links Cloud Computing Mobile Applications management of resources User needs Mobile phones Mobile radios mobile communication dynamic programming Allocation Algorithm Mobile Computing Mobile devices Waiting time computational modeling

来源：评论

学校读者我要写书评

暂无评论

computational resources for identification of cancer biomarkers from omics data

引用

BRIEFINGS IN FUNCTIONAL GENOMICS 2021年第4期20卷 213-222页

作者： Kaur, Harpreet Kumar, Rajesh Lathwal, Anjali Raghava, Gajendra P. S. CSIR Inst Microbial Technol Bioinformat Ctr Bioinformat 39-A Chandigarh 160036 India CSIR Inst Microbial Technol Bioinformat Ctr Life Sci 39-A Chandigarh 160036 India Indraprastha Inst Informat Technol Dept Computat Biol Computat Biol New Delhi 110020 India Indraprastha Inst Informat Technol Dept Computat Biol Okhla Ind EstatePhase 3 New Delhi 110020 India

Cancer is one of the most prevailing, deadly and challenging diseases worldwide. The advancement in technology led to the generation of different types of omics data at each genome level that may potentially improve the current status of cancer patients. These data have tremendous applications in managing cancer effectively with improved outcome in patients. This review summarizes the various computational resources and tools housing several types of omics data related to cancer. Major categorization of resources includes-cancer-associated multiomics data repositories, visualization/analysis tools for omics data, machine learning-based diagnostic, prognostic, and predictive biomarker tools, and data analysis algorithms employing the multiomics data. The review primarily focuses on providing comprehensive information on the open-source multiomics tools and data repositories, owing to their broader applicability, economic-benefit and usability. Sections including the comparative analysis, tools applicability and possible future directions have also been discussed in detail. We hope that this information will significantly benefit the researchers and clinicians, especially those with no sound background in bioinformatics and who lack sufficient data analysis skills to interpret something from the plethora of cancer-specific data generated nowadays.

关键词： omics data cancer biomarker web server computational resource diagnosis prognosis

来源：评论

学校读者我要写书评

暂无评论

Compressing Packets Adaptively Inside Networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2010年第3期E93B卷 501-515页

作者： Shimamura, Masayoshi Koga, Hiroyuki Ikenaga, Takeshi Tsuru, Masato Kyushu Inst Technol Network Design Res Ctr Kitakyushu Fukuoka 8048550 Japan Univ Kitakyushu Dept Informat & Media Engn Kitakyushu Fukuoka 8080135 Japan

Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network In this paper. we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes This scheme selectively compresses a packet according to its waiting time in the queue during. congestion Through preliminary investigation using actual traffic datasets. we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments Then by means of computer simulations. we show that the proposed scheme reduces the packet delay time and discard rate and Investigate factors necessary in achieving efficient packet relay

关键词： advanced relay node adaptive online lossless packet compression scheme network resource computational resource

来源：评论

学校读者我要写书评

暂无评论

INCLUSION COMPLETE TALLY LANGUAGES AND HARTMANIS-BERMAN CONJECTURE

引用

MATHEMATICAL SYSTEMS THEORY 1977年第1期11卷 1-8页

作者： BOOK, RV WRATHALL, C SELMAN, AL DOBKIN, D UNIV CALIF SANTA BARBARA DEPT MATH SANTA BARBARA CA 93106 USA UNIV CALIF SANTA BARBARA PROGRAM COMP SCI SANTA BARBARA CA 93106 USA IOWA STATE UNIV DEPT COMP SCI AMES IA 50011 USA UNIV CALIF LOS ANGELES DEPT SYST SCI LOS ANGELES CA 90024 USA YALE UNIV DEPT COMP SCI NEW HAVEN CT 06520 USA

Stimulated by the work of Hartmanis and Berman [5], we study the question of the existence of a tally languageL inNP such thatL is inP if and only ifP = NP. The method used is applicable to questions regarding the comparison of a wide range of pairs of classes of formal languages specified by machines whose computational resources are bounded in time or space.

关键词： computational Mathematic computational resource Berman Formal Language Tally Language

来源：评论

学校读者我要写书评

暂无评论

A genome-wide computational approach to define microRNA-Polycomb/trithorax gene regulatory circuits in Drosophila

引用

DEVELOPMENTAL BIOLOGY 2023年 495卷 63-75页

作者： Solorzano, Jacobo Pau, Enrique Carrillo-de Santa Laguna, Teresa Busturia, Ana CSIC UAM Ctr Biol Mol Severo Ochoa Nicolas Cabrera 1 Madrid 28049 Spain IMDEA Food Inst Precis Nutr & Canc Res Program Computat Biol Grp CEI UAM CSIC Madrid 28049 Spain Ctr Rech Cancerol Toulouse 2 Av Hubert Curien F-31100 Toulouse France

Characterization of gene regulatory networks is fundamental to understanding homeostatic development. This process can be simplified by analyzing relatively simple genomes such as the genome of Drosophila melanogaster. In this work we have developed a computational framework in Drosophila to explore for the presence of gene regulatory circuits between two large groups of transcriptional regulators: the epigenetic group of the Polycomb/ trithorax (PcG/trxG) proteins and the microRNAs (miRNAs). We have searched genome-wide for miRNA targets in PcG/trxG transcripts as well as for Polycomb Response Elements (PREs) in miRNA genes. Our results show that 10% of the analyzed miRNAs could be controlling PcG/trxG gene expression, while 40% of those miRNAs are putatively controlled by the selected set of PcG/trxG proteins. The integration of these analyses has resulted in the predicted existence of 3 classes of miRNA-PcG/trxG crosstalk interactions that define potential regulatory circuits. In the first class, miRNA-PcG circuits are defined by miRNAs that reciprocally crosstalk with PcG. In the second, miRNA-trxG circuits are defined by miRNAs that reciprocally crosstalk with trxG. In the third class, miRNA-PcG/ trxG shared circuits are defined by miRNAs that crosstalk with both PcG and trxG regulators. These putative regulatory circuits may uncover a novel mechanism in Drosophila for the control of PcG/trxG and miRNAs levels of expression. The computational framework developed here for Drosophila melanogaster can serve as a model case for similar analyses in other species. Moreover, our work provides, for the first time, a new and useful resource for the Drosophila community to consult prior to experimental studies investigating the epigenetic regulatory networks of miRNA-PcG/trxG mediated gene expression.

关键词： Polycomb Trithorax microRNAs Drosophila computational resource Framework Epigenetic GRN (gene regulatory network) Circuits

来源：评论

学校读者我要写书评

暂无评论

ON THE EVOLUTION OF INTERACTING, MAGNETIZED, GALACTIC PLASMAS

引用

ASTROPHYSICS AND SPACE SCIENCE 1983年第1期91卷 19-33页

作者： PERATT, AL GREEN, JC STANFORD UNIV INST PLASMA RESSTANFORDCA 94305

The advent of three-dimensional, electromagnetic, and fully relativistic particle simulations allows a detailed study of a magnetized, rotating plasma, galaxy model. When two such models are simulated, an interaction yielding results resembling observational data from double radio sources, including the emission of synchrotron radiation, are obtained. Simulation derived morphologies, radiation intensities, frequency spectra, and isophote patterns are directly compared to observations. The constituent plasma parameters associated with the source Cygnus A are found to ben e =1.8×10−3 cm−3,T=2.8 keV,B=20–30 gamma, with a small population of electrons accelerated to GeV energies by a rotation induced electric field. The results of these simulations, involving a computational resource of five CDC 7600 and five Cray-1 computers, strongly supports an inhomogeneous version of the Klein world model.

关键词： Observational Data Frequency Spectrum Synchrotron Radiation computational resource Radiation Intensity

来源：评论

学校读者我要写书评

暂无评论

Compressing Packets Adaptively Inside Networks

Compressing Packets Adaptively Inside Networks

引用

9th Annual International Symposium on Applications and the Internet (SAINT 2009)

作者： Shimamura, Masayoshi Ikenaga, Takeshi Tsuru, Masato Kyushu Inst Technol Network Design Res Ctr Fukuoka 8208502 Japan

ISBN: (纸本)9781424447763

Introducing adaptive online data compression at network-internal nodes is considered to mitigate congestion on the network. In this paper, assuming that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, we propose an adaptive online lossless packet compression scheme performed at these nodes. This scheme selectively compresses a packet according to the waiting time of the packet in the queue during the congestion period. Through computer simulations, we show that our proposed scheme reduces the packet delay and discard rate and investigate the key factors necessary in achieving an efficient packet relay.

关键词： advanced relay node adaptive online lossless packet compression scheme network resource computational resource

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：