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

Analysis of the Voltage Ramp Rate Effects on the programming Characteristics of Bipolar-Type Memristive Devices

IEEE TRANSACTIONS ON NANOTECHNOLOGY 2025年 24卷 205-208页

作者： Miranda, E. Piros, E. Aguirre, F. L. Kim, T. Schreyer, P. Gehrunger, J. Schwarz, T. Oster, T. Hofmann, K. Sune, J. Hochberger, C. Alff, L. Univ Autonoma Barcelona Dept Engn Elec tron Cerdanyola Del Valles 08193 Spain Tech Univ Darmstadt Inst Mat Sci D-64287 Darmstadt Germany Tech Univ Darmstadt Dept Elect Engn & Informat Technol D-64283 Darmstadt Germany

We investigate in this letter the role the voltage ramp rate plays in the conduction and programming characteristics of bipolar-type memristive devices. It is shown that speeding up the writing or erasing process of a memristor is beneficial in terms of energy consumption but has a side cost associated with power dissipation. This happens because of the dynamical aspects of the set and reset transitions which are ultimately dictated by the physics of metal ions and oxygen vacancies migration. It is shown that by adding a constant base voltage to the voltage sweep, shorter programming times can be achieved but no significant impact on the power dissipation-energy consumption relationship is observed. Modeling and simulations are carried out with the aid of the Dynamic Memdiode Model and its implementation in LTspice using the Method of Elementary Solvers. Since the device model parameters and simulation conditions can vary in a wide range, the complete schematics are provided so that the interested readers can test different casuistries by themselves.

关键词： Voltage Mathematical models programming Memristors Integrated circuit modeling Random access memory Switches Power dissipation Ions Energy consumption Memristor resistive switching energy consumption power dissipation SPICE LTspice

来源：评论

学校读者我要写书评

暂无评论

Evaluate Chat-GPT's programming capability in Swift through real university exam questions

引用

SOFTWARE-PRACTICE & EXPERIENCE 2024年第11期54卷 2129-2143页

作者： Zhang, Zizhuo Wen, Lian Jiang, Yanfei Liu, Yongli Changan Univ Informat & Network Management Off Xian Peoples R China Griffith Univ Sch ICT Brisbane Australia Xian Rail Transit Grp Co Ltd Technol Ctr Xian Peoples R China Changan Univ Sch Informat Engn Xian Peoples R China

In this study, we evaluate the programming capabilities of OpenAI's GPT-3.5 and GPT-4 models using Swift-based exam questions from a third-year university course. The results indicate that both GPT models generally outperform the average student score, yet they do not consistently exceed the performance of the top students. This comparison highlights areas where the GPT models excel and where they fall short, providing a nuanced view of their current programming proficiency. The study also reveals surprising instances where GPT-3.5 outperforms GPT-4, suggesting complex variations in AI model capabilities. By providing a clear benchmark of GPT's programming skills in an academic context, our research contributes valuable insights for future advancements in AI programming education and underscores the need for continued development to fully realize AI's potential in educational settings.

关键词： chat-GPT evaluation exam GPT programming swift

来源：评论

学校读者我要写书评

暂无评论

Block processing time-based programming for high-speed, high-precision 5-axis machining

引用

PRECISION ENGINEERING-JOURNAL OF THE INTERNATIONAL SOCIETIES FOR PRECISION ENGINEERING AND NANOTECHNOLOGY 2024年 88卷 497-515页

作者： Otsuki, Toshiaki Sasahara, Hiroyuki Tokyo Univ Agr & Technol Dept Mech Syst Engn 2-24-16 Naka Cho Koganei Tokyo 1848588 Japan

For high-speed and high-precision machining with orthogonal 3-axis minute line segment commands, a program should be generated by appropriately reducing the chord error (tolerance) or the block length (line segment length) based on the computer numerical control (CNC) block processing time Tb. The block processing time Tb is the duration from when the CNC decodes one block command in a program until when it controls the motors, depending on the processing power of the CNC. Accordingly, even in simultaneous 5-axis machining, it is necessary to research whether programs generated based on Tb can achieve high-speed and high-precision machining. Therefore, this study aims to realize simultaneous 5-axis machining at higher speed and precision using CNC programs with minute line segment commands based on Tb. In addition, we propose a more general identification method compared with that used in previous studies to identify Tb. Simultaneous 5-axis programs include two cases of control, namely, tool center point (TCP) control and Non-TCP control, and Tb was identified for both controls. For the machining method, using the block length based on Tb, we generated programs to machine the upper flat surface of a workpiece using simultaneous 5-axis machining while rotating the two rotary axes using a ball-end mill. We machined the workpiece and evaluated the machining speed and precision of the machined surface. We showed that simultaneous 5-axis machining with higher speed and precision can be achieved using programs based on Tb. In addition, we analyzed and considered the reasons for the higher-speed and higher-precision machining.

关键词： High-speed high -precision machining 5-Axis machining programming Block processing time Block length Tool center point control

来源：评论

学校读者我要写书评

暂无评论

FracGM: A Fast Fractional programming Technique for Geman-McClure Robust Estimator

引用

IEEE ROBOTICS AND AUTOMATION LETTERS 2024年第12期9卷 11666-11673页

作者： Chen, Bang-Shien Lin, Yu-Kai Chen, Jian-Yu Huang, Chih-Wei Chern, Jann-Long Sun, Ching-Cherng Natl Taiwan Normal Univ Dept Math Taipei 106209 Taiwan MediaTek Inc Hsinchu 30078 Taiwan Natl Cent Univ Dept Commun Engn Taoyuan 320317 Taiwan Natl Cent Univ Dept Opt & Photon Taoyuan 320317 Taiwan

Robust estimation is essential in computer vision, robotics, and navigation, aiming to minimize the impact of outlier measurements for improved accuracy. We present a fast algorithm for Geman-McClure robust estimation, FracGM, leveraging fractional programming techniques. This solver reformulates the original non-convex fractional problem to a convex dual problem and a linear equation system, iteratively solving them in an alternating optimization pattern. Compared to graduated non-convexity approaches, this strategy exhibits a faster convergence rate and better outlier rejection capability. In addition, the global optimality of the proposed solver can be guaranteed under given conditions. We demonstrate the proposed FracGM solver with Wahba's rotation problem and 3-D point-cloud registration along with relaxation pre-processing and projection post-processing. Compared to state-of-the-art algorithms, when the outlier rates increase from 20% to 80%, FracGM shows 53% and 88% lower rotation and translation increases. In real-world scenarios, FracGM achieves better results in 13 out of 18 outcomes, while having a 19.43% improvement in the computation time.

关键词： Estimation programming Point cloud compression Accuracy Optimization Convergence Three-dimensional displays Robustness Transforms Sun Mapping optimization optimal control

来源：评论

学校读者我要写书评

暂无评论

What strategies do students use when they are programming a robot to follow a curved line?

引用

INTERNATIONAL JOURNAL OF TECHNOLOGY AND DESIGN EDUCATION 2024年第2期34卷 691-710页

作者： Anderhag, Per Salomonsson, Niklas Buergers, Andre Estay Espinola, Cesar Fahrman, Birgit Seifeddine Ehdwall, Dana Sundler, Maria Stockholm Univ Dept Teaching & Learning Stockholm Sweden Stockholm Municipal Educ & Adm Stockholm Sweden Nacka Municipal Nacka Gymnasium Nacka Sweden Huddinge Municipal Children & Educ Adm Huddinge Sweden Royal Inst Technol Dept Learning Stockholm Sweden Botkyrka Municipal Educ Adm Botkyrka Sweden

During a relatively short period of time, programming has been implemented in the national curriculum of the compulsory school in Sweden. Since 2018, programming is a new content in the technology subject and the research field has discussed some of the challenges teachers and students, who generally have little experiences of programming, face when programming is introduced in teaching. In this study, we have explored what strategies lower secondary school students (ages 13-15) use when they are programming a robot to follow a curved line in technology education class. Data consists of screen recorded films when students are pair programming a robot. Student talks were transcribed verbatim and analysed using Practical Epistemological Analysis. The analysis revealed three different strategies that the students used when programming the robot: (1) sensor-follow the line, searching for a code that automatically would make the robot to follow the route, (2) sensor-wheels, using codes to create a feedback system between sensor and wheels, and (3) rotations-degrees-wheels, using the position of the robot to stepwise fine tune the movement of the wheels. In line with previous research, the students in our study spent much time discussing, testing, and debugging their code, and our findings contribute by showing how these discussions were aligned with the strategy used. Depending on the strategy, students actively looked for and tested codes affecting different aspects of the sensor-wheel system, such as for example sensor input, power, rotations or turning. Implications for teaching is discussed.

关键词： programming Robots Follow a line Strategies Technology education Lower secondary school

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning-Based Adaptive Feedback System to Enhance programming Skill Using Computational Thinking

引用

IEEE ACCESS 2024年 12卷 59431-59440页

作者： Kaleem, Muhammad Hassan, Muhammad Awais Khurshid, Syed Khaldoon Univ Engn & Technol Lahore Dept Comp Sci Lahore 39161 Pakistan

The solution of a typical programming task involves algorithmic thinking, pattern recognition, decomposition, and abstraction skills. These skills are basic pillars of Computational thinking (CT) and are essential for a computer programmer. Therefore, a programming teacher needs to take these skills into account for the evaluation of students. Existing methods for improving programming competency don't consider the Computational Thinking of students and perform grading of students without taking these skills into account. Due to this limitation, deficiencies of these skills in students remain unrevealed, posing difficulties for educators to provide need-oriented feedback. The performance of programming students is thus hindered by a lack of interventions. This study proposes a method to evaluate programming students in terms of CT skill components and group them based on their skill set. In this study, 780 students of object-oriented programming (OOP) class were given programming assignments for assessment of programming competencies. These students were then given small programming tasks requiring different computational thinking skill components for their solutions. A machine learning approach was used to perform grouping of these students based on their scores. Six groups of programming students, each having its own set of skill deficiencies, were identified as a result of clustering. One of the groups had an empty set of skill deficiencies and consisted of students proficient in programming. Each of the other five groups had a non-empty set of skill deficiencies and comprised non-proficient programming students. A group-specific skill development plan was built for the groups having skill deficiencies. It was found that such feedback was very effective and improved the CT skill deficiencies of 82% of students.

关键词： programming programming profession Codes Task analysis Source coding Clustering algorithms Feedback Cognitive systems Object oriented programming Machine learning Education Performance evaluation Computational thinking assessment feedback K-means clustering programming

来源：评论

学校读者我要写书评

暂无评论

NURBS-Based Sequential Convex programming for Onboard Trajectory Optimization

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2024年第4期60卷 3807-3821页

作者： Zhao, Mengxin Pan, Binfeng Ran, Yunting Huang, Longxin Northwestern Polytech Univ Sch Astronaut Xian 710072 Peoples R China

This article proposes an enhanced approach to sequential convex programming for optimizing onboard trajectories by incorporating nonuniform rational basis splines (NURBS) curves. The contributions of the proposed method are threefold. First, it effectively reduces the number of optimization variables by utilizing NURBS curves as representations for control variables. Second, the convex-hull property of NURBS curves enables the replacement of the control inequality constraints with those defined by NURBS control points, leading to a significant reduction in the overall number of constraints. Finally, the integration of the homotopy approach with NURBS curves offers increased flexibility in shaping the curves and facilitates the solution of optimization problems involving bang-bang optimal control. Numerical demonstrations are provided to illustrate the effectiveness and efficiency of the proposed approach for onboard applications.

关键词： Splines (mathematics) Surface topography Surface reconstruction Vectors programming Optimization Trajectory optimization Convex-hull property homotopy approach nonuniform rational basis splines (NURBS) curves sequential convex programming (SCP) trajectory optimization

来源：评论

学校读者我要写书评

暂无评论

Fractional programming-Based Uplink Transmission Power Allocation for User-Centric Cell-Free Massive MIMO Systems

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING

引用

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2024年第1期8卷 50-63页

作者： Sarker, Manobendu Fapojuwo, Abraham O. Univ Calgary Dept Elect & Software Engn Calgary AB T2N 1N4 Canada

In this paper, two centralized power allocation schemes are proposed for data transmission during the uplink phase in the user-centric cell-free (CF) massive multiple-input multiple-output (mMIMO) systems. The proposed schemes solve two non-convex power allocation problems of maximizing the summation of spectral efficiency (SE) (max-sum-SE) and that of maximizing the minimum SE (max-min-SE) to improve the overall SE and fairness performance while simultaneously reducing the per-user equipment (UE) transmission power. To solve the max-sum-SE problem, we utilize the fractional programming (FP) method to transform the non-convex problem into a series of convex problems. Furthermore, the max-min-SE problem is solved after reformulating it with the help of the FP method along with the alternating direction method of multipliers (ADMM) technique. The proposed schemes are computationally efficient as they solve the aforementioned problems iteratively by using only closed-form updates for the decision variables, which is one of their strongest features, and suitable for allocating power in large-scale CF mMIMO systems. Numerical results demonstrate that, compared to the no power control scheme, the proposed schemes improve the average SE performance by up to 47% while reducing the average transmission power by up to 95%.

关键词： Resource management Minimax techniques Optimization programming Computational efficiency Performance evaluation Interference Massive MIMO cell-free massive MIMO centralized control data power allocation max-min fairness fractional programming ADMM max-sum-SE B5G

来源：评论

学校读者我要写书评

暂无评论

CCDF-TAP: A Context-Aware Conflict Detection Framework for IoT Trigger-Action programming With Graph Neural Network

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第19期11卷 31534-31544页

作者： Xing, Yongheng Hu, Liang Du, Xinqi Shen, Zhiqi Hu, Juncheng Wang, Feng Jilin Univ Coll Comp Sci & Technol Changchun 130012 Peoples R China Jilin Univ Sch Artificial Intelligence Changchun 130012 Peoples R China Nanyang Technol Univ Joint NTU UBC Res Ctr Excellence Act Living Elderl Singapore Singapore Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

The rapid expansion of the Internet of Things (IoT) has led to the development of smart homes and automation systems. Trigger-action programming (TAP) has emerged as a prevalent paradigm used in IoT, facilitating the creation of automation rules. However, with the proliferation of TAP rules, the potential for conflicts between them grows significantly, which results in undesired outcomes or even safety risks. In this article, we propose a context-aware conflict detection framework for TAP rules, called CCDF-TAP, to identify the potential rule conflicts. Specifically, we incorporate external knowledge and context information during the TAP data preprocessing stage, which is conducive to accurately defining the rule conflicts. Then, based on the above information, the conflict types are defined and a conflict graph is constructed, which establishes a unified format for the rule conflict detection task. Finally, we propose a novel algorithm called dual-channel graph attention auto-encoders (DualGAAs) for efficient conflict detection, which takes the conflict graph as the input and excels in accurately identifying conflicts. Extensive experiments conducted on a comprehensive IFTTT data set demonstrate the superiority of DualGAA in detecting conflicts, achieving an exceptional accuracy of 98.85% and an F1 score of 98.91%. The contributions of our study offer a comprehensive end-to-end solution for context-aware conflict detection in TAP rules, thereby significantly enhancing the security and dependability of IoT smart home systems.

关键词： Internet of Things Security programming Windows Smart homes Graph neural networks Data mining Conflict detection graph neural network (GNN) Internet of Things (IoT) trigger-action programming (TAP)

来源：评论

学校读者我要写书评

暂无评论

Designing Feeder Bus Routes: A Two-Stage programming Model Using Existing Bus Stops

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年

作者： Li, Weijun Cheng, Guozhu Northeast Forestry Univ Sch Civil & Transportat Harbin 150006 Peoples R China

To effectively address the service gap in the first and last mile connections of metro systems, a two-stage model was developed for designing feeder bus services. The first-stage was the feeder bus stop selection model, which was used to select feeder bus stops from existing conventional bus stops. In this stage, we proposed a method to merge stops to prevent feeder bus stops from being too close to each other. The second-stage was the feeder bus route planning model, which was used to plan routes between the feeder bus stops selected in the first-stage. A two-stage heuristic algorithm was established to efficiently solve the two-stage model. The practicality of the proposed approach was verified in Harbin. The results showed that: 1) bus stop merging method could reduce the stop overlap rate by 59.32% while decreasing the stop coverage rate by only 4.07%;2) stop selection impacts route planning, and their integration in the two-stage model could ensure optimized feeder bus services;3) compared with the conventional model, the two-stage model could reduce the total travel time by 27.17%;and 4) appropriately increasing the number of routes could reduce the average route length. The proposed method provides a reference for designing feeder bus services.

关键词： Planning Legged locomotion Costs Urban areas Merging Traffic congestion Public transportation programming Heuristic algorithms Roads Feeder bus design two-stage programming model feeder bus stop selection feeder bus route planning bus stop merging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：