Applied Mechanics and Materials Vols. 587-589

Abstract: Building quality indemnificatory houses is an important issue to improve people's livelihood, is an important guarantee for promoting social harmony and stability. In order to adapt to the new situation, making indemnificatory houses becoming more humanized design, scientification and efficiency. Better optimizing the design by BIM (Building Information Modeling) technology, controlling construction costs, improving the efficiency of building maintenance, this move conforms to ecological architecture policy, the development strategy of energy conservation, which advocated by the government. In this study we plan to research the whole building life cycle with BIM technology. We will analysis the supply and demand data collected from housing applicants, optimize the site planning and house graphic design, till draw the construction plans. We will make full use of BIM technology advanced functions, such as collaborative production network, building performance analysis, collision detection and visualization equipment interior configuration options .we look forward to establish a new model for indemnificatory houses design, and provide a more suitable living space for housing applicants, optimize spatial pattern of urban and rural, optimize management pattern, improve the city's overall carrying capacity.

Abstract: To intend to improve the optimization performance of harmony search (HS) algorithm, an improved global harmony search (IGHS) algorithm was presented in this paper. In this algorithm, inspired by swarm intelligence, the global best harmony are borrowed to enhance the optimization accuracy of HS; and mutation and crossover operation instead of pitch adjustment operation to improved the algorithm convergence rate. The key parameters are adjusted to balance the local and global search. Several benchmark experiment simulations, the IGHS has demonstrated stronger convergence and stability than original harmony search (HS) algorithm and its other three improved algorithms (IHS, GHS and SGHS) that reported in recent literature.

Abstract: A novel decision method for solving the two-sided matching problem is proposed in this paper, in which the preferences provided by agents are in the format of ordinal numbers and the preference provided by intermediary is in the format of costs. The concept of two-sided matching is firstly introduced, and the two-sided matching problem with ordinal numbers and costs is discribed. Then the related concepts on costs are given. Considering the ordinal number of each agent and the cost of intermediary, a multi-objective optimization model is set up. The method of weighted sums based on membership function is used to convert the multi-objective optimization model into a single-objective model. By solving the model, the matching alternative can be obtained.

Abstract: In this paper, we discuss a class of linear integral equation with piecewise continuous function. Firstly, we change the integral equation to a differential equation with the initial condition. Secondly, the differential equation is solved by the constant variation formula and integration by parts. Explicit solution of the integral equation is given clearly.

Abstract: In this paper, a sufficient and necessary condition for judging block strictly -diagonally dominant matrices is given firstly. According to the given condition, a new practical criteria for block H-matrices is obtained.

Abstract: A key component of DD (domain decomposition) solvers for $hp$ discretizations of elliptic equations is the solver for the internal stiffness matrices of $p$-elements. We consider the algorithm of the linear complexity for solving such problems on spectral $p$-elements, which, therefore, in the leading DD solver plays the role of the second stage DD solver. It is based on the first order finite element preconditioning of the Orszag type for the reference element stiffness matrices. Earlier, for spectral elements, only fast solvers obtained with the use of special preconditioners in factored form were known. The most intricate part of the algorithm is the inter-subdomain Schur complement preconditioning by inexact iterative solver employing two preconditioners -- preconditioner-solver and preconditioner-multiplicator. From general point of view, the solver developed in the paper, is the DD solver for the discretization on a strongly variable in size and shape deteriorating mesh with the number of subdomains growing with the growth of the number of degrees of freedom.

Abstract: Standard is the root of the measurement, But a complete set of measurement specifications has not appeared in the applications of non-contact measuring technology at present.This article talks about the study of the two fitting methods of the Polyworks software, and puts forward when the Polyworks software deals with the circle, slot etc. features,we should choose the fitting method of minimal, and verifys the feasibility of the method through the relevant experiments.

Abstract: In this paper, we employ iterative analysis method to obtain both the existence and the stability of first order functional differential equations with impulses for periodic boundary value problem. Some new results are obtained.

Abstract: This paper proposes a new wireless sensor routing algorithm by combining the ant colony algorithm with the mobile agent technology. This algorithm considers the distance and path energy overhead among nodes and residual node energy, equalizes the energy overhead in the network, improves the update rule of the ant colony information elements and speeds up convergence of the ant colony algorithm to get the optimal values. The simulation results indicate that this algorithm can improve the globalization and convergence speed, effectively reduce redundant data transmission and communication overhead, extend the network lifecycle and be very suitable for a large-scale wireless sensor network compared to other mobile agent routing algorithms.

Abstract: Cloud computing is based on cloud storage. Cloud storage through a variety of technical storage device abstraction into virtual storage resource pool. Compared with the traditional way of storage, it has the scalability and high performance, low cost and other advantages. Different cloud storage systems have different technical architecture and characteristics. From the perspective of metadata if there is a center node, with and without the typical cloud storage system to do a simple introduction and mainly for open source without Gluster center system are analyzed in focus.