Search results

The purpose of the study is to observe the feasibility of missing middle housing’s (MMH) realization under density-based zoning, form-based zoning and a combination of both while simultaneously providing affordable housing, improving quality of life and making efficient use of land.

This study takes a theorist approach and designs three hypothetical cottage court projects that comply with all relevant official local zoning ordinances to showcase design feasibility, followed by an analytical component in the form of a financial model constructed using official local economic and demographic conditions.

MMH, and in particular cottage clusters, can be implemented under rigorous density-based, form-based and hybrid (density-based + form-based) zoning ordinances and provide affordable housing (Atlanta, GA), improve quality of life (Blackpool, UK) and make efficient use of land (Jinan, China). All hypothetical projects are financially feasible under reasonable conditions.

To the best of the author’s knowledge, this paper is the first in the body of knowledge to discuss how the MMH can be integrated into urban density-based zoning rather than converting density-based zoning into form-based so that the MMH can fit. The paper also takes a cross-national perspective and discusses the feasibility of MMH in the resolution of housing issues in the USA, China and the UK. The study also concludes that the issue of housing unaffordability in the UK was caused by high construction cost relative to median income.

The purpose of this paper is to recognize and label the faults in wind turbines with a new density-based clustering algorithm, named contour density scanning clustering (CDSC) algorithm.

The algorithm includes four components: (1) computation of neighborhood density, (2) selection of core and noise data, (3) scanning core data and (4) updating clusters. The proposed algorithm considers the relationship between neighborhood data points according to a contour density scanning strategy.

The first experiment is conducted with artificial data to validate that the proposed CDSC algorithm is suitable for handling data points with arbitrary shapes. The second experiment with industrial gearbox vibration data is carried out to demonstrate that the time complexity and accuracy of the proposed CDSC algorithm in comparison with other conventional clustering algorithms, including k-means, density-based spatial clustering of applications with noise, density peaking clustering, neighborhood grid clustering, support vector clustering, random forest, core fusion-based density peak clustering, AdaBoost and extreme gradient boosting. The third experiment is conducted with an industrial bearing vibration data set to highlight that the CDSC algorithm can automatically track the emerging fault patterns of bearing in wind turbines over time.

Data points with different densities are clustered using three strategies: direct density reachability, density reachability and density connectivity. A contours density scanning strategy is proposed to determine whether the data points with the same density belong to one cluster. The proposed CDSC algorithm achieves automatically clustering, which means that the trends of the fault pattern could be tracked.

The density peak clustering algorithm (DP) is proposed to identify cluster centers by two parameters, i.e. ρ value (local density) and δ value (the distance between a point and another point with a higher ρ value). According to the center-identifying principle of the DP, the potential cluster centers should have a higher ρ value and a higher δ value than other points. However, this principle may limit the DP from identifying some categories with multi-centers or the centers in lower-density regions. In addition, the improper assignment strategy of the DP could cause a wrong assignment result for the non-center points. This paper aims to address the aforementioned issues and improve the clustering performance of the DP.

First, to identify as many potential cluster centers as possible, the authors construct a point-domain by introducing the pinhole imaging strategy to extend the searching range of the potential cluster centers. Second, they design different novel calculation methods for calculating the domain distance, point-domain density and domain similarity. Third, they adopt domain similarity to achieve the domain merging process and optimize the final clustering results.

The experimental results on analyzing 12 synthetic data sets and 12 real-world data sets show that two-stage density peak clustering based on multi-strategy optimization (TMsDP) outperforms the DP and other state-of-the-art algorithms.

The authors propose a novel DP-based clustering method, i.e. TMsDP, and transform the relationship between points into that between domains to ultimately further optimize the clustering performance of the DP.

Fatigue and creep are the key factors for the failure of polymethyl methacrylate (PMMA) in the engineering structure, so a great of quantity attention is focused on the life prediction under the creep and fatigue conditions. This paper aims to mainly summarize the traditional life assessment method (S–N curve), life assessment method based on crazing density and life assessment method based on transmittance. S–N curve and classical creep curve are introduced on the traditional life assessment method; the variation of the craze density with the logarithm of cyclic numbers is given in different fatigue load. A linear relationship is obtained, and a higher stress leads to a higher slope, suggesting a faster growth of craze. Furthermore, a craze density model is purposed to describe this relationship; the variation of craze density with the time at different creep load is given. The craze density has two obvious stages. At the first stage, craze density ranged from approximately 0.02 to 0.17, and a linear relationship is obtained. In the following stage, a nonlinear relationship appears till specimen rupture, a new creep life model is proposed to depict two stages. The relationship between transmission and time under creep load is shown. With increasing of time, the transmittance shows a nonlinear decrease. Through polynomial nonlinear fitting, a relationship between the transmittance and residual life can be obtained. To provide reference for the life assessment of transparent materials, the paper compares three life assessment methods of PMMA.

This paper uses the traditional life assessment method (S–N curve), life assessment method based on crazing density, life assessment method based on transmittance.

The variation of the craze density with the logarithm of cyclic numbers is given in different fatigue loads. A linear relationship is obtained, and a higher stress leads to a higher slope, suggesting a faster growth of craze. Furthermore, a craze density model is proposed to describe this relationship, and the variation of craze density with the time at different creep loads is given. The craze density has two obvious stages. The relationship between transmission and time under creep load is shown. With increasing of time, the transmittance shows a nonlinear decrease. Through polynomial nonlinear fitting, a relationship between the transmittance and residual life can be obtained.

Fatigue and creep are the key factors for the failure of PMMA in the engineering structure, so a great of quantity attention is focused on the life prediction under the conditions of creep and fatigue. This paper mainly summarizes traditional life assessment method (S–N curve), life assessment method based on crazing density and life assessment method based on transmittance.

For a better understanding of the preferences and differences of young consumers in emerging wine markets, this study aims to propose a clustering method to segment the super-new generation wine consumers based on their sensitivity to wine brand, origin and price and then conduct user profiles for segmented consumer groups from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences.

We first proposed a consumer clustering perspective based on their sensitivity to wine brand, origin and price and then conducted an adaptive density peak and label propagation layer-by-layer (ADPLP) clustering algorithm to segment consumers, which improved the issues of wrong centers' selection and inaccurate classification of remaining sample points for traditional DPC (DPeak clustering algorithm). Then, we built a consumer profile system from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences for segmented consumer groups.

In this study, 10 typical public datasets and 6 basic test algorithms are used to evaluate the proposed method, and the results showed that the ADPLP algorithm was optimal or suboptimal on 10 datasets with accuracy above 0.78. The average improvement in accuracy over the base DPC algorithm is 0.184. As an outcome of the wine consumer profiles, sensitive consumers prefer wines with medium prices of 100–400 CNY and more personalized brands and origins, while casual consumers are fond of popular brands, popular origins and low prices within 50 CNY. The wine sensory attributes preferred by super-new generation consumers are red, semi-dry, semi-sweet, still, fresh tasting, fruity, floral and low acid.

Young Chinese consumers are the main driver of wine consumption in the future. This paper provides a tool for decision-makers and marketers to identify the preferences of young consumers quickly which is meaningful and helpful for wine marketing.

In this study, the ADPLP algorithm was introduced for the first time. Subsequently, the user profile label system was constructed for segmented consumers to highlight their characteristics and demand partiality from three aspects: demographic characteristics, consumers' eating habits and consumers' preferences for wine attributes. Moreover, the ADPLP algorithm can be considered for user profiles on other alcoholic products.

The purpose of this paper is to propose an improved proportional topology optimization (IPTO) algorithm for tackling the stress-constrained minimum volume optimization problem, which can meet the requirements that are to get rid of the problems of numerical derivation and sensitivity calculation involved in the process of obtaining sensitivity information and overcome the drawbacks of the original proportional topology optimization (PTO) algorithm.

The IPTO algorithm is designed by using the new target material volume update scheme and the new density variable update scheme and by introducing the improved density filter (considering the weighting function based on the Gaussian distribution) and Heaviside-type projection operator on the basis of the PTO algorithm. The effectiveness of the IPTO algorithm is demonstrated by solving the stress-constrained minimum volume optimization problems for two numerical examples and being compared with the PTO algorithm.

The results of this paper show that the uses of the proposed strategies contribute to improving the optimized results and the performance (such as the ability to obtain accurate solutions, robustness and convergence speed) of the IPTO algorithm. Compared with the PTO algorithm, the IPTO algorithm has the advantages of fast convergence speed, enhancing the ability to obtain accurate solutions and improving the optimized results.

This paper achieved the author’s intended purpose and provided a new idea for solving the stress-constrained optimization problem under the premise of avoiding obtaining sensitivity information.

The quick growth of web-based and mobile e-learning applications such as massive open online courses have created a large volume of online learning resources. Confronting such a large amount of learning data, it is important to develop effective clustering approaches for user group modeling and intelligent tutoring. The paper aims to discuss these issues.

In this paper, a minimum spanning tree based approach is proposed for clustering of online learning resources. The novel clustering approach has two main stages, namely, elimination stage and construction stage. During the elimination stage, the Euclidean distance is adopted as a metrics formula to measure density of learning resources. Resources with quite low densities are identified as outliers and therefore removed. During the construction stage, a minimum spanning tree is built by initializing the centroids according to the degree of freedom of the resources. Online learning resources are subsequently partitioned into clusters by exploiting the structure of minimum spanning tree.

Conventional clustering algorithms have a number of shortcomings such that they cannot handle online learning resources effectively. On the one hand, extant partitional clustering methods use a randomly assigned centroid for each cluster, which usually cause the problem of ineffective clustering results. On the other hand, classical density-based clustering methods are very computationally expensive and time-consuming. Experimental results indicate that the algorithm proposed outperforms the traditional clustering algorithms for online learning resources.

The effectiveness of the proposed algorithms has been validated by using several data sets. Moreover, the proposed clustering algorithm has great potential in e-learning applications. It has been demonstrated how the novel technique can be integrated in various e-learning systems. For example, the clustering technique can classify learners into groups so that homogeneous grouping can improve the effectiveness of learning. Moreover, clustering of online learning resources is valuable to decision making in terms of tutorial strategies and instructional design for intelligent tutoring. Lastly, a number of directions for future research have been identified in the study.

Density-based spatial clustering of applications with noise (DBSCAN) is the most commonly used density-based clustering algorithm, while it cannot be directly applied to the railway investment risk assessment. To overcome the shortcomings of calculation method and parameter limits of DBSCAN, this paper proposes a new algorithm called Improved Multiple Density-based Spatial clustering of Applications with Noise (IM-DBSCAN) based on the DBSCAN and rough set theory.

First, the authors develop an improved affinity propagation (AP) algorithm, which is then combined with the DBSCAN (hereinafter referred to as AP-DBSCAN for short) to improve the parameter setting and efficiency of the DBSCAN. Second, the IM-DBSCAN algorithm, which consists of the AP-DBSCAN and a modified rough set, is designed to investigate the railway investment risk. Finally, the IM-DBSCAN algorithm is tested on the China–Laos railway's investment risk assessment, and its performance is compared with other related algorithms.

The IM-DBSCAN algorithm is implemented on China–Laos railway's investment risk assessment and compares with other related algorithms. The clustering results validate that the AP-DBSCAN algorithm is feasible and efficient in terms of clustering accuracy and operating time. In addition, the experimental results also indicate that the IM-DBSCAN algorithm can be used as an effective method for the prospective risk assessment in railway investment.

This study proposes IM-DBSCAN algorithm that consists of the AP-DBSCAN and a modified rough set to study the railway investment risk. Different from the existing clustering algorithms, AP-DBSCAN put forward the density calculation method to simplify the process of optimizing DBSCAN parameters. Instead of using Euclidean distance approach, the cutoff distance method is introduced to improve the similarity measure for optimizing the parameters. The developed AP-DBSCAN is used to classify the China–Laos railway's investment risk indicators more accurately. Combined with a modified rough set, the IM-DBSCAN algorithm is proposed to analyze the railway investment risk assessment. The contributions of this study can be summarized as follows: (1) Based on AP, DBSCAN, an integrated methodology AP-DBSCAN, which considers improving the parameter setting and efficiency, is proposed to classify railway risk indicators. (2) As AP-DBSCAN is a risk classification model rather than a risk calculation model, an IM-DBSCAN algorithm that consists of the AP-DBSCAN and a modified rough set is proposed to assess the railway investment risk. (3) Taking the China–Laos railway as a real-life case study, the effectiveness and superiority of the proposed IM-DBSCAN algorithm are verified through a set of experiments compared with other state-of-the-art algorithms.

Collision avoidance is considered as a crucial issue in mobile robotic navigation to guarantee the safety of robots as well as working surroundings, especially for humans. Therefore, the position and velocity of obstacles appearing in the working space of the self-driving mobile robot should be observed to help the robot predict the collision and choose traversable directions. This paper aims to propose a new approach for obstacle tracking, dubbed MoDeT.

First, all long lines, such as walls, are extracted from the 2D-laser scan and considered as static obstacles (or mapped obstacles). Second, a density-based procedure is implemented to cluster nonwall obstacles. These clusters are then geometrically fitted as ellipses. Finally, the combination of Kalman filter and global nearest-neighbor (GNN) method is used to track obstacles’ position and velocity.

The proposed method (MoDeT) is experimentally verified by using an autonomous mobile robot (AMR) named AMR SR300. The MoDeT is found to provide better performance in comparison with previous methods for self-driving mobile robots.

The robot can only see a part of the object, depending on the light detection and ranging scan view. As a consequence, geometrical features of the obstacle are sometimes changed, especially when the robot is moving fast.

This proposed method is to serve the navigation and path planning for the AMR.

(a) Proposing an extended weighted line extractor, (b) proposing a density-based obstacle detection and (c) implementing a combination of methods [in (a) and (b) constant acceleration Kalman and GNN] to obtain obstacles’ properties.

We introduce a second‐order accurate time‐marching pressure‐correction algorithm to accommodate weakly‐compressible highly‐viscous liquid flows at low Mach number. As the incompressible limit is approached (Ma ≈ 0), the consistency of the compressible scheme is highlighted in recovering equivalent incompressible solutions. In the viscous‐dominated regime of low Reynolds number (zone of interest), the algorithm treats the viscous part of the equations in a semi‐implicit form. Two discrete representations are proposed to interpolate density: a piecewise‐constant form with gradient recovery and a linear interpolation form, akin to that on pressure. Numerical performance is considered on a number of classical benchmark problems for highly viscous liquid flows to highlight consistency, accuracy and stability properties. Validation bears out the high quality of performance of both compressible flow implementations, at low to vanishing Mach number. Neither linear nor constant density interpolations schemes degrade the second‐order accuracy of the original incompressible fractional‐staged pressure‐correction scheme. The piecewise‐constant interpolation scheme is advocated as a viable method of choice, with its advantages of order retention, yet efficiency in implementation.