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.

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.

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.

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.

Peak shaving operation optimization of high proportion new energypower generation considering wind-solar complementationand source-load coupling

To optimize peaking operation when high proportion new energy accesses to power grid,evaluation indexes are proposed which simultaneously consider wind-solar complementation and source-load coupling.A typical wind-solar power output scene model based on peaking demand is established which has anti-peaking characteristic.This model uses balancing scenes and key scenes with probability distribution based on improved Latin hypercube sampling(LHS)algorithm and scene reduction technology to illustrate the influence of wind-solar on peaking demand.Based on this,a peak shaving operation optimization model of high proportion new energy power generation is established.The various operating indexes after optimization in multi-scene peaking are calculated,and the ability of power grid peaking operation is compared whth that considering wind-solar complementation and source-load coupling.Finally,a case of high proportion new energy verifies the feasibility and validity of the proposed operation strategy.

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.

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.

Operation safety risk analysis method of hydropower project considering time-dependent effect

In order to consider the time-dependent characteristic of risk factors of hydropower project,the method of stochastic process simulating structure resistance and load effect is adopted.On the basis of analyzing the structure characteristics and mode of operation,the operation safety risk rate assessment model of hydropower project is established on the comprehensive application of the improved analytic hierarchy process,the time-dependent reliability theory and the risk rate threshold.A scheme to demonstrate the time-dependent risk rate assessment method for an example of the earth-rock dam is particularly implemented by the proposed approach.The example shows that operation safety risk rate is closely related to both the service period and design standard;considering the effect of time-dependent,the risk rate increases with time and the intersection of them reflects the technical service life of structures.It could provide scientific basis for the operation safety and risk decision of the hydropower project by predicting the trend of risk rate via this model.

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-

基于Caprini和IMPROVE评分的分级护理预防腹部手术后深静脉血栓形成的临床观察

目的:探讨Caprini和IMPROVE评分指导下的分级护理预防腹部手术后深静脉血栓形成的效果。方法:选取2015年8月—2018年8月于滨州市沾化区人民医院以及济南市中医医院接受腹部手术的患者98例,随机分为观察组(44例)和对照组(54例),根据Caprini血栓风险评估表和IMPROVE出血风险评估表评估患者术后血栓风险等级和出血风险,观察组采取Caprini和IMPROVE评分指导下的分级护理,对照组采取常规护理,所有患者术后随访6个月,统计患者术后深静脉血栓形成(DVT)发病情况。结果:观察组术后DVT发生率低于对照组(4.5%vs.20.4%),差异有统计学意义(P<0.05)。Caprini评分是患者术后DVT发病的影响因素。结论:Caprini和IMPROVE评分指导下的分级护理能够有效降低接受腹部手术治疗患者术后DVT的发病率。

Voltage Security Operation Region Calculation Based on Improved Particle Swarm Optimization and Recursive Least Square Hybrid Algorithm

Large-scale voltage collapse incidences, which result in power outages over large regions and extensive economic losses, are presently common occurrences worldwide. To avoid voltage collapse and operate more safely and reliably, it is necessary to analyze the voltage security operation region(VSOR) of power systems, which has become a topic of increasing interest lately. In this paper, a novel improved particle swarm optimization and recursive least square(IPSO-RLS) hybrid algorithm is proposed to determine the VSOR of a power system. Also, stability analysis on the proposed algorithm is carried out by analyzing the errors and convergence accuracy of the obtained results. Firstly, the voltage stability and VSOR-surface of a power system are analyzed in this paper. Secondly, the two algorithms,namely IPSO and RLS algorithms, are studied individually.Based on this understanding, a novel IPSO-RLS hybrid algorithm is proposed to optimize the active and reactive power,and the voltage allowed to identify the VSOR-surface accurately. Finally, the proposed algorithm is validated by using a simulation case study on three wind farm regions of actual Hami Power Grid of China in DIg SILENT/Power Factory software.The error and accuracy of the obtained simulation results are analyzed and compared with those of the particle swarm optimization(PSO), IPSO and IPSO-RLS hybrid algorithms.

Composition of Web Services of Multi-Population Adaptive Genetic Algorithm Based on Cosine Improvement

Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.

Radiation therapy prior to a pancreaticoduodenectomy for adenocarcinoma is associated with longer operative times and higher blood loss

BACKGROUND Pancreatic adenocarcinoma is currently the fourth leading cause of cancer-related deaths in the United States.In patients with“borderline resectable”disease,current National Comprehensive Cancer Center guidelines recommend the use of neoadjuvant chemoradiation prior to a pancreaticoduodenectomy.Although neoadjuvant radiotherapy may improve negative margin resection rate,it is theorized that its administration increases operative times and complexity.AIM To investigate the association between neoadjuvant radiotherapy and 30-d morbidity and mortality outcomes among patients receiving a pancreaticoduodenectomy for pancreatic adenocarcinoma.METHODS Patients listed in the 2015-2019 National Surgery Quality Improvement Program data set,who received a pancreaticoduodenectomy for pancreatic adenocarcinoma,were divided into two groups based off neoadjuvant radiotherapy status.Multivariable regression was used to determine if there is a significant correlation between neoadjuvant radiotherapy,perioperative blood transfusion status,total operative time,and other perioperative outcomes.RESULTS Of the 11458 patients included in the study,1470(12.8%)underwent neoadjuvant radiotherapy.Patients who received neoadjuvant radiotherapy were significantly more likely to require a perioperative blood transfusion[adjusted odds ratio(aOR)=1.58,95%confidence interval(CI):1.37-1.82;P<0.001]and have longer surgeries(insulin receptor-related receptor=1.14,95%CI:1.11-1.16;P<0.001),while simultaneously having lower rates of organ space infections(aOR=0.80,95%CI:0.66-0.97;P=0.02)and pancreatic fistula formation(aOR=0.50,95%CI:0.40-0.63;P<0.001)compared to those who underwent surgery alone.CONCLUSION Neoadjuvant radiotherapy,while not associated with increased mortality,will impact the complexity of surgical resection in patients with pancreatic adenocarcinoma.

基于改进NSGA-Ⅱ算法的梯级水库多目标优化调度

针对在时间步长较小、计算时段数目较多时,传统智能优化算法在求解梯级水库联合优化调度问题上效率低甚至无可行解的问题,提出了一种改进NSGA-Ⅱ算法。该算法基于NSGA-Ⅱ算法框架,引入参考目标值、潜力目标值、偏移度以及变异引导算子来优化种群进化过程,强化迭代中的种群质量,使获得的解集更加接近真实的Pareto前沿。福建省金溪流域梯级水库多目标优化调度实例验证结果表明,改进NSGA-Ⅱ算法相对其他算法运算效率更高,优化结果更好,具有较好的实用性。