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

efficient algorithm for removal of loopbacks in p-cycle-based survivable WDM networks

IET COMMUNICATIONS 2018年第18期12卷 2366-2373页

作者： Singh, Hari Mohan Yadav, Rama Shankar SHUATS Dept Comp Sci & IT Allahabad Uttar Pradesh India MNNIT Dept Comp Sci & Engn Allahabad Uttar Pradesh India

p-cycles have been widely investigated for survivability of wave division multiplexing (WDM) optical networks. It combines fast recovery feature of ring and spare capacity efficiency of mesh. However, it provides a longer restoration path (RP) which increases the transmission time and causes other impairments. Researchers in this field have mentioned that the loopbacks are the main reason behind the longer length of RPs. Two predominant algorithms have been reported in the literature for the removal of loopbacks (RLB). Both algorithms determine the loopbacks by the route information dynamically aggregated at incident nodes of the failed span. Dynamically acquiring route information of affected working paths and candidate p-cycles causes communication and node processing overhead. In this study, we have conducted an analytical study to ascertain the node which forms the longest loopback in RP. Further, an efficient algorithm has been proposed for RLB directly without gathering the route information and tedious loopback calculation at the end nodes of failed span. The simulation result shows that the proposed approach substantially reduces RPs length and promptly removes the loopbacks. Further, it has reduced communication and other overheads to a great extent.

关键词： wavelength division multiplexing telecommunication network routing optical fibre networks telecommunication network reliability loopbacks efficient algorithm cycle-based survivable WDM networks survivability wave division (WDM) optical networks longer restoration path RP predominant algorithms incident nodes failed span dynamically acquiring route information affected working paths node processing overhead longest loopback tedious loopback calculation

来源：评论

学校读者我要写书评

暂无评论

The Projected Power Method: An efficient algorithm for Joint Alignment from Pairwise Differences

引用

COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS 2018年第8期71卷 1648-1714页

作者： Chen, Yuxin Candes, Emmanuel J. Princeton Univ Dept Elect Engn B316 Engn Quad Princeton NJ 08544 USA Stanford Univ Dept Stat 390 Serra MallSequoia Hall Stanford CA 94305 USA

Various applications involve assigning discrete label values to a collection of objects based on some pairwise noisy data. Due to the discrete-and hence nonconvex-structure of the problem, computing the optimal assignment (e.g., maximum-likelihood assignment) becomes intractable at first sight. This paper makes progress towards efficient computation by focusing on a concrete joint alignment problem;that is, the problem of recovering n discrete variables xi is an element of {1, ..., m}, 1 <= i <= n, given noisy observations of their modulo differences {x(i) - x(j) mod(m)}. We propose a low-complexity and model-free nonconvex procedure, which operates in a lifted space by representing distinct label values in orthogonal directions and attempts to optimize quadratic functions over hypercubes. Starting with a first guess computed via a spectral method, the algorithm successively refines the iterates via projected power iterations. We prove that for a broad class of statistical models, the proposed projected power method makes no error-and hence converges to the maximum-likelihood estimate-in a suitable regime. Numerical experiments have been carried out on both synthetic and real data to demonstrate the practicality of our algorithm. We expect this algorithmic framework to be effective for a broad range of discrete assignment problems. (C) 2018 Wiley Periodicals, Inc.

关键词： observational data Pairwise Quadratics Alignment tag value Hypercube noisy data Modulo efficient algorithm Energy sources

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm based on Gegenbauer wavelets for the solutions of variable-order fractional differential equations

引用

EUROPEAN PHYSICAL JOURNAL PLUS 2018年第8期133卷 327页

作者： Usman, Muhammad Hamid, Muhammad Ul Haq, Rizwan Wang, Wei Peking Univ Sch Math Sci Beijing 100871 Peoples R China Bahria Univ Dept Elect Engn Islamabad Campus Islamabad Pakistan

The article is devoted to a new computational algorithm based on the Gegenbauer wavelets (GWs) to solve the linear and nonlinear variable-order fractional differential equations. The novel operational matrices for derivatives of positive integer and variable order are derived. New piecewise functions are introduced to obtain the said operational matrices. In the proposed method, the given problem via Gegenbauer wavelets is transformed to a system of algebraic equations. The obtained solutions are endorsing the accuracy and efficiency of the suggested method and are in excellent agreement with the existing literature. The convergence and error bound analysis are presented in our study to show the credibility of the computational method and support the mathematical formulation of the algorithm. The discussed problems reconfirm the appropriateness of said algorithm and perceived that the proposed algorithm is an efficient tool to tackle the nonlinear fractional order problems of complex nature.

关键词： efficient algorithm wavelets Differential equations Piecewise Function variable order computational methods

来源：评论

学校读者我要写书评

暂无评论

TGMI: an efficient algorithm for identifying pathway regulators through evaluation of triple-gene mutual interaction

引用

NUCLEIC ACIDS RESEARCH 2018年第11期46卷 e67-e67页

作者： Gunasekara, Chathura Zhang, Kui Deng, Wenping Brown, Laura Wei, Hairong Michigan Technol Univ Sch Forest Resources & Environm Sci Houghton MI 49931 USA Michigan Technol Univ Program Computat Sci & Engn Houghton MI 49931 USA Michigan Technol Univ Dept Math Sci Houghton MI 49931 USA Michigan Technol Univ Dept Comp Sci Houghton MI 49931 USA Michigan Technol Univ Life Sci & Technol Inst Houghton MI 49931 USA Beijing Forestry Univ Beijing Adv Innovat Ctr Tree Breeding Mol Design Beijing Peoples R China

Despite their important roles, the regulators for most metabolic pathways and biological processes remain elusive. Presently, the methods for identifying metabolic pathway and biological process regulators are intensively sought after. We developed a novel algorithm called triple-gene mutual interaction (TGMI) for identifying these regulators using high-throughput gene expression data. It first calculated the regulatory interactions among triple gene blocks (two pathway genes and one transcription factor (TF)), using conditional mutual information, and then identifies significantly interacted triple genes using a newly identified novel mutual interaction measure (MIM), which was substantiated to reflect strengths of regulatory interactions within each triple gene block. The TGMI calculated the MIM for each triple gene block and then examined its statistical significance using bootstrap. Finally, the frequencies of all TFs present in all significantly interacted triple gene blocks were calculated and ranked. We showed that the TFs with higher frequencies were usually genuine pathway regulators upon evaluating multiple pathways in plants, animals and yeast. Comparison of TGMI with several other algorithms demonstrated its higher accuracy. Therefore, TGMI will be a valuable tool that can help biologists to identify regulators of metabolic pathways and biological processes from the exploded high-throughput gene expression data in public repositories.

关键词： efficient algorithm Biological Process Regulators Metabolic Pathways MTSS1 gene Treble Pathway

来源：评论

学校读者我要写书评

暂无评论

Application and Evaluation of efficient algorithm for Computing Product of Pairings to 256-bit Secure Pairing-friendly Curves

Application and Evaluation of Efficient Algorithm for Comput...

引用

International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)

作者： Ryota Udani Koutarou Suzuki Toyohashi University of Tecnology 1–1 Hibarigaoka Tempaku-cho Toyohashi Aichi Japan

ISBN: (纸本)9781728134536

In some pairing-based primitives and protocols, evaluation of product of pairings is required. Granger et al proposed an efficient algorithm for computing product of pairings. Recently, Kim et al proposed an efficient algorithm, called extended tower number field sieve, for discrete logarithm problem in finite field, that reduces security levels of pairing friendly curves. Regarding this, Kiyomura et al proposed new 256-bit secure pairing friendly curves. In this paper, we apply the Granger's pairing product algorithm to the 256-bit secure pairing friendly curves called BLS-24 and BLS-48. Moreover, we estimate computational costs of the proposed application considering optimization techniques for pairing computation.

关键词： Elliptic curve Pairing Pairing friendly curve 256-bit security Pairing efficient algorithm Elliptic curves Security level Secure Curves Galois fields Number field

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for Voltage Enhancement in Power System

An Efficient Algorithm for Voltage Enhancement in Power Syst...

引用

International Conference on Power Electronics, Control and Automation (ICPECA)

作者： Yudhishthir Pandey Mohammed Aslam Husain Akhilesh Kumar Mishra Gaurav Gautam Kishan Kumar Shivam Kumar R.E.C. Ambedkarnagar Uttar Pradesh India

ISBN: (纸本)9781728139593

In this paper, voltage stability of electrical power system has been analyzed. Excessive reactive power demand by load in network causes congestion as well as voltage instability. This paper utilized Power System Analysis Toolbox (PSAT) for analysis of network without application of FACTS devices and with FACTS device. FACTs devices are used to maintain the flexible and dynamic control of the power system. Application of FACTS devices in network helps in reducing losses of the network, consequently in congestion management with voltage stability improvement of power system. Out of many possible FACTS devices, the feature of UPFC provides better control the true power line impedance, power quality, reactive power and phase angle and rearrange the real time voltage in transmission line. A 6-bus network is used for illustration of the proposed method. Experimental result shows significant improvement in terms of losses and voltage stability and further helps in congestion management of network.

关键词： UPFC PSAT Voltage stability FACTS Congestion management Voltage stability flexible AC transmission systems power systems efficient algorithm Bus networks VOLTAGE

来源：评论

学校读者我要写书评

暂无评论

efficient algorithm for the vertex cover P_k problem on cacti

引用

APPLIED MATHEMATICS AND COMPUTATION 2017年 311卷 217-222页

作者： Tu, Jianhua Beijing Univ Chem Technol Sch Sci Beijing 100029 Peoples R China

Given a graph G = (V, E), the vertex cover P-k (VCPk) problem is to find a minimum set F subset of V such that every path of order k in G contains at least one vertex from F. For any integer k >= 2, the VCPk problem for general graphs is NP-hard. The paper presents an efficient algorithm for the VCPk problem on cacti. (C) 2017 Elsevier Inc. All rights reserved.

关键词： efficient algorithm Vertex cover P-k problem Cactus graph

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for Reducing Vision Bleach in HDR Imaging

An Efficient Algorithm for Reducing Vision Bleach in HDR Ima...

引用

Global Conference for Advancement in Technology (GCAT)

作者： Ashwin Jose Kattikaran Rizwana Aziz M.P Aswathy B. S Athira Ambujakshan Department of Electronics and Communication TKM College of Engineering Kollam Kerala India

ISBN: (纸本)9781728136950

This paper addresses the problem of loss in detail due to a phenomenon known as vision bleach when photographing a wide dynamic range scene. Vision bleach is caused due to over-exposure of highlights in a scene and is reduced to a certain degree by High Dynamic Range (HDR) algorithms. However, HDR images aren't noise- proof, involve tone-mapping (which reduces color accuracy) and show a loss in sharpness when capturing the scenery with light sources in it. These problems are addressed in the proposed algorithm by using sample images captured by focusing the camera on different POI (point of interest) in the scene. After shift elimination using Motion Homography and ECC (Enhanced Correlation Coefficient) algorithm in individual samples, a high-quality image is constructed by merging them and applying a seam elimination routine. A comparison between the images obtained using the proposed algorithm, an automatic brightness adjustment algorithm and the HDR algorithms show better color accuracy and a greater reduction in vision bleach around highlights.

关键词： brightness computer vision correlation methods image colour analysis image enhancement images image colour analysis correlation methods image enhancement computer vision brightness hot dry rocks GATA3 gene efficient algorithm Sight over exposure natural scenery algorithms hard light

来源：评论

学校读者我要写书评

暂无评论

An Energy efficient Embedding algorithm for Multi-Domain Virtual Network Embedding

An Energy Efficient Embedding Algorithm for Multi-Domain Vir...

引用

IEEE Global Telecommunications Conference (GC Wkshps)

作者： Cao, Haotong Guo, Yongan Wu, Shengchen Zhu, Hongbo Yang, Longxiang Nanjing Univ Posts & Telecommun Jiangsu Key Lab Wireless Commun Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538649206

Network virtualization (NV) is one fundamental attribute of the next generation network. Virtual network embedding (VNE) is about the resource allocation in NV topic. Researchers have proposed multiple embedding algorithms since 2008. Preceding algorithms try to accept more virtual networks (VNs) in one underlying substrate network (SN) and maximize embedding revenue. As energy cost accounts for approximately half whole network cost, it is essential for Internet service providers to optimize energy cost. In addition, in real networking environment, it is vital to embed VNs among multiple SNs, geographically distributed in different regions. To solve both issues, we firstly propose the Multi-Domain VNE problem model and formal energy cost model for VNE. Then, we present a two-stage and energy efficient algorithm (EEMD-VNE-T), aiming at optimizing energy cost. Meanwhile, the EEMD-VNE-T is able to embed each VN among multiple SNs in polynomial time. Preliminary results reveal that EEMD-VNE-T significantly reduces the energy cost by roughly 8.7% over two representative energy algorithms.

关键词： Virtual network embedding optimize energy cost multiple substrate networks efficient algorithm

来源：评论

学校读者我要写书评

暂无评论

efficient algorithm for classification of electrocardiogram beats based on artificial bee colony-based least-squares support vector machines classifier

引用

ELECTRONICS LETTERS 2016年第14期52卷 1198-1199页

作者： Jain, S. Bajaj, V. Kumar, A. Indian Inst Informat Technol Design & Mfg Jabalpu Eelctron & Commun Engn Deapartment Jabalpur 482005 Madhya Pradesh India

Automated electrocardiogram (ECG) beat classification is an important component of heart monitoring systems used for raising an emergency call during sudden cardiac disorder of patients. An automatic ECG beat classifier is proposed to exploit the bandwidth features that are exclusively extracted from analytic intrinsic mode functions (IMFs). The proposed methodology employs artificial bee colony (ABC) algorithm-based least-squares support vector machines (LSSVM) classifier to classify ECG beat types using radial basis function kernel. Simulation results illustrate that proposed classifier gives the best results with second IMF. This novelty lies in its unique combination of ABC with LSSVM classifier that efficiently exploits bandwidth features for automatic classification of ECG beats.

关键词： bioelectric potentials electrocardiography least squares approximations medical disorders medical signal processing signal classification support vector machines ABC classifier LSSVM classifier analytic intrinsic mode functions artificial bee colony-based least-square support vector machine classifier automated ECG beat classification automated electrocardiogram beat classification automatic classification bandwidth features cardiac disorder efficient algorithm heart monitoring systems radial basis function kernel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：