可拓市场的类型与实现方式研究

根据可拓市场的概念，探讨了在不同可拓变换下可拓市场的类型及实现可拓市场的方式。这些研究为企业开拓市场提供了有效的形式化方法。     

可拓学——研究“矛盾转化，开拓创新”的新学科

可拓学是以蔡文研究员为首的我国学者们创立的 ,研究事物的可拓性与开拓规律 ,探索矛盾转化、开拓创新方法和技术的新学科。经过可拓学研究者们多年的艰苦创业、共同奋斗 ,可拓学已初具规模 ,包括可拓论、可拓方法、可拓工程等。在理论和方法上都取得了创新性、突破性的研究成果 ,在实际应用中 ,具有多领域、多类型的成功事例。可拓学及其应用已引起国内外学术界的广泛关注 ,具有一定的影响。可拓论　可拓学的理论基础是物元理论、可拓集合理论和事元理论 ,统称为可拓论。物元理论　提出了描述事物基本元的物元概念与性质、定性与定量相结合…     

挖掘变化知识的可拓数据挖掘研究

规范了可拓信息与可拓知识基本概念，即在信息和知识的概念上扩充了变化的信息和变化的知识。明确了可拓数据挖掘概念以及可拓推理新概念。证明了可拓数据挖掘两个定理和可拓推理公式。提出的从挖掘静态知识的数据挖掘扩展到挖掘变化知识的可拓数据挖掘，为数据挖掘开辟了新的研究方向，并通过实例进行了说明     

可拓策划研究

可拓策划是从处理矛盾问题的角度，应用可拓学的方法而进行的策划。文章简介了可拓策划的基本思想、理论和方法，试图用形式化的方法告诉人们，在遇到矛盾问题时，如何生成策划创意，如何进行全面的资源分析、寻找可拓资源，以化不相容为相容，化对立为共存。在可拓策划的实务操作部分，介绍了资源整合的可拓策划、项目的可拓策划、市场开拓的可拓策划及危机防范与处理的可拓策划。     

可拓学基础理论研究的新进展

简要介绍近年可拓学研究在基础理论方面的新进展，包括可拓学的框架、基元理论、可拓集合理论和可拓逻辑等所取得的成果。     

评价企业营销力的一个新方法

市场的可拓性关系着企业市场营销工作的效率和效果，可拓营销力是企业在市场竞争过程中通过营销活动形成的获得消费者认同的能力。这种认同可能会直接带来销售额、利润，也有可能只是使消费者产生了对企业或者产品、品牌的兴趣，但是一定会为未来的企业销售活动打好良好的商誉基础。企业可拓营销力在企业发展中具有重要作用，文章基于企业营销活动的市场影响力讨论了企业可拓营销力指数，并为其科学评价提供了一个新的方法     

可拓检测技术

检测技术是目前多种学科的关键技术,检测中有两个难题：一个是无法检测的问题,另一个是检测精度提高的问题。基于可拓学矛盾转化的思想方法,提出了一种与传统检测技术不同的新技术--可拓检测,这种检测技术利用可拓学的物元概念及相关方法,从矛盾转化去研究检测技术,以解决无法检测的物理量检测问题。文章给出了可拓检测的有关概念,基本原理及结构,并且提出了有关的实施方法和应用实例。     

可拓学在数据挖掘中的应用初探

可拓学在数据挖掘中的应用是多方面的,其特点是挖掘"不行变行" 的规律.可拓方法丰富了数据挖掘的内容,为多值型关联规则的建立提供了新的工具.提出的可拓数据挖掘模式,有利于利用现存数据更好地为决策服务.     

可拓知识库系统及其应用

知识库系统是一种专门存储、管理大量知识的机构。文章以可拓学的理论和方法为指导,提出可拓知识表示法和可拓知识库系统的特点与构架。给出了可拓知识表示的形式化语义,其基本单元是知识物元;阐述了矛盾问题求解的形式表示,其核心是问题的物元模型,通过可拓算子把不相容问题转化为相容问题;相关方式推理是可拓知识库系统推理机的特点,是传统规则推理的推广。可拓知识库采用可拓知识表示方法,是传统知识库的一个超集;可拓知识库系统由目标库、条件库、公用知识库、分类知识库、推理机与知识库管理系统组成。     

企业重组中资源矛盾的可拓分析

基于企业重组的目的，以可拓学的理论与方法为基础，利用资源的共扼分析方法和可拓分析方法给出重组企业中资源状况及其资源矛盾问题的分析方法，为企业的成功重组提供理论依据。     

供应链中生产和运输协调调度问题初探

提出了解决供应链中生产和航空运输协调调度问题的理论框架.基于对生产调度和航空运输调度彼此制约关系的分析,协调调度问题被分解为两个子调度问题.建立了航空运输子调度问题的整数规划模型,并证明了该问题为NP完全问题.提出了基于倒排调度方法(backward scheduling method)的调度算法解单机生产调度子问题.     

基于TRIZ理论的套袋机套袋装置优化设计

目的解决现有套袋机套袋装置在套袋过程中薄膜内袋容易产生折角的问题。方法利用TRZI理论中功能模型及因果链分析对初始问题进行全面分析,找到根本问题后,再将根本问题转化为TRIZ问题模型,然后利用TRIZ中解决问题的工具找到多个解决方案模型,并对方案模型进行可用性评估。结果将评估所得的最优方案进行实施,薄膜内袋折角的问题被解决,双层袋合格率达到99.5%。结论利用TRIZ理论中的一系列工具对薄膜内袋折角问题进行转化,建立了解决方案模型,选取了最优方案进行实施,成功解决了薄膜内袋折角问题。     

Direct method of solution for general boundary value problem of the Laplace equation

A general boundary value problem for two-dimensional Laplace equation in the domain enclosed by a piecewise smooth curve is considered. The Dirichlet and the Neumann data are prescribed on respective parts of the boundary, while there is the second part of the boundary on which no boundary data are given. There is the third part of the boundary on which the Robin condition is prescribed. This problem of finding unknown values along the whole boundary is ill posed. In this sense we call our problem an inverse boundary value problem. In order for a solution to be identified the inverse problem is reformulated in terms of a variational problem, which is then recast into primary and adjoint boundary value problems of the Laplace equation in its conventional form. A direct method for numerical solution of the inverse boundary value problem using the boundary element method is presented. This method proposes a non-iterative and unified treatment of conventional boundary value problem, the Cauchy problem, and under- or over-determined problems.     

A review of one aspect of the thermal-explosion theory

The historical development of the thermal-explosion theory is examined and reviewed, It is shown that the original formulation of the problem by Semenov accurately defines the phenomenon and explains the reason for the explosion. He showed that, when the heat generation within the solid exceeds the heat dissipation to the surroundings, explosion occurs. Frank-Kamenetskii’s disapproval of Semenov’s logic theorized that the difference between the temperatures at the center of the solid and its surface is the cause of the explosion. His famous and ingenious small-temperature model and the solution to the differential equation that resulted from that distorted the problem and delayed the progress to a full understanding of the problem. He concluded that explosion occurs when no solution to the problem exists. The exact solution to the problem by Shouman, Donaldson and Tsao reaffirmed the validity of the Semenov formulation. Further examination of the effect of reactant consumption on the problem produced full understanding of the physics of the problem.     

The discrete method of separation of variables for composite material problems

In this paper, we propose the discrete method of separation of variables for the numerical solutions of the composite material problems on a polygon. After a suitable transformation of coordinates, the original boundary value problem is reduced to a discontinuous coefficients problem on a semi-infinite strip. Then we get the semi-discrete approximation of the discontinuous coefficients problem which is equivalent to a boundary value problem of a system of ordinary differential equations (O.D.E's) with constant coefficients. After solving the boundary value problem of the system by a direct method, then the semi-discrete approximation of the original problem is obtained. Especially we can see that the semi-discrete approximation in form of separable variables naturally possesses the singularity of the original problem. Finally, the numerical examples show that our method is feasible and very effective for solving composite material problems numerically.     

球约束凸二次规划的一个算法

针对球约束凸二次规划问题，利用Lagrange对偶将其转化为无约束优化问题，然后运用单纯形法对其求解，获得原问题的最优解。最后，对文中给出的算法给出了论证。     

Role of similarity measures in PCB grouping procedures

The problem of grouping printed circuit boards (PCBs) for simultaneous assembly on electronic assembly machines is an extension of the set-covering problem. A general approach based on cluster analysis and measure of similarity between PCBs is suggested as a basis of PCB grouping. The approach is independent of the specific similarity measure used. We show that, due to the analogy between this problem and the problem of machine cell formation in group technology, similarity measures developed for the second problem are useful as building blocks in a general framework that solves the PCB grouping problem.     

Conceptual design optimization of rectilinear building frames: A knapsack problem approach

This article presents an automated technique for preliminary layout (conceptual design) optimization of rectilinear, orthogonal building frames in which the shape of the building plan, the number of bays and the size of unsupported spans are variables. It adopts the knapsack problem as the applied combinatorial optimization problem, and describes how the conceptual design optimization problem can be generally modelled as the unbounded multi-constraint multiple knapsack problem. It discusses some special cases, which can be modelled more efficiently as the single knapsack problem, the multiple-choice knapsack problem or the multiple knapsack problem. A knapsack contains sub-rectangles that define the floor plan and the location of columns. Particular conditions or preferences for the conceptual design can be incorporated as constraints on the knapsacks and/or sub-rectangles. A bi-objective knapsack problem is defined with the aim of obtaining a conceptual design having minimum cost and maximum plan regularity (minimum structural eccentricity). A multi-objective ant colony algorithm is formulated to solve the combinatorial optimization problem. A numerical example is included to demonstrate the application of the present method and the robustness of the algorithm.     

An improved approach for determination of index positions on CNC magazines with cutting tool duplications by integrating shortest path algorithm

Optimisation of automatic tool changer (ATC) indexing problem, where cutting tools are allocated to the stations on a turret magazine of a CNC machine, is one of the challenging problems in machining. The aim of the problem is to minimise the total indexing time of ATC. This problem becomes even more challenging if duplication of cutting tools is allowed and a bidirectional ATC is used. The problem has a unique feature which has not been stressed yet by other researchers, that is, although ATC indexing (master problem) is the main optimisation problem, objective function evaluation of this problem is a standalone optimisation problem (sub problem) indeed. Although an approximation algorithm does not guarantee optimality for the master problem, the subproblem must be solved optimally; otherwise, deficiencies arising from ill-defined objective function might be encountered. Considering this interesting future, a novel methodology, which employs a shortest path algorithm, is developed. Thus, the subproblem of this complicated problem can be optimally solved. Moreover, two metaheuristics, based on threshold accepting and descent first improvement greedy methodologies, are proposed for generating efficient solutions. Finally, several benchmarking instances are generated and solved to test the proposed algorithms.     

Application of dynamic programming to the general inverse problem

The general inverse problem is one for which measurements are made on some of the state variables and it is desired to find the forcing functions. This problem is a natural one for the method of dynamic programming. The formulation and solution of the problem are presented in matrix form, together with two illustrative examples of an inverse heat conduction problem and an inverse structural dynamics problem.