Visible to the public Dynamical Systems, 2014

SoS Newsletter- Advanced Book Block

SoS Logo

Dynamical Systems, 2014


Research into dynamical systems cited here focuses on non-linear and chaotic dynamical systems and in proving abstractions of dynamical systems through numerical simulations.  Many of the applications studied are cyber-physical systems.  These works were presented in 2014 and are selected because of their specific relevancy to security issues.


Pradhan, P.; Venkitasubramaniam, P., "Under The Radar Attacks In Dynamical Systems: Adversarial Privacy Utility Tradeoffs," Information Theory Workshop (ITW), 2014 IEEE, pp. 242, 246, 2-5 Nov. 2014. doi: 10.1109/ITW.2014.6970829
Abstract: Cyber physical systems which integrate physical system dynamics with digital cyber infrastructure are envisioned to transform our core infrastructural frameworks such as the smart electricity grid, transportation networks and advanced manufacturing. This integration however exposes the physical system functioning to the security vulnerabilities of cyber communication. Both scientific studies and real world examples have demonstrated the impact of data injection attacks on state estimation mechanisms on the smart electricity grid. In this work, an abstract theoretical framework is proposed to study data injection/modification attacks on Markov modeled dynamical systems from the perspective of an adversary. Typical data injection attacks focus on one shot attacks by adversary and the non-detectability of such attacks under static assumptions. In this work we study dynamic data injection attacks where the adversary is capable of modifying a temporal sequence of data and the physical controller is equipped with prior statistical knowledge about the data arrival process to detect the presence of an adversary. The goal of the adversary is to modify the arrivals to minimize a utility function of the controller while minimizing the detectability of his presence as measured by the KL divergence between the prior and posterior distribution of the arriving data. Adversarial policies and tradeoffs between utility and detectability are characterized analytically using linearly solvable control optimization.
Keywords: Markov processes; radar; telecommunication security; Markov modeled dynamical systems; advanced manufacturing; adversarial privacy utility tradeoffs; core infrastructural frameworks; cyber communication; cyber physical systems; data arrival process; data injection attacks; digital cyber infrastructure; dynamic data injection attacks; dynamical systems; physical system dynamics; radar attacks; security vulnerabilities; smart electricity grid; state estimation mechanisms; temporal sequence; transportation networks; Markov processes; Mathematical model; Power system dynamics; Privacy; Process control; Smart grids; State estimation (ID#: 15-5178)


Senouci, A.; Busawon, K.; Bouridane, A.; Binns, R.; Ouslimani, A., "A Robust Chaotic Communication Scheme For A Class Of Dynamical Systems," Control Applications (CCA), 2014 IEEE Conference on, pp. 1178, 1183, 8-10 Oct. 2014. doi: 10.1109/CCA.2014.6981488
Abstract: This paper proposes an observer-based approach for robust chaotic communication with high power plaintext signals. The convergence rate of synchronization can be assigned by appropriately selecting the observer gains. The proposed scheme is carefully designed so that the encrypted signal does not deteriorate the synchronization. The proposed method significantly improves the frequency-domain characteristics of the transmitted secret message. This has the effect of preventing the extraction of the secret message using filtering techniques; hence improved security. Computer simulations show that the synchronization between the transmitter and the receiver is robust for different amplitude values of the information signal even in the presence of external disturbances. The synchronization between the transmitter and the receiver is maintained and the message signal is exactly recovered even for the various types of waveforms (square, trapezoidal, sinusoidal) of plaintext message and while varying the duty cycle and the rising and falling times of the signal.
Keywords: chaotic communication; filtering theory; synchronisation; telecommunication security; chaotic communication scheme; filtering techniques; high power plaintext signals; message signal; observer-based approach; plaintext message; secret message; Chaotic communication; Cryptography; Generators; Receivers; Synchronization; Transmitters (ID#: 15-5179)


Ping Zhen; Geng Zhao; Lequan Min; Xiaodong Li, "A Survey of Chaos-Based Cryptography," P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2014 Ninth International Conference on, pp. 237, 244, 8-10 Nov. 2014. doi: 10.1109/3PGCIC.2014.69
Abstract: As an offshoot of dynamical systems, chaos is highly sensitive to initial conditions and exhibits seemingly random behavior. From the perspective of cryptography and information security, randomness generated from entirely deterministic systems is a very appealing property. Chaotic cryptography has experienced significant developments since its birth in the early 90's. During these years, numerous research achievements have been obtained. This paper will present an overview about chaos-based cryptography and relevant progress that covers the main techniques used in this field.
Keywords: chaos; cryptography; chaos-based cryptography; deterministic systems; information security; Chaotic communication; Ciphers; Encryption; Public key cryptography; Chaos; Cryptography; Dynamical System; Information security (ID#: 15-5180)


Khan, M.S.; Ferens, K.; Kinsner, W., "A Chaotic Measure For Cognitive Machine Classification Of Distributed Denial Of Service Attacks," Cognitive Informatics & Cognitive Computing (ICCI*CC), 2014 IEEE 13th International Conference on, pp.100,108, 18-20 Aug. 2014. doi: 10.1109/ICCI-CC.2014.6921448
Abstract: Today's evolving cyber security threats demand new, modern, and cognitive computing approaches to network security systems. In the early years of the Internet, a simple packet inspection firewall was adequate to stop the then-contemporary attacks, such as Denial of Service (DoS), ports scans, and phishing. Since then, DoS has evolved to include Distributed Denial of Service (DDoS) attacks, especially against the Domain Name Service (DNS). DNS based DDoS amplification attacks cannot be stopped easily by traditional signature based detection mechanisms because the attack packets contain authentic data, and signature based detection systems look for specific attack-byte patterns. This paper proposes a chaos based complexity measure and a cognitive machine classification algorithm to detect DNS DDoS amplification attacks. In particular, this paper computes the Lyapunov exponent to measure the complexity of a flow of packets, and classifies the traffic as either normal or anomalous, based on the magnitude of the computed exponent. Preliminary results show the proposed chaotic measure achieved a detection (classification) accuracy of about 66%, which is greater than that reported in the literature. This approach is capable of not only detecting offline threats, but has the potential of being applied over live traffic flows using DNS filters.
Keywords: Internet; firewalls; pattern classification; DNS DDoS amplification attacks; DNS filters; Internet; attack-byte patterns; chaos based complexity measure; classification accuracy; cognitive computing approach ;cognitive machine classification algorithm; cyber security threats; distributed denial-of-service attacks; domain name service; network security systems; signature based detection mechanisms; simple packet inspection firewall; Chaos; Classification algorithms; Computer crime; Internet; Mathematical model; Nonlinear dynamical systems; Time series analysis; Anomaly Detection; Chaos; Cognitive Machine Learning; Cyber threats; DDoS Amplification; DNS; Data traffic; Fractal; Internet; Lyapunov exponent (ID#: 15-5181)


Chuan Luo; Xiaolong Zheng; Zeng, D., "Causal Inference in Social Media Using Convergent Cross Mapping," Intelligence and Security Informatics Conference (JISIC), 2014 IEEE Joint, pp. 260, 263, 24-26 Sept. 2014. doi: 10.1109/JISIC.2014.50
Abstract: Revealing underlying causal structure in social media is critical to understanding how users interact, on which a lot of security intelligence applications can be built. Existing causal inference methods for social media usually rely on limited explicit causal context, pre-assume certain user interaction model, or neglect the nonlinear nature of social interaction, which could lead to bias estimations of causality. Inspired from recent advance in causality detection in complex ecosystems, we propose to take advantage of a novel nonlinear state space reconstruction based approach, namely Convergent Cross Mapping, to perform causal inference in social media. Experimental results on real world social media datasets show the effectiveness of the proposed method in causal inference and user behavior prediction in social media.
Keywords: causality; inference mechanisms; social networking (online);state-space methods; causal inference methods; causality detection; convergent cross mapping; nonlinear state space reconstruction; social media; user behavior prediction; Manifolds; Media; Nonlinear dynamical systems; Security; Time series analysis; Twitter; causal inference; nonlinear dynamic system; social media; user influence (ID#: 15-5182)


Zamfir, M.D., "Discrete Time Feedback Linearization Method For Dynamical Adaptive Control Of Electronic Throttle," Electrical and Power Engineering (EPE), 2014 International Conference and Exposition on,  pp. 105, 109, 16-18 Oct. 2014. doi: 10.1109/ICEPE.2014.6969877
Abstract: The throttle system is an electromechanical system represented by a nonlinear dynamical model. In construction some nonlinearityes exist into the throttle. The most significant nonlinearity is a dead-zone. It has its origin in a security position of the throttle position. There are other nonlinearities e.g. Coulomb friction and nonlinearities related to wear. The work is focused on the control of the position of the throttle. Discrete-time designs of electronic throttle control systems are required for implementation on electric traction borne computers. This paper presents an nonlinear, discrete-time control system design method. These is the discrete-time feedback linearization method. First, the system dynamics is transformed into linear, time-invariant form. Next, the pole placement control techniques it is applied to the transformed control problem. In the presence of parametric variations, and perturbation the linearized system is modified. Next, we propose to use the adaptive dynamical control to minimize the consequences of these parametric variations. The resulting control scheme is applied on the original system and its effectiveness is evaluated by simulation tests.
Keywords: adaptive control; automobiles; control nonlinearities; control system synthesis; discrete time systems; feedback; linearisation techniques; nonlinear dynamical systems; dead-zone nonlinearity; discrete time feedback linearization method; discrete-time design; dynamical adaptive control; electromechanical system; electronic throttle control system; nonlinear dynamical model; parametric variation; pole placement control techniques; Adaptation models; Adaptive control; Atmospheric modeling; Control systems; Linear systems; Mathematical model; Valves; dinamic control; discrete-time feedback linearization; electronic throttle control; nonlinear system (ID#: 15-5183)


Fei Sun; Ozay, N.; Wolff, E.M.; Liu, J.; Murray, R.M., "Efficient Control Synthesis For Augmented Finite Transition Systems With An Application To Switching Protocols," American Control Conference (ACC), 2014, pp. 3273, 3280, 4-6 June 2014. doi: 10.1109/ACC.2014.6859428
Abstract: Augmented finite transition systems generalize nondeterministic transition systems with additional liveness conditions. We propose efficient algorithms for synthesizing control protocols for augmented finite transition systems to satisfy high-level specifications expressed in a fragment of linear temporal logic (LTL). We then use these algorithms within a framework for switching protocol synthesis for discrete-time dynamical systems, where augmented finite transition systems are used for abstracting the underlying dynamics. We introduce a notion of minimality for abstractions of certain fidelity and show that such minimal abstractions can be exactly computed for switched affine systems. Additionally, based on this framework, we present a procedure for computing digitally implementable switching protocols for continuous-time systems. The effectiveness of the proposed framework is illustrated through two examples of temperature control for buildings.
Keywords: continuous time systems; control system synthesis; discrete time systems; temporal logic; time-varying systems; augmented finite transition system; continuous-time system; control synthesis; discrete-time dynamical system; discrete-time switched system; high-level specifications; linear temporal logic; nondeterministic transition system; switched affine system; switching protocol synthesis; switching protocols; temperature control; Complexity theory; Heuristic algorithms; Protocols; Switched systems; Switches; Transient analysis; Automata; Hierarchical control; Switched systems (ID#: 15-5184)


Do, V.L.; Fillatre, L.; Nikiforov, I., "A Statistical Method For Detecting Cyber/Physical Attacks On SCADA Systems," Control Applications (CCA), 2014 IEEE Conference on, pp. 364, 369, 8-10 Oct. 2014. doi: 10.1109/CCA.2014.6981373
Abstract: This paper addresses the problem of detecting cyber/physical attacks on Supervisory Control And Data Acquisition (SCADA) systems. The detection of cyber/physical attacks is formulated as the problem of detecting transient changes in stochastic-dynamical systems in the presence of unknown system states (often regarded as the nuisance parameter). The Variable Threshold Window Limited CUmulative SUM (VTWL CUSUM) test is adapted to the detection of transient changes of known profiles in the presence of nuisance parameter. Taking into account the performance criterion of the transient change detection problem, which minimizes the worst-case probability of missed detection for a given value of the worst-case probability of false alarm, the thresholds are tuned for optimizing the VTWL CUSUM algorithm. The optimal choice of thresholds leads to the simple Finite Moving Average (FMA) algorithm. The proposed algorithms are utilized for detecting the covert attack on a simple water distribution system, targeting at stealing water from the reservoir without being detected.
Keywords: SCADA systems; fault diagnosis; moving average processes; probability; security of data; statistical analysis; stochastic systems; transient response; FMA algorithm; SCADA systems; VTWL CUSUM algorithm; VTWL CUSUM test; cyber-physical attack detection; finite moving average algorithm; nuisance parameter; reservoir water stealing; statistical method; stochastic-dynamical systems; supervisory control and data acquisition systems; transient change detection problem; variable threshold window limited cumulative sum test; water distribution system; worst-case probability; Pressure measurement; Reservoirs; SCADA systems; Time measurement; Transient analysis; Vectors; SCADA systems; cyber attacks; fault diagnosis; transient change detection (ID#: 15-5185)


Jae-Seung Yeom; Bhatele, A.; Bisset, K.; Bohm, E.; Gupta, A.; Kale, L.V.; Marathe, M.; Nikolopoulos, D.S.; Schulz, M.; Wesolowski, L., "Overcoming the Scalability Challenges of Epidemic Simulations on Blue Waters," Parallel and Distributed Processing Symposium, 2014 IEEE 28th International, pp. 755, 764, 19-23 May 2014. doi: 10.1109/IPDPS.2014.83
Abstract: Modeling dynamical systems represents an important application class covering a wide range of disciplines including but not limited to biology, chemistry, finance, national security, and health care. Such applications typically involve large-scale, irregular graph processing, which makes them difficult to scale due to the evolutionary nature of their workload, irregular communication and load imbalance. EpiSimdemics is such an application simulating epidemic diffusion in extremely large and realistic social contact networks. It implements a graph-based system that captures dynamics among co-evolving entities. This paper presents an implementation of EpiSimdemics in Charm++ that enables future research by social, biological and computational scientists at unprecedented data and system scales. We present new methods for application-specific processing of graph data and demonstrate the effectiveness of these methods on a Cray XE6, specifically NCSA's Blue Waters system.
Keywords: discrete event simulation; diseases; graph theory; medical computing; multiprocessing systems; Charm++ programming model; Cray XE6;EpiSimdemics; NCSA blue water system; biology; chemistry; discrete-event simulation approach; dynamical system modelling; epidemic diffusion simulation; epidemic simulations; finance; graph data application-specific processing; graph-based system; health care; irregular communication; irregular graph processing; load imbalance; national security; social contact networks; Computational modeling; Educational institutions; Load management; Load modeling; Scalability; Sociology; Statistics; contagion simulations; graph processing; performance; scalability; social contact networks (ID#: 15-5186)


Babaie, T.; Chawla, S.; Ardon, S.; Yue Yu, "A Unified Approach to Network Anomaly Detection," Big Data (Big Data), 2014 IEEE International Conference on, pp. 650, 655, 27-30 Oct. 2014. doi: 10.1109/BigData.2014.7004288
Abstract: This paper presents a unified approach for the detection of network anomalies. Current state of the art methods are often able to detect one class of anomalies at the cost of others. Our approach is based on using a Linear Dynamical System (LDS) to model network traffic. An LDS is equivalent to Hidden Markov Model (HMM) for continuous-valued data and can be computed using incremental methods to manage high-throughput (volume) and velocity that characterizes Big Data. Detailed experiments on synthetic and real network traces shows a significant improvement in detection capability over competing approaches. In the process we also address the issue of robustness of network anomaly detection systems in a principled fashion.
Keywords: Big Data; computer network security; hidden Markov models; Big Data; HMM; LDS; continuous-valued data; hidden Markov model; linear dynamical system; network anomaly detection; network traffic; Computer crime; Correlation; Hidden Markov models; IP networks; Kalman filters; Ports (Computers); Robustness (ID#: 15-5187)


Zamani, S.; Javanmard, M.; Jafarzadeh, N.; Zamani, M., "A Novel Image Encryption Scheme Based On Hyper Chaotic Systems And Fuzzy Cellular Automata," Electrical Engineering (ICEE), 2014 22nd Iranian Conference on, pp.1136,1141, 20-22 May 2014. doi: 10.1109/IranianCEE.2014.6999706
Abstract: A new image encryption scheme based on hyper chaotic system and Fuzzy Cellular Automata is proposed in this paper. Hyper chaotic system has more complex dynamical characteristics than chaos systems. Hence it becomes a better choice for secure image encryption schemes. Four hyper chaotic systems are used to improve the security and speed of the algorithm in this approach. First, the image is divided into four sub images. Each of these sub images has its own hyper chaotic system. In shuffling phase, Pixels in the two adjacent sub images are selected for changing their positions based upon the generated numbers of their hyper chaotic systems. Five 1D non-uniform Fuzzy Cellular Automata used in encryption phase. Used rule to encrypt a cell is selected based upon cell's right neighbor. By utilization of two different encryption methods for odd and even cells, problem of being limited to recursive rules in rule selecting process in these FCAs is solved. The results of implementing this scheme on some images from USC-SIPI database, shows that our method has high security and advantages such as confusion, diffusion, and is sensitive to small changes in key.
Keywords: cellular automata; cryptography; fuzzy set theory; image coding; 1D nonuniform fuzzy cellular automata; FCA; dynamical characteristic; hyperchaotic system; image encryption; rule selecting process; shuffling phase; Automata; Chaos; Correlation; Encryption; Entropy; FCA; Hyper Chaotic System; Image encryption; Lorenz System; Non-uniform Cellular Automata (ID#: 15-5188)


Lin Pan; Voos, H.; N'Doye, I.; Darouach, M., "Group Synchronization And Control Of A New Class Of Adaptive Complex Network With Brownian Motion And Time-Varying Delay," Control Conference (ECC), 2014 European, pp. 1771, 1776, 24-27 June 2014. doi: 10.1109/ECC.2014.6862264
Abstract: In this paper, the Group Mean Square Synchronization (GMSS) of a new class of adaptive Complex Dynamical Network (CDN) with Limited Stochastic Perturbation (LSP) and interval Time-Varying Delays (TVD) is investigated. The zero-mean real scalar Brownian Motion (BM) with LSP is also discussed. In this CDN, the weight configuration matrices are considered in two cases : TVD and Non-Time-Varying Delay (NTVD). The outer-coupling matrices are also assumed to be two cases : symmetric and dissymmetric. Based on the control theory and stochastic analysis such as : adaptive control method, Itô formula, Lyapunov Stability Theory (LST) and Kronecker product rules, the controllers nd adaptive schemes are constructed which let all nodes reach the GMSS asymptotically in the CDN. Finally, some examples of several complex chaotic systems are presented to demonstrate the proposed theoretical analysis.
Keywords: Brownian motion; adaptive control; chaos;complex networks; delays; matrix algebra; nonlinear systems; perturbation techniques; stochastic systems; synchronisation; BM; CDN; GMSS; Itô formula; Kronecker product rules; LSP; LST; Lyapunov stability theory; NTVD; TVD; adaptive complex dynamical network; adaptive control method; chaotic systems; dissymmetric case; group mean square synchronization; interval time-varying delays; limited stochastic perturbation; nontime-varying delay; outer-coupling matrices; symmetric case; weight configuration matrices; zero-mean real scalar Brownian motion; Adaptation models; Asymptotic stability; Communities; Complex networks; Couplings; Delays; Synchronization (ID#: 15-5189)


Fong-In, S.; Kiattisin, S.; Leelasantitham, A.; San-Um, W., "A Header Encryption Of Ultrasound Image Using Absolute-Value Chaotic Map," Biomedical Engineering International Conference (BMEiCON), 2014 7th, pp. 1, 5, 26-28 Nov. 2014. doi: 10.1109/BMEiCON.2014.7017414
Abstract: This paper presents a partial encryption scheme using absolute-value chaotic map for secure electronic health records (EHR). The HER system has been an emerging technology that allows medical personals to create, manage, and control medical data electronically through specific database or even web browsers. The proposed encryption scheme realizes XOR operations between separated planes of binary gray-scale image and a binaty image generated by an absolute-value chaotic map. The proposed is relatively simple containing a single absolute-value function with two constants and offers complex and robust dynamical behaviors in terms of random output values. Experiments have been performed in MATLAB using a magnetic resonance image which is divided into 64 sub-blocks and 13th iterations were proceeded for encryption. Encryption qualitative performances are evaluated through pixel density histograms, 2-dimensional power spectral density, and vertical, horizontal, and diagonal correlation plots. For the encryption quantitative measures, correlation coefficients, entropy, NPCR and UACI are realized. Demonstrations of wrong-key decrypted image are also included. The proposed encryption scheme offers a potential alternative to a secure medical data records and web browsing through cloud computing systems.
Keywords: biomedical MRI; biomedical ultrasonics; chaos; cloud computing; cryptography; electronic health records; iterative methods; mathematics computing; medical diagnostic computing; medical image processing; ultrasonic imaging;13th iterations;2-dimensional power spectral density; MATLAB; NPCR; UACI; XOR operations; absolute-value chaotic map; binary gray-scale image; cloud computing systems; complex dynamical behaviors; database; diagonal correlation plots; electronic health record security; electronic medical data control; electronic medical data creation; electronic medical data management; encryption qualitative performances; entropy; header encryption; horizontal correlation plots; magnetic resonance image; medical personals; partial encryption scheme; pixel density histograms; random output values; robust dynamical behaviors; single absolute-value function; ultrasound image; vertical correlation plots; web browsers; web browsing; wrong-key decrypted image; Biomedical imaging; Cryptography; Image segmentation; Absolute-Value Chaotic Map; Partial Encryption Scheme; electronic health records (ID#: 15-5190)


Lin Pan; Voos, H.; N'Doye, I.; Darouach, M., "Uncertainty Quantification Of Group Synchronization And Control Of A New Class Of Adaptive Complex Dynamical Network With Brownian Motion And Time-Varying Delay," Control Conference (CCC), 2014 33rd Chinese, pp. 1881, 1886, 28-30 July 2014. doi: 10.1109/ChiCC.2014.6896916
Abstract: This paper investigates the Uncertainty Quantification (UQ) of Group Mean Square Synchronization (GMSS) for a new class of Complex Dynamical Network (CDN) with interval Time-varying Delays (TVD) and Limited Stochastic Perturbation (LSP). Based on the control theory and Stochastic Collocation (SC) method, we have studied the robustness of the control algorithm with respect to the value of the final time. To that end, we assumed a normal distribution for time and used the SC method [1] with different values of nodes n collocation points Ti to quantify the sensitivity. These results show that the synchronization errors are close to zero with a high probability and confirm for different number of nodes. Finally, some examples with different structure chaotic systems and their numerical simulation results are presented to demonstrate the theoretical analysis. Therefore, the conclusion of this study is that the accuracy of the synchronization and control algorithm is robust to variations of time.
Keywords: adaptive control ;complex networks; delays; network theory (graphs); normal distribution; synchronisation; Brownian motion; CDN; LSP; SC method; TVD; UQ; adaptive complex dynamical network; collocation points; control algorithm; control theory; group mean square synchronization; group synchronization; limited stochastic perturbation; normal distribution; robustness; stochastic collocation method; synchronization error; time-varying delay; uncertainty quantification; Artificial neural networks; Chaos; Polynomials; Robustness; Synchronization; Uncertainty; Chaotic Systems; Complex Dynamical Networks (CDN); Cumulative Distribution Function (CDF);Group Mean Square Synchronization (GMSS);Limited Stochastic Perturbation (LSP); Uncertainty Quantification (UQ) (ID#: 15-5191)


San-Um, W.; Chuayphan, N., "A Lossless Physical-Layer Encryption Scheme In Medical Picture Archiving And Communication Systems Using Highly-Robust Chaotic Signals," Biomedical Engineering International Conference (BMEiCON), 2014 7th, pp. 1, 5, 26-28 Nov. 2014. doi: 10.1109/BMEiCON.2014.7017404
Abstract: This paper reviews some major techniques related to the security issues in Picture Archiving and Communications System (PACS) of medical images. Three conventional techniques including watermarking, digital signature and encryptions are studied. The encryption scheme using highly-robust chaotic signals is also proposed as a new lossless physical-layer that improves security in medical images in PACS. The dynamical system utilizing signum function is employed to generate chaotic signals with smooth bifurcation, i.e. no appearance of periodic windows. Nonlinear dynamics of the chaotic maps were initially investigated in terms of Cobweb map, chaotic attractor, Lyapunov exponent spectrum, bifurcation diagram, and 2-dimensional parameter spaces. Encryption qualitative performances are evaluated through pixel density histograms, 2-dimensional power spectral density, key space analysis, key sensitivity, vertical, horizontal, and diagonal correlation plots. Encryption quantitative performances are evaluated through correlation coefficients, NPCR and UACI. Demonstrations of wrong-key decrypted image are also included.
Keywords: PACS; bifurcation; biomedical ultrasonics; chaos; cryptography; digital signatures; image watermarking; medical image processing;2-dimensional parameter;2-dimensional power spectral density; ACS system; Cobweb map; Lyapunov exponent spectrum; NPCR; UACI; bifurcation diagram; chaotic attractor; correlation coefficients; diagonal correlation; digital signature; highly-robust chaotic signals; horizontal correlation; key sensitivity; key space analysis; lossless physical-layer encryption scheme; medical images; medical picture archiving-and-communication systems; nonlinear dynamics; pixel density histograms; signum function; vertical correlation; watermarking; wrong-key decrypted image; Chaotic communication; Correlation; Cryptography; Digital images; Encryption Scheme; Highly-Robust Chaotic Signals; Picture Archiving and Communication Systems (ID#: 15-5192)


Pan, L.; Voos, H.; N'Doye, I.; Darouach, M., "Exponential Synchronization For A New Class Of Complex Dynamical Network With PIPC And Hybrid TVD," Intelligent Control (ISIC), 2014 IEEE International Symposium on, pp. 270, 275, 8-10 Oct. 2014. doi: 10.1109/ISIC.2014.6967598
Abstract: In this paper, the theme of Exponential Synchronization (ES) for a new class of Complex Dynamical Networks (CDN) with hybrid Time-Varying Delay (TVD) and Non-Time-Varying Delay (NTVD) nodes is investigated by using coupling Periodically Intermittent Pinning Control (PIPC). Based on the Lyapunov Stability Theory (LST), Kronecker product rules and PIPC method, sufficient conditions for ES and PIPC criteria of such CDN are derived. The obtained results are effective and less conservative. Furthermore, to verify the effectiveness of the proposed theoretical results, Barabasi-Albert Network (BAN) and Nearest-Neighbor Network (NNN) consisting of coupled non-delayed and delay Lee oscillators are finally given as the examples.
Keywords: Lyapunov methods; complex networks; delays; large-scale systems; oscillators; stability; synchronization ;time-varying systems; BAN; Barabasi-Albert network; Kronecker product rules; LST; Lyapunov stability theory; NNN;PIPC method; complex dynamical network; coupled nondelayed Lee oscillators; delay Lee oscillators; exponential synchronization; hybrid TVD; hybrid time-varying delay; nearest-neighbor network; nontime-varying delay; periodically intermittent pinning control; sufficient conditions; Artificial neural networks; Control systems; Couplings; Delays; Equations; Synchronization; Vectors (ID#: 15-5193)


Antulov-Fantulin, N.; Lancic, A.; Stefancic, H.; Sikic, M.; Smuc, T., "Statistical Inference Framework for Source Detection of Contagion Processes on Arbitrary Network Structures," Self-Adaptive and Self-Organizing Systems Workshops (SASOW), 2014 IEEE Eighth International Conference on, pp. 78, 83, 8-12 Sept. 2014. doi: 10.1109/SASOW.2014.35
Abstract: We introduce a statistical inference framework for maximum likelihood estimation of the contagion source from a partially observed contagion spreading process on an arbitrary network structure. The framework is based on simulations of a contagion spreading process from a set of potential sources which were infected in the observed realization. We present a number of different likelihood estimators for determining the conditional probabilities of potential initial sources producing the observed epidemic realization, which are computed in scalable and parallel way. This statistical inference framework is applicable to arbitrary networks with different dynamical spreading processes.
Keywords: inference mechanisms; maximum likelihood estimation; probability; security of data; conditional probabilities; contagion processes; contagion spreading process; dynamical spreading process; epidemic realization; maximum likelihood estimation; source detection; statistical inference framework; Adaptation models; Airports; Atmospheric modeling; Estimation; Noise; Position measurement; Random variables; complex networks; contagion spreading; source detection (ID#: 15-5194)


Hua Yang; Xiaojin Yang, "An Improved Multi-Channel Mac Protocol In Vehicle-To-Vehicle Communication System," Computing, Communication and Networking Technologies (ICCCNT), 2014 International Conference on, pp. 1, 5, 11-13 July 2014. doi: 10.1109/ICCCNT.2014.6963153
Abstract: Against Self-organizing networks for automotive large-scale network scenario, in a McMAC multichannel protocol based on adding clustering considerations, proposed an improved multi-channel MAC protocol. In this protocol vehicles organized into different clusters, the traditional single medium is divided into a plurality of control channels and one data channel. Clusters within and between clusters of data communication channel using TDMA/CDMA technology, control channel using CSMA/CA protocol. Simulation results show that compare to the Dynamical Control Assignment and McMAC, the improved protocol significantly enhances the performance indicators like probability of successful packet reception, channel access time, congestion control etc.
Keywords: carrier sense multiple access; code division multiple access; data communication; mobile radio; pattern clustering; time division multiple access; CSMA/CA protocol; McMAC multichannel protocol; TDMA-CDMA technology; automotive large-scale network scenario; control channel plurality; data channel; data communication channel; dynamical control assignment; improved multichannel MAC protocol; performance indicators; self-organizing networks; single medium; vehicle-to-vehicle communication system; Ad hoc networks; Media Access Protocol; Throughput; Time division multiple access; Vehicles; Medium Access Control; Multi-Channel; Vehicle-to-Vehicle Communication; Vehiclular Ad Hoc Network (ID#: 15-5195)




Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.