Blog

Ukraine Points to Added Urgency as Russia Reinforces Southern Front – The New York Times

Ukraine Points to Added Urgency as Russia Reinforces Southern Front  The New York Times
source

Paramida: "Don't overproduce it. The charm is in the rawness" – MusicRadar

MusicRadar is supported by its audience. When you purchase through links on our site, we may earn an affiliate commission. Here’s why you can trust us.
By published
The producer, DJ and Panorama Bar resident on reframing samples from her extensive record collection into lysergic, trance-inflected techno
Many electronic artists are inspired by the glorious heyday of ‘90s rave, but few take this inspiration quite so literally as Paramida. 
The Berlin-based Panorama Bar resident began her career as a DJ and label head, curating her imprint’s vibe by giving each artist these specific instructions: “Imagine it’s 1992, you are at a rave in Goa on the beach. It’s 8am, what’s the track playing? Make that track.”
After experimenting with producing edits to drop in DJ sets, Paramida decided to refocus her energy away from guiding other artists towards the sound that inspires her, and figure out how to create it herself. 
Since then, the producer’s nailed down a singular style that sees her reframing and reinterpreting samples from her extensive record collection into lysergic techno workouts and technicolour rave stompers, culminating in her latest release for Love On The Rocks, Moonrise VII. We spoke to Paramida ahead of the release of her sophomore EP to find out more about how she makes her tracks.
When did you start making music, and how did you first get started?
“I started a few years ago making edits. At the same time I realized that I kept telling every artist that wanted to release on my label the same thing: “Imagine it’s 1992, you are at a rave in Goa on the beach. It’s 8am, what’s the track playing? Make that track.” 
“After a while I realized that with the time I spend on guiding other artists to make that sound, I could spend on trying myself, and that’s what got me into production. I took a couple of Ableton classes and had some private tutoring with producers that I admire. I learned to take the best from all three of them and make it my way of producing.”
Tell us about your studio/set-up.
“I do everything in the box and use a lot of plugins. But also my way of working is sampling old records. I am not a studio nerd, but I collect a lot of records and that’s my knowledge and angle to make music. 
My record collection is the backbone of my productions
“Regarding plugins I use everything from Roland Cloud to the Korg Legacy series and the UVI Workstation, for example, for producing sounds. I sample old records and reprogram them for my percussion in Ableton. I use Valhalla products for my reverbs and sound modulations, and I use Fabfilter for processing sounds.”
What DAW (or DAWs) do you use, and why did you choose it?
“Ableton, because it’s instinctual. I didn’t even consider any other DAW since all my friends use Ableton and I had been recommended. It was pretty easy to learn the basics of it and I really love how everyone who learns how to use Ableton has a different way of working with the program. 
“It’s intuitive, and the workflow is nice and straightforward with the Session View and the Arrangement View. It’s also super easy to share projects which is useful when I remix other artists’ projects. I find the whole program really useful.”paramidaWhat one piece of gear in your studio could you not do without, and why?
“The Fabfilter package is the one of the most essential pieces of software that I wouldn’t be able to live without. The EQ is probably the tool I use the most, as you can see the entire spectrum of the sound and you can easily take away or add frequencies. It’s so straightforward, even beginners would understand what the tool does. The package also contains a compressor, limiter and an interesting sounding delay called Timeless that can do all types of delays. Definitely worth diving into!”
What’s the latest addition to your studio? 
“I’m just about to get a Roland MC-303, just because the commercial for it looks amazing and I think the groovebox is the original rave spirit.”
What dream bit of gear would you love to have in your studio?
“If anybody is up for donating their gear, I’m happy to have a Linndrum!”
When approaching a new track or project, where do you start?
“I start with a gut feeling. There’s always something in the background that I keep revisiting, so it always depends on what my idea or inspiration is. But also because I sample all my records that I play, I already always have a base to work with and then it’s pretty much like DJing for me, because I listen to the stems and try to figure out what could work well with my current favourite samples. 
Which other artists do you look to for inspiration?
“My labelmates Alex Kassian, Fantastic Man, Jonny Rock and Telephones.”
If you had to pick one song/album that’s been most influential on your work, what would it be?
“It’s a ‘90s progressive house white label record called Pillar of Salt that completely blew me away and became an instant classic in my DJ sets. I just wanted more of that sound, so I kept digging, but at the same time I decided to try to make that sound myself.”
What do you think makes you unique as a producer and musician?
“My record collection is the backbone of my productions. Through my record collection I got to know so many different sounds from different eras, and as a producer I’ve cherry picked the sounds that I really like and put them together to create something unique.”
“When you create effects such as delays and reverbs make sure you create them on the sends return channels, and not directly on the audio channel. This makes it much easier to handle when you go into the mixing stage, separating dry tracks from the wet while being able to take out certain frequencies that arise in the FX channels. This will help to provide you with space for a better mixdown.”
“Parallel compression is probably the best thing that I’ve learned. By parallel compressing certain channels you get all the small sounds you couldn’t hear popping up and everything sounds fuller as a whole.”
“One of the most important things I’ve learned in production is to make everything as simple as possible. That doesn’t necessarily mean make it super functional, but keeping it simple in the way you pay attention to shaping each sound, keeping the arrangement moving. 
Don’t overproduce it. The charm is in the rawness
“I guess it comes from my background as a DJ and a record collector, but paying attention to some of the best ‘90s house records, the sounds are so on point, uncomplicated, and the arrangement is fun. So the lesson is to pay attention to old records that you like, because there is a lot of information in them and learning from those can have a huge impact on your music-making.
“If you base your arrangement on a record from your collection that you really like, it can give you clues to go down the right path and learn tricks for arrangement. For example, just reversing hi-hats or reversing a breakbeat sample can do wonders before a new scene starts. Don’t overproduce it. The charm is in the rawness.”
Paramida’s Moonrise VII EP is due out 25th August on Love On The Rocks.
I’m the Tech Features Editor for MusicRadar, working on everything from artist interviews to tech tutorials. I’ve been writing about (and making) electronic music for over a decade, and when I’m not behind my laptop keyboard, you’ll find me behind a MIDI keyboard or a synthesizer. 
Don’t miss the latest deals, news, reviews, features and tutorials
Thank you for signing up to Musicradar. You will receive a verification email shortly.
There was a problem. Please refresh the page and try again.
MusicRadar is part of Future plc, an international media group and leading digital publisher. Visit our corporate site (opens in new tab).
© Future Publishing Limited Quay House, The Ambury, Bath BA1 1UA. All rights reserved. England and Wales company registration number 2008885.

source

John Min: "Doubt is the cross artists have to carry with them all the time" – Electronic Groove

EG caught up with John Min to learn more about the drop of his ‘Arise’ EP, his origins in dance music, his sound, workflow, and more.
EG: Hi John! Welcome to EG. It’s a pleasure to have you here with us. Where are you based right now? How have you been?
John Min: Hi EG, thank you for having me. At the moment I am based in Manchester, UK. I’ve been great, things are moving fast but all for the better. Currently working on new music and enjoying the weather!
EG: Congratulations on the drop of your ‘Arise’ EP with Martin Mayer! What has the reception been like?
John Min: Thank you. I am very glad because the initial reception was positive and encouraging, we had massive support from friends and other DJs. We composed these tracks three months ago and sometimes, as a producer when you listen to music you composed for a while, you can question yourself and ask yourself if this or that would have been better this or that way. Doubt is the cross artists have to carry with them all the time.

EG: So what’s the story behind ‘Arise’? What’s the inspiration or general concept for the EP?
John Min: The story behind the EP was to combine two different sounds and create something new with its own character. We had many discussions with Martin about what to produce. We had to delete and start again many times because music is something unique and everyone understands it in their own way, but in the end, we had two solid tracks and so ‘Arise’ was born.
EG: What was the process for ‘Arise’ like? How did you go about working with Martin? What can your fans expect to find on this particular package?
John Min: We were discussing with him for many years to sit in the studio together and produce something, so we decided to work together and combine our sounds and create something unique. We had a lot of online video-call sessions, sending stems and ideas because Martin Mayer is based in Stuttgart, Germany. The EP is characterized by its signature tight basslines in combination with its melodic multilayered elements and signature vocal lines, delivering a solid heavy melodic techno sound for every festival stage and not only…
EG: How has your sound evolved since you first started out? How would you describe your music by now?
John Min: I believe the most difficult thing for a producer is to find his own unique identity and for all of his tracks to have something to offer and trigger the crowd to travel through his music. My production techniques involve ascertaining basslines from hip hop tracks, adding further vocals, basslines, and more. As a point of inspiration for myself, I strive to bring something new to my output. With no specific formula for my productions, each track is different from the last whilst still maintaining the John Min “attitude”.
EG: Let’s take this back to your origins. When did you first come in contact with electronic music? Was there a record o show that pushed you down the rabbit hole?
John Min: Everything began many years ago, in my hometown in Greece (Orestiada). I had the honor to meet a very charismatic person and his name is Athanasios Dobas. He was my mentor all these years and until now, we had many conversations about the electronic music industry, and how the scene was some 10-15 years ago. We were listening to various house tracks together late at night and analyzing them, we were paying attention to the structure, the atmosphere, feelings, everything. He taught me a lot of things and I own him a lot, his philosophy and his mentality triggered me to love and explore more this magic world of electronic music. One of my favorite tracks that pushed me down the rabbit hole was one track by Masters At Work, ‘To be in Love’. I saw them perform it live and the vibe from the crowd was out of this world and I said to myself: “That’s it, let’s do it”.

EG: What does your studio look like at the moment? Have you picked up any new hardware or software that you’d recommend to other producers?
John Min: At the moment my studio is my living room because I moved recently to the UK and I left behind all of my equipment, but I believe that you don’t need something expensive or have too much to be creative. I produce with Ableton Live and I have a pair of Yamaha HS5 Studio Monitors.
EG: The pandemic gave us all a chance to slow down and reassess. In the electronic music scene, it even gave us time for some much-needed discussions. What would you like to see more and less of?
John Min: During the pandemic, it is true that we spent a lot of time on social media, as it became the only place to express ourselves for a while; and I think algorithms do not serve creativity in general: I would like to see more producers composing personal music, see themselves through music following their true inspiration. I would like to see fewer people influenced by the algorithms in many ways; putting themselves naked all the time for followers, likes, and views, or producers following trends, being pushed by algorithms.
EG: What’s next for John Min? What particular milestones are you looking forwards to now?
John Min: My next milestone is in September and it’s a track that I produced during the pandemic. It’s called ‘Belfast Nights’ and it will be released in September on Kinе́tika Music. It’s a breakbeat with a driving bassline and capturing vocals.
EG: Thank you so much for your time, John! We wish you all the best for the future.
John Min: Thank you so much for everything guys, it was a pleasure!

John Min & Martin Mayer’s ‘Arise’ EP is out now via Cope. Purchase your copy here.
Follow John Min: Facebook | Instagram | SoundCloud | Spotify
Tunisian-born, Belgium-based Sound Designer, DJ, and producer Samer Soltan has been on the rise with…
Photo Credit: Tibor Bozi Greco-German Vamparela and Brax Moody of unstoppable DJ and producer duo…
Ido Morali is an Indie Dance and Electronica music DJ and producer based in Tel…

source

Functional control of oscillator networks – Nature.com

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.
Advertisement
Nature Communications volume 13, Article number: 4721 (2022)
Metrics details
Oscillatory activity is ubiquitous in natural and engineered network systems. The interaction scheme underlying interdependent oscillatory components governs the emergence of network-wide patterns of synchrony that regulate and enable complex functions. Yet, understanding, and ultimately harnessing, the structure-function relationship in oscillator networks remains an outstanding challenge of modern science. Here, we address this challenge by presenting a principled method to prescribe exact and robust functional configurations from local network interactions through optimal tuning of the oscillators’ parameters. To quantify the behavioral synchrony between coupled oscillators, we introduce the notion of functional pattern, which encodes the pairwise relationships between the oscillators’ phases. Our procedure is computationally efficient and provably correct, accounts for constrained interaction types, and allows to concurrently assign multiple desired functional patterns. Further, we derive algebraic and graph-theoretic conditions to guarantee the feasibility and stability of target functional patterns. These conditions provide an interpretable mapping between the structural constraints and their functional implications in oscillator networks. As a proof of concept, we apply the proposed method to replicate empirically recorded functional relationships from cortical oscillations in a human brain, and to redistribute the active power flow in different models of electrical grids.
The complex coordinated behavior of oscillatory components is linked to the function of many natural and technological network systems1,2,3. For instance, distinctive network-wide patterns of synchrony4,5,6 determine the coordinated motion of orbiting particle systems7, promote successful mating in populations of fireflies8, regulate the active power flow in electrical grids9, predict global climate change phenomena10, dictate the structural development of mother-of-pearl in mollusks11, and enable numerous cognitive functions in the brain12,13. Since this rich repertoire of patterns emerges from the properties of the underlying interaction network14, controlling the collective configuration of interdependent units holds tremendous potential across science and engineering15. Despite its practical significance, a comprehensive method to enforce network-wide patterns of synchrony by intervening in the network’s structural parameters does not yet exist.
In this work, we develop a rigorous framework that allows us to optimally control the spatial organization of the network components and their oscillation frequencies to achieve desired patterns of synchrony. We abstract the rhythmic activity of a system as the output of a network of diffusively coupled oscillators16,17 with Kuramoto dynamics. This modeling choice is motivated by the rich dynamical repertoire and wide adoption of Kuramoto oscillators18. Specifically, we consider an undirected network ({{{{{{{mathcal{G}}}}}}}}={{{{{{{{mathcal{O}}}}}}}},{{{{{{{mathcal{E}}}}}}}}}) of n oscillators with dynamics
where ({omega }_{i}in {mathbb{R}}) and ({theta }_{i}in {{mathbb{S}}}^{1}) are the frequency and phase of the ith oscillator, respectively, A = [Aij] is the weighted adjacency matrix of ({{{{{{{mathcal{G}}}}}}}}), and ({{{{{{{mathcal{O}}}}}}}}={1,ldots ,n}) and ({{{{{{{mathcal{E}}}}}}}}subseteq {{{{{{{mathcal{O}}}}}}}}times {{{{{{{mathcal{O}}}}}}}}) denote the oscillator and interconnection sets, respectively. In this work, we consider the case where the network ({{{{{{{mathcal{G}}}}}}}}) admits both cooperative (i.e., Aij > 0) and competitive (i.e., Aij < 0)19 interactions among the oscillators, as well as the more constrained case of purely cooperative interactions that arises in several real-word systems. For instance, negative interactions are not physically meaningful in networks of excitatory neurons, in power distribution networks (where the interconnection weight denotes conductance and susceptance of a transmission line), and in urban transportation networks (where interconnections denote the number of vehicles on a road with respect to its maximum capacity).
To quantify the pairwise functional relations between oscillatory units, and inspired by the work in ref. 20, we define a local order parameter that, compared to the classical Pearson correlation coefficient, does not depend on sampling time and is more convenient when dealing with periodic phase signals (see Supplementary Information). Given a pair of phase oscillators i and j with phase trajectories θi(t) and θj(t), we define the correlation coefficient
where 〈 ⋅ 〉t denotes the average over time. A functional pattern is formally defined as the symmetric matrix R whose i, jth entry equals ρij. Importantly, a functional pattern explicitly encodes the pairwise, local, correlations across all of the oscillators, which are more informative than a global observable (e.g., the order parameter16,21). It is easy to see that, if two oscillators i and j synchronize after a certain initial transient, ρij converges to 1 as time increases. If two oscillators i and j become phase-locked (i.e., their phase difference remains constant over time), then their correlation coefficient converges to some constant value with a magnitude smaller than 1. If the phases of two oscillators i and j evolve independently, then their correlation value remains small over time. A few questions arise naturally, which will be answered in this paper. Are all functional patterns achievable? Which network configurations allow for the emergence of multiple target functional patterns? And, if a certain functional pattern can be achieved, is it robust to perturbations? Surprisingly, we reveal that controlling functional patterns can be cast as a convex optimization problem, whose solution can be characterized explicitly. Figure 1 shows our framework and an example of control of functional patterns for a network with 7 oscillators. In the paper, we will validate our methods by replicating functional patterns from brain recordings in an empirically reconstructed neuronal network, and by controlling the active power distribution in multiple models of the power grid.
The left panel contains a network of n = 7 oscillators (top left panel, line thickness is proportional to the coupling strength), whose vector of natural frequencies ω has zero mean. The phase differences with respect to θ1 (i.e., θi−θ1) converge to (left[frac{pi }{8},frac{pi }{8},frac{pi }{6},frac{pi }{6},frac{pi }{3},frac{2pi }{3}right]), as also illustrated in the phases’ evolution from random initial conditions (bottom left panel, color coded). The center left panel depicts the functional pattern R corresponding to such phase differences over time. The right panel illustrates the same oscillator network after a selection of coupling strengths and natural frequencies have been tuned (in red, the structural parameters A and ω are adjusted to Ac and ωc) to obtain the phase differences (left[frac{2pi }{3},frac{pi }{3},frac{pi }{6},frac{pi }{6},frac{pi }{8},frac{pi }{8}right]), which encode the desired functional pattern in the center right. In this example, we have computed the closest set (in the ℓ1-norm sense) of coupling strengths and natural frequencies to the original ones that enforce the emergence of the target pattern. Importantly, only a subset of the original parameters has been modified.
While synchronization phenomena in oscillator networks have been studied extensively (e.g., see refs. 22,23,24,25,26), the development of control methods to impose desired synchronous behaviors has only recently attracted the attention of the research community27,28,29,30. Perhaps the work that is closest to our approach is ref. 28, where the authors tailor interconnection weights and natural frequencies to achieve a specified level of phase cohesiveness in a network of Kuramoto oscillators. Our work improves considerably upon this latter study, whose goal is limited to prescribing an upper bound to the phase differences, by enabling the prescription of pairwise differences and by investigating the stability properties of different functional patterns. Taken together, existing results highlight the importance of controlling distinct configurations of synchrony, but remain mainly focused on the control of “macroscopic” observables of synchrony (e.g., the average synchronization level of all the oscillators). In contrast, our control method prescribes desired pairwise levels of correlation across all of the oscillators, thus enabling a precise “microscopic” description of functional interactions.
A functional pattern is an n × n matrix whose entries are the time-averaged cosine of the differences in the oscillator phases (see Eq. (2)). When the oscillators reach an equilibrium, the differences of the oscillator phases become constant, and the network evolves into a phase-locked configuration. In this case, the functional pattern of the network also becomes constant and is uniquely determined by the phase differences at the equilibrium configuration. In this work, we study functional patterns for the special case of phase-locked oscillators and, since a functional pattern can be specified using a set of phase differences at equilibrium, convert the problem of generating a functional pattern into the problem of ensuring a desired phase-locked equilibrium. We recall that, while convenient for the analysis, phase-locked configurations play a crucial role in the functioning of many natural and man-made networks31,32,33.
For the undirected network ({{{{{{{mathcal{G}}}}}}}}=({{{{{{{mathcal{O}}}}}}}},{{{{{{{mathcal{E}}}}}}}})), let xij = θj−θi be the difference of the phases of the oscillators i and j, and let ({{{{{{{boldsymbol{x}}}}}}}}in {{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| }) be the vector of all phase differences with ((i,j)in {{{{{{{mathcal{E}}}}}}}}) and i < j. The network dynamics (1) can be conveniently rewritten in vector form as (see the “Methods” section)
where (Bin {{mathbb{R}}}^{ntimes | {{{{{{{mathcal{E}}}}}}}}| }) is the (oriented) incidence matrix of the network ({{{{{{{mathcal{G}}}}}}}}), (D({{{{{{{boldsymbol{x}}}}}}}})in {{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| times | {{{{{{{mathcal{E}}}}}}}}| }) is a diagonal matrix of the sine functions in Eq. (1), and ({{{{{{{boldsymbol{delta }}}}}}}}in {{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| }) is a vector collecting all the weights Aij with i < j. Because we focus on phase-locked trajectories, all oscillators evolve with the same frequency and the vector (dot{{{{{{{{boldsymbol{theta }}}}}}}}}) satisfies (dot{{{{{{{{boldsymbol{theta }}}}}}}}}={omega }_{{{{{{{{rm{mean}}}}}}}}}{{{{{{{bf{1}}}}}}}}), where ({omega }_{{{{{{{{rm{mean}}}}}}}}}=left(frac{1}{n}mathop{sum }nolimits_{i = 1}^{n}{omega }_{i}right)) is the average of the natural frequencies of the oscillators. Further, since ({{{{{{{mathcal{G}}}}}}}}) contains only n oscillators, any phase difference xij can always be written as a function of n−1 independent differences; for instance, {x12, x23, …, xn−1,n}. For instance, for any pair of oscillators i and j with i < j, it holds ({x}_{ij}=mathop{sum }nolimits_{k = i}^{j-1}{x}_{k,k+1}). This implies that the vector of all phase differences in equation (3), and in fact any n × n functional pattern, has only n − 1 degrees of freedom and can be uniquely specified with a set of n−1 independent differences xdesired (see the “Methods” section). Following this reasoning and to avoid cluttered notation, let ({{{{{{{boldsymbol{omega }}}}}}}}={[{omega }_{1}-{omega }_{{{{{{{{rm{mean}}}}}}}}}cdots {omega }_{n}-{omega }_{{{{{{{{rm{mean}}}}}}}}}]}^{{mathsf{T}}}), and notice that the problem of enforcing a desired functional pattern simplifies to (i) converting the desired functional pattern to the corresponding phase differences xdesired, and (ii) computing the network weights δ to satisfy the following equation:
where we note that the vector ω has zero mean and that, with a slight abuse of notation, D(x) denotes the (| {{{{{{{mathcal{E}}}}}}}}|)-dimensional diagonal matrix of the sine of the phase differences uniquely defined by the (n−1)-dimensional vector xdesired.
We begin by studying the problem of attaining a desired functional pattern using only nonnegative weights. With the above notation, for a desired functional pattern corresponding to the phase differences x, this problem reads as
It should be noticed that the feasibility of the optimization problem (5) depends on the sign of the entries of the diagonal matrix D(x), but is independent of their magnitude. To see this, notice that
where the sign( ⋅ ) and absolute value ∣ ⋅ ∣ operators are applied element-wise. Then, Problem (5) is feasible if and only if there exists a nonnegative solution to
The feasibility of the latter equation, in turn, depends on the projections of the natural frequencies ω on the columns of (bar{B}): a nonnegative solution exists if ω belongs to the cone generated by the columns of (bar{B}). This also implies that, if a network admits a desired functional pattern x then, by tuning its weights, the same network can generate any other functional pattern xnew such that sign(D(xnew)) = sign(D(x)). Thus, by properly tuning its weights, a network can generally generate a continuum of functional patterns determined uniquely by the signs of its incidence matrix and the oscillators natural frequencies. This property is illustrated in Fig. 2 for the case of a line network.
a A line network of n = 4 nodes and its parameters. The desired phase differences are shown in red. b Left panel: space of the phase differences; right panel: space of the interconnection weights. The pattern x is illustrated in red in the left panel, and the network weights that achieve such a pattern are represented in red in the right panel. For fixed natural frequencies ω, the green parallelepiped on the left represents the continuum of functional patterns within 0.2 radians from x which can be generated by the positive interconnection weights in the green parallelepiped on the right.
A sufficient condition for the feasibility of Problem (5) is as follows:
There exists δ ≥ 0 such that BD(x)δ = ω if there exists a set ({{{{{{{mathcal{S}}}}}}}}) satisfying:
(i.a) ({D}_{ii}({{{{{{{boldsymbol{x}}}}}}}}){D}_{jj}({{{{{{{boldsymbol{x}}}}}}}}){B}_{:,i}^{{mathsf{T}}}{B}_{:,j}le 0) for all (i,jin {{{{{{{mathcal{S}}}}}}}})with i ≠ j and Dii, Djj ≠ 0;
(i.b) ωTB:,iDii(x) > 0 for all (iin {{{{{{{mathcal{S}}}}}}}});
(i.c) ({{{{{{{boldsymbol{omega }}}}}}}}in {{{{{{{rm{Im}}}}}}}}({B}_{:,{{{{{{{mathcal{S}}}}}}}}})).
Equivalently, the above conditions ensure that ω is contained within the cone generated by the columns of ({bar{B}}_{:,{{{{{{{mathcal{S}}}}}}}}}) (see Fig. 3a for a self-contained example). To see this, rewrite the pattern assignment problem BD(x)δ = ω as
where the subscripts ({{{{{{{mathcal{S}}}}}}}}) and (tilde{{{mathcal{S}}}}) denote the entries corresponding to the set ({{{{{{{mathcal{S}}}}}}}}) and the remaining ones, respectively. If the vectors B:,i, (iin {{{{{{{mathcal{S}}}}}}}}), are linearly independent, condition (i.a) implies that ({D}_{{{{{{{{mathcal{S}}}}}}}},{{{{{{{mathcal{S}}}}}}}}}{B}_{:,{{{{{{{mathcal{S}}}}}}}}}^{{mathsf{T}}}{B}_{:,{{{{{{{mathcal{S}}}}}}}}}{D}_{{{{{{{{mathcal{S}}}}}}}},{{{{{{{mathcal{S}}}}}}}}}) is an M-matrix; that is, a matrix which has nonpositive off-diagonal elements and positive principal minors34. Otherwise, the argument holds verbatim by replacing ({{{{{{{mathcal{S}}}}}}}}) with any subset ({{{{{{{{mathcal{S}}}}}}}}}_{{{{{{{{rm{ind}}}}}}}}}subset {{{{{{{mathcal{S}}}}}}}}) such that the vectors B:,i, (iin {{{{{{{{mathcal{S}}}}}}}}}_{{{{{{{{rm{ind}}}}}}}}}), are linearly independent. Condition (i.c) guarantees the existence of a solution to ({B}_{:,{{{{{{{mathcal{S}}}}}}}}}{D}_{{{{{{{{mathcal{S}}}}}}}},{{{{{{{mathcal{S}}}}}}}}}{{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{S}}}}}}}}}={{{{{{{boldsymbol{omega }}}}}}}}). A particular solution to the latter equation is
where (⋅)† denotes the Moore–Penrose pseudo-inverse of a matrix. The positivity of ({{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{S}}}}}}}}}) follows from condition (i.b) and the fact that the inverse of an M-matrix is element-wise nonnegative34. We conclude that a solution to Eq. (6) is given by ({{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{S}}}}}}}}}={({B}_{:,{{{{{{{mathcal{S}}}}}}}}}{D}_{{{{{{{{mathcal{S}}}}}}}},{{{{{{{mathcal{S}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}))}^{{{{dagger}}} }{{{{{{{boldsymbol{omega }}}}}}}} , > , 0) and ({{{{{{{{boldsymbol{delta }}}}}}}}}_{tilde{{{{{{{{mathcal{S}}}}}}}}}}={0}).
a The left side illustrates a simple network of 3 oscillators with adjacency matrix (bar{B}) and vector of natural frequencies ω. The right side illustrates the cone generated by the columns of (bar{B}). In this example, ({{{{{{{mathcal{S}}}}}}}}={1,2}) satisfies the conditions for the existence of δ ≥ 0 in Eq. (5), as ω is contained within the cone generated by the columns ({bar{B}}_{:,{{{{{{{mathcal{S}}}}}}}}}). b The (directed) Hamiltonian path described by the columns of ({bar{B}}_{:,{{{{{{{mathcal{H}}}}}}}}}), with ({{{{{{{mathcal{H}}}}}}}}={1,2}), in the network of panel (a). c The existence of such an Hamiltonian path, together with a positive projection of ω onto ({bar{B}}_{:,{{{{{{{mathcal{H}}}}}}}}}), also ensure that there exists a strictly positive δ > 0 solution to BD(x)δ = ω. In particular, for any choice of x12, x23 ∈ (0, π), Eq. (4) reveals that if (0 , < ,{A}_{13} , < , 0.5/sin ({x}_{12}+{x}_{23})), then there exist strictly positive weights A12 > 0 and A23 > 0 such that δ > 0.
To avoid disconnecting edges or to maintain a fixed network topology, a functional pattern should be realized in Problem (5) using a strictly positive weight vector (that is, δ > 0 rather than δ ≥ 0). While, in general, this is a considerably harder problem, a sufficient condition for the existence of a strictly positive solution δ > 0 is that the network with incidence matrix (bar{B}) contains an Hamiltonian path, that is, a directed path that visits all the oscillators exactly once (Fig. 3b shows a network containing an Hamiltonian path). Namely,
There exists a strictly positive solution δ > 0 to BD(x)δ = ω if
(ii.a) the network with incidence matrix (bar{B}) contains a directed Hamiltonian path ({{{{{{{mathcal{H}}}}}}}});
(ii.b) ωTB:,iDii(x) > 0 for all (iin {{{{{{{mathcal{H}}}}}}}});
The incidence matrix ({bar{B}}_{:,{{{{{{{mathcal{H}}}}}}}}}) of a directed Hamiltonian path ({{{{{{{mathcal{H}}}}}}}}) has two key properties. First, it comprises n−1 linearly independent columns, since the path covers all the vertices and contains no cycles. This guarantees that ({{{{{{{boldsymbol{omega }}}}}}}}in {{{{{{{rm{Im}}}}}}}}({B}_{:,{{{{{{{mathcal{H}}}}}}}}})). Second, the columns of the incidence matrix ({bar{B}}_{:,{{{{{{{mathcal{H}}}}}}}}}) satisfy ({bar{B}}_{:,i}^{{mathsf{T}}}{bar{B}}_{:,i}=2) and ({bar{B}}_{:,i}^{{mathsf{T}}}{bar{B}}_{:,j}in {0,-1}) for all (i,jin {{{{{{{mathcal{H}}}}}}}}), i ≠ j. Then, letting the set ({{{{{{{mathcal{S}}}}}}}}) in the result above identify the columns of the Hamiltonian path, conditions (ii.a) and (ii.b) imply (i.a)–(i.c), thus ensuring the existence of a nonnegative set of weights δ that solves the pattern assignment problem BD(x)δ = ω. Furthermore, by rewriting the pattern assignment problem as in Eq. (6), the following vector of interconnection weights solves such an equation (see the “Methods” section):
Because ({bar{B}}_{:,{{{{{{{mathcal{H}}}}}}}}}={B}_{:,{{{{{{{mathcal{H}}}}}}}}}{D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}) defines an Hamiltonian path and because of (ii.b), the vector ({({B}_{:,{{{{{{{mathcal{H}}}}}}}}}{D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}))}^{{{{dagger}}} }{{{{{{{boldsymbol{omega }}}}}}}}) contains only strictly positive entries. Thus, for any sufficiently small and positive vector ({{{{{{{{boldsymbol{delta }}}}}}}}}_{tilde{{{{{{{{mathcal{H}}}}}}}}}}), the weights ({{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{H}}}}}}}}}) are also strictly positive, ultimately proving the existence of a strictly positive solution to the pattern assignment problem (see the “Methods” section). Figure 3c illustrates a self-contained example.
Taken together, the results presented in this section reveal that the interplay between the network structure and the oscillators’ natural frequencies dictates whether a desired functional pattern is achievable under the constraint of nonnegative (or even strictly positive) interconnections. First, dense positive networks with a large number of edges are more likely to generate a desired functional pattern, since their incidence matrix features a larger number of candidate vectors to satisfy conditions (i.a)–(i.c). Second, densely connected networks are also more likely to contain an Hamiltonian path, thus promoting also strictly positive network designs. Third, after an appropriate relabeling of the oscillators such that any interconnection from i to j in the Hamiltonian path satisfies i < j, condition (ii.b) is equivalent to requiring that ωi < ωj. That is, the feasibility of a functional pattern is guaranteed when the natural frequencies increase monotonically with the ordering identified by the Hamiltonian path. This also implies, for instance, that sparsely connected positive networks, and not only dense ones, can attain a large variety of functional patterns. An example is a connected line network with increasing natural frequencies, which can generate, among others, any functional pattern defined by phase differences that are smaller than (frac{pi }{2}) (trivially, when the phase differences are smaller than (frac{pi }{2}) and the natural frequencies are increasing, a line network contains an Hamiltonian path and the vector of natural frequencies has positive projections onto the columns of the incidence matrix). Figure 2a contains an example of such a network.
A single choice of the interconnections weights can allow for multiple desired functional patterns, as long as they are compatible with the network dynamics in Eq. (1). In this section, we provide a characterization of compatible functional patterns in a given network, and derive conditions for the existence of a set of interconnection weights that achieve multiple desired functional patterns. Being able to concurrently assign multiple functional patterns is crucial, for instance, to the investigation and design of memory systems35, where different patterns of activity correspond to distinct memories. Furthermore, our results complement previous work on the search for equilibria in oscillator networks36.
To find a set of functional patterns that exist concurrently in a given network with fixed interconnection weights δ, we exploit the algebraic core of Eq. (4) and show that the kernel of the incidence matrix B uniquely determines the equilibria of the network. In fact, for a given network (i.e., δ with nonzero components) all compatible equilibria x(i), i ∈ {1, …, ℓ}, must satisfy
From Eq. (7), we can see that the sine vector of all compatible equilibria must belong to a specific affine subspace of ({{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| }):
Rewriting Eq. (4) in the above form connects the existence of distinct functional patterns with (ker (B)), the latter featuring a number of well-known properties. For instance, it holds that (dim (ker (B))=| {{{{{{{mathcal{E}}}}}}}}| -n+c), where c is the number of connected components in a network, and that (ker (B)) coincides with the subspace spanned by the signed path vectors of all undirected cycles in the network37. Notice also that, after a suitable reordering of the phase differences in x, we can write (sin ({{{{{{{boldsymbol{x}}}}}}}})={[sin ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}^{{mathsf{T}}})sin ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{dep}}}}}}}}}^{{mathsf{T}}})]}^{{mathsf{T}}}), where xdep denotes the phase differences dependent on n−1 desired phase differences xdesired. Thus, all the xdesired for which (sin ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{dep}}}}}}}}})) intersects the affine space described by ({{{{{{{rm{diag}}}}}}}}{({{{{{{{boldsymbol{delta }}}}}}}})}^{-1}({B}^{{{{dagger}}} }{{{{{{{boldsymbol{omega }}}}}}}}+ker (B))) identify compatible functional patterns.
To showcase how the intimate relationship between the network structure and the kernel of its incidence matrix enables the characterization of which (and how many) compatible patterns coexist, we consider three essential network topologies: trees, cycles, and complete graphs. For the sake of simplicity, we let δ = 1 and ω = 0, so that Eq. (8) holds whenever (sin ({{{{{{{{boldsymbol{x}}}}}}}}}^{(i)})in ker (B)). In networks with tree topologies it holds (ker (B)={{{{0}}}}), and (sin ({{{{{{{{boldsymbol{x}}}}}}}}}^{(i)})={{{{0}}}}) is satisfied by 2n−1 patterns of the form ({x}_{jk}^{(i)}=0,pi), for all ((j,k)in {{{{{{{mathcal{E}}}}}}}}). Consider now cycle networks, where (ker (B)={{{{{{{rm{span}}}}}}}},{{{{{{{boldsymbol{1}}}}}}}}). For any cycle of n ≥ 3 oscillators, two families of patterns are straightforward to derive. First, there are 2n−1 patterns of the form ({{{{{{{{boldsymbol{x}}}}}}}}}_{k,k+1}^{(i)}=0,pi), with k = 1, …, n−1, and ({x}_{n1}^{(i)}=-mathop{sum }nolimits_{k = 1}^{n-1}{x}_{k,k+1}^{(i)}). Second, there are n−1 splay states17, where the oscillators’ phases evenly span the unitary circle, with ({x}_{jk}^{(i)}=frac{2pi m}{n}), m = 1, …, n−1, ((j,k)in {{{{{{{mathcal{E}}}}}}}}). Figure 4 illustrates the compatible functional patterns satisfying Eq. (8) in a positive network of three fully synchronizing oscillators. In general, however, cycle networks of identical oscillators admit infinite coexisting patterns. For instance, Fig. 5 shows how we can parameterize infinite equilibria with a scalar (gamma in {{mathbb{S}}}^{1}) in a cycle of n = 4 oscillators. Finally, as complete graphs are equivalent to a composition of cycles, they also admit infinite compatible patterns that can be parameterized akin to what occurs in a simple cycle (see Supplementary Fig. 2).
Consider a fully connected network of n = 3 identical oscillators with zero natural frequency and δ = 1. It is well known that x(1) = [0 0]T, x(2) = [π 0]T, x(3) = [0 π]T, x(4) = [π π]T are phase difference equilibria. Furthermore, because (sin (theta )=sin (pi -theta )), this figure illustrates (sin ({x}_{13})) as a function of x12 and x23 in four different panels: (sin ({x}_{12}+{x}_{23})) (top left), (sin (pi -{x}_{12}+{x}_{23})) (top right), (sin ({x}_{12}+pi -{x}_{23})) (bottom left), and (sin (-{x}_{12}-{x}_{23})) (bottom right). The fourth panel reveals that the two functional patterns compatible with x(j), j ∈ {1, …, 4}, correspond to x(5) = [2π/3 2π/3]T and x(6) = [−2π/3 −2π/3]T (in red).
Since (ker (B)={{{{{{{rm{span}}}}}}}},{{{{{{{boldsymbol{1}}}}}}}}), the cycle network admits infinite compatible equilibria, which can be parameterized by (gamma in {{mathbb{S}}}^{1}) as ({{{{{{{{boldsymbol{x}}}}}}}}}^{(i)}(gamma )={[frac{pi }{2}-gamma ,frac{pi }{2}+gamma ,frac{pi }{2}-gamma ,frac{pi }{2}+gamma ]}^{{mathsf{T}}}). Any arbitrarily small variation of γ yields (sin ({{{{{{{{boldsymbol{x}}}}}}}}}^{(i)}(gamma ))in ker (B)). The right panel illustrates the patterns associated with x(i)(γ), i = 1, …, 5 for increments of γ of 0.2 radians.
We now turn our attention to finding the interconnection weights that simultaneously enable a collection of ℓ ≥ 1 desired functional patterns ({{{{{{{{{{boldsymbol{x}}}}}}}}}^{(i)}}}_{i = 1}^{ell }). We first notice that Eq. (7) reveals that to achieve a desired functional pattern x(i) with components not equal to kπ, (kin {mathbb{Z}}), the network weights δ must belong to an (| {{{{{{{mathcal{E}}}}}}}}|)-dimensional affine subspace of ({{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| }):
Let ({{{Gamma }}}_{i}=D{({{{{{{{{boldsymbol{x}}}}}}}}}^{(i)})}^{-1}({B}^{{{{dagger}}} }{{{{{{{boldsymbol{omega }}}}}}}}+ker (B))). Then, to concurrently realize a collection of patterns ({{{{{{{{{{boldsymbol{x}}}}}}}}}^{(i)}}}_{i = 1}^{ell }), a solution to Eq. (9) exists if and only if (mathop{bigcap }nolimits_{i = 1}^{ell }{{{Gamma }}}_{i};ne; {{emptyset}}). It is worth noting that, whenever the latter intersection coincides with a singleton, then there exists a single choice of network weights that realizes ({{{{{{{{{{boldsymbol{x}}}}}}}}}^{(i)}}}_{i = 1}^{ell }). However, if (mathop{bigcap }nolimits_{i = 1}^{ell }{{{Gamma }}}_{i}) corresponds to a subspace, then infinite networks can realize the desired collection of functional patterns. We conclude by emphasizing that a positive δ that achieves the desired patterns exists if and only if ((mathop{bigcap }nolimits_{i = 1}^{ell }{{{Gamma }}}_{i})cap {{mathbb{R}}}_{ge 0}^{| {{{{{{{mathcal{E}}}}}}}}| }ne {{emptyset}}). That is, if the network weights belong to the nonempty intersection of the ℓ affine subspaces with the positive orthant.
A functional pattern is stable when small deviations of the oscillators phases from the desired configuration lead to vanishing functional perturbations. Stability is a desired property since it guarantees that the desired functional pattern is robust against perturbations to the oscillators dynamics. To study the stability of a functional pattern, we analyze the Jacobian of the Kuramoto dynamics at the desired functional configuration, which reads as17
where ({{{{{{{mathcal{L}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}})) denotes the Laplacian matrix of the network with weights scaled by the cosines of the phase differences (the weight between nodes i and j is ({A}_{ij}cos ({theta }_{j}-{theta }_{i}))). The functional pattern x is stable when the eigenvalues of the above Jacobian matrix have negative real parts. For instance, if all phase differences are strictly smaller than (frac{pi }{2}) (that is, the infinity-norm of x satisfies (parallel {{{{{{{boldsymbol{x}}}}}}}},{parallel }_{infty } < frac{pi }{2})), then the Jacobian in Eq. (10) is known to be stable17. In the case that both cooperative and competitive interactions are allowed, we can ensure stability of a desired pattern by specifying the network weights in δ such that Aij > 0 if (| {x}_{ij}| < frac{pi }{2}) and Aij < 0 otherwise, so that the matrix ({{{{{{{mathcal{L}}}}}}}}) becomes the Laplacian of a positive network (see Methods). Furthermore, we observe that in the particular case where some differences (| {x}_{ij}| =frac{pi }{2}), the network may become disconnected since (cos ({x}_{ij})=0). Because the Laplacian of a disconnected network has multiple eigenvalues at zero, marginal stability may occur, and phase trajectories may not converge to the desired pattern.
When some phase differences are larger than (frac{pi }{2}) and the network allows only for nonnegative weights, then stability of a functional pattern is more difficult to assess because the Jacobian matrix becomes a signed Laplacian38. The off-diagonal entries of a signed Laplacian satisfy ({{{{{{{{mathcal{L}}}}}}}}}_{ij} ; > ; 0) whenever (| {x}_{ij}| > frac{pi }{2}), thus possibly changing the sign of its diagonal entries ({{{{{{{{mathcal{L}}}}}}}}}_{ii}={sum }_{j}{A}_{ij}cos ({x}_{ij})) and violating the conditions for the use of classic results from algebraic graph theory for the stability of Laplacian matrices. To derive a condition for the instability of the Jacobian in Eq. (10), we exploit the notion of structural balance. We say that the cosine-scaled network with Laplacian matrix ({{{{{{{mathcal{L}}}}}}}}) is structurally balanced if and only if its oscillators can be partitioned into two sets, ({{{{{{{{mathcal{O}}}}}}}}}_{1}) and ({{{{{{{{mathcal{O}}}}}}}}}_{2}), such that all ((i,j)in {{{{{{{mathcal{E}}}}}}}}) with ({A}_{ij}cos ({x}_{ij}) ; < ; 0) connect oscillators in ({{{{{{{{mathcal{O}}}}}}}}}_{1}) to oscillators in ({{{{{{{{mathcal{O}}}}}}}}}_{2}), and all ((i,j)in {{{{{{{mathcal{E}}}}}}}}) with ({A}_{ij}cos ({x}_{ij}) ; > ; 0) connect oscillators within ({{{{{{{{mathcal{O}}}}}}}}}_{i}), i ∈ {1, 2}. If a network is structurally balanced, then its Laplacian has mixed eigenvalues38. Therefore, we conclude the following:
If the functional pattern x yields a structurally balanced cosine-scaled network, then x is unstable.
The above condition allows us to immediately assess the instability of functional patterns for the special cases of line and cycle networks. In fact, for a line network with positive weights, x is unstable whenever (| {x}_{ij}| ; > ; frac{pi }{2}) for any i, j. Instead, for a cycle network with positive weights, the pattern x can be stable only if it contains at most one phase difference (frac{pi }{2} ; < ; | {x}_{ij}| < gamma), where γ ≈ 1.789776 solves (gamma -tan (gamma )=2pi) (see Supplementary Information). In the next section, we propose a heuristic procedure to correct the interconnection weights in positive networks to promote stability of a functional pattern.
Armed with conditions to guarantee the existence of positive interconnections that enable a desired functional pattern, we now show that the problem of adjusting the network weights to generate a desired functional pattern can be cast as a convex optimization problem. Formally, for a desired functional pattern x and network weights δ, we seek to solve
where ({{{{{{{boldsymbol{alpha }}}}}}}}in {{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| }) are the controllable modifications of the network weights, and ∥ ⋅ ∥2 denotes the ℓ2-norm. Figure 6a illustrates the control of a functional pattern in a line network of n = 4 oscillators.
a For the line network in Fig. 2a, we solve Problem (11) to assign the desired pattern ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}={[frac{4pi }{5}frac{pi }{3}frac{pi }{10}]}^{{mathsf{T}}}). The starting pattern ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{original}}}}}}}}}={[frac{pi }{10}frac{pi }{3}frac{4pi }{5}]}^{{mathsf{T}}}) is associated with interconnection weights δ = [3.4026 3.4641 6.4721]T. Applying the optimal correction α* yields positive interconnection weights δ + α* = [6.4721 3.4026 3.4641]T that achieve the desired functional patterns xdesired. b Joint allocation of two compatible equilibria for the phase difference dynamics. By taking θ1 as a reference, we choose two points for the phase differences x1i = θi − θ1, i ∈ {2, …, 7}, to be imposed as equilibria in a network of n = 7 oscillators: ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}^{(1)}={left[frac{pi }{6}frac{pi }{6}frac{pi }{4}frac{pi }{4}frac{pi }{6}frac{pi }{4}right]}^{{mathsf{T}}}) and ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}^{(2)}={left[frac{pi }{8}frac{pi }{3}frac{pi }{4}frac{pi }{4}frac{pi }{6}frac{pi }{4}right]}^{{mathsf{T}}}). In this example, we find a set of interconnection weights (δ + α*) that solves the minimization problem (11) with constraint (12). The trajectories start at the (unstable) equilibrium point ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}^{(1)}) at time t = 0, and converge to the point ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}^{(2)}) after a small perturbation ({{{{{{{boldsymbol{p}}}}}}}}in {{mathbb{T}}}^{7}), with π ∈ [0 0.05], is applied to the phase difference trajectories at time t = 50.
The minimization problem (11) is convex, thus efficiently solvable even for large networks, and may admit multiple minimizers, thus showing that different networks may exhibit the same functional pattern. Moreover, in light of our results above, Problem (11) can be easily adapted to assign a collection of desired patterns ({{{{{{{{{{boldsymbol{x}}}}}}}}}^{(i)}}}_{i = 1}^{ell }). To do so, we simply replace the constraint (11a) with
Figure 6b illustrates an example where we jointly allocate two functional patterns for a complete graph with n = 7 oscillators (see Supplementary Information for more details on this example).
Note that the minimization problem (11) does not guarantee that the functional pattern x is stable for the network with weights δ + α*. To promote stability of the pattern x, we use a heuristic procedure based on the classic Gerschgorin’s theorem39. Recall that the stability of x is guaranteed when the associated Jacobian matrix has a Laplacian structure, with negative diagonal entries and nonnegative off-diagonal entries. Further, instability of x depends primarily on the negative off-diagonal entries ({A}_{ij}cos ({x}_{ij})) of the Jacobian (these entries are negative because the sign of the network weight Aij is different from the sign of the cosine of the desired phase difference xij). Therefore, reducing the magnitude of such entries Aij heuristically moves the eigenvalues of the Jacobian towards the stable half of the complex plane (this phenomenon can be captured using the Gerschgorin circles, as we show in Fig. 7 for a network with 7 nodes). To formalize this procedure, let ({{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{N}}}}}}}}}) and ({{{{{{{{boldsymbol{alpha }}}}}}}}}_{{{{{{{{mathcal{N}}}}}}}}}) denote the entries of the weights δ and tuning vector α, respectively, that are associated to negative interconnections ({A}_{ij}cos ({x}_{ij}) , < , 0) in the cosine-scaled network. Then, the optimization problem that enacts the proposed strategy becomes:
For the 7-oscillator network in Supplementary Text 1.5, we apply the procedure in equation (13) to achieve stability of the pattern ({{{{{{{{boldsymbol{x}}}}}}}}}_{{{{{{{{rm{desired}}}}}}}}}={left[frac{21pi }{32}frac{pi }{6}frac{pi }{6}frac{pi }{8}frac{pi }{8}frac{pi }{3}right]}^{{mathsf{T}}}), where ({x}_{12}={theta }_{2}-{theta }_{1} > frac{pi }{2}). The left plot illustrates the Gerschgorin disks (in blue) and the Jacobian’s eigenvalues locations for the original network (as dark dots). The complex axis is highlighted in purple. It can be observed in the zoomed-in panel that one eigenvalue is unstable (λ2 = 0.0565, in red). The optimal correction α* is gradually applied to the existing interconnections from the left-most panel to the right-most one at (frac{1}{3}) increments. The right zoomed-in panel shows that, as a result of our procedure, n − 1 eigenvalues ultimately lie in the left-hand side of the complex plane (λ1 = 0 due to rotational symmetry and λ2 = − 0.0178, in green).
Carefully reducing the weights ({{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{N}}}}}}}}}+{{{{{{{{boldsymbol{alpha }}}}}}}}}_{{{{{{{{mathcal{N}}}}}}}}}) promotes stability of the target pattern. Figure 7 illustrates the shift of the Jacobian’s eigenvalues while the optimal tuning vector α* is gradually applied to a 7-oscillator network to achieve stability of a functional pattern containing negative correlations (the network parameters can be found in the Supplementary Information). Finally, we remark that the procedure in Eq. (13) can be further refined by introducing scaling constants to penalize ({leftVert {{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{N}}}}}}}}}+{{{{{{{{boldsymbol{alpha }}}}}}}}}_{{{{{{{{mathcal{N}}}}}}}}}rightVert }_{2}) differently from the modification of other interconnection weights (see Supplementary Information for further details and an example).
The minimization problems (11) and (13) do not allow us to tune the oscillators’ natural frequencies, and are constrained to networks with positive weights. When any parameter of the network is unconstrained and can be adjusted to enforce a desired functional pattern, the network optimization problem can be generalized as
where β denotes the correction to the natural frequencies. Problem (14) always admits a solution because β can be chosen to satisfy the constraint (14a) for any choice of the network parameters δ + α. Further, the (unique) solution to the minimization problem (14) can also be computed in closed form:
where In denotes the n × n identity matrix.
We conclude this section by noting that the minimization problems (11)–(14) can be readily extended to include other vector norms besides the ℓ2-norm in the cost function (e.g., the ℓ1-norm to promote sparsity of the corrections), and to be applicable to directed networks. The latter extension can be attained by replacing the constraints (11a) and (14a) with a suitable rewriting of the matrix form (4). We refer the interested reader to the Supplementary Information for a comprehensive treatment of this extension and an example.
In the remainder of this paper, we apply our methods to an empirically reconstructed brain network and to the IEEE 39 New England power distribution network. In the former case, we use the Kuramoto model to map structure to function and find that local metabolic changes underlie the emergence of functional patterns of recorded neural activity. In the latter case, we use our methods to restore the nominal network power flow after a fault.
The brain can be studied as a network system in which Kuramoto oscillators approximate the rhythmic activity of different brain regions12,30,40,41. Over short time frames, the brain is capable of exhibiting a rich repertoire of functional patterns while the network structure and the interconnection weights remain unaltered. Functional patterns of brain activity not only underlie multiple cognitive processes but can also be used as biomarkers for different psychiatric and neurological disorders42.
To shed light on the structure–function relationship of the human brain, we utilize Kuramoto oscillators evolving on an empirically reconstructed brain network. We hypothesize that the intermittent emergence of diverse patterns stems from changes in the oscillators’ natural frequencies—which can be thought of as endogenous changes in metabolic regional activity regulated by glial cells43 or exogenous interventions to modify undesired synchronization patterns30. First, we show that phase-locked trajectories of the Kuramoto model in Eq. (1) can be accurately extracted from noisy measurements of neural activity and are a relatively accurate approximation of empirical data.
We employ structural (i.e., interconnections between brain regions) and functional (i.e., time series of recorded neural activity) data from ref. 40. Structural connectivity consists of a sparse weighted matrix A whose entries represent the strength of the physical interconnection between two brain regions. Functional data comprise time series of neural activity recorded through functional magnetic resonance imaging (fMRI) of healthy subjects at rest. Because the phases of the measured activity have been shown to carry most of the information contained in the slow oscillations recorded through fMRI time series, we follow the steps in ref. 40 to obtain such phases from the data by filtering the time series in the [0.04, 0.07] Hz frequency range (Supplementary Information). Next, since frequency synchronization is thought to be a crucial enabler of information exchange between different brain regions and homeostasis of brain dynamics44,45, we focus on functional patterns that arise from phase-locked trajectories, as compatible with our analysis. For simplicity, we restrict our study to the cingulo-opercular cognitive system, which, at the spatial scale of our data, comprises n = 12 interacting brain regions46.
We identify time windows in the filtered fMRI time series where the signals are phase-locked, and compute two matrices for each time window: a matrix (Fin {{mathbb{R}}}^{12times 12}) of Pearson correlation coefficients (also known as functional connectivity), and a functional pattern (Rin {{mathbb{R}}}^{12times 12}) (as in equation (2)) from the phases extracted by solving the nonconvex phase synchronization problem47. Strikingly, we find that ∥F−R∥2 ≪ 1 consistently (see Supplementary Information and Supplementary Fig. 7b), thus demonstrating that our definition of the functional pattern is a good replacement for the classical Pearson correlation arrangements in networks with oscillating states.
Building upon the above finding, we test whether the oscillators’ natural frequencies embody the parameter that links the brain network structure to its function (i.e., structural and functional matrices). We set ω = BD(x)δ, where x are phase differences obtained from the previous step, and integrate the Kuramoto model in Eq. (1) with random initial conditions close to x. We show in Fig. 8 that the assignment of natural frequencies according to the extracted phase differences promotes spontaneous synchronization to accurately replicate the empirical functional connectivity F.
The anatomical brain organization provides the network backbone over which the oscillators evolve. The filtered fMRI time series provide the relative phase differences between co-fluctuating brain regions, and thus define the desired phase differences x, which is used to calculate the metabolic change encoded in the oscillators’ natural frequencies. In this figure, we select the 40-s time window from t0 = 498 s to tf = 538 s for subject 18 in the second scanning session. We obtain ∥R−F∥2 = 0.2879. Additionally, we verify that the analysis of the Jacobian spectrum (see Eq. (10)) accurately predicts the stability of the phase-locked trajectories. Supplementary Fig. 7a illustrates the basin of attraction of R, which we numerically estimate to be half of the torus.
These results corroborate the postulate that structural connections in the brain support the intermittent activation of specific functional patterns during rest through regional metabolic changes. Furthermore, we show that the Kuramoto model represents an accurate and interpretable mapping between the brain anatomical organization and the functional patterns of frequency-synchronized neural co-fluctuations. Once a good mapping is inferred, it can be used to define a generative brain model to replicate in silico how the brain efficiently enacts large-scale integration of information, and to develop personalized intervention schemes for neurological disorders related to abnormal synchronization phenomena48,49.
Efficient and robust power delivery in electrical grids is crucial for the correct functioning of this critical infrastructure. Modern, reconfigurable power networks are expected to be resilient to distributed faults and malicious cyber-physical attacks50 while being able to rapidly adapt to varying load demands. In addition, climate change is straining service reliability, as underscored by recent events such as the Texas grid collapse after Winter Storm Uri in February 202151, and the New Orleans blackout after Hurricane Ida in August 202152. Therefore, there exists a dire need to design control methods to efficiently operate these networks and react to unforeseen disruptive events.
The Kuramoto model in Eq. (1) has been shown to be particularly relevant in the modeling of large distribution networks and microgrids9. Preliminary work on the control of frequency synchronization in electrical grids modeled through Kuramoto oscillators has been developed in ref. 53. Here, we present a method that leverages our findings to guarantee not only frequency synchronization but also a target pattern of active power flow. Our method can be used for power (re)distribution with respect to specific pricing strategies, fault prevention (e.g., when a line overheats), and recovery (e.g., after the disconnection of a branch). Furthermore, thanks to the formal guarantees that our method prescribes, we are able to prevent Braess’ Paradox in power networks54, which is a phenomenon where the addition of interconnections to a network may impede its synchronization.
It has been shown in ref. 9, Lemma 1 that the load dynamics (nodes 1–29 in Fig. 9a) in a structure-preserving power grid model have the same stable synchronization manifold of Eq. (1). In this model, ({omega }_{i}={p}_{{ell }_{i}}/{D}_{i}) is the active power load at node i, where Di is the damping coefficient, and ({A}_{ij}=| {v}_{i}| | {v}_{j}| {{{{{{{mathcal{I}}}}}}}}({Y}_{ij})/{D}_{i}), with vi denoting the nodal voltage magnitude and ({{{{{{{mathcal{I}}}}}}}}({Y}_{ij})) being the imaginary part of the admittance Yij (see Supplementary Information for details about this model). In this example, we choose a highly damped scenario where Di = 1, which is possibly due to local excitation controllers. Notice that, when the phase angles θ are phase-locked and Aij is fixed, the active power flow is given by ({A}_{ij}sin ({theta }_{j}-{theta }_{i})).
a New England power distribution network. The generator terminal buses illustrate the type of generator (coal, nuclear, hydroelectric). We simulate a fault by disconnecting the transmission line 25 (between loads 13 and 14). b The fault causes the voltage phases θ to depart from normal operating conditions, which could cause overheating of some transmission lines (due to violation of the nominal thermal constraint limits) or abnormal power delivery. To recover the pre-fault active power flow and promote a local (sparse) intervention, we solve the optimization in Eq. (11) by minimizing the 1-norm of the structural parameter modification δ with no scaling parameters in the cost functional. The network returns to the initial operative conditions with a localized modification of the neighboring transmission lines’ impedances.
We posit that solving the problem in Eq. (11) to design a local reconfiguration of the network parameters can recover the power distribution before a line fault or provide the smallest parameter changes to steer the load powers to desired values. In practice, control devices such as flexible alternating current transmission systems (FACTs) allow operators and engineers to change the network parameters55,56. We demonstrate the effectiveness of our approach by recovering a desired power distribution in the IEEE 39 New England power distribution network after a fault. During a regime of normal operation, we simulate a fault by disconnecting the line between two loads and solve the problem in Eq. (11) to find the minimum modification of the couplings aij that recovers the nominal power distribution.
We first utilize MATPOWER57 to solve the power flow problem. Then we use the active powers pℓ and voltages v at the buses to obtain the natural frequencies ω and the adjacency matrix A of the oscillators, respectively, while the voltage phase angles are used as initial conditions θ(0) for the Kuramoto model in equation (1). We integrate the Kuramoto dynamics and let the voltage phases θ(t) reach a frequency-synchronized steady state, which corresponds to a normal operating condition. The phase differences also represent a functional pattern across the loads. Next, to simulate a line fault, we disconnect one line. By solving the problem in Eq. (11) with xdesired corresponding to the pre-fault steady-state voltage phase differences, we compute the smallest variation of the remaining parameters (i.e., admittances) so that the original functional pattern can be recovered. Figure 9b illustrates the effectiveness of our procedure at recovering the nominal pattern of active power flow by means of minimal and localized interventions (see also Supplementary Fig. 8).
The above application is based on a classical lossless structure-preserving power network model9. However, in the power systems literature, more complex dynamics that relax some of the modeling assumptions have been proposed. For instance, ref. 58 uses a third-order model (or one-axis model) that takes into account transient voltage dynamics. Instead, ref. 59 studies the case of interconnections with power losses, which lead to a network of phase-lagged Kuramoto–Sakaguchi oscillators60. We show in the Supplementary Information that our procedure to recover a target functional pattern can still be applied successfully to a wide range of situations involving these more realistic models.
Distinct configurations of synchrony govern the functioning of oscillatory network systems. This work presents a simple and mathematically grounded mapping between the structural parameters of arbitrary oscillator networks and their components’ functional interactions. The tantalizing idea of prescribing patterns in networks of oscillators has been investigated before, yet only partial results had been reported in the literature. Here, we demonstrate that the control of patterns of synchrony can be cast as optimal (convex) design and tuning problems. We also investigate the feasibility of such optimizations in the cases of networks that admit negative coupling weights and networks that are constrained to positive couplings. Our control framework also allows us to prescribe multiple desired equilibria in Kuramoto networks, a problem that is relevant in practice and had not been investigated before.
As stability of a functional pattern may be a compelling property in many applications, we explore conditions to test and enforce the stability of functional patterns. We show that such conditions are rather straightforward in the case of networks that admit both cooperative and competitive interactions. However, stability of target functional patterns in networks that are constrained to only cooperative interactions is a more challenging task, for which we demonstrate that any pattern associated with a structurally balanced cosine-weighted network cannot be stable. To overcome this issue, we propose a heuristic procedure that adjusts the oscillators’ coupling strengths to violate the structurally balanced property and promote the stability of functional patterns with negative correlations. While heuristic, our procedure for stability has proven successful in all our numerical studies. Notice that, differently from methods that study an “average” description of the system at a near-synchronous state (see, e.g., ref. 61), here we assess the stability of exact target phase-locked trajectories where phase values can instead be arbitrarily spread over the torus. This method can also be extended to assess the stability of equilibria of higher-dimensional oscillators, provided that the considered equilibrium state is a fixed point.
We emphasize that our results are also intimately related to the long-standing economic problem of enhancing network operations while optimizing wiring costs. In any complex system where synchrony between components ensures appropriate functions, it is beneficial to maximize synchronization while minimizing the physical variations of the interconnection weights62. Compatible with this principle, neural systems are thought to have evolved to maximize information processing by promoting synchronization through optimal spatial organization63. Inspired by the efficiency observed in neurobiological circuitry, Eq.(11) could be utilized for the design of optimal interaction schemes in large-scale computer networks whose performance relies on synchronization-based tasks64.
An important consideration that highlights the general contributions of the present study is that being able to specify pairwise functional relationships between the oscillators also solves problems such as phase-locking, full, and cluster synchronization. Yet, the converse is not true. In fact, even in the general setting of cluster synchronization65—where distinct groups of oscillators behave cohesively—one can only achieve a desired synchronization level within the same cluster, but not across clusters, which instead is possible with our approach. Specifically, in cluster synchronization, oscillators belonging to the same cluster are forced to synchronize, thus implying that the associated diagonal blocks of the functional pattern R display values close to 1. Seminal work in ref. 66 developed a nonlinear feedback control to change the coupling functions in Eq. (2) to engineer clusters of synchronized oscillators, whereas the authors of ref. 67 propose the formation of clusters through selective addition of interconnections to the network. More recently, the control of partially synchronized states with applications to brain networks is studied in ref. 30 by means of structural interventions, and in ref. 68 via exogenous stimulation. Ultimately, the results presented in this work not only complement but go well beyond the control of macroscopic synchronization observables and partial synchronization by allowing to specify the synchrony level of pairwise interactions.
While our contributions include the analysis of the stability properties of functional patterns, here we do not assess their basins of attraction. We emphasize that, in general, the estimation of the basin of attraction of the attractors of nonlinear systems remains an outstanding problem, and even the most recent results rely on numerical approaches or heavy modeling assumptions69. Further, in the case of coupled Kuramoto oscillators, existing literature shows that the number of equilibria for the phase differences increases significantly with the cardinality of the network36, making the study of basins of attraction extremely challenging. In the Supplementary Information, we extend previous work on identical oscillators to networks with heterogeneous oscillators, and show that functional patterns can be at most almost-globally stable in cluster-synchronized positive networks. Yet, a precise estimation of the basin of attraction for any arbitrary target pattern goes beyond the scope of this work and may require the derivation of ad-hoc principles based on Lyapunov’s stability theory70.
The framework presented in this work has other limitations, which can be addressed in follow-up studies. First, despite its capabilities in modeling numerous oscillatory network systems, the Kuramoto model cannot capture the amplitude of the oscillations, making it most suitable for oscillator systems where most of the information is conveyed by phase interaction as demonstrated in ref. 40 for resting brain activity. To model brain activity during cognitively demanding tasks such as learning, higher-dimensional oscillators may be more suitable71. Second, the use of phase-locked trajectories is instrumental to the control and design of functional patterns. Yet, it is not necessary. In fact, restricting the control to phase-locked dynamics does not capture exotic dynamical regimes in which only a subset of the oscillators is frequency-synchronized. Third and finally, in some situations, the network parameters are not fully known. While still an active area of research, network identification of oscillator systems may be employed in such scenarios72.
Directions of future research can be both of a theoretical and practical nature. For instance, follow-up studies can focus on the derivation of a general condition for the stability of a feasible functional pattern in positive networks. Further, a thorough investigation of which network structures allow for multiple prescribed equilibria may be particularly relevant in the context of memory systems, where different patterns are associated with different memory states. Specific practical applications may also require the inclusion of sparsity constraints on the accessible structural parameters for the implementation of the proposed control and design framework.
For a given network of oscillators, we let the entries of the (oriented) incidence matrix B be defined component-wise after choosing the orientation of each interconnection (i, j). In particular, i points to j if i < j, and Bkℓ = −1 if oscillator k is the source node of the interconnection ℓ, Bkℓ = 1 if oscillator k is the sink node of the interconnection ℓ, and Bkℓ = 0 otherwise. The matrix form of Eq. (1) can be written as
where D(x) is the diagonal matrix of the sine functions in Eq. (1).
When the oscillators evolve in a phase-locked configuration, the oscillator frequencies become equal to each other and constant. In particular, since 1TB = 0, we have ({{{{{{{{boldsymbol{1}}}}}}}}}^{{mathsf{T}}}dot{{{{{{{{boldsymbol{theta }}}}}}}}}={{{{{{{{boldsymbol{1}}}}}}}}}^{{mathsf{T}}}k{{{{{{{boldsymbol{1}}}}}}}}={{{{{{{{boldsymbol{1}}}}}}}}}^{{mathsf{T}}}{[{omega }_{1}cdots {omega }_{n}]}^{{mathsf{T}}}), thus showing that in any phase locked trajectory, the oscillator’s frequency k needs to equal the mean natural frequency (frac{1}{n}mathop{sum }nolimits_{i = 1}^{n}{omega }_{i}).
The values of a functional pattern can be uniquely specified using a set of n−1 correlation values. To see this, let us define the incremental variables x = Mθ, where (Min {{mathbb{R}}}^{| {{{{{{{mathcal{E}}}}}}}}| times n}) is the matrix whose kth row, associated to xij, is all zeros except for bki = −1 and bkj = 1. Consider the first n−1 rows of M, associated with x12, x13, …x1n, and notice that they are linearly independent. Moreover, the row associated to xij, i > 1, can be obtained by subtracting the row associated to x1i to the row associated to x1j, implying that the rank of M is n−1. Any collection of n−1 linearly independent rows of M defines a full row-rank matrix ({M}_{min }) (e.g., any n−1 rows corresponding to the transpose incidence matrix of a spanning tree37). We let ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }={M}_{min }{{{{{{{boldsymbol{theta }}}}}}}}), where ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }) is a smallest set of phase differences that can be used to quantify the synchronization angles among all oscillators. Because (ker ({M}_{min })={{{{{{{boldsymbol{1}}}}}}}}), we can obtain the phases θ from ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }) modulo rotation: ({{{{{{{boldsymbol{theta }}}}}}}}={M}_{min }^{{{{dagger}}} }{{{{{{{{boldsymbol{x}}}}}}}}}_{min }-c{{{{{{{boldsymbol{1}}}}}}}}), where ({M}_{min }^{{{{dagger}}} }) denotes the Moore–Penrose pseudo-inverse of ({M}_{min }) and c is some real number. Further, since (ker ({M}_{min })=ker (M)), we can reconstruct all phase differences x from ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }):
The above equation reveals that all the differences x are encoded in ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }). That is, any xij can be written as a linear combination of the elements in ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }). For example, if n = 3 and ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }={[{x}_{12};{x}_{23}]}^{{mathsf{T}}}), then x13 is a linear combination of the differences in ({{{{{{{{boldsymbol{x}}}}}}}}}_{min }), i.e., ({{{{{{{boldsymbol{x}}}}}}}}=left[begin{array}{lll}-1&1&0\ 0&-1&1\ -1&0&1end{array}right]{left[begin{array}{lll}-1&1&0\ 0&-1&1end{array}right]}^{{{{dagger}}} }{{{{{{{{boldsymbol{x}}}}}}}}}_{min }), in which x13 = x12 + x23. Thus, because n−1 incremental variables define all the remaining ones, the entries of any functional pattern must have only n−1 degrees of freedom.
Rewrite the pattern assignment problem BD(x)δ = ω as
where the subscripts ({{{{{{{mathcal{H}}}}}}}}) and (tilde{{{{{{{{mathcal{H}}}}}}}}}) denote the entries corresponding to the Hamiltonian path in conditions (ii.a) and (ii.b) and the remaining ones, respectively. Since ({{{{{{{rm{Im}}}}}}}}({bar{B}}_{:,{{{{{{{mathcal{H}}}}}}}}})={{{{{{{rm{Im}}}}}}}}({B}_{:,{{{{{{{mathcal{H}}}}}}}}}{D}_{:,{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}))={{{{{{{rm{span}}}}}}}}{({{{{{{{bf{1}}}}}}}})}^{perp }), ({{{{{{{rm{Im}}}}}}}}({B}_{:,tilde{{{{{{{{mathcal{H}}}}}}}}}}{D}_{:,tilde{{{{{{{{mathcal{H}}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}))subseteq {{{{{{{rm{span}}}}}}}}{({{{{{{{bf{1}}}}}}}})}^{perp }), and ω ∈ span(1)⊥, for any vector ({{{{{{{{boldsymbol{delta }}}}}}}}}_{tilde{{{{{{{{mathcal{H}}}}}}}}}}), the following set of weights solves the above equation:
Because the matrix ({D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}){B}_{:,{{{{{{{mathcal{H}}}}}}}}}^{{mathsf{T}}}{B}_{:,{{{{{{{mathcal{H}}}}}}}}}{D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}})) is an M-matrix, its inverse has nonnegative entries. Further, by condition (ii.b), ({D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}){B}_{:,{{{{{{{mathcal{H}}}}}}}}}^{{mathsf{T}}}{{{{{{{boldsymbol{omega }}}}}}}}) is strictly positive. Then, the vector ({({D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}){B}_{:,{{{{{{{mathcal{H}}}}}}}}}^{{mathsf{T}}}{B}_{:,{{{{{{{mathcal{H}}}}}}}}}{D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}))}^{-1}{D}_{{{{{{{{mathcal{H}}}}}}}},{{{{{{{mathcal{H}}}}}}}}}({{{{{{{boldsymbol{x}}}}}}}}){B}_{:,{{{{{{{mathcal{H}}}}}}}}}^{{mathsf{T}}}{{{{{{{boldsymbol{omega }}}}}}}}) is also strictly positive, and so is the solution vector ({{{{{{{{boldsymbol{delta }}}}}}}}}_{{{{{{{{mathcal{H}}}}}}}}}) for any sufficiently small and positive vector ({delta }_{tilde{{{{{{{{mathcal{H}}}}}}}}}}).
To ensure that the Jacobian matrix in Eq. (10) is the Laplacian of a positive network and, thus, stable, we solve the problem in Eq. (5) with a slight modification of the constraints. Specifically, we post-multiply the matrix B in Eq. (5) as BΔ, where ({{Delta }}={{{{{{{rm{diag}}}}}}}}({{{{{{{{{rm{sign}}}}}}}}(cos ({x}_{ij}))}}_{(i,j)in {{{{{{{mathcal{E}}}}}}}}})) is a matrix that changes the sign of the columns of B associated to negative weights in the cosine-scaled network:
Solving for positive interconnection weights the problem in Eq. (5) under the above-modified constraint yields a stable Jacobian in a network where the final couplings are Δδ.
We provide a heuristic procedure to promote the stability of functional patterns that include negative correlations in a network with nonnegative weights. Our procedure relies on the definition of Gerschgorin disks and the Gerschgorin Theorem.
Definition of Gerschgorin disk. Let (Min {{mathbb{C}}}^{ntimes n}) be a complex matrix. The ith Gerschgorin disk is ({{{{{{{{mathcal{D}}}}}}}}}_{i}=({M}_{ii},{r}_{i})), i = 1, …, n, where the radius is ri = ∑j≠i∣Mij∣ and the center is Mii.
(Gerschgorin39). The eigenvalues of the matrix M lie within the union (mathop{bigcup }nolimits_{i = 1}^{n}{D}_{i}) of its Gerschgorin disks.
Whenever all target phase differences in x satisfy (| {x}_{ij}| le frac{pi }{2}), the Gerschgorin disks of the Jacobian in Eq. (10) all lie in the closed left half-plane. However, for patterns x containing phase differences (| {x}_{ij}| ge frac{pi }{2}), the union of the Gerschgorin disks intersects the right half-plane. Reducing the magnitude of the entries satisfying ({A}_{ij}cos ({x}_{ij}) , < , 0) effectively shrinks the radius of the Gerschgorin disks that overlap with the right half-plane and shift their centers towards the left-half plane due to the structure of the Jacobian matrix. We remark that the procedure in Eq. (13) is a heuristic, and it is probably effective only when all interconnections with ({A}_{ij}cos ({x}_{ij}) , < , 0) can be removed so that all the Gerschgorin disks lie completely in the left-half plane.
The brain data that support the findings of this study are publicly available in the Supplementary Information of40, at https://doi.org/10.1371/journal.pcbi.1004100.s006. The IEEE 39 New England data parameters and interconnection scheme analyzed in this study for the structure-preserving power network model can be found in the reference textbook73 (see also Supplementary Information for modeling assumptions). The parameters for the simulations on the network-reduced IEEE 39 New England test case in the Supplementary Information have been obtained from refs. 74,75. All data used in this study are also available in the public GitHub repository: https://github.com/tommasomenara/functional_control.
Source code and documentation for the numerical simulations presented here are freely available in GitHub at: https://github.com/tommasomenara/functional_control with the identifier https://doi.org/10.5281/zenodo.4546413.
Cross, M. C. & Hohenberg, P. C. Pattern formation outside of equilibrium. Rev. Mod. Phys. 65, 851 (1993).
ADS  CAS  MATH  Article  Google Scholar 
Pikovsky, A., Rosenblum, M. & Kurths, J. Synchronization: A Universal Concept in Nonlinear Sciences (Cambridge University Press, 2003).
Cavagna, A. et al. Scale-free correlations in starling flocks. Proc. Natl Acad. Sci. USA 107, 11865–11870 (2010).
ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 
Stewart, I., Golubitsky, M. & Pivato, M. Symmetry groupoids and patterns of synchrony in coupled cell networks. SIAM J. Appl. Dyn. Syst. 2, 609–646 (2003).
ADS  MathSciNet  MATH  Article  Google Scholar 
Golubitsky, M., Stewart, I. & Török, A. Patterns of synchrony in coupled cell networks with multiple arrows. SIAM J. Appl. Dyn. Syst. 4, 78–100 (2005).
ADS  MathSciNet  MATH  Article  Google Scholar 
Sorrentino, F. & Ott, E. Network synchronization of groups. Phys. Rev. E 76, 056114 (2007).
ADS  MathSciNet  Article  CAS  Google Scholar 
Zhang, F. & Leonard, N. E. Coordinated patterns of unit speed particles on a closed curve. Syst. Control Lett. 56, 397–407 (2007).
MathSciNet  MATH  Article  Google Scholar 
Buck, J. & Buck, E. Biology of synchronous flashing of fireflies. Nature 211, 562–564 (1966).
ADS  Article  Google Scholar 
Dörfler, F., Chertkov, M. & Bullo, F. Synchronization in complex oscillator networks and smart grids. Proc. Natl Acad. Sci. USA 110, 2005–2010 (2013).
ADS  MathSciNet  PubMed  PubMed Central  MATH  Article  Google Scholar 
Trenberth, K. E. Spatial and temporal variations of the Southern Oscillation. Q. J. R. Meteorol. Soc. 102, 639–653 (1976).
ADS  Article  Google Scholar 
Beliaev, M., Zöllner, D., Pacureanu, A., Zaslansky, P. & Zlotnikov, I. Dynamics of topological defects and structural synchronization in a forming periodic tissue. Nat. Phys. 17, 410–415 (2021).
Cabral, J., Hugues, E., Sporns, O. & Deco, G. Role of local network oscillations in resting-state functional connectivity. NeuroImage 57, 130–139 (2011).
PubMed  Article  Google Scholar 
Fell, J. & Axmacher, N. The role of phase synchronization in memory processes. Nat. Rev. Neurosci. 12, 105–118 (2011).
CAS  PubMed  Article  Google Scholar 
Strogatz, S. H. Exploring complex networks. Nature 410, 268–276 (2001).
ADS  CAS  PubMed  MATH  Article  Google Scholar 
Strogatz, S. H. & Stewart, I. Coupled oscillators and biological synchronization. Sci. Am. 269, 102–109 (1993).
CAS  PubMed  Article  Google Scholar 
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y. & Zhou, C. Synchronization in complex networks. Phys. Rep. 469, 93–153 (2008).
ADS  MathSciNet  Article  Google Scholar 
Dörfler, F. & Bullo, F. Synchronization in complex networks of phase oscillators: a survey. Automatica 50, 1539–1564 (2014).
MathSciNet  MATH  Article  Google Scholar 
Acebrón, J. A., Bonilla, L. L., Pérez Vicente, C. J., Ritort, F. & Spigler, R. The Kuramoto model: a simple paradigm for synchronization phenomena. Rev. Mod. Phys. 77, 137 (2005).
ADS  Article  Google Scholar 
Hong, H. & Strogatz, S. H. Kuramoto model of coupled oscillators with positive and negative coupling parameters: an example of conformist and contrarian oscillators. Phys. Rev. Lett. 106, 054102 (2011).
ADS  PubMed  Article  CAS  Google Scholar 
Arenas, A., Díaz-Guilera, A. & Pérez-Vicente, C. J. Synchronization reveals topological scales in complex networks. Phys. Rev. Lett. 96, 114102 (2006).
ADS  PubMed  Article  CAS  Google Scholar 
Arola-Fernández, L., Díaz-Guilera, A. & Arenas, A. Synchronization invariance under network structural transformations. Phys. Rev. E 97, 060301 (2018).
ADS  PubMed  Article  Google Scholar 
Pecora, L. M. & Carroll, T. L. Master stability functions for synchronized coupled systems. Phys. Rev. Lett. 80, 2109–2112 (1998).
ADS  CAS  Article  Google Scholar 
Strogatz, S. H. SYNC: The Emerging Science of Spontaneous Order (Hyperion, 2003).
Sorrentino, F., Di Bernardo, M. & Garofalo, F. Synchronizability and synchronization dynamics of weighed and unweighed scale free networks with degree mixing. Int. J. Bifurc. Chaos 17, 2419–2434 (2007).
MATH  Article  Google Scholar 
Nishikawa, T. & Motter, A. E. Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions. Proc. Natl Acad. Sci. USA 107, 10342–10347 (2010).
ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 
Belykh, I., Jeter, R. & Belykh, V. Foot force models of crowd dynamics on a wobbly bridge. Sci. Adv. 3, e1701512 (2017).
ADS  PubMed  PubMed Central  Article  Google Scholar 
Papadopoulos, L., Kim, J. Z., Kurths, J. & Bassett, D. S. Development of structural correlations and synchronization from adaptive rewiring in networks of Kuramoto oscillators. Chaos: Interdiscip. J. Nonlinear Sci. 27, 073115 (2017).
MathSciNet  MATH  Article  Google Scholar 
Fazlyab, M., Dörfler, F. & Preciado, V. M. Optimal network design for synchronization of coupled oscillators. Automatica 84, 181–189 (2017).
MathSciNet  MATH  Article  Google Scholar 
Forrow, A., Woodhouse, F. G. & Dunkel, J. Functional control of network dynamics using designed Laplacian spectra. Phys. Rev. X 8, 041043 (2018).
CAS  Google Scholar 
Menara, T., Baggio, G., Bassett, D. S. & Pasqualetti, F. A framework to control functional connectivity in the human brain. In IEEE Conf. on Decision and Control, Nice, France, December 2019, 4697–4704 (IEEE, 2019).
Kaka, S. et al. Mutual phase-locking of microwave spin torque nano-oscillators. Nature 437, 389–392 (2005).
ADS  CAS  PubMed  Article  Google Scholar 
van Wingerden, M., Vinck, M., Lankelma, J. & Pennartz, C. M. A. Theta-band phase locking of orbitofrontal neurons during reward expectancy. J. Neurosci. 30, 7078–7087 (2010).
PubMed  PubMed Central  Article  CAS  Google Scholar 
Kirst, C., Timme, M. & Battaglia, D. Dynamic information routing in complex networks. Nat. Commun. 7, 11061 (2016).
ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 
Horn, R. A. & Johnson, C. R. Matrix Analysis (Cambridge University Press, 1985).
Skardal, P. S. & Arenas, A. Memory selection and information switching in oscillator networks with higher-order interactions. J. Phys.: Complex. 2, 015003 (2020).
Google Scholar 
Mehta, D., Daleo, N. S., Dörfler, F. & Hauenstein, J. D. Algebraic geometrization of the Kuramoto model: equilibria and stability analysis. Chaos: Interdiscip. J. Nonlinear Sci. 25, 053103 (2015).
MathSciNet  MATH  Article  Google Scholar 
Godsil, C. & Royle, G. F. Algebraic Graph Theory. Graduate Texts in Mathematics (Springer, New York, 2001).
Zelazo, D. & Bürger, M. On the robustness of uncertain consensus networks. IEEE Trans. Control Netw. Syst. 4, 170–178 (2017).
MathSciNet  MATH  Article  Google Scholar 
Geršgorin, S. Über die abgrenzung der eigenwerte einer matrix. Bull. Acad. Sci. URSS Cl. Sci. Math. na, 749–754 (1931).
Ponce-Alvarez, A. et al. Resting-state temporal synchronization networks emerge from connectivity topology and heterogeneity. PLoS Comput. Biol. 11, 1–23 (2015).
Google Scholar 
Politi, A. & Rosenblum, M. Equivalence of phase-oscillator and integrate-and-fire models. Phys. Rev. E 91, 042916 (2015).
ADS  Article  CAS  Google Scholar 
Schnitzler, A. & Gross, J. Normal and pathological oscillatory communication in the brain. Nat. Rev. Neurosci. 6, 285 (2005).
CAS  PubMed  Article  Google Scholar 
Fields, D. R. et al. Glial biology in learning and cognition. Neuroscientist 20, 426–431 (2014).
PubMed  PubMed Central  Article  CAS  Google Scholar 
Varela, F., Lachaux, J. P., Rodriguez, E. & Martinerie, J. The brainweb: phase synchronization and large-scale integration. Nat. Rev. Neurosci. 2, 229–239 (2001).
CAS  PubMed  Article  Google Scholar 
Noori, R. et al. Activity-dependent myelination: a glial mechanism of oscillatory self-organization in large-scale brain networks. Proc. Natl Acad. Sci. USA 117, 13227–13237 (2020).
ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 
Power, J. D. et al. Functional network organization of the human brain. Neuron 72, 665–678 (2011).
CAS  PubMed  PubMed Central  Article  Google Scholar 
Boumal, N. Nonconvex phase synchronization. SIAM J. Optim. 26, 2355–2377 (2016).
MathSciNet  MATH  Article  Google Scholar 
Váša, F. et al. Effects of lesions on synchrony and metastability in cortical networks. Neuroimage 118, 456–467 (2015).
PubMed  Article  Google Scholar 
Menara, T., Lisi, G., Pasqualetti, F. & Cortese, A. Brain network dynamics fingerprints are resilient to data heterogeneity. J. Neural Eng. 18, 026004 (2021).
ADS  Article  Google Scholar 
Wang, J.-W. & Rong, L.-L. Cascade-based attack vulnerability on the US power grid. Saf. Sci. 47, 1332–1336 (2009).
Article  Google Scholar 
Busby, J. W. et al. Cascading risks: Understanding the 2021 winter blackout in Texas. Energy Res. Soc. Sci. 77, 102106 (2021).
Article  Google Scholar 
Santana, R. & Reeves, J. Hurricane Ida traps Louisianans, shatters the power grid (Associated Press, 2021).
Skardal, P. S. & Arenas, A. Control of coupled oscillator networks with application to microgrid technologies. Sci. Adv. 1, e1500339 (2015).
ADS  PubMed  PubMed Central  Article  Google Scholar 
Witthaut, D. & Timme, M. Braess’s paradox in oscillator networks, desynchronization and power outage. N. J. Phys. 14, 083036 (2012).
Article  Google Scholar 
L’Abbate, A. et al. The role of FACTS and HVDC in the future pan-European transmission system development. In Proc. 9th IET International Conference on AC and DC Power Transmission (ACDC 2010), 1–8 (IET, 2010).
Motter, A. E., Myers, S. A., Anghel, M. & Nishikawa, T. Spontaneous synchrony in power-grid networks. Nat. Phys. 9, 191–197 (2013).
CAS  Article  Google Scholar 
Zimmerman, R. D., Murillo-Sánchez, C. E. & Thomas, R. J. MATPOWER: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26, 12–19 (2010).
ADS  Article  Google Scholar 
Sharafutdinov, K., Gorjão, L. R., Matthiae, M., Faulwasser, T. & Witthaut, D. Rotor-angle versus voltage instability in the third-order model for synchronous generators. Chaos: Interdiscip. J. Nonlinear Sci. 28, 033117 (2018).
MathSciNet  MATH  Article  Google Scholar 
Hellmann, F. et al. Network-induced multistability through lossy coupling and exotic solitary states. Nat. Commun. 11, 592 (2020).
ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 
Sakaguchi, H. & Kuramoto, Y. A soluble active rotater model showing phase transitions via mutual entertainment. Prog. Theor. Phys. 76, 576–581 (1986).
ADS  Article  Google Scholar 
Sun, J., Bollt, E. M. & Nishikawa, T. Master stability functions for coupled nearly identical dynamical systems. EPL (Europhys. Lett.) 85, 60011 (2009).
ADS  Article  Google Scholar 
Nishikawa, T. & Motter, A. E. Maximum performance at minimum cost in network synchronization. Phys. D: Nonlinear Phenom. 224, 77–89 (2006).
ADS  MathSciNet  MATH  Article  Google Scholar 
Achard, S. & Bullmore, E. Efficiency and cost of economical brain functional networks. PLOS Comput. Biol. 3, e17 (2007).
ADS  PubMed  PubMed Central  Article  CAS  Google Scholar 
Korniss, G., Novotny, M. A., Guclu, H., Toroczkai, Z. & Rikvold, P. A. Suppressing roughness of virtual times in parallel discrete-event simulations. Science 299, 677–679 (2003).
ADS  CAS  PubMed  Article  Google Scholar 
Pecora, L. M., Sorrentino, F., Hagerstrom, A. M., Murphy, T. E. & Roy, R. Cluster synchronization and isolated desynchronization in complex networks with symmetries. Nat. Commun. 5, 1–8 (2014).
Article  CAS  Google Scholar 
Kiss, I. Z., Rusin, C. G., Kori, H. & Hudson, J. L. Engineering complex dynamical structures: sequential patterns and desynchronization. Science 316, 1886–1889 (2007).
ADS  MathSciNet  CAS  PubMed  MATH  Article  Google Scholar 
D’Souza, R. M. & Mitzenmacher, M. Local cluster aggregation models of explosive percolation. Phys. Rev. Lett. 104, 195702 (2010).
ADS  PubMed  Article  CAS  Google Scholar 
Bansal, K. et al. Cognitive chimera states in human brain networks. Sci. Adv. 5, eaau8535 (2019).
Chen, S., Fazlyab, M., Morari, M., Pappas, G. J. & Preciado, V. M. Learning region of attraction for nonlinear systems. 60th IEEE Conference on Decision and Control (CDC) 6477–6484 (IEEE, 2021).
Zhu, L. & Hill, D. J. Synchronization of Kuramoto oscillators: a regional stability framework. IEEE Trans. Autom. Control 65, 5070–5082 (2020).
MathSciNet  MATH  Article  Google Scholar 
Qin, Y., Menara, T., Bassett, D. S. & Pasqualetti, F. Phase-amplitude coupling in neuronal oscillator networks. Phys. Rev. Res. 3, 023218 (2021).
Panaggio, M. J., Ciocanel, M., Lazarus, L., Topaz, C. M. & Xu, B. Model reconstruction from temporal data for coupled oscillator networks. Chaos: Interdiscip. J. Nonlinear Sci. 29, 103116 (2019).
MathSciNet  Article  Google Scholar 
Sauer, P. W. & Pai, M. A. Power System Dynamics and Stability (Prentice-Hall, 1998).
Susuki, Y., Mezić, I. & Hikihara, T. Coherent swing instability of power grids. J. Nonlinear Sci. 21, 403–439 (2011).
ADS  MathSciNet  MATH  Article  Google Scholar 
Moeini, A., Kamwa, I., Brunelle, P., & Sybille, G. Open data IEEE test systems implemented in SimPowerSystems for education and research in power grid dynamics and control. In 2015 50th International Universities Power Engineering Conference (UPEC), 1–6 (IEEE, 2015).
Download references
T.M. was supported in part by the National Science Foundation (Grant NSF-557 NCS-FO-1926829) and the Army Research Office (Grant ARO-W911NF1910360).
Department of Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, CA, 92093, USA
Tommaso Menara
Department of Information Engineering, University of Padova, Padova, 35131, Italy
Giacomo Baggio
Department of Physics & Astronomy, Department of Bioengineering, Department of Electrical & Systems Engineering, Department of Neurology, Department of Psychiatry, University of Pennsylvania, Philadelphia, PA, 19104, USA
Dani Bassett
The Santa Fe Institute, Santa Fe, NM, 87506, USA
Dani Bassett
Department of Mechanical Engineering, University of California, Riverside, Riverside, CA, 92521, USA
Fabio Pasqualetti
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
T.M., G.B., and F.P. designed research; T.M. and G.B. performed research; T.M. analyzed data and developed code; D.S.B. and F.P. supervised the research, and T.M., G.B., D.S.B., and F.P. wrote the paper.
Correspondence to Fabio Pasqualetti.
The authors declare no competing interests.
Nature Communications thanks Rico Berner, and the other, anonymous, reviewer(s) for their contribution to the peer review of this work. Peer reviewer reports are available.
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
Reprints and Permissions
Menara, T., Baggio, G., Bassett, D. et al. Functional control of oscillator networks. Nat Commun 13, 4721 (2022). https://doi.org/10.1038/s41467-022-31733-2
Download citation
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41467-022-31733-2
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.
Advertisement
Advanced search
Nature Communications (Nat Commun) ISSN 2041-1723 (online)
© 2022 Springer Nature Limited
Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

source

Chase Music announces 2nd music recording Camp Powered by TuneCore – Vanguard

Artiste Development and Music Label, Chase Music Nigeria, on Thursday, announced the second edition of its annual recording camp, and partnership with global music distribution company, TuneCore. 
Chase Music Nigeria, which has made its mark in the music industry, is home to Afro-pop artistes Jinmi Abduls, King AMO, Mohalizer, and F3line. 
The announcement of the recording camp comes seven months after the maiden edition, which hosted industry breakout artistes like Hennessy Artistry winner, The PDSTRN, Musta4a, Creen Caeser, Marley Abdul, and producers like NYRP, Noah Aire, BabyBeats and PortHacourt sensation Trijay.
The Managing Director of Chase Music Nigeria, Kevin Asaju said: “The recording camp aims to position Chase Music as not just a label, or just another talent management agency, but the hub for independent, unsigned creatives artistes, producers, sound engineers, instrumentalists, and A&R’s.
“To enable them learn, create, network and get discovered, in order to achieve a world-class level of artistry and productivity”.
Speaking on the partnership, the head of TuneCore East and West Africa, Chioma Onuchukwu, said, “At TuneCore, we are constantly looking for new ways to connect and support independent emerging artists, one way we do that is through education and thought leadership in the music business.
“Therefore, we are excited to collaborate with Chase Music on the recording camp, as our goals align with developing the African independent artistes and music industry
“We are intentional about how we can offer more value and close gaps in the music space, also, we recently launched our new unlimited price plan to offer our artists and independent labels more options, the new pricing is a welcomed change in a price-sensitive market like Africa, there’s more to come.”
The camp would boast of an array of independent – unsigned artists who would not only learn about music production and record music but would also be lectured on the music business, entertainment law, artiste branding, digital presence, and many more. 
The camp would run from the 17th to the 20th of August, and powered by TuneCore
Application for the camp is open for artists, producers, sound engineers, instrumentalists, and aspiring A&Rs.

RELATED NEWS

source

85-Year-Old UCF Grad Earns Master’s, Strengthens Dedication to Lifelong Learning – UCF

Always striving to learn more, Virginia Perwin ’22MA has earned her second master’s about 60 years after earning her bachelor’s.
By Heather Gibson August 10, 2022
Virginia Perwin ’22MA has a lot in common with other students who received a master’s degree at UCF this weekend. She likes to keep active by spending time with her family, gardening and ziplining. She engages in community work by teaching people how to read. She was a first-generation student.
The difference is that while many students are earning their graduate degrees immediately after their undergraduate program, Perwin received her first degree about 60 years ago.
The 85-year-old recipient of a master’s degree in teaching English to speakers of other languages has dedicated her life to learning and has no plans of ever stopping.
The fifth child in a family of seven, Perwin struggled in primary school until a teacher recognized that Perwin had a learning disability.
“My grades went from C’s to A’s and B’s because of the help I received,” Perwin says.
She wanted to be a doctor, but that wasn’t an opportunity afforded to many girls at that time, so she went on to college at Temple, studying physiology and anatomy to earn a bachelor of arts in physical education.
After teaching physical education for years while rearing a family of her own, Perwin returned to school at Florida International University to get a master’s degree in adult education. And in 2017 she came to UCF to get a certificate in teaching English as a foreign language (TEFL). Upon completion of that program, she realized she could apply the credits to earn a second master’s degree in TESOL.
“Education and learning is a never-ending journey, because I have always been learning,” Perwin says. “I have always been in schools for something. Even when my children were small, I was teaching and doing research.”
Kerry Purmensky, coordinator of UCF’s TESOL program, and one of Perwin’s professors, says that having Perwin in the class has been advantageous to other students.
“Virginia’s willingness to share her vast experience as a learner and teacher in the language classroom enthralled other students,” Purmensky says. “She inspired everyone with her hard work and never-give-up positive attitude toward education and life.”
Perwin has a passion for researching the methodologies of teaching. She says she still applies the methods that helped her overcome her own learning challenges to people she teaches. She is currently teaching an adult to speak English by guiding her through a juvenile mystery book that the student’s granddaughter is reading. The English learner and her granddaughter can enjoy reading and talking about the book together.
Perwin has some words of experience to offer to students about mentorship and asking for help: “If I could tell students one thing it would be this: if you have goals and dreams, you must work with an advisor to guide you there.”
What’s next on the docket for Perwin? More education, of course. She has applied for the UCF reading education program in fall. Her goal is to help people who speak other languages better learn English by using methods used in reading education.
UCF’s Master of Arts in teaching English to speakers of other languages (TESOL) provides students a strong foundation in language acquisition, use and pedagogy. UCF’s professors have diverse research interests and thrive on working with students to develop their professionalism in the field. Current research trends in the department include vocabulary, assessment, community engagement, Russian ESOL, and sociolinguistics. Learn more about the program at cah.ucf.edu/languages/program/tesol.
4000 Central Florida Blvd. Orlando, Florida, 32816 | 407.823.2000
© University of Central Florida

source

Zelenskiy says grain exports ready to start; Kyiv and Moscow both launch investigations into PoW deaths – as it happened – The Guardian

Zelenskiy says grain exports ready to start; Kyiv and Moscow both launch investigations into PoW deaths – as it happened  The Guardian
source

Legends, music fans flock to Detroit debut of Temptations musical – Detroit News

source

White House to appoint Monica Bertagnolli as 16th NCI director – The Cancer Letter

The Cancer Letter
Inside information on cancer research and drug development
The Cancer Letter
Inside information on cancer research and drug development
President Joe Biden has announced his intent to appoint Monica Bertagnolli as the 16th director of the National Cancer Institute—and the first woman and first chair of a clinical trials cooperative group to be named to the role.
The White House announcement Aug. 10 comes nearly three weeks after news of Bertagnolli’s appointment leaked out on Twitter and in the press (The Cancer Letter, July 21, 2022).

“Dr. Bertagnolli lends to this effort one of the most powerful voices in the country for cancer patients, particularly for those in rural and remote communities, with a history of advancing patient-focused programs that incorporate learnings directly from patient experiences to build more inclusive models of care,” the White House said in a statement.
Bertagnolli will lead NCI at a time when the White House is directing federal agencies to focus on halving the cancer death rate in the United States over the next 25 years—a goal of Biden’s reignited Cancer Moonshot (The Cancer Letter, Feb. 4, 2022).
“I look forward to working with Dr. Bertagnolli to advance the President’s call to end cancer as we know it,” Xavier Becerra, secretary of the U.S. Health and Human Services, said in a statement. “Dr. Bertagnolli’s decades of cancer research expertise around patient-centered care and her work to create more inclusive clinical trials will be instrumental as we accelerate the rate of research and innovation to fight cancer.”
Bertagnolli currently serves as the Richard E. Wilson professor of surgery at Harvard Medical School. She is chief of the Division of Surgical Oncology at Brigham and Women’s Hospital and is a member of the Gastrointestinal Cancer and Sarcoma Disease Centers at Dana-Farber Cancer Institute.
At NCI, Bertagnolli replaces Ned Sharpless, who stepped down April 29 (The Cancer Letter, April 9, 2022). 
“I am excited to welcome Dr. Bertagnolli to NCI,” NCI Acting Director Douglas Lowy wrote in an email Aug. 10 to his colleagues. “Dr. Bertagnolli and I are both committed to working closely together to make the transition as smooth and seamless as possible. It has been my great honor to serve as NCI’s Acting Director, and I will continue in this position until Dr. Bertagnolli can be sworn in.”
“We know Dr. Bertagnolli is a powerful force and a perfect choice to lead the NCI as we face novel challenges but also some of the most exciting opportunities that promise to advance our insights, treatment, and care of patients with cancer,” the American Society of Clinical Oncology said in a statement. “An accomplished cancer surgeon and researcher with deep expertise in community-based cancer research, Dr. Bertagnolli has the knowledge, passion, and skillset to successfully lead the nation’s top federal cancer research agency and the wider U.S. cancer research enterprise. 
“We enthusiastically endorse her selection, recognizing Dr. Bertagnolli’s distinguished leadership and experience in advancing evidence-based cancer care and research.”
“Dr. Bertagnolli brings impressive qualifications to this vital position, including her background as an outstanding physician-scientist and much admired professor,” Margaret Foti, chief executive officer of the American Association for Cancer Research, said in a statement. “Her appreciation for the value and importance of basic research to advancing translational and clinical discoveries, as well as her commitment to ensuring that such treatment innovations reach patients in all populations across the United States, will ensure that the NCI continues to lead the way in programs aimed at improving health, preventing cancer, and reducing the incidence and mortality from this devastating disease.”
“AACI prioritizes diversity, equity, and inclusion, particularly as they relate to the cancer center leadership pipeline and clinical trials,” Caryn Lerman, AACI president and director of USC Norris Comprehensive Cancer Center, said in a statement.
“President Biden has chosen the perfect person for the job,” said Ellen Sigal, chair & founder of Friends of Cancer Research. “We need a visionary like Dr. Bertagnolli to lead the NCI at this exciting time for innovation and to be at the center of the next generation of President Biden’s Cancer Moonshot.
“Dr. Bertagnolli has had a celebrated career in medicine, working as a surgeon at Dana-Farber Cancer Institute and Brigham and Women’s Hospital in significant leadership roles,” Sigal said. “Dr. Bertagnolli brings expertise the agency needs at a true inflection point for cancer research.”

Looking for IP Login?
This change will be effective immediately and your card will be charged a prorated amount based on your existing subscription level.
OK Cancel
Looking for IP Login?

source

Video Game Crediting Is Still a Huge Problem; But One Group of Volunteers Is Working on Solutions – IGN

Video Game Crediting Is Still a Huge Problem; But One Group of Volunteers Is Working on Solutions  IGN
source

Exploring incentives for the Nigerian creative and entertainment industry – Businessday


The Nigerian entertainment and creative industry have experienced massive growth over the last decade. According to the International Monetary Fund (IMF), the entertainment industry now accounts for 1.45% of Nigeria’s GDP.
In 2016, the Arts, Entertainment and Recreation Sector generated N239billion in revenue, culminating in about 2.3% of Nigeria’s GDP for that year. Nollywood, which is the movie production subsector of the entertainment and creative industry, is globally recognised as the second largest film producer in the world, coming behind America’s Hollywood and ahead of India’s Bollywood.
The number of film production annually, stands at around 2500 with a projection of US$22million by 2021 for total cinema revenue alone, while the total music revenue in Nigeria is estimated to rise to US$73million by 2021 (with a compound annual growth rate of 13.4%). The entire industry currently employs about a million people and this number is expected to increase before the end of 2021. Furthermore, it is also expected to generate about $7 Billion for the national economy.
The popularity that the industry has garnered over the years has seen Nigerian artists collaborating with their foreign counterparts and striking multimillion-dollar music recording and publishing deals with international record publishing companies such as Sony Music Group, Universal Music Group, Warner Music Group, and a host of many others.
As a result of its successes in the local and international markets, in 2018, global streaming giant, Netflix acquired worldwide rights to Lion Heart, a Nigerian movie directed by Genevieve Nnaji. In that same year, Netflix announced that it will be putting out $8 Billion original budget to work in Nigeria’s movie industry. In furtherance of this, in February 2020, Netflix made its official debut in Nigeria, acquiring and distributing Nigerian filmed content.
Since then, it has gone ahead to acquire several Nigerian movies, including the Wedding Party, Elevator Baby, Oloture, King of Boys, It’s her day and a host of others. Currently, Nigerian movie producers are able to enter into publishing and streaming deals with Netflix for their local content. Local movie streaming platforms have also emerged, with Iroko TV being a key player in this regard.
International award platforms are beginning to recognise Nigerian acts, with the latest and most prolific being Burna Boy’s consecutive Grammy nominations in 2019 and 2020 for his albums African Giant and Twice As Tall, and a subsequent win in 2021, for the later album (Twice As Tall). In recent times, more of the award categories and nominations allotted to African music at the Black Entertainment Television (BET) Awards, the Music Television (MTV) Awards, the Grammy Awards and even the Netherlands’ Eddison Awards, have been clinched by Nigerian artistes. Furthermore, Nigerian artistes are beginning to garner massive streaming numbers on various international music streaming platforms like Spotify, Apple Music, Audiomack, Youtube and Boomplay. Local music streaming platforms like UduX and Gbedu have also emerged. These developments suggest that Nigerian artistes and their songs are beginning to have a considerable space in the world music scene.
Read also: Thou shalt not advertise – the line between business development and solicitation
Challenges and the way forward
Despite the level of growth that these sectors have experienced, it has been beset by lack of funding, piracy, and copyright infringement, among other issues currently plaguing them. The sector barely receives support from the government and investors (despite being made subject to various taxes and levies by the various tiers of government). As a result of this, investors are hardly keen on investing in this sector.
In a bid to support the entertainment industry in 2010, Former President Goodluck Ebele Jonathan at the 30th Anniversary of Silverbird Group announced a $200million donation to support Nollywood. The sum was to be distributed to the players in the sector in form of loans, and it was to be administered by the Nigerian Import and Export Bank (NEXIM Bank) and the Bank of Industry (BOI).
Similarly in 2012, at the 20th-anniversary celebration of Nollywood, another announcement of a N3billion grant tagged “Project Nollywood”, was also made by Former President Goodluck Ebele Jonathan and it was supposed to be managed and distributed by the Ministry of Finance in collaboration with the Ministry of Culture and Tourism.
However, how these support funds were utilized remains undetermined as several Nollywood stars have stated that they did not receive the said funds as promised. Along the same lines, the BOI in 2015 denied receiving the $200 Million donation from the former president.
In a similar vein, to contribute to the entertainment and creative industry, the BOI initiated a N1billion special facility for Nollywood, known as “the BOI Nollyfund”. The intervention was initiated by BOI for the following reasons: Nollywood is a very important emerging sector in the economy; it contributed 1.42% ($7.3 billion or N1.4 trillion) to Nigeria’s Re-based GDP in 2013; it has contributed to enhancing the image of Nigeria as Nollywood movies are being watched globally, and Nollywood is now ranked 2nd in the world after Hollywood (America) and ahead of Bollywood (India) in terms of the number of contents produced.
However, the terms and conditions for accessing the funds appear to be quite strenuous. These conditions include the assigning of copyright as collateral for receiving the funds and the requirement for a distributor to issue an undertaking to remit all cinema proceeds of the film based on agreed arrangements, to BOI designated banks. These conditions amongst others appeared to be unpleasant to the industry practitioners.
Interestingly, the current administration is also taking steps to contribute to the creative sector. This is being achieved in collaboration with the African Development Bank (“the AfDB”) through a $500million facility (“the Facility”) for the tech and creative sectors. This initiative will see the injection of the said Facility into the aforementioned sectors, before the end of 2021. Accordingly, an arrangement is already being made for the Facility to be utilized through the Nigeria Innovation Programme (NIP), which was proposed by the federal government to boost innovation and job creation, and foster growth in the technology and creativity entrepreneurship ecosystem. It is excepted that this facility will bring about further development to the already booming creative industry.
Pioneer Status Incentives
It is however important to note that there are other ways in which the government can support the entertainment industry apart from making and establishing donations and support facilities. A major way in which the government can make the entertainment industry attractive is in the provision of various incentives to the entertainment and creative industry.
As a matter of fact, in 2017, the Federal Government included the creative sector on the pioneer status incentive list, as a way of contributing to its development. Pioneer Status Incentive (“PSI”) is a tax holiday incentive provided for under the Industrial Development Income Tax Relief Act (“the Act”). It grants qualifying industries and their products relief from the payment of corporate income tax for an initial period of three years, which is renewable for another one or two additional years.
Section 1 of the Act provides that any industry may be designated as “pioneer” where the president is satisfied that it is not being carried on in Nigeria on a scale that is suitable to the economic requirements of Nigeria or at all, or there are favourable prospects of further development in Nigeria or it is expedient and in public interest to encourage the development or establishment of such industry in Nigeria by declaring the industry to be a pioneer industry and any product of the industry to be a pioneer product.
It is indubitable that tapping into this is beneficial for the entertainment and creative industry as the PSI covers the following: production of digital movies; animation, videos, television programmes, commercials (including online distribution and Exhibition); music production, publishing and online digital music distribution; production of Cameras, motion picture and slide projectors, overhead transparency projectors, and photograph for tourism purposes and aerial photography.
To this end, any organisation engaged in any of the aforementioned businesses is required to apply to the Nigerian Investment Promotion Commission (“NIPC”) for a Pioneer Status Certificate (PSC), in order to enjoy the PSI.
This is a positive step because as earlier noted, the qualifying media and creative practitioners are entitled to relief from the payment of corporate income tax at 30%, for an initial period of three years which is renewable for one or two additional years. Consequently, this may aid in reducing the cost of doing business for these entertainment and media practitioners. Furthermore, it will make the entire industry attractive to foreign and local investors.
Though the inclusion of the creative and entertainment industry on the pioneer status list demonstrates the Federal Government’s willingness to support the entertainment and creative sector, there are however certain drawbacks that must be considered.
First, the service fees for the application for a PSI in Nigeria appear to be exorbitant. Applicants are required to pay an application fee in the sum of N200,000 (Two Hundred Thousand Naira), then a service charge deposit of N2,500,000 (Two Million, Five Hundred Thousand Naira) is also required to be made. In addition, 1% of the actual pioneer profits will be paid annually and due diligence fee of N500,000 (Five Hundred Thousand Naira) is required to be paid. In case of a renewal, an application fee of N100,000 (One Hundred Thousand Naira) is required to be paid and 1% of the actual pioneer profits will be paid annually.
The primary drawback with these charges is that the small players in the creative and entertainment industry may not be able to access these incentives and this may defeat its essence and purpose.
Secondly, the processing time for fresh applications often takes up to twenty-five weeks, while an application for renewal/extension takes an average of fifteen weeks to finalise. This is barring any delays that one may experience with the applications.
This inordinate delay experienced in obtaining the PSC serves as a drawback and barrier as it makes it extremely difficult for practitioners to access this incentive. Some may consider the level of strain involved and simply call off the desire to obtain a PSI.
Consequently, we opine that the government must take reasonable steps to ensure that the PSI is obtainable at a convenient cost while putting the small players in the entertainment and creative industry into consideration. The government must also consider placing the entertainment and creative sector under the investment tax credit incentive which is available in other sectors. This will give investors the impetus to consider investing in the entertainment and creative sector.
Furthermore, just like the Tourism Incentive and the Agricultural Production Income Tax Exemption, the government must begin to consider entertainment and creative industry-based incentive. This is already obtainable in the United States of America where movie producers are entitled to movie production incentives.
Conclusion
The contribution of the entertainment industry to Nigeria’s economic and social growth cannot be underestimated. The industry has been responsible for the creation of over a million jobs and it is still creating more jobs for Nigerians; albeit the sector barely enjoys support from investors and from the government.
If the entertainment industry is able to get the adequate support it needs, it is indubitable that the quality of the content being produced and released yearly will improve. Fortunately, this support is not limited to the provision of grants and loans as the government can also explore other means like the provision of various incentives to the industry.
Hence, the issues pertaining to the application for PSI must be addressed and the government must also seek to establish an entertainment & creative industry-based incentive as well as include the entertainment & creative industry on the list of sectors eligible to access the investment tax credit incentive.
Get real time updates directly on you device, subscribe now.
How to productise your legal services to work less and earn more
Thou shalt not advertise – the line between business development and…
Young Business Lawyer
Overview of the pre-election provisions under Nigerian law
Get the best of world News delivered to your inbox daily
latest news
Graduates need digital skills to be employable- Olumodimu
2023: ‘Why Nigerian youths must change their mindset’
How Onuoha built a system that coordinate MSMEs operations, track growth
Abia women protest kidnap of medical doctor
Extends auditing of HYPREP account to cleanup, remediation work done, Group tells Buhari
Business Day, established in 2001, is a daily business newspaper based in Lagos. It is the only Nigerian newspaper with a bureau in Accra, Ghana. It has both daily and Sunday titles. It circulates in Nigeria and Ghana
BDlead
NNPC renews five oil bloc licenses, expects $500bn in…
Nigeria’s gas flares lowest since 2012 as use…
Food, fuel, others gulp $14.5bn amid dollar scarcity

source

The barn that produced more hits than Abbey Road from 1974-76 – FOX 31 Denver

The barn that produced more hits than Abbey Road from 1974-76  FOX 31 Denver
source

KEN BAUER – 'In Love With The Night (Ken Bauer & J-Rob MD Remix)' – EDM Sauce

Hi, what are you looking for?
EDMsauce.com Artist of the Week: Pixellay
DISCO FRIES Unveils ‘Friends of Fries’ NFT PACK with RCRDSHP
Griffter rings in the weekend with gritty bass track “All Out” ft. Jones 2.0
AJ Salvatore Crosses Into Rap with “Vitamins” ft. Tokyo’s Revenge
‘Love Hertz’ Delivers a Modern Romantic Comedy with a Sci-Fi Twist
Blasterjaxx & BEAUZ serve up festival blast ‘Out The Sky’
HALIENE shines bright with stunning new single ‘Reach Across The Sky’
Lupage and Cuish Team Up and Collab on an Incredible Club, Late Summer Banger, ‘Stopping Me’
STED-E & HYBRID HEIGHTS, JACOB COLON COLLAB ON NEWEST TRACK, ‘Xylos Groove’
Terry Golden Releases Newest Dance Music Banger, ‘Tonight’










By
Published
DJ and music production maestro Ken Bauer strikes back with another highly anticipated release.
Now, he introduces his take on ‘In Love With The Night’, the latest single by UK talented musician Sean Smith. Smith gained popularity following his successful appearance on the British hit reality TV show ‘The X Factor’ where his duo ‘Same Difference’ achieved a finalist slot on the 4th season.

Ken Bauer, known for his signature style and sound that innovates the widely known Future Rave genre, is ready to showcase once more his talents and skills, with another remix that ticks all the boxes to become a certified hit.
Following outstanding releases like his track ‘I Just Wanna Rave’ through his own label Future Rave Music, known for its quality releases and unmatchable taste for curating a roster of talented DJs and music producers, comes this powerful new single.
Teaming up with the ever-experimenting DJ and music producer J-Rob MD, this remix of ‘In Love With The Night’ comes via SP Music, and will surely find its way to every dancefloor worldwide.
With a playful work with the effects of the vocals, and a nice and energetic beat, this remix of ‘In Love With The Night’ is a Future Rave take on the original track, with powerful risers and even more explosive drops; pulsating basslines that add dynamic to the rhythm, and textural pads and synth stabs that give that classic Future Rave feel that lovers of this genre will be keen on.
This remix is one for Future Rave lovers and party-seekers ready to enjoy festival season.
Ken Bauer confirms once more why his name has risen to the top of the list of DJs not to miss, as every release signed under his name is an undeniable hard-hitting production that becomes an instant sensation.

Advertisement. Scroll to continue reading.


Be sure to follow Ken Bauer as he continues to put out high-quality productions and fresh new music.
‘In Love With The Night (Ken Bauer & J-Rob MD Remix)’ is out now and available in all major online stores and streaming platforms.


Listen and buy ‘In Love With The Night (Ken Bauer & J-Rob MD Remix)’ now
https://open.spotify.com/album/5x5PoBP8jadNuPBY6jcHyh
https://www.beatport.com/release/in-love-with-the-night-the-ken-bauer-j-rob-md-remixes/3775979
Ken Bauer Online

Advertisement. Scroll to continue reading.

Soundcloud | Instagram |  Spotify
Sean Smith Online
Website | Spotify |Instagram
J-Rob MD Online
Beatport | Spotify
SP Music Online
Website | Instagram
Talented Swedish DJ and producer Ken Bauer is back with yet another high-quality banger by the name of ‘I Just Wanna Rave’.  Following a…
Ken Bauer has been on fire this year, with multiple releases all garnering large amounts of success and support in the dance music industry….
Ken Bauer’s musical talents are a gift that evidently comes naturally to the Swedish DJ and Producer, after playing piano from a young age…




What is going on dance music nation? We are so happy to bring you only the BEST in up and coming music, and today…
Copyright © EDM Sauce

EDM Sauce is reader-supported. We may earn a commission through products purchased using links on this page. Learn more about our process here. .

source

Image thresholding segmentation based on weighted Parzen-window and linear programming techniques | Scientific Reports – Nature.com

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.
Advertisement
Scientific Reports volume 12, Article number: 13635 (2022)
Metrics details
Image segmentation by thresholding is an important and fundamental task in image processing and computer vision. In this paper, a new bi-level thresholding approach based on weighted Parzen-window and linear programming techniques is proposed to use in image thresholding segmentation. First, by proposing a weighted Parzen-window to describe the gray level distribution status, we obtain the boundaries for the foreground and background of the image. Then the image thresholding problem can be transformed into the problem of solving a linear programming problem for computing the coefficient values of weighted Parzen-window. The results of testing on synthetic, NDT and a set of benchmark images indicate that the proposed method can achieve a higher segmentation accuracy and robustness in comparison to some classical thresholding methods, such as inter class variance method (OTSU), Kapur’s entropy-based method (KSW), and some state-of-art methods that consider spatial information, such as CHPSO, GLLV histogram method and GABOR histogram method.
Image segmentation technology has been widely applied in industry, agriculture, military fields, etc. Among all the image segmentation methods, thresholding is one of the most widely used, because it is simple and ease to implement. Image thresholding methods are divided into two categories, one is bi-level thresholding methods and the other is multi-level methods. The bi-level methods that involve the fundamental assumption that the foregrounds and backgrounds of the image have different gray level distributions, segment the image to foregrounds and backgrounds. The multi-level methods can be generalized by the bi-level methods that segment the image to multiple non-overlapping regions1. So far, many successful thresholding methods have been developed and applied in many fields, such as infrared nondestructive testing, magnetic resonance imaging, etc.2. In this paper, we focus on bi-level thresholding methods.
In the process of bi-level thresholding, it is assumed that there exists an optimal threshold value separating the gray levels. The segmentation task can be implemented by classifying pixels whose gray level is less than the threshold as backgrounds and pixels whose gray level is greater than the threshold as foregrounds, or vice versa. For decades, some classical bi-level thresholding algorithms have been proposed, such as the inter-class variance method (OTSU)3, minimum error bi-level thresholding method (MET)4, the entropic bi-level thresholding method based on one-dimensional histogram (1D KSW)5, Renyi’s entropic bi-level thresholding method6 and Tsallis’s entropic bi-level thresholding method7 etc. In addition, these classical methods have been modified or combined with other techniques to develop numerous successful bi-level or multi-level thresholding methods. As typical examples, relative entropy theory and 3D histogram were combined with MET for an optimal threshold discriminant8. The ant colony optimization approach was combined with the inter-class variance method for fast find out multiple thresholds of the images9. The hybrid whale optimization approach was combined with the 1D KSW method for multi-level thresholding segmentation10,11. The meta-heuristics approach was combined with Renyi’s entropy-based method for multi-level thresholding segmentation12. The particle swarm optimization approach was combined with the Tsallis entropy-based method for multi-level thresholding segmentation13. The convergence heterogeneous particle swarm optimization algorithm, was utilized to find the optimal bi-level and multi-level thresholds14. The coyote optimization algorithm, which takes Ostu and fuzzy entropy as objective functions, was used to multi-level thresholds selection15. Although many thresholding methods have been developed, the entropy-based methods remain the most popular. Many extensions of the entropy-based method, which are based on 1D histogram, have been proposed in recent years. For examples, Cheng proposed a new bi-level thresholding method by implementing fuzzy segmentation based on two-dimensional (2D) histograms16. Xiao proposed two new entropic bi-level thresholding methods. The first method employs gray level spatial correlation (GLSC) histogram17. In contrast to the 2D histogram, the GLSC histogram is obtained using the gray level of the pixels and their neighbors with similar gray level. The second method employs gray level and gradient magnitude (GLGM) histogram18. The GLGM histogram clearly captures the occurrence probability and spatial distribution features of gray level at the same time, and considers spatial information. Utilizing the orientation histogram of a gradient image to calculate the local edge property, a new bi-level thresholding method employing 2D-D histogram was proposed by Yimit19. A new thresholding method based on a GLLV histogram was proposed by Zheng20 using the gray level information of pixels and its local variance in a neighborhood. A new thresholding method based on a GABOR histogram was proposed by Yi21. Recently, Xiong et al. proposed a new image thresholding method combining Kapur’s entropy with Parzen-window estimation22.
In general, the improved 2D histogram methods outperform 1D histogram methods. However, the 2D entropic thresholding methods still have some limitations, such as, not a generic method for image thresholding, and lack of robustness or stability etc.
In this paper, we try to propose a new bi-level thresholding method, which is based on the boundaries for the foreground and background by using a weighted Parzen-window to describe the gray level distribution status rather than gray level probability density distributions (1D or 2D histogram) for the foreground and background in an image. Subsequently, image thresholding was successfully transformed into a linear programming problem. We used the simplex method to solve the linear programming problem. In the experimental section, the proposed method is compared with the classic and state-of-art methods to demonstrate its accuracy and robustness. The novel contribution of this study is the construction of a new data distribution description method based on the weighted Parzen-window technique, which can be regarded as a linear programming problem. This process is illustrated in Fig. 1.
Process of the proposed thresholding method.
The rest parts of this paper is organized as follows. In section “The proposed method“, we briefly introduce the Parzen-window technology, and provide a new bi-level thresholding method based on the weighted Parzen-window and linear programming. In section “Experimental results“, the results of the experiments and a discussion are presented. Finally, section “Conclusions” gives the conclusion.
For a gray image (F=left{fleft(x,yright)|xin left{mathrm{1,2},3,dots ,mright}, yin left{mathrm{1,2},3,dots ,nright}right}) of size (mtimes n) with (L) gray levels, the gray level set (G=left{mathrm{0,1},2,dots ,L-1right}). (fleft(x,yright)in G) is the gray value of the pixel located at location (left(mathrm{x},mathrm{y}right)). Let ({omega }_{l}=left{left(x,yright) |fleft(x,yright)=l, xin left{mathrm{1,2},3,dots ,mright},yin left{mathrm{1,2},3,dots ,nright}, lin Gright}),({C}_{l} left(lin Gright)) represents the number of pixels in ({omega }_{l}) , then (omega =left{ {omega }_{l}, lin Gright}) and (N=sum_{l=0}^{L-1}{C}_{l}) . Obviously, ({omega }_{l}) is defined in 2D space. Suppose that (t) is the threshold value, the result of bi-level thresholding by (mathrm{t}) is a binary function ({f}_{t}left(x,yright)):
The result of thresholding is a clustering problem that separates all pixels into two classes (O) and (B). Where (O) represents foregrounds and (B) represents backgrounds, or vice versa.
Traditional thresholding methods are first used to compute the probability of each gray level distribution. Then, the optimal threshold value was computed by optimizing an appropriate objective function, which was designed using the gray level distribution or other properties.
As we known well, the Parzen-window estimation is an effective non-parametric estimation with solid theoretical foundation, which can better describe the distributions of data23,24,25. The basic idea is to estimate the (pdf) using the mean value of the densities of each point within a certain range. If we want to estimate the (pdf) at point (X), we can place a window of size (h) at (X) and see how many observations of ({X}_{i}) fall into this window. The value of (pdf) is the average of the observations falling into this window. The Parzen-window estimate ({P}_{n}left(Xright)) can be expressed as:
where ({V}_{n}) is the volume of the d-D hypercube with edge length ({h}_{n}), ({V}_{n}={h}_{n}^{d}), ({h}_{n}=frac{c}{sqrt{n}}) is called window width. (mathrm{c}) is a constant parameter that always takes the value of 1. (Kleft(cdot right)) is the d-D kernel function (window function), and:
The most commonly used kernel function is the Gaussian kernel function (normal distribution), defined as:
Following the Parzen-window estimation, for the 2-D image (F), the sample (left(x,yright)) in the two-dimensional point space ({omega }_{l}), its (pdf) (pleft(x,{y,omega }_{l}right)) can be estimated by Eqs. (5) and (6).
where ({C}_{l}) is the number of pixels in ({omega }_{l}), (pleft({omega }_{l}right)) can be approximated by a histogram, given by:
where (N=sum_{l=0}^{L-1}{C}_{l}). Then, the (pleft(x,y,{omega }_{l}right)) is obtained by:
where (left({x}_{j},{y}_{j}right)) denotes the coordinates of (jth) sample (pixel) in ({omega }_{l}), ({V}_{{C}_{l}}) represents the volume of the cube whose edge length is ({sigma }_{l}), ({sigma }_{l}) is also called the window width, that is, for a two-dimensional image, ({V}_{{C}_{l}}={{sigma }_{l}}^{2}). (varphi left(cdot right)) is a window function (also called kernel function). We chose Gaussian kernel function, which is taken as:
Thus, (pleft(x,yright)) can be estimated using:
However, probability density estimation itself is an ill-posed problem. Moreover, the estimation of the probability density function involves a large amount of calculation, and it is easily affected by noise and the number of samples. To avoid these negative effects, we give up the estimation of probability density. We attempt to obtain the boundaries for the foregrounds and backgrounds in an image by using a weighted Parzen-window, to obtain a good description of the gray level distribution status, the thresholding problem can be converted to the problem of solving a linear programming problem for determining the coefficient values of the weighted Parzen-window.
Here, we propose the weighted Parzen-window method, which is an improvement of the Parzen-window method. By combining the proposed weighted Parzen-window method and a linear programming technique, we provide a new image thresholding method.
As is well know, thresholding segmentation assumes that the pixels are divided into two classes ({varvec{O}}) and ({varvec{B}}). If we can choose an suitable (rho) to divide (left{{omega }_{l}, lin G, G=left{mathrm{1,2},dots ,.L-1right}right}) into two classes, such as (left{{omega }_{O}, Oin Gright}), (left{{omega }_{B},Bin Gright}), ({omega }_{O}bigcap {omega }_{B}=phi , {omega }_{O}bigcup {omega }_{B}=G), and satisfying:
Then, Eq. (13) can be seen as the boundary of foregrounds and backgrounds:
According to the boundary, it is easy to divide the gray level into two classes. However, this approach is not always effective, because the Parzen-window technique does not provide a method for choosing an appropriate (uprho). Thus, the Parzen-window technique must be modified so that it can better describe the boundary of the data distribution and obtain the appropriate (uprho). We now provide a solution strategy.
Suppose that a d-D pattern space with (N) samples is as follows:
where (I) denotes the coordinate set. Now, let’s consider the following linear programming (LP).
where (varphi left(cdot right)) denotes the kernel function. Because the kernel function (varphi left(cdot right)) and coefficient ({a}_{i}) are non-negative, the implicit constraint is (rho ge 0). The solution of the above LP and the kernel function together constitute a new description of the data distribution:
where ({I}^{^{prime}}=left{i|iin I and {a}_{i}>0right}). The solution of Eq. (15) is guaranteed by the following theorem.
The solution of Eq. (15) is absolute existence.
According to the constraints in Eq. (15), we have:
It is easy to know that Eq. (15) is a feasible solution.
Thus, Eq. (15) exist in the solution domain. It can be concluded from the optimization theory that the solution of Eq. (15) is an absolute existence. Proof end.
If (varphi left({X}_{j},{X}_{i}right)) is regarded as a measure of the similarity between samples (j) and (i), Eq. (15) provides a strategy for selecting (uprho). The constraints of Eq. (15) make the inter-class similarity as large as possible. Therefore, the boundaries of the data distribution can be better delineated. Simultaneously, (widehat{p}left(Xright)) is not the probability density estimation, instead, focus on describing the boundaries of data distribution, and:
The simplex method26 is the most commonly used method to solve the LP problem, thus, we chose it for this study.
A gray image is regarded as a two-dimensional sample space. This can be easily mapped to linear programming. For example, a 2-dimensional space (X) is replaced by (left{fleft(x,yright)|xin left{mathrm{1,2},3,dots ,mright},yin left{mathrm{1,2},3,dots ,nright}right}) , the index coordinate (I) is replaced by the pixel coordinate set (omega), kernel function (varphi left(cdot right)) is the same as in Eq. (9). Thus, we can classify all gray levels into two classes using the proposed weighted Parzen-window and linear programming based image thresholding (WPWLPT) method.
In this section, we present the experimental results, obtained by using some classic methods (such as OTSU3 and KSW5), some state-of-art methods (such as CHPSO14, GLLV19 and GABOR20, and all the parameters being set to the default values during the experiments) and our proposed method (we call it as WPWLPT from now). Li et al.14 proposed the CHPSO method, which can be used for both bi-level and multi-level thresholding (they provide equations for both the bi-level and multi-level cases). It uses OTSU and KAPUR as objective functions, which we denote CHPSO_otsu and CHPSO_ksw, respectively.
In order to assess the effectiveness of the proposed method, we qualitatively and quantitatively assessed on lots of images. For brevity, we only reported 22 representative thresholding results, which included two synthetic, eight nondestructive testing (NDT) and a set of benchmark images. These images had different sizes and histogram types. We designed two synthetic images. The NDT images were obtained from2. The benchmark images belong to the Image Processing Standard Database (http://www.imageprocessingplace.com/root_files_V3/image_databases.htm) and the USC-SIPI Image Database (http://sipi.usc.edu/database/), which are well-known and widely used in the image thresholding literatures.
Currently, there are several measurements2,21,27,28,29,32 to quantitatively evaluate the quality of the image thresholding method. We used the misclassification error ((ME))2, region nonuniformity ((NU))2, feature similarity ((FSIM))29 and mean intersection over union ((mIoU))32 to quantitatively assess the different thresholding methods.
(ME) measurement reflects the incorrect classification of foregrounds pixels to the backgrounds or vice versa2. For the bi-level image thresholding problem, (ME) can be taken as:
where ({B}_{mathrm{o}}) and ({F}_{mathrm{o}}) denote the backgrounds and foregrounds of the optimal thresholded image, ({B}_{T}) and ({F}_{T}) denote the backgrounds and foregrounds region pixels of the original image, and (left|*right|) denotes the cardinality of the set (*). Obviously, (ME) equals to 1 for the worst case and 0 for the best case. (ME) is the easiest and most effective method for the discrepancy measure30.
(NU) measures the intrinsic quality of the segmented regions, is defined as:
where ({sigma }^{2}) denotes the variance of the image, and ({{sigma }_{f}}^{2}) denotes the variance of the foregrounds. ({B}_{T}) and ({F}_{T}) denote the backgrounds and foregrounds region pixels of the original image. Obviously, (NU) closes to 0 for a well-segmented image and equals to 1 for the worst-segmented image.
(FSIM) calculates the similarity of two images, is defined as:
where
where ({T}_{1}) and ({T}_{2}) denote constants. Here, ({T}_{1}=0.85, {T}_{2}=160). (Omega) is the whole space of image. (G) is the gradient of image, defined as:
(PC) represents the phase consistency, defined as:
where ({A}_{n}left(xright)) denotes (n) order amplitude, (Eleft(Xright)) represents (n) order response vector level at position (X). (varepsilon) represents a small positive constant. Obviously, (FSIM) closes to 1 for a well-segmented result and equals to 0 for the worst-segmented result.
Synthetic images are perfect for testing the image thresholding algorithm because their optimal threshold values can be obtained manually31. Figure 2 shows two original synthetic images with (256times 256) pixels, which named as “Circles” and “Squares” [Fig. 2a,e], respectively. In Fig. 2a, we place some circles (their gray level is 150) on a darker background (gray level is 50). Figure 2b shows a noisy image of Fig. 2a with Gaussian noise, and Fig. 2c shows the histogram of Fig. 2b. Figure 2d shows the ground-truth image of Fig. 2b. In Fig. 2e, we place some squares (their gray level is 225) on a darker background (gray level is 75). Figure 2f shows a noisy image of Fig. 2e with Gaussian noise, and Fig. 2g shows the histogram of Fig. 2f. Figure 2h shows the ground-truth image of Fig. 2f.
Two examples of synthetic images. (a) “Circles” image. (b) Noised “Circles” image. (c) Histogram of the noised “Circles” image. (d) Ground-truth image of noised “Circles”. (e) “Squares” image. (f) Noised “Squares” image. (g) Histogram of the noised “Squares” image. (h) Ground-truth image of noised “Squares”.
For the synthetic “Circles” image, the optimal threshold value, which was calculated manually based on the ground-truth image, is 108. The threshold values, (MEs), (NUs) and (FSIMs) obatined using the seven thresholding methods are listed in Table 1. The best values in terms of (MEs), (NUs) and (FSIMs) are highlighted in bold. Among the seven thresholding methods, the threshold value obtained by WPWLPT is the closest to the optimal threshold value. It equals 110, and that the (ME), (NU) and (FSIM) are equal to 0.0049, 0.0837 and 0.8103, respectively. The threshold value obtained using the OTSU method is 102. Its (ME), (NU) and (FSIM) are equal to 0.0120, 0.1025 and 0.7998, respectively. The threshold value obtained using the KSW method is 82. Its (ME), (NU) and (FSIM) are equal to 0.2650, 0.2208 and 0.6425, respectively. The threshold value obtained using the CHPSO_otsu method is 102. Its (ME), (NU) and (FSIM) are equal to 0.0120, 0.1025 and 0.7998, respectively. The threshold value obtained using the CHPSO_ksw method is 84. Its (ME), (NU) and (FSIM) are equal to 0.2595, 0.2172 and 0.6652, respectively. The threshold value obtained using the GLLV method is 101. Its (ME), (NU) and (FSIM) are equal to 0.0156, 0.1368 and 0.7921, respectively. And the threshold value obtained using the GABOR method is 105. Its (ME), (NU) and (FSIM) are equal to 0.0098, 0.1027 and 0.8024, respectively.
For the synthetic “Squares” image, the optimal threshold value, which was calculated manually based on the ground-truth image, is 153. The threshold values, (MEs), (NUs) and (FSIMs) obatined using the seven thresholding methods are listed in Table 2. The best values in terms of (ME), (NU) and (FSIM) are highlighted in bold. Among the seven thresholding methods, the threshold value obtained by WPWLPT was also the closest to the optimal threshold value. It equals 152, and that the (ME), (NU) and (FSIM) are equal to 0.0018, 0.0386 and 0.8198, respectively. The threshold value obtained using the OTSU method is 147. Its (ME), (NU) and (FSIM) are equal to 0.0020, 0.0405 and 0.8002, respectively. The threshold value obtained using the KSW method is 108. Its (ME), (NU) and (FSIM) are equal to 0.0606, 0.1982 and 0.6512, respectively. The threshold value obtained using the CHPSO_otsu method is 148. Its (ME), (NU) and (FSIM) are equal to 0.0019, 0.0401 and 0.8076, respectively. The threshold value obtained using the CHPSO_ksw method is 110. Its (ME), (NU) and (FSIM) are equal to 0.0618, 0.1884 and 0.6725, respectively. The threshold value obtained using the GLLV method is 150. Its (ME), (NU) and (FSIM) are equal to 0.0018, 0.0398 and 0.8178, respectively. And the threshold value obtained using the GABOR method is 146. Its (ME), (NU) and (FSIM) are equal to 0.0021, 0.0403 and 0.8104, respectively.
As can be seen from the results of the threshold values, (MEs), (NUs) and (FSIMs), it is clear that:
For the synthetic “Circles” image, the threshold values of KSW and CHPSO_ksw are 82 and 84, respectively. They are almost worthless threshold values, because of them far from the optimal threshold (108). In contrast, the threshold values of OTSU, CHPSO_otsu, GLLV, GABOR and WPWLPT are 102, 102, 101, 105, 110, respectively, which are reasonable threshold values due to their near to the optimal value. Especially, the threshold value of our WPWLPT is only 2 larger than the optimal threshold. The results in terms of (MEs), (NUs) and (FSIMs) also reveal that our WPWLPT yields the best results. The (MEs) and (NUs) provided by the KSW and CHPSO_ksw methods were so higher, and the (FSIMs) were so lower than other methods. While OTSU, CHPSO_otsu, GLLV, GABOR and WPWLPT can obtain reasonable results, especially our WPWLPT method which obtains the minimum (ME), (NU) and the maximum (FSIM) values.
For the synthetic “Squares” image, the threshold values of KSW and CHPSO_ksw are 108 and 110, respectively. These are almost worthless threshold values too, because they are from the optimal threshold (153). In contrast, the threshold values of OTSU, CHPSO_otsu, GLLV, GABOR and WPWLPT are 147, 148, 150, 146, 152, respectively, which are reasonable threshold values because they are close to the optimal value. Especially, the threshold value of our WPWLPT is only 1 less than the optimal threshold. The results in terms of (MEs), (NUs) and (FSIMs) also reveal that our WPWLPT yields the minimum (ME), (NU) and the maximum (FSIM) values, which were best results among all the seven thresholding methods.
Figure 3 provides a visual comparison between the thresholding results obtained by the OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and the proposed WPWLPT methods. As can be seen from Fig. 3, the KSW and CHPSO_ksw methods obtained almost unvalued results because their segmented images had obvious noise (see Fig. 3, the second and fourth images of each row). In contrast, all the OTSU, CHPSO_otsu, GLLV, GABOR and WPWLPT methods segmented a cleaner image because the threshold values they obtained were close to the optimal threshold value. Furthermore, by zooming in Fig. 3, we can easily observe that the WPWLPT method gives the clearest segmentation results compared with the OTSU, CHPSO_otsu, GLLV and GABOR methods, because it has the least residual noise.
Thresholding segmentation results of the noised synthetic image by using different methods. For each experimental synthetic image, the results of OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and WPWLPT methods are displayed side by side from left to right.
The NDT images are also ideal for testing the image thresholding algorithm because their ground-truth images can be obtained directly. In this part, eight NDT images were used to assess the performance of the WPWLPT. They are “PCB”, “defective tile”, “material structure”, “fuselage material”, “eddy current”, “ultrasonic”, “GFRP”and “bonemarr”. All the above eight images, their histograms and ground-truth images are shown in Fig. 4. The thresholding segmentation results obtained using the reference thresholding methods and WPWLPT are shown in Fig. 5.
The experimental NDT images, their histograms and ground-truth images.
Thresholding segmentation results by using different methods. For each experimental image, the results of OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and WPWLPT methods are displayed side by side from left to right.
Tables 3, 4 and 5 show the (MEs), (NUs) and (FSIMs) of the different thresholding methods, respectively. ({varpi }_{ME}),({varpi }_{NU}) and ({varpi }_{FSIM}) represent the average of (MEs), (NUs) and (FSIMs) respectively. The best results are highlighted in bold.
Because of length limits, we only analyzed four NDT images. They are the “PCB”, “material structure”, “eddy current” and “GFRP”.
For “PCB” image, the (ME) and (FSIM) values obtained by WPWLPT method are optimal, while the (NU) value is inferior to GLLV method only. This is reasonable because they focused on different aspects of measurement. (ME) represents the percentage of background pixels incorrectly classified to the foreground, or vice versa, (FSIM) focuses on the texture, shape and other features, while (NU) judges the intrinsic quality of the segmented areas. The worst results are obtained using the KSW method. Its (ME), (NU) and (FSIM) values are equal to 0.2170, 0.6725 and 0.5864, respectively. Obviously, compared with other methods, its (ME) and (NU) values are too high and (FSIM) value is too low, making the results worthless. A visual comparison, as shown in Fig. 5, shows that the OTSU, CHPSO_otsu, GLLV and WPWLPT methods can segment better segmentation image. By comparison, the KSW, CHPSO_ksw and GABOR methods segmented valueless results because they misclassify lots of foregrounds as backgrounds (see Fig. 5, first row, second, fourth and sixth images, they can’t distinguish the backgrounds and printed circuit board, especially the second image).
For “material structure” image, GLLV, GABOR and OTSU yield the best (ME) (NU) and (FSIM) values, respectively. However, WPWLPT yields the closest values of (ME), (NU) and (FSIM) values to the best. The worst results are obtained using the KSW method. Its (ME), (NU) and (FSIM) equal to 0.6176, 0.7036 and 0.5028, respectively. Obviously, its (ME) and (NU) values are too high and (FSIM) value is too low, so the results obtained are worthless. The visual comparison, as can be seen from Fig. 5, we can also discover that the OTSU, CHPSO_otsu, GLLV and WPWLPT methods can segment better segmentation image. By comparison, the KSW and CHPSO_ksw methods segment almost an unvalued segmentation image because they misclassify lots of foregrounds as backgrounds (see Fig. 5, third row, second and fourth image, the whole image looks black).
For “eddy current” image, the (ME) and (NU) values obtained by WPWLPT method are optimal, while the (FISM) value is inferior to GABOR method only. The worst results are obtained using the KSW method. Its (ME), (NU) and (FSIM) values are equal to 0.0407, 0.1239 and 0.7002, respectively. Similar to the results of the KSW method, the CHPSO_ksw method also yielded poor results for (ME), (NU) and (FSIM) values. The visual comparison, as can be seen from Fig. 5, we can also discover that the GLLV, GABOR and WPWLPT methods can segment better segmentation images. By comparison, the KSW and CHPSO_ksw methods segment a low-value segmentation image because they misclassify some backgrounds as foregrounds (see Fig. 5, fifth row, second and fourth images, some black shadows appeared in the segmentation image).
For “GFRP” image, all the (ME), (NU) and (FISM) values obtained by WPWLPT method are optimal. The worst results are also obtained by the KSW method. Its (ME), (NU) and (FSIM) values are equal to 0.4898, 0.7879 and 0.6036, respectively. Obviously, the (ME) (0.7879!) is close to 1 which corresponding to the worst case. The results obtained by CHPSO_ksw method are also valueless due to their higher (ME), (NU) values and lower (FSIM) values. A visual comparison, as can be seen from Fig. 5, shows that the OTSU, CHPAO_otsu, GLLV, GABOR and WPWLPT methods can segment better segmentation images. By comparison, the KSW and CHPSO_ksw methods segmented valueless results because they misclassify lots of backgrounds as foregrounds (see Fig. 5, seventh row, second and fourth images, it’s impossible to distinguish between foregrounds and backgrounds).
A set of benchmark images belonging to the Image Processing Standard Database and USC-SIPI Image Database, which contain 12 Gy images. For brevity, we give 12 images here, “cameraman”, “house”, “jetplane”, “lake”, “milkdrop”, “livingroom”, “mandril”, “peppers”, “pirate”, “walkbridge”, “tank”, and “boat”, all in uncompressed tif or tiff format and of the same (512times 512) size. The thresholding segmentation results of the corresponding twelve images obtained by the reference thresholding methods and WPWLPT are shown row by row from top to bottom in Fig. 6. Tables 6 and 7 show the (NUs), and (FSIMs) of different thresholding methods, respectively. ({varpi }_{NU}), and ({varpi }_{FSIM}) represent the average of (MEs), and (FSIMs) respectively. The best results are highlighted in bold. It should be noted that, we did not employ (ME) to measure the quality of thresholding methods experiment on these images, because the ideal thresholded or ground-truth images cannot be acquired.
Thresholding segmentation results by using different methods. For each experimental image, the results of OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and WPWLPT methods are displayed side by side from left to right.
As shown in Fig. 6, Tables 6 and 7, it can be observed that:
For most of the tested images, the values of (NU) and (FISM) obtained by WPWLPT are the lowest. Specifically, for the “cameraman”, “house”, “milkdrop”, “peppers”, “walkbridge”, “tank” and “boat” images, the proposed WPWLPT method can obtain the lowest (NU) values. For the “pirate” image, OTSU obtains the lowest (NU) values. For the “lake” and “pirate” images, CHPSO_otsu obtains the lowest (NU) values. For the “livingroom” and “mandril” images, GLLV obtains the lowest (NU) values. For the “jetplane” image, GABOR obtains the lowest (NU) values. In terms of (FISM), the proposed method are similar. It obtains the highest (FISM) values in the “cameraman”, “milkdrop”, “peppers”, “pirate”, “walkbridge”, “tank” and “boat” images. Although the WPWLPT method did not obtain the lowest (NU) values and highest (FISM) values for all 12 test images, the average value of (NUs) and (FISMs) were the best among all seven thresholding methods. Specifically, the ({varpi }_{NU}) values of OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and WPWLPT are equal to 0.1119, 0.3772, 0.1127, 0.3686, 0.2037, 0.1278 and 0.0992, respectively. The ({varpi }_{FISM}) values of OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and WPWLPT equal to 0.7601, 0.5896, 0.7597, 0.6058, 0.73014, 0.7646 and 0.7867, respectively. It means that the ({varpi }_{NU}) value obtain by our method outperforms the OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV and GABOR methods by 1.27%, 27.80%, 1.35%, 26.94%, 10.45% and 2.87% respectively, while the ({varpi }_{FISM}) value outperforms the OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV and GABOR methods by 2.66%, 19.71%, 2.69%, 18.09%, 5.66% and 2.20% respectively.
From the above analysis, we can assert that the WPWLPT method can calculate better ({varpi }_{NU}) and ({varpi }_{FISM}) values in comparision with other reference methods. This result demonstrates the stability and accuracy of the proposed method.
(mIoU) is the more widely used objective metric for the task of image segmentation. It is defined as:
where (k) is the number of classes, (TP, FN and FP) denote true positives, false positives and false positives, respectively. We employ (mIoU) to objectively evaluate synthetic and NDT images because they have ground-truth images. The (mIoUs) obtained by different thresholding methods are listed in Table 8. ({varpi }_{mIoU}) represents the average of (mIoUs). The best results are highlighted in bold.
As shown in Table 8, in most test images, the values of (mIoU) obtained by WPWLPT are the highest. Specifically, for the “Circles”, “PCB”, “defective tile “, “material structure”, “fuselage material “, “eddy current”, “ultrasonic” and “GFRP” images, the proposed WPWLPT method can obtain the highest (mIoU) values. For the “, “Squares” image, GLLV, GABOR and WPWLPT both obtained the highest (mIoU) value. For the “bonemarr” image, GLLV and WPWLPT both got the highest (mIoU) values.
Figure 7 depicts the average values of (mIoU) for the synthetic and NDT images. As shown in Fig. 7, our method has been improved to varying degrees on average (mIoU) compared with other methods. Specifically, the ({varpi }_{mIoU}) values of OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV, GABOR and WPWLPT are equal to 78.7%, 65.8%, 79.5%, 68.2%, 83.3%, 83.7% and 85.3%, respectively. It means that the ({varpi }_{mIoU}) value obtain by our method outperforms the OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV and GABOR methods by 6.0%, 19.5%, 5.8%, 17.1%, 2.0% and 1.6%, respectively.
The average (mIoUs) (%) of different methods.
Based on the above analysis of the experimental results of synthetic, NDT and a benchmark images, we find that:
The proposed WPWLPT method obtained the best segmentation performance for most images. In addition, our method can yields the lowest ({varpi }_{ME}) and ({varpi }_{NU}), the highest ({varpi }_{FISM}) and ({varpi }_{mIoU}) on all the synthetic, NDT and the benchmark of images. Specifically, for the two synthetic images, the ({varpi }_{ME}), ({varpi }_{NU}), and ({varpi }_{FISM}) of WPWLPT equal to 0.0034, 0.0612 and 0.8151, respectively. The ({varpi }_{ME}) of WPWLPT outperforms the competing methods by 0.0037 to 0.1595, the ({varpi }_{NU}) outperforms the competing methods by 0.0102 to 0.1484, and the ({varpi }_{FISM}) outperforms the competing methods by 0.0101 to 0.1636. For the eight NDT image, the ({varpi }_{ME}), ({varpi }_{NU}), and ({varpi }_{FISM}) of WPWLPT equal to 0.0386, 0.0886 and 0.7168, respectively. The ({varpi }_{ME}) of WPWLPT outperforms the competing methods by 0.0146 to 0.2152, the ({varpi }_{NU}) outperforms the competing methods by 0.0088 to 0.2999, and the ({varpi }_{FISM}) outperforms the competing methods by 0.0192 to 0.0950. For the benchmark of twelve images, the ({varpi }_{NU}), and ({varpi }_{FISM}) of WPWLPT equal to 0.0992, and 0.7867, respectively. The ({varpi }_{NU}) outperforms the competing methods by 0.0127 to 0.2780, and the ({varpi }_{FISM}) outperforms the competing methods by 0.0220 to 0.1971. For all the ten synthetic and NDT images, The ({varpi }_{mIoU}) of WPWLPT equals to 85.3%, which outperforms the competing methods by 1.6% to 19.5%. These experimental results well demonstrate the effectiveness and robustness of the proposed WPWLPT method.
From a visual perspective (Figs. 3, 5 and 6), although for some images, our method does not achieve the best segmentation effectiveness, it can obtain acceptable or close to the best results, which also shows the stability of our method.
OTSU is a traditional method, that exhibits high stability and accuracy. It outperformed most of the other methods except for ours.
Although our method works well for most images, it doesn’t yield best performance on “material structure”, “lake”, “milkdrop” et al. (For these three images, all the ({varpi }_{ME}), ({varpi }_{NU}), ({varpi }_{FISM}) or ({varpi }_{mIoU}) values are not optimal). The possible reason is the boundary information, which plays a crucial role in our proposed method is not obvious.
The KSW and CHPSO_ksw methods are the two worst performing methods. The Kapur based method is 1D entropy without considering other information. Obviously, GLLV and GABOR methods are superior to Kapur based method because they introduce other information such as gradient magnitude, texture and contour, etc. This also gave us inspiration to introduce other information into our method, which is our next step. This also gives us a clue to introduce other information into our method, and contour information is a potential choice. Moreover, it can be seen as our future work.
In addition to the qualitative and quantitative assessment, the running time of the thresholding method is another important evaluation. Table 9 reports the average running time obtained by different threshold methods for the above 22 test images. All the experiments are running on the DELL notebook with Intel(R) Core (TM) i5-4300U CPU @ 1.90 GHz 2.50GHZ, 16 GB memory. The running environment is Matlab (R2015b). As shows in Table 9, the proposed WPWLPT method takes approximately the same amount of time as the GLLV method. It is superior to the GABOR method but inferior to 1D methods, such as OTSU, KSW, CHPSO_otsu and CHPSO_ksw. Although our method is slower than OTSU, KSW etc., the running time is completely acceptable in many applications. In addition, our WPWLPT method is still highly competitive because of its superior effectiveness and robustness.
In this study, a new image bi-level thresholding method is proposed. The method first obtains the boundaries for the foreground and background in the image using a weighted Parzen-window to describe the gray level distribution status. Secondly, the image thresholding problem can be transformed into the problem of solving a linear programming problem for computing the coefficient values of the weighted Parzen-window. By solving the problem of linear programming, we determine the threshold. In the experiment, we used two synthetic, eight NDT and a benchmark of twelve testing images, which have different histogram types, to evaluate the quality of the proposed image thresholding method. The measurement of visual and quantitative results demonstrates that our proposed method, compared with the OTSU, KSW, CHPSO_otsu, CHPSO_ksw, GLLV and GABOR methods, can achieve better effectiveness and robustness. In the future, as an extension of this work, we will embed other information, such as texture, contour etc. in WPWLPT to enhance its performance, and extend the method to the problem of multilevel thresholding.
The data underlying this article will be shared on reasonable request to the corresponding author.
Lei, B. & Fan, J. Image thresholding segmentation method based on minimum square rough entropy. Appl. Soft Comput. J. 84(11), 105687 (2019).
Article  Google Scholar 
Sezgin, M. & Sankur, B. Survey over image thresholding techniques and quantitative performance evaluation. J. Electron. Imaging 13(1), 146–165 (2004).
ADS  Article  Google Scholar 
Otsu, N. A threshold selection method from gray-level histograms. IEEE Trans. Syst. Man Cybern. 9(1), 62–66 (1979).
Article  Google Scholar 
Kittiler, J. & Illingworth, J. Minimum error thresholding. Pattern Recogn. 19(1), 41–47 (1986).
ADS  Article  Google Scholar 
Kapur, J. N., Sahoo, P. K. & Wong, A. A new method for gray-level picture thresholding using the entropy of the histogram. Comput. Vis. Graph. Image Process. 29(3), 273–285 (1985).
Article  Google Scholar 
Sahoo, P. K., Wilkins, C. & Yeager, J. Threshold selection using Renyi’s entropy. Pattern Recogn. 30(1), 71–84 (1997).
ADS  Article  Google Scholar 
Portes, M., Esquef, I. A. & Gesualdi, A. R. Image thresholding using Tsallis entropy. Pattern Recogn. Lett. 25(9), 1059–1065 (2004).
ADS  Article  Google Scholar 
Liu, J., Zheng, J., Tang, Q. & Jin, W. Minimum error thresholding segmentation algorithm based on 3D grayscale histogram. Math. Probl. Eng. 2014(pt.1), 1–13 (2014).
MathSciNet  CAS  MATH  Google Scholar 
Qin, J., Shen, X., Mei, F. & Fang, Z. An Otsu multi-thresholds segmentation algorithm based on improved ACO. J. Supercomput. 75, 955–967 (2019).
Article  Google Scholar 
Lang, C. & Jia, H. Kapur’s entropy for color image segmentation based on a hybrid Whale optimization algorithm. Entropy 21(3), 318 (2019).
ADS  MathSciNet  Article  Google Scholar 
Zheping, Y., Jinzhong, Z., Zewen, Y. & Jialing, T. Kapur’s entropy for underwater multilevel thresholding image segmentation based on whale optimization algorithm. IEEE Access 9, 41429–41319 (2021).
Google Scholar 
Liu, W. et al. Renyi’s entropy based multilevel thresholding using a novel meta-heuristics algorithm. Appl. Sci. 10(9), 3225 (2020).
CAS  Article  Google Scholar 
Borjigin, S. & Sahoo, P. K. Color image segmentation based on multi-level Tsallis–Havrda–Charvát entropy and 2D histogram using PSO algorithms. Pattern Recogn. 92, 107–118 (2019).
ADS  Article  Google Scholar 
Mozaffari, M. H. & Lee, W. S. Convergent heterogeneous particle swarm optimisation algorithm for multilevel image thresholding segmentation. IET Image Proc. 11(8), 605–619 (2017).
Article  Google Scholar 
LinGuo, L., Lijuan, S., Yu, X., Shujing, L. & Romany, F. M. Fuzzy multilevel image thresholding based on improved coyote optimization algorithm. IEEE Access 9, 33595–33607 (2021).
Article  Google Scholar 
Cheng, H. & Chen, Y. Fuzzy partition of two-dimensional histogram and its application to thresholding. Pattern Recogn. 32, 825–843 (1999).
ADS  CAS  Article  Google Scholar 
Xiao, Y., Cao, Z. & Zhong, S. New entropic thresholding approach using gray-level spatial correlation histogram. Opt. Eng. 49, 1127–1134 (2010).
Article  Google Scholar 
Xiao, Y., Cao, Z. & Zhong, S. Entropic image thresholding based on GLGM histogram. Pattern Recogn. Lett. 40, 47–55 (2014).
ADS  Article  Google Scholar 
Yimit, A., Hagihara, Y., Miyoshi, T. & Hagihara, Y. 2-D direction histogram based entropic thresholding. Neuro Comput. 120, 287–297 (2013).
Google Scholar 
Zheng, X. L., Ye, H. & Tang, Y. G. Image bi-level thresholding based on gray level-local variance histogram. Entropy 19, 191 (2017).
ADS  Article  Google Scholar 
Yi, S., Zhang, G., He, J. & Tong, L. Entropic image thresholding segmentation based on Gabor histogram. KSII Trans. Internet Inf. Syst. 13(4), 2113–2128 (2019).
Google Scholar 
Fusong, X., Jian, Z., Yun, L. & Zhiqiang, Z. (2021). A novel image thresholding method combining entropy with Parzen window estimation. Comput. J., bxab182, 2021, November.
Bian, Z. & Zhang, X. Pattern Recognition 2nd edn. (Tsinghua University Press, 2000).
Google Scholar 
Duda, R. O., Hart, P. E. & Stork, D. G. (2003). Pattern Classification (H.D. Li, T.X, Yao, Trans.), Machinery Industry Press.
Torkkola, K. Feature extraction by non-parametric mutual information maximization. J. Mach. Learn. Res. 3, 1415–1438 (2003).
MathSciNet  MATH  Google Scholar 
Dantzig, G. Linear Programming and Extensions (Princeton Univ. Press, 2016).
Google Scholar 
Zhang, Y. J. A survey on evaluation methods for image segmentation. Pattern Recogn. 29(8), 1335–1346 (1996).
ADS  Article  Google Scholar 
Roldan, R. R. et al. A measure of quality for evaluating methods of segmentation and edge detection. Pattern Recogn. 34(5), 969–980 (2001).
ADS  Article  Google Scholar 
Zhang, L., Mou, X. & Zhang, D. FSIM: A feature similarity index for image quality assessment. IEEE Trans. Image Process. 20(8), 2378–2386 (2011).
ADS  MathSciNet  Article  Google Scholar 
Yasnoff, W. A., Mui, J. K. & Bacus, J. W. Error measures for scence segmentation. Pattern Recogn. 9(4), 217–231 (1997).
ADS  Article  Google Scholar 
Bazi, Y., Bruzzone, L. & Melgani, F. Image thresholding based on the EM algorithm and generalized Gaussian distribution. Pattern Recogn. 40, 619–634 (2007).
ADS  Article  Google Scholar 
Bowen, C., Ishan, M., Alexander G. S., Alexander, K. & Rohit, G. (2022). Masked-attention mask transformer for universal image segmentation. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. Last revised 15 Jun 2022.
Download references
This work was partially supported by the National Natural Science Foundation of China (61672369, 6177255, 62072321 and 61972454), the Collaborative Innovation Center of Novel Software Technology and Industrialization, and the Priority Academic Program Development of Jiangsu Higher Education Institutions, China.
Soochow College, Soochow University, Suzhou, 215006, Jiangsu, China
Fusong Xiong, Zhiqiang Zhang, Yun Ling & Jian Zhang
Collaborative Innovation Center of Novel Software Technology and Industrialization, Nanjing University, Nanjing, 210008, Jiangsu, China
Fusong Xiong, Zhiqiang Zhang & Yun Ling
Wenzheng College, Soochow University, Suzhou, 215104, Jiangsu, China
Jian Zhang
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
Conceptualization, F.X.; methodology, F.X. and J.Z.; software, F.X. and Z.Z.; validation, F.X. and J.Z.; formal analysis, Y.L.; writing—review and editing, F.X. and J.Z.; All authors have read and agreed to the published version of the manuscript.
Correspondence to Fusong Xiong or Jian Zhang.
The authors declare no competing interests.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Reprints and Permissions
Xiong, F., Zhang, Z., Ling, Y. et al. Image thresholding segmentation based on weighted Parzen-window and linear programming techniques. Sci Rep 12, 13635 (2022). https://doi.org/10.1038/s41598-022-17818-4
Download citation
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-022-17818-4
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.
Advertisement
Advanced search
Scientific Reports (Sci Rep) ISSN 2045-2322 (online)
© 2022 Springer Nature Limited
Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

source

July 27, 2022 Russia-Ukraine news – CNN

July 27, 2022 Russia-Ukraine news  CNN
source

Brookhaven approves City Centre Master Plan – Reporter Newspapers

Reporter Newspapers & Atlanta Intown
Hyperlocal News and Information for Metro Atlanta
The Brookhaven City Council approved a plan meant to guide future developments along Peachtree Road at an Aug. 9 meeting. 
The council unanimously approved the City Centre Master Plan, which is part of the city’s 2034 Comprehensive Master Plan and is meant to create a framework for a possible downtown area as well as for development along Peachtree Road. The city held multiple public meetings about the plan in 2021, and the city’s Planning Commission recommended approval of the plan in April. 
Before approving the plan, Councilmembers Madeleine Simmons and Linley Jones recommended a few amendments. Simmons’ recommendations included eliminating any mention of removing lanes on Peachtree Road, but leaving in the option of lane narrowing; adding language to say that any improvements to Brookhaven Park would be in line with the city’s park bond plan. Her recommendations also included striking any language about alternative City Hall locations, as the city has decided to build its new City Hall at the Brookhaven/Oglethorpe MARTA station; adding language that states that the city’s Peachtree Road LCI is the controlling document for recommendations in that corridor; and adding a crosswalk at Ashford Dunwoody Road. 
During public comment, a resident mentioned concerns about language in the plan that alluded to possible development at Brookhaven Park. Jones offered a couple of additional amendments, recommending to remove any references to Brookhaven Park as a potential site for City Hall and any references to development or redevelopment in Brookhaven Park.
The City Centre Master Plan shows a group of linear green spaces and developments along Peachtree Road. The plan also includes pedestrian walkways across Peachtree Road, to make getting from one side of the city to the other easier. The plan also includes a public art plan, traffic studies of Peachtree Road, and recommendations for how the city can move forward with residential, office, and retail development. 
“[The plan] is built upon the idea of can we put purposeful and meaningful greenspace throughout this corridor to both allow development to connect … but also be an armature to set up development sites and new connected streets and a grid system for development,” said Chris Mutter, a partner with the architectural firm HGOR, during a presentation of the plan. 
The plan also includes what it calls “catalyst projects.” According to the report, the projects prioritize greenspace, connectivity, and pedestrian/cyclist circulation.
The first project would take place along Peachtree Road, adding a multi-use trail along the west side of the road. The study states that this would require a lane reduction for Peachtree Road, but Jones recommended an amendment that would strike any mention of removing lanes altogether from this catalyst project. 
The second project would be a pedestrian bridge that would connect Town Brookhaven to neighborhoods to the east of Peachtree Road. There would be greenspace at each end of the pedestrian bridge. 
“This park would eventually continue through the Apple Valley District …as a linear park immediately serving Ashford Park and future residential development in the Apple Valley corridor,” reads the report. 
The third project would center around Brookhaven Park and include a pedestrian and cyclist bridge from Peachtree Road to proposed greenspace at Apple Valley.
The fourth project would include new greenspace in the Apple Valley District. According to the study, results “indicate that the north end of Apple Valley Road is best suited for residential use … Market research indicates Brookhaven would benefit from additional multifamily housing, and a large four acre greenspace here would give neighborhoods east of Peachtree Road direct access to more parkspace.”
The fifth project would be a revitalization of Fernwood Park to give the surrounding neighborhoods easier access to greenspace. 
The last project is the completion of City Hall. This project mentions alternative locations for the City Hall, but Simmons’ recommendation to remove mentions of other locations was approved along with the plan. 
The entire presentation can be viewed on the city’s Facebook page, and the plan is available on the city’s website. 
Sammie Purcell is a staff writer for Reporter Newspapers.

source

How to time when to pursue your online master's degree in nursing – Fortune

Choosing when in your career is prime time for pursuing a master’s degree in nursing (MSN) is a delicate balance of professional objectives and personal obligations. You can continue with full- or part-time work while in school, and these programs can take up to three years to complete, depending on the mashup of work/school/life balance you choose.
Katarina Maric spent 10 years working as a registered nurse (RN) before enrolling in the online master’s degree program at Marymount University. She returned to school with the goal of working as a family nurse practitioner. It was something Maric had been considering for a while, and once she sustained an illness and had to navigate the health care system with some frustration, Maric formalized her decision to go back to school and committed to enrolling. 
Outside of her experience managing the system, timing her degree amid raising children after logging substantial time as an RN made sense. Doing so enabled Maric to leverage her clinical experience as a bedside nurse to get the most out of her education. “There is an art in talking to patients on sensitive subjects,” she says. “It helps to have that nursing background so you know how to approach patients. We are building on knowledge we already have.” 
What’s more, Maric, 34, lives with her husband and two young children about 40 minutes from campus and decided that completing the degree online made the most sense for her lifestyle. The idea of a daily commute to class, while managing life at home with her three- and five-year old sons seemed especially daunting, particularly in suburban Washington D.C. traffic. She needed a program that allowed her to get the degree she wanted, while maximizing her time at home with her children, but the online curriculum wasn’t her only requirement. 
“I wanted to be able to go to campus if I had to,” she says. “I wanted a support system.”
Maric’s story isn’t uncommon, and there are a myriad of reasons why working nurses and recent nursing school grads go on to pursue a master’s degree. 
Drexel University offers multiple tracks within its online MSN program, including nurse practitioner, nursing leadership, and nursing education. “The profile of the student at Drexel in these programs varies drastically,” says Jackie Murphy, assistant professor of clinical nursing at the university, who earned her MSN through its online program.
The program attracts both newly graduated nursing students, who have been working a year or maybe getting experience while in school, along with more seasoned professionals, she notes. “Then we have people who have been nurses for 20-plus years and have decided they want to go back to school. It’s a diverse group of learners.”
Nursing has been called a recession-proof career and offers a lot of flexibility in terms of professional trajectory, with graduates going on to roles in administration, education, private practice, clinical work, and more. The U.S. Bureau of Labor Statistics estimates that jobs for nurse practitioners and similar career paths will grow 45% in the 10-year period between 2020 and 2030. The median income for the role in 2021 was $123,781.
Timing when to pursue a master’s degree in nursing is a personal choice that rides on many factors, like finances, personal life, geography, career objectives, and more, Murphy says. 
For Nicole Barbour, the pandemic accelerated her decision to enroll in the online nurse practitioner track at Marymount. Barbour, 44, works as a school nurse, and because students in her suburban Virginia school district were attending class virtually from home, she had a lot of extra time on her hands to devote to her own education. 
“I felt like it was a natural progression to move into a more advanced role and move into more of a health care provider role,” says Barbour, who balances her schoolwork with raising two grade-school-age children and will graduate in December. Like Maric, she says that working for so long as an RN better prepared her for the curriculum at Marymount. Upon graduation, Barbour plans to find a new job in family practice. After five years working under an agreement with a physician (according to Virginia law), she’ll also have the option to start her own private practice.
Meanwhile, others come to these master’s degree programs straight from undergrad—like Harleen Singh, 25, who then went on to complete her doctorate in nursing practice online (DNP) at Johns Hopkins University. “I always had it as a goal,” says Singh, who graduated in May and completed the degree while working part-time as a nurse on a pediatric progress care unit at the University of Maryland. “It was a great intersection to carry my experience on as a bedside nurse, but also prescribe and be an educator if I [eventually] wanted.”
A few months after graduating, Singh is in the process of applying for jobs and studying for board exams. “I’m looking mainly at pediatric outpatient primary care jobs,” she adds. “My huge interest is pediatric hematology and oncology. It’s great to have a full comprehensive outpatient experience.”
Whether logging a decade or more in full-time work or jumping right into an advanced degree after nursing school, an online master’s degree in nursing can open countless doors and allows for immense flexibility. 
“Nursing is trending toward more advanced degrees, more responsibility, and more salary,” says Kimberly McIltrot, assistant professor, interim vice dean, and DNP program director at Johns Hopkins School of Nursing. “It [offers] a lot of opportunities for a really flexible, rewarding career.”
See how the schools you’re considering fared in Fortune’s rankings of the best master’s degree programs in nursing, computer science, cybersecurity, psychology, public health, business analytics, and data science, as well as the best doctorate in education programs and part-time, executive, full-time, and online MBA programs.

source

Creative Advertising Students Win 2 of 10 Communication Arts Student Awards Given Worldwide – Syracuse University News

The Newhouse School ranked as the second most awarded school internationally in the Communication Arts Advertising Annual 62, winning two out of the 10 student awards given and five Shortlists.
“The students at Newhouse continue to impress,” said alumnus Dan Lucey ’99, chief creative officer at Havas in New York City. “They consistently demonstrate clear and powerful thinking that translates into brand activations, social media executions, mobile apps, experiential, new technology integrations, out-of-home advertising and print.”
The winning campaigns were created in the creative advertising portfolio courses taught by professors of practice Kevin O’Neill and Mel White. Sam Luo, who created three of the winning campaigns, said the experience and mentorship of his professors helped him succeed both in and out of the classroom
“They both are so experienced in guiding students and young creatives into landing the best work of their lives,” Luo said. “They are very patient but give direct, honest feedback each round. They are not afraid to push students into becoming better craftsmen in the creative advertising field.”
The portfolio courses are designed to mirror the intensity of the creative advertising industry. Entering in competitions like the Communication Arts Advertising Annual awards helps students’ portfolios stand out when applying for jobs and internships.
“The advertising industry is a very competitive business, the creative end especially so,” O’Neill said. “Contending for awards in publications like Communication Arts hones our students’ competitive instincts and drives them to ever higher standards of excellence.”
“The students work hard in their creative advertising courses to create compelling ad campaigns, and these Communication Arts Advertising Awards and Shortlist Awards are an excellent outcome of that. The advertising industry has communicated that these students create award-winning work. And this goes a long way when interviewing for jobs.”
The two award winners in the Communication Arts Advertising Annual 62 were “Jeep Views,” created by Mike Gaines, and “McDelivery,” created by Luo. The campaigns are shown in the most recent November/December print and digital editions of Communications Arts’ international publication.
“Both projects demonstrate a strategic understanding of the brand, brand assets and the need for simple communication in an era when we are dividing our attention between multiple screens,” Lucey said.
Gaines wanted to create a campaign that spoke to Jeep’s ruggedness and functionality.
“To Jeep owners, their vehicles are far more than just cars. They are a way of exploring and experiencing places previously unimaginable,” Gaines said.
One of Gaines biggest challenges was simply communicating Jeep’s ability to unlock new experiences for owners and drivers while keeping the company’s branding at the forefront. In Gaines’ campaign, Jeep’s signature grill became framing cutouts in billboards and print ads. Mountainous, snow-capped and desert landscapes peek through the grills ready to be explored behind the wheel of a Jeep.
For Gaines, the award affirmed he’d chosen the right career path. “It feels amazing to have my hard work, dedication and creativity celebrated by such a prestigious advertising competition. Even being considered in the running among so many other young creatives was an accomplishment to me,” he said.
Art director Luo won the other Communication Arts Advertising Annual award for his “McDelivery” campaign for McDonald’s. Luo wanted his campaign to highlight McDonald’s delivery service while fitting with the company’s signature brand.

“I just have seen so many well-done, iconic McDonald’s campaigns over the years. Their brand voice is so clear and easy to understand,” Luo said.
Luo focused on the insight that McDonald’s has one of the most comprehensive fast food delivery services worldwide, making it easy for customers to order their favorite meals. From there, Luo turned to his pencil to visually brainstorm his concept, using McDonald’s distinct branding as a guide.
“Writing down every nugget of an idea is crucial because that may build over time and spark even more thoughts,” Luo said. “Usually at that phase, I draw a lot of stuff and pick about a dozen ideas to further develop.”
To illustrate the company’s delivery service, Luo developed a print campaign featuring McDonald’s arches glowing in the night as they bounce off city streets into apartment windows. While the art direction came clearly to him, Luo said figuring out how to physically achieve his vision was challenging.
“The execution took a really long time,” he said. “I tried different ways to bring the iconic golden arches to life, and in the end I landed on 3-D renderings, which took a while to figure out.”
“This award is one of the hardest awards to win in the industry because they give out such a limited amount,” he said. “Also the judges are really high-level creative directors and even executive creative directors, so having their support means the world.”
Five Newhouse creative advertising student campaigns earned Communication Arts Advertising Shortlist awards.
Luo and partner copywriter Grace Curran worked on the shortlisted campaign “On Hold” (video) for WhatsApp, which focused on mental health. This integrated campaign addressed the high depression and anxiety levels among Generation Z and their connection to social media.

“Sam and I were inspired by our own experiences as members of Gen Z,” Curran said. “We had a lot of discussions about anxiety and mental health as a whole and agreed that being tied to our phones was a root cause for many of the mental challenges we faced on an everyday basis.”
Luo and Curran decided to do the unexpected and turn to the technology in their phones for inspiration. “Obviously, it seems counterintuitive for a phone app like WhatsApp to tell people to take time away from their phones, but that’s what we liked about it,” Curran said. “It’s not only provocative, but also shows that they care and that, sure, sometimes what’s going on digitally is important, but what’s going on mentally is always going to be more important.”
“On Hold” uses mental health check-ins through facial recognition scans, signal-blocking “On Hold” towers and automatic away messages to help users who feel overwhelmed and anxious. The campaign also included streetwear printed with barcodes that, when scanned with a phone’s camera, took users to the WhatsApp On Hold app to find mental health support. Curran said Professor White and the team’s mentor Grant Mason, creative at Wieden+Kennedy in NYC at that time, encouraged them to create a fully integrated idea and stretch it as much as possible.
“We were always taught to think big and to make our campaigns flow seamlessly, and mimicking shutting off our personal devices on a larger scale was definitely something we saw as a seamless strategic activation,” Curran said.
“PAL: Protect Asian Lives” (video), created by art director Rachel Hayashi and copywriter Jessica Mastorides for Apple, was shortlisted.The pair received a brief to use new technology to address a real world problem. Hayashi and Mastorides’searched for an issue they both felt passionate about, which led to the creation of PAL, a campaign designed to address the sharp rise in violent anti-Asian hate crimes during the COVID-19 pandemic, specifically the many unreported crimes.

“With a lot of these hateful incidents and violence against Asian Americans, unfortunately, a lot of cases cannot be proven as hate crimes or hate motivated,” Hayashi said. “There can be video footage, but sometimes if there’s not an audio recording as proof that it’s actually driven by hate against Asian Americans, it won’t be classified as a hate crime.”
The two researched new technologies and found location tracking software developed by Apple during the COVID-19 pandemic. When activated, PAL combines this location tracking software and voice-activation to monitor the user’s travels. If it detected any anti-Asian language, the Apple app would begin recording audio. PAL then uploaded this evidence and the location of the incident to a secure database that informed not only the nearest police station but also a Stop AAPI Hate organization for help.
“When we were thinking about ways in which we could help the Asian community, we steered towards solutions that are already in their hands,” Mastorides said. “That’s why we thought immediately of using Apple and iPhones because everybody has iPhones, and it’s an easy way to have new technology right at your fingertips when you’re in any type of crisis.”
The pair was thrilled to see PAL get recognition at the Communication Arts Awards. “This one meant a lot. It was originally an assignment for our Portfolio III class, but then it quickly turned into a passion project for us,” Hayashi said. “Hopefully with this being shortlisted, and even just a few judges being able to see our thoughts and how we can address the issue, it can make not only the ‘solve’ more well known but also the actual issue.”
Art director Serena Maldonado and copywriter Marta Lala’s shortlisted “UoK?” (video) for the World Health Organization also focused on mental health. They created the phone app UoK? to help people when they are at their most vulnerable.
“We developed our campaign around the insight that people are often alone when they go through a manic episode and are left with just their phone to turn to,” Maldonado said.
When a user engages with unusual phone behavior associated with mental health crises, such as sudden increases in online shopping, faster typing, web searches specific to depressive thoughts and ignored messages and calls, the app would trigger a simple notification asking if the user is ok. If the user selects “I am not ok,” the app would open a screen detailing the user’s unusual behavior and connect them with important tools such as a chatbot to express their feelings,  mindfulness exercises and call buttons for mental health professionals and crisis hotlines.
The team turned to feedback from their target audience and market space research to figure out what was lacking or simply not working in other mental health apps.
“We were designing an app to help users with mental illness, knowing well that an improperly designed app could have adverse effects,” Maldonado said. “We had to think about UI/UX design, which is something we hadn’t worked on previously, while trying to provide a virtual safe space as a resource to our target audience.”
Maldonado said their creative advertising professors made themselves available to give feedback on their campaign. The professors asked tough questions and constantly pushed the team to go further with their campaign.
“The Newhouse portfolio classes helped me to understand what good creative looks like. It taught me that in order to come up with a good idea you need to look at the problem from every angle before moving forward with any kind of execution or layout,” she said.
“CashCan” (video) for Coca-Cola was shortlisted for its innovation around greener practices. “People are growing more environmentally conscious every day, and any opportunity to make their lives easier, quicker, faster and cheaper while doing so is a golden space to be explored,” copywriter Joseph Cutuli said.
Cutuli and art director Maia Baptista wanted to address the growing number of Coca-Cola cans and bottles piling up in landfills. “CashCan” incentivizes Coca-Cola product users to recycle using accessible, branded, high-tech recycling bins linked to Apple Pay. Consumers toss their empty Coca-Cola product bottles and cans into designated CashCans, which would be conveniently located on street corners. The recycling bin would scan the items’ barcodes and transfer money to the user’s bank account using Apple Pay. Figuring out how to implement contactless payment options into the CashCan proved a major challenge for the team, but they knew it was an important component of their idea.
“People want to feel like they are making a difference in the environment, but people also want to feel like their time is well spent, and they want to get something out of something, one way or the other,” Cutuli said.
Cutuli credits the attention and dedication of his Newhouse professors White and O’Neill and mentors in helping the team craft a shortlisted campaign. “From guidance on the idea, target audience and art direction to final critiques on the script, they were present every step of the way,” he said.
Luo also won a Shortlist award for “Go Wild”, a print campaign for Jeep. “Go Wild” showcased Jeep’s adaptability and adventurous spirit on any terrain. By zooming in on wild animals, zebra stripes and giraffe spots, the animal prints became roads for Jeeps to explore.
A complete list of Communication Arts Advertising Annual 62, Winners and Shortlists can be found below:
Written by Katherine Kiessling G’2, a graduate of the Goldring arts journalism and communications program at the Newhouse School.
Tula Goenka, professor of television, radio and film (TRF) and director of the TRF graduate program, has been named the inaugural Dean’s Leadership Fellow at the Newhouse School. In this role, Goenka will focus on the engagement, inclusivity and support of the…
Syracuse University’s College of Law announced today the Hon. Nazak Nikakhtar L’02, G’02 as its 2022 opening convocation speaker. Currently partner at Wiley Rein LLP, chair of the firm’s national security practice and co-chair of its foreign investment practice (Committee…
Ashley Smith-Purviance’s G’14 interest in researching education systems and policies—and especially their impact on youth of color and Black girls—stems from her study abroad experience while completing an M.S. in higher education at the Syracuse University School of Education. “My…
In a panel discussion last week, faculty experts from the Maxwell School of Citizenship and Public Affairs shared expertise and insight on the recent Supreme Court ruling in Dobbs v. Jackson, which overturns the precedent set by Roe v. Wade…
A new research center at the Maxwell School of Citizenship and Public Affairs will integrate policy, political and computational sciences to support scientists and practitioners in understanding and addressing critical governance challenges. The Center for Policy Design and Governance will serve…
If you need help with your subscription, contact [email protected].

source

Vegan-hating incel arrested after making death threats against the Woodstock Fruit Festival – Daily Mail

By Andrea Cavallier For Dailymail.Com
|

622
View
comments

A vegan-hating New York man was arrested Tuesday morning after he allegedly made a series of death threats against an upstate fruit festival – which included telling an organizer that he would ‘do a f–king Ted Bundy’ to her unless she called off the event.
William Swift, 32, of Brooklyn, appeared in Brooklyn federal court today where he was charged with menacing organizers and attendees of the festival which is described as a ‘vegan health retreat’ and ‘an all-out celebration of health, fruit-based diet and personal growth.’
Swift apparently split from the vegan lifestyle and community, ranting against veganism and fruitarianism on his Instagram page. 
Months before this year’s festival, which is slated to be held at the end of August, the anti-vegan made the threats against the festival’s organizers in emails and audio recordings, federal prosecutors say.
‘The ideal thing would be to go up to Woodstock to shoot up…the Jewish meet up. That would be ideal,’ one disturbing message read, according to court filings. 
Swift is a self-described ‘incel,’ according to a memo filed on Tuesday. Incels are described as men who claim to be ‘involuntary celibate.’ Several have lashed out with violence, usually targeted at women, in incidents across the country.
The Brooklyn man was also previously arrested by the NYPD last month for telling a friend that he fantasized about shooting up Washington Square Park. 
William Swift, 32, ‘a self-described ‘incel’ from Brooklyn, was arrested Tuesday morning after allegedly making a series of death threats against the upstate New York Woodstock Fruit Festival
The messages – which date back to February – included threats of conducting a mass shooting and stabbing people connected to the upcoming festival. 
Swift targeted one of the organizers in an audio recording, telling the unnamed woman that he fantasized about doing a ‘f–king Ted Bundy’ to her unless she shut down the festival.
‘I’m sorry to say this but I can’t stop fantasizing about doing very, very, very bad things to you, I don’t have a plan I just fantasize about doing very, very bad things to you….,’ Swift allegedly said on the recording.
The messages began earlier this year when he warned the unnamed woman in an email to not allow two men associated with the event to attend, according to a federal complaint.
Swift apparently split from the vegan lifestyle and community, ranting against veganism and fruitarianism on his Instagram page
The festival runs from August 21-28 at Camp Walden in Diamond Point, NY
 
The threats escalated throughout the year and Swift said if these unidentified men go to the Woodstock festival, then he would shoot anyone in his way, the documents allege. 
‘Yeah none of them can go to Woodstock, if I see them at Woodstock online I’ll go to Woodstock with a gun and just shoot them or whoever else is in my way…not you, I’ll never shoot you, yet,’ Swift said in one message.
‘I hope they all do come so I get to go up and shoot everyone,’ he said in another.
Swift made clear that he would never shoot the organizer herself at the time, but later made the chilling threats against her in an audio recording. 
William Swift, 32, ‘a self-described ‘incel’ from Brooklyn, was arrested Tuesday morning after allegedly making a series of death threats against the upstate New York Woodstock Fruit Festival
In May, Swift allegedly threatened to kill someone associated with the event if he ever saw them in New York City
The Brooklyn man was arrested by the NYPD last month for telling a friend that he fantasized about shooting up Washington Square Park
In May, Swift allegedly threatened to kill someone associated with the event if he ever saw them in New York City.
‘[H]ey piece of s–t b–ch, I want to make something clear, WFF is over. [JohnDoe-1’s] retreats are over whether you like it or not. [I]f I see you, you will regret coming toNYC, and you will feel my pain,’ he wrote in an email, according to the complaint.
It’s not clear if Swift has a connection to the event or its organizers. 
Last month, the Brooklyn man was arrested by the NYPD for telling a friend that he fantasized about shooting up Washington Square Park.  
After that arrest, the NYPD took Swift to a hospital for a psychological evaluation, and Manhattan prosecutors charged him with falsely reporting an incident, the New York Daily News reported. The charge was not bail eligible. 
Federal prosecutors said Sunday that Swift is a self-described ‘incel,’ involuntarily celibate men who have lashed out with violence, usually targeted at women. 
‘Members of this movement have increasingly been involved in violent activities,’ Assistant U.S. Attorney Gilbert Rein wrote in the memo.
Published by Associated Newspapers Ltd
Part of the Daily Mail, The Mail on Sunday & Metro Media Group

source

Dunwoody considers trail master plan – Reporter Newspapers

Reporter Newspapers & Atlanta Intown
Hyperlocal News and Information for Metro Atlanta
In the wake of some resident frustration over the city’s trail plans, Dunwoody is considering contracting with an outside organization to build out a trail master plan. 
At an Aug. 8 meeting, the city council heard from the PATH Foundation, a group that works to help develop networks of trails throughout the metro Atlanta area. 
PATH Foundation Executive Director Greta deMayo said there were significant gaps in Dunwoody’s trail connectivity. According to the presentation, PATH would focus on connecting city parks through greenways, sidewalks, and paths, and expanding that system into neighborhoods. 
“You’re in the same situation most cities are when they reach out to us,” deMayo said. “You have a parks master plan that was really focused on parks. You have a transportation master plan that was really focused on street right of ways. But that’s not good enough. You really need to do a trail master plan.” 
DeMayo said part of the master plan process would involve educating the public about different types of trails and engaging with the community to understand what they want to see. Over the past few weeks, multiple residents have voiced their concerns over a multi-use path project along Tilly Mill Road. 
The path in question is still in its concept phase, according to the city’s website, and would be a 12-foot-wide shared-use path along Tilly Milly Road from Womack Road to Mt. Vernon Road. Public Works Director Michael Smith presented conceptual designs for the path at a June 13 meeting. At that meeting, Smith said that city staff is recommending moving forward with the east side alternative because of safety and accessibility. According to city documents from that meeting, the estimated number of vehicles entering driveways or roadway crossings is lower on the east side of the road, and there are more residences on the east side of the road that could access the path without crossing a major roadway. 
Since then, multiple residents have spoken in various public meetings against the path, expressing concerns about trees that might be cut down, the cost of the path, and the possibility of putting the path on the east side of the road. According to city documents, the 49 comments that the city received voiced stronger support for putting the trail on the east side.
Karen Rose, speaking on behalf of the Holland Court Homeowners Association at a July 11 council meeting, said she worried that numerous trees would be cut down, removing much-needed shade from the path, and didn’t see the logic in spending more money to put the trail on the east side of the road. According to city documents, the cost of putting the path on the east side of the road would be about 25% more than the west side of the road. 
At the Aug. 8 meeting, residents spoke both against the Tilly Mill path and in favor of paths and connectivity in general. One resident spoke in favor of the Tilly Mill path, but asked that it be put on the west side instead of the east. On the city’s Facebook page, Paige Metzger commented in favor of multi-use trails in general. 
“I am personally thrilled about the trails,” Metzger commented. “I encourage those that are against it to actually walk or bike around the city. Trails will make the city safer and alleviate traffic on the surrounding roads.”
Most of the council members expressed excitement over moving forward with a comprehensive trail plan. Councilmember Rob Price said he wanted to make sure the public input process for the plan was robust, referencing the recent confusion over trail plans. 
“We’ve had citizens coming out every meeting expressing concerns, both for and against trails,” he said. “It’s clear that this is something the public is very interested in.”
DeMayo said there would be in-person and virtual options for residents to give input if the city moved forward with a plan. 
In response to PATH’s focus on greenways, Councilmember John Heneghan said he worried about the number of opportunities for greenway paths in the city. According to deMayo, a greenway is a trail that is separated from traffic and operates within greenspace. 
“Your city doesn’t have a lot of those opportunities,” she said. “We’re going to have to really push our investigation of what’s where to see what you have.” 
Heneghan also said he wanted to learn more about how the path system could work for homeowners who might see trails running in front of their homes. 
“The locations really don’t focus on a greenway-type system,” Heneghan said. “We’re talking about 12 feet of concrete that we’re trying to shoehorn into a 12.5-foot space, leaving maybe a little space for some greenery, but really not much beauty.” 
DeMayo said PATH would want to look for greenway opportunities, but also at other types of trails that run through residential or more urban areas of the city. 
“As you look at other trail types, you start to look at how do we still make it inviting,” she said. “How do we still make it safe? How do we get people to critical destinations where they would want to go?”
DeMayo said a rough estimate for the time it takes to create a master plan would be about 6-8 months. 
In response to questions about how the city will proceed with trail projects if the city moves forward with a Trails Master Plan, spokesperson Jennifer Boettcher said that City Manager Eric Linton plans to meet with staff before deciding how to move forward. She said the city has no timeline for how long that will take. 
The entire presentation and City Council meeting can be viewed on the city’s Facebook page. 
Sammie Purcell is a staff writer for Reporter Newspapers.

source

‹ Previous Next ›