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

5th IEEE Conference on Energy Internet and Energy System Integration, EI2 2021

作者： Zhou, Kaile Hu, Dingding Li, Fangyi Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education School of Management Hefei University of Technology Hefei230009 China

ISBN: (纸本)9781665434256

The COVID-19 pandemic has forced many governments around the world to implement strict lockdown measures and order citizens to stay at home, which has caused a major change in travel patterns. This study leveraged electric vehicle charging big data in Hefei, Anhui Province, China to estimate electric vehicle charging demand in the absence of the COVID-19 pandemic using multi-layer perceptron model, which quantified the impact of the COVID-19 pandemic. In addition, we employed the vector autoregressive model to investigate the dynamic relationships between the changes in charging demand and various explanatory factors. The results suggest that the daily average charging demand in Hefei decreased by 78.3% compared to the predicted value during the pandemic. Furthermore, according to the variance decomposition and impulse response function analysis, national confirmed COVID-19 cases play a dominant role in reducing charging demand. The number of daily hospitalizations and Migration Scale Index also have significant and robust effect on the decrease in charging demand. The Air Quality Index and Baidu Index are susceptible to external factors and do not have a direct impact on the change in charging demand. Findings support a better understanding of changes in travel behavior during the pandemic and provide policy makers with references to deal with similar events. © 2021 IEEE

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Competition in durable goods markets with product failures into consideration 9

Competition in durable goods markets with product failures i...

引用

9th International Symposium on Project Management, ISPM 2021

作者： Tian, Jianfei Qian, Xiaofei School of management Hefei University of Technology Anhui China Key Laboratory of Process Optimization and Intelligent Decision-making of the Ministry of Education China

ISBN: (纸本)9781921712777

Few studies on competition in dual channel for durable goods take the product failures into consideration. However, the factors related to preventive maintenance (PM) and minimal maintenance (MM) have an important impact on the optimal profits of the manufacturer and retailer. Consequently, we develop three game models (Single Selling channel (SS), Manufacturer Stackelberg (MS) and Cooperation Model (CM)) to study the players’ equilibrium solutions and analyze the impact of the initial point, numbers and level of preventive maintenance on equilibrium price and profits. We find that the equilibrium wholesale and retail price under SS tend to increase when the manufacturer decides to raise the repair charge, while in MS the manufacturer and retailer will select a higher level for the wholesale price, retail price and rental charge when manufacturer chooses to put off the initial point for PM. In addition, numerical examples are provided to supplement our conclusions. The results show that the manufacturer in MS will set the numbers and level of PM to the maximum threshold in order to maximize its profit. © ISPM *** right reserved.

关键词： Preventive maintenance

来源：评论

学校读者我要写书评

暂无评论

Joint optimization of Production and Shipping for Small Orders Considering Less-Than-Container Loading 4th

Joint Optimization of Production and Shipping for Small Orde...

引用

4th International Conference on Resources and Environmental Research, ICRER 2022

作者： Tian, Yajing Wang, Guoqiang Chen, Yingying Luo, He School of Management Hefei University of Technology Hefei China Key Laboratory of Process Optimization & Intelligent Decision-Making Ministry of Education Hefei China

ISBN: (纸本)9783031318078

This paper introduces a joint optimization problem of production and shipping for overseas small orders considering less-than-container loading (LCL) in manufacturing enterprises. The problem consists of finding a production schedule together with a LCL shipping scheme simultaneously to minimize the total cost. An integer programming model is developed, and the genetic algorithm of enhanced elite reservation (SEGA) is used to solve large-sized instances. Besides, the performance of SEGA is compared with the classical genetic algorithm (SGA) and stallion genetic algorithm (stud GA). It is statistically shown that SEGA outperforms other algorithms in finding near-optimal solutions. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Loading

来源：评论

学校读者我要写书评

暂无评论

A hybrid ant colony algorithm for the Cutting Stock Problem

A hybrid ant colony algorithm for the Cutting Stock Problem

引用

2010 International Conference on Future Information Technology and Management Engineering, FITME 2010

作者： Peng, Jin Chu, Zhang Shu School of Management Hefei University of Technology Key Laboratory Process Optimization and Intelligent Decision-Making Ministry of Education Hefei Anhui Province China

ISBN: (纸本)9781424490882

This study presents a new hybrid ant colony algorithm (HACO) to solve an in integer linear programming formulation of the Cutting Stock Problem(CSP). The CSP is an important class combinatorial problem. It is appropriate to minimize the raw material used by industries for fulfilling customer's demands. In such cases, classic models for solving the cutting stock problem are useless. HACO consists of GDCP procedure and modified ACO (MACO). GDCP procedure provides dominative cutting patterns as MACO solution components, in MACO the pheromone trail is put on cutting patterns instead of items. MACO preserves cutting patterns and frequencies information under ants building solution procedure. Results obtained from computational experiments for ten benchmarks demonstrate that the performance of MACO is compared to that obtained using existing mete-heuristic algorithm. © 2010 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Data stream closed frequent itemsets mining in blend window

Data stream closed frequent itemsets mining in blend window

引用

2012 International Conference on Computer Science and Service System, CSSS 2012

作者： Wu, Hao Wang, Huiying Li, Huaiying Jiang, Miao School of Management Hefei University of Technology India Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei 230009 China

ISBN: (纸本)9780769547190

In data stream mining, sliding window can record the latest and most useful patterns, but the best size can not be accurately determined. To aim at data with the characteristics of data flow in some simulation systems, this paper proposes a method for mining the closed frequent patterns in the mixed window of data stream. The pattern of data stream could be completely recorded by scanning the stream only once. And the pruning method of T-Moment could reduce the space complexity of sliding window tree and the maintenance cost of the closed frequent patterns tree. To differentiate the historical and the latest patterns, a time decaying model was applied. The experimental results show that the algorithm has good efficiency and accuracy. © 2012 IEEE.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Multi agent negotiation model for distributed task allocation

Multi agent negotiation model for distributed task allocatio...

引用

2010 2nd IEEE International Conference on Information Management and Engineering, ICIME 2010

作者： Luo, He Hu, Xiao-Jian Hu, Xiao-Xuan School of Management Hefei University of Technology Hefei China Key Laboratory of Ministry of Education on Process Optimization and Intelligent Decision Making Hefei China

ISBN: (纸本)9781424452644

In the multi agent system, negotiation between different agents becomes more and more complex when the distributed tasks need to be allocated among them. Usually, this process has been done in the centralized way where agents have all the information of both the tasks and the environment. However, in the real application such as satellite scheduling problem or production scheduling problem, not all the information can be acquired, some of them even cannot be known. Therefore, in this paper, we propose a multi agent negotiation model for distributed task allocation in a priority based environment. This process is modeled as a finite Markov decision process (F-MDP), and a coordinated negotiation protocol is also suggested to support the model. The experiments show that tasks are allocated in an efficient way, and it can also reduce the communication cost. © 2010 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

POLYNOMIAL DYNAMIC PROGRAMMING ALGORITHMS FOR LOT SIZING MODELS WITH BOUNDED INVENTORY AND STOCKOUT AND/OR BACKLOGGING

引用

Journal of Systems Science and Systems Engineering 2016年第3期25卷 370-397页

作者： Jinhong Zhong Feng Chu Chengbin Chu Shanlin Yang School of Management Hefei University of Technology Hefei 230009 China Laboratoire IBISC Universite d'Evry-Val d'Essone France Laboratoire Genie Industriel Ecole Centrale Paris France Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education Hefei China

This paper addresses a dynamic lot sizing problem with bounded inventory and stockout where both no backlogging and backlogging allowed cases are considered. The stockout option means that there is outsourcing in a period only when the inventory level at that period is non-positive. The production capacity is unlimited and production cost functions are linear but with fixed charges. The problem is that of satisfying all demands in the planning horizon at minimal total cost. We show that the no backlogging case can be solved in O（T^2） time with general concave inventory holding and outsourcing cost functions where T is the length of the planning horizon. The complexity can be reduced to O（T） when the inventory holding cost functions are also linear and have some realistic properties, even if the outsourcing cost functions remain general concave functions. When the inventory holding and outsourcing cost functions are linear, the backlogging case can be solved in O（ T^3 logT） time whether the outsourcing level at each period is bounded by the sum of the demand of that period and backlogging level from previous periods, or only by the demand of that period.

关键词： Dynamic lot sizing problem bounded inventory outsourcing backlogging stockout,dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Smart surgical telementoring system with patch-to-pixel point tracking method

EngMedicine

引用

EngMedicine 2025年第1期2卷

作者： Yanwei Qu Ling Li Tongtong Li Jieyu Zheng Wentao Tang Xiaojian Li School of Management Hefei University of Technology Hefei 230009 Anhui China Philosophy and Social Sciences Laboratory of Data Science and Smart Society Governance Ministry of Education Hefei 230009 Anhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei 230009 Anhui China Hefei Haochuan Information Technology Co. Ltd Hefei 230088 Anhui China Ministry of Education Engineering Research Center for Intelligent Decision-Making Information System Technologies Hefei 230009 Anhui China

The utilization of surgical telementoring has become increasingly prevalent in enhancing the surgical standards of grassroots hospitals in contemporary times. In the traditional framework of surgical telementoring, remote doctors guide grassroots doctors via video and audio communication, which may encounter obstacles such as inadequate information transfer and challenges in accurately pinpointing the surgical site and path. To mitigate these issues, this study introduces an intelligent surgical telementoring system based on edge computing. This system enables the transmission of points marked by remote doctors to grassroots doctors, updating these points’ coordinates in real-time on the local endoscopic video. In this system, a novel method named P2PTracking (Patch-to-Pixel Point Tracking) is implemented. This process begins with the tracking of a square patch surrounding the point marked by the remote doctor using SiameseFC. Following this, feature matching is performed on the tracked patch in the current frame and the square patch in the labelled frame or template frame. The affine transformation is then calculated based on the feature matching results. Lastly, the point tracking result is derived using the computed affine transformation. Experimental results indicate that the proposed system has a transmission speed of 1.99M/s and a transmission latency of 171 ms when transmitting video at a resolution of 1920 × 1080px, while the proposed method can achieve an accuracy of 96.6 % when the pixel error is 4. The code and data are available at https://***/hfut66/*** .

关键词： Surgical telementoring Patch tracking Point tracking Feature matching Template update mechanism

来源：评论

学校读者我要写书评

暂无评论

Multi-keyframe Guided Points Tracking Method for Enhanced Robotic Surgery

Multi-Keyframe Guided Points Tracking Method for Enhanced Ro...

引用

2024 IEEE International Conference on Robotics and Biomimetics, ROBIO 2024

作者： Li, Xiaojian Li, Tongtong Ma, Xiang Li, Ling Mo, Hangjie Zheng, Jieyu School of Management Hefei University of Technology Hefei China Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-Making Hefei China

ISBN: (纸本)9781665481090

Points tracking provides target guidance for the basic tasks of robotic surgery, such as autonomous cutting, autonomous suturing, and surgical navigation. Existing invivo tracking algorithms mainly consider region-level tracking, making it difficult to achieve pixel-level accuracy. This paper proposes a multi-keyframe guided tracking method (MKTracking) for robotic surgery, which achieves long-term dynamic tracking of any point on endoscopic images. An incremental keyframe pool building block based on time interval and image appearance is proposed, which contains keyframe basic information, tracking patch and tracking points. Besides, an online multi-keyframe query mechanism is designed to efficiently retrieves the three most similar templates from the keyframe pool based on the number of feature matches within the target patch. This mechanism can realize the identification of target moving out and the re-tracking of target reappearance. Points tracking result is obtained by fusing the optical flow results within the target patch across multiple frames. We evaluated MKTracking using ground-truth data, and the results demonstrated that our approach achieved superior tracking performance. © 2024 IEEE.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Independent or Social Driven decision? A Counterfactual Refinement Strategy for Graph-Based Social Recommendation

引用

ACM Transactions on Information Systems 2025年第3期43卷

作者： Dongyang Li Jianshan Sun Chongming Gao Fuli Feng Kun Yuan School of Management Hefei University of Technology China School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education China University of Science and Technology of China Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology) China University of Science and Technology of China China Hefei University of Technology Key Laboratory of Philosophy and Social Sciences for Cyberspace Behaviour and Management China

Social recommendation models have traditionally relied on social homophily to enhance user preference prediction by incorporating information from socially connected friends. However, this approach neglects the diverse nature of social relationships. Some individuals with independent personalities often prioritize their own interests over friends’ advice when making purchase decisions. Conversely, those who seek advice from others are more susceptible to social influence. Moreover, existing methods tend to overlook redundant and noisy social relationships within the network, hindering their ability to achieve accurate recommendations. In response, this paper proposes a novel counterfactual method to understand the causal factors driving purchase behaviors, thereby identifying the influence of users’ friends on their purchase decisions. By answering counterfactual questions about the influence of a friend's purchase behavior on the user's choices, we develop a causal model to represent social influence in the network. Our proposed refinement strategy, grounded in causal inference, generates counterfactual purchase behavior and guides the refinement of the social graph. Moreover, we present tailored graph refinement methods at various levels, ensuring fine-grained improvements. Experimental results on benchmark data demonstrate that the application of our strategy to different social recommendation models significantly enhances their predictive performance. The source code has been made available on https://***/LDY911/CFRSSR-Code.

关键词： social recommendation graph denoising causal inference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：