Search

The safety of highly aggregated tourist crowds is a challenging and important issue. This paper not only provided a comprehensive analysis of the accidents of highly aggregated tourist crowds but also determined the occurrence mechanism and coping paths. Based on the analysis of multiple cases, we found that the variable status of highly aggregated tourist crowds was the result of the interaction of three main elements: multisource pressure, state mutations and management responses. A series of factors interact and result in accidents, and the lack of a management response or a low-quality management response is the root cause of such accidents. A high-quality management response is a basic safety precaution for highly aggregated tourist crowds. Therefore, forming a virtuous circle of multisource pressure, state mutations and management responses is an effective path for coping with accidents. [ABSTRACT FROM AUTHOR]

Past research on the process of extinguishing a fire typically used a traditional linear water jet falling point model and the results ignored external factors, such as environmental conditions and the status of the fire engine, even though the water jet falling point location prediction was often associated with these parameters and showed a nonlinear relationship. This paper constructed a BP (Back Propagation) neural network model. The fire gun nozzle characteristics were included as model inputs, and the water discharge point coordinates were the model outputs; thus, the model could precisely predict the water discharge point with small error and high precision to determine an accurate firing position and allow for the timely adjustment of the spray gun. To improve the slow convergence and local optimality problems of the BP neural network (BPNN), this paper further used a genetic algorithm to optimize the BPNN (GA-BPNN). The BPNN can be used to optimize the weights in the network to train them for global optimization. A genetic algorithm was introduced into the neural network approach, and the water jet landing prediction model was further improved. The simulation results showed that the prediction accuracy of the GA-BP model was better than that of the BPNN alone. The established model can accurately predict the location of the water jet, making the prediction results more useful for firefighters. [ABSTRACT FROM AUTHOR]

Tropical tuna support some of the largest and most valuable artisanal and industrial fisheries worldwide, conducted to a large degree with Fish Aggregating Devices (FADs). Yellowfin, bigeye and skipjack are the main tuna species found in mixed aggregations around FADs and they are simultaneously encircled by the purse seining operation. One of the key challenges that purse seine fleets fishing with drifting FADs face in all oceans is to be able to target species in healthy condition such as skipjack, while reducing impacts on bigeye and yellowfin in areas where there is a need to reduce fishing pressure on these species. The present paper explores a technical solution for selective fishing at FADs by means of acoustic equipment used by purse seiners. Acoustic frequency response of skipjack and bigeye tuna were determined at 38, 120 and 200 kHz. Skipjack showed stronger response at higher frequencies. On the contrary, bigeye showed stronger responses at lower frequencies. The robust pattern shown in frequency responses of the two species demonstrates the potential to predict abundance and species proportions based on purely acoustic measures. The paper also addresses the conditions that need to be met to successfully apply this technology for selective fishing as well as other uses of direct acoustic observations to support tuna conservation. [ABSTRACT FROM AUTHOR]

An extreme learning machine (ELM) is a novel training method for single-hidden layer feedforward neural networks (SLFNs) in which the hidden nodes are randomly assigned and fixed without iterative tuning. ELMs have earned widespread global interest due to their fast learning speed, satisfactory generalization ability and ease of implementation. In this paper, we extend this theory to hypercomplex space and attempt to simultaneously consider multisource information using a hypercomplex representation. To illustrate the performance of the proposed hypercomplex extreme learning machine (HELM), we have applied this scheme to the task of multispectral palmprint recognition. Images from different spectral bands are utilized to construct the hypercomplex space. Extensive experiments conducted on the PolyU and CASIA multispectral databases demonstrate that the HELM scheme can achieve competitive results. The source code together with datasets involved in this paper can be available for free download at . [ABSTRACT FROM AUTHOR]

Computational modeling of engineered gene circuits is an important while challenged task in systems biology. In order to describe and predict the response behaviors of genetic circuits using reliable model parameters, this paper applies an optimal experimental design(OED) method to obtain input signals. In order to obtain informative observations, this study focuses on maximizing Fisher information matrix(FIM)-based optimal criteria and to provide optimal inputs. Furthermore, this paper designs a two-stage optimization with the modified E-optimal criteria and applies harmony search(HS)-based OED algorithm to minimize estimation errors. The proposed optimal identification methodology involves estimation errors and the sample size to pursue a trade-off between estimation accuracy and measurement cost in modeling gene networks. The designed cost function takes two major factors into account, in which experimental costs are proportional to the number of time points. Experiments select two types of synthetic genetic networks to validate the effectiveness of the proposed HS-OED approach. Identification outcomes and analysis indicate the proposed HS-OED method outperforms two candidate OED approaches, with reduced computational effort. [ABSTRACT FROM AUTHOR]

This paper presents a method to reduce a set of n 2D points to a smaller set of s 2D points with the property that the convex hull on the smaller set is the same as the convex hull of the original bigger set. The paper shows, experimentally, that such reduction accelerates computations; the time it takes to reduce from n down to s points plus the time of computing the convex hull on the s points is less than the time to compute the convex hull on the original set of n points. The method accepts 2D points expressed as real numbers and thus extends our previous method that required points as integers. The method achieves a percentage of reduction of points of over 90% in a collections of four datasets. This amount of reduction provides speedup factors of at least two for various common convex hull algorithms. Theoretically, the reduction method executes in time within O(n) and thus is suitable for preprocessing 2D data before computing the convex hull by any known algorithm. [ABSTRACT FROM AUTHOR]

This paper formulates a support vector machine with quantile hyper-spheres (QHSVM) for pattern classification. The idea of QHSVM is to build two quantile hyper-spheres with the same center for positive or negative training samples. Every quantile hyper-sphere is constructed by using pinball loss instead of hinge loss, which makes the new classification model be insensitive to noise, especially the feature noise around the decision boundary. Moreover, the robustness and generalization of QHSVM are strengthened through maximizing the margin between two quantile hyper-spheres, maximizing the inner-class clustering of samples and optimizing the independent quadratic programming for a target class. Besides that, this paper proposes a novel local center-based density estimation method. Based on it, ρ-QHSVM with surrounding and clustering samples is given. Under the premise of high accuracy, the execution speed of ρ-QHSVM can be adjusted. The experimental results in artificial, benchmark and strip steel surface defects datasets show that the QHSVM model has distinct advantages in accuracy and the ρ-QHSVM model is fit for large-scale datasets. [ABSTRACT FROM AUTHOR]

Genetic maps order genetic markers along chromosomes. They are, for instance, extensively used in marker-assisted selection to accelerate breeding programs. Even for the same species, people often have to deal with several alternative maps obtained using different ordering methods or different datasets, e.g. resulting from different segregating populations. Having efficient tools to identify the consistency and discrepancy of alternative maps is thus essential to facilitate genetic map comparisons. We propose to encode genetic maps by bucket order, a kind of order, which takes into account the blurred parts of the marker order while being an efficient data structure to achieve low complexity algorithms. The main result of this paper is an O(n log(n)) procedure to identify the largest agreements between two bucket orders of n elements, their Longest Common Subsequence (LCS), providing an efficient solution to highlight discrepancies between two genetic maps. The LCS of two maps, being the largest set of their collinear markers, is used as a building block to compute pairwise map congruence, to visually emphasize maker collinearity and in some scaffolding methods relying on genetic maps to improve genome assembly. As the LCS computation is a key subroutine of all these genetic map related tools, replacing the current LCS subroutine of those methods by ours –to do the exact same work but faster– could significantly speed up those methods without changing their accuracy. To ease such transition we provide all required algorithmic details in this self contained paper as well as an R package implementing them, named LCSLCIS, which is freely available at: . [ABSTRACT FROM AUTHOR]

Diabetic retinopathy (DR) is a disease which is widely diagnosed using (colour fundus) images. Efficiency and accuracy are critical in diagnosing DR as lack of timely intervention can lead to irreversible visual impairment. In this paper, we examine strategies for scrutinizing images which affect diagnostic performance of medical practitioners via an eye-tracking study. A total of 56 subjects with 0 to 18 years of experience participated in the study. Every subject was asked to detect DR from 40 images. The findings indicate that practitioners use mainly two types of strategies characterized by either higher dwell duration or longer track length. The main findings of the study are that higher dwell-based strategy led to higher average accuracy (> 85%) in diagnosis, irrespective of the expertise of practitioner; whereas, the average obtained accuracy with a long-track length-based strategy was dependent on the expertise of the practitioner. In the second part of the paper, we use the experimental findings to recommend a scanning strategy for fast and accurate diagnosis of DR that can be potentially used by image readers. This is derived by combining the eye-tracking gaze maps of medical experts in a novel manner based on a set of rules. This strategy requires scrutiny of images in a manner which is consistent with spatial preferences found in human perception in general and in the domain of fundus images in particular. The Levenshtein distance-based assessment of gaze patterns also establish the effectiveness of the derived scanning pattern and is thus recommended for image readers. [ABSTRACT FROM AUTHOR]

This paper develops a new machine vision framework for efficient detection and classification of manufacturing defects in metal boxes. Previous techniques, which are based on either visual inspection or on hand-crafted features, are both inaccurate and time consuming. In this paper, we show that by using autoencoder deep neural network (DNN) architecture, we are able to not only classify manufacturing defects, but also localize them with high accuracy. Compared to traditional techniques, DNNs are able to learn, in a supervised manner, the visual features that achieve the best performance. Our experiments on a database of real images demonstrate that our approach overcomes the state-of-the-art while remaining computationally competitive. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is widely used in maximum power point tracking (MPPT) of photovoltaic (PV) energy systems. Nevertheless, this technique suffers from two main problems in the case of partial shading conditions (PSCs). The first problem is that PSO is a time invariant optimization technique that cannot follow the dynamic global peak (GP) under time variant shading patterns (SPs) and sticks to the first GP that occurs at the beginning. This problem can be solved by dispersing the PSO particles using two new techniques introduced in this paper. The two new proposed PSO re-initialization techniques are to disperse the particles upon the SP changes and the other one is upon a predefined time (PDT). The second problem is regarding the high oscillations around steady state, which can be solved by using fuzzy logic controller (FLC) to fine-tune the output power and voltage from the PV system. The new contribution of this paper is the hybrid PSO-FLC with two PSO particles dispersing techniques that is able to solve the two previous mentioned problems effectively and improve the performance of the PV system in both normal and PSCs. A detailed list of comparisons between hybrid PSO-FLC and original PSO using the two proposed methodologies are achieved. The results prove the superior performance of hybrid PSO-FLC compared to PSO in terms of efficiency, accuracy, oscillations reduction around steady state and soft tuning of the GP tracked. [ABSTRACT FROM AUTHOR]

Traffic congestion in freeway network is a prevalent transportation problem and leads to a strong degradation of freeway network facilities. This paper proposes a new coordinated optimization approach for freeway network, aiming to relieve the traffic congestion in freeway network equipped with the coordinated traffic controllers. The challenge is how to solve the problem between the traffic control goals of each path and those of the network. In this paper, the bi-level programming theory is used to address this problem. More exactly, in the path level, the optimal control model is designed to relieve congestion in each path of the test network. Furthermore, in the network level, the optimal model considers the traffic equilibrium and cost optimization. The efficiency of the proposed approach is tested on a well-known traffic network calibrated by the field test data of freeway network. The results show that the proposed approach has positive effects in balancing traffic load and improving the service level of freeway networks. [ABSTRACT FROM AUTHOR]

Outlier removal is a fundamental data processing task to ensure the quality of scanned point cloud data (PCD), which is becoming increasing important in industrial applications and reverse engineering. Acquired scanned PCD is usually noisy, sparse and temporarily incoherent. Thus the processing of scanned data is typically an ill-posed problem. In the paper, we present a simple and effective method based on two geometrical characteristics constraints to trim the noisy points. One of the geometrical characteristics is the local density information and another is the deviation from the local fitting plane. The local density based method provides a preprocessing step, which could remove those sparse outlier and isolated outlier. The non-isolated outlier removal in this paper depends on a local projection method, which placing those points onto objects. There is no doubt that the deviation of any point from the local fitting plane should be a criterion to reduce the noisy points. The experimental results demonstrate the ability to remove the noisy point from various man-made objects consisting of complex outlier. [ABSTRACT FROM AUTHOR]

In this paper we compare systematically the most promising neuroevolutionary methods and two new original methods on the double-pole balancing problem with respect to: the ability to discover solutions that are robust to variations of the environment, the speed with which such solutions are found, and the ability to scale-up to more complex versions of the problem. The results indicate that the two original methods introduced in this paper and the Exponential Natural Evolutionary Strategy method largely outperform the other methods with respect to all considered criteria. The results collected in different experimental conditions also reveal the importance of regulating the selective pressure and the importance of exposing evolving agents to variable environmental conditions. The data collected and the results of the comparisons are used to identify the most effective methods and the most promising research directions. [ABSTRACT FROM AUTHOR]

This paper studies the drive-response synchronization for quaternion-valued shunting inhibitory cellular neural networks (QVSICNNs) with mixed delays. First, QVSICNN is decomposed into an equivalent real-valued system in order to avoid the non-commutativity of the multiplicity. Then, the existence of almost periodic solutions is obtained based on the Banach fixed point theorem. An novel state-feedback controller is designed to ensure the global exponential almost periodic synchronization. At the end of the paper, an example is given to illustrate the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

Aiming to solve the safety problems of high-speed railway operation and management, one new method is urgently needed to construct on the basis of the rough set theory and the uncertainty measurement theory. The method should carefully consider every factor of high-speed railway operation that realizes the measurement indexes of its safety operation. After analyzing the factors that influence high-speed railway safety operation in detail, a rough measurement model is finally constructed to describe the operation process. Based on the above considerations, this paper redistricts the safety influence factors of high-speed railway operation as 16 measurement indexes which include staff index, vehicle index, equipment index and environment. And the paper also provides another reasonable and effective theoretical method to solve the safety problems of multiple attribute measurement in high-speed railway operation. As while as analyzing the operation data of 10 pivotal railway lines in China, this paper respectively uses the rough set-based measurement model and value function model (one model for calculating the safety value) for calculating the operation safety value. The calculation result shows that the curve of safety value with the proposed method has smaller error and greater stability than the value function method’s, which verifies the feasibility and effectiveness. [ABSTRACT FROM AUTHOR]

In business replenishment, discount offers of multi-item may either provide different discount schedules with a single discount type, or provide schedules with multiple discount types. The paper investigates the joint effects of multiple discount schemes on the decisions of multi-item joint replenishment. In this paper, a joint replenishment problem (JRP) model, considering three discount (all-unit discount, incremental discount, total volume discount) offers simultaneously, is constructed to determine the basic cycle time and joint replenishment frequencies of multi-item. To solve the proposed problem, a heuristic algorithm is proposed to find the optimal solutions and the corresponding total cost of the JRP model. Numerical experiment is performed to test the algorithm and the computational results of JRPs under different discount combinations show different significance in the replenishment cost reduction. [ABSTRACT FROM AUTHOR]

China’s fast economic growth contributes to the rapid development of its urbanization process, and also renders a series of industrial accidents, which often cause loss of life, damage to property and environment, thus requiring the associated risk analysis and safety control measures to be implemented in advance. However, incompleteness of historical failure data before the occurrence of accidents makes it difficult to use traditional risk analysis approaches such as probabilistic risk analysis in many cases. This paper aims to develop a new methodology capable of assessing regional industrial safety (RIS) in an uncertain environment. A hierarchical structure for modelling the risks influencing RIS is first constructed. The hybrid of evidential reasoning (ER) and Analytical Hierarchy Process (AHP) is then used to assess the risks in a complementary way, in which AHP is hired to evaluate the weight of each risk factor and ER is employed to synthesise the safety evaluations of the investigated region(s) against the risk factors from the bottom to the top level in the hierarchy. The successful application of the hybrid approach in a real case analysis of RIS in several major districts of Beijing (capital of China) demonstrates its feasibility as well as provides risk analysts and safety engineers with useful insights on effective solutions to comprehensive risk assessment of RIS in metropolitan cities. The contribution of this paper is made by the findings on the comparison of risk levels of RIS at different regions against various risk factors so that best practices from the good performer(s) can be used to improve the safety of the others. [ABSTRACT FROM AUTHOR]

This paper presents an integrated hybrid optimization algorithm for training the radial basis function neural network (RBF NN). Training of neural networks is still a challenging exercise in machine learning domain. Traditional training algorithms in general suffer and trap in local optima and lead to premature convergence, which makes them ineffective when applied for datasets with diverse features. Training algorithms based on evolutionary computations are becoming popular due to their robust nature in overcoming the drawbacks of the traditional algorithms. Accordingly, this paper proposes a hybrid training procedure with differential search (DS) algorithm functionally integrated with the particle swarm optimization (PSO). To surmount the local trapping of the search procedure, a new population initialization scheme is proposed using Logistic chaotic sequence, which enhances the population diversity and aid the search capability. To demonstrate the effectiveness of the proposed RBF hybrid training algorithm, experimental analysis on publicly available 7 benchmark datasets are performed. Subsequently, experiments were conducted on a practical application case for wind speed prediction to expound the superiority of the proposed RBF training algorithm in terms of prediction accuracy. [ABSTRACT FROM AUTHOR]

Public transport (PT) is a key element in most major cities around the world. With the development of smartphones, available journey planning information is becoming an integral part of the PT system. Each traveler has specific preferences when undertaking a trip, and these preferences can also be reflected on the smartphone. This paper considers transit assignment in urban public-transport networks in which the passengers receive smartphone-based information containing elements that might influence the travel decisions in relation to line loads, as well as passenger benefits, and the paper discusses the transition from the current widespread choosing approach to a personalized decision-making approach based on smartphone information. The approach associated with smartphone guidance that considers passengers’ preference on travel time, waiting time and transfer is proposed in the process of obtaining his/her preferred route from the potential travel routes generated by the Deep First Search (DFS) method. Two other approaches, based on the scenarios reflecting reality, include passengers with access to no real time information, and passengers that only have access to the arrival time at the platform are used as comparisons. For illustration, the same network proposed by Spiess and Florian is utilized on the experiments in an agent-based model. Two experiments are conducted respectively according to whether each passenger’s choosing method is consistent. As expected, the results in the first experiment showed that the travel for consistent passengers with smartphone guidance was clearly shorter and that it can reduce travel time exceeding 15% and weighted cost exceeding 20%, and the average saved time approximated 3.88 minutes per passenger. The second experiment presented that travel cost, as well as cost savings, gradually decreased by employing smartphone guidance, and the maximum cost savings accounted for 14.2% of the total weighted cost. [ABSTRACT FROM AUTHOR]

Miniaturization of computer hardware and the demand for network capable devices has resulted in the emergence of a new class of technology called wearable computing. Wearable devices have many purposes like lifestyle support, health monitoring, fitness monitoring, entertainment, industrial uses, and gaming. Wearable devices are hurriedly being marketed in an attempt to capture an emerging market. Owing to this, some devices do not adequately address the need for security. To enable virtualization and connectivity wearable devices sense and transmit data, therefore it is essential that the device, its data and the user are protected. In this paper the use of novel Integrated Circuit Metric (ICMetric) technology for the provision of security in wearable devices has been suggested. ICMetric technology uses the features of a device to generate an identification which is then used for the provision of cryptographic services. This paper explores how a device ICMetric can be generated by using the accelerometer and gyroscope sensor. Since wearable devices often operate in a group setting the work also focuses on generating a group identification which is then used to deliver services like authentication, confidentiality, secure admission and symmetric key generation. Experiment and simulation results prove that the scheme offers high levels of security without compromising on resource demands. [ABSTRACT FROM AUTHOR]

Pruning is applied in order to combat over-fitting problem where the tree is pruned back with the goal of identifying decision tree with the lowest error rate on previously unobserved instances, breaking ties in favour of smaller trees with high accuracy. In this paper, pruning with Bayes minimum risk is introduced for estimating the risk-rate. This method proceeds in a bottom-up fashion converting a parent node of a subtree to a leaf node if the estimated risk-rate of the parent node for that subtree is less than the risk-rates of its leaf. This paper proposes a post-pruning method that considers various evaluation standards such as attribute selection, accuracy, tree complexity, and time taken to prune the tree, precision/recall scores, TP/FN rates and area under ROC. The experimental results show that the proposed method produces better classification accuracy and its complexity is not much different than the complexities of reduced-error pruning and minimum-error pruning approaches. The experiments also demonstrate that the proposed method shows satisfactory performance in terms of precision score, recall score, TP rate, FP rate and area under ROC. [ABSTRACT FROM AUTHOR]

Machine Learning (ML) methods have been proposed in the academic literature as alternatives to statistical ones for time series forecasting. Yet, scant evidence is available about their relative performance in terms of accuracy and computational requirements. The purpose of this paper is to evaluate such performance across multiple forecasting horizons using a large subset of 1045 monthly time series used in the M3 Competition. After comparing the post-sample accuracy of popular ML methods with that of eight traditional statistical ones, we found that the former are dominated across both accuracy measures used and for all forecasting horizons examined. Moreover, we observed that their computational requirements are considerably greater than those of statistical methods. The paper discusses the results, explains why the accuracy of ML models is below that of statistical ones and proposes some possible ways forward. The empirical results found in our research stress the need for objective and unbiased ways to test the performance of forecasting methods that can be achieved through sizable and open competitions allowing meaningful comparisons and definite conclusions. [ABSTRACT FROM AUTHOR]

Human-computer interface systems whose input is based on eye movements can serve as a means of communication for patients with locked-in syndrome. Eye-writing is one such system; users can input characters by moving their eyes to follow the lines of the strokes corresponding to characters. Although this input method makes it easy for patients to get started because of their familiarity with handwriting, existing eye-writing systems suffer from slow input rates because they require a pause between input characters to simplify the automatic recognition process. In this paper, we propose a continuous eye-writing recognition system that achieves a rapid input rate because it accepts characters eye-written continuously, with no pauses. For recognition purposes, the proposed system first detects eye movements using electrooculography (EOG), and then a hidden Markov model (HMM) is applied to model the EOG signals and recognize the eye-written characters. Additionally, this paper investigates an EOG adaptation that uses a deep neural network (DNN)-based HMM. Experiments with six participants showed an average input speed of 27.9 character/min using Japanese Katakana as the input target characters. A Katakana character-recognition error rate of only 5.0% was achieved using 13.8 minutes of adaptation data. [ABSTRACT FROM AUTHOR]

In this paper, we will investigate the effect of diffusion, which is ubiquitous in nature, on the immune system using a reaction-diffusion model in order to understand the dynamical behavior of complex patterns and control the dynamics of different patterns. Through control theory and linear stability analysis of local equilibrium, we obtain the optimal condition under which the system loses stability and a Turing pattern occurs. By combining mathematical analysis and numerical simulation, we show the possible patterns and how these patterns evolve. In addition, we establish a bridge between the complex patterns and the biological mechanism using the results from a previous study in Nature Cell Biology. The results in this paper can help us better understand the biological significance of the immune system. [ABSTRACT FROM AUTHOR]

This paper extends the observations presented in the previously published work on the afterhyperpolarization (AHP) duration changes in motoneurones (MNs) on the paretic (more affected) side of 11 post-stroke patients by the same analysis on the non-paretic (less-affected) side. The estimated AHP duration for patients’ MNs supplying more-affected muscles was significantly longer than control values and the elongation decreased with patient age and disorder duration. For MNs supplying less-affected muscles, dependency of AHP duration on age was closer to the control data, but the scatter was substantially bigger. However, the AHP duration estimate of less-affected MNs tended to be longer than that of controls in the short time elapsed since the stroke, and shorter than controls in the long time. Our results thus suggest that the spinal MNs on both sides respond to the cerebral stroke rapidly with prolongation of AHP duration, which tends to normalize with time, in line with functional recovery. This suggestion is in concert with the published research on post-stroke changes in brain hemispheres. To our knowledge, these dependencies have never been investigated before. Since the number of our data was limited, the observed trends should be verified in a larger sample of patients and such a verification could take into account the suggestions for data analysis that we provide in this paper. Our data are in line with the earlier published research on MN firing characteristics post-stroke and support the conclusion that the MUs of the muscles at the non-paretic side are also affected and cannot be considered a suitable control for the MUs on the paretic side. [ABSTRACT FROM AUTHOR]

Traffic surveillance systems are interesting to many researchers to improve the traffic control and reduce the risk caused by accidents. In this area, many published works are only concerned about vehicle detection in normal conditions. The camera may vibrate due to wind or bridge movement. Detection and tracking of vehicles is a very difficult task when we have bad weather conditions in winter (snowy, rainy, windy, etc.), dusty weather in arid and semi-arid regions, at night, etc. Also, it is very important to consider speed of vehicles in the complicated weather condition. In this paper, we improved our method to track and count vehicles in dusty weather with vibrating camera. For this purpose, we used a background subtraction based strategy mixed with an extra processing to segment vehicles. In this paper, the extra processing included the analysis of the headlight size, location, and area. In our work, tracking was done between consecutive frames via a generalized particle filter to detect the vehicle and pair the headlights using the connected component analysis. So, vehicle counting was performed based on the pairing result, with Centroid of each blob we calculated distance between two frames by simple formula and hence dividing it by the time between two frames obtained from the video. Our proposed method was tested on several video surveillance records in different conditions such as dusty or foggy weather, vibrating camera, and in roads with medium-level traffic volumes. The results showed that the new proposed method performed better than our previously published method and other methods, including the Kalman filter or Gaussian model, in different traffic conditions. [ABSTRACT FROM AUTHOR]

Publication metadata help deliver rich analyses of scholarly communication. However, research concepts and ideas are more effectively expressed through unstructured fields such as full texts. Thus, the goals of this paper are to employ a full-text enabled method to extract terms relevant to disciplinary vocabularies, and through them, to understand the relationships between disciplines. This paper uses an efficient, domain-independent term extraction method to extract disciplinary vocabularies from a large multidisciplinary corpus of PLoS ONE publications. It finds a power-law pattern in the frequency distributions of terms present in each discipline, indicating a semantic richness potentially sufficient for further study and advanced analysis. The salient relationships amongst these vocabularies become apparent in application of a principal component analysis. For example, Mathematics and Computer and Information Sciences were found to have similar vocabulary use patterns along with Engineering and Physics; while Chemistry and the Social Sciences were found to exhibit contrasting vocabulary use patterns along with the Earth Sciences and Chemistry. These results have implications to studies of scholarly communication as scholars attempt to identify the epistemological cultures of disciplines, and as a full text-based methodology could lead to machine learning applications in the automated classification of scholarly work according to disciplinary vocabularies. [ABSTRACT FROM AUTHOR]

In developing nations, many expanding cities are facing challenges that result from the overwhelming numbers of people and vehicles. Collecting real-time, reliable and precise traffic flow information is crucial for urban traffic management. The main purpose of this paper is to develop an adaptive model that can assess the real-time vehicle counts on urban roads using computer vision technologies. This paper proposes an automatic real-time background update algorithm for vehicle detection and an adaptive pattern for vehicle counting based on the virtual loop and detection line methods. In addition, a new robust detection method is introduced to monitor the real-time traffic congestion state of road section. A prototype system has been developed and installed on an urban road for testing. The results show that the system is robust, with a real-time counting accuracy exceeding 99% in most field scenarios. [ABSTRACT FROM AUTHOR]

Vagus nerve stimulation (VNS) is an established adjunctive therapy for pharmacologically refractory epilepsy and depression and is currently in active clinical research for other applications. In current clinical studies, VNS is delivered in an open-loop approach, where VNS parameters are defined during a manual titration phase. However, the physiological response to a given VNS configuration shows significant inter and intra-patient variability and may significantly evolve through time. VNS closed-loop approaches, allowing for the optimization of the therapy in an adaptive manner, may be necessary to improve efficacy while reducing side effects. This paper proposes a generic, closed-loop control VNS system that is able to optimize a number of VNS parameters in an adaptive fashion, in order to keep a control variable within a specified range. Although the proposed control method is completely generic, an example application using the cardiac beat to beat interval (RR) as control variable will be developed in this paper. The proposed controller is based on a state transition model (STM) that can be configured using a partially or a fully-connected architecture, different model orders and different state-transition algorithms. The controller is applied to the adaptive regulation of heart rate and evaluated on 6 sheep, for 13 different targets, using partially-connected STM with 10 states. Also, partially and fully-connected STM defined by 30 states were applied to 7 other sheep for the same 10 targets. Results illustrate the interest of the proposed fully-connected STM and the feasibility of integrating this control system into an implantable neuromodulator. [ABSTRACT FROM AUTHOR]

This paper aims to optimize a desirable fare structure for the public transit service along a bus-subway corridor with the consideration of those factors related to equity in trip, including travel distance and comfort level. The travel distance factor is represented by the distance-based fare strategy, which is an existing differential strategy. The comfort level one is considered in the area-based fare strategy which is a new differential strategy defined in this paper. Both factors are referred to by the combined fare strategy which is composed of distance-based and area-based fare strategies. The flat fare strategy is applied to determine a reference level of social welfare and obtain the general passenger flow along transit lines, which is used to divide areas or zones along the corridor. This problem is formulated as a bi-level program, of which the upper level maximizes the social welfare and the lower level capturing traveler choice behavior is a variable-demand stochastic user equilibrium assignment model. A genetic algorithm is applied to solve the bi-level program while the method of successive averages is adopted to solve the lower-level model. A series of numerical experiments are carried out to illustrate the performance of the models and solution methods. Numerical results indicate that all three differential fare strategies play a better role in enhancing the social welfare than the flat fare strategy and that the fare structure under the combined fare strategy generates the highest social welfare and the largest resulting passenger demand, which implies that the more equity factors a differential fare strategy involves the more desirable fare structure the strategy has. [ABSTRACT FROM AUTHOR]

In this paper, new Network Data Envelopment Analysis (NDEA) models are developed to evaluate the efficiency of regional electricity power networks. The primary objective of this paper is to consider perturbation in data and develop new NDEA models based on the adaptation of robust optimization methodology. Furthermore, in this paper, the efficiency of the entire networks of electricity power, involving generation, transmission and distribution stages is measured. While DEA has been widely used to evaluate the efficiency of the components of electricity power networks during the past two decades, there is no study to evaluate the efficiency of the electricity power networks as a whole. The proposed models are applied to evaluate the efficiency of 16 regional electricity power networks in Iran and the effect of data uncertainty is also investigated. The results are compared with the traditional network DEA and parametric SFA methods. Validity and verification of the proposed models are also investigated. The preliminary results indicate that the proposed models were more reliable than the traditional Network DEA model. [ABSTRACT FROM AUTHOR]

Urban spaces have a great impact on how people’s emotion and behaviour. There are number of factors that impact our brain responses to a space. This paper presents a novel urban place recommendation approach, that is based on modelling in-situ EEG data. The research investigations leverages on newly affordable Electroencephalogram (EEG) headsets, which has the capability to sense mental states such as meditation and attention levels. These emerging devices have been utilized in understanding how human brains are affected by the surrounding built environments and natural spaces. In this paper, mobile EEG headsets have been used to detect mental states at different types of urban places. By analysing and modelling brain activity data, we were able to classify three different places according to the mental state signature of the users, and create an association map to guide and recommend people to therapeutic places that lessen brain fatigue and increase mental rejuvenation. Our mental states classifier has achieved accuracy of (%90.8). NeuroPlace breaks new ground not only as a mobile ubiquitous brain monitoring system for urban computing, but also as a system that can advise urban planners on the impact of specific urban planning policies and structures. We present and discuss the challenges in making our initial prototype more practical, robust, and reliable as part of our on-going research. In addition, we present some enabling applications using the proposed architecture. [ABSTRACT FROM AUTHOR]

There is a vivid research on securely deliver a secret message by using a data hiding technique in digital images. However, most existing solutions of data-hiding need to encrypt secret data first, and embed the encrypt message into cover image, which is not promising any security once the embedding algorithm is leaked. In this paper, an efficient and adaptive data hiding scheme is presented which is based on a new reference matrix named secure reference matrix. The scheme is flexible enough to meet different data hiding capacities and image quality as needed, and we allow the reference matrix to be more secure since it is randomly generated each time and make it much harder for being attack with exhaustive manner by extending the possible solution. We give the detail protocol for our scheme and provide the practical test and performance analysis. Experimental results show that our scheme has a better flexibility and efficiency in embedding process, and the average value of Peak Signal to Noise Ratio (PSNR) for the stego-images which are generated by our scheme have a higher visual quality for different embedding capacities, and our scheme is more efficient compared with related work. [ABSTRACT FROM AUTHOR]

This paper presents the Hybrid Scalable-Minimized-Butterfly-Fat-Tree (H-SMBFT) topology for on-chip communication. Main aspects of this work are the description of the architectural design and the characteristics as well as a comparative analysis against two established indirect topologies namely Butterfly-Fat-Tree (BFT) and Scalable-Minimized-Butterfly-Fat-Tree (SMBFT). Simulation results demonstrate that the proposed topology outperforms its predecessors in terms of performance, area and power dissipation. Specifically, it improves the link interconnectivity between routing levels, such that the number of required links isreduced. This results into reduced router complexity and shortened routing paths between any pair of communicating nodes in the network. Moreover, simulation results under synthetic as well as real-world embedded applications workloads reveal that H-SMBFT can reduce the average latency by up-to35.63% and 17.36% compared to BFT and SMBFT, respectively. In addition, the power dissipation of the network can be reduced by up-to33.82% and 19.45%, while energy consumption can be improved byup-to32.91% and 16.83% compared to BFT and SMBFT, respectively. [ABSTRACT FROM AUTHOR]

The solution to the job shop scheduling problem (JSSP) is of great significance for improving resource utilization and production efficiency of enterprises. In this paper, in view of its non-deterministic polynomial properties, a multi-agent genetic algorithm based on tabu search (MAGATS) is proposed to solve JSSPs under makespan constraints. Firstly, a multi-agent genetic algorithm (MAGA) is proposed. During the process, a multi-agent grid environment is constructed based on characteristics of multi-agent systems and genetic algorithm (GA), and a corresponding neighbor interaction operator, a mutation operator based on neighborhood structure and a self-learning operator are designed. Then, combining tabu search algorithm with a MAGA, the algorithm MAGATS are presented. Finally, 43 benchmark instances are tested with the new algorithm. Compared with four other algorithms, the optimization performance of it is analyzed based on obtained test results. Effectiveness of the new algorithm is verified by analysis results. [ABSTRACT FROM AUTHOR]

In this paper, we present a new multi-focus microscope (MFM) system based on a phase mask and HiLo algorithm, achieving high-speed (20 volumes per second), high-resolution, low-noise 3-D fluorescent imaging. During imaging, the emissions from the specimen at nine different depths are simultaneously modulated and focused to different regions on a single CCD chip, i.e., the CCD chip is subdivided into nine regions to record images from the different selected depths. Next, HiLo algorithm is applied to remove the background noises and to form clean 3-D images. To visualize larger volumes, the nine layers are scanned axially, realizing fast 3-D imaging. In the imaging experiments, a mouse kidney sample of ~ 60 × 60 × 16 μm3 is visualized with only 10 raw images, demonstrating substantially enhanced resolution and contrast as well as suppressed background noises. The new method will find important applications in 3-D fluorescent imaging, e.g., recording fast dynamic events at multiple depths in vivo. [ABSTRACT FROM AUTHOR]

Magnetic loops are one of the most popular and used traffic sensors because of their widely extended technology and simple mode of operation. Nevertheless, very simple models have been traditionally used to simulate the effect of the passage of vehicles on these loops. In general, vehicles have been considered simple rectangular metal plates located parallel to the ground plane at a certain height close to the vehicle chassis. However, with such a simple model, it is not possible to carry out a rigorous study to assess the performance of different models of vehicles with the aim of obtaining basic parameters such as the vehicle type, its speed or its direction in traffic. For this reason and because computer simulation and analysis have emerged as a priority in intelligent transportation systems (ITS), this paper aims to present a more complex vehicle model capable of characterizing vehicles as multiple metal plates of different sizes and heights, which will provide better results in virtual simulation environments. This type of modeling will be useful when reproducing the actual behavior of systems installed on roads based on inductive loops and will also facilitate vehicle classification and the extraction of basic traffic parameters. [ABSTRACT FROM AUTHOR]

Alkaline-Surfactant-Polymer (ASP) flooding is an efficient chemical enhanced oil recovery (EOR) method gaining popularity in the industry. In this paper, the characteristics of three flooding systems with alkyl aryl sulfonate surfactants and a weak alkali concentration, strong alkali concentration and no alkali concentration were investigated. The emulsification, interfacial tension, viscosity, stability, adsorption resistance as well as the oil displacement effect for the flooding systems and simulated oil of the fourth plant of the Daqing Oilfield were measured. The results show that the three alkyl aryl sulphonates surfactants have different emulsification indexes with the weak and strong alkali concentrations possessing the best and worst indexes at 67.00% and 55.17% respectively, and the combination of surfactant and no alkali concentration with an emulsification index of 63.03%. The interfacial tension between the three flooding systems and the simulated oil of the fourth plant of Daqing Oilfield gets as low as 10−3 mN/m, and reduces as far as 10-4mN/m in certain points detected, all with good anti-dilution performance. In terms of interfacial tension stability, the three flooding systems are seen to reach ultra-low interfacial tension within 90 days. For viscosity stability, the addition of a strong alkali and a weak alkali further hydrolyzes the polymer, leading to an initial rise in viscosity and viscosity retention rates above 80%. In terms of adsorption resistance, ultra-low interfacial tension occurs adsorption is reduced by five times for the strong and weak alkali systems, and reduced by four times for the alkali-free system. These results show that all three combination flooding systems have good adsorption resistance. In the evaluation of oil displacement effect, the average chemical flooding recovery rate (33.83%) of the weak alkali-surfactant-polymer (ASP) system is nearly three percent higher (31.34%) than that of the surfactant-polymer (SP) system, and over seven percent higher (26.71%) than that of the strong ASP system. [ABSTRACT FROM AUTHOR]

Two critical tasks in multi-criteria group decision making (MCGDM) are to describe criterion values and to aggregate the described information to generate a ranking of alternatives. A flexible and superior tool for the first task is q-rung orthopair fuzzy number (qROFN) and an effective tool for the second task is aggregation operator. So far, nearly thirty different aggregation operators of qROFNs have been presented. Each operator has its distinctive characteristics and can work well for specific purpose. However, there is not yet an operator which can provide desirable generality and flexibility in aggregating criterion values, dealing with the heterogeneous interrelationships among criteria, and reducing the influence of extreme criterion values. To provide such an aggregation operator, Muirhead mean operator, power average operator, partitioned average operator, and Archimedean T-norm and T-conorm operations are concurrently introduced into q-rung orthopair fuzzy sets, and an Archimedean power partitioned Muirhead mean operator of qROFNs and its weighted form are presented and a MCGDM method based on the weighted operator is proposed in this paper. The generalised expressions of the two operators are firstly defined. Their properties are explored and proved and their specific expressions are constructed. On the basis of the specific expressions, a method for solving the MCGDM problems based on qROFNs is then designed. Finally, the feasibility and effectiveness of the method is demonstrated via a numerical example, a set of experiments, and qualitative and quantitative comparisons. [ABSTRACT FROM AUTHOR]

Empirical studies show that discrimination by identity found in offline markets also prevails online. This paper reveal that in a competitive market, buyers that intend to discriminate exist but they are prevented from influencing the market outcome. To this end, we construct a field experiment on eBay, where half of the sellers disclose their names in their usernames while the other half do not. eBay, however, automatically discloses the seller’s names to the buyer after the auction. In the anonymous auctions, winning bidders thus learn the identity of the seller after the auction ends, and here we find buyers to discriminate against sellers with foreign-sounding names by leaving them feedback less often. However, there is no such discrimination in feedback provision when the seller name was known to the buyer before the auction. When bidders know the names of the sellers, the bidders with animus towards individuals with specific names can select out of auctions from these sellers, leaving winners that do not discriminate. One would expect that the auctions of for example sellers with foreign-sounding names would receive fewer bidders and thus lower auction prices. However, we observe no such differences: there are no statistically significant differences in the number of bids or auction prices received by sellers with foreign or domestic sounding names. [ABSTRACT FROM AUTHOR]

Single-point incremental forming (SPIF) is a technology that allows incremental manufacturing of complex parts from a flat sheet using simple tools; further, this technology is flexible and economical. Measuring the forming force using this technology helps in preventing failures, determining the optimal processes, and implementing on-line control. In this paper, an experimental study using SPIF is described. This study focuses on the influence of four different process parameters, namely, step size, tool diameter, sheet thickness, and feed rate, on the maximum forming force. For an efficient force predictive model based on an adaptive neuro-fuzzy inference system (ANFIS), an artificial neural network (ANN) and a regressions model were applied. The predicted forces exhibited relatively good agreement with the experimental results. The results indicate that the performance of the ANFIS model realizes the full potential of the ANN model. [ABSTRACT FROM AUTHOR]

Cells and organisms have developed homeostatic mechanisms which protect them against a changing environment. How growth and homeostasis interact is still not well understood, but of increasing interest to the molecular and synthetic biology community to recognize and design control circuits which can oppose the diluting effects of cell growth. In this paper we describe the performance of selected negative feedback controllers in response to different applied growth laws and time dependent outflow perturbations of a controlled variable. The approach taken here is based on deterministic mass action kinetics assuming that cell content is instantaneously mixed. All controllers behave ideal in the sense that they for step-wise perturbations in volume and a controlled compound A are able to drive A precisely back to the controllers’ theoretical set-points. The applied growth kinetics reflect experimentally observed growth laws, which range from surface to volume ratio growth to linear and exponential growth. Our results show that the kinetic implementation of integral control and the structure of the negative feedback loop are two properties which affect controller performance. Best performance is observed for controllers based on derepression kinetics and controllers with an autocatalytic implementation of integral control. Both are able to defend exponential growth and perturbations, although the autocatalytic controller shows an offset from its theoretical set-point. Controllers with activating signaling using zero-order or bimolecular (antithetic) kinetics for integral control behave very similar but less well. Their performance can be improved by implementing negative feedback structures having repression/derepression steps or by increasing controller aggressiveness. Our results provide a guide what type of feedback structures and integral control kinetics are suitable to oppose the dilution effects by different growth laws and time dependent perturbations on a deterministic level. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process. [ABSTRACT FROM AUTHOR]

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. [ABSTRACT FROM AUTHOR]

Nearly 1% of the global population has Epilepsy. Forecasting epileptic seizures with an acceptable confidence level, could improve the disease treatment and thus the lifestyle of the people who suffer it. To do that the electroencephalogram (EEG) signal is usually studied through spectral power band filtering, but this paper proposes an alternative novel method of preprocessing the EEG signal based on supervised filters. Such filters have been employed in a machine learning algorithm, such as the K-Nearest Neighbor (KNN), to improve the prediction of seizures. The proposed solution extends with this novel approach an algorithm that was submitted to win the third prize of an international Data Science challenge promoted by Kaggle contest platform and the American Epilepsy Society, the Epilepsy Foundation, National Institutes of Health (NIH) and Mayo Clinic. A formal description of these preprocessing methods is presented and a detailed analysis in terms of Receiver Operating Characteristics (ROC) curve and Area Under ROC curve is performed. The obtained results show statistical significant improvements when compared with the spectral power band filtering (PBF) typical baseline. A trend between performance and the dataset size is observed, suggesting that the supervised filters bring better information, compared to the conventional PBF filters, as the dataset grows in terms of monitored variables (sensors) and time length. The paper demonstrates a better accuracy in forecasting when new filters are employed and its main contribution is in the field of machine learning algorithms to develop more accurate predictive systems. [ABSTRACT FROM AUTHOR]

Leveraging smart metering solutions to support energy efficiency on the individual household level poses novel research challenges in monitoring usage and providing accurate load forecasting. Forecasting electricity usage is an especially important component that can provide intelligence to smart meters. In this paper, we propose an enhanced approach for load forecasting at the household level. The impacts of residents’ daily activities and appliance usages on the power consumption of the entire household are incorporated to improve the accuracy of the forecasting model. The contributions of this paper are threefold: (1) we addressed short-term electricity load forecasting for 24 hours ahead, not on the aggregate but on the individual household level, which fits into the Residential Power Load Forecasting (RPLF) methods; (2) for the forecasting, we utilized a household specific dataset of behaviors that influence power consumption, which was derived using segmentation and sequence mining algorithms; and (3) an extensive load forecasting study using different forecasting algorithms enhanced by the household activity patterns was undertaken. [ABSTRACT FROM AUTHOR]

In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on—all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications. [ABSTRACT FROM AUTHOR]

Among Parkinson’s disease (PD) symptoms, freezing of gait (FoG) is one of the most debilitating. To assess FoG, current clinical practice mostly employs repeated evaluations over weeks and months based on questionnaires, which may not accurately map the severity of this symptom. The use of a non-invasive system to monitor the activities of daily living (ADL) and the PD symptoms experienced by patients throughout the day could provide a more accurate and objective evaluation of FoG in order to better understand the evolution of the disease and allow for a more informed decision-making process in making adjustments to the patient’s treatment plan. This paper presents a new algorithm to detect FoG with a machine learning approach based on Support Vector Machines (SVM) and a single tri-axial accelerometer worn at the waist. The method is evaluated through the acceleration signals in an outpatient setting gathered from 21 PD patients at their home and evaluated under two different conditions: first, a generic model is tested by using a leave-one-out approach and, second, a personalised model that also uses part of the dataset from each patient. Results show a significant improvement in the accuracy of the personalised model compared to the generic model, showing enhancement in the specificity and sensitivity geometric mean (GM) of 7.2%. Furthermore, the SVM approach adopted has been compared to the most comprehensive FoG detection method currently in use (referred to as MBFA in this paper). Results of our novel generic method provide an enhancement of 11.2% in the GM compared to the MBFA generic model and, in the case of the personalised model, a 10% of improvement with respect to the MBFA personalised model. Thus, our results show that a machine learning approach can be used to monitor FoG during the daily life of PD patients and, furthermore, personalised models for FoG detection can be used to improve monitoring accuracy. [ABSTRACT FROM AUTHOR]

Multi-robot task allocation is one of the main problems to address in order to design a multi-robot system, very especially when robots form coalitions that must carry out tasks before a deadline. A lot of factors affect the performance of these systems and among them, this paper is focused on the physical interference effect, produced when two or more robots want to access the same point simultaneously. To our best knowledge, this paper presents the first formal description of multi-robot task allocation that includes a model of interference. Thanks to this description, the complexity of the allocation problem is analyzed. Moreover, the main contribution of this paper is to provide the conditions under which the optimal solution of the aforementioned allocation problem can be obtained solving an integer linear problem. The optimal results are compared to previous allocation algorithms already proposed by the first two authors of this paper and with a new method proposed in this paper. The results obtained show how the new task allocation algorithms reach up more than an 80% of the median of the optimal solution, outperforming previous auction algorithms with a huge reduction of the execution time. [ABSTRACT FROM AUTHOR]