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

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

来源：评论

学校读者我要写书评

暂无评论

Constraints on sentence comprehension

引用

TRENDS IN COGNITIVE SCIENCES 1998年第7期2卷 262-268页

作者： Gibson, E Pearlmutter, NJ MIT Dept Brain & Cognit Sci Cambridge MA 02139 USA Northeastern Univ Dept Psychol Boston MA 02115 USA

The process of comprehending sentences involves the integration of a variety of different information sources, constrained by the available computational resources. This paper surveys the evidence for four types of constraints on sentence comprehension: (1) lexical constraints, (2) contextual constraints, (3) locality-based computational resource constraints, and (4) phrase-level contingent frequency constraints. These four constraints, in combination with grammatical phrase-formation information and prosody, are sufficient to explain how interpretations are constructed for sentences as they are encountered, including complexity effects Zn unambiguous sentences and interpretation preferences in ambiguous sentences.

关键词： sentence comprehension lexical contextual phrase-level computational resource amiguity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Consumer-centric resource accounting in the cloud

引用

JOURNAL OF INTERNET SERVICES AND APPLICATIONS 2013年第1期4卷 1-16页

作者： Mihoob, Ahmed Molina-Jimenez, Carlos Shrivastava, Santosh Newcastle Univ Sch Comp Sci Newcastle Upon Tyne NE1 7RU Tyne & Wear England

"Pay only for what you use" principle underpins the charging policies of widely used cloud services that are on offer. Ideally for these services, consumers should be in a position to verify the charges billed to them. However, unlike traditional utility services such as gas and electricity, no consumer-trusted metering services are available for cloud services, so consumers have no choice but to rely on the usage data made available by the providers. In light of this, the paper proposes the notion of Consumer-centric resource Accounting Models for cloud resources. An accounting model is strongly consumer-centric if all the data that the model requires for calculating billing charges can be collected independently by the consumer (or a trusted third party, TTP);in effect, this means that a consumer (or a TTP) should be in a position to run their own measurement service. With this view in mind, the accounting models of some widely used cloud services are examined and possible sources of difficulties in data collection are identified, including causes that could lead to discrepancies between the metering data collected by the consumer and the provider. The paper goes on to suggest how cloud service providers can improve their accounting models to make them consumer-centric.

关键词： Cloud resource consumption Storage resource computational resource resource metering Accounting models Amazon web services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory

One Packet Suffices - Highly Efficient Packetized Network Co...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Haeupler, Bernhard Medard, Muriel MIT CSAIL RLE Cambridge MA 02139 USA MIT RLE Cambridge MA 02139 USA

ISBN: (纸本)9781457705953

Random Linear Network Coding (RLNC) has emerged as a powerful tool for robust high-throughput multicast. Projection analysis, a recently introduced technique, shows that the distributed packetized RLNC protocol achieves (order) optimal and perfectly pipelined information dissemination in many settings. In the original approach to RNLC intermediate nodes code together all available information. This requires intermediate nodes to keep considerable data available for coding. Moreover, it results in a coding complexity that grows linearly with the size of this data. While this has been identified as a problem, approaches that combine queuing theory and network coding have heretofore not provided a succinct representation of the memory needs of network coding at intermediates nodes. This paper shows the surprising result that, in all settings with a continuous stream of data, network coding continues to perform optimally even if only one packet per node is kept in active memory and used for computations. This leads to an extremely simple RLNC protocol variant with drastically reduced requirements on computational and memory resources. By extending the projection analysis, we show that in all settings in which the RLNC protocol was proven to be optimal its finite memory variant performs equally well. In the same way as the original projection analysis, our technique applies in a wide variety of network models, including highly dynamic topologies that can change completely at any time in an adversarial fashion.

关键词： Encoding Memory management Network coding Network topology Protocols RNLC intermediate node code Topology coding complexity computational resource distributed packetized RLNC protocol dynamic topology finite memory variant high-throughput multicast information dissemination linear codes memory resource network coding one packet suffices-highly efficient packetized network coding pipelined information dissemination projection analysis queueing theory queuing theory random codes random linear network coding

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT PARALLEL PROCESSING BY IMPROVED CPU-GPU INTERACTION

EFFICIENT PARALLEL PROCESSING BY IMPROVED CPU-GPU INTERACTIO...

引用

International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)

作者： Khatter, Harsh Aggarwal, Vaishali ABES Engn Coll Dept Comp Sci & Engn Ghaziabad India KIET Dept Comp Sci & Engn Ghaziabad India

ISBN: (纸本)9781479928996

In this digital world, more than 90% of desktop and notebook computers have integrated Graphics Processing Units i.e. GPU's, for better graphics processing. Graphics Processing Unit is not only for graphics applications, even for nongraphics applications too. In the past few years, the graphics programmable processor has evolved into an increasingly convincing computational resource. But GPU sits idle if graphics job queue is empty, which decreases the GPU's efficiency. This paper focuses on various tact to overcome this problem and to make the CPU-GPU processing more powerful and efficient. The graphics programmable processor or Graphics processing unit is especially well suited to address problem sets expressed as data parallel computation with the same program executed on many data elements concurrently. The objective of this paper is to increase the capabilities and flexibility of recent GPU hardware combined with high level GPU programming languages: to accelerate the building of images in a frame buffer intended for output to a display, and, to provide tremendous acceleration for numerically intensive scientific applications. This paper also gives some light on major applicative areas where GPU is in use and where GPU can be used in future.

关键词： computer graphics graphics processing units parallel processing CPU-GPU interaction computational resource data parallel computation graphics job queue graphics programmable processor integrated graphics processing units parallel processing scientific applications Acceleration Bandwidth Electroencephalography Graphics processing units Irrigation Streaming media

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：