Search

In response to the intensification of urbanization, characterized by increasingly dense land use, the proliferation of high-rise residences has emerged as a predominant housing solution, particularly evident in developed cities like those in China. With a primary aim of enhancing the residential living environment within high-rise structures, this study advocates for a comprehensive whole life cycle perspective. By employing digital technology and conducting experiments centered on a representative case study, this paper focuses on optimizing the functional layout of public activity spaces within high-rise residential projects. Specifically, this article aims to address challenges such as the inadequate configuration and articulation of various public spaces, along with the underutilization of peripheral activity areas. Central to the optimization efforts is the utilization of the Kruskal algorithm, which enables the analysis of flow lines and functions, ultimately leading to the derivation of optimal solutions. Through a detailed analysis of our case study, this paper provides actionable insights into enhancing the feasibility and effectiveness of public spaces within high-rise residential projects. Recognizing the pivotal role of public space layout in shaping residents' living experiences, the importance of addressing this issue early in the design phase was emphasized. By integrating scientifically driven digital technology solutions, smart, inclusive, and convenient communities that cater to the diverse needs of their inhabitants are aspired to be created. [ABSTRACT FROM AUTHOR]

As the usage rate of cars is getting higher and higher, the injuries and losses caused by traffic accidents are also getting bigger and bigger. If some traffic accidents can be predicted, then such losses can be greatly solved. Although there are abundant research results on intelligent transportation, there are not many research results on how to predict traffic accidents. For this issue, the main aim of this paper is to propose a continuous non-convex optimization of the K-means algorithm in order to solve the model problem in the traffic prediction process. First, this paper uses clustering algorithm for feature analysis and big data for the establishment of simulation model in cloud environment. Through this paper an equivalent model, using matrix optimization theory to analyze and process K-means problem, and design efficient and theoretically guaranteed algorithms for big data. By simulating the traffic situation in Shanghai city within three years, the outcomes display that the model endorsed in the given paper can predict traffic accidents at a rate of 93.88% and the accuracy rate of traffic accident processing time is 78%, which fully illustrates the effectiveness of the model established in this paper. [ABSTRACT FROM AUTHOR]

IPv6 geolocation is necessary for many location-based Internet services. However, the accuracy of the current IPv6 geolocation methods including machine-learning-based or deep-learning-based location algorithms are unsatisfactory for users. Strong geographic correlation is observed for measurement path features close to the target IP, so previous methods focused more on stable paths in the vicinity of the probe. Based on this, this paper proposes a new IPv6 geolocation algorithm, SubvectorS_Geo, which is mainly divided into three steps: firstly, it filters geographically relevant routing feature codes layer by layer to approximate the fine-grained trusted region of the target; secondly, it extracts delay vectors into the trusted region; thirdly, it evaluates the vector similarity to determine the final target geolocation information. The final experiments show that the median error distance range is 7.025 km to 9.709 km on three real datasets (Shanghai, New York State, and Tokyo). Compared with the advanced method, the median distance error distance is reduced by at least 6.8% and the average error distance is reduced by at least 9.2%. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Hydrographic Surveying & Charting / Haiyang Cehui is the property of Hydrographic Surveying & Charting Editorial Board and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Calibrating the microsimulation model is essential to enhance its ability to capture reality. The paper proposes a Bayesian neural network (BNN)-based method to calibrate parameters of microscopic traffic simulators, which reduces repeated running of simulations in the calibration and thus significantly improves the calibration efficiency. We use BNN with probability distributions on the weights to quickly predict the simulation results according to the inputs of the parameters to be calibrated. Based on the BNN model with the best performance, heuristic algorithms (HAs) are performed to seek the optimal values of the parameters to be calibrated with the minimum difference between the predicted results of BNN and the field-measured values. Three HAs are considered, including genetic algorithm (GA), evolutionary strategy (ES), and bat algorithm (BA). A TransModeler case of highway links in Shanghai, China, indicates the validity of the proposed calibration method in terms of error and efficiency. The results demonstrate that the BNN model is able to accurately predict the simulation and adequately capture the uncertainty of the simulation. We also find that the BNN-BA model produces the best calibration efficiency, while the BNN-ES model offers the best performance in calibration accuracy. [ABSTRACT FROM AUTHOR]

Railway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, our model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railway line. The computational results show that our approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%). [ABSTRACT FROM AUTHOR]

The problem of the optimal three-level location allocation of transfer center, processing factory and distribution center for supply chain network under uncertain transportation cost and customer demand are studied. We establish a two-stage fuzzy 0-1 mixed integer optimization model, by considering the uncertainty of the supply chain. Given the complexity of the model, this paper proposes a modified hybrid second order particle swarm optimization algorithm (MHSO-PSO) to solve the resulting model, yielding the optimal location and maximal expected return of supply chain simultaneously. A case study of clothing supply chain in Shanghai of China is then presented to investigate the specific influence of uncertainties on the transfer center, clothing factory and distribution center three-level location. Moreover, we compare the MHSO-PSO with hybrid particle swarm optimization algorithm and hybrid genetic algorithm, to validate the proposed algorithm based on the computational time and the convergence rate. [ABSTRACT FROM AUTHOR]

The rapid development of edge computing drives the rapid development of stock market prediction service in terminal equipment. However, the traditional prediction service algorithm is not applicable in terms of stability and efficiency. In view of this challenge, an improved Elman neural network is proposed in this paper. Elman neural network is a typical dynamic recurrent neural network that can be used to provide the stock price prediction service. First, the prediction model parameters and build process are analysed in detail. Then, the historical data of the closing price of Shanghai composite index and the opening price of Shenzhen composite index are collected for training and testing, so as to predict the prices of the next trading day. Finally, the experiment results validate that it is effective to predict the short-term future stock price by using the improved Elman neural network model. [ABSTRACT FROM AUTHOR]

This paper presents a sliding window multifractal detrending moving average (MF-DMA) method for multifractal analysis of time series. Numerical experiments on the binomial multifractal measure show improvements in fitting theoretical values by sliding window MF-DMA method compared with the original MF-DMA algorithm. We try to assess the multifractality displayed by realized volatility series of SSEC (Shanghai (securities) composite index) and SZSEC (Compositional Index of Shenzhen Stock Market) indexes in Chinese stock market via sliding window MF-DMA method, and the scaling exponents obtained are fitted to a Log-normal multifractal model. Empirical analysis shows clear evidences of the existences of multifractal features in realized volatility series of SSEC and SZSEC indexes, the multifractality degree of SSEC index is stronger than that of SZSEC index. The major sources of multifractality exhibited in realized volatility series of both SSEC and SZSEC indexes are long-range correlations of small and large fluctuations, and the fat-tailed distributions have certain effects on multifractality. The Log-normal multifractal model shows great availability to capture the scaling behavior of realized volatility series of real financial data. [ABSTRACT FROM AUTHOR]

Disasters such as earthquake or tsunami can easily take the lives of thousands of people and millions worth of property in a fleeting moment. A successful emergency evacuation plan is critical in response to disasters. In this paper, we seek to investigate the multi-source, multi-destination evacuation problem. First, we construct a mixed integer linear programming model. Second, based on K shortest paths and user equilibrium, we propose a novel algorithm (hereafter KPUE), whose complexity is polynomial in the numbers of nodes and evacuees. Finally, we demonstrate the effectiveness of algorithm KPUE by a real evacuation network in Shanghai, China. The numerical examples show that the average computation time of the proposed algorithm is 95% less than that of IBM ILOG CPLEX solver and the optimality gap is no more than 5%. [ABSTRACT FROM AUTHOR]

This paper developed a hybrid convolution neural network for perceptual crowd counting, which could accurately predict density maps in extremely crowded scenes . It consisted of merely two components: the front-end was a dilated convolutional neural network to extract two-dimensional features ;the back-end deployed a fractionally stride convolution to lower the loss of image information caused by down-sampling. This paper designed the model structure based on the dataset Shanghai Tech, then in an attempt to acknowledge and analyze the performance of the algorithm, and afterwards made use of the evaluation indicators of the regression problem, the average absolute error ( MAE) and the mean-square error ( MSE) as the criteria. Additionally, testing the method on Shanghai Tech ( MAE= 100. 8), UCF CC_50 ( MAE = 305. 3) and WorldExpo' 10 datasets while the experiment results reveal that the proposed model can effectively reduce MAE and MSE when compared with previous methods . [ABSTRACT FROM AUTHOR]

Massive data broadcast by GPS-equipped vehicles provide unprecedented opportunities. One of the main tasks in order to optimize our transportation networks is to build data-driven real-time decision support systems. However, the dynamic environments where the networks operate disallow the traditional assumptions required to put in practice many off-the-shelf supervised learning algorithms, such as finite training sets or stationary distributions. In this paper, we propose BRIGHT: a drift-aware supervised learning framework to predict demand quantities. BRIGHT aims to provide accurate predictions for short-term horizons through a creative ensemble of time series analysis methods that handles distinct types of concept drift. By selecting neighborhoods dynamically, BRIGHT reduces the likelihood of overfitting. By ensuring diversity among the base learners, BRIGHT ensures a high reduction of variance while keeping bias stable. Experiments were conducted using three large-scale heterogeneous real-world transportation networks in Porto (Portugal), Shanghai (China), and Stockholm (Sweden), as well as with controlled experiments using synthetic data where multiple distinct drifts were artificially induced. The obtained results illustrate the advantages of BRIGHT in relation to state-of-the-art methods for this task. [ABSTRACT FROM AUTHOR]

Time series prediction has been widely applied to the finance industry in applications such as stock market price and commodity price forecasting. Machine learning methods have been widely used in financial time series prediction in recent years. How to label financial time series data to determine the prediction accuracy of machine learning models and subsequently determine final investment returns is a hot topic. Existing labeling methods of financial time series mainly label data by comparing the current data with those of a short time period in the future. However, financial time series data are typically non-linear with obvious short-term randomness. Therefore, these labeling methods have not captured the continuous trend features of financial time series data, leading to a difference between their labeling results and real market trends. In this paper, a new labeling method called "continuous trend labeling" is proposed to address the above problem. In the feature preprocessing stage, this paper proposed a new method that can avoid the problem of look-ahead bias in traditional data standardization or normalization processes. Then, a detailed logical explanation was given, the definition of continuous trend labeling was proposed and also an automatic labeling algorithm was given to extract the continuous trend features of financial time series data. Experiments on the Shanghai Composite Index and Shenzhen Component Index and some stocks of China showed that our labeling method is a much better state-of-the-art labeling method in terms of classification accuracy and some other classification evaluation metrics. The results of the paper also proved that deep learning models such as LSTM and GRU are more suitable for dealing with the prediction of financial time series data. [ABSTRACT FROM AUTHOR]

Existing IP geolocation algorithms based on delay similarity often rely on the principle that geographically adjacent IPs have similar delays. However, this principle is often invalid in real Internet environment, which leads to unreliable geolocation results. To improve the accuracy and reliability of locating IP in real Internet, a street-level IP geolocation algorithm based on landmarks clustering is proposed. Firstly, we use the probes to measure the known landmarks to obtain their delay vectors, and cluster landmarks using them. Secondly, the landmarks are clustered again by their latitude and longitude, and the intersection of these two clustering results is taken to form training sets. Thirdly, we train multiple neural networks to get the mapping relationship between delay and location in each training set. Finally, we determine one of the neural networks for the target by the delay similarity and relative hop counts, and then geolocate the target by this network. As it brings together the delay and geographical coordinates clustering, the proposed algorithm largely improves the inconsistency between them and enhances the mapping relationship between them. We evaluate the algorithm by a series of experiments in Hong Kong, Shanghai, Zhengzhou and New York. The experimental results show that the proposed algorithm achieves street-level IP geolocation, and comparing with existing typical streetlevel geolocation algorithms, the proposed algorithm improves the geolocation reliability significantly. [ABSTRACT FROM AUTHOR]

Different types of roads in complex road networks may run side-by-side or across in 2D or 3D spaces, which causes mismatched segments using existing online map-matching algorithms. A driving scenario that represents the driving environment can inform map-matching algorithms. Images from vehicle cameras contain extensive information about driving scenarios, such as surrounding key objects. This research utilized vehicle images and developed an object-based method to classify driving scenarios (Object-Based Driving-Scenario Classification: OBDSC) to calculate the probabilities of the current image in predefined types of driving scenarios. We implemented an online map-matching algorithm with the OBDSC method (OMM-OBDSC) to obtain optimal matching segments. The algorithm was tested on nine trajectories and OpenStreetMap data in Shanghai and compared with five benchmark algorithms in terms of the match rate, recall and accuracy. The OBDSC method is also applied to the benchmark algorithms to verify the effectiveness of map matching. The results show that our algorithm outperforms the benchmark algorithms with both the original interval and downsampled intervals (96.6%, 96.5%, 93.7% on average with 1–20 s intervals for the three metrics, respectively). The average match rate has improved by 8.9% for all benchmark algorithms after the addition of the OBDSC method. [ABSTRACT FROM AUTHOR]

Heating, ventilation, and air conditioning (HVAC) systems are the second largest energy consumers on cruise ships after the propulsion system. As a kind of HVAC system, active chilled beam (ACB) systems have been widely used for cabin service due to their performance of energy efficiency and good thermal comfort. However, conventional control strategies for ships' ACB systems are not intelligent enough and cannot balance energy consumption and cabin comfort during the voyages of ships. This study developed an optimal control strategy for cabins' ACB systems. First, a simulation environment considering dynamic conditions is established in TRNSYS. Second, an artificial neural network model is utilized to predict the energy consumption of the ACB system, while the predicted percentage dissatisfied is adopted to represent cabins' thermal discomfort. Third, an improved multi-objective salp swarm algorithm is proposed to dynamically minimize both energy consumption and thermal discomfort. A TRNSYS–MATLAB co-simulation testbed is established to simulate the cabins served by an ACB system on a small cruise ship navigating from Hong Kong to Shanghai for validation tests and a comparison study. Compared to the conventional strategies, the proposed strategy can achieve a maximum energy savings of 12% while maintaining a predicted mean vote index less than 0.5, meeting the comfort requirements set by ASHRAE. [ABSTRACT FROM AUTHOR]

Hospital beds are one of the most critical resources in healthcare institutions. In practice, beds are usually allocated to different departments in advance to accommodate different kinds of patients. Inappropriate decisions in the allocation may lead to the idleness of beds or the high rejection ratio of patients. Hospital managers are under pressure to allocate beds to different departments. High variability in patient arrivals and service times make the allocation problem complex and challenging to solve. To address this problem, a mixed-integer non-linear programming model is formulated, with the objective of minimising the weighted cost of rejecting patients and holding them waiting. To solve this model, a data-driven metamodel simulation optimisation method is proposed, in which metamodels, based on an analytical queuing model and a general function, are proposed and embedded into a general-purpose algorithm Adaptive Hyperbox Algorithm. The metamodels designated for local and global approximation are separately fitted using different sets of simulation observations, which can combine structural information and simulation information, and can provide insightful guidance in solution improvements. A case study is conducted based on the real data collected from a public hospital in Shanghai. Numerical results demonstrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Reinforcement learning has potential in the area of intelligent transportation due to its generality and real-time feature. The Q-learning algorithm, which is an early proposed algorithm, has its own merits to solve the train timetable rescheduling (TTR) problem. However, it has shortage in two aspects: Dimensional limits of action and a slow convergence rate. In this paper, a deep deterministic policy gradient (DDPG) algorithm is applied to solve the energy-aimed train timetable rescheduling (ETTR) problem. This algorithm belongs to reinforcement learning, which fulfills real-time requirements of the ETTR problem, and has adaptability on random disturbances. Superior to the Q-learning, DDPG has a continuous state space and action space. After enough training, the learning agent based on DDPG takes proper action by adjusting the cruising speed and the dwelling time continuously for each train in a metro network when random disturbances happen. Although training needs an iteration for thousands of episodes, the policy decision during each testing episode takes a very short time. Models for the metro network, based on a real case of the Shanghai Metro Line 1, are established as a training and testing environment. To validate the energy-saving effect and the real-time feature of the proposed algorithm, four experiments are designed and conducted. Compared with the no action strategy, results show that the proposed algorithm has real-time performance, and saves a significant percentage of energy under random disturbances. [ABSTRACT FROM AUTHOR]

Waste sorting is an imperative and significant issue in China, of which sorted-waste collection and transportation are indispensable parts. Despite its vital yet practical significance, few studies research mathematical models or algorithms of waste collection and transportation from the perspective of waste sorting. To address this issue, we extend a novel transportation model for the waste management system, namely, capacitated location routing problem with queuing time (CLRPQT) and design a cross-entropy and simulated-annealing based hyper-heuristic algorithm (CE-SAHH) for it. The main idea of this paper is three-fold: (1) As a particular property of this problem, source nodes cannot but need to be served by more than one vehicle that causes queuing time between a heterogeneous fleet of vehicles, which is novel in terms of the proposed model; (2) For the methodological contribution, a character encoding scheme, new decoding procedure, and local search strategy are designed embedded in the proposed method; (3) An integration of simulated annealing strategy and the cross-entropy-based hyper-heuristic algorithm is developed to overcome the combinatorial optimization problem with a more complex solution of this study. Finally, the results and analysis of three numeric experiments on benchmark datasets, new instances of CLRPQT, and simulation data in Shanghai, China, verify the effectiveness and universality of the proposed model and method. • A novel model with interactional routes for sorted-waste transportation is proposed. • A cross-entropy-based hyper-heuristic algorithm is proposed and performs well. • The novel model and method based on sorted waste enrich the waste management system. • Real-life data is used to verify the method and some managerial insights are drawn. [ABSTRACT FROM AUTHOR]

Recently, a measurement campaign for characterizing the channels in underground subway environments was conducted in Shanghai, China. Downlink signals transmitted by 46 universal mobile telecommunication system cells deployed along a 34-km-long subway were collected. Channel impulse responses are extracted from the data received in the common pilot channels, based on which parameters of multipath components are estimated by using a high-resolution parameter algorithm derived using the space-alternating generalized expectation-maximization principle. Multiple time-evolving clusters are obtained, each representing the channel from a remote-radio-unit of a base station to the receiver. Based on a total of 98 time-evolving clusters, channels observed in the station scenario and the tunnel scenario are modeled separately for their distinctive behaviors in many aspects, particularly in the variations of clusters’ trajectories. Intracluster characteristics parameterized by cluster delay and Doppler frequency spreads, $K$ -factor, and dependences among these parameters are investigated. Intercluster parameters, including coexisting cluster number, delay offset, power offset, and cross correlations, are investigated for the station scenario. A path loss model is established for the tunnel scenario. [ABSTRACT FROM AUTHOR]

Due to the long design cycle of watercolor cultural and creative products, a design method based on style transfer algorithm is proposed. Here, the design of Shanghai style watercolor painting cultural and creative products is taken as the research object, VGG-19 network is used as the style transfer model, and the loss function of style transfer algorithm is designed. The simulation results show that the proposed method can effectively extract and reconstruct the color, texture, brushstroke, and other styles of Shanghai style watercolor painting. The generated new images are added as design elements, which makes the cultural and creative products have both appearance and personalization. In addition, the newly generated cultural and creative products have also obtained high satisfaction from experts and users, which meet the aesthetic changes. It can be seen that proposed method provides a new idea for the design of watercolor cultural and creative products, which shortens the product design cycle, reduces the design cost, and has a certain practicality. [ABSTRACT FROM AUTHOR]

With the boom of big data, the Internet contains more and more personal behavior information, but it is difficult to extract effectively. A model involving multivariate processing capability must be constructed to deal with these time series with complex characteristics. In this paper, a novel hybrid model embedding Baidu Search Index is therefore proposed to implement multi-step ahead subway passenger flow forecasting. Firstly, we collect data from informative Baidu Search Index, reduce dimensionality, and screen out the powerful predictors by statistical analysis. Secondly, we extract matching common modes at similar time scales between the subway passenger flow and screened Baidu Search Index via multivariate mode decomposition being optimized by multi-objective algorithm. Furthermore, to eliminate pseudo statistical causality, we select the optimal combination of modal components between subway passenger flow and its corresponding Baidu Search Index at each time scale by an innovative multi–modal analysis strategy. Thirdly, we reconstruct the forecasting values of each selected optimal combination as the final results. The empirical results of Beijing, Shanghai and Guangzhou show that the proposed model can significantly outperform six benchmark models in both the level and directional accuracy. So introducing Baidu Search Index creates a sound opportunity to enhance the subway passenger flow forecasting ability. [ABSTRACT FROM AUTHOR]

As a critical foundation for train traffic management, a train stop plan is associated with several other plans in high-speed railway train operation strategies. The current approach to train stop planning in China is based primarily on passenger demand volume information and the preset high-speed railway station level. With the goal of efficiently optimising the stop plan, this study proposes a novel method that uses machine learning techniques without a predetermined hypothesis and a complex solution algorithm. Clustering techniques are applied to assess the features of the service nodes (e.g., the station level). A modified Markov decision process (MDP) is conducted to express the entire stop plan optimisation process considering several constraints (service frequency at stations and number of train stops). A restrained MDP-based stop plan model is formulated, and a numerical experiment is conducted to demonstrate the performance of the proposed approach with real-world train operation data collected from the Beijing-Shanghai high-speed railway. [ABSTRACT FROM AUTHOR]

Grouting reinforcement technology gradually has been widely used to repair the subgrade settlement diseases, but the current single application of discrete element software or finite element software cannot effectively simulate the grouting process. Therefore, one new method is put forward in the research of grouting based on the CFD-DEM coupling principle. And then, one typical subgrade section in the Shanghai–Nanjing intercity railway is used to simulate the grouting process and diffusion mechanism of slurry from microlevel. Based on the results of site survey, some findings are shown as follows: First, the new method is feasible which integrates the favorable aspects of discrete elements, finite elements, and boundary elements. Second, the greater the grouting pressure, the greater the influence range of grouting, and it shows six petals shape. When the grouting pressure is small, the grouting generally shows penetration or extrusion grouting, and its influence range is small. When the grouting pressure is large enough, it is characterized by splitting grouting, and the influence range of grouting is getting larger and larger. Third, the growth rates of influence range gradually increase with the increasement of grouting pressures, and the reasonable selection of grouting pressures is very important. [ABSTRACT FROM AUTHOR]

There are two challenges in the comprehensive marine hazard assessment. The influencing mechanism of marine disaster is uncertain and disaster data are sparse. Aiming at the uncertain knowledge and small sample in assessment modeling, we combine the information diffusion algorithm and Bayesian network to propose a novel assessment model. The information diffusion algorithm is adopted to expand associated samples between disaster losses and environmental conditions. Then the expanded data sets are used to build the BN-based assessment model through structural learning, parameter learning and probabilistic reasoning. The proposed model is applied to the hazard assessment of marine disasters in Shanghai. Experimental comparison results show that it is capable of dealing with uncertainty effectively and achieving more accuracy risk assessment under the small sample condition. [ABSTRACT FROM AUTHOR]