our licenses choose

our licenses choose

 

 


// /* // * Copyright (c) Huawei Technologies Co., Ltd. 2019-2020. All rights reserved. // */ // #ifndef TRE_H // #define TRE_H // extern double AddNumbers(const double f1, const double f2); // #endif /* * Copyright (c) Shenzhen Yinwang Intelligent Technologies Co., Ltd. 2024. All rights reserved. * Description: Public Domain Tiny Regular Expressions Library * Author: Zhao Quan z00809758 * Date: 2023-7-13 10:33:55 */ // Public Domain Tiny Regular Expressions Library // Forked from https://github.com/kokke/tiny-regex-c // // Supports: // --------- // '^' Start anchor, matches start of string // '$' End anchor, matches end of string // --------- // '*' Asterisk, match zero or more (greedy, *? lazy) // '+' Plus, match one or more (greedy, +? lazy) // '{m,n}' Quantifier, match min. 'm' and max. 'n' (greedy, {m,n}? lazy) // '{m}' exactly 'm' // '{m,}' match min 'm' and max. MAX_QUANT // '?' Question, match zero or one (greedy, ?? lazy) // --------- // '.' Dot, matches any character except newline (\r, \n) // '[abc]' Character class, match if one of {'a', 'b', 'c'} // '[^abc]' Inverted class, match if NOT one of {'a', 'b', 'c'} // '[a-zA-Z]' Character ranges, the character set of the ranges { a-z | A-Z } // '\s' Whitespace, \t \f \r \n \v and spaces // '\S' Non-whitespace // '\w' Alphanumeric, [a-zA-Z0-9_] // '\W' Non-alphanumeric // '\d' Digits, [0-9] // '\D' Non-digits // '\X' Character itself; X in [^sSwWdD] (e.g. '\\' is '\') // --------- #ifndef TRE_H_INCLUDE #define TRE_H_INCLUDE #ifndef TRE_STATIC #define TRE_DEF extern #else #define TRE_DEF static #endif #ifdef __cplusplus extern "C" { #endif #define TRE_MAX_NODES 64 // Max number of regex nodes in expression. #define TRE_MAX_BUFLEN 128 // Max length of character-class buffer. typedef struct tre_node tre_node; typedef struct tre_comp tre_comp; struct tre_node { unsigned char type; union { char ch; // character char *cc; // character class buffer unsigned short mn[2]; // {m,n} quantifier } u; }; struct tre_comp { tre_node nodes[TRE_MAX_NODES]; char buffer[TRE_MAX_BUFLEN]; }; // Compile regex string pattern as tre_comp struct tregex TRE_DEF int tre_compile(const char *pattern, tre_comp *tregex); // Match tregex in text and return the match start or null if there is no match // If end is not null set it to the match end TRE_DEF const char *tre_match(const tre_comp *tregex, const char *text, const char **end); // Same but compiles pattern then matches TRE_DEF const char *tre_compile_match(const char *pattern, const char *text, const char **end); // Print the pattern TRE_DEF void tre_print(const tre_comp *tregex); #ifdef __cplusplus } #endif #endif // TRE_H_INCLUDE /* ------------------------------------------------------------------------------ This software is available under 2 licenses -- choose whichever you prefer. ------------------------------------------------------------------------------ ALTERNATIVE A - Public Domain (www.unlicense.org) This is free and unencumbered software released into the public domain. Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means. In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ------------------------------------------------------------------------------ ALTERNATIVE B - MIT License Copyright (c) 2018 kokke, monolifed Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ------------------------------------------------------------------------------ */ 有不符合C语言代码规范的地方吗
06-12
内容概要:本文围绕EKF SLAM(扩展卡尔曼滤波同步定位与地图构建)的性能展开多项对比实验研究,重点分析在稀疏与稠密landmark环境下、预测与更新步骤同时进行与非同时进行的情况下的系统性能差异,并进一步探讨EKF SLAM在有色噪声干扰下的鲁棒性表现。实验考虑了不确定性因素的影响,旨在评估不同条件下算法的定位精度与地图构建质量,为实际应用中EKF SLAM的优化提供依据。文档还提及多智能体系统在遭受DoS攻击下的弹性控制研究,但核心内容聚焦于SLAM算法的性能测试与分析。; 适合人群:具备一定机器人学、状态估计或自动驾驶基础知识的科研人员及工程技术人员,尤其是从事SLAM算法研究或应用开发的硕士、博士研究生和相关领域研发人员。; 使用场景及目标:①用于比较EKF SLAM在不同landmark密度下的性能表现;②分析预测与更新机制同步与否对滤波器稳定性与精度的影响;③评估系统在有色噪声等非理想观测条件下的适应能力,提升实际部署中的可靠性。; 阅读建议:建议结合MATLAB仿真代码进行实验复现,重点关注状态协方差传播、观测更新频率与噪声模型设置等关键环节,深入理解EKF SLAM在复杂环境下的行为特性。稀疏 landmark 与稠密 landmark 下 EKF SLAM 性能对比实验,预测更新同时进行与非同时进行对比 EKF SLAM 性能对比实验,EKF SLAM 在有色噪声下性能实验
内容概要:本文围绕“基于主从博弈的售电商多元零售套餐设计与多级市场购电策略”展开,结合Matlab代码实现,提出了一种适用于电力市场化环境下的售电商优化决策模型。该模型采用主从博弈(Stackelberg Game)理论构建售电商与用户之间的互动关系,售电商作为领导者制定电价套餐策略,用户作为跟随者响应电价并调整用电行为。同时,模型综合考虑售电商在多级电力市场(如日前市场、实时市场)中的【顶级EI复现】基于主从博弈的售电商多元零售套餐设计与多级市场购电策略(Matlab代码实现)购电组合优化,兼顾成本最小化与收益最大化,并引入不确定性因素(如负荷波动、可再生能源出力变化)进行鲁棒或随机优化处理。文中提供了完整的Matlab仿真代码,涵盖博弈建模、优化求解(可能结合YALMIP+CPLEX/Gurobi等工具)、结果可视化等环节,具有较强的可复现性和工程应用价值。; 适合人群:具备一定电力系统基础知识、博弈论初步认知和Matlab编程能力的研究生、科研人员及电力市场从业人员,尤其适合从事电力市场运营、需求响应、售电策略研究的相关人员。; 使用场景及目标:① 掌握主从博弈在电力市场中的建模方法;② 学习售电商如何设计差异化零售套餐以引导用户用电行为;③ 实现多级市场购电成本与风险的协同优化;④ 借助Matlab代码快速复现顶级EI期刊论文成果,支撑科研项目或实际系统开发。; 阅读建议:建议读者结合提供的网盘资源下载完整代码与案例数据,按照文档目录顺序逐步学习,重点关注博弈模型的数学表达与Matlab实现逻辑,同时尝试对目标函数或约束条件进行扩展改进,以深化理解并提升科研创新能力。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值