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

Evaluation of a programming algorithm for deep brain stimulation in dystonia used in a double-blind, sham-controlled multicenter study

引用

NEUROLOGICAL RESEARCH AND PRACTICE 2019年第1期1卷 25页

作者： Steigerwald, Frank Kirsch, Anna Dalal Kuehn, Andrea Kupsch, Andreas Mueller, Joerg Eisner, Wilhelm Deuschl, Gunther Falk, Daniela Schnitzler, Alfons Skogseid, Inger Marie Vollmer-Haase, Juliane Ip, Chi Tronnier, Volker Vesper, Jan Naumann, Markus Volkmann, Jens Univ Hosp Wurzburg Dept Neurol Wurzburg Germany Rhon Klinikum Dept Neurol & Neurol Crit Care Bad Neustadt an der Saale Germany Charite Univ Med Berlin Dept Neurol Campus Mitte Berlin Germany Movement Disorder Ctr Berlin Neurol Moves Berlin Germany Vivantes Hosp Berlin Spandau Dept Neurol Berlin Germany Med Univ Innsbruck Dept Neurol Innsbruck Austria Med Univ Innsbruck Dept Neurosurg Innsbruck Austria Univ Kiel Dept Neurol Kiel Germany Univ Kiel Dept Neurosurg Kiel Germany Heinrich Heine Univ Dept Neurol Dusseldorf Germany Heinrich Heine Univ Inst Clin Neurosci & Med Psychol Dusseldorf Germany Oslo Univ Hosp Dept Neurol Oslo Norway Evang Klin MVZ Gelsenkirchen Germany Univ Lubeck Dept Neurosurg Lubeck Germany Albert Ludwig Univ Freiburg Dept Funct Neurosurg & Stereotaxy Freiburg Germany Heinrich Heine Univ Dusseldorf Dept Funct Neurosurg & Stereotaxy Dusseldorf Germany Klinikum Augsburg Dept Neurol Augsburg Germany

Background: programming deep brain stimulation in dystonia is difficult because of the delayed benefits and absence of evidence-based guidelines. Therefore, we evaluated the efficacy of a programming algorithm applied in a double-blind, sham-controlled multicenter study of pallidal deep brain stimulation in dystonia. Methods: A standardized monopolar review to identify the contact with the best acute antidystonic effect was applied in 40 patients, who were then programmed 0.5 V below the adverse effect threshold and maintained on these settings for at least 3 months, if tolerated. If no acute effects were observed, contact selection was based on adverse effects or anatomical criteria. Three-year follow-up data was available for 31 patients, and five-year data for 32 patients. The efficacy of the algorithm was based on changes in motor scores, adverse events, and the need for reprogramming. Results: The mean (+/- standard deviation) dystonia motor score decreased by 73 +/- 24% at 3 years and 63 +/- 38% at 5 years for contacts that exhibited acute improvement of dystonia (n = 17) during the monopolar review. Contacts without acute benefit improved by 58 +/- 30% at 3 years (n = 63) and 53 +/- 31% at 5 years (n = 59). Interestingly, acute worsening or induction of dystonia/dyskinesia (n = 9) correlated significantly with improvement after 3 years, but not 5 years. Conclusions: Monopolar review helped to detect the best therapeutic contact in approximately 30% of patients exhibiting acute modulation of dystonic symptoms. Acute improvement, as well as worsening of dystonia, predicted a good long-term outcome, while induction of phosphenes did not correlate with outcome.

关键词： Deep brain stimulation programming algorithm Dystonia Pallidum Long-term outcome

来源：评论

学校读者我要写书评

暂无评论

Impact of the Incremental programming algorithm on the Filament Conduction in HfO₂-Based RRAM Arrays

引用

IEEE JOURNAL OF THE ELECTRON DEVICES SOCIETY 2017年第1期5卷 64-68页

作者： Perez, Eduardo Grossi, Alessandro Zambelli, Cristian Olivo, Piero Wenger, Christian IHP GmbH Leibniz Inst Innovat Microelekt D-15236 Frankfurt Germany Univ Ferrara Dip Ingn I-44122 Ferrara Italy

In this paper, the set operation of HfO2 based 1T-1R arrays is studied by applying incremental step pulse with verify algorithm. To evaluate the impact of the voltage step increment on the conduction mechanism of filaments, the voltage increments between consecutive pulses are varied between 0.05 and 0.4 V. The extracted leakage values after the set operation were discussed in the framework of the quantum point contact model. In the so called low resistive state, the conductive filaments demonstrate a defined signature of conductance quantization.

关键词： RRAM HfO2 QPC model programming algorithm

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis on optimizing performance of genetic algorithm and programming algorithm for MOTSP

引用

JOURNAL OF INTERDISCIPLINARY MATHEMATICS 2017年第6-7期20卷 1533-1536页

作者： Su, Lin Jia, Jingjing Shanghai Dian Ji Univ Sch Business Shanghai 201306 Peoples R China

The multi-objective traveling salesman problem (MOTSP) involves one salesman to visit a set of locations (n > 1) so that each location is visited exactly once while satisfying multiple targets of distance, time, cost, etc. To solve problem like this, two different algorithms are introduced and their optimization performances are presented in details by comparisons. On one hand, the genetic algorithm (GA) implemented on Matlab was improved in this paper, which performs well in combination with rotating-disk selection with ranking, one-point crossover and mutation after similarity contrast. On the other hand, the optimization also benefits from application of 0-1 integer programming algorithm with linear and non-linear constraints where Lingo is used. Experimental results reveal both advantages and disadvantages of these two algorithms, and it is concludes that characteristics of the problem itself will decide which algorithm is more suitable when it comes to a special case.

关键词： traveling salesman problem genetic algorithm programming algorithm Matlab Lingo

来源：评论

学校读者我要写书评

暂无评论

Effect of Transistor Transfer Characteristics on the programming Process in 1T1R Configuration

引用

IEEE TRANSACTIONS ON ELECTRON DEVICES 2024年第4期71卷 2423-2430页

作者： Liu, Xiaohua Bengel, Christopher Cueppers, Felix Solfronk, Oliver Zhang, Bojian Hoffmann-Eifert, Susanne Menzel, Stephan Waser, Rainer Wiefels, Stefan Forschungszentrum Julich PGI 7 D-52425 Julich Germany Rhein Westfal TH Aachen IWE 2 D-52425 Julich Germany Rhein Westfal TH Aachen JARA FIT D-52425 Julich Germany Forschungszentrum Julich PGI 10 D-52425 Julich Germany Forschungszentrum Julich JARA FIT D-52425 Julich Germany

The one-transistor-one-resistor (1T1R) structure has been widely used in the context of novel neuromorphic applications. It can effectively control the state variability in redox-based resistive random access memory (ReRAM) and suppress the leakage current in ReRAM arrays. Since the transistor size has a direct impact on the electrical behavior, matching the characteristics of the two components in the 1T1R structure is a crucial step at the beginning of the device design. In this article, we focus on valence change mechanism (VCM)-type ReRAM devices and investigate the effect of the transistor transfer characteristics on the programming characteristics of 1T1R structures. By comparing the electrical behavior of three types of 1T1R structures with different transistor sizes during a gradual SET switching algorithm, we analyze how the applied voltage is distributed between the ReRAM cell and the transistor. Furthermore, the relationship among the transistor size, the operating region, and the bias conditions is explored based on the JART VCM v1b compact model. Finally, we discuss the effects of these factors on the programming characteristics of 1T1R structures and provide design suggestions regarding transistor size and bias conditions.

关键词： Bias conditions programming algorithm redox-based resistive random access memory (ReRAM) transistor sizes voltage division

来源：评论

学校读者我要写书评

暂无评论

Statistical separation of mixtures in the problem of reconstructing the coefficients of an Itô stochastic process-type model of the interplanetary magnetic flux density: ℓ2-distance minimization vs likelihood maximization

引用

RUSSIAN JOURNAL OF NUMERICAL ANALYSIS AND MATHEMATICAL MODELLING 2025年第1期40卷 17-31页

作者： Karpov, Kirill Korolev, Victor Sukhareva, Natalia Moscow State Univ Fac Computat Math & Cybernet Moscow 119991 Russia Moscow Ctr Fundamental & Appl Math Moscow 119991 Russia Russian Acad Sci Fed Res Ctr Comp Sci & Control Moscow 119333 Russia Hangzhou Dianzi Univ Sch Math Hangzhou 310018 Peoples R China Moscow State Univ Fac Phys Moscow 119991 Russia

Two approaches to the problem of statistical separation of finite mixtures of probability distributions are discussed. The first of them consists in finding maximum likelihood estimates of the parameters of the mixture by the EM-algorithm, whereas the second approach consists in finding the values of the parameters that deliver minimum to the distance between the theoretical and empirical distribution functions. It is demonstrated that the second approach is preferable at least in the problem of statistical reconstruction of the coefficients of an It & ocirc;stochastic process that requires dynamic separation of finite normal mixtures in the moving window mode. For this problem, the performance of the numerical procedures is critical. A combination of numerical procedures is described that provides (almost) the same value of the likelihood function for the second approach that is attained by the EM-algorithm, but ensures multiple decrease of the & ell;2-distance between the theoretical mixture and the empirical distribution function while demonstrating better performance. A kind of 'metric' regularization of the problem of likelihood maximization is proposed. The proposed techniques are illustrated by adjusting the It & ocirc;process model to the time series of the interplanetary magnetic field (magnetic flux density) registered by the Global Geospace Science (GGS) Wind apparatus (the spacecraft placed in the Lagrange point between the Earth and the Sun).

关键词： Time series It & ocirc stochastic process finite normal mixture statistical separation of mixtures EM-algorithm sequential quadratic programming algorithm ill-posed problem interplanetary magnetic field

来源：评论

学校读者我要写书评

暂无评论

Demonstration of Low Power and Highly Uniform 6-bit Operation in SiO2-Based Memristors Embedded With Pt Nanoparticles

引用

IEEE TRANSACTIONS ON ELECTRON DEVICES 2024年第9期71卷 5313-5318页

作者： Kleitsiotis, G. Bousoulas, P. Mantas, S. D. Tsioustas, C. Fyrigos, I. A. Sirakoulis, G. Tsoukalas, D. Natl Tech Univ Athens Dept Appl Phys Zografos 15780 Greece Democritus Univ Thrace Dept Elect Engn Xanthi 69100 Greece

In this work, an optimized method was implemented for attaining stable multibit operation with low energy consumption in a two-terminal memory element made from the following layers: Ag/Pt nanoparticles (NPs)/SiO2/TiN in a 1-transistor-1-memristor (1T1M) configuration. Compared to the reference sample where no NPs were embedded, an enlarged memory window of similar to 10(5) was recorded in conjunction with reduced variability for both switching states (sigma/mu < 0.4). A comprehensive numerical model was also applied to shed light on this enhanced performance, which was attributed to the spatial confinement effect induced by the presence of the Pt NPs and its impact on the properties of the percolating conducting filaments (CFs). Although 5-bit precision was demonstrated with the application of the incremental-step-pulse-programming (ISPP) algorithm, the reset process was unreliable and the output current increased abnormally when exceeded the value of 150 mu A. As a result, the multibit operation was limited. To address this issue, a modified scheme was developed to accurately control the distance between the various resistance levels and achieve highly reliable 6-bit precision. Our work provides valuable insights for the development of energy-efficient memories for applications, where a high density of conductance levels is required.

关键词： Conducting filament (CF) diffusivity barrier multibit nanoparticles (NPs) programming algorithm resistive switching memories (RRAMs)

来源：评论

学校读者我要写书评

暂无评论

Variability and Energy Consumption Tradeoffs in Multilevel programming of RRAM Arrays

引用

IEEE TRANSACTIONS ON ELECTRON DEVICES 2021年第6期68卷 2693-2698页

作者： Perez, Eduardo Mahadevaiah, Mamathamba Kalishettyhalli Quesada, Emilio Perez-Bosch Wenger, Christian IHP Leibniz Inst Innovat Mikroelekt D-15236 Frankfurt Oder Germany BTU Cottbus Senftenberg D-03046 Cottbus Germany

Achieving a reliable multilevel programming operation in resistive random access memory (RRAM) arrays is still a challenging task. In this work, we assessed the impact of the voltage step value used by the programming algorithm on the device-to-device (DTD) variability of the current distributions of four conductive levels and on the energy consumption featured by programming 4-kbit HfO2-based RRAM arrays. Two different write-verify algorithms were considered and compared, namely, the incremental gate voltage with verify algorithm (IGVVA) and the incremental step pulse with verify algorithm (ISPVA). By using the IGVVA, a main tradeoff has to be considered since reducing the voltage step leads to a smaller DTD variability at the cost of a strong increase in energy consumption. Although the ISPVA cannot reduce the DTD variability as much as the IGVVA, its voltage step can be decreased in order to reduce the energy consumption with almost no impact on the DTD variability. Therefore, the final decision on which algorithm to employ should be based on the specific application targeted for the RRAM array.

关键词： Switches Current measurement Voltage measurement Energy consumption Logic gates Performance evaluation programming profession Energy consumption multilevel programming algorithm resistive random access memory (RRAM) voltage step

来源：评论

学校读者我要写书评

暂无评论

Phase-change memory cells characterization in an analog in-memory computing perspective 17

Phase-change memory cells characterization in an analog in-m...

引用

17th Conference on Ph.D Research in Microelectronics and Electronics (PRIME)

作者： Antolini, Alessio Lico, Andrea Scarselli, Eleonora Franchi Carissimi, Marcella Pasotti, Marco Univ Bologna DEI ARCES Viale Risorgimento 2 I-40136 Bologna Italy STMicroelectronics Via Camillo Olivetti 2 I-20864 Agrate Brianza Italy

ISBN: (纸本)9781665467001

Power consumption related to data transfers between processing and memory units has become a critical issue in the recent data-centric outlook of integrated circuits. In the context of In-memory Computing (IMC), where data conveyance is narrowed performing computations directly within the memory unit, Phase-change Memory (PCM) technology has become an attractive candidate due to its intrinsic multilevel storage capability. The test vehicle of this work is an embedded PCM (ePCM) provided by STMicroelectronics and designed in 90-nm smart power BCD technology with a Ge-rich Ge-Sb-Te (GST) alloy for automotive applications. In this framework, a preliminary characterization of PCM cells has been carried out, aimed at evaluating their performance as enabling devices for analog in-memory computing (AIMC) applications.

关键词： In-memory computing (IMC) Phase-change memory (PCM) programming algorithm analog computing

来源：评论

学校读者我要写书评

暂无评论

algorithm for Automatic Layout of Graphic Language and Its Application in Graphic Design

引用

INTERNATIONAL JOURNAL OF INFORMATION SYSTEMS AND SUPPLY CHAIN MANAGEMENT 2024年第1期17卷 1页

作者： Tao, Zongxiao Zhengzhou Sias Coll Zhengzhou Peoples R China

When using traditional algorithms to describe graphic languages, the results obtained are not accurate due to the lack of strict standards. In this case, the size and position of the graphic display cannot be accurately determined. Aiming at these problems, we propose a new automatic typesetting algorithm for graphic languages. Use the constant method to calculate the display size of buffered images in graphic design. The ant colony algorithm is used to solve the optimal solution, so that the optimal display position of the graphics in the graphic design can be obtained. Graphics are powerful. For example, excellent graphics such as the presentation of forms, the expression and transmission of information, often make people feel relaxed and empathetic, shorten the distance between each other, and make communication smoother. As a result, graphic languages have become an important part of modern graphic design and are used more and more frequently. This paper attempts to analyze the representation of graphic language, aiming to demonstrate its important role in graphic design.

关键词： Graphic Design Graphic Language programming algorithm Visual Communication

来源：评论

学校读者我要写书评

暂无评论

Cooperation and profit allocation for two-echelon logistics pickup and delivery problems with state-space-time networks

引用

APPLIED SOFT COMPUTING 2021年 109卷 107528-107528页

作者： Wang, Yong Zhang, Shuanglu Guan, Xiangyang Fan, Jianxin Wang, Haizhong Liu, Yong Chongqing Jiaotong Univ Sch Econ & Management Chongqing 400074 Peoples R China Shanghai Univ Sch Management Shanghai 200444 Peoples R China Univ Washington Dept Civil & Environm Engn Seattle WA 98195 USA Chongqing Jiaotong Univ Sch River & Ocean Engn Chongqing 400074 Peoples R China Oregon State Univ Sch Civil & Construct Engn Corvallis OR 97330 USA

Cooperation is a powerful strategy to reduce the costs of pickup and delivery services in the conventional two-echelon pickup and delivery problems (2E-PDPs). This study develops a cooperative 2E-PDP with state-space-time network (C2E-PDPSST) and incorporates vehicle routing problem and profit allocation optimization. Transportation resource sharing (trucks/vehicles) is presented as a major cooperative strategy in C2E-PDPSST to reduce the number of vehicles and improve resource utilization. A bi-objective mixed integer model is proposed to minimize total operating costs and number of vehicles and is formulated based on state-space-time networks. A novel methodology, which combines the time-dependent forward dynamic programming algorithm and a hybrid heuristic algorithm comprising modified k-means clustering algorithm and improved multi-objective particle swarm optimization (IMOPSO) algorithm, is designed for solving C2E-PDPSST. The clustering process speeds up the solution by reducing the computational complexity. The IMOPSO algorithm combines inter-and intra-route operations to find the Pareto optimal solutions with predefined iteration and termination rules. The inter-route operations will improve the population diversity, while the intra-route operations will generate an optimal solution for each vehicle route. Thus, an effective combination of local and global solution search can be achieved. Profit allocation schemes are investigated using the criteria of minimum cost remaining savings. Our results on benchmark instances show that the proposed IMOPSO has better computational performance than the conventional MOPSO and multi-objective genetic algorithm. A case study based on the realistic logistics network in Chengdu City, China is conducted for validation. The proposed methodology considering state-space-time network performs better in terms of reducing traveling costs, and improving the flexibility and efficiency of the entire network. (C) 2021 Elsevier B.V. A

关键词： Two-echelon pickup and delivery problem State-space-time networks Transportation resource sharing Time-dependent forward dynamic programming algorithm Minimum cost remaining savings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：