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

Associated types and constraint propagation for generic programming in Scala

PROGRAMMING AND computer SOFTWARE 2015年第4期41卷 224-230页

作者： Pelenitsyn, A. Southern Fed Univ Rostov Na Donu 344006 Russia

Generic programming is a programming paradigm for creation of highly resuable software components through decoupling algorithms from specific data structures which are being processed. The rise of research on ways of handling generic programming in various programming languages took place last years. We analyze and develop a number of generic programming features, in particular associated types and constraint propagation, for the Scala programming language designed by Martin Odersky in A parts per thousand cole Polytechnique F,d,rale de Lausanne.

关键词： GENERIC programming (computer science) SCALA (computer program language) computer software computer algorithms DATA structures (computer science) computer programming

来源：评论

学校读者我要写书评

暂无评论

Energy Balanced Redeployment Algorithm for Heterogeneous Wireless Sensor Networks

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-11页

作者： Ye, Guang Zhang, Baihai Chai, Senchun Cui, Lingguo Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China

Wireless sensor networks (WSNs) have gained worldwide attention in recent years. Since WSNs can be conveniently deployed to monitor a given field of interest, they have been considered as a great long-term economic potential for military, environmental, and scientific applications and so forth. One of the most active areas of research in WSNs is the coverage which is one of the most essential functions to guarantee quality of service (QoS) in WSNs. However, less attention is paid on the heterogeneity of the node and the energy balance of the whole network during the redeployment process. In this work, the energy balanced problems in mobile heterogeneous WSNs redeployment have been analyzed. The virtual force algorithm with extended virtual force model is used to improve the QoS of the deployment. Furthermore energy model is added to enhance or limit the movement of the nodes so that the energy of nodes in the whole WSNs can be balanced and the lifetime of the networks can be prolonged. The simulation results verify the effectiveness of this proposed algorithm.

关键词： computer algorithms WIRELESS sensor networks PROBLEM solving FUNCTIONS (Mathematics) QUALITY of service

来源：评论

学校读者我要写书评

暂无评论

Vehicle Suspension Identification Via Algorithmic Computation of State and Design Sensitivities

引用

JOURNAL OF MECHANICAL DESIGN 2015年第2期137卷 1-9页

作者： Callejo, Alfonso Garcia de Jalon, Javier Wichita State Univ Natl Inst Aviat Res Wichita KS 67260 USA Univ Politecn Madrid ETSII E-28006 Madrid Spain Univ Politecn Madrid INSIA E-28006 Madrid Spain Univ Politecn Madrid INSIA Madrid 28031 Spain

It is common in mechanical simulation to not know the value of key system parameters. When the simulation is very sensitive to those design parameters and practical or budget limitations prevent the user from measuring the real values, parameter identification methods become essential. Kalman filter methods and optimization methods are the most widespread approaches for the identification of unknown parameters in multibody systems. A novel gradient-based optimization method, based on sensitivity analyses for the computation of machine-precision gradients, is presented in this paper. The direct differentiation approach, together with the algorithmic differentiation of derivative terms, is employed to compute state and design sensitivities. This results in an automated, general-purpose and robust method for the identification of parameters. The method is applied to the identification of a real-life vehicle suspension system (namely of five stiffness coefficients) where both smooth and noisy reference responses are considered. The identified values are very close to the reference ones, and everything is carried out with limited user intervention and no manual computation of derivatives.

关键词： AUTOMOBILES -- Springs & suspension -- Design & construction PARAMETER identification KALMAN filtering SYSTEMS design computer algorithms SIMULATION methods & models

来源：评论

学校读者我要写书评

暂无评论

KPCA-ESN Soft-Sensor Model of Polymerization Process Optimized by Biogeography-Based Optimization Algorithm

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-10页

作者： Cui, Wen-hua Wang, Jie-sheng Li, Shu-xia Univ Sci & Technol Liaoning Sch Elect & Informat Engn Anshan 114044 Peoples R China Univ Sci & Technol Liaoning Natl Financial Secur & Syst Equipment Engn Res Ct Anshan 114044 Peoples R China

For solving the problem that the conversion rate of vinyl chloride monomer (VCM) is hard for real-time online measurement in the polyvinyl chloride (PVC) polymerization production process, a soft-sensor modeling method based on echo state network (ESN) is put forward. By analyzing PVC polymerization process ten secondary variables are selected as input variables of the soft-sensor model, and the kernel principal component analysis (KPCA) method is carried out on the data preprocessing of input variables, which reduces the dimensions of the high-dimensional data. The k-means clustering method is used to divide data samples into several clusters as inputs of each submodel. Then for each submodel the biogeography-based optimization algorithm (BBOA) is used to optimize the structure parameters of the ESN to realize the nonlinear mapping between input and output variables of the soft-sensor model. Finally, the weighted summation of outputs of each submodel is selected as the final output. The simulation results show that the proposed soft-sensor model can significantly improve the prediction precision of conversion rate and conversion velocity in the process of PVC polymerization and can satisfy the real-time control requirement of the PVC polymerization process.

关键词： PROCESS optimization POLYMERIZATION BIOGEOGRAPHY computer algorithms PROBLEM solving PRINCIPAL components analysis

来源：评论

学校读者我要写书评

暂无评论

A DNA Algorithm for the maximal matching problem

引用

AUTOMATION AND REMOTE CONTROL 2015年第10期76卷 1797-1802页

作者： Li Wenxia Patrikeev, E. M. Xiao Dongmei E China Normal Univ Shanghai 200062 Peoples R China Jiao Tong Univ Shanghai 200030 Peoples R China

We propose a procedure for solving the classical discrete extremal maximal matching problem with the Adleman-Lipton model as the computational architecture. We show that for an undirected graph with n edges the soluti... 详细信息

关键词： MOLECULAR computers DNA computer algorithms AUTOMATIC control REMOTE control BINARY control systems NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

Clustering Ensemble for Identifying Defective Wafer Bin Map in Semiconductor Manufacturing

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-11页

作者： Hsu, Chia-Yu Yuan Ze Univ Dept Informat Management Taoyuan 32003 Taiwan Yuan Ze Univ Innovat Ctr Big Data & Digital Convergence Taoyuan 32003 Taiwan

Wafer bin map (WBM) represents specific defect pattern that provides information for diagnosing root causes of low yield in semiconductor manufacturing. In practice, most semiconductor engineers use subjective and time-consuming eyeball analysis to assess WBM patterns. Given shrinking feature sizes and increasing wafer sizes, various types of WBMs occur;thus, relying on human vision to judge defect patterns is complex, inconsistent, and unreliable. In this study, a clustering ensemble approach is proposed to bridge the gap, facilitating WBM pattern extraction and assisting engineer to recognize systematic defect patterns efficiently. The clustering ensemble approach not only generates diverse clusters in data space, but also integrates them in label space. First, the mountain function is used to transform data by using pattern density. Subsequently, k-means and particle swarm optimization (PSO) clustering algorithms are used to generate diversity partitions and various label results. Finally, the adaptive response theory (ART) neural network is used to attain consensus partitions and integration. An experiment was conducted to evaluate the effectiveness of proposed WBMs clustering ensemble approach. Several criterions in terms of sum of squared error, precision, recall, and F-measure were used for evaluating clustering results. The numerical results showed that the proposed approach outperforms the other individual clustering algorithm.

关键词： SEMICONDUCTOR manufacturing PARTICLE swarm optimization NUMERICAL analysis computer algorithms MATHEMATICAL analysis

来源：评论

学校读者我要写书评

暂无评论

A Two-Sided Matching Decision Model Based on Uncertain Preference Sequences

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-10页

作者： Liu, Xiao Ma, Huimin Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China

Two-sided matching is a hot issue in the field of operation research and decision analysis. This paper reviews the typical two-sided matching models and their limitations in some specific contexts, and then puts forward a new decision model based on uncertain preference sequences. In this model, we first design a data processing method to get preference ordinal value in uncertain preference sequence, then compute the preference distance of each matching pair based on these certain preference ordinal values, set the optimal objectives as maximizing matching number and minimizing total sum of preference distances of all the matching pairs under the lowest threshold constraint of matching effect, and then solve it with branch-and-bound algorithm. Meanwhile, we take two numeral cases as examples and analyze the different matching solutions with one-norm distance, two-norm distance, and positive-infinity-normdistance, respectively. We also compare our decision model with two other approaches, and summarize their characteristics on two-sided matching.

关键词： DECISION making COMPARATIVE studies CONSUMERS' preferences computer algorithms ELECTRONIC data processing

来源：评论

学校读者我要写书评

暂无评论

Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-8页

作者： Wang, Zhaocai Qin, Jiangfeng Ji, Zuwen Huang, Dongmei Li, Lei Shanghai Ocean Univ Sch Informat Sci Shanghai 201306 Peoples R China Guangxi Inst Water Resources Res Nanning 530023 Peoples R China China Inst Water Resources & Hydropower Res State Key Lab Simulat & Regulat River Basin Water Beijing 100048 Peoples R China Xian Univ Architecture & Technol Dept Civil Engn Xian 710055 Peoples R China

The maximum weighted clique (MWC) problem, as a typical NP-complete problem, is difficult to be solved by the electronic computer algorithm. The aim of the problem is to seek a vertex clique with maximal weight sum in a given undirected graph. It is an extremely important problem in the field of optimal engineering scheme and control with numerous practical applications. From the point of view of practice, we give a parallel biological algorithm to solve the MWC problem. For the maximum weighted clique problem with.. edges and.. vertices, we use fixed length DNA strands to represent different vertices and edges, fully conduct biochemical reaction, and find the solution to the MVC problem in certain length range with O(n(2)) time complexity, comparing to the exponential time level by previous computer algorithms. We expand the applied scope of parallel biological computation and reduce computational complexity of practical engineering problems. Meanwhile, we provide a meaningful reference for solving other complex problems.

关键词： PARALLEL computers BIOLOGICAL models computer algorithms BIOMEDICAL engineering UNDIRECTED graphs VERTICES (Geometry)

来源：评论

学校读者我要写书评

暂无评论

Sequential quadratic programming for the control of an architectural cable net geometry

Sequential quadratic programming for the control of an archi...

引用

American Control Conference

作者： Yvonne R. Sturz Manfred Morari Roy S. Smith Automatic Control Laboratory ETH Zurich Switzerland

ISBN: (纸本)9781467386838

In order to efficiently construct anticlastic concrete shell structures in architecture, flexible formwork can be used, whose main component is a cable net under tension. To cope with the fabrication tolerances of the cable net and thus to reduce the deviations between the nominal digital design model and the as-built one, which is needed to guarantee the properties of the shell, we propose a control algorithm which iteratively steers the geometry of the cable net to the desired one. Our contribution in this paper is twofold. We formulate an optimal control problem and provide two different formulations of the nonlinear equality and inequality constraints. Whereas one of the formulations is a set of implicit nonlinear equations, the other one is the solution to a second-order cone program, which can efficiently be solved. We use both formulations and combine them into a control algorithm, which is based on Sequential Quadratic Programming (SQP), and where the solution in each iteration is feasible for the nonlinear constraints. A simulation example is presented to demonstrate the performance of the developed control algorithm.

关键词： Artificial neural networks Geometry Noise measurement Buildings Topology Force Fabrication computer algorithms Noise measurement geometry sequential quadratic programming Buildings Artificial neural networks topology Force cable fabrication Nets built structure manufacturing tolerances

来源：评论

学校读者我要写书评

暂无评论

Control bandwidth recovery of flexible pointing systems

Control bandwidth recovery of flexible pointing systems

引用

American Control Conference

作者： David E. Zlotnik James R. Forbes Jack B. Aldrich Department of Aerospace Engineering University of Michigan Ann Arbor 48109 USA Department of Mechanical Engineering McGill University Montreal QC H3A 0C3 Canada Jet Propulsion Lab California Inst. of Technology Pasadena 91109 USA

ISBN: (纸本)9781467386838

Instrument pointing control systems mounted on spacecraft are inherently bandwidth-limited (due to lightly-damped flexible modes of the spacecraft) compared to the same system mounted to a rigid body (such as the ground). This work is concerned with the recovery of control bandwidth for space-based pointing systems via the application of μ-tip control, a passivity-based control methodology. First, the equations of motion of a pointing system are derived. Then, using a "massive payload assumption" a passive input-output map is established between a modified output, called the μ-tip rate, and a modified control input. Bandwidth recovery is confirmed by investigating the frequency response of the linearized system. Simulation results that demonstrate the performance of the developed control algorithm are presented.

关键词： Bandwidth Mathematical model Space vehicles Control systems Electronic mail Kinematics Potential energy Bandwidth Space vehicles electronic mail control systems Potential energy kinematics Mathematical Model Spacecraft computer algorithms frequency response Control Methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：