Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Engineering
Chatgpt, Lamda, And The Hype Around Communicative Ai: The Automation Of Communication As A Field Of Research In Media And Communication Studies, Andreas Hepp, Wiebke Loosen, Stephan Dreyer, Juliane Jarke, Sigrid Kannengießer, Christian Katzenbach, Rainer Malaka, Michaela Pfadenhauer, Cornelius Puschmann, Wolfgang Schulz
Chatgpt, Lamda, And The Hype Around Communicative Ai: The Automation Of Communication As A Field Of Research In Media And Communication Studies, Andreas Hepp, Wiebke Loosen, Stephan Dreyer, Juliane Jarke, Sigrid Kannengießer, Christian Katzenbach, Rainer Malaka, Michaela Pfadenhauer, Cornelius Puschmann, Wolfgang Schulz
Human-Machine Communication
The aim of this article is to more precisely define the field of research on the automation of communication, which is still only vaguely discernible. The central thesis argues that to be able to fully grasp the transformation of the media environment associated with the automation of communication, our view must be broadened from a preoccupation with direct interactions between humans and machines to societal communication. This more widely targeted question asks how the dynamics of societal communication change when communicative artificial intelligence—in short: communicative AI—is integrated into aspects of societal communication. To this end, we recommend an approach that …
Classification Of Arabic Social Media Texts Based On A Deep Learning Multi-Tasks Model, Ali A. Jalil, Ahmed H. Aliwy
Classification Of Arabic Social Media Texts Based On A Deep Learning Multi-Tasks Model, Ali A. Jalil, Ahmed H. Aliwy
Al-Bahir Journal for Engineering and Pure Sciences
The proliferation of social networking sites and their user base has led to an exponential increase in the amount of data generated on a daily basis. Textual content is one type of data that is commonly found on these platforms, and it has been shown to have a significant impact on decision-making processes at the individual, group, and national levels. One of the most important and largest part of this data are the texts that express human intentions, feelings and condition. Understanding these texts is one of the biggest challenges that facing data analysis. It is the backbone for understanding …
Enhanced Load Balancing Based On Hybrid Artificial Bee Colony With Enhanced Β-Hill Climbing In Cloud, Maha Zeedan, Gamal Attiya, Nawal El-Fishawy
Enhanced Load Balancing Based On Hybrid Artificial Bee Colony With Enhanced Β-Hill Climbing In Cloud, Maha Zeedan, Gamal Attiya, Nawal El-Fishawy
Mansoura Engineering Journal
This paper proposes enhanced load balancer based artificial bee colony and β-Hill climbing for improving the performance metrics such as response time, processing cost, and utilization to avoid overloaded or under loaded situations of virtual machines. In this study, the suggested load balancer is called enhanced load balancing based on hybrid artificial bee colony with enhanced β-Hill climbing (ELBABCEβHC) to improve the response time, processing cost and the resource utilization. Our proposed approach starts by ranking the task then the greedy randomized adaptive search procedure (GRASP) is used in initializing populations. Further, the binary artificial bee colony (BABC) enhanced with …
Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal
Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal
Theory and Applications of Graphs
Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, and then using the hop distance as a means to find the shortest paths between the ASes. A less significant drawback is restricting the shortest paths to only valley-free paths. Both approaches usually inflate the number of paths between ASes; introduce erroneous paths that do not conform to …
The Software Of Multi-Criteria And Multi-Level Estimation Of Investment Projects, E.B. Khaltursunov
The Software Of Multi-Criteria And Multi-Level Estimation Of Investment Projects, E.B. Khaltursunov
Acta of Turin Polytechnic University in Tashkent
Here presents are research and developed algorithms and programs of multi-criteria and multi-level estimations of investment projects, tool-kit for generating multi-criteria and multi-level estimations of variants of investment projects.
Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook
Verification Of Costless Merge Pairing Heaps, Joshua Vander Hook
Journal of Undergraduate Research at Minnesota State University, Mankato
Most algorithms’ performance is limited by the data structures they use. Internal algorithms then decide the performance of the data structure. This cycle continues until fundamental results, verified by analysis and experiment, prevent further improvement. In this paper I examine one specific example of this. The focus of this work is primarily on a new variant of the pairing heap. I will review the new implementation, compare its theoretical performance, and discuss my original contribution: the first preliminary data on its experimental performance. It is instructive to provide some background information, followed by a formal definition of heaps in 1.1. …
Fast Software Multiplication In F_2[X] For Embedded Processors, Serdar Süer Erdem
Fast Software Multiplication In F_2[X] For Embedded Processors, Serdar Süer Erdem
Turkish Journal of Electrical Engineering and Computer Sciences
We present a novel method for fast multiplication of polynomials over F_2 which can be implemented efficiently in embedded software. Fast polynomial multiplication methods are needed for the efficient implementation of some cryptographic and coding applications. The proposed method follows a strategy to reduce the memory accesses for input data and intermediate values during computation. This strategy speeds up the binary polynomial multiplication significantly on typical embedded processors with limited memory bandwidth. These multiplications are usually performed by the comb method or the Karatsuba-based methods in embedded software. The proposed method has speed and memory advantages over these methods on …