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

A fault-tolerant scheduling strategy through proactive and clustering techniques for scientific workflows in cloud computing

引用

Soft Computing 2025年第2期29卷 755-781页

作者： Farhood, Suha Mubdir Khorsand, Reihaneh Hussein, Nashwan Jasim Ramezanpour, Mohammadreza Branch Islamic Azad University Isfahan Iran Department of Programming Collage of Information Technology University of Babylon Hillah Iraq Department of Computer Engineering Mobarakeh Branch Islamic Azad University Mobarakeh Isfahan Iran

Cloud computing offers solutions for various scientific and business applications. Large-scale scientific applications, which are organized as scientific workflows, are carried out using cloud computing. However, the higher failure rates in cloud computing can be attributed to the numerous servers and components dealing with intense workloads. This study presents a fault-tolerant scheduling approach using proactive and clustering methods for scientific workflows in cloud computing. Initially, the task clustering issue is addressed by consolidating multiple short-duration tasks into a single job to improve the runtime performance of workflow executions. Subsequently, an automated workflow scheduling strategy is outlined with four key stages: monitoring, analysis, planning, and execution. During monitoring, clustered jobs and the capacities of available cloud resources are observed. In the analysis phase, the accuracy of failure prediction is enhanced by employing the Group Method of Data Handling (GMDH) neural network prior to any faults or failures. The planning stage introduces a novel hybrid multi-objective algorithm, MOPSO-aSA, based on MOPSO and adaptive simulated annealing (SA), to streamline workflow scheduling in error-prone execution environments. Moreover, the reliability of application execution is maintained through re-clustering and migration techniques following any faults or failures. Finally, based on the experimental findings, it is evident that the proposed strategy surpasses other methods in terms of makespan, total cost, energy consumption, and failure rate. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Educational Research Trends of the Use of Gaze Learning Data Through Topic Modeling and Scientometric Analysis 1st

Educational Research Trends of the Use of Gaze Learning D...

引用

1st International workshop on AI for Research, AI4Research 2024 and 4th International workshop on Democracy and AI, DemocrAI 2024, held in conjunction with 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024

作者： Lee, Jungmin Shin, Huigon Yoo, YoungJoon Choi, Jongwon Kim, Mi Song Department of Advanced Imaging GSAIM Chung-Ang University Seoul Korea Republic of Computer Programming and Analysis School of Information Technology Fanshawe College London Canada Department of Artificial Intelligence Chung-Ang University Seoul Korea Republic of Curriculum Studies Western University London Canada

ISBN: (纸本)9789819795352

Multimodal learning analytics have become increasingly important in enabling a deeper understanding of teaching and learning in educational research. However, in comparison to other multimodal learning data, there is a limited understanding of the trends within gaze learning data. To address this challenge, this study aims to identify latent topics in gaze learning data through topic modeling and scientometric analysis. We analyzed the abstracts of 573 peer-reviewed and conference proceeding papers that used gaze learning data, written in English, and published between 2008 and February 2024. The findings are as follows. First, three main topics were identified through topic modeling analysis: (learning analytics, multimodal learning, and inclusive learning). Second, the scientometric analysis revealed the structure in which diverse clusters in cited references and institutions are connected around the emerging topics. Based on these findings, the study would provide insights into research directions in both educational research and applications using gaze learning data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Study of an OPTO-ASIC for a Functionally Safe Speed Sensor Using the Spatial Frequency Filter Method

Study of an OPTO-ASIC for a Functionally Safe Speed Sensor U...

引用

IEEE Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Frank Wasinski Werner Bonath Ubbo Ricklefs Michael Schwarz Josef Börcsök Dept. of Electrical Engineering and Information Technology THM University of Applied Sciences Giessen Germany ICAS Institute for Computer Architecture and System Programming University of Kassel Kassel Germany

ISBN: (数字)9798331528010

ISBN: (纸本)9798331528027

For decades, speed sensors based on the spatial frequency filter method have successfully proven themselves in a wide range of applications. This makes the sensor concept particularly suitable for the area of functional safety. New filter variants extend the previous measuring range to very low speeds up to standstill detection. By combining the sensor with a safety system on chip for recording and analysing measured values, a functionally safe measuring chain can be established. In order to demonstrate the variability and performance of the new filters, an optical application-specific integrated circuit was designed, which forms the basis for further extensive tests. The core components are a large number of freely configurable photodiode channels, which were realised via a redundant structure, as well as two different transimpedance amplifier concepts. In the further course of the project, the ASIC will be analysed with regard to its desired performance parameters and its robustness.

关键词： Optical filters Semiconductor device measurement Optical design Stimulated emission Safety Topology System-on-chip Optical sensors Optical amplifiers Velocity measurement

来源：评论

学校读者我要写书评

暂无评论

A blockchain-oriented covert communication technology with controlled security level based on addressing confusion ciphertext

引用

Frontiers of computer Science 2025年第2期19卷 133-135页

作者： Lejun ZHANG Bo ZHANG Ran GUO Zhujun WANG Guopeng WANG Jing QIU Shen SU Yuan LIU Guangxia XU Zhihong TIAN Sergey GATAULLIN Cyberspace Institute Advanced Technology Guangzhou UniversityGuangzhou 510006China Research and Development Center for E-Learning Ministry of EducationBeijing 100039China College of Information Engineering Yangzhou UniversityYangzhou 225009China School Math and Computer Science Quanzhou Normal UniversityQuanzhou 362000China Pazhou Lab Guangzhou 510330China School of Physics and Materials Science Guangzhou UniversityGuangzhou 510006China Central Economic and Mathematics Institute Russian Academy of SciencesMoscow 117418Russia Industrial Programming Department MIREA-Russian Technological UniversityMoscow 119454Russia

1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods also exist,such as peer-to-peer networks and distributed hash *** technology,which is decentralized,anonymous,non-tamperable and anti-attack,can be applied to covert communication to solve the problems of traditional methods and improve the quality of communication.

关键词： communication tables networks

来源：评论

学校读者我要写书评

暂无评论

PRECEDENCES IN SPECIFICATIONS AND IMPLEMENTATIONS OF programming-LANGUAGES

引用

THEORETICAL computer SCIENCE 1995年第1期142卷 3-26页

作者： AASA, A Department of Computer Sciences Programming Methodology Group Chalmers University of Technology S-412 96 G?teborg Sweden

Although precedences are often used to resolve ambiguities in programming language descriptions, there has been no parser-independent definition of languages which are generated by grammars with precedence rules. This paper gives such a definition for a subclass of context-free grammars. The definition is shown to be equivalent to the implicit definition an operator precedence parser gives. A problem with a language containing infix, prefix and postfix operators of different precedences is that the well-known algorithm, which transforms a grammar with infix operator precedences to an ordinary unambiguous context-free grammar, does not work. This paper gives an algorithm that works also for prefix and postfix operators, and the correctness of it is proved. An application of the algorithm is also presented.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deleting Outliers in Robust Regression with Mixed Integer programming

引用

Acta Mathematicae Applicatae Sinica 2005年第2期21卷 323-334页

作者： Georgios Zioutas Antonios Avramidis Division of Computational Methods and Computer Programming General Department Faculty of Technology Aristotle University of Thessaloniki 541 24 Thessaloniki GreeceDivision of Computational Methods and Computer Programming General Department Faculty of Technology Aristotle University of Thessaloniki 541 24 Thessaloniki Greece

In robust regression we often have to decide how many are the unusualobservations, which should be removed from the sample in order to obtain better fitting for the restof the observations. Generally, we use the basic principle of LTS, which is to fit the majority ofthe data, identifying as outliers those points that cause the biggest damage to the robust ***, in the LTS regression method the choice of default values for high break down-point affectsseriously the efficiency of the estimator. In the proposed approach we introduce penalty cost fordiscarding an outlier, consequently, the best fit for the majority of the data is obtained bydiscarding only catastrophic observations. This penalty cost is based on robust design weights andhigh break down-point residual scale taken from the LTS estimator. The robust estimation is obtainedby solving a convex quadratic mixed integer programming problem, where in the objective functionthe sum of the squared residuals and penalties for discarding observations is minimized. Theproposed mathematical programming formula is suitable for small-sample data. Moreover, we conduct asimulation study to compare other robust estimators with our approach in terms of their efficiencyand robustness.

关键词： Robust regression quadratic mixed integer programming least trimmedsquares deleting outliers penalty methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An analysis of inline substitution for a structured programming language

引用

Communications of the ACM 1977年第9期20卷 647-654页

作者： Scheifler, Robert W. Programming Methodology Group Laboratory for Computer Science Massachusetts Institute of Technology Cambridge MA 02139 United States

An optimization technique known as inline substitution is analyzed. The optimization consists of replacing a procedure invocation by a modified copy of the procedure body. The general problem of using inline substitution to minimize execution time subject to size constraints is formulated, and an approximate algorithmic solution is proposed. The algorithm depends on run-time statistics about the program to be optimized. Preliminary results for the CLU structured programming language indicate that, in programs with a low degree of recursion, over 90 percent of all procedure calls can be eliminated, with little increase in the size of compiled code and a small savings in execution time. Other conclusions based on these results are also presented. © 1977, ACM. All rights reserved.

关键词： compilers inline substitution open coding open compilation program optimization run-time statistics structured programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：