Image encryption algorithm based on multiple chaotic systems and improved Joseph block scrambling

With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and protect intellectual property rights,this study proposes an innovative color image encryption algorithm.Initially,the Mersenne Twister algorithm is utilized to generate high-quality pseudo-random numbers,establishing a robust basis for subsequent operations.Subsequently,two distinct chaotic systems,the autonomous non-Hamiltonian chaotic system and the tentlogistic-cosine chaotic mapping,are employed to produce chaotic random sequences.These chaotic sequences are used to control the encoding and decoding process of the DNA,effectively scrambling the image pixels.Furthermore,the complexity of the encryption process is enhanced through improved Joseph block scrambling.Thorough experimental verification,research,and analysis,the average value of the information entropy test data reaches as high as 7.999.Additionally,the average value of the number of pixels change rate(NPCR)test data is 99.6101%,which closely approaches the ideal value of 99.6094%.This algorithm not only guarantees image quality but also substantially raises the difficulty of decryption.

An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time

Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario.In this study,we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem(TSP)with life-strength constraints.To address this problem,we proposed an improved iterated greedy(IIG)algorithm.First,a push-forward insertion heuristic(PFIH)strategy was employed to generate a high-quality initial solution.Second,a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ability.Furthermore,three problem-specific swap operators were developed to improve the algorithm’s exploitation ability.Additionally,an improved simulated annealing(SA)strategy was used as an acceptance criterion to effectively prevent the algorithm from falling into local optima.To verify the effectiveness of the proposed algorithm,the Solomon dataset was extended to generate 27 instances for simulation.Finally,the proposed IIG was compared with five state-of-the-art algorithms.The parameter analysiswas conducted using the design of experiments(DOE)Taguchi method,and the effectiveness analysis of each component has been verified one by one.Simulation results indicate that IIGoutperforms the compared algorithms in terms of the number of rescue survivors and convergence speed,proving the effectiveness of the proposed algorithm.

Improved Operation Characteristics for Nonvolatile Charge-Trapping Memory Capacitors with High-κ Dielectrics and SiGe Epitaxial Substrates

A novel high-κ~ A1203/HfO2/AI203 nanolaminate charge trapping memory capacitor structure based on SiGe substrates with low interface densities is successfully fabricated and investigated. The memory capacitor exhibits excellent program-erasable characteristics. A large memory window of ~4 V, a small leakage current density of ~2 ×10-6 Acre-2 at a gate voltage of 7V, a high charge trapping density of 1.42 × 1013 cm-2 at a working vo]tage of 4-10 V and good retention characteristics are observed. Furthermore, the programming （△ VFB = 2.8 V at 10 V for 10μs） and erasing speeds （△VFB =-1.7 V at -10 V for 10μs） of the fabricated capacitor based on SiGe substrates are significantly improved as compared with counterparts reported earlier. It is concluded that the high-κ Al2O3/HfO2/Al2O3 nanolaminate charge trapping capacitor structure based on SiGe substrates is a promising candidate for future nano-scaled nonvolatile flash memory applications.

ZTE DSLAM Improves Operators' Carbon Footprint and Slashes Power Costs

ZTE Corporation (ZTE), a leading global provider of telecommunications equipment and network solutions, revealed on May 6, 2008 that its award winning Broadband Universal Access System could help operators make a major impact on their carbon footprint as well as save millions of dollars a year in power costs. ZTE’s DSLAM ZXDSL FSAP 9806H overreaches the European code of conduct on energy consumption for broadband equipment, offering a significant power consumption savings per port.

Study on Optimization of Urban Rail Train Operation Control Curve Based on Improved Multi-Objective Genetic Algorithm

A multi-objective improved genetic algorithm is constructed to solve the train operation simulation model of urban rail train and find the optimal operation curve.In the train control system,the conversion point of operating mode is the basic of gene encoding and the chromosome composed of multiple genes represents a control scheme,and the initial population can be formed by the way.The fitness function can be designed by the design requirements of the train control stop error,time error and energy consumption.the effectiveness of new individual can be ensured by checking the validity of the original individual when its in the process of selection,crossover and mutation,and the optimal algorithm will be joined all the operators to make the new group not eliminate on the best individual of the last generation.The simulation result shows that the proposed genetic algorithm comparing with the optimized multi-particle simulation model can reduce more than 10%energy consumption,it can provide a large amount of sub-optimal solution and has obvious optimization effect.

An improved self-adaptive membrane computing optimization algorithm and its applications in residue hydrogenating model parameter estimation

In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied improved self-adaptive crossover and mutation formulae that can provide appropriate crossover operator and mutation operator based on different functions of the objects and the number of iterations. The performance of ISMC was tested by the benchmark functions. The simulation results for residue hydrogenating kinetics model parameter estimation show that the proposed method is superior to the traditional intelligent algorithms in terms of convergence accuracy and stability in solving the complex parameter optimization problems.

Research on Resource Scheduling of Cloud Computing Based on Improved Genetic Algorithm

In order to solve the problem that the resource scheduling time of cloud data center is too long,this paper analyzes the two-stage resource scheduling mechanism of cloud data center.Aiming at the minimum task completion time,a mathematical model of resource scheduling in cloud data center is established.The two-stage resource scheduling optimization simulation is realized by using the conventional genetic algorithm.On the technology of the conventional genetic algorithm,an adaptive transformation operator is designed to improve the crossover and mutation of the genetic algorithm.The experimental results show that the improved genetic algorithm can significantly reduce the total completion time of the task,and has good convergence and global optimization ability.

Heuristics for Improving Operational Performance of Permutation Circulati on-type Vehicle Routing System

This paper discusses an optimization of operating a p ermutation circulation-type vehicle routing system (PCVRS, for short), in w hich several stages are located along by a single loop, and a fleet of vehicles travels on the loop unidirectionally and repeatedly. Traveling on the loop, each vehicle receives an object from the loading stage and then carries it to a cert ain processing stage, or receives an object from a certain processing stage and then carries it to the unloading stage per a turnaround. No passing is allowed f or the vehicles on the loop (from which the system is called permutation, and th is restriction may cause interferences between vehicles). Material handling systems such as PCVRS are actually encountered in flexible man ufacturing systems and in automated storage/retrieval systems. In this paper, we propose a heuristic algorithm for operating the PCVRS, which i ncorporates a new scheduling method for the vehicles with the SPT (shortest proc essing time) numbering of jobs and a round-robin manner of allocating jobs to t he stages, aiming to reduce interferences between the vehicles. We also give num erical results with respect to system performances attained by the heuristic. Description of the system The PCVRS consists of a set of n v vehicles V={V 1,V 2,...,V n v}, a set of n s, processing stages S p={S 1,S 2,...,S n s}, a loading stage S 0 and an unloading stage S n s +1. We denote by S=S p∪{S 0,S n s+l} the set of all the stages. The vehicles travel on a single loop unidirectionany and repeated ly. The system layout is depicted in Fig.1. There is a set of n jobs J={J 1,J 2,...,J n} to be processed b y the vehicles. Each job consists of two tasks: That is, each vehicle receives a n object from S 0 and then carries it to S l with a certain l∈{1,2, ...,n s} (a throw-in job), or receives an object from S l with a certain l∈{1,2,...,n s} and then carries it to S n s+1 (a throw-out job ) per a turnaround. The loop consists of buffer zones BZ(l) and travel zones TZ(l) (see Fig. 1). Each buffer zone BZ(l) is placed in front of stage S l, l=0,1,..., n s, n s+1, in order to avoid a collision between vehicles (i.e., the syste m adopts the so-called zone control strategy). A heuristic algorithm We develop a heuristic algorithm to obtain a good performance for the PCVRS. An operation π={A/B/C} for the PCVRS consists of three decision factors: (A) Numbering jobs Jobs are loaded into S 0 according to an assending order of job numbers. In this paper, we use the following rules to number jobs: SPT: Order jobs in the shortest processing time rule, i.e., P 1≤P 2≤...≤P n for the set of jobs J={J 1,J 2,...,J n}, rather than the FCFS numbering (i.e., number jobs in first-come-first-served order). The SPT rule intends to reduce interferences between two adjacent vehicles at stages. (B) Allocating jobs to stages For the purpose of balancing loads of processing stages, we adopt the following to allocate jobs to the stages: ORDER: Allocate n jobs to n s, processing stages by an in-order manner , i.e., let l(i) be the index of processing stage allocated job J i by ORDER, it holds that l(i)=n s+1-(i-[(i-1)/n s]n s).(1) The ORDER rule intends to process jobs parallel at stages as many as possible. (C) Scheduling vehicles The following method for scheduling vehicles under ORDER rule is already known: Fig.1 The vehicle ro uting system, PCVRS Fig.2 Mean turnaroun d times by heuristics Unchange: Assign n jobs to n v vehicles such that let k(i) be the i ndex of vehicle processing job J i, then k(i)= i-[(i-1)/n v]n v.(2) In csse of n v≥n s, mod (n v,n s)=0 or n v<n s, mod (n s,n v)=0 (mod(x,y) is the remainder of x/y), the number of interferences between vehicles is minimized at stage S 1 under Unchange sche dules, while in the other cases it is not [Lu et al. (2001a)]. Therefore, in t his paper, we develop a new scheduling method of the vehicles, denoted by Ex change, to modify Unchange schedules. Note

Improvement of Operation Characteristics for MONOS Charge Trapping Flash Memory with SiGe Buried Channel

We propose and investigate a novel metal/SiO_2/Si_3N_4/SiO_2/SiGe charge trapping flash memory structure（named as MONOS）, utilizing Si Ge as the buried channel. The fabricated memory device demonstrates excellent programerasable characteristics attributed to the fact that more carriers are generated by the smaller bandgap of Si Ge during program/erase operations. A flat-band voltage shift 2.8 V can be obtained by programming at ＋11 V for 100 us. Meanwhile, the memory device exhibits a large memory window of ~7.17 V under ±12 V sweeping voltage, and a negligible charge loss of 18% after 104 s＇ retention. In addition, the leakage current density is lower than 2.52 × 10^（-7） A·cm^（-2） below a gate breakdown voltage of 12.5 V. Investigation of leakage current-voltage indicates that the Schottky emission is the predominant conduction mechanisms for leakage current. These desirable characteristics are ascribed to the higher trap density of the Si_3N_4 charge trapping layer and the better quality of the interface between the SiO_2 tunneling layer and the Si Ge buried channel. Therefore, the application of the Si Ge buried channel is very promising to construct 3 D charge trapping NAND flash devices with improved operation characteristics.

Discussion on Effective Strategies for Improving Enterprise Operation and Management Abilities

In the current socialist market economy,if an enterprise wants to grow and develop,it must do all kinds of management for its enterprise,and the most important thing for strengthening management of enterprises is to strengthen their own operation and management abilities.Whether it is financial management,management of personnel efficiency,or management of talents,it is necessary to protect from the infrastructure,so as to fundamentally improve the economic benefits of the enterprise,and vice versa if社is not properly managed,it will affect the development of the enterprise.Therefore,improving the operation and management abilities of enterprises at present is an important factor to promote the economic development of enterprises.This paper analyzes the management problems of enterprises and the definition of enterprise operation and management abilities,and analyzes how enterprises can reform and innovate,thus strengthening the operation and management abilities and economic benefits of enterprises.

Operations Improvement Function and Organisational Adaptability of Petroleum Tank Farms in South-South, Nigeria

The study examined the nexus between operations improvement function (dimensioned by contingency planning, benchmarking and continuous improvement processes) and organisational adaptability of Petroleum tank farms in South-South, Nigeria. The contingency theory and the theory of routine dynamics underpinned the study, and positivism was the underlying philosophy. The study adopted the cross-sectional survey through the use of questionnaire. 820 middle and top-level managers constituted the elements of the population, and the Krejcie & Morgan’s formula was used to determine the sample size of 262 respondents. Structural Equation Modeling was deployed to test the hypotheses at a 0.05 significance level. The results showed that contingency planning;benchmarking and continuous improvement processes all have a significant positive relationship with organisational adaptability of Petroleum tank farms in South-South, Nigeria. The study concludes that Petroleum tank farms’ operations should focus on the adoption of contingency planning, benchmarking and continuous improvement processes to enhance organisational adaptability. Therefore, it is recommended that the management of Petroleum tank farms should put in place mechanisms to advance continuous improvement processes by allocating the necessary amount of resources, such as energy, time and money, in order to promote the continuous development of the continuous improvement systems. Furthermore, managers of Petroleum tank farms should make better the adoption of contingency planning, ensuring that there is as much necessary training and information for employees on how to act during a crises situation, in order to evaluate safety and prepare in advance for recovery from disasters.

The Work of JTCA in Standardizing and Improving the Quality of Operating Information in Japan

Main Activities of JTCA JTCA activities cover the following five areas: ……

Impact factors and improvement measures of enviroment quality in cleaning operating room

Objective To analyze the factors that impact the environment quality of cleaning operating room and to discuss improvement measurement. Methods Environment bacteria testing results and prevalence of surgical incision infection in cleaning operating room were retro-

频谱能量增强的IEWT滚动轴承故障诊断方法

尺度空间方法的经验小波变换(EWT)在滚动轴承故障诊断中容易出现共振频带过度分割、频带破裂,导致故障诊断失败。为此,提出频谱增强的改进经验小波滚动轴承故障诊断方法。首先,将Teager能量算子引入信号频谱,利用能量算子能够追踪并增强信号瞬时成分能量的特点,对信号频谱瞬时冲击进行能量增强,减小噪声对信号频谱的影响;其次,对能量增强后频谱进行频带极大值包络的改进经验小波变换(IEWT)分解,得到一系列固有模态;最后,对裕度因子最大的固有模态进行包络解调分析,提取轴承故障特征。分析结果表明,所提方法能够增强故障引起的瞬态冲击成分,减少噪声对频谱分割的影响,有效地避免共振频带的过度分割导致的频带破裂。

改进Harris-SIFT算法在双目立体视觉中的应用

针对双目立体视觉图像匹配的实时性问题,提出了一种改进Harris-SIFT算法,克服了原SIFT算法提取的特征点不是角点且耗时长等问题。该算法首先用改进Harris算子进行角点提取,然后用SIFT算子构建特征描述子,最后对提取的特征点采用欧氏距离度量点对的相似性,利用最近邻搜索策略进行特征匹配。在VC++6.0与Open CV平台上,通过实验比较了所提算法与SIFT算法的特征点提取匹配结果,证明了所提算法的有效性与实时性。

基于混合交叉算子改进NSGA-Ⅱ算法的董铺—大房郢水库优化调度研究

以安徽省董铺—大房郢水库为例,以水库缺水率最小和补水量最少为最优准则,考虑董铺—大房郢水库水源连通工程水量补偿式调节和接受上游淠河灌区水库群补水的特殊机制,构建董铺—大房郢水库双目标优化供水调度模型,并采用基于混合交叉算子改进的NSGA-Ⅱ算法求解模型。结果表明,算数交叉算子(ACO)混合模拟二进制交叉算子(SBX)的收敛时间较单一SBX算子缩短11.48%,较单一ACO算子缩短2.58%;其中混合算子SBX-ACO求得的解集质量更好,对应评价指标世代距离(GD)值(8.13×10^(-4))、反世代距离(IGD)值(3.1×10^(-4))为所有计算方案中最小。优化调度模型求解的供水方案中两库补水量比不优化条件下的补水量减少11.5%。在计算效率及解集质量上综合验证了所提出的改进算法的有效性,同时为区域水资源优化调度提供科学依据。

数据中心多能互补分布式能源系统设计与运行优化研究

为实现数据中心的低碳转型和能效提升,提出了一种集成多种可再生能源和储能设备的多能互补分布式能源系统作为其供能系统。建立了包含生命周期成本、碳排放、能耗、电网购电率和热量浪费率等指标的优化目标体系。制定了两种考虑负荷特征的运行策略,采用改进的多目标蝗虫优化算法对系统容量配置进行求解。为了分析优化目标和运行策略对系统优化的影响,通过组合不同优化目标和运行策略形成了多种优化设计方案,采用层次分析法和熵权法确定评价指标的权重,并利用多准则妥协解排序法进行评价排序。针对青海省某数据中心的案例,获得其能源系统的优化设计与运行方案。研究表明:运行策略主要影响吸收式制冷机和地源热泵的容量,而优化目标主要影响储能设备的容量;在相同的运行策略下,增加优化目标可提升系统的综合性能;对于不同的方案,生命周期成本、碳排放、能耗等基础优化目标值变化较小,而电网购电率和热量浪费率变化较大;通过实施五目标优化,即在基础优化目标的基础上增加热量浪费率、电网购电率,系统的综合性能得到了显著提升,其中热量浪费率和电网购电率分别降低了62.30%和25.92%,可再生能源发电占比增加了2%。

考虑绿证交易和碳排放约束的交直流混合微网低碳优化调度

在“双碳”背景下,为了降低交直流混合微网的碳排放水平,提出一种考虑绿证交易(GCT)和碳排放的微网低碳优化调度策略。首先,针对交直流混合微网的特点,引入绿证交易机制,以绿证交易成本和发电能耗成本最小为优化目标,建立交直流混合微网低碳优化模型;其次,引入Tent混沌映射和萤火虫扰动对传统PSO进行改进,以提高模型的求解精度和速度;最后,以某工业园区微电网为例对所提方法进行仿真验证。结果表明,所提方法能够在兼顾经济性和环保性的前提下,有效地控制微网减少碳排放,为交直流混合微网的低碳调度提供了一种新的方法。

带忽略工序的多目标批量流混合流水车间调度

针对带忽略工序的批量流混合流水车间调度问题,在考虑批次切换调整时间的情况下,以最小化完工时间和机床负荷平衡为优化目标,建立柔性批量分割和调度集成优化模型,提出一种双层改进PSO-GA混合算法。算法提出批量和机器的双层搜索求解框架,外层进行柔性分批,内层搜索排序及调度方案。针对批量分割、工件批排序、机器分配3个问题,设计基于批量、工序和机器的三段式编码,内层将狼群算法的分级和游走策略引入粒子群算法,设计了一种基于PBX(Position-based Crossover)交叉操作的围攻策略以提高算法的局部搜索及寻优能力。通过仿真实验并与几种启发式算法进行对比及实例验证,说明了调度模型和算法的可行性和优越性。

改良负压封闭引流装置对预防乳腺癌改良根治术后皮下积液和皮瓣坏死的应用价值研究

目的:探究分析改良负压封闭引流(VSD)装置对预防乳腺癌改良根治术后皮下积液和皮瓣坏死的应用价值。方法:选取2022年1月—2023年12月徐州医科大学附属医院收治的86例乳腺癌患者作为研究对象,根据随机数表法分为对照组和观察组,每组各43例。对照组实施双管持续中心负压引流球干预,观察组实施改良VSD装置引流干预。比较两组术后不同阶段引流量、疼痛程度[视觉模拟量表(VAS)]和舒适度[舒适量表(Kolcaba],比较两组并发症发生率(皮下积液、皮瓣坏死)和术后恢复情况。结果:观察组术后1 d、2 d、3 d的引流量及总引流量较对照组少、VAS评分较对照组低,差异有统计学意义(P<0.05);观察组术后1 d、2 d、3 d的Kolcaba评分较对照组高,差异有统计学意义(P<0.05);观察组皮下积液、皮瓣坏死发生率低于对照组,差异有统计学意义(P<0.05);观察组胸壁及腋窝引流管拔除时间、切口愈合时间、住院时间均较对照组短,差异有统计学意义(P<0.05)。结论:乳腺癌患者改良根治术后接受改良VSD装置干预,可减轻其痛感,提高舒适度,减少引流量,缩短引流管留置时间,且降低皮下积液和皮瓣坏死的发生,促进机体康复。