The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Vector evaluated particle swarm optimization (VEPSO) extends the particle swarm optimization (PSO) algorithm to deal with multi-objective optimization problems (MOPs). VEPSO stores the found non-dominated solutions in an archive. Management of the VEPSO archive is, however, not described in detail. In this paper, a Pareto optimal front (POF) diversity sensitivity analysis on the choice of the VEPSO's...
It is widely observed that the poor event logs quality poses a significant challenge to the process mining project both in terms of choice of process mining algorithms and in terms of the quality of the discovered process model. Therefore, it is important to control the quality of event logs prior to conducting a process mining analysis. In this paper, we propose a qualitative model which aims to...
We introduce a new framework for performing multiple comparisons with a standard when simulation models are available to estimate the performance of many different systems. In this setting, a large proportion of the systems have mean performance from some known null distribution, and the goal is to select alternative systems whose means are different from that of the null distribution. We employ empirical...
In this paper, we present a geometric variational algorithm for optimizing the gaits of kinematic locomoting systems. The dynamics of this algorithm are analogous to the physics of a soap bubble, with the system's Lie bracket supplying an “inflation pressure” that is balanced by a “surface tension” term derived from a Riemannian metric on the system's shape space. We demonstrate this optimizer on...
In real problems in Engineering, solving a problem is not enough; the solution of the problem must be the best solution possible. In other words, it is necessary to find the optimal solution. The solution is the best possible solution because in the real world this problem may have certain constraints by which the solutions found may be feasible, that is, they can be implemented in practice and, unfeasible...
Coexistence of cellular networks and wireless local area network (WLAN) in unlicensed spectrum will be a vital application scenario in the future 5G network. Listen-before-talk (LBT) is one of the mechanisms to ensure a fair coexistence among various radio access networks. In this paper, we present a LBT algorithm with an adaptive threshold jointly considering the diverse traffic load conditions of...
The flood of real time social data, generated by various social media applications and sensors, is enabling researchers to gain critical insights into important social modeling and analysis problems such as the evolution of social relationships and analysis of emergent social processes. However, current computational tools have to address the grand challenge of analyzing large and dynamic social networks...
In this paper, the relationship between the distance metrics and the data model was analyzed and a new algorithm for keystroke dynamics classification was proposed. The results of the experiments on the CMU and GREYC keystroke dynamics benchmark and mobile devices datasets were evaluated. The classifiers using the proposed algorithm outperform existing top performing keystroke dynamics classifiers...
In automatic videosurveillance system, the first step is the extraction of moving objects. In this work, we investigate a new approach for foreground-background segmentation by using a modified Codebook algorithm. This approach exploit the perceptual information to optimize the detection. It is an adaptive strategy which is proposed to to reduce the computational complexity of the foreground detection...
With the scale of small and medium hydropower increasing gradually, it is difficult to establish a detailed model because the parameters of each generating unit can barely be obtained. To build a dynamic equivalent model of the hydropower generator group, this paper presents an estimation-based equivalent method, which will keep the dynamic responses and the transient stability consistent before and...
Foreground detection is the classical computer vision task of segmenting out motion information from a particular scene. Foreground detection using Gaussian Mixture Models (GMM) is the famous choice. Since first time proposed, many researchers tried to improve GMM. This paper focuses on the comparative evaluation of three most famous improvements in the algorithm. The improved methods are compared...
Driven by the proliferation of data traffic and requirement of user experience improvement, mobile wireless network is evolving towards heterogeneous networks (HetNet). The telecom operator is experiencing unprecedented challenges on service maintenance and operational expenditure, which drives the demand for realizing automation in current heterogeneous networks. Cell outage detection is a functionality...
In high-speed networks, it is important to detect the presence of large flows—also known as elephant flows—because of their adverse effects on delay-sensitive flows. If detected on a timely fashion, network operators can apply active policies such as flow redirection or traffic shaping to ensure the overall quality of service of the network is preserved. Towards this objective, we develop a high-performance...
This paper presents a distributed clustering algorithm, called DCEV, which constructs multi-hop clusters. DCEV places vehicles into non-overlapping clusters which have adaptive size based on their relative mobility. The cluster formation is based on a D-hop clustering scheme where each node selects its cluster head in at most D-hop distance. To create clusters, DCEV uses a new metric to let vehicles...
This paper is devoted to the numerical investigation of the availability improvement method at cloud service systems. It was also proved that using proposed approach and algorithm promotes us to determine structural-topological changes operatively in dynamics. It allows improving workload balancing in the servicing nodes, avoiding the proximity of workflows and components of complex services to structural...
The traffic profile of future mobile networks is foreseen as becoming more variable both in time and among base stations (BSs) due to the widespread heterogeneity in applications and services. Dynamic time division duplex (TDD) has been recognized as an important enabler to cope with this traffic variability, especially in dense networks with many BSs and a small number of user equipments (UEs) served...
In networks that operate during a long time, the routing protocol might have to be changed (in order to apply a routing protocol update, or to take into account a change in the routing metrics). A loop-free transition algorithm has to be used in order to perform the transition to the new routing protocol without generating transient routing loops. In this paper, we propose a loop-free transition algorithm...
Natural intelligence heuristic techniques have demonstrated their capability to provide acceptable solutions to many real life complex problems. Their potential to mine communities from complex networks has been successfully tested by many researchers. With the growing rate of development of new robust and efficient nature based algorithms, a strong need is felt for a generalized framework to evolve...
This paper investigates the discriminative capabilities of facial action units (AUs) exhibited by an individual while performing a task on a tablet computer in a semi-unconstrained environment. To that end, AUs are measured on a frame-by-frame basis from videos of 96 different subjects participating in a game-show-like quiz game that included a prize incentive. We propose a method that leverages the...
δ-Hyperbolicity is a graph parameter that shows how close to a tree a graph is metrically. In this work, we propose a method that reduces the size of the graph to only a subset that is responsible for maximizing its δ-hyperbolicity using the local dominance relationship between vertices. Furthermore, we empirically show that the hyperbolicity of a graph can be found in a set of vertices that are in...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.