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

international conference on Engineering Education (ICEED)

作者： John S. Y. Lee Fengkai Liu Tianyuan Cai Department of Linguistics and Translation City University of Hong Kong Hong Kong SAR China

ISBN: (数字)9798350367416

ISBN: (纸本)9798350367423

programming is an essential part of the curriculum for electrical, computer and software engineering students. Since one inevitably makes coding mistakes, it is important for programmers to develop debugging skills. However, it could be challenging for beginners to repair a non-compiling program, since programming error messages tend to be opaque, and might not directly address the error. this paper investigates the use of Large Language Models to generate plain, novice-friendly explanations of programming error messages. In an introductory course on Natural Language Processing, We evaluate the extent to which these explanations help students debug Python code with six common programming error categories. Experimental results suggest that explanations generated with zero-shot GPT-4 are effective in raising the code revision success rate.

关键词： Codes Large language models Debugging Maintenance engineering Encoding logic Engineering education programming profession Software engineering Python

来源：评论

学校读者我要写书评

暂无评论

Automatic Construction of Image Inspection Algorithm By using Image Processing Network programming 13

Automatic Construction of Image Inspection Algorithm By usin...

引用

13th international conference on Quality Control by Artificial Vision

作者： Yoshimura, Yuichiro Aoki, Kimiya Chukyo Univ Grad Sch Dept Informat Sci & Technol Nagoya Aichi Japan

ISBN: (数字)9781510611221

ISBN: (纸本)9781510611214;9781510611221

In this paper, we discuss a method for automatic programming of inspection image processing. In the industrial field, automatic program generators or expert systems are expected to shorten a period required for developing a new appearance inspection system. So-called "image processing expert system" have been studied for over the nearly 30 years. We are convinced of the need to adopt a new idea. Recently, a novel type of evolutionary algorithms, called genetic network programming (GNP), has been proposed. In this study, we use GNP as a method to create an inspection image processing logic. GNP develops many directed graph structures, and shows excellent ability of formulating complex problems. We have converted this network program model to Image Processing Network programming (IPNP). IPNP selects an appropriate image processing command based on some characteristics of input image data and processing log, and generates a visual inspection software with series of image processing commands. It is verified from experiments that the proposed method is able to create some inspection image processing programs. In the basic experiment with 200 test images, the success rate of detection of target region was 93.5%.

关键词： visual inspection appearance inspection inspection mechanism genetic network programming

来源：评论

学校读者我要写书评

暂无评论

Implementing logic Operations in Gold Nanoparticles Colloidal Suspensions

Implementing Logic Operations in Gold Nanoparticles Colloida...

引用

international conference on Modern Circuits and Systems Technologies (MOCAST)

作者： Raphael Fortulan Noushin Raeisi Kheirabadi Alexei Antipov Carsten Jost Alessandro Chiolerio Andrew Adamatzky Unconventional Computing Laboratory University of the West of England Bristol UK PlasmaChem GmbH Schwarzschildstraβe 10 Berlin Germany Center for Bioinspired Soft Robotics Istituto Italiano di Tecnologia Genova Italy

ISBN: (数字)9798350385427

ISBN: (纸本)9798350385434

this work experimentally demonstrates the computational capabilities of gold nanoparticle colloidal suspensions. Here we implement Boolean logic gates in Au nanoparticle solutions by applying binary input signals through electrical stimulation and recording the electrical output responses. the output signals are thresholded to derive logical expressions. the results show that Au colloids can exhibit conjunction, disjunction, and negation operations. Unique sum-of-products expressions are discovered for 2-bit and 4-bit binary string inputs, with increased complexity observed for 4-bit strings. the rich computational behaviour exhibited highlight the potential of colloidal solutions for unconventional computational devices.

关键词： Nanoparticles Gold Liquids logic circuits logic gates programming Electrical stimulation

来源：评论

学校读者我要写书评

暂无评论

Ynot : Dependent types for imperative programs

引用

ACM SIGPLAN NOTICES 2008年第9期43卷 229-240页

作者： Nanevski, Aleksandar Morrisett, Greg Shinnar, Avraham Govereau, Paul Birkedal, Lars Microsoft Res Cambridge England Harvard Univ Cambridge MA 02138 USA IT Univ Copenhagen Copenhagen Denmark

We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. Coq already includes a powerful functional language that supports dependent types, but that language is limited to pure, total functions. the key contribution of our extension, which we call Ynot, is the added support for computations that may have effects such as non-termination, accessing a mutable store, and throwing/catching exceptions. the axioms of Ynot form a small trusted computing base which has been formally justified in our previous work on Hoare Type theory (HTT). We show how these axioms can be combined with the powerful type and abstraction mechanisms of Coq to build higher-level reasoning mechanisms which in turn can be used to build realistic, verified software components. To substantiate this claim, we describe here a representative series of modules that implement imperative finite maps, including support for a higher-order (effectful) iterator. the implementations range from simple (e.g., association lists) to complex (e.g., hash tables) but share a common interface which abstracts the implementation details and ensures that the modules properly implement the finite map abstraction.

关键词： languages verification type theory Hoare logic separation logic monads

来源：评论

学校读者我要写书评

暂无评论

Resource provisioning for IoT application services in smart cities

Resource provisioning for IoT application services in smart ...

引用

international conference on Network and Service Management

作者： José Santos Tim Wauters Bruno Volckaert Filip De Turck Department of Information Technology IDLab Gent Belgium

In the last years, traffic over wireless networks has been increasing exponentially, due to the impact of Internet of things (IoT) and Smart Cities. Current networks must adapt to and cope with the specific requirements of IoT applications since resources can be requested on-demand simultaneously by multiple devices on different locations. One of these requirements is low latency, since even a small delay for an IoT application such as health monitoring or emergency service can drastically impact their performance. To deal with this limitation, the Fog computing paradigm has been introduced, placing cloud resources on the edges of the network to decrease the latency. However, deciding which edge cloud location and which physical hardware will be used to allocate a specific resource related to an IoT application is not an easy task. therefore, in this paper, an Integer Linear programming (ILP) formulation for the IoT application service placement problem is proposed, which considers multiple optimization objectives such as low latency and energy efficiency. Solutions for the resource provisioning of IoT applications within the scope of Antwerp's City of things testbed have been obtained. the result of this work can serve as a benchmark in future research related to placement issues of IoT application services in Fog Computing environments since the model approach is generic and applies to a wide range of IoT use cases.

关键词： logic gates Cloud computing Smart cities Bandwidth Wireless communication Edge computing Optimization

来源：评论

学校读者我要写书评

暂无评论

A monte carlo study of randomised restarted search in ILP

引用

14th international conference on inductive logic programming, ILP 2004

作者： Železný, Filip Srinivasan, Ashwin Page, David in Prague Karlovo Nám. 13 Prague121 35 Czech Republic IBM India Research Laboratory Indian Institute of Technology Block 1 New Delhi110 016 India Dept. Of Biostatistics and Medical Informatics Dept. Of Computer Science University of Wisconsin 1300 University Ave. MadisonWI53706 United States

ISBN: (纸本)9783540229414

Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that if the search cost distribution (SCD) of the non-restarted randomised search exhibits a slower-than-exponential decay (that is, a "heavy tail"), restarts can reduce the search cost expectation. Recently, this heavy tail phenomenon was observed in the SCD’s of benchmark ILP problems. Following on this work, we report on an empirical study of randomised restarted search in ILP. Our experiments, conducted over a cluster of a few hundred computers, provide an extensive statistical performance sample of five search algorithms operating on two principally different ILP problems (artificially generated graph data and the wellknown "mutagenesis" problem). the sample allows us to (1) estimate the conditional expected value of the search cost (measured by the total number of clauses explored) given the minimum clause score required and a "cutoff" value (the number of clauses examined before the search is restarted);and (2) compare the performance of randomised restarted search strategies to a deterministic non-restarted search. Our findings indicate that the cutoff value is significantly more important than the choice of (a) the specific refinement strategy;(b) the starting element of the search;and (c) the specific data domain. We find that the optimal value for the cutoff parameter remains roughly stable across variations of these three factors and that the mean search cost using this value in a randomised restarted search is up to three orders of magnitude (i.e. 1000 times) lower than that obtained with a deterministic non-restarted search. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

On Energy Efficient Scheduling and Load Distribution Based on Renewable Energy for Wireless Mesh Network in Disaster Area

On Energy Efficient Scheduling and Load Distribution Based o...

引用

IEEE international conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Meng Li Hiroki Nishiyama Yasunori Owada Kiyoshi Hamaguchi Graduate School of Information Sciences Tohoku University Japan National Institute of Information and Communication Technology Japan

In recent years, disasters happened in many places, and resulted in power shortage and communication interruption. the Wireless Mesh Networks (WMNs) constituted by Renewable Energy-enabled Base Station (REBS) is regarded as a powerful solution in post-disaster recovery, for its energy harvesting ability and the ready-made facilities. However, this solution needs to address several challenges such as unstable power supply, limited bandwidth and long-term optimization. In this paper, we focus on the issue of energy efficiency when realizing the maximal network throughput in a period of time, by the combination of energy usage and network data distribution. To this end, we firstly analyze the unique features of REBS and its associated network in disaster area. then a throughput-maximization problem is proposed in order to figure out the maximal network throughput. Based on the maximal value, we count out the most energy-efficiency result while guaranteeing the maximal network throughput. We formulate the proposed model into a two-stage Mixed-Integer Linear programming (MILP) problem and solve it by branch-and-bound algorithm. Simulation results demonstrate our considered two-stage energy efficient scheme strikes a balance between network throughput and its associated energy consumption, and outperforms the existing schemes.

关键词： Base stations throughput Energy harvesting Energy consumption logic gates Renewable energy sources Batteries

来源：评论

学校读者我要写书评

暂无评论

Fostering programming Resilience: Developing a Scale for Secondary Schools

Fostering Programming Resilience: Developing a Scale for Sec...

引用

international conference on Engineering Education (ICEED)

作者： Dayang N A Jawawi Nor Azizah Saadon Nurul Nazihah Jamal Shahliza Abd Halim Radziah Mohamad Mohd Adham Isa Haza Nuzly Abdul Hamed Khatibsyarbini Faculty of Computing Universiti Teknologi Malaysia Skudai Johor Malaysia

ISBN: (数字)9798350367416

ISBN: (纸本)9798350367423

In the realm of programming education, students often face challenges such as syntax and logic errors, necessitating resilience to persevere through programming problems. programming resilience is essential for school students as it nurtures problem-solving abilities, perseverance, creativity, adaptability, confidence, and essential life skills that extend beyond coding. To address this, the present study introduces the programming Resilience Scale for Secondary Schools (PR3S) tailored for secondary school students in Malaysia engaging with robotics education through mobile robot programming. For the PR3S, 13 items were retained for the five constructs, namely: persistence, perceived value, difficulty cognition, incremental belief, and building networks. Data was collected from 90 secondary students participating in robotics programs. Validity assessments demonstrated the scale's efficacy in measuring programming resilience among secondary school students engaging with robotics education. Notably, findings revealed no significant differences were observed among gender, location, age, and background knowledge. Students' preferences have an impact on the resilience of students in learning programming, students who have an interest in robotics and programming achieved higher scores compared to students who do not have an interest. the PR3S is anticipated to serve as a valuable tool for educators and researchers in identifying students encountering challenges in programming, facilitating early interventions, and promoting resilience-building activities within the context of robotics programming education in Malaysian secondary schools.

关键词： Technological innovation Buildings programming Encoding Cognition Problem-solving Mobile robots programming profession Faces Resilience

来源：评论

学校读者我要写书评

暂无评论

Fog Networks in Healthcare Application

Fog Networks in Healthcare Application

引用

IEEE Internatonal conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Suryadip Chakraborty Satyajit Bhowmick Paul Talaga Dharma P. Agrawal Department of Electrical Engineering and Computing Systems University of Cincinnati Cincinnati OH United States of America

ISBN: (纸本)9781509028344

Fog computing is a recently proposed computing paradigm that extends Cloud computing and services to the edge of the network. the new features offered by fog computing (e.g., distributed analytics and edge intelligence), if successfully applied for time-sensitive healthcare applications, has great potential to accelerate the discovery of early notification of emergency situations to support smart decision making. While promising, how to design and develop real-world fog computing-based data monitoring system is still an open question. As a first step to answer this question, in this research, we employ a fog-based cloud paradigm for time-sensitive medical applications and also propose to show the practical applicability and significance of such a novel system. the ubiquitous deployment of mobile and sensor devices is creating a new environment, namely the Internet of things (IoT) that enables a wide range of future Internet applications. In this work, we present dynamic Fog, a high level programming model for time-sensitive applications that are geospatially distributed, large-scale, and latency-sensitive. We also analyze our fog model with healthcare data, more specifically with Heartrate data that is one of the most time-sensitive medical data which deals with life and death situations. Our experiments show that our proposed system achieves minimum delay while it also achieves the data accuracy and data consistency which are very important in many applications like medical data.

关键词： Medical services Edge computing Cloud computing logic gates Delays Mobile communication Monitoring

来源：评论

学校读者我要写书评

暂无评论

Toward molecular programming with DNA

Toward molecular programming with DNA

引用

Proceedings of the 13th international conference on Architectural support for programming languages and operating systems

作者： Erik Winfree California Institute of Technology Pasadena CA

ISBN: (纸本)9781595939586

Biological organisms are beautiful examples of programming. the program and data are stored in biological molecules such as DNA, RNA, and proteins; the algorithms are carried out by molecular and biochemical processes; and the end result is the creation and function of an organism. If we understood how to program molecular systems, what could we create? Lifelike technologies whose basic operations are chemical reactions? the fields of chemistry, physics, biology, and computer science are converging as we begin to synthesize molecules, molecular machines, and molecular systems of ever increasing complexity, leading to subdisciplines such as DNA nanotechnology, DNA computing, and synthetic biology. Having demonstrated simple devices and systems -- self-assembled structures, molecular motors, chemical logic gates -- researchers are now turning to the question of how to create large-scale integrated systems. To do so, we must learn how to manage complexity: how to efficiently specify the structure and behavior of intricate molecular systems, how to compile such specifications down to the design of molecules to be synthesized in the lab, and how to ensure that such systems function robustly. these issues will be illustrated for chemical logic circuits based on cascades of DNA hybridization *** Erik Winfree is an Associate Professor in Computer Science, Computation & Neural Systems, and Bioengineering at Caltech. Winfree is the recipient of the Feynman Prize for Nanotechnology (2006), the NSF PECASE/CAREER Award (2001), the ONR Young Investigators Award (2001), a MacArthur Fellowship (2000), and MIT Technology Review's first TR100 list of "top young innovators" (1999). Prior to joining the faculty at Caltech in 2000, Winfree was a Lewis thomas Postdoctoral Fellow in Molecular Biology at Princeton, and a Visiting Scientist at the MIT AI Lab. Winfree received a B.S. in Mathematics w/ Computer Science from the University of Chicago in 1991, and a Ph.D. in Computati

关键词： molecular programming DNA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：