Industrial networks of the future:a critical commentary on research and practice

Academia has followed the interest by companies in establishing industrial networks by studying aspects such as social interaction and contractual relationships. But what patterns underlie the emergence of industrial networks and what support should research provide for practitioners? Firstly, it seems that manufacturing is becoming a commodity rather than a unique capability, which accounts especially for low-technology approaches in downstream parts of the network, for example in assembly operations. Secondly, the increased tendency to specialize forces other parts of industrial networks to introduce advanced manufacturing technologies for niche markets. Thirdly, the capital market for investments in capacity and the trade in manufacturing as a commodity dominates resource allocation to a larger extent. Fourthly, there will be a continuous move toward more loosely connected entities forming manufacturing networks. More traditional concepts, like keiretsu and chaibol networks, do not sufficiently support this transition. Research should address these fundamental challenges to prepare for the industrial networks of 2020 and beyond.

On-off and multistate intermittencies in cascaded random distributed feedback fibre laser

A range of physical and engineering systems exhibit an irregular complex dynamics featuring alternation of quiet and burst time intervals called the intermittency. The intermittent dynamics most popular in laser science is the on-off intermittency [1]. The on-off intermittency can be understood as a conversion of the noise in a system close to an instability threshold into effective time-dependent fluctuations which result in the alternation of stable and unstable periods. The on-off intermittency has been recently demonstrated in semiconductor, Erbium doped and Raman lasers [2-5]. Recently demonstrated random distributed feedback (random DFB) fiber laser has an irregular dynamics near the generation threshold [6,7]. Here we show the intermittency in the cascaded random DFB fiber laser. We study intensity fluctuations in a random DFB fiber laser based on nitrogen doped fiber. The laser generates first and second Stokes components 1120 nm and 1180 nm respectively under an appropriate pumping. We study the intermittency in the radiation of the second Stokes wave. The typical time trace near the generation threshold of the second Stokes wave (Pth) is shown at Fig. 1a. From the number of long enough time-traces we calculate statistical distribution between major spikes in time dynamics, Fig. 1b. To eliminate contribution of high frequency components of spikes we use a low pass filter along with the reference value of the output power. Experimental data is fitted by power law, ~(P-Pth)y, where is a mean time between pikes. There are two different intermittency regimes. Just above Pth, the mean time is approximated by the -3/2 power law. The -3/2 power law is typical to the on-off intermittency with hopping between two states (first and second Stokes waves in our case) [7]. At higher power, the mean time is approximated by -4 power law, that indicates a change in intermittency type to multistate. Multistable dynamics is observed in erbium-doped fiber lasers [8]. The origin of multiples states in our system could be probably connected with polarization hopping or other reasons and should be further investigated. We have presented a first experimental statistical characterisation of the on-off and multistate intermittencies that occur in the generation of the second Stokes wave in nitrogen doped random DFB fiber laser. References [1] H. Fujisaka and T. Yamada, “A New Intermittency in Coupled Dynamical Systems,” Prog. Theor. Phys. 74, 918 (1985). [2] S. Osborne, A. Amann, D. Bitauld, and S. O’Brien, “On-off intermittency in an optically injected semiconductor laser,” Phys. Rev. E 85, 056204 (2012). [3] S. Sergeyev, K. O'Mahoney, S. Popov, and A. T. Friberg, “Coherence and anticoherence resonance in high-concentration erbium-doped fiber laser,” Opt. Lett. 35, 3736 (2010). [4] A.E. El-Taher, S.V. Sergeyev, E.G. Turitsyna, P. Harper, and S. K. Turitsyn, “Intermittent Self-Pulsing in a Fiber Raman Laser”, In proc. Conf. Nonlin. Photon., paper ID 1367139, Colorado Springs, USA, 2012 [5] S.K. Turitsyn, S.A. Babin, A.E. El-Taher, P. Harper, D.V. Churkin, S.I. Kablukov, J.D. Ania-Castañón, V. Karalekas, and E.V. Podivilov, “Random distributed feedback fibre laser”, Nat. Photon..4, 231 (2010). [6] I. D. Vatnik, D. V. Churkin, S. A. Babin, and S. K. Turitsyn, "Cascaded random distributed feedback Raman fiber laser operating at 1.2 μm," Opt. Express 19, 18486 (2011). [7] W. Feller, An introduction to probability theory and its applications, Vol. 1, 3rd ed. (Wiley, New-York, 1968). [8] G. Huerta-Cuellar, A.N. Pisarchik, and Y.O. Barmenkov, “Experimental characterization of hopping dynamics in a multistable fiber laser,” Phys. Rev. E 78, 035202(R) (2008).

International insights into twenty-first century quality management:facts or fashion?

Invited editorial - Papers from the 3rd World Conference on Productions and Operations Management (POM) Tokyo 2008.

On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.