NFP brokering framework is suggested to secure interoperability between heterogeneous chaining methods known so far and to address branching issues to reflect behaviour of VNFs to NFP forwarding rules at run time. Als...
详细信息
ISBN:
(纸本)9781509048922
NFP brokering framework is suggested to secure interoperability between heterogeneous chaining methods known so far and to address branching issues to reflect behaviour of VNFs to NFP forwarding rules at run time. Also, Functional architecture and interface between functional blocks of the framework are proposed based on NFP management information provided by the NFP control and orchestration.
The proceedings contain 96 papers. The special focus in this conference is on Ubiquitous computing, Information Systems, Multimedia, Visualization, Privacy, Artificial Intelligence, Web technology and 7th Internationa...
ISBN:
(纸本)9789811041532
The proceedings contain 96 papers. The special focus in this conference is on Ubiquitous computing, Information Systems, Multimedia, Visualization, Privacy, Artificial Intelligence, Web technology and 7th international Workshop on ICT convergence. The topics include: Improving performance and energy efficiency for OFDMA systems using adaptive antennas and CoMP;a study on OPNET state machine model based IoT network layer test;indoor positioning solely based on user’s sight;a highly robust and secure digital image encryption technique;saliency based object detection and enhancements in static images;design of OpenGL SC 2.0 rendering pipeline;saliency detection via foreground and background seeds;information visualization for mobile-based disability test applications;an augmented reality learning system for programming concepts;MBR image automation analysis techniques utilizing emulab;timing side channel attack on key derivation functions;known bid attack on an electronic sealed-bid auction scheme;secret sharing deniable encryption technique;improved 3D mesh steganalysis using homogeneous kernel map;enhanced database security using homomorphic encryption;design and evaluation of chaotic iterations based keyed hash function;a case-based approach to colorectal cancer detection;deep learning based recommendation;a network-based approach on big data for the comorbidities of urticaria;calculate deep convolution neural network on cell unit;smart learner-centric learning systems;static testing using different types of CRUD matrices and piezoelectric voltage monitoring system using smartphone.
A new approach to understanding evolution [34], namely viewing it through the lens of computation, has already started yielding new insights, e.g., natural selection under sexual reproduction can be interpreted as the...
详细信息
ISBN:
(纸本)9783959770293
A new approach to understanding evolution [34], namely viewing it through the lens of computation, has already started yielding new insights, e.g., natural selection under sexual reproduction can be interpreted as the Multiplicative Weight Update (MWU) Algorithm in coordination games played among genes [8]. Using this machinery, we study the role of mutation in changing environments in the presence of sexual reproduction. Following [35], we model changing environments via a Markov chain, with the states representing environments, each with its own fitness matrix. In this setting, we show that in the absence of mutation, the population goes extinct, but in the presence of mutation, the population survives with positive probability. On the way to proving the above theorem, we need to establish some facts about dynamics in games. We provide the first, to our knowledge, polynomial convergence bound for noisy MWU in a coordination game. Finally, we also show that in static environments, sexual evolution with mutation converges, for any level of mutation.
In this paper, we present an algorithm based on artificial neural networks (ANNs) and harmony search (HS) for the numerical solution of boundary value problems (BVPs), which evolves in most of the science and engineer...
详细信息
To model the behavior of nonlinear dynamical systems using wireless sensor networks (WSNs), the development of computation and energy efficient distributed modeling techniques is of crucial importance. In this work, V...
详细信息
To model the behavior of nonlinear dynamical systems using wireless sensor networks (WSNs), the development of computation and energy efficient distributed modeling techniques is of crucial importance. In this work, Volterra model is considered for the modeling of nonlinear systems because of its significant modeling capability and generalized nonlinear structure. For real-time estimation of the Volterra model parameters, a simple distributed algorithm is designed for a particular framework of WSNs having predefined bridge sensor nodes. The pertinent cost function is expressed as an unconstrained minimization problem using a decomposable augmented Lagrangian form. To facilitate the distributed convex optimization, the augmented Lagrangian form is minimized using alternating direction method of multipliers. The communication and computational complexities involved in the proposed methodology are provided to show its effectiveness in the real-time applications over centralized and non-cooperative solutions. The convergence analysis is provided to guarantee the mean stability of the proposed algorithm. Simulation results obtained under the noisy environment are plotted to demonstrate the effective performance of the proposed algorithm.
In September 2014, a local theatre company performed "the Tempest" simultaneously at two different locations to two separate audiences. Both audiences were linked together using an advanced video system, whe...
详细信息
Particle filters estimate the state of dynamic systems through Bayesian interference and stochastic sampling techniques. Parallel/distributed particle filters aim to improve the performance by deploying all particles ...
详细信息
Cauchy criterion is widely used in mathematical analysis, is the basic theory of mathematical analysis. We prove the Cauchy convergence criterion by using the interval proof theorem and the compactness theorem. In mos...
详细信息
Cauchy criterion is widely used in mathematical analysis, is the basic theory of mathematical analysis. We prove the Cauchy convergence criterion by using the interval proof theorem and the compactness theorem. In most of the research results, the basic theorem of the real number system is proved in a chain-like manner, and finally an argument ring is formed. The proof of the Cauchy criterion is the focus and the difficulty, especially its adequacy. This paper focuses on the Cauchy convergence criterion sufficient proof, the necessity is simple, this paper only gives a proof.
We initiate a line of investigation into biological neural networks from an algorithmic perspective. We develop a simplified but biologically plausible model for distributed computation in stochastic spiking neural ne...
详细信息
ISBN:
(纸本)9783959770293
We initiate a line of investigation into biological neural networks from an algorithmic perspective. We develop a simplified but biologically plausible model for distributed computation in stochastic spiking neural networks and study tradeoffs between computation time and network complexity in this model. Our aim is to abstract real neural networks in a way that, while not capturing all interesting features, preserves high-level behavior and allows us to make biologically relevant conclusions. In this paper, we focus on the important 'winner-Take-All' (WTA) problem, which is analogous to a neural leader election unit: A network consisting of n input neurons and n corresponding output neurons must converge to a state in which a single output corresponding to a firing input (the 'winner') fires, while all other outputs remain silent. Neural circuits for WTA rely on inhibitory neurons, which suppress the activity of competing outputs and drive the network towards a converged state with a single firing winner. We attempt to understand how the number of inhibitors used affects network convergence time. We show that it is possible to significantly outperform naive WTA constructions through a more refined use of inhibition, solving the problem in O(θ) rounds in expectation with just O(log1/θ n) inhibitors for any θ. An alternative construction gives convergence in O(log1/θ n) rounds with O(θ) inhibitors. We complement these upper bounds with our main technical contribution, a nearly matching lower bound for networks using ≥ log log n inhibitors. Our lower bound uses familiar indistinguishability and locality arguments from distributed computing theory applied to the neural setting. It lets us derive a number of interesting conclusions about the structure of any network solving WTA with good probability, and the use of randomness and inhibition within such a network.
On sphering the satellite data, classified images are achieved by many authors that had tried to reduce the mixing effect in image classes with the help of different Independent component analysis (ICA) based approach...
详细信息
暂无评论