Preliminary Study on Program Setting Path of Park City Street Scene Construction

In the context of park city construction,urban street space system and scene construction are the most important forms of presentation of value transformation framework.Most of the outdoor activities of urban residents are completed in the urban street space which constitutes various scenes.Scene construction not only includes the material space as the carrier,but also includes the behaviors and activities of the participants and the time and path of “program setting”,as well as the opening and closing of events.Scene construction is an effective approach explored during the construction of the park city demonstration area,which is currently practicing the new development concept.However,there have been no reports on the specific theories,methods,processes,and systems of scene construction,especially for the lack of pattern summary and method induction for program setting in scene construction.Therefore,from the perspective of building a park city demonstration area that implements the new development concept,the paper discusses the concept,connotation,process and modularity of the program setting of street space scene construction,in order to provide certain theoretical basis for the scene construction and “value transformation” of park city street space system.

Set Programming Method and Performance Improvement of Phase Change Random Access Memory Arrays

A novel slow-down set waveform is proposed to improve the set performance and a 1 kb phase change random access memory chip fabricated with a 13nm CMOS technology is implemented to investigate the set performance by different set programming strategies based on this new set pulse. The amplitude difference （I1 - I2） of the set pulse is proved to be a crucial parameter for set programming. We observe and analyze the cell characteristics with different I1 - I2 by means of thermal simulations and high-resolution transmission electron microscopy, which reveal that an incomplete set programming will occur when the proposed slow-down pulse is set with an improperly high I1 - I2. This will lead to an amorphous residue in the active region. We also discuss the programming method to avoid the set performance degradations.

A KIND OF FUZZY LINEAR PROGRAMMING PROBLEMS BASED ON INTERVAL-VALUED FUZZY SETS

The objective of this paper is to deal with a kind of fuzzy linear programming problem based on interval\|valued fuzzy sets (IVFLP) through the medium of procedure that turns IVFLP into parametric linear programming via the mathematical programming.Some useful results for the benefit of solving IVFLP are expounded and proved,developed and discussed.Furthermore,that the proposed techniques in this paper allow the decision\|maker to assign a different degree of importance can provide a useful way to efficiently help the decision\|maker make their decisions.

Fuzzy linear model for production optimization of mining systems with multiple entities

Planning and production optimization within multiple mines or several work sites （entities） mining systems by using fuzzy linear programming （LP） was studied. LP is the most commonly used operations research methods in mining engineering. After the introductory review of properties and limitations of applying LP, short reviews of the general settings of deterministic and fuzzy LP models are presented. With the purpose of comparative analysis, the application of both LP models is presented using the example of the Bauxite Basin Niksic with five mines. After the assessment, LP is an efficient mathematical modeling tool in production planning and solving many other single-criteria optimization problems of mining engineering. After the comparison of advantages and deficiencies of both deterministic and fuzzy LP models, the conclusion presents benefits of the fuzzy LP model but is also stating that seeking the optimal plan of production means to accomplish the overall analysis that will encompass the LP model approaches.

TWO FEEDBACK PROBLEMS FOR GRAPHS WITH BOUNDED TREE-WIDTH

Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.In this paper,it is discussed how to solve the minimum feedback vertex set problem and the minimum vertex feedback edge set problem efficiently by using dynamic programming on a tree-decomposition.

Parameter Ecology for Feedback Vertex Set

This paper deals with the FEEDBACK VERTEX SET problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance,the problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of FEEDBACK VERTEX SET for a wide range of parameters.We survey known results and present several new complexity classifications. For example, we prove that FEEDBACK VERTEX SET is fixed-parameter tractable parameterized by the vertex-deletion distance to a chordal graph. We also prove that the problem admits a polynomial kernel when parameterized by the vertex-deletion distance to a pseudo forest, a graph in which every connected component has at most one cycle. In contrast, we prove that a slightly smaller parameterization does not allow for a polynomial kernel unless NP coNP=poly and the polynomial-time hierarchy collapses.