Solving public passenger transportation problems: a need for policy reorientation. Final report. Volume II.

Transportation Department, Office of University Research, Washington, D.C.

Year's progress in solving some farm problems of Illinois.

Report year ends June 30.

The examination of drill cuttings and the application of the results obtained to the solving of field problems /

Mode of access: Internet.

Solving public transportation problems : a need for policy reorientation /

Mode of access: Internet.

A self-help method for solving fire problems /

Issued Oct. 1979.

Solving social security's computer problems : comprehensive corrective action plan and better management needed : report to the Chairman, Committee on Government Operations, House of Representatives /

"B-201668"--Prelim. p.

The office supervisor's manual, solving the everyday problems of an office supervisor.

Mode of access: Internet.

Successive approximation methods for solving optimality problems. USSR.

Translation of 2 articles from the Russian journal.

The role of a state vocational rehabilitation agency in solving problems in a depressed area; project 790.

Cover title: Depressed areas study.

Systemological Knowledge-based Technology for Solving Complete Ill-structured Problems

Original method and technology of systemological «Unit-Function-Object» analysis for solving complete ill-structured problems is proposed. The given visual grapho-analytical UFO technology for the fist time combines capabilities and advantages of the system and object approaches and can be used for business reengineering and for information systems design. UFO- technology procedures are formalized by pattern-theory methods and developed by embedding systemological conceptual classification models into the system-object analysis and software tools. Technology is based on natural classification and helps to investigate deep semantic regularities of subject domain and to take proper account of system-classes essential properties the most objectively. Systemological knowledge models are based on method which for the first time synthesizes system and classification analysis. It allows creating CASE-toolkit of a new generation for organizational modelling for companies’ sustainable development and competitive advantages providing.

Randomized Parallelization – a New Method for Solving Hard Combinatorial Problems

A new method for solving some hard combinatorial optimization problems is suggested, admitting a certain reformulation. Considering such a problem, several different similar problems are prepared which have the same set of solutions. They are solved on computer in parallel until one of them will be solved, and that solution is accepted. Notwithstanding the evident overhead, the whole run-time could be significantly reduced due to dispersion of velocities of combinatorial search in regarded cases. The efficiency of this approach is investigated on the concrete problem of finding short solutions of non-deterministic system of linear logical equations.

On the Mastering of Knowledge and Skills for Solving Mathematical Problems in the Context of the Relationship "Reflection–Synergy"

On the basis of topical investigations on the reflection in the mathematics education, in this article there are presented some contemporary ideas about refining the methodology of mastering knowledge and skills for solving mathematical problems. The thesis is developed that for the general logical and for some particular mathematical methods to become means of solving mathematical problems, first they need to be a purpose of the education.

A Method for Solving a Class of Multiple-Criteria Analysis Problems

AMS subject classification: 90C29.

A method for solving LSM problems of small size in the AHP

The Analytic Hierarchy Process (AHP) is one of the most popular methods used in Multi-Attribute Decision Making. It provides with ratio-scale measurements of the prioirities of elements on the various leveles of a hierarchy. These priorities are obtained through the pairwise comparisons of elements on one level with reference to each element on the immediate higher level. The Eigenvector Method (EM) and some distance minimizing methods such as the Least Squares Method (LSM), Logarithmic Least Squares Method (LLSM), Weighted Least Squares Method (WLSM) and Chi Squares Method (X2M) are of the tools for computing the priorities of the alternatives. This paper studies a method for generating all the solutions of the LSM problems for 3 × 3 matrices. We observe non-uniqueness and rank reversals by presenting numerical results.