An approach to generating the sequence of part variant design based on information transfer utility

PurposeProduct variant design can only be achieved after all its constituent parts have been implemented by variant design. It is necessary to plan the sequence of part variant design reasonably. The product variant design process involves a large amount of information transfer events at the dimensional level. A reasonable product variant design process needs to make full use of the information transfer characters of parts to decrease the uncertainty of product variant design process. The existing methods of researching the product variant design process mainly focus on resource constraint and activity logic. They are deficient, however, in information transfer resolution and uncertainty management. This paper aims to address these issues.Design/methodology/approachThis paper identifies the number of dimension transfer paths and the position of dimension locating within a transfer path as being the key factors affecting the information transfer role of dimension. Information transfer utility is proposed to measure the information transfer capability of dimensions and parts. Based on these, a two-stage approach of generating the sequence of part variant design based on information transfer utility is proposed.FindingsThe uncertainty of dimension constraint network is minimal during the product variant design process when parts are implemented by variant design under the sequence generated through a two-stage method based on the information transfer utilities of parts, as does the times of parameter transferring and iteration in dimension constraint network.Originality/valuePart variant design under the sequence of descending information transferring utilities can decrease the difficulty of implementing product variant design validly and also increase the efficiency. This suggests an innovative method to planning the product variant design process reasonably from the perspective of informatics.

Optimal Design for Conventional Wastewater Treatment Systems using a Computing Language MATLAB R2012a

In the present scenario of rapid urbanization, the demand for wastewater treatment is continuously increasing. The majority of research in the field of wastewater treatment plant (WWTP) is focusing on its modeling part. The design of WWTP is developed using professional quality software packages which incorporate the fundamental concepts with the key engineering principles. With the aim to obtain an optimal design, in this study a novel Decision Support System (DSS) is developed for the preliminary units integrating screening chamber, grit chamber and equalization tank with primary sedimentation tank as the primary process and activated sludge process, trickling filter and rotating biological contactor as different types of the secondary units of Wastewater Treatment System using a computing language MATLAB R2012a. DSS is a comprehensive and user-friendly program which could incorporate most of the theoretical and practical constraints. One of the major concerns of DSS is the dimension constraint for the design and operation of WWTP. DSS incorporates miscellaneous mathematical functions and the code to develop a user-desired design. The applicability of the DSS model is illustrated through the various design problems. The design developed will support the future growth and development of the cost optimization models for WWTP.

Constraint As an Ethical Postulate in the Context of Ecological Limits

The problem of natural resources being finite as well as the capability of ecosystems and the biosphere to assimilate the effects of economic activity on the one hand, and growing economic discrepancies on the other raise a question mark over the chase after the unrestrained economic growth. In the search for alternative models of thinking and development a significant role of constraint is being more and more emphasized. In the case of ecological barriers limitation of using non-renewable resources, greenhouse gases emissions, excessive consumption and production seems to be a reasonable strategy that manifests our care for the natural environment.The aim of the paper is to demonstrate that the postulate of constraint present in the de-growth model in the form proposed by Tim Jackson and Serge Latouche apart from a quantitative dimension has, above all, a qualitative and ethically orientated dimension. Constraint conceived in the above way stays close to terms like moderation, restraint, sustainability, i.e. such terms that possess solid ethical foundations and constitute an important base for environmental ethics.

Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem

This paper analyzes a [Formula: see text]-Evolution Strategy, a randomized comparison-based adaptive search algorithm optimizing a linear function with a linear constraint. The algorithm uses resampling to handle the constraint. Two cases are investigated: first, the case where the step-size is constant, and second, the case where the step-size is adapted using cumulative step-size adaptation. We exhibit for each case a Markov chain describing the behavior of the algorithm. Stability of the chain implies, by applying a law of large numbers, either convergence or divergence of the algorithm. Divergence is the desired behavior. In the constant step-size case, we show stability of the Markov chain and prove the divergence of the algorithm. In the cumulative step-size adaptation case, we prove stability of the Markov chain in the simplified case where the cumulation parameter equals 1, and discuss steps to obtain similar results for the full (default) algorithm where the cumulation parameter is smaller than 1. The stability of the Markov chain allows us to deduce geometric divergence or convergence, depending on the dimension, constraint angle, population size, and damping parameter, at a rate that we estimate. Our results complement previous studies where stability was assumed.

Variant Design Method of Assembly Consisting of Different Types of Parts

Variant design has been recognized as an effective measure to implement mass customization. Assembly consists of different types of parts. Its variant design is a profound issue need to be explored. Three aspects were discussed in this paper, namely, 1) part classification and dimension constraint satisfaction priority, 2) part reuse, 3) dimension conflict and variant postponing. Firstly, dimension constraint network among parts was constructed based on graph. And variant dimension transferring was exploited. Secondly, reusable part can be found from existing parts through similarity analysis. Thirdly, aiming at dimension constraint conflicts, variant postponing was proposed to concentrate variant design to few parts so as to reduce the number of variant part.

Dimension Parameter Transfer Method Based on Constraint Satisfaction Priority in Variant Design

In order to accommodate the increasing variety of costumers’ demands, manufacturers tend to produce different models of the same product by introducing variant design concepts that improve the flexibility of design systems. In this paper, an approach based on constraint satisfaction priority is proposed to solve the dimension parameter transferring problem. Firstly, product variant parameters and variant relations are analyzed. Secondly, dimension constraint relation network model is conceived and parameters constraint forms is discussed. Finally, a parameters transfer method based on constraint satisfaction priority is established.

Solving Inverse Kinematics and Driving Forces of a Novel 3RPS-3SPR Serial-Parallel Manipulator

The inverse kinematics and the driving forces of a 3RPS-3SPR serial-parallel manipulator (PM) with 6 degree of freedoms (DOFs) are solved in this paper. This 3RPS-3SPR serial-PM includes a lower 3-RPS PM and an upper 3-SPR PM. First, the inverse displacement is solved based on the geometrical constraint and the dimension constraint of this PM. Second, the 9×9 and 6×6 form inverse Jacobian matrices are derived and the driving forces are solved by using principle of virtual work. Finally, the numerical example is given.