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

Heterogeneous download times in bandwidth-homogeneous BitTorrent swarms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Murai, Fabricio De Rocha, Antonio A.A. Figueiredo, Daniel R. De Souza E Silva, Edmundo A. COPPE/Systems Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Computer Science Department Fluminense Federal University Niterói Brazil

Modeling and understanding BitTorrent (BT) dynamics is a recurrent research topic mainly due to its high complexity and tremendous practical efficiency. Over the years, different models have uncovered various phenomena exhibited by the system, many of which have direct impact on its performance. In this paper we identify and characterize a phenomenon that has not been previously observed: homogeneous peers (with respect to their upload capacities) experience heterogeneous download times. This behavior has direct impact on peer and system performance, such as high variability of download times, unfairness with respect to peer arrival order, bursty departures and content synchronization. Detailed packet-level simulations and prototype-based experiments on the Internet were performed to characterize this phenomenon. We also develop a mathematical model that accurately predicts the heterogeneous download rates of the homogeneous peers as a function of their content. In addition, we apply the model to calculate lower and upper bounds to the number of departures that occur in a burst. The heterogeneous download rates are more prevalent in unpopular swarms (very few peers). Although few works have addressed this kind of swarm, these by far represent the most common type of swarm in BT. © 2021, CC BY.

关键词： Functions

DTIAM: A unified framework for predicting drug-target interactions, binding affinities and activation/inhibition mechanisms

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Lu, Zhangli Lei, Chuqi Wang, Kaili Qin, Libo Tang, Jing Li, Min School of Computer Science and Engineering Central South University Changsha410083 China Research Program in Systems Oncology Faculty of Medicine University of Helsinki HelsinkiFI00014 Finland

Accurate and robust prediction of drug-target interactions (DTIs) plays a vital role in drug discovery. Despite extensive efforts have been invested in predicting novel DTIs, existing approaches still suffer from insufficient labeled data and cold start problems. More importantly, there is currently a lack of studies focusing on elucidating the mechanism of action (MoA) between drugs and targets. Distinguishing the activation and inhibition mechanisms is critical and challenging in drug development. Here, we introduce a unified framework called DTIAM, which aims to predict interactions, binding affinities, and activation/inhibition mechanisms between drugs and targets. DTIAM learns drug and target representations from large amounts of label-free data through self-supervised pre-training, which accurately extracts the substructure and contextual information of drugs and targets, and thus benefits the downstream prediction based on these representations. DTIAM achieves substantial performance improvement over other state-of-the-art methods in all tasks, particularly in the cold start scenario. Moreover, independent validation demonstrates the strong generalization ability of DTIAM. All these results suggested that DTIAM can provide a practically useful tool for predicting novel DTIs and further distinguishing the MoA of candidate drugs. DTIAM, for the first time, provides a unified framework for accurate and robust prediction of drug-target interactions, binding affinities, and activation/inhibition mechanisms. Copyright © 2023, The Authors. All rights reserved.

关键词： Chemical activation

COULD DROPPING A FEW CELLS CHANGE THE TAKEAWAYS FROM DIFFERENTIAL EXPRESSION?

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shiffman, Miriam Giordano, Ryan Broderick, Tamara MIT Computational & Systems Biology Program United States MIT Dept. of Electrical Engineering & Computer Science United States UC Berkeley Dept. of Statistics United States

Analysis of differential gene expression plays a fundamental role in biology toward illuminating the molecular mechanisms driving a difference between groups (e.g., due to treatment or disease). While any analysis is run on particular cells or samples, the intent is to generalize to future occurrences of the treatment or disease. Implicitly, generalization is justified under the assumption that present and future samples are independent and identically distributed from the same population. Though this assumption is always false, we might hope that any deviation from the assumption is small enough that A) fundamental conclusions of the analysis still hold, and B) standard tools like standard error, significance, and power still reflect generalizability. Conversely, we might worry about these deviations, and reliance on standard statistical tools, if conclusions could be substantively changed by dropping a very small fraction of observations. While checking every small fraction is computationally intractable, recent work develops an approximation to identify when such an influential subset exists. Building on this work, we develop a metric for dropping-data robustness of differential expression;namely, we cast the analysis in a differentiable form suitable to the approximation, extend the approximation to models whose hyperparameters depend on the full dataset, and extend the notion of a data point from a single cell to a pseudobulk observation. We then overcome the inherent non-differentiability of gene set enrichment analysis to develop an additional approximation for the robustness of top gene sets. We use our tool to assess the robustness of differential expression for published single-cell RNA-seq data, and discover that thousands of genes can have their results flipped by dropping Copyright © 2023, The Authors. All rights reserved.

关键词： Diseases

Memory Controller with Adaptive ECC for Reliable System Operation

学校读者我要写书评

暂无评论

Memory Controller with Adaptive ECC for Reliable System Oper...

Symposium on Integrated Circuits and systems Design (SBCCI)

作者： Marco Stefani César Marcon Felipe Silva Jarbas Silveira Graduate Program in Computer Science (PPGCC) Pontifical Catholic University of Rio Grande do SuL (PUCRS) Porto Alegre Brazil Engineering and Computer Systems Laboratory (LESC) - DETI Federal University of Ceará (UFC) Fortaleza Brazil

Memory errors can cause crashes and data loss, which are unacceptable for various computing systems, mainly large servers. Memory controllers can mitigate these errors by employing an Error Correction Code (ECC) in the data write and read flows. This work proposes a fault-tolerant mechanism that acts as a memory controller's encoding and decoding manager. This mechanism adapts the ECC for each memory block based on the efficacies of the ECCs available in the controller and the error rate captured at runtime. Consequently, memory blocks with a high error rate can be recoded to a high efficacy ECC and vice versa. Experimental results show that our proposal achieves high error correction efficacy with high energy efficiency.

关键词：

Q-Learning Energy Management System (Q-EMS) in Wireless Sensor Network

学校读者我要写书评

暂无评论

Q-Learning Energy Management System (Q-EMS) in Wireless Sens...

Smart Computing, IoT and Machine Learning (SIML), International Conference on

作者： Deden Ardiansyah Mustafid Teddy Mantoro Doctoral Program of Information Systems School of Postgraduate Universitas Diponegoro Semarang Central Java Indonesia Computer Engineering Department Vocational School Universitas Pakuan Bogor West Java Indonesia Media-Tech-Lab Computer Science Department Sampoerna University DKI Jakarta Indonesia

ISBN: (数字)9798350364101

ISBN: (纸本)9798350364118

The energy control of a Wireless Sensor Network (WSN) often leads to an unbalanced state between the battery storage system, energy extraction through photovoltaic systems energy, and energy utilization in the WSN. These disparities result in suboptimal wireless sensor network performance. The reliance on batteries is a major factor contributing to this problem. The Q-Learning Energy Management System (Q-EMS) is designed to address these challenges and improve energy management strategies. The Q-EMS algorithm used a learning process resulting in optimal actions for sensor nodes in different situations. The rewards or punishments nodes receive determine their decisions, which are determined by the Q-EMS algorithm. The Q-learning model approach is aimed at reducing energy consumption and supply in WSNs. Energy supply is categorized into battery-based, transfer-based, and harvesting, while energy consumption can be classified into task-cycle, mobility-based, and data-driven. The development of the Q Learning algorithm model has three scenarios: determining energy needs for WSN, effective energy harvesting strategy, and effective energy transfer. As a result, effective energy demand, harvesting and transfer using the Q-learning algorithm are balanced. However, it needs to be studied in more depth using real data in the field. In future research, I will use real data and optimize the use of the Q-Learning algorithm.

关键词： Wireless communication Wireless sensor networks Energy consumption Q-learning Machine learning algorithms Energy resources Classification algorithms

Toward a computer-Supported Remote Serendipity: Understanding the Role of Collaboration in Remote Innovation

学校读者我要写书评

暂无评论

Toward a Computer-Supported Remote Serendipity: Understandin...

IEEE International Conference on systems, Man and Cybernetics

作者： Aline Coutinho Carlos Eduardo Barbosa Marcos Antonio De Almeida Jano Moreira De Souza Program of Systems and Computer Engineering (PESC) COPPE Universidade Federal do Rio de Janeiro (UFRJ) Rio de Janeiro RJ Brazil Centro de Análises de Sistemas Navais Marinha do Brasil Praça Barão de Ladário - Ilha das Cobras Rio de Janeiro RJ Brazil

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Since 2016, the demand for remote work has grown by nearly 400%, with 3.5 million remote job vacancies posted, and it is expected to continue to grow in the coming years. Therefore, one of the challenges in advancing remote work is fostering innovation, particularly serendipity, in a remote workforce. This fortunate discovery can pave the way for technological advancements, new business strategies, or even scientific revolutions. However, creating moments of serendipity in a remote work environment is a significant challenge. Thus, finding the right approach to stimulate serendipity in a remote work environment is an ever-evolving challenge. Therefore, this work aims to understand the possibilities of serendipity that collaboration tools used in remote work can support. The methodology used for this work was a Rapid Review. First, we explore the factors related to serendipity in physical offices, for which we identified twenty-three elements. Next, we compiled 38 strategies for remote work that were found to promote serendipity, which we organized in a framework for better observation. Our findings can serve as a starting point for designing new tools and identifying existing software and tools that already play a supportive role.

关键词： Technological innovation Reviews Pandemics Employment Virtual environments Solids Remote working Software Object recognition Guidelines

Resilience of Data-Driven Cyberattack Detection systems in Smart Power Grids

学校读者我要写书评

暂无评论

Resilience of Data-Driven Cyberattack Detection Systems in S...

European Signal Processing Conference (EUSIPCO)

作者： Abdulrahman Takiddin Rachad Atat Hayat Mbayed Muhammad Ismail Erchin Serpedin Department of Electrical and Computer Engineering Florida State University Tallahassee FL USA Electrical and Computer Engineering Program Texas A&M University at Qatar Doha Qatar Center for Advanced Power Systems Florida State University Tallahassee FL USA Department of Computer Science Tennessee Technological University Cookeville TN USA Department of Electrical and Computer Engineering Texas A&M University College Station TX USA

ISBN: (数字)9789464593617

ISBN: (纸本)9798331519773

Data communications within the smart power grid components are susceptible to cyberattacks due to the inter-connected nature of the grid and reliance on communication networks. Such cyberattacks can exploit the integrity of the exchanged data and result in operational instability. Existing data-driven cyberattack detection systems (CDSs) are proposed in the literature but their effectiveness is only verified against one type of cyberattacks. In reality, a smart grid system could encounter more than one attack type at once. Thus, in this paper, we investigate the resilience of state-of-the-art data-driven CDSs against replay false data injection, adversarial evasion, and adversarial data poisoning attacks on a realistic IEEE 118-bus system model. It turns out that a convolutional recurrent graph autoencoder-based CDS offers an attack detection rate of 96 – 97.5%, which outperforms other machine learning and deep learning-based data-driven CDSs by 16 – 54% since it captures the recurrent and spatial aspects of the data without being trained on attack data.

关键词： Deep learning Europe Feature extraction Graph neural networks Data models Smart grids Reliability computer crime Unsupervised learning Resilience

OSM: Leveraging model checking for observing dynamic 1 behaviors in aspect-oriented applications

学校读者我要写书评

暂无评论

arXiv 2024年

作者： AlSobeh, Anas Mohammad Ramadan Department of Information Systems Faculty of Information Technology and Computer Science Yarmouk University Irbid Jordan Program of Information Technology School of Computing College of Engineering Computing Technology and Mathematics Southern Illinois University CarbondaleIL United States

In the intricate domain of software systems verification, dynamically model checking multifaceted system characteristics remains paramount, yet challenging. This research proposes the advanced observe-based statistical model-checking (OSM) framework, devised to craft executable formal models directly from foundational system code. Leveraging model checking predicates, the framework melds seamlessly with aspect-oriented programming paradigms, yielding a potent method for the analytical verification of varied behavioral attributes. Exploiting the transformative capacity of OSM framework, primary system code undergoes a systematic metamorphosis into multifaceted analysis constructs. This not only simplifies the model verification process but also orchestrates feature interactions using an innovative observing join point abstraction mechanism. Within this framework, components encompassing parsing, formal verification, computational analytics, and rigorous validation are intrinsically interwoven. Marrying the principles of model checking with aspect-oriented (AO) modularization, OSM framework stands as a paragon, proficiently scrutinizing and affirming system specifications. This ensures the unyielding performance of electronic health record systems amidst shifting preconditions. OSM framework offers runtime verification of both object-oriented and AO deployments, positioning itself as an indispensable open-source resource, poised to automate the enhancement of system performance and scalability. Copyright © 2024, The Authors. All rights reserved.

关键词： Aspect oriented programming

A General Framework for Clustering and Distribution Matching with Bandit Feedback

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y.F. Scarlett, Jonathan Descartes Program CNRS@CREATE 138602 Singapore Department of Information Systems and Analytics School of Computing National University of Singapore 119077 Singapore Department of Mathematics Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore Department of Computer Science Department of Mathematics Institute of Data Science National University of Singapore 119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank–Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ *** Codes 68T05 Copyright © 2024, The Authors. All rights reserved.

关键词： Clustering algorithms