Search results

The purposes of this research are to study the theory and method of multi-attribute index system design and establish a set of systematic, standardized, scientific index systems for the design optimization and inspection process. The research may form the basis for a rational, comprehensive evaluation and provide the most effective way of improving the quality of management decision-making. It is of practical significance to improve the rationality and reliability of the index system and provide standardized, scientific reference standards and theoretical guidance for the design and construction of the index system.

Using modern methods such as complex networks and machine learning, a system for the quality diagnosis of index data and the classification and stratification of index systems is designed. This guarantees the quality of the index data, realizes the scientific classification and stratification of the index system, reduces the subjectivity and randomness of the design of the index system, enhances its objectivity and rationality and lays a solid foundation for the optimal design of the index system.

Based on the ideas of statistics, system theory, machine learning and data mining, the focus in the present research is on “data quality diagnosis” and “index classification and stratification” and clarifying the classification standards and data quality characteristics of index data; a data-quality diagnosis system of “data review – data cleaning – data conversion – data inspection” is established. Using a decision tree, explanatory structural model, cluster analysis, K-means clustering and other methods, classification and hierarchical method system of indicators is designed to reduce the redundancy of indicator data and improve the quality of the data used. Finally, the scientific and standardized classification and hierarchical design of the index system can be realized.

The innovative contributions and research value of the paper are reflected in three aspects. First, a method system for index data quality diagnosis is designed, and multi-source data fusion technology is adopted to ensure the quality of multi-source, heterogeneous and mixed-frequency data of the index system. The second is to design a systematic quality-inspection process for missing data based on the systematic thinking of the whole and the individual. Aiming at the accuracy, reliability, and feasibility of the patched data, a quality-inspection method of patched data based on inversion thought and a unified representation method of data fusion based on a tensor model are proposed. The third is to use the modern method of unsupervised learning to classify and stratify the index system, which reduces the subjectivity and randomness of the design of the index system and enhances its objectivity and rationality.

This research studies a location-allocation problem considering the m/m/m/k queue model in the blood supply chain network. This supply chain includes three levels of suppliers or donors, main blood centers (laboratories for separation, storage and distribution centers) and demand centers (hospitals and private clinics). Moreover, the proposed model is a multi-objective model including minimizing the total cost of the blood supply chain (the cost of unmet demand and inventory spoilage, the cost of transport between collection centers and the main centers of blood), minimizing the waiting time of donors in blood donating mobile centers, and minimizing the establishment of mobile centers in potential places.

Since the problem is multi-objective and NP-Hard, the heuristic algorithm NSGA-II is proposed for Pareto solutions and then the estimation of the parameters of the algorithm is described using the design of experiments. According to the review of the previous research, there are a few pieces of research in the blood supply chain in the field of design queue models and there were few works that tried to use these concepts for designing the blood supply chain networks. Also, in former research, the uncertainty in the number of donors, and also the importance of blood donors has not been considered.

A novel mathematical model guided by the theory of linear programming has been proposed that can help health-care administrators in optimizing the blood supply chain networks.

By building upon solid literature and theory, the current study proposes a novel model for improving the supply chain of blood.

We propose in this paper a novel reliable detection method to recognize forged inpainting images. Detecting potential forgeries and authenticating the content of digital images is extremely challenging and important for many applications. The proposed approach involves developing new probabilistic support vector machines (SVMs) kernels from a flexible generative statistical model named “bounded generalized Gaussian mixture model”. The developed learning framework has the advantage to combine properly the benefits of both discriminative and generative models and to include prior knowledge about the nature of data. It can effectively recognize if an image is a tampered one and also to identify both forged and authentic images. The obtained results confirmed that the developed framework has good performance under numerous inpainted images.

Fast iterative algorithms for designing birefringent filters with any specified spectral response are proposed. From the Jones formalism, we derive two polynomials representing the transmitted and rejected response of the filter, respectively. Once the coefficients of the filters are obtained, the orientation angle of each birefringent section and the phase shift introduced by each compensator can be determined by an iterative algorithm that gives an efficient solution to the birefringent filter design problem. Afterward, some design examples are presented to demonstrate the effectiveness of the proposed approach. In comparison with results reported in the literature, this approach provides the best performance in terms of accuracy and time complexity.

This paper aims to present an iterative path-following method with joint limits to solve the problem of large computation cost, movement exceeding joint limits and poor path-following accuracy for the path planning of hyper-redundant snake-like manipulator.

When a desired path is given, new configuration of the snake-like manipulator is obtained through a geometrical approach, then the joints are repositioned through iterations until all the rotation angles satisfy the imposed joint limits. Finally, a new arrangement is obtained through the analytic solution of the inverse kinematics of hyper-redundant manipulator. Finally, simulations and experiments are carried out to analyze the performance of the proposed path-following method.

Simulation results show that the average computation time is 0.1 ms per step for a hyper-redundant manipulator with 12 degrees of freedom, and the deviation in tip position can be kept below 0.02 mm. Experiments show that all the rotation angles are within joint limits.

Currently , the manipulator is working in open-loop, the elasticity of the driving cable will cause positioning error. In future, close-loop control based on real-time attitude detection will be used in in combination with the path-following method to achieve high-precision trajectory tracking.

Through a series of iterative processes, the proposed method can make the manipulator approach the desired path as much as possible within the joint constraints with high precision and less computation time.

Our purpose of this study is to construct an algorithm for finding a zero of the sum of two maximally monotone mappings in Hilbert spaces and discus its convergence. The assumption that one of the mappings is α-inverse strongly monotone is dispensed with. In addition, we give some applications to the minimization problem. Our method of proof is of independent interest. Finally, a numerical example which supports our main result is presented. Our theorems improve and unify most of the results that have been proved for this important class of nonlinear mappings.

The focus of this paper is in Q-Lasso introduced in Alghamdi et al. (2013) which extended the Lasso by Tibshirani (1996). The closed convex subset Q belonging in a Euclidean m-space, for m∈IN, is the set of errors when linear measurements are taken to recover a signal/image via the Lasso. Based on a recent work by Wang (2013), we are interested in two new penalty methods for Q-Lasso relying on two types of difference of convex functions (DC for short) programming where the DC objective functions are the difference of l1 and lσq norms and the difference of l1 and lr norms with r>1. By means of a generalized q-term shrinkage operator upon the special structure of lσq norm, we design a proximal gradient algorithm for handling the DC l1−lσq model. Then, based on the majorization scheme, we develop a majorized penalty algorithm for the DC l1−lr model. The convergence results of our new algorithms are presented as well. We would like to emphasize that extensive simulation results in the case Q={b} show that these two new algorithms offer improved signal recovery performance and require reduced computational effort relative to state-of-the-art l1 and lp (p∈(0,1)) models, see Wang (2013). We also devise two DC Algorithms on the spirit of a paper where exact DC representation of the cardinality constraint is investigated and which also used the largest-q norm of lσq and presented numerical results that show the efficiency of our DC Algorithm in comparison with other methods using other penalty terms in the context of quadratic programing, see Jun-ya et al. (2017).

Ant Colony Optimization and Particle Swarm Optimization represent two widely used Swarm Intelligence (SI) optimization techniques. Information processing using Multiple-Valued Logic (MVL) is carried out using more than two discrete logic levels. In this paper, we compare two the SI-based algorithms in synthesizing MVL functions. A benchmark consisting of 50,000 randomly generated 2-variable 4-valued functions is used for assessing the performance of the algorithms using the benchmark. Simulation results show that the PSO outperforms the ACO technique in terms of the average number of product terms (PTs) needed. We also compare the results obtained using both ACO-MVL and PSO-MVL with those obtained using Espresso-MV logic minimizer. It is shown that on average, both of the SI-based techniques produced better results compared to those produced by Espresso-MV. We show that the SI-based techniques outperform the conventional direct-cover (DC) techniques in terms of the average number of product terms required.

The purpose of the work is to provide a comprehensive review of the digital image correlation (DIC) technique for those who are interested in performing the DIC technique in the area of manufacturing.

No methodology was used because the paper is a review article.

no fundings.

Herein, the historical development, main strengths and measurement setup of DIC are introduced. Subsequently, the basic principles of the DIC technique are outlined in detail. The analysis of measurement accuracy associated with experimental factors and correlation algorithms is discussed and some useful recommendations for reducing measurement errors are also offered. Then, the utilization of DIC in different manufacturing fields (e.g. cutting, welding, forming and additive manufacturing) is summarized. Finally, the current challenges and prospects of DIC in intelligent manufacturing are discussed.

The authors propose a dairy bundle, integrating strategies to jointly maximise producer revenue and consumer utility according to the latter's preferences.

An algorithm based on a nested logit model identifies the bundle maximising producer revenue based on factors affecting consumer purchase behaviour. The data are drawn from a mall-intercept survey administered in Iran, with consumers stating a hypothetical choice among a comprehensive set of dairy products.

Demographic characteristics and marketing mix elements significantly affect consumers' preferences. An algorithm based on the estimated dissimilarity parameter determines the best bundle of dairy products, simultaneously obtaining the highest utility and the highest expected revenue.

Consumer preference and maximum producer or retail seller income are considered simultaneously. The bundling promotion strategy is widely used for food offerings and fresh foods and can be extended to other products.

我們擬根據消費者偏好，提出一個整合了多個策略的捆綁包，以使生產製作者得到最高的收入和最佳的消費者效用。

研究人員根據巢式Logit 模型的演算法確認了一個捆綁包，以使生產製作者能得到最高的收入，而這均建基於會影響消費者購買行為的各個因素。有關的數據取自於伊朗的商場內進行的攔截調查，而回應的消費者須假想他們從一整套乳製品中選擇他們會購買的產品。

研究結果顯示，人口特徵和市場營銷組合元素均會顯著地影響消費者的偏好，一個基於估算的相異性參數而建立的演算法可確認最佳的乳製品捆綁包，這演算法同時也可取得最佳的裨益和最高的預期收入。

於本研究中，研究人員同時考慮消費者的偏好和生產製作者或零售賣家的最高收入。捆綁式的促銷策略在食物供品和新鮮食品方面被廣泛使用，這策略可擴展至其他產品。

乳製品捆綁包、消費者偏好、最佳化演算法、巢式Logit 模型.