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

IEEE International Symposium on Information Theory (ISIT)

作者： Wadayama, Tadashi Hagiwara, Manabu Nagoya Inst Technol Dept Comp Sci Nagoya Aichi 4668555 Japan Natl Inst Adv Ind Sci & Technol Tsukuba Ibaraki 3058568 Japan

ISBN: (纸本)9781457705953

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding problem for the proposed class of permutation codes as a linear programming (LP) problem. The main feature of this novel class of permutation codes, called LP decodable permutation codes, is this LP decodability. It is demonstrated that the LP decoding performance of the proposed class of permutation codes is characterized by the vertices of the code polytope of the code. In addition, based on a probabilistic method, several theoretical results for randomly constrained permutation codes are derived.

关键词： AWGN channels Error probability LP decodable permutation codes linear matrix inequalities Maximum likelihood decoding Modulation Upper bound code polytope decoding linear programming linear programming problem linearly constrained permutation matrices matrix algebra minimum Euclidian distance decoding problem probabilistic method probability random codes randomly constrained permutation codes

来源：评论

学校读者我要写书评

暂无评论

The generalized inverse in parametric programming

引用

Calcolo 1974年第3期11卷 351-363页

作者： Salinetti, G. Istituto di Calcolo delle Probabilità dell'Università di Roma Roma Italy

In this paper we are concerned with parametric programming problems. The main results are two: the first one is an explicit representation of the general optimal solution of particular parametric programming problems;the second one is an unified approach to general parametric programming problems. The method suggested here is based on the utilization of the generalized inverse of a matrix: it allows a fast and simple solution of parametric problems and has several advantages over the classical parametric methods. We refer to interval linear programming problems but a fruitful direction of research may be its application to linear programming problems in the standard from. © 1975 IAC.

关键词： programming problem linear programming problem Null Space Generalize Inverse Parametric problem

来源：评论

学校读者我要写书评

暂无评论

Method for estimating the endurance of structural elements with multifactor damage

引用

Strength of Materials 1980年第1期12卷 10-14页

作者： Glukhov, Yu.A. Kuibyshev Polytechnic Institute Russia

1. The probability of no failure occurring with a specific endurance for structural elements experiencing multifactor loading is evaluated. The evaluation is a generalization of the well-known Rzhanitsin expression obtained for the static strength of a structure with random loading. 2. A method is proposed for estimating the probability of no failure occurring according to a regression relationship obtained with planned experiments which model the damage processes. The similarity conditions are given by dimensionless systems established on the basis of dimensional analysis of the original physical variables. 3. An expression is given making it possible on the basis of the regressive dependence of endurance on loading parameters and supporting capacity to optimize the corresponding parameters for greatest endurance. 4. A method is proposed for numerical substantiation of optimum technological paths for structure manufacture which is generally reduced to resolution of a set of linear programming problems. Dissimilarity of problems for optimizing the technology according to certain safety factors is illustrated. © 1980 Plenum Publishing Corporation.

关键词： Similarity Condition programming problem Safety Factor linear programming problem Dimensional Analysis

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Transpotation problem with Unknown Consumer Demands: Consistency Aspects 3

Two-Stage Transpotation Problem with Unknown Consumer Demand...

引用

3rd International Conference on problems of Logistics, Management and Operation in the East-West Transport Corridor, PLMO 2024

作者： Stovba, Viktor Khomiak, Olha V.M. Glushkov Institute of Cybernetics of the Nas of Ukraine Department of Nonsmooth Optimization Methods Kyiv Ukraine V.M. Glushkov Institute of Cybernetics of the Nas of Ukraine Department of Mathematical Methods of Reliability Theory of Complex Systems Kyiv Ukraine

ISBN: (纸本)9798350353099

A mathematical model of a two-stage transportation problem with unknown consumer demands and their lower and upper bounds is studied. The necessary and sufficient conditions for consistency of the constraints system of the linear programming problem, which corresponds to this model, are formulated, and justified. The classical two-stage transportation problem is given, to which the above problem is transformed if consumer demands are known, as well as the consistency conditions for constraints system of the problem. Modification of the initial model that permits product transportation only to the fixed number of consumers, which is less than their total number, is given. © 2024 IEEE.

关键词： constraints system consistency linear programming problem two-stage transportation problem

来源：评论

学校读者我要写书评

暂无评论

Real time scheduler for multiprocessor systems based on continuous control using Timed Continuous Petri Nets 15th

Real time scheduler for multiprocessor systems based on cont...

引用

15th IFAC Workshop on Discrete Event Systems (WODES)

作者： Rubio-Anguiano, L. Ramirez-Trevino, A. Chils, A. Briz, J. L. IPN CINVESTAV Unidad Guadalajara Av Bosque 1145 Zapopan 45019 Jalisco Mexico Univ Zaragoza I3A DIIS Maria Luna 1 Zaragoza 50018 Spain

This work exploits Timed Continuous Petri Nets (TCPN) to design and test a novel energy-efficient thermal-aware real-time global scheduler for a hard real-time (HRT) task set running on a multiprocessor system. The TCPN model encompasses both the system and task set, including thermal features. In previous work we calculated the share of each task that must be executed per time interval by solving off-line an Integer programming problem problem (ILP). A subsequent on-line stage allocated jobs to processors. We now perform the allocation off-line too, including an allocation controller and an execution controller in the on-line stage. This adds robustness by ensuring that actual task allocation and execution honor the safe schedule provided off-line. Last, the on-line controllers allow the design of an improved soft RT aperiodic task manager. Also, we experimentally prove that our scheduler yields fewer context switches and migrations on the HRT task set than RUN, a reference algorithm. Copyright (C) 2020 The Authors.

关键词： Real Time Scheduling Petri Net linear programming problem Unimodularity

来源：评论

学校读者我要写书评

暂无评论

A dual decomposition algorithm

引用

Mathematical programming 1976年第1期11卷 177-193页

作者： Lawrence Jr., John A. University of California Irvine Ca. United States California State University Fullerton Ca. United States

Suppose that a large-scale block-diagonal linear programming problem has been solved by the Dantzig-Wolfe decomposition algorithm and that an optimal solution has been attained. Suppose further that it is desired to perform a post-optimality analysis or a complete parametric analysis on the cost-coefficients or the RHS of the linking constraints. Efficient techniques for performing these analyses for the ordinary simplex case have not been easily applied to this case as one operation involves doing a minimizing ratio between all columns of two rows of the tableau. As the columns are not readily known in Dantzig-Wolfe decomposition, other techniques must be used. To date, suggested methods involve solving small linear programs to find these minimizing ratios. In this paper a method is presented which requires solving no linear programs (except possibly in the case of degeneracy of a subproblem) using and utilizing only the information typically stored for Dantzig-Wolfe decomposition. © 1976 The Mathematical programming Society.

关键词： Mathematical Method programming problem Parametric Analysis Efficient Technique linear programming problem

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for solving convex hull problem and its application to feature selection

A new algorithm for solving convex hull problem and its appl...

引用

7th International Conference on Machine Learning and Cybernetics

作者： Guo, Feng Wang, Xi-Zhao Li, Yan Hebei Univ Coll Math & Comp Sci Key Lab Machine Learning & Computat Intelligence Baoding 071002 Hebei Peoples R China

ISBN: (纸本)9781424420957

A new method to solve the convex hull problem in n-dimensional spaces is proposed in this paper. At each step, a new point is added into the convex hull if the point is judged to be out of the current convex hull by a linear programming model. For the linear separable classification problem, if an instance is regarded as a point of the instances space, the overlap does not still occur between the convex hulls of different classes after a feature is deleted, then we can delete that feature. Repeat this process, an algorithm for feature selection is given. Experimental results show the effectiveness of the algorithm.

关键词： convex hull linear programming problem feature selection

来源：评论

学校读者我要写书评

暂无评论

Plastic analysis of structures and duality in linear programming

引用

Meccanica 1966年第3-4期1卷 95-97页

作者： Gavarini, Carlo Istituto di Scienza delle Costruzioni Università di Firenze Italy

The possibility of formulating the static and kinematic methods of plastic analysis theory as dual linear programming problems is extended to the cases of monodimensional structures under combined stresses with piecew... 详细信息

关键词： Mechanical Engineer Civil Engineer programming problem Analysis Theory linear programming problem

来源：评论

学校读者我要写书评

暂无评论

linear programming in Market Management Using Artificial Intelligence 2nd

Linear Programming in Market Management Using Artificial Int...

引用

2nd International Conference on Mechanical Engineering Design, ICMechD 2019

作者： Uday, Shetty Vignesh Hamritha Chaudhary, Gaurav Department of Industrial Engineering and Management Ramaiah Institute of Technology Bangalore560054 India Department of Electronics and Communication Engineering Ramaiah Institute of Technology Bangalore560054 India

ISBN: (纸本)9789811547447

The intelligence exhibited by machines in decision making using mathematical algorithms in contrast to the human intelligence is known as artificial intelligence (AI). It is an area of engineering science that focuses on the modeling of intelligent systems that work and act in response like humans. The tasks that AI includes are face recognition, voice recognition, planning, learning, and predicting. linear programming problem (LPP) is a tool to solve the real-life problems using the standard mathematical approach that gives us the optimal solution. This paper aims at providing the investors an aid in decision making while advertising their business with combination of the tools that are available. Neural network model will be formulated and trained on the basis of dataset that includes past data of variables such as amount of investment, type of business, demographical area, and consumer attributes. The output nodes include the variables based on the type of advertisement. After training and testing are finished, user provides the model with the inputs and the output predicts the optimal percentage of marketing of product in different fields. This way the model will help us to make sound decisions in allocating the total investment among the variables. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Artificial intelligence linear programming problem Marketing Productivity

来源：评论

学校读者我要写书评

暂无评论

Alignment-free methods for metagenomic profiling

引用

BMC BIOINFORMATICS 2015年第Sup15期16卷 P4-P4页

作者： Gao, Shanshan Diem-Trang Pham Vinhthuy Phan Univ Memphis Dept Comp Sci Memphis TN 38152 USA

关键词： Microbial Community linear programming problem programming Formulation Entire Dataset Microbial Genome

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：