Research Highlights: Mechanical clot removal alone may be as effective as combining it with intravenous (IV) clot-busting medications for stroke patients.    Mechanical clot removal alone reduced the risk of brain bleeding in this Japanese...

DALLAS, April 29, 2020 — As the shortage of many goods, resources and services grows during the ongoing COVID-19 pandemic, the American Heart Association, the leading nonprofit organization focused on a world of healthier lives for all, has launched ...

At 3.7 Designs we have an array of strategies we use to solve business problems. For example, when it comes to redesigning a website we might recommend recommend a completely custom design that starts with a design discovery engagement. Typically this process can take three to six months with ample time upfront to research the […]

The post Astra Pro with Gutenberg Review – Practical Application appeared first on Psychology of Web Design | 3.7 Blog.

In early 2014 I had just gotten married and recently moved into a new home. With two major life events out of the way, I decided I was ready to lead a WordCamp. I originally planned to organize WordCamp Detroit. I was an organizer twice before and the event had missed a year and I […]

The post 5 Critical Lessons Learned Organizing WordCamp Ann Arbor for the Third Time appeared first on Psychology of Web Design | 3.7 Blog.

Traumatic brain injury (TBI) can have lifelong and dynamic effects on health and wellbeing. Research on the longterm consequences emphasises that, for many patients, TBI should be conceptualised as a chronic health condition. Evidence suggests that functional outcomes after TBI can show improvement or deterioration up to two decades after injury, and rates of all-cause mortality remain elevated for many years. Furthermore, TBI represents a risk factor for a variety of neurological illnesses, including epilepsy, stroke, and neurodegenerative disease. With respect to neurodegeneration after TBI, post-mortem studies on the long-term neuropathology after injury have identified complex persisting and evolving abnormalities best described as polypathology, which includes chronic traumatic encephalopathy. Despite growing awareness of the lifelong consequences of TBI, substantial gaps in research exist. Improvements are therefore needed in understanding chronic pathologies and their implications for survivors of TBI, which could inform long-term health management in this sizeable patient population.

Building a website for your medical practice doesn’t have to be as complicated as you think. You can still get great results by using a website template without using a lot of time or money. WordPress offers a wide selection of themes for medical blogs and websites. Check out the 5 best medical wordpress theme for you business below. Clinico Clinco is a great medical wordpress theme for a variety of reasons. It has a very clean look with simple features that make the layout perfect for medical professionals. The Clinico theme is responsive and has graphics that are “retina

The post The 5 Best Medical WordPress Theme for Your Business appeared first on Photoshop Lady.

I would be honored to serve this great county as your next Linn County Auditor. This role serves as the commission of elections and has oversight of all accounting functions, payroll, and oversight of property tax and real estate services. The position naturally requires someone of high integrity and strong work ethic, and it also requires strong leadership and someone willing to be a collaborative partner with the many Linn County residents, vendors, communities and staff who interface with the office.

I spent almost 14 years serving as Linn County Supervisor. I remain committed to helping Linn County be the most collaborative service provider possible. This takes a strong leader with a solid sense of what partnership and customer service mean to the many audiences Linn County serves.

My leadership and collaboration skills were demonstrated as we worked with many local, state and federal government partners to help Linn County successfully manage the devastation of the 2008 Flood, and the national recession that followed. During my tenure at the National Association of Counties, I trained counties and communities throughout the U.S. in post-disaster management. Our success in Linn County happened with collaborative efforts among many people and organizations. I took our “lessons learned” and shared what leadership and collaboration really look like when faced with a crisis.

While working for the National Association of Counties, I worked with the Cybersecurity Advisory Council of the Department of Homeland Security to advise on county-level election issues. Cybersecurity and elections security will be critical issues for all future elections. Engaging voters, helping to restore felons voting rights and making elections easier and more accessible are also key goals I have.

When I considered running for Auditor, Joel Miller had announced he wouldn’t be running again. Then he changed his mind. Two years ago, Mr. Miller changed his party affiliation to run against Supervisor Ben Rogers. Then he changed back to Democrat again, although the Linn County Web page still lists him as no-party. This does not represent the leadership Linn County’s partners need at any time, but especially not now.

These are unique times and there are many challenges ahead. I would be honored to bring my leadership and collaboration to serve Linn County. I ask for your vote in the June 2 primary for Linn County Auditor. Please request your absentee ballot, vote your ballot, and protect yourselves and our poll workers.

Linda Langston is a candidate in the Democratic primary for Linn County autidor.

I was happy to read Joe Coffey’s article in Sunday’s paper (“The birth of news in Linn County”) about the history of newspapers in Linn County. But I was disappointed that Mr. Coffey did not include mention of the Metro Libraries’ historical newspaper databases. All of the papers mentioned and pictured in his article (and many more!) are available in scanned, full-text, searchable versions, through the websites of the Cedar Rapids and Marion Public Libraries. There is no charge to browse or search these delightful old editions, and in fact, you don’t even need a library card.

I encourage anyone with an interest in local history, or just with a little time on your hands, to look at some of these old newspapers. It’s a delightful adventure to read about lives in other times.

Jo Pearson

Marion

Like most paddlers I have a tendency to shoot pictures in a horizontal (landscape) format. It is more tricky to shoot in a vertical format from my tippy kayaks, especially, when I have to use a paddle to stabilize my camera.

Getting content to center perfectly within an element and then ensuring it responds properly at different screen sizes is one of the biggest challenges that still face front-end designers. It is not that it is difficult, but because there are several ways to go about it, figuring out which method is best can be confusing. […]

The post CSS Vertical Centering – Everything You Need To Know appeared first on Web Designer Wall.

By Hannah Hickey UWNEWS While winter sea ice in the Arctic is declining so dramatically that ships can now navigate those waters without any icebreaker escort, the scene in the Southern Hemisphere is very different. Sea ice area around Antarctica … Continue reading →

By Jennifer Stitt Aeon In 1957, the world watched in wonder as the Soviet Union launched Sputnik 1, the first artificial satellite, into outer space. Despite Cold War anxieties, The New York Times admitted that space exploration ‘represented a step … Continue reading →

Tags: coronavirus, Feilding Cage, healthcare, policy, Reuters

Big tech companies have been spying on us for years. This knowledge isn’t new information, but what could be surprising is exactly to what extent each company does it. Security Baron categories what data six of the biggest tech companies collect from you in The Data Big Companies Have On You infographic, and these are just the ones they admit to collecting on their own privacy pages!

The seemingly endless stream of Facebook privacy scandals of late—including the latest involving users as young as 13 years old—may have you questioning how much the social network and other tech giants actually know about you.

The folks at Security Baron examined the privacy policies of Facebook, Google, Apple, Twitter, Amazon, and Microsoft and put together a handy infographic showing the types of data each company admits to collecting. For Facebook and others, data is money. But just how much these tech giants actually know about you might be surprising.

As you can see in the infographic below, Facebook is particularly data-hungry, even gathering information about your work, income level, race, religion, political views, and the ads you click in addition to more commonly collected data points such as your phone number, email address, location, and the type of devices you use.

"Facebook is unusually aggressive," Security Baron pointed out. "This data can be exploited by advertisers and (hopefully not nefarious) others."

Twitter, in comparison, is "comparatively hands-off," the site notes. The microblogging service, for instance, doesn't collect your name, gender, or birthday (Facebook, Google, and Microsoft all do), but Twitter does know your phone number, email address, time zone, what videos you watch, and more.

Google and Microsoft, meanwhile, are the other big players when it comes to collecting data.

"With Cortana listening in and Gmail seeing all of your emails, the ubiquitous nature of Google and Microsoft gives them access to an uncomfortably large amount of your information," Security Baron wrote.

Check out the full infographic below to see what Facebook, Google, Apple, Twitter, Amazon, and Microsoft may know about you. For tips on securing your digital privacy, check our story, "Online Data Protection 101: Don't Let Big Tech Get Rich Off Your Info.

This is a fairly simple infographic design using a comparison table. I think the use of the icons is particularly effective showing which of Google’s or Microsoft’s apps are collecting the data.

Although the types of data are identified down the left side, I wish there was a way to identify the more sensitive types of data.

Original article can be found at https://www.pcmag.com/

By Jennifer Stitt Aeon In 1957, the world watched in wonder as the Soviet Union launched Sputnik 1, the first artificial satellite, into outer space. Despite Cold War anxieties, The New York Times admitted that space exploration ‘represented a step … Continue reading →

At 3.7 Designs we have an array of strategies we use to solve business problems. For example, when it comes to redesigning a website we might recommend recommend a completely custom design that starts with a design discovery engagement. Typically this process can take three to six months with ample time upfront to research the […]

The post Astra Pro with Gutenberg Review – Practical Application appeared first on Psychology of Web Design | 3.7 Blog.

In early 2014 I had just gotten married and recently moved into a new home. With two major life events out of the way, I decided I was ready to lead a WordCamp. I originally planned to organize WordCamp Detroit. I was an organizer twice before and the event had missed a year and I […]

The post 5 Critical Lessons Learned Organizing WordCamp Ann Arbor for the Third Time appeared first on Psychology of Web Design | 3.7 Blog.

About six years ago, a colleague I’ll call Tom, because that’s his name, forwarded me a link to the ‘WASD CODE’; a keyboard focused on the needs of programmers, designed with the help of Stack Overflow’s Jeff Atwood. I had no idea at the time that there were people actually dedicating themselves to creating keyboards beyond the stock fare shipping with computers. As I read and re-read the blurb, I was smitten.

Prolific is a crowd-sourcing platform for running studies. In contrast to the widely-used Mechanical Turk, it’s specific to studies, has a much better interface, pricing that’s fair to participants, and useful filters to find the right people for your study. Amazon's Mechanical Turk is used for many empirical studies published in the visualization literature, but […]

A topological dynamical system $(X,f)$ induces two natural systems, one is on the probability measure spaces and other one is on the hyperspace.

We introduce a concept for these two spaces, which is called entropy order, and prove that it coincides with topological entropy of $(X,f)$. We also consider the entropy order of an invariant measure and a variational principle is established.

In this article, we prove that the completeness of the Hamilton flow and essential self-dajointness are equivalent for real principal type operators on the circle. Moreover, we study spectral properties of these operators.

In this paper we collect some open set-theoretic problems that appear in the large-scale topology (called also Asymptology). In particular we ask problems about critical cardinalities of some special (large, indiscrete, inseparated) coarse structures on $omega$, about the interplay between properties of a coarse space and its Higson corona, about some special ultrafilters ($T$-points and cellular $T$-points) related to finitary coarse structures on $omega$, about partitions of coarse spaces into thin pieces, and also about coarse groups having some extremal properties.

Inserting renewable energy in the electric grid in a decentralized manneris a key challenge of the energy transition. However, at local scale, both production and demand display erratic behavior, which makes it delicate to match them. It is the goal of Energy Management Systems (EMS) to achieve such balance at least cost. We present EMSx, a numerical benchmark for testing control algorithms for the management of electric microgrids equipped with a photovoltaic unit and an energy storage system. EMSx is made of three key components: the EMSx dataset, provided by Schneider Electric, contains a diverse pool of realistic microgrids with a rich collection of historical observations and forecasts; the EMSx mathematical framework is an explicit description of the assessment of electric microgrid control techniques and algorithms; the EMSx software EMSx.jl is a package, implemented in the Julia language, which enables to easily implement a microgrid controller and to test it. All components of the benchmark are publicly available, so that other researchers willing to test controllers on EMSx may reproduce experiments easily. Eventually, we showcase the results of standard microgrid control methods, including Model Predictive Control, Open Loop Feedback Control and Stochastic Dynamic Programming.

In this paper, we provide some topological criteria for the Poisson Dixmier-Moeglin equivalence for $A$ in terms of the poset $({ m P. spec A}, subseteq)$ and the symplectic leaf or core stratification on its maximal spectrum. In particular, we prove that the Zariski topology of the Poisson prime spectrum and of each symplectic leaf or core can detect the Poisson Dixmier-Moeglin equivalence for any complex affine Poisson algebra. Moreover, we generalize the weaker version of the Poisson Dixmier-Moeglin equivalence for a complex affine Poisson algebra proved in [J. Bell, S. Launois, O.L. S'anchez, and B. Moosa, Poisson algebras via model theory and differential algebraic geometry, J. Eur. Math. Soc. (JEMS), 19(2017), no. 7, 2019-2049] to the general context of a commutative differential algebra.

In this paper we study the following set[A={p(n)+2^nd mod 1: ngeq 1}subset [0.1],] where $p$ is a polynomial with at least one irrational coefficient on non constant terms, $d$ is any real number and for $ain [0,infty)$, $a mod 1$ is the fractional part of $a$. By a Bernoulli decomposition method, we show that the closure of $A$ must have full Hausdorff dimension.

In this paper we introduce various types of harmonic Finsler manifolds and study the relation between them. We give several characterizations of such spaces in terms of the mean curvature and Laplacian. In addition, we prove that some harmonic Finsler manifolds are of Einstein type and a technique to construct harmonic Finsler manifolds of Rander type is given. Moreover, we provide many examples of non-Riemmanian Finsler harmonic manifolds of constant flag curvature and constant $S$-curvature. Finally, we analyze Busemann functions in a general Finsler setting and in certain kind of Finsler harmonic manifolds, namely asymptotically harmonic Finsler manifolds along with studying some applications. In particular, we show the Busemann function is smooth in asymptotically harmonic Finsler manifolds and the total Busemann function is continuous in $C^{infty}$ topology.

We introduce a notion of c-group, which is a group up to congruence relation and consider the corresponding category. Extensions, actions and crossed modules (c-crossed modules) are defined in this category and the semi-direct product is constructed. We prove that each categorical group gives rise to c-groups and to a c-crossed module, which is a connected, special and strict c-crossed module in the sense defined by us. The results obtained here will be applied in the proof of an equivalence of the categories of categorical groups and connected, special and strict c-crossed modules.

We show that any toric K"ahler cone with smooth compact cross-section admits a family of Calabi-Yau cone metrics with conical singularities along its toric divisors. The family is parametrized by the Reeb cone and the angles are given explicitly in terms of the Reeb vector field. The result is optimal, in the sense that any toric Calabi-Yau cone metric with conical singularities along the toric divisor (and smooth elsewhere) belongs to this family. We also provide examples and interpret our results in terms of Sasaki-Einstein metrics.

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices. A graph $G$ is $k$-vertex-critical if $G$ has chromatic number $k$ but every proper induced subgraph of $G$ has chromatic number less than $k$. The study of $k$-vertex-critical graphs for graph classes is an important topic in algorithmic graph theory because if the number of such graphs that are in a given hereditary graph class is finite, then there is a polynomial-time algorithm to decide if a graph in the class is $(k-1)$-colorable.

In this paper, we initiate a systematic study of the finiteness of $k$-vertex-critical graphs in subclasses of $P_5$-free graphs. Our main result is a complete classification of the finiteness of $k$-vertex-critical graphs in the class of $(P_5,H)$-free graphs for all graphs $H$ on 4 vertices. To obtain the complete dichotomy, we prove the finiteness for four new graphs $H$ using various techniques -- such as Ramsey-type arguments and the dual of Dilworth's Theorem -- that may be of independent interest.

Given spherically symmetric characteristic initial data for the Einstein-scalar field system with a positive cosmological constant, we provide a criterion, in terms of the dimensionless size and dimensionless renormalized mass content of an annular region of the data, for the formation of a future trapped surface. This corresponds to an extension of Christodoulou's classical criterion by the inclusion of the cosmological term.

The characterization of phase dynamics in coupled oscillators offers insights into fundamental phenomena in complex systems. To describe the collective dynamics in the oscillatory system, order parameters are often used but are insufficient for identifying more specific behaviors. We therefore propose a topological approach that constructs quantitative features describing the phase evolution of oscillators. Here, the phase data are mapped into a high-dimensional space at each time point, and topological features describing the shape of the data are subsequently extracted from the mapped points. We extend these features to time-variant topological features by considering the evolution time, which serves as an additional dimension in the topological-feature space. The resulting time-variant features provide crucial insights into the time evolution of phase dynamics. We combine these features with the machine learning kernel method to characterize the multicluster synchronized dynamics at a very early stage of the evolution. Furthermore, we demonstrate the usefulness of our method for qualitatively explaining chimera states, which are states of stably coexisting coherent and incoherent groups in systems of identical phase oscillators. The experimental results show that our method is generally better than those using order parameters, especially if only data on the early-stage dynamics are available.

Let $Nge 2$ and $ hoin(0,1/N^2]$. The homogenous Cantor set $E$ is the self-similar set generated by the iterated function system

[

left{f_i(x)= ho x+frac{i(1- ho)}{N-1}: i=0,1,ldots, N-1 ight}.

]

Let $s=dim_H E$ be the Hausdorff dimension of $E$, and let $mu=mathcal H^s|_E$ be the $s$-dimensional Hausdorff measure restricted to $E$. In this paper we describe, for each $xin E$, the pointwise lower $s$-density $Theta_*^s(mu,x)$ and upper $s$-density $Theta^{*s}(mu, x)$ of $mu$ at $x$. This extends some early results of Feng et al. (2000). Furthermore, we determine two critical values $a_c$ and $b_c$ for the sets

[

E_*(a)=left{xin E: Theta_*^s(mu, x)ge a ight}quad extrm{and}quad E^*(b)=left{xin E: Theta^{*s}(mu, x)le b ight}

] respectively, such that $dim_H E_*(a)>0$ if and only if $a<a_c$, and that $dim_H E^*(b)>0$ if and only if $b>b_c$. We emphasize that both values $a_c$ and $b_c$ are related to the Thue-Morse type sequences, and our strategy to find them relies on ideas from open dynamics and techniques from combinatorics on words.

We study the time-averaged flux in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate functional of the average flux is given by a variational formulation involving paths of the density and flux. We give sufficient conditions under which the large deviations of a given time averaged flux is determined by paths that are constant in time. We then consider a class of models on a discrete ring for which it is possible to show that a better strategy is obtained producing a time-dependent path. This phenomenon, called a dynamical phase transition, is known to occur for some particle systems in the hydrodynamic scaling limit, which is thus extended to the setting of a finite graph.

Given a standard graded polynomial ring over a commutative Noetherian ring $A$, we prove that the cohomological dimension and the height of the ideals defining any of its Veronese subrings are equal. This result is due to Ogus when $A$ is a field of characteristic zero, and follows from a result of Peskine and Szpiro when $A$ is a field of positive characteristic; our result applies, for example, when $A$ is the ring of integers.

In this work we study the dynamical behavior Tonelli Lagrangian systems defined on the tangent bundle of the torus $mathbb{T}^2=mathbb{R}^2 / mathbb{Z}^2$. We prove that the Lagrangian flow restricted to a high energy level $ E_L^{-1}(c)$ (i.e $ c> c_0(L)$) has positive topological entropy if the flow satisfies the Kupka-Smale propriety in $ E_L^{-1}(c)$ (i.e, all closed orbit with energy $c$ are hyperbolic or elliptic and all heteroclinic intersections are transverse on $E_L^{-1}(c)$). The proof requires the use of well-known results in Aubry-Mather's Theory.

The connection between visual input and tactile sensing is critical for object manipulation tasks such as grasping and pushing. In this work, we introduce the challenging task of estimating a set of tactile physical properties from visual information. We aim to build a model that learns the complex mapping between visual information and tactile physical properties. We construct a first of its kind image-tactile dataset with over 400 multiview image sequences and the corresponding tactile properties. A total of fifteen tactile physical properties across categories including friction, compliance, adhesion, texture, and thermal conductance are measured and then estimated by our models. We develop a cross-modal framework comprised of an adversarial objective and a novel visuo-tactile joint classification loss. Additionally, we develop a neural architecture search framework capable of selecting optimal combinations of viewing angles for estimating a given physical property.

This poster summarizes our contributions to Wikimedia's processing pipeline for mathematical formulae. We describe how we have supported the transition from rendering formulae as course-grained PNG images in 2001 to providing modern semantically enriched language-independent MathML formulae in 2020. Additionally, we describe our plans to improve the accessibility and discoverability of mathematical knowledge in Wikimedia projects further.

Deep neural networks have exhibited promising performance in image super-resolution (SR). Most SR models follow a hierarchical architecture that contains both the cell-level design of computational blocks and the network-level design of the positions of upsampling blocks. However, designing SR models heavily relies on human expertise and is very labor-intensive. More critically, these SR models often contain a huge number of parameters and may not meet the requirements of computation resources in real-world applications. To address the above issues, we propose a Hierarchical Neural Architecture Search (HNAS) method to automatically design promising architectures with different requirements of computation cost. To this end, we design a hierarchical SR search space and propose a hierarchical controller for architecture search. Such a hierarchical controller is able to simultaneously find promising cell-level blocks and network-level positions of upsampling layers. Moreover, to design compact architectures with promising performance, we build a joint reward by considering both the performance and computation cost to guide the search process. Extensive experiments on five benchmark datasets demonstrate the superiority of our method over existing methods.

Due to the exponential growth of biomedical literature, event and relation extraction are important tasks in biomedical text mining. Most work only focus on relation extraction, and detect a single entity pair mention on a short span of text, which is not ideal due to long sentences that appear in biomedical contexts. We propose an approach to both relation and event extraction, for simultaneously predicting relationships between all mention pairs in a text. We also perform an empirical study to discuss different network setups for this purpose. The best performing model includes a set of multi-head attentions and convolutions, an adaptation of the transformer architecture, which offers self-attention the ability to strengthen dependencies among related elements, and models the interaction between features extracted by multiple attention heads. Experiment results demonstrate that our approach outperforms the state of the art on a set of benchmark biomedical corpora including BioNLP 2009, 2011, 2013 and BioCreative 2017 shared tasks.

When time-dependent partial differential equations (PDEs) are solved numerically in a domain with curved boundary or on a curved surface, mesh error and geometric approximation error caused by the inaccurate location of vertices and other interior grid points, respectively, could be the main source of the inaccuracy and instability of the numerical solutions of PDEs. The role of these geometric errors in deteriorating the stability and particularly the conservation properties are largely unknown, which seems to necessitate very fine meshes especially to remove geometric approximation error. This paper aims to investigate the effect of geometric approximation error by using a high-order mesh with negligible geometric approximation error, even for high order polynomial of order p. To achieve this goal, the high-order mesh generator from CAD geometry called NekMesh is adapted for surface mesh generation in comparison to traditional meshes with non-negligible geometric approximation error. Two types of numerical tests are considered. Firstly, the accuracy of differential operators is compared for various p on a curved element of the sphere. Secondly, by applying the method of moving frames, four different time-dependent PDEs on the sphere are numerically solved to investigate the impact of geometric approximation error on the accuracy and conservation properties of high-order numerical schemes for PDEs on the sphere.

The Hierarchical Equal Area isoLatitude Pixelation (HEALPix) scheme is used extensively in astrophysics for data collection and analysis on the sphere. The scheme was originally designed for studying the Cosmic Microwave Background (CMB) radiation, which represents the first light to travel during the early stages of the universe's development and gives the strongest evidence for the Big Bang theory to date. Refined analysis of the CMB angular power spectrum can lead to revolutionary developments in understanding the nature of dark matter and dark energy. In this paper, we present a new method for performing spherical harmonic analysis for HEALPix data, which is a central component to computing and analyzing the angular power spectrum of the massive CMB data sets. The method uses a novel combination of a non-uniform fast Fourier transform, the double Fourier sphere method, and Slevinsky's fast spherical harmonic transform (Slevinsky, 2019). For a HEALPix grid with $N$ pixels (points), the computational complexity of the method is $mathcal{O}(Nlog^2 N)$, with an initial set-up cost of $mathcal{O}(N^{3/2}log N)$. This compares favorably with $mathcal{O}(N^{3/2})$ runtime complexity of the current methods available in the HEALPix software when multiple maps need to be analyzed at the same time. Using numerical experiments, we demonstrate that the new method also appears to provide better accuracy over the entire angular power spectrum of synthetic data when compared to the current methods, with a convergence rate at least two times higher.

Restless multi-armed bandits are a class of discrete-time stochastic control problems which involve sequential decision making with a finite set of actions (set of arms). This paper studies a class of constrained restless multi-armed bandits (CRMAB). The constraints are in the form of time varying set of actions (set of available arms). This variation can be either stochastic or semi-deterministic. Given a set of arms, a fixed number of them can be chosen to be played in each decision interval. The play of each arm yields a state dependent reward. The current states of arms are partially observable through binary feedback signals from arms that are played. The current availability of arms is fully observable. The objective is to maximize long term cumulative reward. The uncertainty about future availability of arms along with partial state information makes this objective challenging. Applications for CRMAB abound in the domain of cyber-physical systems. This optimization problem is analyzed using Whittle's index policy. To this end, a constrained restless single-armed bandit is studied. It is shown to admit a threshold-type optimal policy, and is also indexable. An algorithm to compute Whittle's index is presented. Further, upper bounds on the value function are derived in order to estimate the degree of sub-optimality of various solutions. The simulation study compares the performance of Whittle's index, modified Whittle's index and myopic policies.

We develop a supervised machine learning algorithm that is able to learn topological phases for finite condensed matter systems from bulk data in real lattice space. The algorithm employs diagonalization in real space together with any supervised learning algorithm to learn topological phases through an eigenvector ensembling procedure. We combine our algorithm with decision trees and random forests to successfully recover topological phase diagrams of Su-Schrieffer-Heeger (SSH) models from bulk lattice data in real space and show how the Shannon information entropy of ensembles of lattice eigenvectors can be used to retrieve a signal detailing how topological information is distributed in the bulk. The discovery of Shannon information entropy signals associated with topological phase transitions from the analysis of data from several thousand SSH systems illustrates how model explainability in machine learning can advance the research of exotic quantum materials with properties that may power future technological applications such as qubit engineering for quantum computing.

Compromised accounts on social networks are regular user accounts that have been taken over by an entity with malicious intent. Since the adversary exploits the already established trust of a compromised account, it is crucial to detect these accounts to limit the damage they can cause. We propose a novel general framework for discovering compromised accounts by semantic analysis of text messages coming out from an account. Our framework is built on the observation that normal users will use language that is measurably different from the language that an adversary would use when the account is compromised. We use our framework to develop specific algorithms that use the difference of language models of users and adversaries as features in a supervised learning setup. Evaluation results show that the proposed framework is effective for discovering compromised accounts on social networks and a KL-divergence-based language model feature works best.