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

Experimental evaluation of solution approaches for the K-route maximum flow problem

COMPUTERS & OPERATIONS REsearch 2005年第9期32卷 2453-2478页

作者： Guerriero, F Mancini, M Univ Calabria Dipartimento Elettron Informat & Sistemist I-87030 Arcavacata Di Rende Italy

We describe the implementation and testing of approaches for the solution of the maximum K-route flow problem. More specifically, we focus on Kishimoto's algorithm, the binary search algorithm and the K-route flow algorithm. With the aim to compare the performances of the aforementioned methods, we report results of computational experiments carried out on a large set of randomly generated problems with varying topology and arc capacities. The numerical results show that Kishimoto's algorithm is generally the fastest for solving fully random networks and 3-D grid random networks. The binary search algorithm provides the best performance in solving grid random networks. The K-route flow algorithm is generally the fastest for solving fully random networks and 3-D grid random networks with capacity range of [1,1000] and certain values of K. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： multiroute maximum flows Kishimoto's algorithm binary search algorithm K-route flow algorithm implementation and computation

来源：评论

学校读者我要写书评

暂无评论

A Maximum Independent Set Method for Scheduling Earth-Observing Satellite Constellations

引用

JOURNAL OF SPACECRAFT AND ROCKETS 2021年第5期58卷 1416-1429页

作者： Eddy, Duncan Kochenderfer, Mykel J. Stanford Univ Aeronaut & Astronaut Durand Bldg 450 Lomita Mall Stanford CA 94305 USA

Operating Earth-observing satellites requires efficient planning methods that coordinate activities of multiple spacecraft. The satellite task-planning problem entails selecting actions that best satisfy mission objectives for autonomous execution. Task scheduling is often performed by human operators assisted by heuristic or rule-based planning tools. This approach does not efficiently scale to multiple assets as heuristics frequently fail to properly coordinate actions of multiple vehicles over long horizons. Additionally, the problem becomes more difficult to solve for large constellations as the complexity of the problem scales exponentially in the number of requested observations and linearly in the number of spacecraft. It is expected that new commercial optical- and radar-imaging constellations will require automated planning methods to meet stated responsiveness and throughput objectives. This paper introduces a new approach for solving the satellite-scheduling problem by generating an infeasibility-based graph representation of the problem and finding a maximal independent set of vertices for the graph. The approach is tested on a scenario of up to 10,000 requested imaging locations for the SkySat constellation of optical satellites as well as simulated constellations of up to 24 satellites. Performance is compared with contemporary graph-traversal and mixed-integer linear programming approaches. Empirical results demonstrate improvements in the solution time along with the number of scheduled collections beyond baseline methods. For large problems, the maximum independent set approach is able to find a feasible schedule with 8% more collections in 75% less time.

关键词： Satellite Constellations Earth Constellations Synthetic Aperture Radar SkySat Mixed Integer Linear Programming binary search algorithm Evolutionary algorithm Image Resolution North American Aerospace Defense Command

来源：评论

学校读者我要写书评

暂无评论

A linear method to extract diode model parameters of solar panels from a single I-V curve

引用

RENEWABLE ENERGY 2015年 76卷 135-142页

作者： Lim, Li Hong Idris Ye, Zhen Ye, Jiaying Yang, Dazhi Du, Hui Univ Glasgow Singapore Singapore 599489 Singapore REC Cells Pte Ltd Singapore 637312 Singapore NUS SERIS Singapore 117574 Singapore

The I-V characteristic curve is very important for solar cells/modules being a direct indicator of performance. But the reverse derivation of the diode model parameters from the I-V curve is a big challenge due to the strong nonlinear relationship between the model parameters. It seems impossible to solve such a nonlinear problem accurately using linear identification methods, which is proved wrong in this paper. By changing the viewpoint from conventional static curve fitting to dynamic system identification, the integral-based linear least square identification method is proposed to extract all diode model parameters simultaneously from a single I-V curve. No iterative searching or approximation is required in the proposed method. Examples illustrating the accuracy and effectiveness of the proposed method, as compared to the existing approaches, are presented in this paper. The possibility of real-time monitoring of model parameters versus environmental factors (irradiance and/or temperatures) is also discussed. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Diode model I-V curve Linear least square binary search algorithm

来源：评论

学校读者我要写书评

暂无评论

CARR: a scalable solution for network packet classification

引用

EXPERT SYSTEMS 2012年第1期29卷 70-83页

作者： Li, Wei Zheng, Weibin Lin, Juanjuan Guan, Xiaohong Li, Ling Chaudhry, Sohail S. Wang, Pan Liu, Yanping Xi An Jiao Tong Univ MOE KLINNS Lab Xian 710049 Peoples R China Xi An Jiao Tong Univ SKLMS Lab Xian 710049 Peoples R China Tsinghua Univ TNLIST Lab Ctr Intelligent & Networked Syst Beijing 100084 Peoples R China Wuhan Univ Technol Inst Syst Sci & Engn Wuhan 430070 Peoples R China Old Dominion Univ Norfolk VA 23529 USA Villanova Univ Dept Management & Operat Villanova PA 19085 USA Beijing Jiaotong Univ Beijing 100044 Peoples R China

Modern Internet routers have to handle a large number of packet classification rules, which requires classification schemes to be scalable both in time and space. In this paper, we present a scalable packet classification algorithm that is developed by combining two new concepts to the well-known bit vector (BV) scheme. We propose a range search method based on a cache-aware tree (CATree) which makes full use of processor's cache line to reduce the number of dynamic random access memory (DRAM) accesses. Theoretically, the number of DRAM accesses of CATree is about log(m + 1) times lower than that of the widely used binary search algorithm, where m is the number of keys in a single cache line. Based on our computational results on a set of 1024 keys, the CATree algorithm is 36% faster than binary search algorithm and the performance is better when applied to a larger set of keys. In addition, we develop a rule re-arrangement algorithm to reduce the bitmap space of BV. With this rearrangement, the rules for the same action may be assigned an identical priority. This reduces the number of priorities as well as the memory space of the bitmap. Furthermore, this also reduces the number of memory accesses and hence, increases the CPU cache utilization. With CATree and rule re-arrangement, the cache-aware bit vector with rule re-arrangement algorithm achieves better performance in comparison with the regular BV scheme, both in space and time. In our experiments, the proposed algorithm reduces the bitmap memory space of a practical set of firewall rules by two orders of magnitude and is 91% faster than the regular BV.

关键词： packet classification cache-utilization tree binary search algorithm

来源：评论

学校读者我要写书评

暂无评论

A design and development of an intelligent jammer and jamming detection methodologies using machine learning approach

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第1期22卷 93-101页

作者： Sivaprakash, S. Venkatesan, M. KSR Coll Engn Dept Comp Sci & Engn Namakkal 637215 Tamil Nadu India KSR Inst Engn & Technol Dept Comp Sci & Engn Namakkal 637215 Tamil Nadu India

Nowadays, the utilization of mobile phones has increased rapidly. Due to this evolution schools, mosques, prisons, etc., require silence and security. This is achieved by using the mobile phone jammers. An intelligent mobile jammer is designed for allowing only the emergency calls by utilizing the microcontroller. Here, the jammer utilizes the successive approximation for reducing the transmission power. However, it requires few modifications. Therefore in this paper, an improved successive approximation based on divide and conquer algorithm is proposed in order to design the improved intelligent mobile jammer and reduce transmission power. Subsequently, the proposed jammer is analysed based on the different scenarios and frequency bands to illustrate their performance effectiveness. Furthermore, the normal activities are distinguished from jamming by using machine learning-based detection system according to the various parameters. Finally, the proposed algorithm is compared with conventional algorithms to demonstrate its performance efficiency in terms of detection accuracy.

关键词： Mobile phone jammer Successive approximation binary search algorithm Divide and conquer algorithm Machine learning algorithm

来源：评论

学校读者我要写书评

暂无评论

A Feedforward Controlled Digital Low-Dropout Regulator With Weight Redistribution algorithm and Body Voltage Control for Improving Line Regulation With 99.99% Current Efficiency and 0.5-mV Output Voltage Ripple

引用

IEEE JOURNAL OF SOLID-STATE CIRCUITS 2023年第2期58卷 486-496页

作者： Chen, Bo-Hao Wu, Tzu-Ying Zheng, Kuo-Lin Chen, Ke-Horng Lin, Ying-Hsi Lin, Shian-Ru Tsai, Tsung-Yen Natl Yang Ming Chiao Tung Univ Inst Elect & Comp Engn Hsinchu 30010 Taiwan Chip GaN Power Semicond Corp Hsinchu 300 Taiwan Realtek Semicond Corp Hsinchu 300 Taiwan

In this article, a digital LDO with a feedforward controller and weight redistribution algorithm (WRA) for line regulation improvement is proposed. The proposed digital low dropout (DLDO) uses a feedforward path to obtain the information of V-IN and applies WRA and body voltage controller to adjust I-OUT to minimize the output voltage ripple Delta V-OUT. Different from conventional freeze mode, the feedforward control (FFC) with low quiescent current can keep Delta V-OUT < 0.5 mV in steady state and Delta V-OUT < 4 mV during line transient. In order for the feedback loop to rapidly wake up, the transient pump circuit is used to reduce the undershoot to less than 30 mV in the case of load change from 1 to 200 mA. Due to low quiescent current in the FFC, the DLDO achieves peak current efficiency of 99.99% at heavy loads.

关键词： binary search algorithm body voltage control (BVC) digital low dropout (DLDO) feedforward control (FFC) technique line regulation power supply rejection (PSR)

来源：评论

学校读者我要写书评

暂无评论

Modeling, analysis, and control of wind-driven induction generators supplying DC loads under various operating conditions

引用

WIND ENGINEERING 2021年第3期45卷 680-695页

作者： Akbarali, Mahaboob Subahani Subramanium, Senthil Kumar Natarajan, Kumaresan Natl Inst Technol Dept Elect & Elect Engn Tiruchirappalli 620015 India

A configuration of a self-excited induction generator supplying DC loads with constant voltage through a diode bridge rectifier and a buck-type DC-DC converter is proposed. The rectifier input current is made continuous, by connecting a suitably designed series filter inductor. The method of binary search algorithm is used to solve for the operating parameters of the generator. The performance of the entire unit is predetermined for the various patterns of speed and power operations. For the dynamic analysis of the induction machine, anabc-dqmodeling has been employed and the simulation results on the unit are obtained under both steady state and transient state using MATLAB/Simulink toolbox. A prototype model of the unit has been built in the laboratory and the experimental results have been presented, thereby validating the performance and usefulness of the system.

关键词： Wind energy conversion system digital signal controller binary search algorithm power converters self-excited induction generator

来源：评论

学校读者我要写书评

暂无评论

DCT and DST Based Image Compression for 3D Reconstruction

引用

3D REsearch 2017年第1期8卷 1-19页

作者： Siddeq, Mohammed M. Rodrigues, Marcos A. Sheffield Hallam Univ GMPR Geometr Modelling & Pattern Recognit Res Grp Sheffield S Yorkshire England

This paper introduces a new method for 2D image compression whose quality is demonstrated through accurate 3D reconstruction using structured light techniques and 3D reconstruction from multiple viewpoints. The method is based on two discrete transforms: (1) A one-dimensional Discrete Cosine Transform (DCT) is applied to each row of the image. (2) The output from the previous step is transformed again by a one-dimensional Discrete Sine Transform (DST), which is applied to each column of data generating new sets of high-frequency components followed by quantization of the higher frequencies. The output is then divided into two parts where the low-frequency components are compressed by arithmetic coding and the high frequency ones by an efficient minimization encoding algorithm. At decompression stage, a binary search algorithm is used to recover the original high frequency components. The technique is demonstrated by compressing 2D images up to 99% compression ratio. The decompressed images, which include images with structured light patterns for 3D reconstruction and from multiple viewpoints, are of high perceptual quality yielding accurate 3D reconstruction. Perceptual assessment and objective quality of compression are compared with JPEG and JPEG2000 through 2D and 3D RMSE. Results show that the proposed compression method is superior to both JPEG and JPEG2000 concerning 3D reconstruction, and with equivalent perceptual quality to JPEG2000.

关键词： DCT DST High frequency minimization binary search algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal discrete time control of antiangiogenic tumor therapy

引用

IFAC-PapersOnLine 2017年第1期50卷 13504-13509页

作者： Drexler, Dániel András Sápi, Johanna Kovács, Levente Physiological Controls Research Center Research and Innovation Center of Óbuda University Óbuda University Hungary

The efficiency of therapeutic cancer treatment protocols can be increased by incorporating knowledge about the underlying physiological processes into the design of the protocol. The aim of this work is to find the optimal protocol resulting in minimal drug usage for fixed resting time between measurements and treatments (the sampling time) and predefined tumor volumes for the inspections. The minimal amount of drug is calculated by a binary search algorithm using the model of tumor growth. The monotonicity of the tumor growth model is proved providing that the search algorithm finds the optimal solution. The optimal therapeutic protocol is calculated for different sampling times, and we find that relatively small sampling times are desirable in many aspects. © 2017

关键词： Physiological models Controlled drug delivery Learning algorithms Nonlinear systems Physiology Tumors binary search algorithm Biomedical control Discrete time control Optimal controls Physiological process Therapeutic protocols Tumor growth modeling Tumor therapy

来源：评论

学校读者我要写书评

暂无评论

A Novel Tuning Method for Impedance Matching Network Based on Linear Fractional Transformation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第6期67卷 1039-1043页

作者： Xiong, Botao Yang, Lei Cao, Tao China Acad Engn Phys Inst Elect Engn Mianyang 621000 Sichuan Peoples R China

Correction of antenna impedance variation in real time with low cost is a challenge. We propose two criteria with the aid of linear fractional transformation (LFT) to fulfill the pre-requirements of binary search scheme. Compared with gradient descent-based algorithms, the convergence speed is improved from O(N) to O(logN) at the cost of expensive impedance sensor. To reduce the hardware cost and computational complexity of feedback circuits, the binary search scheme is optimized so that only the detection of the sign of real part and imaginary part of S-11 is required. As a result, compared with the impedance sensor, no analog to digital converters (ADCs) and digital calculations are required for the proposed feedback loop. In the end, the proposed scheme is validated with an electromagnetic simulation.

关键词： Linear fractional transformation detector for the sign of S-11 binary search algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：