Local energy markets (LEMs) for multi-energy systems have emerged as promising solutions to facilitate energy sharing within local communities, potentially reducing energy costs, promoting renewable energy generation,...
详细信息
Under the background of the energy revolution, the new power system is gradually transforming into the energy Internet. Withthe large-scale penetration of wind power and the diversification of service modes of region...
详细信息
Molecular simulations and molecular dynamics in particular are among the most performance-demanding computational methods. As the scale of simulations increases, the task of processing the simulation results becomes a...
详细信息
Due to the rising interest in Computer Science (CS) in primary school, block-based programming languages have gained much significance. Within this article, we provide a first insight of our research into the identifi...
详细信息
ISBN:
(纸本)9783031065279;9783031065262
Due to the rising interest in Computer Science (CS) in primary school, block-based programming languages have gained much significance. Within this article, we provide a first insight of our research into the identification of help needs of primary school children, when they are performing Scratch exercises. A first-in-class distance calculation method has been defined that takes into account the block-based programming languages idiosyncrasy.
Providing timely and meaningful feedback of programming assignments to students is very important to ensure a smooth learning curve. However, this can be a time-consuming task for teachers and instructors. there are s...
详细信息
ISBN:
(纸本)9781665443616
Providing timely and meaningful feedback of programming assignments to students is very important to ensure a smooth learning curve. However, this can be a time-consuming task for teachers and instructors. there are some tools that already provide support for grading programming assignments, and some are already integrated with learning management systems that allow teaching staff to manage all this information in a more effective way. In this work, an analysis of tools for automatic grading of programming assignments in Moodie is carried out. A comparison of these tools is presented and one of them is tested and recommended for its future implementation and deployment. Finally, some recommendations for further improvements are described.
Renewable energyEnergy is currently used to overcome fossil fuel problems. the existence of renewable energyEnergy provides a role for ordinary people to produce energyEnergy through the installation of photovoltaicPh...
详细信息
this article reviews the recent development of op-timal control-based consensus design with incomplete system knowledge. Adaptive dynamic programming, which is one of the most efficient algorithm, is widely used in so...
this article reviews the recent development of op-timal control-based consensus design with incomplete system knowledge. Adaptive dynamic programming, which is one of the most efficient algorithm, is widely used in solving the optimal consensus problem. Specifically, it will first review the optimal consensus problem. then, the technical derivations for the solution of optimal consensus problem by adaptive dynamic programming will be outlined. Important theoretical problems will be briefly discussed. It will show that adaptive dynamic programming is promising for practical applications in optimal consensus design with incomplete system knowledge.
this paper represents verification algorithms and register transfer level (RTL) specification as algebraic aspects proposed to validate the results of RTL synthesis. Major properties of this approach, the conception o...
详细信息
the Roman Domination Problem is an NP-hard combinatorial optimization problem on an undirected simple graph. It represents scenarios where a resource shall be economically distributed over its vertices while guarantee...
详细信息
ISBN:
(纸本)9783031692567;9783031692574
the Roman Domination Problem is an NP-hard combinatorial optimization problem on an undirected simple graph. It represents scenarios where a resource shall be economically distributed over its vertices while guaranteeing that each vertex has either a resource itself or at least one neighbor with a sharable surplus resource. We propose several (meta-)heuristic approaches for solving this problem. First, a greedy construction heuristic for quickly generating feasible solutions is introduced. A special feature of this heuristic is an optional advanced tiebreaker. this construction heuristic is then randomized and combined with a local search procedure to obtain a greedy randomized adaptive search procedure (GRASP). As an alternative, we further propose a simulated annealing (SA) algorithm to improve the solutions returned by the construction heuristic. As we observe different pros and cons for the GRASP and the SA, we finally combine them into a simulated annealing hybrid, which interleaves phases of greedy randomized construction and phases of simulated annealing. All algorithms are empirically evaluated on a large set of benchmark instances from the literature. We compare to an exact mixed integer linear programming model that is solved by Gurobi as well as to a variable neighborhood search from the literature. In particular the simulated annealing hybrid turns out to yield on average the best results, making it a new state-of-the-art method for the Roman domination problem.
In recent years, the programming education has become popular in Japan to improve IT skills. In fact, the programming education is spreading to the public education, including the compulsory in elementary schools. How...
详细信息
暂无评论