Subdivision termination criteria in subdivision multivariate solvers using dual hyperplanes representations

The need for robust solutions for sets of nonlinear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers typically employ the convex hull and subdivision/domain clipping properties of the Bézier/B-spline representation to detect all regions that may contain a feasible solution. Once such a region has been identified, a numerical improvement method is usually applied, which quickly converges to the root. Termination criteria for this subdivision/domain clipping approach are necessary so that, for example, no two roots reside in the same sub-domain (root isolation).This work presents two such termination criteria. The first theoretical criterion identifies subdomains with at most a single solution. This criterion is based on the analysis of the normal cones of the multiviarates and has been known for some time. Yet, a computationally tractable algorithm to examine this criterion has never been proposed. In this paper, we present a dual representation of the normal cones as parallel hyperplanes over the unit hypersphere, which enables us to construct an algorithm for identifying subdomains with at most a single solution. Further, we also offer a second termination criterion, based on the representation of bounding parallel hyperplane pairs, to identify and reject subdomains that contain no solution.We implemented both algorithms in the multivariate solver of the IRIT solid modelling system and present examples using our implementation.     

Optimal machining conditions with dual criteria and applications to scheduling

A bicriterion machining economics problem is presented, considering the minimization of the unit production cost and the maximization of the production rate. The bicriterion machining time is first defined as a weighted average of the maximum production rate machining time and of the minimum unit cost machining time using a weighted-sums technique and an arbitrary weighting factor. Then using a vector-maximum approach, a bicriterion machining lime is defined through the introduction of an optimal weighting factor. This weighting factor reflects the relative importance of the two criteria and it is a function of the delay time cost, that is, the cost associated with the difference in actual processing times between the two criteria. It is shown that the vector-maximum approach outperforms the weighting-sums technique. Furthermore, the bicriterion machining lime leans towards the maximum production rate machining time as the delay time cost increases. It is also shown that the actual processing time is proportional to a machining constant regardless of the objective function utilized when tools with similar characteristics are used. Based upon this finding the mean flowtime can be minimized by processing the parts in ascending order of the machining constant values.     

海洋双光纤光栅压力传感器的温度响应特性

为满足海洋温深剖面连续拖曳测量的要求,测量海水深度的光纤布拉格光栅(FBG)压力传感器是利用FBG温补传感器来解决交叉敏感问题。由于二者对温度响应时间不一致,导致在中尺度旋涡、锋面等温度骤变海域测试海水压力时有所偏差。针对这一现象,设计出了一种新型的双光纤光栅压力传感器,通过在压力传感器的中心和边缘各封装温补和压力光纤光栅(边缘光栅不接触弹性膜片,仅受温度影响),使其对温度响应特性接近一致。实验测试结果表明:传感器的温补和压力光纤光栅对温度响应时间分别是1. 45 s和1. 52 s,响应一致性好。通过海试验证,FBG压力传感器与参考压力传感器ALEC—TD的相关系数高达0. 990 6,基本消除温度响应不一致导致的测量误差,能够达到准确测量压力的目的。     

Interval-valued fuzzy multiple criteria decision-making methods based on dual optimistic/pessimistic estimations in averaging operations

This study aimed to consider the effect of dispositional optimism and pessimism to provide simple and useful decision models and methods for multiple criteria decision analysis within an interval-valued fuzzy environment. Uncertain and imprecise assessment information is usually present in many practical decision-making situations. Interval-valued fuzzy sets are useful for modeling impressions and quantifying the ambiguous nature of subjective judgments in a convenient way. Based on measurement tool estimations defined on interval-valued fuzzy sets, dual optimistic and pessimistic point operators were utilized in this study, and this paper discusses several important properties of optimistic/pessimistic averaging operations. Two algorithmic procedures were developed to address the effects of optimism and pessimism, involving changes in overall judgments and in the separate evaluations of alternatives with respect to each criterion. Furthermore, this study explored the practical problem of medical decision making to demonstrate the feasibility and applicability of the proposed method and to make a comparison with other existing methods. Finally, computational experiments were designed using enormous amounts of simulation data, and a comparative analysis of rank orders yielded by dual optimistic and pessimistic averaging operations was conducted.     

Decision criteria for predicting adherence for psychiatric emergency room patients with referral appointments

This paper describes and evaluates a method of predicting referral appointment-keeping behavior for psychiatric emergency room patients. Studies have shown that referral systems which provide appointments and reminders achieve higher appointment adherence. However, studies have not been conducted of those experiencing a good referral system to predict adherence behavior and indicate further areas for improvement.Discriminant analysis is applied to patient's psychiatric signs and symptoms for selecting variables that predict referral appointment keeping behavior. All patients seen during a 6 week period were selected from a 1,000 bed hospital's Psychiatric Emergency Room. The data were collected during the patient's visit to the psychiatric emergency room and prior to aftercare treatment. The subset of non-psychotic patients requiring outpatient psychiatric care was the focus of this analysis. The model indicates that patient's adherence with referral appointment can be predicted with 76% accuracy using the best three discriminating variables. This prediction per cent increases to 97% with all contributing variables. The non-adherers are identified with 66% and 100% accuracy, respectively. Distressingly, “Suicidal Behavior” and “Potentially Harming Others” relates to non-adherence. If the non-compliant emergency patient, especially those dangerous to themselves and others, can be identified in advance, the care systems can be changed to increase the number of patients following referral recommendations. This reduces both initial treatment cost and avoids cost resulting from more severe illnesses arising for lack of initial treatment.     

Decision support modeling for multiple criteria assessments using a likelihood-based consensus ranking method under Pythagorean fuzzy uncertainty

Artificial Intelligence Review - This paper intends to exploit point operator-oriented likelihood measures to constitute a likelihood-based consensus ranking model aimed at conducting multiple...     

决策表决策规则与知识粒度

在知识发现、数据挖掘等研究领域中,粒度计算有着潜在的应用。针对决策表,探讨了其内在的粒度思想,研究了属性个数增减、属性取值改变对知识粒度变化的影响,并建立了知识粒度与规则确信度之间的动态关系,为决策表进行决策分析提供了科学依据。这些结果将有助于粒度计算和决策理论的研究。     

Retraction Note: Decision response of subway evacuation signs based on brain component features

Neural Computing and Applications -     

A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines,setup times,and dual criteria

This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequence- and machine-dependent setup times are given. The objective is to find a schedule that minimizes a convex sum of makespan and the number of tardy jobs in a static flexible flow shop environment. For this problem, a 0–1 mixed integer program is formulated. The problem is, however, a combinatorial optimization problem which is too difficult to be solved optimally for large problem sizes, and hence heuristics are used to obtain good solutions in a reasonable time. The proposed constructive heuristics for sequencing the jobs start with the generation of the representatives of the operating time for each operation. Then some dispatching rules and flow shop makespan heuristics are developed. To improve the solutions obtained by the constructive algorithms, fast polynomial heuristic improvement algorithms based on shift moves and pairwise interchanges of jobs are applied. In addition, metaheuristics are suggested, namely simulated annealing (SA), tabu search (TS) and genetic algorithms. The basic parameters of each metaheuristic are briefly discussed in this paper. The performance of the heuristics is compared relative to each other on a set of test problems with up to 50 jobs and 20 stages and with an optimal solution for small-size problems. We have found that among the constructive algorithms the insertion-based approach is superior to the others, whereas the proposed SA algorithms are better than TS and genetic algorithms among the iterative metaheuristic algorithms.     

Decision making in context

From a Bayesian decision theoretic framework, we show that the reason why the usual statistical approaches do not take context into account is because of the assumptions made on the joint prior probability function and because of the simplistic loss function chosen. We illustrate how the constraints sometimes employed by artificial intelligence researchers constitute a different kind of assumption on the joint prior probability function. We discuss a couple of loss functions which do take context into account and when combined with the joint prior probability constraint create a decision problem requiring a combinatorial state space search. We also give a theory for how probabilistic relaxation works from a Bayesian point of view.     

Circle criteria in recursive identification

Positive real conditions and differential sector conditions have recently been shown to imply global convergence w.p. 1, for recursive identification schemes based on a class of single-input/single-output linear Wiener models. The models consist of linear dynamics followed by a static output nonlinearity. The model structure is hence closely related to that of the Lure problem in the stability theory of feedback systems. This paper proves that the conditions for convergence can be transformed to graphical circle criteria, depending on the sector conditions and on the Nyquist plot of a transfer function related to the prior knowledge of the poles of the identified system     

基于决策强度的决策表连续属性离散化算法

决策表中连续属性离散化,即将一个连续属性分为若干属性区间并为每个区间确定一个离散型数值。该文提出一种新的决策表连续属性离散化算法。首先使用决策强度来度量条件属性的重要性,并据此对条件属性按照属性重要性从小到大排序,然后按排序后的顺序,考察每个条件属性的所有断点,将冗余的断点去掉,从而将条件属性离散化。该算法易于理解,计算简单,算法的时间复杂性为O(3kn2)。     

Manifold dual contouring

Dual Contouring (DC) is a feature-preserving isosurfacing method that extracts crack-free surfaces from both uniform and adaptive octree grids. We present an extension of DC that further guarantees that the mesh generated is a manifold even under adaptive simplification. Our main contribution is an octree-based topology-preserving vertex-clustering algorithm for adaptive contouring. The contoured surface generated by our method contains only manifold vertices and edges, preserves sharp features, and possesses much better adaptivity than those generated by other isosurfacing methods under topologically safe simplification.     

对决策表和简化决策表的研究

简化决策表具有高效处理数据的能力,一经提出即得到广泛的重视。文中通过反例证明简化决策表在处理数据时会产生错误,改变了原决策表表达信息。通过分析得出简化决策表不具备处理不一致数据的能力,针对简化决策表存在的缺陷对其进行修正,提出新简化决策表的概念和建立算法。新简化决策表具有高效处理数据的能力,同时具备处理不一致数据的能力,并且不需要修改原有以决策表或简化决策表为基础的求核和求约简算法。     

Decision tables

Decision tables have been known for almost 20 years but there are still data processing shops where systems analysts and programmers have not used them at all. That is why it is felt important to re-open their case once again and publicize experience with their use, as well as more recent developments and expected future trends. It appears, from experience gained with decision tables over the past 10 years, that they can be of great help in programming, program maintenance, as well as in design communication between analysts and programmers. To assist also in training, a brief user's guide is included in this article, which is belived to make the first attempts to easier design of a decision table. Finally, the procedure adopted to implement a machine independent (portable) decision-table preprocessor for COBOL is outlined. In as much as the availability of such a preprocessor appears essential for the degree of use of decision tables, this single fact may well become a milestone in the overall popularity of decision tables world-wide.     

对决策表和简化决策表的研究

简化决策表具有高效处理数据的能力,一经提出即得到广泛的重视.文中通过反例证明简化决策表在处理数据时会产生错误,改变了原决策表表达信息.通过分析得出简化决策表不具备处理不一致数据的能力,针对简化决策表存在的缺陷对其进行修正,提出新简化决策表的概念和建立算法.新简化决策表具有高效处理数据的能力,同时具备处理不一致数据的能力,并且不需要修改原有以决策表或简化决策表为基础的求核和求约简算法.     

Polynomial-time dual algorithms in linear programming

New effective iterative algorithms are proposed for linear programming. A theoretical b bound on the running time is derived for the solution of the linear programming problem.Translated from Kibernetika, No. 1, pp. 34–40, January–February, 1989.     

On performance criteria

General orthogonal polynomials are introduced to approximate the solution of a class of non-linear systems. Using the integration-operational matrix, the product-operational matrix and the derived non-linear operational matrix, the dynamical equation of a non-linear system can be reduced to a set of simultaneous non-linear algebraic equations, thus greatly simplifying the solution. The parameter-identification problem for non-linear systems is also dealt with. An approximate solution for a non-linear optimal-control problem with quadratic performance measure is also considered. Three examples are given to demonstrate the validity and applicability of the orthogonal-polynomial approximations.