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

A NEW permutation algorithm FOR BUBBLE MEMORIES

INFORMATION PROCESSING LETTERS 1980年第4-5期10卷 226-230页

作者： CHUNG, KM LUCCIO, F WONG, CK Department of Computer Science University of Illinois at Urbana Urbana IL 61801 U.S.A. Istituto di Scienze dell'Informazione University of Pisa 56100 Pisa Italy IBM T.J. Watson Research Center Yorktown Heights NY 10598 U.S.A.

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Strategy for the MMC-Based PV System With Faults Detection and Converter Reconfiguration Using permutation algorithms

引用

IEEE ACCESS 2023年 11卷 126119-126134页

作者： Colque, Juan C. Ruppert, Ernesto Delgado-Huayta, I. Chirapo, Karlos A. C. Azcue, Jose Luis Univ Estadual Campinas Dept Syst & Energy BR-13083852 Campinas SP Brazil Natl Univ Altiplano Elect Engn Profess Sch Puno 21001 Peru Fed Univ ABC Engn Modeling & Appl Social Sci Ctr BR-09210580 Santo Andre SP Brazil

The modular multilevel converter has gained popularity in various applications, including photovoltaic (PV) solar energy conversion. Its modular structure allows for the transformation of an MMC into an MMC-based photovoltaic system, sharing key operational characteristics such as modularity, flexibility, redundancy, increased efficiency, and fault tolerance. To ensure the reliability and uninterrupted operation of the modified MMC, even in the event of potential failures in the photovoltaic submodules (PVSMs), a fault-tolerant strategy is developed in this study. It assumes that the Maximum Power Point Tracking (MPPT) of the PVSMs is already guaranteed. Redundant submodules (rSM) are utilized to maintain power balance between the converter arms through voltage control, while reserve submodules (RSMs) are in place to rescue the converter in case of a failure. The detection and localization of faults in the PVSMs/rSMs are achieved through sliding mode observers (SMOs), and the converter reconfiguration is carried out using the proposed permutation algorithms for switching signals and SMs voltages. For precise control of the output current and electrical grid connection, the $dq$ -reference frame control method is employed. To validate these proposed algorithms, time-domain simulations are conducted using the Simulink/Matlab software.

关键词： Photovoltaic solar energy conversion modular multilevel converter fault-tolerant operation power mismatch photovoltaic submodules redundant submodules permutation algorithm

来源：评论

学校读者我要写书评

暂无评论

A permutation-Based Heuristic Method for the Blocking Job Shop Scheduling Problem 9

A Permutation-Based Heuristic Method for the Blocking Job Sh...

引用

9th IFAC/IFIP/IFORS/IISE/INFORMS Conference on Manufacturing Modelling, Management and Control (IFAC MIM)

作者： Lange, Julia Werner, Frank Otto von Guericke Univ Magdeburg Germany

In the manufacturing of highly customized goods and the operation of automatic logistics systems, efficient schedules constitute an everyday challenge. Therefore, the job shop problem is established as a standard model in scheduling research. While classical variants are well studied, the involvement of practically relevant conditions, such as the absence of intermediate buffers and customer-oriented optimization criteria, shows a lack of theoretical understanding. This work provides a study in this research direction by examining the applicability of a scheduling-tailored heuristic search method to the blocking job shop problem with total tardiness minimization. permutation-based encodings are used to represent a schedule. Appearing redundancy and feasibility issues are discussed. Two well-known neighborhood structures for sequencing problems are applied and an advanced repairing technique to construct feasible blocking job shop schedules is proposed. The computational results obtained by embedding the components in a simulated annealing framework highlight advantages of the heuristic solution approach against existing general-purpose methods. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Scheduling Heuristic Search permutation algorithm Blocking Constraints Total Tardiness

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Evaluation of Sequence Partition algorithms

引用

Journal of Computer Science & Technology 2008年第5期23卷 711-718页

作者：杨兵陈菁吕恩月郑斯清 Cisco Systems 2200 East President George Bush Highway Telecom. Engineering Program University of Texas at Dallas Department of Mathematics and Computer Science Salisbury University Department of Computer Science University of Texas at Dallas

Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard problem in different applications. Also, the distinction between theoretical upper bound and actual solution optimality for realistic instances of an NP-hard problem is a factor in selecting algorithms in practice. We consider the problem of partitioning a sequence of n distinct numbers into minimum number of monotone （increasing or decreasing） subsequences. This problem is NP-hard and the number of monotone subsequences can reach [√2n＋1/1-1/2]in the worst case. We introduce a new algorithm, the modified version of the Yehuda-Fogel algorithm, that computes a solution of no more than [√2n＋1/1-1/2]monotone subsequences in O（n^1.5） time. Then we perform a comparative experimental study on three algorithms, a known approximation algorithm of approximation ratio 1.71 and time complexity O（n^3）, a known greedy algorithm of time complexity O（n^1.5 log n）, and our new modified Yehuda-Fogel algorithm. Our results show that the solutions computed by the greedy algorithm and the modified Yehuda-Fogel algorithm are close to that computed by the approximation algorithm even though the theoretical worst-case error bounds of these two algorithms are not proved to be within a constant time of the optimal solution. Our study indicates that for practical use the greedy algorithm and the modified Yehuda-Fogel algorithm can be good choices if the running time is a major concern.

关键词： monotone subsequence permutation algorithm NP-complete approximation complexity

来源：评论

学校读者我要写书评

暂无评论

Novel bilateral-diffusion image encryption algorithm with compound chaos and LFSR

引用

IMAGING SCIENCE JOURNAL 2012年第5期60卷 294-304页

作者： Tong, X. J. Harbin Inst Technol Sch Comp Sci & Technol Weihai 264209 Peoples R China

In order to solve the problem of short cycle and low precision of one-dimensional (1D) chaotic function, the new compound two-dimensional chaotic function is presented by exploiting two 1D chaotic functions which are switched randomly. A new chaotic sequence generator is designed by the compound chaos and linear feedback shift register (LFSR). The random properties of compound chaotic functions and LFSR are also proved rigorously. The novel bilateral-diffusion image encryption algorithm and permutation algorithm are proposed based on the compound chaotic function and LFSR, which can produce more avalanche effect and larger key space. The entropy analysis, differential analysis, statistical analysis, cipher random analysis and cipher sensitivity analysis are introduced to test the security of new scheme. The results show that the novel image encryption method passes SP 800-22 standard tests and solves the problem of short cycle and low precision of 1D chaotic function.

关键词： image encryption compound chaos LFSR bilateral-diffusion permutation algorithm

来源：评论

学校读者我要写书评

暂无评论

MODEL FOR MASKING ROTATIONAL LATENCY BY DYNAMIC DISK ALLOCATION

引用

COMMUNICATIONS OF THE ACM 1974年第5期17卷 278-288页

作者： GOLD, DE KUCK, DJ UNIV ILLINOIS DEPT COMP SCIURBANAIL 61801

This paper presents the background and algorithms for masking the rotational latency of a disk or drum. It discusses the anticipatory input and output of blocks of data to buffer and primary memories for a mono-programmed computer system. A basic permutation algorithm and several variations are given. Because of the anticipatory nature of the I/O scheduling, these algorithms are restricted to classes of programs with predictable behavior. While the methods are not restricted to numerical computations, matrix and partial differential equation methods are typical examples of their use. It is shown that latency may be masked using a small amount of buffer memory. The methods discussed are independent of the overall size of the data base being considered.

关键词： buffer memory memory hierarchy permutation algorithm rotational latency staging storage allocation

来源：评论

学校读者我要写书评

暂无评论

Detection of peach soluble solids based on near-infrared spectroscopy with High Order Spatial Interaction network

引用

JOURNAL OF THE SCIENCE OF FOOD AND AGRICULTURE 2024年第7期104卷 4309-4319页

作者： Qi, Hengnian Luo, Jiahao Chen, Gang Zhang, Jianyi Chen, Fengnong Li, Hongyang Shen, Cong Zhang, Chu Huzhou Univ Sch Informat & Engn Huzhou Peoples R China Zhejiang Dekfeller Intelligent Machinery Mfg Co Lt Hangzhou Peoples R China Hangzhou Dianzi Univ Sch Automat Sch Artificial Intelligence Hangzhou Peoples R China Hangzhou Dianzi Univ Sch Automat Sch Artificial Intelligence Hangzhou 310018 Peoples R China Huzhou Univ Sch Informat Engn Huzhou 313000 Peoples R China

BackgroundDue to the scalability of deep learning technology, researchers have applied it to the non-destructive testing of peach internal quality. In addition, the soluble solids content (SSC) is an important internal quality indicator that determines the quality of peaches. Peaches with high SSC have a sweeter taste and better texture, making them popular in the market. Therefore, SSC is an important indicator for measuring peach internal quality and making harvesting *** article presents the High Order Spatial Interaction Network (HOSINet), which combines the Position Attention Module (PAM) and Channel Attention Module (CAM). Additionally, a feature wavelength selection algorithm similar to the Group-based Clustering Subspace Representation (GCSR-C) is used to establish the Position and Channel Attention Module-High Order Spatial Interaction (PC-HOSI) model for peach SSC prediction. The accuracy of this model is compared with traditional machine learning and traditional deep learning models. Finally, the permutation algorithm is combined with deep learning models to visually evaluate the importance of feature wavelengths. Increasing the order of the PC-HOSI model enhances its ability to learn spatial correlations in the dataset, thus improving its predictive *** optimal model, PC-HOSI model, performed well with an order of 3 (PC-HOSI-3), with a root mean square error of 0.421 degrees Brix and a coefficient of determination of 0.864. Compared with traditional machine learning and deep learning algorithms, the coefficient of determination for the prediction set was improved by 0.07 and 0.39, respectively. The permutation algorithm also provided interpretability analysis for the predictions of the deep learning model, offering insights into the importance of spectral bands. These results contribute to the accurate prediction of SSC in peaches and support research on interpretability of neural network models for prediction. (c)

关键词： deep learning High Order Spatial Interaction Network attention module spectral clustering soluble solids content permutation algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server

引用

GAZI UNIVERSITY JOURNAL OF SCIENCE 2011年第1期24卷 113-123页

作者： Turker, A. Kursad Sel, Cagri Kirikkale Univ Fac Engn Dept Ind Engn Kirikkale Turkey

This paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum makespan of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets. The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is effective to solve P2,S|STsd|Cmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. Effectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2,S|STsd|Cmax problem.

关键词： Parallel Machine Scheduling Genetic algorithm permutation algorithm

来源：评论

学校读者我要写书评

暂无评论

permutation OF DATA BLOCKS IN A BUBBLE MEMORY

引用

COMMUNICATIONS OF THE ACM 1979年第1期22卷 21-25页

作者： BONGIOVANNI, GC LUCCIO, F Univ. of Pisa Pisa Italy Univ. of Pisa Pisa Italy

Examines the internal organization of a magnetic bubble memory. Components of bubble memories; permutation of loop contents; Identification of class of optimum algorithms.

关键词： bubble memory data block shift memory loops permutation algorithm

来源：评论

学校读者我要写书评

暂无评论

Novel bilateral-diffusion image encryption algorithm with compound chaos and LFSR

引用

The Journal of Photographic Science 2012年第5期60卷 294-304页

关键词： image encryption compound chaos LFSR bilateral-diffusion permutation algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：