Search

Kernel regression models have been used as non-parametric methods for fitting experimental data. However, due to their non-parametric nature, they belong to the so-called “black box” models, indicating that the relation between the input variables and the output, depending on the kernel selection, is unknown. In this paper we propose a new methodology to retrieve the relation between each input regressor variable and the output in a least squares support vector machine (LS-SVM) regression model. The method is based on oblique subspace projectors (ObSP), which allows to decouple the influence of input regressors on the output by including the undesired variables in the null space of the projection matrix. Such functional relations are represented by the nonlinear transformation of the input regressors, and their subspaces are estimated using appropriate kernel evaluations. We exploit the properties of ObSP in order to decompose the output of the obtained regression model as a sum of the partial nonlinear contributions and interaction effects of the input variables, we called this methodology Nonlinear ObSP (NObSP). We compare the performance of the proposed algorithm with the component selection and smooth operator (COSSO) for smoothing spline ANOVA models. We use as benchmark 2 toy examples and a real life regression model using the concrete strength dataset from the UCI machine learning repository. We showed that NObSP is able to outperform COSSO, producing stable estimations of the functional relations between the input regressors and the output, without the use of prior-knowledge. This methodology can be used in order to understand the functional relations between the inputs and the output in a regression model, retrieving the physical interpretation of the regression models. [ABSTRACT FROM AUTHOR]

Cell segmentation in microscopy is a challenging problem, since cells are often asymmetric and densely packed. Successful cell segmentation algorithms rely identifying seed points, and are highly sensitive to variablility in cell size. In this paper, we present an efficient and highly parallel formulation for symmetric three-dimensional contour evolution that extends previous work on fast two-dimensional snakes. We provide a formulation for optimization on 3D images, as well as a strategy for accelerating computation on consumer graphics hardware. The proposed software takes advantage of Monte-Carlo sampling schemes in order to speed up convergence and reduce thread divergence. Experimental results show that this method provides superior performance for large 2D and 3D cell localization tasks when compared to existing methods on large 3D brain images. [ABSTRACT FROM AUTHOR]

The carrying pole has existed as a load carrying tool for thousands of years and is still popular in many parts of Asia. Previous studies attempted to determine whether the elasticity of the carrying pole is energetically beneficial compared with other load carrying methods. However, conflicting results indicate that the effects of the carrying pole stiffness on the carrier are still unclear. The carrying pole exhibits more complex characteristics beyond stiffness, which invites further investigation. As the first step towards the goal, this paper explores the underlying mechanics of the carrying pole, including the structural and dynamic properties, to determine its impact on the carrier. The structure of the carrying pole is modeled and characterized by pole length, pole stiffness, and length of suspension rope. We argue that maintaining the pole’s balance should be a major prerequisite during load carriage and that active feedback control from the carrier is required. Simulations reveal that the structural parameters of the pole have significant influences on the pole’s balance and the interaction between the pole and the carrier. This work suggests mechanical characteristics of the carrying pole can potentially have an extensive impact on gait mechanics and energetics of the carrier. [ABSTRACT FROM AUTHOR]

Many computational theories have been developed to improve artificial phonetic classification performance from linguistic auditory streams. However, less attention has been given to psycholinguistic data and neurophysiological features recently found in cortical tissue. We focus on a context in which basic linguistic units–such as phonemes–are extracted and robustly classified by humans and other animals from complex acoustic streams in speech data. We are especially motivated by the fact that 8-month-old human infants can accomplish segmentation of words from fluent audio streams based exclusively on the statistical relationships between neighboring speech sounds without any kind of supervision. In this paper, we introduce a biologically inspired and fully unsupervised neurocomputational approach that incorporates key neurophysiological and anatomical cortical properties, including columnar organization, spontaneous micro-columnar formation, adaptation to contextual activations and Sparse Distributed Representations (SDRs) produced by means of partial N-Methyl-D-aspartic acid (NMDA) depolarization. Its feature abstraction capabilities show promising phonetic invariance and generalization attributes. Our model improves the performance of a Support Vector Machine (SVM) classifier for monosyllabic, disyllabic and trisyllabic word classification tasks in the presence of environmental disturbances such as white noise, reverberation, and pitch and voice variations. Furthermore, our approach emphasizes potential self-organizing cortical principles achieving improvement without any kind of optimization guidance which could minimize hypothetical loss functions by means of–for example–backpropagation. Thus, our computational model outperforms multiresolution spectro-temporal auditory feature representations using only the statistical sequential structure immerse in the phonotactic rules of the input stream. [ABSTRACT FROM AUTHOR]

Pallet is a very important innovation in logistics industry. Pallets are so widely used that we can find them in nearly every logistical operation scenario. In order to manage pallets efficiently, researchers have developed several pallet management strategies (PMS). The most common and widely accepted PMS includes extensive management of pallets (EMP), transfer of pallet's ownership (TPO), and pallet rent (PR). This paper addresses mainly on how to help pallet managers choose a certain kind of PMS from the perspective of supply chain cost. Firstly, cost models of three kinds of PMS are presented. Secondly, all parameters involved in the models are valued based on data that is collected from industry survey. The results show that the cost of PR is constantly lower than EMP, and also lower than TPO when the operation period is no more than 37 months. Finally, the effect of several important parameters on the cost is studied by sensitivity analysis. The selection strategies of PMS are proposed based on the results. [ABSTRACT FROM AUTHOR]

Objectives: This paper focuses on the issue of intimate partner violence and, specifically, on the distribution of femicides over time and the existence of copycat effects. This is the subject of an ongoing debate often triggered by the social alarm following multiple intimate partner homicides (IPHs) occurring in a short span of time. The aim of this research is to study the evolution of IPHs and provide a far-reaching answer by rigorously analyzing and searching for patterns in data on femicides. Methods: The study analyzes an official dataset, provided by the system VioGén of the Secretaría de Estado de Seguridad (Spanish State Secretariat for Security), including all the femicides occurred in Spain in 2007-2017. A statistical methodology to identify temporal interdependencies in count time series is proposed and applied to the dataset. The same methodology can be applied to other contexts. Results: There has been a decreasing trend in the number of femicides per year. No interdependencies among the temporal distribution of femicides are observed. Therefore, according to data, the existence of copycat effect in femicides cannot be claimed. Conclusions: Around 2011 there was a clear change in the average number of femicides which has not picked up. Results allow for an informed answer to the debate on copycat effect in Spanish femicides. The planning of femicides prevention activities should not be a reaction to a perceived increase in their occurrence. As a copycat effect is not detected in the studied time period, there is no evidence supporting the need to censor media reports on femicides. [ABSTRACT FROM AUTHOR]

Clustering large and complex data sets whose partitions may adopt arbitrary shapes remains a difficult challenge. Part of this challenge comes from the difficulty in defining a similarity measure between the data points that captures the underlying geometry of those data points. In this paper, we propose an algorithm, DCG++ that generates such a similarity measure that is data-driven and ultrametric. DCG++ uses Markov Chain Random Walks to capture the intrinsic geometry of data, scans possible scales, and combines all this information using a simple procedure that is shown to generate an ultrametric. We validate the effectiveness of this similarity measure within the context of clustering on synthetic data with complex geometry, on a real-world data set containing segmented audio records of frog calls described by mel-frequency cepstral coefficients, as well as on an image segmentation problem. The experimental results show a significant improvement on performance with the DCG-based ultrametric compared to using an empirical distance measure. [ABSTRACT FROM AUTHOR]

Unless the targeted mesh is developable, metric distortion is inevitable during the process of surface mesh parameterization, thus one important objective of all involved parametric studies is to reduce the metric distortion. In order to further reduce area and angle distortion, a novel method of boundary-free mesh parameterization is presented in the paper. Firstly, the initial boundary-fixed conformal parameterization from 3D surface mesh patch to a plane is performed in the method. Then, based on the initial parameterization, the iterations of boundary-free quasi-harmonic parameterization are developed, where the tensor field is updated in each iterative step and the principal curvature direction is utilized to terminate the iteration. The solution of the novel method is convenient to calculate since it involves a series of linear systems. In our novel parameterization method, lower metric distortion and considerable efficiency have been obtained in experiments. [ABSTRACT FROM AUTHOR]

With the prosperity of machine learning and cloud computing, meaningful information can be mined from mass electronic medical data which help physicians make proper disease diagnosis for patients. However, using medical data and disease information of patients frequently raise privacy concerns. In this paper, based on single-layer perceptron, we propose a scheme of privacy-preserving clinical decision with cloud support (PPCD), which securely conducts disease model training and prediction for the patient. Each party learns nothing about the other’s private information. In PPCD, a lightweight secure multiplication is presented and introduced to improve the model training. Security analysis and experimental results on real data confirm the high accuracy of disease prediction achieved by the proposed PPCD without the risk of privacy disclosure. [ABSTRACT FROM AUTHOR]

The performance of data clustering algorithms is mainly dependent on their ability to balance between the exploration and exploitation of the search process. Although some data clustering algorithms have achieved reasonable quality solutions for some datasets, their performance across real-life datasets could be improved. This paper proposes an adaptive memetic differential evolution optimisation algorithm (AMADE) for addressing data clustering problems. The memetic algorithm (MA) employs an adaptive differential evolution (DE) mutation strategy, which can offer superior mutation performance across many combinatorial and continuous problem domains. By hybridising an adaptive DE mutation operator with the MA, we propose that it can lead to faster convergence and better balance the exploration and exploitation of the search. We would also expect that the performance of AMADE to be better than MA and DE if executed separately. Our experimental results, based on several real-life benchmark datasets, shows that AMADE outperformed other compared clustering algorithms when compared using statistical analysis. We conclude that the hybridisation of MA and the adaptive DE is a suitable approach for addressing data clustering problems and can improve the balance between global exploration and local exploitation of the optimisation algorithm. [ABSTRACT FROM AUTHOR]

The framework of dynamical systems offers powerful tools to understand the relation between stability and variability in human cognition in general and in speech in particular. In the current paper, we propose a dynamical systems approach to the description of German nuclear pitch accents in focus marking to account for both the categorical as well as the continuous variation found in intonational data. We report on results from 27 native speakers and employ an attractor landscape to represent pitch accent types in terms of f0 measures in a continuous dimension. We demonstrate how the same system can account for both the categorical variation (relative stability of one prosodic category) as well as the continuous variation (detailed modifications within one prosodic category). The model is able to capture the qualitative aspects of focus marking such as falling vs. rising pitch accent types as well as the quantitative aspects such as less rising vs. more rising accents in one system by means of scaling a single parameter. Furthermore, speaker group specific strategies are analysed and modelled as differences in the scaling of this parameter. Thus, the model contributes to the ongoing debate about the relation between phonetics and phonology and the importance of variation in language and speech. [ABSTRACT FROM AUTHOR]

DIBR-3D technology has evolved over the past few years with the demands of consumers increasing in recent times for future free-view 3D videos on their home televisions. The main issue in 3D technology is the lack of 3D content available to watch using the traditional TV systems. Although, some sophisticated devices like stereoscopic cameras have been used to fill the gap between the 3D content demand and 3D content supply. But the content generated through these sophisticated devices can not be displayed on the traditional TV systems, so there needs to be some mechanism which is inline with the traditional TV. Furthermore, the huge collection of existing 2D content should be converted to 3D using depth image-based rendering techniques. This conversion technique can highly contribute in overcoming the shortage problem of the 3D content. This paper presents a novel approach for converting 2D degraded image for DIBR 3D-TV view. This degraded or noisy/blur image is enhanced through image dehazing and Directional Filter Bank (DFB). This enhancement is necessary because of the occlusion effect or hole filling problem that occurs due to imperfect depth map. The enhanced image is then segmented into the foreground image and the background image. After the segmentation, the depth map is generated using image profiles. Moreover, Stereoscopic images are finally produced using the DIBR procedure which is based on the 2D input image and the corresponding depth map. We have verified the results of the proposed approach by comparing the results with the existing state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

Digital public displays installed in various locations provide valuable information for the passers-by. However, the static characteristic of the digital public display limits the consumption of the displayed content to a small area. Personal mobile devices such as smartphones are now capable of interacting with digital public displays, which enables the passers-by to “take-away” the content and consume it on-the-go. This process requires device binding, content selection, and transfer between the two devices. In this paper, we propose a device binding method which utilizes the content brightness changing pattern as a unique content ID on the public display and an illuminance sensor on the mobile to bind and transfer between two devices. We conducted performance evaluations for binding algorithm robustness in different conditions. Also comparative studies among other binding interaction methods were conducted. Our results show that our proposed method performed stably across the various conditions and overall performance in interaction completion time and error rate was similar or superior to the existing methods. [ABSTRACT FROM AUTHOR]

Feature subspace learning plays a significant role in pattern recognition, and many efforts have been made to generate increasingly discriminative learning models. Recently, several discriminative feature learning methods based on a representation model have been proposed, which have not only attracted considerable attention but also achieved success in practical applications. Nevertheless, these methods for constructing the learning model simply depend on the class labels of the training instances and fail to consider the essential subspace structural information hidden in them. In this paper, we propose a robust feature subspace learning approach based on a low-rank representation. In our approach, the low-rank representation coefficients are considered as weights to construct the constraint item for feature learning, which can introduce a subspace structural similarity constraint in the proposed learning model for facilitating data adaptation and robustness. Moreover, by placing the subspace learning and low-rank representation into a unified framework, they can benefit each other during the iteration process to realize an overall optimum. To achieve extra discrimination, linear regression is also incorporated into our model to enforce the projection features around and close to their label-based centers. Furthermore, an iterative numerical scheme is designed to solve our proposed objective function and ensure convergence. Extensive experimental results obtained using several public image datasets demonstrate the advantages and effectiveness of our novel approach compared with those of the existing methods. [ABSTRACT FROM AUTHOR]

Electroencephalogram (EEG) is a common base signal used to monitor brain activities and diagnose sleep disorders. Manual sleep stage scoring is a time-consuming task for sleep experts and is limited by inter-rater reliability. In this paper, we propose an automatic sleep stage annotation method called SleepEEGNet using a single-channel EEG signal. The SleepEEGNet is composed of deep convolutional neural networks (CNNs) to extract time-invariant features, frequency information, and a sequence to sequence model to capture the complex and long short-term context dependencies between sleep epochs and scores. In addition, to reduce the effect of the class imbalance problem presented in the available sleep datasets, we applied novel loss functions to have an equal misclassified error for each sleep stage while training the network. We evaluated the performance of the proposed method on different single-EEG channels (i.e., Fpz-Cz and Pz-Oz EEG channels) from the Physionet Sleep-EDF datasets published in 2013 and 2018. The evaluation results demonstrate that the proposed method achieved the best annotation performance compared to current literature, with an overall accuracy of 84.26%, a macro F1-score of 79.66% and κ = 0.79. Our developed model can be applied to other sleep EEG signals and aid the sleep specialists to arrive at an accurate diagnosis. The source code is available at . [ABSTRACT FROM AUTHOR]

Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melanogaster network. Results show that the proposed algorithm works faster in solving the control problem over these networks, while having similar accuracy, in comparison to previous exact methods. Source code and a simple web service of the proposed algorithm is available at . [ABSTRACT FROM AUTHOR]

Generalized linear latent variable models (GLLVM) are popular tools for modeling multivariate, correlated responses. Such data are often encountered, for instance, in ecological studies, where presence-absences, counts, or biomass of interacting species are collected from a set of sites. Until very recently, the main challenge in fitting GLLVMs has been the lack of computationally efficient estimation methods. For likelihood based estimation, several closed form approximations for the marginal likelihood of GLLVMs have been proposed, but their efficient implementations have been lacking in the literature. To fill this gap, we show in this paper how to obtain computationally convenient estimation algorithms based on a combination of either the Laplace approximation method or variational approximation method, and automatic optimization techniques implemented in software. An extensive set of simulation studies is used to assess the performances of different methods, from which it is shown that the variational approximation method used in conjunction with automatic optimization offers a powerful tool for estimation. [ABSTRACT FROM AUTHOR]

Antenna selection in Multiple-Input Multiple-Output (MIMO) systems has attracted increasing attention due to the challenge of keeping a balance between communication performance and computational complexity. Recently, deep learning based methods have achieved promising performance in many application fields. This paper proposed a deep learning (DL) based antenna selection technique. First, we generated the label of training antenna systems by maximizing the channel capacity. Then, we adopted the deep convolutional neural network (CNN) on the channel matrices to explicitly exploit the massive latent cues of attenuation coefficients. Finally, we used the adopted CNN to assign the class label and then select the optimal antenna subset. Experimental results demonstrate that our method can achieve better performance than the state-of-the-art baselines for data-driven based antenna selection. [ABSTRACT FROM AUTHOR]

Systems biology models are used to understand complex biological and physiological systems. Interpretation of these models is an important part of developing this understanding. These models are often fit to experimental data in order to understand how the system has produced various phenomena or behaviour that are seen in the data. In this paper, we have outlined a framework that can be used to perform Bayesian analysis of complex systems biology models. In particular, we have focussed on analysing a systems biology of the brain using both simulated and measured data. By using a combination of sensitivity analysis and approximate Bayesian computation, we have shown that it is possible to obtain distributions of parameters that can better guard against misinterpretation of results, as compared to a maximum likelihood estimate based approach. This is done through analysis of simulated and experimental data. NIRS measurements were simulated using the same simulated systemic input data for the model in a ‘healthy’ and ‘impaired’ state. By analysing both of these datasets, we show that different parameter spaces can be distinguished and compared between different physiological states or conditions. Finally, we analyse experimental data using the new Bayesian framework and the previous maximum likelihood estimate approach, showing that the Bayesian approach provides a more complete understanding of the parameter space. [ABSTRACT FROM AUTHOR]

Due to continuous evolution of biomedical data, biomedical ontologies are becoming larger and more complex, which leads to the existence of many overlapping information. To support semantic inter-operability between ontology-based biomedical systems, it is necessary to identify the correspondences between these information, which is commonly known as biomedical ontology matching. However, it is a challenge to match biomedical ontologies, which dues to: (1) biomedical ontologies often possess tens of thousands of entities, (2) biomedical terminologies are complex and ambiguous. To efficiently match biomedical ontologies, in this paper, an interactive biomedical ontology matching approach is proposed, which utilizes the Evolutionary Algorithm (EA) to implement the automatic matching process, and gets a user involved in the evolving process to improve the matching efficiency. In particular, we propose an Evolutionary Tabu Search (ETS) algorithm, which can improve EA’s performance by introducing the tabu search algorithm as a local search strategy into the evolving process. On this basis, we further make the ETS-based ontology matching technique cooperate with the user in a reasonable amount of time to efficiently create high quality alignments, and make use of EA’s survival of the fittest to eliminate the wrong correspondences brought by erroneous user validations. The experiment is conducted on the Anatomy track and Large Biomedic track that are provided by the Ontology Alignment Evaluation Initiative (OAEI), and the experimental results show that our approach is able to efficiently exploit the user intervention to improve its non-interactive version, and the performance of our approach outperforms the state-of-the-art semi-automatic ontology matching systems. [ABSTRACT FROM AUTHOR]

Providing complete mobility along with minimizing the poor quality of service (QoS) is one of the highest essential challenges in mobile wireless networks. Handover prediction can overcome these challenges. In this paper, two novel prediction schemes are proposed. The first, depends on scanning the quality of all signals among mobile station and all nearby stations in the surrounding area, while the second one is based on a multi-criteria prediction decision using both the signal-to-noise ratio SNR value and station’s bandwidth. Moreover, the prediction efficiency is improved by reducing the number of redundant/ unnecessary handovers. The proposed schemes are evaluated using different scenarios with several mobile stations’ numbers, different WLAN access points, LTE-base station number & location, and random mobile station movement manner. The proposed schemes achieved a success rate of 99% with the different scenarios using LTE-WLAN architecture. The performance of the proposed prediction schemes outperformed the performance of the existing prediction schemes in terms of the accuracy percentage. [ABSTRACT FROM AUTHOR]

In the carrier-based coverage repair problem, a single mobile robot replaces damaged sensors by picking up spare ones in the region of interest or carrying them from a base station in wireless sensor and robot networks. The objective is to find the shortest path of the robot. The problem is an extension of the traveling salesman problem (TSP). Thus, it is also called the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD). In order to solve this problem in a larger sensor distribution scenario more efficiently, we propose a two-stage approach in this paper. In the first stage, the mature and effective Lin–Kernighan–Helsgaun (LKH) algorithm is used to form a Hamiltonian cycle for all delivery nodes, which is regarded as a heuristic for the second stage. In the second stage, elliptical regions are set for selecting pickup nodes‚ and an edge-ordered list (candidate edge list, CEL) is constructed to provide major axes for the ellipses. The process of selecting pickup nodes and constructing the CEL is repeated until all the delivery nodes are visited. The final CEL stores a feasible solution. To update it, three operations—expansion, extension, and constriction—are applied to the CEL. The experimental results show that the proposed method reduces the computing time and achieves better results in higher-dimensional problems, which may facilitate the provision of solutions for more complicated sensor networks and can contribute to the development of effective and efficient algorithms for the one-commodity pickup-and-delivery traveling salesman problem (1-PDTSP). [ABSTRACT FROM AUTHOR]

The unrivaled computing capabilities of modern GPUs meet the demand of processing massive amounts of data seen in many application domains. While traditional HPC systems support applications as standalone entities that occupy entire GPUs, there are GPU-based DBMSs where multiple tasks are meant to be run at the same time in the same device. To that end, system-level resource management mechanisms are needed to fully unleash the computing power of GPUs in large data processing, and there were some researches focusing on it. In our previous work, we explored the single compute-bound kernel modeling on GPUs under NVidia’s CUDA framework and provided an in-depth anatomy of the NVidia’s concurrent kernel execution mechanism (CUDA stream). This paper focuses on resource allocation of multiple GPU applications towards optimization of system throughput in the context of systems. Comparing to earlier studies of enabling concurrent tasks support on GPU such as MultiQx-GPU, we use a different approach that is to control the launching parameters of multiple GPU kernels as provided by compile-time performance modeling as a kernel-level optimization and also a more general pre-processing model with batch-level control to enhance performance. Specifically, we construct a variation of multi-dimensional knapsack model to maximize concurrency in a multi-kernel environment. We present an in-depth analysis of our model and develop an algorithm based on dynamic programming technique to solve the model. We prove the algorithm can find optimal solutions (in terms of thread concurrency) to the problem and bears pseudopolynomial complexity on both time and space. Such results are verified by extensive experiments running on our microbenchmark that consists of real-world GPU queries. Furthermore, solutions identified by our method also significantly reduce the total running time of the workload, as compared to sequential and MultiQx-GPU executions. [ABSTRACT FROM AUTHOR]

Ex-ante online risk assessment for building emergency evacuation is essential to protect human life and property. Current risk assessment methods are limited by the tradeoff between accuracy and efficiency. In this paper, we propose an online method that overcomes this tradeoff based on multimedia data (e.g. videos data from surveillance cameras) and deep learning. The method consists of two parts. The first estimates the evacuee position as input for training the assessment model to then perform risk assessment in real scenarios. The second considers a social force model based on the evacuation simulation for the output of training model. We verify the proposed method in simulation and real scenarios. Model sensitivity analyses and large-scale tests demonstrate the usability and superiority of the proposed method. By the method, the computation time of risk assessment could be decreased from 10 minutes (by traditional simulation method) to 2.18 s. [ABSTRACT FROM AUTHOR]

In this paper, we put forward a real-time multiple GPUs (multi-GPU) accelerated virtual-reality interaction simulation framework where the reconstructed objects from camera images interact with virtual deformable objects. Firstly, based on an extended voxel-based visual hull (VbVH) algorithm, we design an image-based 3D reconstruction platform for real objects. Then, an improved hybrid deformation model, which couples the geometry constrained fast lattice shape matching method (FLSM) and total Lagrangian explicit dynamics (TLED) algorithm, is proposed to achieve efficient and stable simulation of the virtual objects’ elastic deformations. Finally, one-way virtual-reality interactions including soft tissues’ virtual cutting with bleeding effects are successfully simulated. Moreover, with the purpose of significantly improving the computational efficiency of each time step, we propose an entire multi-GPU implementation method of the framework using compute unified device architecture (CUDA). The experiment results demonstrate that our multi-GPU accelerated virtual-reality interaction framework achieves real-time performance under the moderate calculation scale, which is a new effective 3D interaction technique for virtual reality applications. [ABSTRACT FROM AUTHOR]

High dimensional biomedical data contain tens of thousands of features, accurate and effective identification of the core features in these data can be used to assist diagnose related diseases. However, there are often a large number of irrelevant or redundant features in biomedical data, which seriously affect subsequent classification accuracy and machine learning efficiency. To solve this problem, a novel filter feature selection algorithm based on redundant removal (FSBRR) is proposed to classify high dimensional biomedical data in this paper. First of all, two redundant criteria are determined by vertical relevance (the relationship between feature and class attribute) and horizontal relevance (the relationship between feature and feature). Secondly, to quantify redundant criteria, an approximate redundancy feature framework based on mutual information (MI) is defined to remove redundant and irrelevant features. To evaluate the effectiveness of our proposed algorithm, controlled trials based on typical feature selection algorithm are conducted using three different classifiers, and the experimental results indicate that the FSBRR algorithm can effectively reduce the feature dimension and improve the classification accuracy. In addition, an experiment of small sample dataset is designed and conducted in the section of discussion and analysis to clarify the specific implementation process of FSBRR algorithm more clearly. [ABSTRACT FROM AUTHOR]

Phylodynamic modelling, which studies the joint dynamics of epidemiological and evolutionary processes, has made significant progress in recent years due to increasingly available genomic data and advances in statistical modelling. These advances have greatly improved our understanding of transmission dynamics of many important pathogens. Nevertheless, there remains a lack of effective, targetted diagnostic tools for systematically detecting model mis-specification. Development of such tools is essential for model criticism, refinement, and calibration. The idea of utilising latent residuals for model assessment has already been exploited in general spatio-temporal epidemiological settings. Specifically, by proposing appropriately designed non-centered, re-parameterizations of a given epidemiological process, one can construct latent residuals with known sampling distributions which can be used to quantify evidence of model mis-specification. In this paper, we extend this idea to formulate a novel model-diagnostic framework for phylodynamic models. Using simulated examples, we show that our framework may effectively detect a particular form of mis-specification in a phylodynamic model, particularly in the event of superspreading. We also exemplify our approach by applying the framework to a dataset describing a local foot-and-mouth (FMD) outbreak in the UK, eliciting strong evidence against the assumption of no within-host-diversity in the outbreak. We further demonstrate that our framework can facilitate model calibration in real-life scenarios, by proposing a within-host-diversity model which appears to offer a better fit to data than one that assumes no within-host-diversity of FMD virus. [ABSTRACT FROM AUTHOR]

Orienteering problem (OP) is a routing problem, where the aim is to generate a path through set of nodes, which would maximize total score and would not exceed the budget. In this paper, we present an extension of classic OP—Orienteering Problem with Functional Profits (OPFP), where the score of a specific point depends on its characteristics, position in the route, and other points in the route. For solving OPFP, we developed an open-source framework for solving orienteering problems, which utilizes four core components of OP in its modular architecture. Fully-written in Go programming language our framework can be extended for solving different types of tasks with different algorithms; this was demonstrated by implementation of two popular algorithms for OP solving—Ant Colony Optimization and Recursive Greedy Algorithm. Computational efficiency of the framework was shown through solving four well-known OP types: classic Orienteering Problem (OP), Orienteering Problem with Compulsory Vertices (OPCV), Orienteering Problem with Time Windows (OPTW), and Time Dependent Orienteering Problem (TDOP) along with OPFP. Experiments were conducted on a large multi-source dataset for Saint Petersburg, Russia, containing data from Instagram, TripAdvisor, Foursquare and official touristic website. Our framework is able to construct touristic paths for different OP types within few seconds using dataset with thousands of points of interest. [ABSTRACT FROM AUTHOR]

Background and objectives: ECG signal is relatively weak and vulnerable to various noise interferences, such as electromyography. There will be robustness problems when detecting the instantaneous heart rate independently. In some cases, multiple human physiologic parameters are monitored to help in heart rate detection. Methods: In this paper, an algorithm that marks the R-wave peaks with the help of simultaneously recorded continuous blood pressure is proposed and tested on two databases. One database, called the challenge database, is provided by the PhysioNet/Computing in Cardiology Challenge 2014, and the other is the MGH/MF waveform database. Results: The final scores of the proposed algorithm are 97.3% for the challenge database and 96.6% for the MGH/MF waveform database. Conclusions: The experimental results show that this algorithm has high detection accuracy and a relatively strong robustness. [ABSTRACT FROM AUTHOR]

Given a real-world graph, how can we measure relevance scores for ranking and link prediction? Random walk with restart (RWR) provides an excellent measure for this and has been applied to various applications such as friend recommendation, community detection, anomaly detection, etc. However, RWR suffers from two problems: 1) using the same restart probability for all the nodes limits the expressiveness of random walk, and 2) the restart probability needs to be manually chosen for each application without theoretical justification. We have two main contributions in this paper. First, we propose R W E R (RWER), a random walk based measure which improves the expressiveness of random walks by using a distinct restart probability for each node. The improved expressiveness leads to superior accuracy for ranking and link prediction. Second, we propose SR (pervised start for RWER), an algorithm for learning the restart probabilities of RWER from a given graph. SR eliminates the need to heuristically and manually select the restart parameter for RWER. Extensive experiments show that our proposed method provides the best performance for ranking and link prediction tasks. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of energy management of mixed criticality applications in a multi-core partitioned architecture. Instead of focusing on new scheduling algorithms to adjust frequency in order to save energy, we propose a partition to CPU allocation that takes into account not only the different frequencies at which the CPU can operate but the level of criticality of the partitions. The goal is to provide a set of pre-calculated allocations, called profiles, so at run time the system can switch to different modes depending on the battery level. These profiles achieve different levels of energy saving and performance applying different strategies. We also present a comparison in terms of energy saving of the most used bin-packing algorithms for partition allocation. As this is an heuristic, it is not possible to ensure that our results involve the minimum energy consumption. For this reason, we also provide a comparison with a exact method, such as constraint programming. [ABSTRACT FROM AUTHOR]

The purpose of Fuzzy Comprehensive CS-SVR Model (FCCS-SVR) is to evaluate and monitor the health status of a radar equipment and then keep its safe operation. Due to reasons such as few samples, slow changes and the nonlinear structure of data of fault monitoring signal, the health status evaluation of a radar system is quite difficult. By establishing the evaluation index system of a radar, the combination of AHP method and Entropy weight method is studied in this paper. In order to evaluate the value of health status, several optimization algorithms including PSO, GA, BA and CS are used for optimizing the parameters of SVR model. Meanwhile, in order to avoid the problem that the system is at the edge of the state, a radar health assessment method based on the combination of Fuzzy Comprehensive Evaluation and Cuckoo Search-Support Vector Regression (CS-SVR), which is named as Fuzzy Comprehensive CS-SVR (FCCS-SVR), is further proposed. The result of case analysis reflects that the state evaluation of the radar system is realized. The system performance analysis shows that the use of FCCS-SVR evaluation method provides a high recognition rate and can accurately assess the health status of the radar system. [ABSTRACT FROM AUTHOR]

Temperament and Psychological Types can be defined as innate psychological characteristics associated with how we relate with the world, and often influence our study and career choices. Furthermore, understanding these features help us manage conflicts, develop leadership, improve teaching and many other skills. Assigning temperament and psychological types is usually made by filling specific questionnaires. However, it is possible to identify temperamental characteristics from a linguistic and behavioral analysis of social media data from a user. Thus, machine-learning algorithms can be used to learn from a user’s social media data and infer his/her behavioral type. This paper initially provides a brief historical review of theories on temperament and then brings a survey of research aimed at predicting temperament and psychological types from social media data. It follows with the proposal of a framework to predict temperament and psychological types from a linguistic and behavioral analysis of Twitter data. The proposed framework infers temperament types following the David Keirsey’s model, and psychological types based on the MBTI model. Various data modelling and classifiers are used. The results showed that Random Forests with the LIWC technique can predict with 96.46% of accuracy the Artisan temperament, 92.19% the Guardian temperament, 78.68% the Idealist, and 83.82% the Rational temperament. The MBTI results also showed that Random Forests achieved a better performance with an accuracy of 82.05% for the E/I pair, 88.38% for the S/N pair, 80.57% for the T/F pair, and 78.26% for the J/P pair. [ABSTRACT FROM AUTHOR]

An important segment of the reliability-based optimization problems is to get access to the sensitivity derivatives. However, since the failure probability is not a closed-form function of the input variables, the derivatives are not explicitly computable and rather require a full reliability analysis which is computationally expensive. In this paper, a step-by-step algorithm has been presented to calculate the derivatives of the probability of failure and safety index with respect to the input parameters based on the advanced first-order second-moment (AFOSM) reliability method. The proposed algorithm is then implemented in a spreadsheet using Visual Basic for Application (VBA) programming language. Two geotechnical and structural examples are then presented to examine the program and describe the modeling procedure. The robustness of the proposed method is examined using a Gaussian random perturbation. The capability of the proposed method in the calculation of the sensitivity derivatives of the model uncertainty is explained in a separate section. Finally, the proposed model has been compared to the forward finite difference (FFD) method and the results are validated. [ABSTRACT FROM AUTHOR]

This paper highlights the importance of optimized shape index for agricultural management system analysis that utilizes the contiguous bands of hyperspectral data to define the gradient of the spectral curve and improve image classification accuracy. Currently, a number of machine learning methods would resort to using averaged spectral information over wide bandwidths resulting in loss of crucial information available in those contiguous bands. The loss of information could mean a drop in the discriminative power when it comes to land cover classes with comparable spectral responses, as in the case of cultivated fields versus fallow lands. In this study, we proposed and tested three new optimized novel algorithms based on Moment Distance Index (MDI) that characterizes the whole shape of the spectral curve. The image classification tests conducted on two publicly available hyperspectral data sets (AVIRIS 1992 Indian Pine and HYDICE Washington DC Mall images) showed the robustness of the optimized algorithms in terms of classification accuracy. We achieved an overall accuracy of 98% and 99% for AVIRIS and HYDICE, respectively. The optimized indices were also time efficient as it avoided the process of band dimension reduction, such as those implemented by several well-known classifiers. Our results showed the potential of optimized shape indices, specifically the Moment Distance Ratio Right/Left (MDRRL), to discriminate between types of tillage (corn-min and corn-notill) and between grass/pasture and grass/trees, tree and grass under object-based random forest approach. [ABSTRACT FROM AUTHOR]

A new Interpolation based Reversible Data Hiding (IRDH) scheme is reported in this paper. For different applications of an IRDH scheme to the digital image, video, multimedia, big-data and biological data, the embedding capacity requirement usually varies. Disregarding this important consideration, existing IRDH schemes do not offer a better embedding rate-distortion performance for varying size payloads. To attain this varying capacity requirement with our proposed adaptive embedding, we formulate a capacity control parameter and propose to utilize it to determine a minimum set of embeddable bits in a pixel. Additionally, we use a logical (or bit-wise) correlation between the embeddable pixel and estimated versions of an embedded pixel. Thereby, while a higher range between an upper and lower limit of the embedding capacity is maintained, a given capacity requirement within that limit is also attained with a better-embedded image quality. Computational modeling of all new processes of the scheme is presented, and performance of the scheme is evaluated with a set of popular test-images. Experimental results of our proposed scheme compared to the prominent IRDH schemes have recorded a significantly better-embedding rate-distortion performance. [ABSTRACT FROM AUTHOR]

The understanding of human mobility patterns in different transportation modes is an interdisciplinary research field with a direct impact in aspects as varied as urban planning, traffic optimization, sustainability, the reduction of operating costs as well as the mitigation of pollution in urban areas. In this paper, we study the global activity of users in bike-sharing systems operating in the cities of Chicago and New York. For this transportation mode, we explore the temporal and spatial characteristics of the mobility of cyclists. In particular, through the analysis of origin-destination matrices, we characterize the spatial structure of the displacements of users. We apply a mobility model for the global activity of the system that classifies the displacements between stations in local and non-local transitions. In local transitions, cyclists move in a region around each station whereas, in the non-local case, bike users travel with long-range displacements in a similar way to Lévy flights. We reproduce the spatial dynamics by using Monte Carlo simulations. The obtained results are similar to the observed in real data and reveal that the model implemented captures important characteristics of the global spatial dynamics in the systems analyzed. [ABSTRACT FROM AUTHOR]

In this paper, we propose a spatial lag panel smoothing transition regression (SLPSTR) model ty considering spatial correlation of dependent variable in panel smooth transition regression model. This model combines advantages of both smooth transition model and spatial econometric model and can be used to deal with panel data with wide range of heterogeneity and cross-section correlation simultaneously. We also propose a Bayesian estimation approach in which the Metropolis-Hastings algorithm and the method of Gibbs are used for sampling design for SLPSTR model. A simulation study and a real data study are conducted to investigate the performance of the proposed model and the Bayesian estimation approach in practice. The results indicate that our theoretical method is applicable to spatial data with a wide range of spatial structures under finite sample. [ABSTRACT FROM AUTHOR]

The objective of this paper is to propose a lot-sizing methodology for an inventory system that faces time-dependent random demands and that seeks to minimize total cost as a function of order, purchase, holding and shortage costs. A two-stage stochastic programming framework is derived to optimize lot-sizing decisions over a time horizon. To this end, we simulate a demand time-series by using a generalized autoregressive moving average structure. The modeling includes covariates of the demand, which are used as predictors of this. We describe an algorithm that summarizes the methodology and we discuss its computational framework. A case study with unpublished real-world data is presented to illustrate the potential of this methodology. We report that the accuracy of the demand variance estimator improves when a temporal structure is considered, instead of assuming time-independent demand. The methodology is useful in decisions related to inventory logistics management when the demand shows patterns of temporal dependence. [ABSTRACT FROM AUTHOR]

This paper describes a new implementation for calculating Jacobian and its time derivative for robot manipulators in real-time. The estimation of Jacobian is the key in the real-time implementation of kinematics and dynamics of complex planar or spatial robots with fixed as well as floating axes in which the Jacobian form changes with the structure. The proposed method is suitable for such implementations. The new method is based on matrix differential calculus. Unlike the conventional methods, which are based on screw theory, the Jacobian calculation in the proposed approach has been reduced to the inner product of two matrices. Use of the new method to derive linear and angular velocity parts of Jacobian and its time derivative is described in detail. We have demonstrated the method using a two-DOF spatial robot and a hyper-redundant spatial robot. [ABSTRACT FROM AUTHOR]

A new dynamic mode decomposition (DMD) method is introduced for simultaneous system identification and denoising in conjunction with the adoption of an extended Kalman filter algorithm. The present paper explains the extended-Kalman-filter-based DMD (EKFDMD) algorithm which is an online algorithm for dataset for a small number of degree of freedom (DoF). It also illustrates that EKFDMD requires significant numerical resources for many-degree-of-freedom (many-DoF) problems and that the combination with truncated proper orthogonal decomposition (trPOD) helps us to apply the EKFDMD algorithm to many-DoF problems, though it prevents the algorithm from being fully online. The numerical experiments of a noisy dataset with a small number of DoFs illustrate that EKFDMD can estimate eigenvalues better than or as well as the existing algorithms, whereas EKFDMD can also denoise the original dataset online. In particular, EKFDMD performs better than existing algorithms for the case in which system noise is present. The EKFDMD with trPOD, which unfortunately is not fully online, can be successfully applied to many-DoF problems, including a fluid-problem example, and the results reveal the superior performance of system identification and denoising. [ABSTRACT FROM AUTHOR]

Wang et al. proposed a method for obtaining elliptic curves with embedding degree 1 for securing critical infrastructures, and presented several elliptic curves generated by their method with torsion points of 160 bits and 189 bits orders. They also presented some experimental results and claimed that their implementation of an elliptic curve generated with their method is faster than an implementation for embedded devices presented by Bertoni et al. In this paper, we point out that the security and efficiency claims given by Wang et al. are flawed. Specifically, we show that it is possible to solve finite field discrete logarithm problems defined over their elliptic curves in practice. On the elliptic curves with torsion points of 160 bits orders generated by Wang et al., their instances of finite field discrete logarithm problems are solved in around 4 hours by using a standard desktop PC. On the torsion points of 189 bits orders, their instances are solved in around 10 days by using two standard desktop PCs. The hardness of the finite field discrete logarithm problems is one of the most important bases of security; therefore, their elliptic curves should not be used for cryptographic purposes. [ABSTRACT FROM AUTHOR]

For studying cancer and genetic diseases, the issue of identifying high correlation genes from high-dimensional data is an important problem. It is a great challenge to select relevant biomarkers from gene expression data that contains some important correlation structures, and some of the genes can be divided into different groups with a common biological function, chromosomal location or regulation. In this paper, we propose a penalized accelerated failure time model CHR-DE using a non-convex regularization (local search) with differential evolution (global search) in a wrapper-embedded memetic framework. The complex harmonic regularization (CHR) can approximate to the combination and ℓq (1 ≤ q < 2) for selecting biomarkers in group. And differential evolution (DE) is utilized to globally optimize the CHR’s hyperparameters, which make CHR-DE achieve strong capability of selecting groups of genes in high-dimensional biological data. We also developed an efficient path seeking algorithm to optimize this penalized model. The proposed method is evaluated on synthetic and three gene expression datasets: breast cancer, hepatocellular carcinoma and colorectal cancer. The experimental results demonstrate that CHR-DE is a more effective tool for feature selection and learning prediction. [ABSTRACT FROM AUTHOR]

Evidence-informed strategic planning is a top priority in Mental Health (MH) due to the burden associated with this group of disorders and its societal costs. However, MH systems are highly complex, and decision support tools should follow a systems thinking approach that incorporates expert knowledge. The aim of this paper is to introduce a new Decision Support System (DSS) to improve knowledge on the health ecosystem, resource allocation and management in regional MH planning. The Efficient Decision Support-Mental Health (EDeS-MH) is a DSS that integrates an operational model to assess the Relative Technical Efficiency (RTE) of small health areas, a Monte-Carlo simulation engine (that carries out the Monte-Carlo simulation technique), a fuzzy inference engine prototype and basic statistics as well as system stability and entropy indicators. The stability indicator assesses the sensitivity of the model results due to data variations (derived from structural changes). The entropy indicator assesses the inner uncertainty of the results. RTE is multidimensional, that is, it was evaluated by using 15 variable combinations called scenarios. Each scenario, designed by experts in MH planning, has its own meaning based on different types of care. Three management interventions on the MH system in Bizkaia were analysed using key performance indicators of the service availability, placement capacity in day care, health care workforce capacity, and resource utilisation data of hospital and community care. The potential impact of these interventions has been assessed at both local and system levels. The system reacts positively to the proposals by a slight increase in its efficiency and stability (and its corresponding decrease in the entropy). However, depending on the analysed scenario, RTE, stability and entropy statistics can have a positive, neutral or negative behaviour. Using this information, decision makers can design new specific interventions/policies. EDeS-MH has been tested and face-validated in a real management situation in the Bizkaia MH system. [ABSTRACT FROM AUTHOR]

The data collected by mobile methane (CH4) sensors can be used to find natural gas (NG) leaks in urban distribution systems. Extracting actionable insights from the large volumes of data collected by these sensors requires several data processing steps. While these survey platforms are commercially available, the associated data processing software largely constitute a black box due to their proprietary nature. In this paper we describe a step-by-step algorithm for developing leak indications using data from mobile CH4 surveys, providing an under-the-hood look at the choices and challenges associated with data analysis. We also describe how our algorithm has evolved over time, and the data-driven insights that have prompted these changes. Applying our algorithm to data collected in 15 cities produced more than 6100 leak indications and estimates of the leaks’ size. We use these results to characterize the distribution of leak sizes in local NG distribution systems. Mobile surveys are already an effective and necessary tool for managing NG distribution systems, but improvements in the technology and software will continue to increase its value. [ABSTRACT FROM AUTHOR]

In general, the stock prices of the same industry have a similar trend, but those of different industries do not. When investing in stocks of different industries, one should select the optimal model from lots of trading models for each industry because any model may not be suitable for capturing the stock trends of all industries. However, the study has not been carried out at present. In this paper, firstly we select 424 S&P 500 index component stocks (SPICS) and 185 CSI 300 index component stocks (CSICS) as the research objects from 2010 to 2017, divide them into 9 industries such as finance and energy respectively. Secondly, we apply 12 widely used machine learning algorithms to generate stock trading signals in different industries and execute the back-testing based on the trading signals. Thirdly, we use a non-parametric statistical test to evaluate whether there are significant differences among the trading performance evaluation indicators (PEI) of different models in the same industry. Finally, we propose a series of rules to select the optimal models for stock investment of every industry. The analytical results on SPICS and CSICS show that we can find the optimal trading models for each industry based on the statistical tests and the rules. Most importantly, the PEI of the best algorithms can be significantly better than that of the benchmark index and “Buy and Hold” strategy. Therefore, the algorithms can be used for making profits from industry stock trading. [ABSTRACT FROM AUTHOR]

We generalize the notion of λ-superstrings, presented in a previous paper, to the notion of weighted λ-superstrings. This generalization entails an important improvement in the applications to vaccine designs, as it allows epitopes to be weighted by their immunogenicities. Motivated by these potential applications of constructing short weighted λ-superstrings to vaccine design, we approach this problem in two ways. First, we formalize the problem as a combinatorial optimization problem (in fact, as two polynomially equivalent problems) and develop an integer programming (IP) formulation for solving it optimally. Second, we describe a model that also takes into account good pairwise alignments of the obtained superstring with the input strings, and present a genetic algorithm that solves the problem approximately. We apply both algorithms to a set of 169 strings corresponding to the Nef protein taken from patiens infected with HIV-1. In the IP-based algorithm, we take the epitopes and the estimation of the immunogenicities from databases of experimental epitopes. In the genetic algorithm we take as candidate epitopes all 9-mers present in the 169 strings and estimate their immunogenicities using a public bioinformatics tool. Finally, we used several bioinformatic tools to evaluate the properties of the candidates generated by our method, which indicated that we can score high immunogenic λ-superstrings that at the same time present similar conformations to the Nef virus proteins. [ABSTRACT FROM AUTHOR]

Diffusion MRI derives its contrast from MR signal attenuation induced by the movement of water molecules in microstructural environments. Associated with the signal attenuation is the reduction of signal-to-noise ratio (SNR). Methods based on total variation (TV) have shown superior performance in image noise reduction. However, TV denoising can result in stair-casing effects due to the inherent piecewise-constant assumption. In this paper, we propose a tight wavelet frame based approach for edge-preserving denoising of diffusion-weighted (DW) images. Specifically, we employ the unitary extension principle (UEP) to generate frames that are discrete analogues to differential operators of various orders, which will help avoid stair-casing effects. Instead of denoising each DW image separately, we collaboratively denoise groups of DW images acquired with adjacent gradient directions. In addition, we introduce a very efficient method for solving an ℓ0 denoising problem that involves only thresholding and solving a trivial inverse problem. We demonstrate the effectiveness of our method qualitatively and quantitatively using synthetic and real data. [ABSTRACT FROM AUTHOR]

Intravoxel incoherent motion (IVIM) imaging is a magnetic resonance imaging (MRI) technique widely used in clinical applications for various organs. However, IVIM imaging at low b-values is a persistent problem. This paper aims to investigate in a systematic and detailed manner how the number of low b-values influences the estimation of IVIM parameters. To this end, diffusion-weighted (DW) data with different low b-values were simulated to get insight into the distributions of subsequent IVIM parameters. Then, in vivo DW data with different numbers of low b-values and different number of excitations (NEX) were acquired. Finally, least-squares (LSQ) and Bayesian shrinkage prior (BSP) fitting methods were implemented to estimate IVIM parameters. The influence of the number of low b-values on IVIM parameters was analyzed in terms of relative error (RE) and structural similarity (SSIM). The results showed that the influence of the number of low b-values on IVIM parameters is variable. LSQ is more dependent on the number of low b-values than BSP, but the latter is more sensitive to noise. [ABSTRACT FROM AUTHOR]

To flexibly meet users’ demands in cloud computing, it is essential for providers to establish the efficient virtual mapping in datacenters. Accordingly, virtualization has become a key aspect of cloud computing. It is possible to consolidate resources based on the single objective of reducing energy consumption. However, it is challenging for the provider to consolidate resources efficiently based on a multiobjective optimization strategy. In this paper, we present a novel migration algorithm to consolidate resources adaptively using a two-level scheduling algorithm. First, we propose the grey relational analysis (GRA) and technique for order preference by similarity to the ideal solution (TOPSIS) policy to simultaneously determine the hotspots by the main selected factors, including the CPU and the memory. Second, a two-level hybrid heuristic algorithm is designed to consolidate resources in order to reduce costs and energy consumption, mainly depending on the PSO and ACO algorithms. The improved PSO can determine the migrating VMs quickly, and the proposed ACO can locate the positions. Extensive experiments demonstrate that the two-level scheduling algorithm performs the consolidation strategy efficiently during the dynamic allocation process. [ABSTRACT FROM AUTHOR]