A General Empirical Solution to the Macro Software Sizing and Estimating Problem

Application software development has been an area of organizational effort that has not been amenable to the normal managerial and cost controls. Instances of actual costs of several times the initial budgeted cost, and a time to initial operational capability sometimes twice as long as planned are more often the case than not.     

关于分配问题的新解法

通过研究分配问题的规模和限制问题,本文提出了一种简捷而全新的解求解算法.该算法步骤简单、可操作性强、不受问题规模限制.     

Possibilistic Approaches to Portfolio Selection Problem with General Transaction Costs and a CLPSO Algorithm

The structure of portfolio selection depends essentially on the form of transaction cost. In this paper, we deal with the portfolio selection problems with general transaction costs under the assumption that the returns of assets obey LR-type possibility distributions. For any type of transaction costs, we employ a comprehensive learning particle swarm optimizer algorithm to obtain the optimal portfolio. Furthermore, we offer numerical experiments of different forms of transaction costs to illustrate the effectiveness of the proposed model and approach.     

Outer Interval Solution of the Eigenvalue Problem under General Form Parametric Dependencies

The paper addresses the problem of determining an outer interval solution of the parametric eigenvalue problem A(p)x = λx, A(p) ∈ ℝ^n×n for the general case where the matrix elements a_ij(p) are continuous nonlinear functions of the parameter vector p, p belonging to the interval vector p. A method for computing an interval enclosure of each eigenpair (λ_μ, x^(μ)), μ = 1, ..., n, is suggested for the case where λ_μ is a simple eigenvalue. It is based on the use of an affine interval approximation of a_ij(p) in p and reduces, essentially, to setting up and solving a real system of n or 2n incomplete quadratic equations for each real or complex eigenvalue, respectively.     

Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem

Stochastic approximation methods have been extensively studied in the literature for solving systems of stochastic equations and stochastic optimization problems where function values and first order derivatives are not observable but can be approximated through simulation. In this paper, we investigate stochastic approximation methods for solving stochastic variational inequality problems (SVIP) where the underlying functions are the expected value of stochastic functions. Two types of methods are proposed: stochastic approximation methods based on projections and stochastic approximation methods based on reformulations of SVIP. Global convergence results of the proposed methods are obtained under appropriate conditions.      

二维装箱问题的一种实现方法

遗传算法(GA)是基于自然淘汰地遗传机制的搜索算法，近年来利用遗传算法解决组合优化问题的研究十分普遍。二维装箱问题是典型的组合优化问题，也是时间复杂度非常高的NP问题之一，如何实现有效的算法流程一直是该类问题的难点，本文在BL算法的基础上，提出一种改进的算法结构和流程，并分析了用GA实现过程中编码的健全性和完备性以及多样性评价问题。     

A Solution to the Problem of Updating Encyclopedias

This paper describes a way of creating and maintaining a dynamic encyclopedia, i.e., an encyclopedia whoseentries can be improved and updated on a continual basis withoutrequiring the production of an entire new edition. Such anencyclopedia is therefore responsive to new developments and newresearch. We discuss our implementation of a dynamic encyclopedia andthe problems that we had to solve along the way. We also discuss waysof automating the administration of the encyclopedia.     

计算机机房维护中常见问题及解决方法

对计算机机房日常维护管理中出现的两个常见问题:共享和能上QQ但无法打开网页提出了一些可行性的解决方法,此解决方案对个人用户也有一定的帮助.     

计算机实验室维护常见问题的解决方法

文章从两方面介绍了如何有效地对计算机实验室在使用过程中出现的两个常见问题:共享和能上QQ但无法打开网页进行解决的方法,并提出了一些可行性的建议,对个人用户也有一定的帮助.     

General Solution of Stability Problem for Plane Linear Switched Systems and Differential Inclusions

Characterization and control of stability of switched dynamical systems and differential inclusions have attracted significant attention in the recent past. The most of the current results for this problem are obtained by application of the Lyapunov function method which provides sufficient but frequently over conservative stability conditions. For planar systems, practically verifiable necessary and sufficient conditions are found only for switched systems with two subsystems. This paper provides explicit necessary and sufficient conditions for asymptotic stability of switched systems and differential inclusions with arbitrary number of subsystems; these conditions turned out to be identical for the both classes of systems. A precise upper bound for the number of switching points in a periodic solution, corresponding to the break of stability, is found. It is shown that, for a switched system, the break of stability may also occur on a solution with infinitely fast switching (chattering) between some two subsystems.     

关系模式到XML Schema映射问题的综合解决方案

随着XML逐渐成为互联网上数据表示和交换的标准,将关系数据映射为XML格式已经成为研究的热点,并提出了许多相关的映射算法。然而,现有的算法都仅仅解决了映射中某个方面的问题,针对这种情况,本文提出了一种关系模式到XML Schema映射问题的综合解决方案（Comprehensive Solution CoS）,允许用户按应用特性对映射过程进行配置,映射过程更加灵活。     

面向产品设计的成本工程系统方法与技术的研究

企业的发展需要产品具有较强的市场竞争力,针对复杂技术产品成本的特点和研究现状,建立了产品的全生命周期成本信息模型,提出了支持产品设计的成本工程系统的总体框架,研究了成本工程系统中各子系统：成本建模、成本控制优化、成本分析子系统的关联模型;详细研究了工程系统中的关键技术及其解决的方法,开发了相应的软件,并在以液压挖掘机为实例的研究中得到成功验证。     

A Market-based Solution to the Multiple Traveling Salesmen Problem

This paper describes a market-based solution to the problem of assigning mobile agents to tasks. The problem is formulated as the multiple depots, multiple traveling salesmen problem (MTSP), where agents and tasks operate in a market to achieve near-optimal solutions. We consider both the classical MTSP, in which the sum of all tour lengths is minimized, and the Min-Max MTSP, in which the longest tour is minimized. We compare the market-based solution with direct enumeration in small scenarios, and show that the results are nearly optimal. For the classical MTSP, we compare our results to linear programming, and show that the results are within 1 % of the best cost found by linear programming in more than 90 % of the runs, with a significant reduction in runtime. For the Min-Max case, we compare our method with Carlsson’s algorithm and show an improvement of 5 % to 40 % in cost, albeit at an increase in runtime. Finally, we demonstrate the ability of the market-based solution to deal with changes in the scenario, e.g., agents leaving and entering the market. We show that the market paradigm is ideal for dealing with these changes during runtime, without the need to restart the algorithm, and that the solution reacts to the new scenarios in a quick and near-optimal way.     

Solution of the Robbins Problem

In this article we show that the three equations known as commutativity,associativity, and the Robbins equation are a basis for the variety ofBoolean algebras. The problem was posed by Herbert Robbins in the 1930s. Theproof was found automatically by EQP, a theorem-proving program forequational logic. We present the proof and the search strategies thatenabled the program to find the proof.     

Convergence of the IRWLS Procedure to the Support Vector Machine Solution

An iterative reweighted least squares (IRWLS) procedure recently proposed is shown to converge to the support vector machine solution. The convergence to a stationary point is ensured by modifying the original IRWLS procedure.     

A Non-heuristic Approach to the General Two Water Jugs Problem

The two water jugs problem is a famous problem in recreational mathematics, problem-solving, artificial intelligence, neuroscience, computer programming and cognitive psychology. The methods of solutions are usually based on heuristics or search methods such as BFS （breadth first search） or DFS （depth first search）, which could be time and memory consuming. In this paper, we present a non-heuristic approach to solve this problem, which can be modeled by the Diophantine equation mx＋ ny - d, where m, n denote the capacities of the jugs and d denotes the amount of water to be determined, with 0 〈 m 〈 n and 0 〈 d 〈 n. By simple additions and subtractions only, the special solutions （x, y） can be found very easily by using the non-Heuristic approach, which correspond to the number of times of the water jugs being fully filled in the whole water pouring process. Also, a simple formula for determining an upper bound on the total number of pouring steps involved is derived, namely 2（m ＋ n - 2）, based on the method of linear congruence. Due to its simplicity and novelty, this approach is suitable for either hand calculation or computer programming. Some illustrative examples are provided.     

Two Approaches to Modeling and Solving the Packing Problem for Convex Polytopes

We consider the problem of packing convex polytopes in a cuboid of minimum volume. To describe analytically the non-overlapping constraints for convex polytopes that allow continuous translations and rotations, we use phi-functions and quasi-phi-functions. We provide an exact mathematical model in the form of an NLP-problem and analyze its characteristics. Based on the general solution strategy, we propose two approaches that take into account peculiarities of phi-functions and quasi-phi-functions. Computational results to compare the efficiency of our approaches are given with respect to both the value of the objective function and runtime.