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

Research on Precise Tracking Control of Gear-Shifting Actuator for Non-Synchronizer Automatic Mechanical Transmission Based on Sleeve Trajectory Planning

引用

ENERGIES 2024年第5期17卷 1092页

作者： Gongye, Xiangyu Du, Changqing Li, Longjian Huang, Cheng Wang, Jinhai Dai, Zhengli Wuhan Univ Technol Hubei Key Lab Adv Technol Automot Components Wuhan 430070 Peoples R China Chongqing Tiema Ind Grp Co Ltd Chongqing 400050 Peoples R China

The Non-Synchronizer Automated Mechanical Transmission (NSAMT) demonstrates a straightforward structure and cost-effectiveness;however, the primary obstacle to its widespread application lies in NSAMT shift control. The implementation of active angle alignment effectively addresses the issue of shifting quality, but achieving active angle alignment necessitates precise tracking of the planned shifting curve by the gear-shifting actuator. To tackle the control problem of accurate tracking for NSAMT shift actuators, this paper initially analyzes the structure and shift characteristics of the NSAMT. Based on this analysis, a physical model is established using Amesim, incorporating a drive motor, two-gear NSAMT, shift actuator, sleeve, and DC motor model. An extended state observer (ESO) is designed to mitigate unknown interference within the system. Furthermore, an active angle alignment control algorithm based on "zero speed difference" and "zero angle difference" for double target tracking is constructed while planning the axial motion trajectory of the sleeve. The Backstepping algorithm is employed to successfully track and regulate this planned trajectory. Finally, through Hardware-in-the-Loop testing, we validate our proposed control strategy, which demonstrates consistent results with simulation outcomes, thereby affirming its effectiveness.

关键词： Non-Synchronizer Automated Mechanical Transmission active angle alignment shift actuator control algorithm design

来源：评论

学校读者我要写书评

暂无评论

Adapting B⁺-Tree for Emerging Nonvolatile Memory-Based Main Memory

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 2016年第9期35卷 1461-1474页

作者： Chi, Ping Lee, Wang-Chien Xie, Yuan Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

Among the emerging nonvolatile memory (NVM) technologies, some resistive memories, including phase change memory (PCM), spin-transfer torque magnetic random access memory (STT-RAM), and metal-oxide resistive RAM (ReRAM), have been considered as promising replacements of conventional dynamic RAM (DRAM) to build future main memory systems. Main memory databases can benefit from their nice features, such as their low leakage power and nonvolatility, the high density of PCM, the good read performance and low read energy consumption of STT-RAM, and the low cost of ReRAM's crossbar architecture. However, they also have some disadvantages, such as their long write latency, high write energy, and limited lifetime, which bring challenges to database algorithm design for NVM-based memory systems. In this paper, we focus on the design of the ubiquitous B+-tree, aiming to make it NVM-friendly. We present a basic cost model for NVM-based memory systems which distinguishes writes from reads, and propose detailed CPU cost and memory access models for search, insert, and delete operations on a B+-tree. Based on the proposed models, we analyze the CPU costs and memory behaviors of the existing NVM-friendly B+-tree schemes, and find that they suffer from three issues. To address these issues we propose three different schemes. Experimental results show that our schemes can efficiently improve the performance, reduce the memory energy consumption, and extend the lifetime for NVM-based memory systems.

关键词： algorithm design B+-tree cost model main memory database nonvolatile memory (NVM)

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON FEATURE EXTRACTION algorithm OF OIL PAINTING ARTISTIC STYLE BASED ON EMOTIONAL EXPRESSION

引用

SURFACE REVIEW AND LETTERS 2024年第0期

作者： Huang, Xianhui Xiao, Banruo Zhong, Xingyu Wang, Yi South China Normal Univ Sch Fine Art Guangzhou 510632 Peoples R China South China Normal Univ Artificial Intelligence Inst Guangzhou 511400 Peoples R China

We present a novel approach to extracting artistic style features from oil paintings, addressing the limitations of existing one-way matrices. Our proposed algorithm focuses on capturing emotional expression in oil painting styles. To ensure relevance to real-world needs and standards, we establish a multi-objective framework with a set of indicators and parameters for fundamental oil painting artistic style extraction. This expansion of the feature extraction calculation range involves the creation of a multi-objective calculation matrix and the development of a pyramid sequence and extraction algorithm for conveying emotional expression. By leveraging local constraints specific to oil paintings, our method effectively extracts artistic style features. The results of our tests, which involved five oil paintings, demonstrate the effectiveness of our approach. By applying the Artistic Style Feature Extraction (ASFE) algorithm based on emotional expression, we successfully control the differences in oil painting texture depth within a range of 0.65. This indicates a high level of authenticity and accuracy in our algorithm, superior calculation performance, and practical utility for various applications.

关键词： Emotional expression oil painting art style characteristics extraction algorithm algorithm design artistic transformation

来源：评论

学校读者我要写书评

暂无评论

Collective multi agent deployment for wireless sensor network maintenance

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2021年 102卷 104265-104265页

作者： Yedidsion, Harel Hermelin, Danny Segal, Michael Univ Texas Austin Austin TX 78712 USA Ben Gurion Univ Negev Beer Sheva Israel

In this paper, we study the problem of wireless sensor network (WSN) maintenance using a team of physical autonomous mobile agents. The agents are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and repair it. The team must constantly optimize its collective deployment to account for occupied agents. The objective is to define the optimal deployment and task allocation strategy, that minimize the solution cost. The solution cost is a linear combination of the weighted sensors' downtime, the agents' traveling distance, and penalties incurred due to unrepaired sensors within a certain time limit. Our proposed solution algorithms are inspired by research in the field of computational geometry and the design of our algorithms is based on state of the art approximation algorithms for the classical problem of facility location. We empirically compare and analyze the performance of several proposed algorithms. The sensitivity of the algorithms' performance to the following parameters is analyzed: agents to sensors ratio, sensors' sparsity, frequency and distribution of failures, repair duration, repair capacity, and communication limitations. Our results demonstrate that: (i) cooperation enhances the team's performance by orders of magnitude, (ii) k-Median based deployment algorithm provides up to 30% improvement in downtime, (iii) k-Center based deployment incurs 10% fewest penalties, and (iv) k-Centroid based deployment is most efficient in terms of minimizing the overall costs, with up to 21% lower cost than the next best algorithm.

关键词： Multi agent coordination Wireless sensor networks Mobile agents algorithm design

来源：评论

学校读者我要写书评

暂无评论

TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK** Parts of this work were presented in the preliminary version at the HiPS workshop of IPPS’99 (Puerto Rico)and at the PaCT’99 conference (St. Petersburg)

引用

Parallel algorithms and Applications 2001年第2期16卷 87-121页

作者： M. Aldinucci[a] S. Gorlatch[b] C. Lengauer[b] S. Pelagatti[a] [a] Dipartimento di Informatica Universit di Pisa Pisa Italy [b] Fakultat fur Mathematik und Informatik Universitat Passau Passau Germany

A Functional Abstract Notation (FAN) is proposed for the specification and design of parallel algorithms by means ofskeletons- high-level patterns with parallel semantics. The main weakness of the current programming systems based on skeletons ii that the user is still responsible for finding the most appropriate skeleton composition for a given application and a given parallel architectureWe describe a transformational framework for the development of skeletal programs which is aimed at filling this gap. The framework makes use oftransformation ruleswhich are semantic equivalences among skeleton compositions. For a given problem, an initial, possibly inefficient skeleton specification is refined by applying a sequence of transformations. Transformations are guided by a set of performance prediction models which forecast the behavior of each skeleton and the performance benefits of different rules. The design process is supported by a graphical tool which locates applicable transformations and provides performance estimates, thereby helping the programmer in navigating through the program refinement space. We give an overview of the FAN framework and exemplify its use with performance-directed program derivations for simple case studies. Our experience can be viewed as a first feasibility study of methods and tools for transformational, performance-directed parallel programming using skeletons.

关键词： Parallel programming Program transformations algorithm design Skeletons Functional programming Performance models Program refinement tools

来源：评论

学校读者我要写书评

暂无评论

Truthful mechanism for joint resource allocation and task offloading in mobile edge computing

引用

COMPUTER NETWORKS 2024年 254卷

作者： Liu, Xi Liu, Jun Li, Weidong Qujing Normal Univ Sch Informat Engn Key Lab Intelligent Sensor & Syst Design Qujing Yunnan Peoples R China Qujing Normal Univ Engn Res Ctr Intelligent Syst & Adv Mat Yunnan Pro Qujing Yunnan Peoples R China Yunnan Coll Business Management Sch Educ Kunming Yunnan Peoples R China Yunnan Univ Sch Math & Stat Kunming Yunnan Peoples R China

In the context of mobile edge computing (MEC), the delay-sensitive tasks can achieve real-time data processing and analysis by offloading to the MEC servers. The objective is maximizing social welfare in an auction- based model. However, the distances between mobile devices and access points lead to differences in energy consumption. Unfortunately, existing works have not considered both maximizing social welfare and minimizing energy consumption. Motivated by this, we address the problem of joint resource allocation and task offloading in MEC, with heterogeneous MEC servers providing multiple types of resources for mobile devices (MDs) to perform tasks remotely. We split the problem into two sub-problems: winner determination and offloading decision. The first sub-problem determines winners granted the ability to offload tasks to maximize social welfare. The second sub-problem determines how to offload tasks among the MEC servers to minimize energy consumption. In the winner determination problem, we propose a truthful algorithm that drives the system into equilibrium. We then show the approximate ratios for single and multiple MEC servers. In the offloading decision problem, we propose an approximation algorithm. We then show it is a polynomial- time approximation scheme for a single MEC server. Experiment results show that our proposed mechanism finds high-quality solutions in changing mobile environments.

关键词： Mobile edge computing Truthfulness Energy consumption algorithm design Polynomial time approximation scheme

来源：评论

学校读者我要写书评

暂无评论

Pressure Time Dose as a Representation of Intracranial Pressure Burden and Its Dependency on Intracranial Pressure Waveform Morphology at Different Time Intervals

引用

SENSORS 2023年第19期23卷 8051-8051页

作者： Schoenenberg-Tu, Anna-Li Cysarz, Dirk Petzold, Benjamin Bluemel, Carl Benjamin Raak, Christa Fricke, Oliver Edelhaeuser, Friedrich Scharbrodt, Wolfram Gemeinschaftskrankenhaus Herdecke Chair Integrat Neuromed D-58313 Herdecke Germany Witten Herdecke Univ Inst Integrat Med D-58313 Herdecke Germany Witten Herdecke Univ Integrated Curriculum Anthroposoph Med D-58313 Herdecke Germany Witten Herdecke Univ Fac Hlth Dept Human Med D-58455 Witten Germany Klinikum Stuttgart Dept Child & Adolescent Psychiat & Psychotherapy D-70174 Stuttgart Germany

Intracranial pressure (ICP) burden or pressure time dose (PTD) is a valuable clinical indicator for pending intracranial hypertension, mostly based on threshold exceedance. Pulse frequency and waveform morphology (WFM) of the ICP signal contribute to PTD. The temporal resolution of the ICP signal has a great influence on PTD calculation but has not been systematically studied yet. Hence, the temporal resolution of the ICP signal on PTD calculation is investigated. We retrospectively analysed continuous 48 h ICP recordings with high temporal resolution obtained from 94 patients at the intensive care unit who underwent neurosurgery due to an intracranial haemorrhage and received an intracranial pressure probe (43 females, median age: 72 years, range: 23 to 88 years). The cumulative area under the curve above the threshold of 20 mmHg was compared for different temporal resolutions of the ICP signal (beat-to-beat, 1 s, 300 s, 1800 s, 3600 s). Events with prolonged ICP elevation were compared to those with few isolated threshold exceedances. PTD increased for lower temporal resolutions independent of WFM and frequency of threshold exceedance. PTDbeat-to-beat best reflected the impact of frequency of threshold exceedance and WFM. Events that could be distinguished in PTDbeat-to-beat became magnified more than 7-fold in PTD1s and more than 104 times in PTD1h, indicating an overestimation of PTD. PTD calculation should be standardised, and beat-by-beat PTD could serve as an easy-to-grasp indicator for the impact of frequency and WFM of ICP elevations on ICP burden.

关键词： intracranial pressure waveform analysis algorithm design ICP burden pressure time dose area under the curve time intervals

来源：评论

学校读者我要写书评

暂无评论

Computing the k densest subgraphs of a graph

引用

INFORMATION PROCESSING LETTERS 2023年 179卷

作者： Dondi, Riccardo Hermelin, Danny Univ Bergamo Bergamo Italy Ben Gurion Univ Negev Beer Sheva Israel

Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial-time. As such, the densest subgraph model has emerged as the most popular notion of cohesiveness. Recently, the data mining community has started looking into the problem of computing k densest subgraphs in a given graph, rather than one. In this paper we consider a natural variant of the k densest subgraphs problem, where overlap between solution subgraphs is allowed with no constraint. We show that the problem is fixed-parameter tractable with respect to k, and admits a PTAS for constant k. Both these algorithms complement nicely the previously known O (nk) algorithm for the problem. (c) 2022 Elsevier B.V. All rights reserved.

关键词： algorithm design Network mining and analysis Densest subgraph algorithmic aspects of networks algorithms

来源：评论

学校读者我要写书评

暂无评论

Cooperative Cache Transfer-based On-demand Network Coded Broadcast in Vehicular Networks

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2019年第4期18卷 38-38页

作者： Ali, G. G. Md Nawaz Noor-A-Rahim, Md Rahman, Md Ashiqur Ayalew, Beshah Chong, Peter H. J. Guan, Yong Liang Clemson Univ Dept Automot Engn Greenville SC 29607 USA Univ Coll Cork Sch Comp Sci & IT Cork Ireland Univ Arizona Dept Comp Sci Tucson AZ 85721 USA Auckland Univ Technol Dept Elect & Elect Engn Auckland New Zealand Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore

Real-time traffic updates, safety and comfort driving, infotainment, and so on, are some envisioned applications in vehicular networks. Unlike traditional broadcast, network-coding-assisted broadcast can satisfy multiple vehicles with different data items in a coded form. However, server side encoding requires the prior knowledge about vehicles' cache information for the successful decoding at the vehicles' sides. The explicit cache upload from vehicles to Road Side Unit (RSU) wastes upload bandwidth. In multi-RSU vehicular networks, we propose a Cooperative Cache Transfer-based On-demand Network Coded Broadcast called CCTCB. In the proposed CCTCB approach, vehicles do not need to upload their cache information to the server, rather the RSU server learns the vehicles' cache intrinsically. We derive a probabilistic model to analyze the coding opportunity in the proposed cooperative cache transfer mechanism incorporating vehicle mobility. The comprehensive simulation results validate the superiority of the proposed approach.

关键词： Vehicular communication network coding on-demand broadcast cooperative cache transfer algorithm design

来源：评论

学校读者我要写书评

暂无评论

Load balance technique with adaptive position updates (LAPU) for geographic routing in MANETs

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2018年第1期2018卷 73-73页

作者： Venkatraman, Santhi Sarvepalli, Sai Kiran PSG Coll Technol Dept Comp Sci & Engn Coimbatore Tamil Nadu India

In geographic routing, position updates and load distribution are crucial to achieve a good performance. There is a concern with load distribution when it comes to dense network where there are large number of connections and huge traffic. Load balanced, Adaptive Position Update (LAPU) routing protocol solves the problem of load distribution among paths in a network with reduced position updates occurring adaptively and next hop decisions based on node's congestion status in geographic routing. In our proposed work, to achieve load balancing, a node selects two best nodes available to the destination based on node mobility and queue length and it divides the load among them, i.e., it transfers the packets in both paths. Parameters such as end-to-end delay of packet transmission, energy consumption, throughput, and routing overhead are considered to compare the performance of the proposed work.

关键词： Adaptive position updates algorithm design Beacon updating Load balancing Routing On demand learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：