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

Joint optimisation convex-negative matrix factorisation for multi-modal image collection summarisation based on images and tags

引用

IET COMPUTER VISION 2019年第2期13卷 125-130页

作者： Zhang, Wenkai Fu, Kun Sun, Xian Zhang, Yuhang Sun, Hao Wang, Hongqi Chinese Acad Sci Key Lab Spatial Informat Proc & Applicat Syst Tec Inst Elect 19North 4th Ring Rd West Beijing Peoples R China Chinese Acad Sci Inst Elect 19North 4th Ring Rd West Beijing Peoples R China Univ Chinese Acad Sci 19 Yuquan Rd Beijing Peoples R China

Image collection summarisation aims to represent a large-scale multi-modal collection with a small subset of images and tags, helping navigate a large image dataset. Most extant methods leverage the contributions of text-to-visual summaries, ignoring the visual contribution to the textual topic. When the tags are weakly labelled, the textual topic cannot accurately reflect the visual summary. To solve this, the authors propose a novel model, joint optimisation of convex non-negative matrix factorisation, which incorporates images and tags in a beneficial way. The objective function contains visual and textual error functions, sharing the same indicator matrix, connecting different modal relations. Then, they propose an iterative algorithm to optimise the proposed model. Finally, they explore the effects of different visual feature representations (e.g. bag-of-words and deep learning) on multi-modal collection summary. Our proposed method is then compared with state-of-the-art algorithms using two multi-modal datasets (i.e. MIRFlickr and NUS-WIDE-SCENE). Experimental results demonstrate the effectiveness of their proposed approach.

关键词： convex programming matrix decomposition image representation iterative methods joint optimisation convex-negative matrix factorisation multimodal image collection summarisation image dataset text-to-visual summaries objective function textual error functions visual error functions iterative algorithm visual feature representations multimodal collection summary

来源：评论

学校读者我要写书评

暂无评论

Distributed H∞ consensus control for nonlinear multi-agent systems under switching topologies via relative output feedback

引用

NEURAL COMPUTING & APPLICATIONS 2019年第1期31卷 1-9页

作者： Jiang, Yulian Wang, Hongquan Wang, Shenquan Changchun Univ Technol Coll Elect & Elect Engn Changchun 130012 Jilin Peoples R China Chinese Acad Sci Inst Automat State Key Lab Management & Control Complex Syst Beijing 100190 Peoples R China

For a class of nonlinear multi-agent systems under switching topologies with disturbances, we propose a distributed H consensus control protocol based on relative output feedback and utilize an iterative algorithm for solving nonlinear matrix inequality in this paper. Firstly, a consensus control protocol via relative output feedback is designed. Then, an iterative algorithm is utilized to calculate nonlinear matrix inequality. By this, the output feedback gain is designed but not chosen, which increases the design degree of freedom and meanwhile H performance index is obtained. Finally, the proposed theory is applied to multiple simple-pendulums network systems driven by DC motors, and simulation results show the effectiveness of the designed consensus control protocol.

关键词： Multi-agent systems Relative output feedback Consensus iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel approach for FNLP with piecewise linear membership functions

引用

CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS 2019年 191卷 88-95页

作者： Wen, Bo Gu, Wen Yang, Bo Li, Hongguang Chen, Xiaochun Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing Peoples R China Beijing Univ Chem Technol Coll Chem Engn Beijing Peoples R China Changzheng Engn Co Ltd Shanghai Peoples R China

In the fuzzy nonlinear programming (FNLP) domain, piecewise linear membership functions (PLMFs) are often employed to linearize the nonlinear membership functions. However, the linearization error will reduce the accuracy of the solution, which has become an obstacle to the application of PLMFs. In this paper, we present an iterative algorithm based on geometrical means to solve the problems mentioned above. Firstly, the linearization error can be reduced by gradually modifying the programming model. Subsequently, compared with traditional methods, the linearization model is determined only by weighing the linearization degree of membership function and the accuracy of programming results, the proposed method is more directly and effectively. Furthermore, in-depth discussions are also given along with the algorithm for demonstrating the rationality. Finally, the proposed method is validated and compared with other methods. A real example is examined to demonstrate applicability of the proposed method in this paper.

关键词： Fuzzy nonlinear programming Piecewise linear membership functions Error analysis iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic facility location with supplier selection under quantity discount

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2019年第0期134卷 64-74页

作者： Emirhuseyinoglu, Gorkem Ekici, Ali Ozyegin Univ Dept Ind Engn Istanbul Turkey

Retailers have to consider several factors when making facility location decisions including suppliers' and customers' locations, customer demand and price offered by suppliers. In this study, we analyze the multi-period facility location decisions of a retailer which procures the products from multiple suppliers under an incremental quantity discount scheme and in turn satisfies an exogenous demand. The retailer decides (i) where and when to open a facility, (ii) how much to order from each supplier in each time period, and (iii) from which facility locations to satisfy the demand. We formulate the problem as a mixed-integer mathematical model. To handle large instances, we develop a decomposition-based solution approach which considers the decisions in the first echelon (suppliers and facilities) and the second echelon (facilities and customers) in an iterative manner until convergence. We propose two implementations of the proposed solution approach. The first one limits the search space by considering only a subset of the facility locations for each customer. In the second implementation of the proposed solution approach, we develop a novel two-phase strategy where we first eliminate some of the facility locations entirely from the problem using a simplified version of the first approach and then implement the first approach to the reduced set of facility locations. We demonstrate the effectiveness of the heuristic approaches through an extensive computational study. The proposed heuristics provide significantly better results compared to a simple heuristic inspired by a related study. Moreover, we observe that for small instances both heuristics provide solutions with quite low optimality gaps and for larger instances they find better solutions in less amount of time when compared against CPLEX results obtained within a 12-h time limit.

关键词： Dynamic facility location Supplier selection Quantity discount iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fast and Effective Sensitivity Calculation Method for Circuit Input Vectors

引用

IEEE TRANSACTIONS ON RELIABILITY 2019年第3期68卷 938-953页

作者： Xiao, Jie Lou, Jungang Jiang, Jianhui Zhejiang Univ Technol Coll Comp Sci & Technol Hangzhou 313000 Zhejiang Peoples R China Huzhou Univ Coll Informat Sci Huzhou 313000 Peoples R China Tongji Univ Software Engn Dept Shanghai 200072 Peoples R China

The sensitivity of circuit input vectors plays an important role in estimating circuit reliability bounds and identifying reliability-critical gates. Consequently, to effectively calculate the circuit sensitivity for the input vectors is becoming a necessity for nanocircuits, helping circuit designers to select the architecture that best optimizes the tradeoffs between reliability and area power delay. Combining probability signals and employing the iterative strategy presented inMonte Carlo method, this paper proposes an iterative algorithm based on a probabilistic transfer matrix to investigate the circuit sensitivity for the given input vectors, ensuring computational precision and speed. Simulation results on benchmark circuits show that the proposed algorithm is an efficient and accurate method to calculate the sensitivity of the applied input vectors, and that it can be used to improve circuit reliability at a small cost in the early stages of circuit design.

关键词： Circuit input vectors iterative algorithm probabilistic transfer matrix probability signal reliability improvement sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Frequency domain sequence design algorithm minimising weighted integrated sidelobe level

引用

IET RADAR SONAR AND NAVIGATION 2019年第3期13卷 464-472页

作者： Biskin, Osman Tayfun Akay, Olcay Dokuz Eylul Univ Dept Elect & Elect Engn Tinaztepe Campus TR-35160 Buca Izmir Turkey

Unimodular sequences with low-autocorrelation sidelobes are employed in various applications of radar and communication systems. Suppressing some predetermined autocorrelation sidelobes of a designed sequence can be accomplished by performing minimisation of the metric of weighted integrated sidelobe level (WISL). In this study, the authors propose a new algorithm to design unimodular sequences utilising the majorisation minimisation (MM) method for directly minimising WISL in the frequency domain. The proposed algorithm allows the design of long sequences in a computationally efficient manner. As the first step of the algorithm, a function majorising the frequency domain representation of the WISL metric is introduced. Then, a closed-form solution for the minimisation of WISL is derived followed by its realisation as an iterative algorithm. They also provide an acceleration scheme to allow efficient implementation of the designed algorithm. Numerical experiments show that the proposed algorithm not only outperforms existing cyclic algorithms with respect to computation time and suppression of desired autocorrelation sidelobes but also converges in less number of iterations than its time domain MM-based counterparts.

关键词： frequency-domain analysis sequences correlation methods minimisation iterative methods computational complexity low-autocorrelation sidelobes predetermined autocorrelation sidelobes majorisation minimisation method frequency domain representation WISL metric iterative algorithm cyclic algorithms time domain MM-based counterparts frequency domain sequence design algorithm closed-form solution acceleration scheme

来源：评论

学校读者我要写书评

暂无评论

Robust Secure Beamforming for Multibeam Satellite Communication Systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第6期68卷 6202-6206页

作者： Lin, Zhi Lin, Min Ouyang, Jian Zhu, Wei-Ping Panagopoulos, Athanasios D. Alouini, Mohamed-Slim Army Engn Univ PLA Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Minist Educ Nanjing 210003 Jiangsu Peoples R China Concordia Univ Dept Elect & Comp Engn Montreal PQ H3G 1M8 Canada Nanjing Univ Posts & Telecommun Sch Commun & Informat Engn Nanjing 210003 Jiangsu Peoples R China Natl Tech Univ Athens Sch Elect & Comp Engn Zografos 15780 Greece King Abdullah Univ Sci & Technol Div Comp Elect & Math Sci & Engn Thuwal 239556900 Saudi Arabia

This paper proposes a robust beamforming (BF) scheme to enhance the physical layer security (PLS) of a multibeam satellite system operating at Ka band. By considering the effects of beam gain, path loss, and rain attenuation, we first formulate a constrained optimization problem to maximize the minimal achievable secrecy rate of multiuser under the assumption of imperfect eavesdropping channel and the constraint of total transmit power on the satellite. Since the problem is non-convex and mathematically intractable, we exploit the sequential convex approximation approach and S-procedure method to transform the original problem into one with a series of linear matrix inequality and second-order cone constraints, and then propose an iterative scheme to obtain the optimal BF weight vectors. Finally, simulation results showing the effectiveness and superiority of the proposed algorithm are provided.

关键词： Multibeam satellite system secrecy rate iterative algorithm sequential convex approximation

来源：评论

学校读者我要写书评

暂无评论

algorithmic strategy for optimizing product design considering the production costs

引用

INTERNATIONAL JOURNAL OF INTERACTIVE DESIGN AND MANUFACTURING - IJIDEM 2019年第4期13卷 1313-1329页

作者： Adjoul, Oussama Benfriha, Khaled Aoussat, Ameziane Arts & Metiers ParisTech Lab Concept Prod & Innovat 151 Blvd Hop F-75013 Paris France

This article describes a new interactive design approach integrating the constraints associated with production include manufacturing and assembling. The proposed method, in the form of an algorithm, allows optimisation of product design by minimizing production costs at each iteration, without compromising its functionality. The novelty of this algorithm in terms of modeling and optimisation of production costs in the design phase is its ability to dynamically evaluate the cumulative costs of production as a function of design and procedural choices. The availability of this information first allows the identification of design points and/or procedural points that generate significant production costs, and second, suggests improvements and recommendations that aim to optimize production costs. These experiments were conducted at a smart factory installed in our organisation. The proposed algorithm involves four steps. To optimise production costs, the designer must input all of the required data into the simulation and thereby identify the most significant cost elements to optimise. Then, the designer uses the suggested recommendation list to modify the relevant design and/or manufacturing parameters, thus obtaining the new, optimised production costs. If the first result is unsatisfactory, other iterations can be performed.

关键词： Design Manufacturing iterative algorithm Optimization of production costs Dynamic modeling Smart factory

来源：评论

学校读者我要写书评

暂无评论

Stable recovery of compressed sensing signals via optimal dual frame based lq-minimisation for 0 <q ≤ 1

引用

IET SIGNAL PROCESSING 2019年第3期13卷 296-303页

作者： Cao, Chunhong Gao, Xieping Xiangtan Univ MOE Key Lab Intelligent Comp & Informat Proc Xiangtan 411105 Peoples R China

Compressed sensing with sparse frame representation has received much greater attention than the orthonormal bases for its practical application in signal processing. One can expect exact recovery from undersampled data via an $\ell _q$lq-minimisation under some proper conditions imposed on the sensing/measurement matrix and sparse representation matrix. In this study, the authors first introduce a recovery condition named by B-GRIP, which is actually a generalisation of the well-known restricted isometry property that most of the compressed sensing problems depend on. Under this condition, they expand the performance analysis of compressed sensing problem by an $\ell _q$lq-minimisation problem for $0 \lt q \le 1$0iterative algorithm concerning the restoration of compressed sensing signals based on $\ell _q$lq-minimisation for $0 \lt q \le 1$0algorithm, and prove that the iterative sequence can not only approximate the original signal, but be the exact one.

关键词： compressed sensing signal restoration signal representation matrix algebra iterative methods minimisation convergence of numerical methods stable compressed sensing signal recovery optimal dual frame (q)-minimisation problem sparse frame representation undersampled data sensing-measurement matrix sparse representation matrix B-GRIP restricted isometry property iterative algorithm compressed sensing signal restoration iterative sequence

来源：评论

学校读者我要写书评

暂无评论

The calibration of volatility for option pricing models with jump diffusion processes

引用

APPLICABLE ANALYSIS 2019年第4期98卷 810-827页

作者： Xu, Zuoliang Jia, Xiangyu Renmin Univ China Sch Informat Beijing Peoples R China

This paper is devoted to calibrate smooth local volatility surface under jump-diffusion processes. This calibration problem is posed as an inverse problem: given a finite set of observed European option prices, find a local volatility function such that the theoretical option prices matches the observed ones optimally with respect to a prescribed performance criterion. Firstly, we obtain an Euler-Lagrange equation for the calibration problem using Tikhonov regularization method. Then we solve the Euler-Lagrange equation using an iterative algorithm and obtain the volatility. Finally, numerical experiments show the effectiveness of the proposed method.

关键词： Jump-diffusion model Tikhonov regularization Euler-Lagrange equation the finite difference method iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：