分类: 统计学 >> 应用统计数学 分类: 计算机科学 >> 计算机应用技术 分类: 数学 >> 建模与仿真 分类: 能源科学 >> 能源(综合) 提交时间: 2024-01-01
摘要: The surging demand for new energy vehicles is propelled by the call to conserve energy, curtail emissions, and enhance the ecological ambience. By conducting behavioral analysis and mining, particular usage patterns of new en#2;ergy vehicles are pinpointed. Regrettably, these models decrease their environ#2;mental shielding efficiency. For instance, overloading the battery, operating with low battery power, and driving at excessive speeds can all detrimentally affect the battery's performance. To assess the impact of such driving behavior on the urban ecology, an environmental computational modeling method has been pro#2;posed to simulate the interaction between new energy vehicles and the environ#2;ment. To extend the time series data of the vehicle's entire life cycle and the eco#2;logical environment within the model sequence data, I utilized the LSTM deep learning method with Bayesian optimizer optimization parameters for longer simulation. The analysis revealed the detrimental effects of poor driving behavior on the environment
分类: 计算机科学 >> 计算机科学的集成理论 分类: 数学 >> 数学(综合) 提交时间: 2021-12-14
摘要: 最近,一种名为随机排列集(Random Permutation Set RPS)的集合被提出,它考虑了一个集合中所有元素的排列。 为了度量随机排列集的不确定度,随机排列集的熵被提出。 然而,随机排列集的最大熵原理却没有详细地论证。为了解决这一问题,本文提出了随机排列集的最大熵。随机排列集的最大熵的解析解及其对应的PMF条件得到了证明与讨论。我们用数值例子说明了随机排列集的最大熵的性质。实验结果表明,随机排列集的最大熵和最大邓熵、最大香农熵相互兼容。 当忽略排列事件(Permutation Event)中元素的顺序时,随机排列集的最大熵将退化为最大邓熵。当每个排列事件只包含一个元素时,随机排列集的最大熵将退化为最大香农熵。
分类: 数学 >> 应用数学 分类: 计算机科学 >> 计算机软件 分类: 信息科学与系统科学 >> 信息与系统科学其他学科 提交时间: 2021-10-11
摘要: The shortest path problem (SPP) is a classic problem and appears in a wide range of applications. Although a variety of algorithms already exist, new advances are still being made, mainly tuned for particular scenarios to have better performances. As a result, they become more and more technically complex and sophisticated. Here we developed a novel nature-inspired algorithm to compute all possible shortest paths between two nodes in a graph: Resonance Algorithm (RA), which is surprisingly simple and intuitive. Besides its simplicity, RA turns out to be much more time-efficient for large-scale graphs than the extended Dijkstra's algorithm (such that it gives all possible shortest paths). Moreover, RA can handle any undirected, directed, or mixed graphs, irrespective of loops, unweighted or positively-weighted edges, and can be implemented in a fully decentralized manner. These good properties ensure RA a wide range of applications.
分类: 医学、药学 >> 医学、药学其他学科 分类: 数学 >> 几何与拓扑 分类: 计算机科学 >> 计算机科学的集成理论 提交时间: 2018-03-31
摘要: Labeled images are one of the most important means of scientific communication and education. However, traditional markers (arrows, lines) are point markers; do not include information about how large the feature is. We designed an efficient marker system for labeling scientific images (electron or light microscopy, CT, MRI, ultrasonography, camera pictures, etc), called the “T Area Marker, (TAM)”. The basic TAM marker looks like a “T”, composed of a line segment and a small tick on one end; it defines an imagined circle that stands on the tickless end and the diameter of the circle is equal to the length of the line segment. Thus the TAM can define an exact area rather than a single point; and the imagined circle does not break the continuity of the image (unlike traditional visible circles, rectangles, etc). A TAM with N ticks (N>1) means the diameter equals to N times the length of TAM. A TAM may also have a tail and/or several tail branches to define translation of the imagined circle, thus define complicated areas. tAreaMarker.py is free software that combines the drawing and reading of TAMs, although in most cases TAMs are easily interpreted without computer assistance.