An Iowa judge has ruled unconstitutional a state law that would have blocked Planned Parenthood of the Heartland from receiving federal money to provide sex education programs to Iowa youth. Fifth...

Vice President Mike Pence owes Iowans more than a photo-op when he visits Des Moines today, according to Joe Biden’s campaign. “Iowans are seeing up close the most consequential failure...

After more than a decade in the making, the Tea Party moment has finally arrived.

The movement originated in 2009 as a challenge to runaway taxes, spending and regulation. Organizers sought to restore the constitutional balance of power between the states and the federal government.

Eventually, the Tea Party devolved into a catchall for right-wing populism, and a magnet for xenophobes and culture warriors. In 2016, its early adherents overwhelmingly fell in line with President Donald Trump, choosing protectionism over freedom.

But that original Tea Party spirit — the charge to buck the national government in favor of local control — was on full display recently from two unlikely sources.

Trump decided early on in the coronavirus pandemic that the federal government would not centrally coordinate the purchase and distribution of medical supplies. That might have worked fine, except the Trump administration actively undermined state governments’ efforts. The federal government has outbid state buyers and even seized products from states.

After 3 million masks ordered by the Massachusetts governor were confiscated in New York, Republican Gov. Charlie Baker decided to sidestep the usual procurement process. He sent a New England Patriots’ private airplane to bring supplies back from China.

In Maryland, Republican Gov. Larry Hogan coordinated a large COVID-19 test order from South Korea. The delivery was facilitated by the National Guard and state police, and the tests were put in a secure location with armed security.

“We guarded that cargo from whoever might interfere with us getting that to our folks that needed it,” Hogan said last week in an interview with Washington Post Live.

Hogan and Baker don’t fit the common perception of the Tea Party mold. They both have harshly criticized President Donald Trump and supported the impeachment inquiry. Hogan openly considered challenging Trump for the GOP presidential nomination.

They are among the last vestiges of moderate conservatism in American executive office, and yet they are the ones waging a battle over federalism and states’ rights.

The political minds built for this moment — the ones who have long fantasized about escalating the state-federal power struggle — are not up to the task. The conservative firebrands who should be taking up this fight instead are beholden to Trump and whatever cockamamie plans he comes up with.

At a news conference last month, Trump made a striking claim about his powers in managing the public health crisis: “When somebody is the president of the United States, the authority is total. And that’s the way it’s got to be. It’s total.”

That should have been a flashpoint for conservatives, the beginning of a revitalized Tea Party that recognizes the enormous threat Trumpism poses to our values.

But it wasn’t. Loyalists brushed it off, again, as Trump misspeaking.

The small-government philosophy is founded on the likelihood that the levers of government power will eventually be grabbed by some menace, an incompetent or malicious figure. But when that menace is your friend, your fundraiser and your public relations manager, it proves hard to slap his hand away.

adam.sullivan@thegazette.com; (319) 339-3156

An Iowa judge has ruled unconstitutional a state law that would have blocked Planned Parenthood of the Heartland from receiving federal money to provide sex education programs to Iowa youth.

Fifth Judicial District Judge Paul Scott on Wednesday ruled the law “has no valid, ‘realistically conceivable’ purpose that serves a legitimate government interest as it is both irrationally overinclusive and under-inclusive.”

“The act violates (Planned Parenthood of the Heartland’s) right to equal protection under the law and is therefore unconstitutional,” Scott ruled in issuing a permanent injunction to prevent the law’s implementation.

House File 766, passed in 2019 by the Republican-controlled Iowa House and Senate, excluded any Iowa organization that “provides or promotes abortion” from receiving federal dollars that support sex education and related services to Iowa youth.

Planned Parenthood of the Heartland and ACLU of Iowa challenged the law, filing a lawsuit shortly after Gov. Kim Reynolds signed the bill into law.

Polk County District Court issued a temporary injunction blocking the law, which was to go into effect July 1, allowing Planned Parenthood to continue providing sex education programming throughout the past year.

The governor’s office did not immediately respond to requests for comment on the ruling.

In its lawsuit, Planned Parenthood and ACLU argued that by blocking the abortion provider from the two federal grants — the Personal Responsibility Education Program (PREP) and the Community Adolescent Pregnancy Prevention (CAPP) — the law violated protections of free speech, due process and equal protection.

“The decision recognizes that the law blocking Planned Parenthood from receiving grants to provide this programming violated the constitutional requirement of equal protection,” ACLU of Iowa Legal Director Rita Bettis Austen said in a statement Thursday.

Though Planned Parenthood would be excluded, the law did allow “nonprofit health care delivery systems” to remain eligible for the federal funding, even if they are contracted with or are affiliated with an entity that performs abortions or maintains a facility where abortions are performed.

By doing so, the law effectively singles out Planned Parenthood, but allows other possible grant recipients to provide an array of abortion-related services, according to the court documents.

“The carved-out exception for the ‘nonprofit health care delivery system’ facilities undermines any rationale the State produces of not wanting to be affiliated with or provide funds to organizations that partake in any abortion-related activity,” Scott ruled. .

In fiscal year 2019, Planned Parenthood received about $265,000 through the federal grants, including $85,000 to offer PREP curriculum in Polk, Pottawattamie and Woodbury counties.

It was awarded $182,000 this year to offer CAPP curriculum in Linn County, as well as in Dallas, Des Moines, Jasper, Lee, Polk, Plymouth and Woodbury counties.

The grants are administered by the Iowa Department of Human Services and the Iowa Department of Public Health.

Planned Parenthood has provided sex education to students in 31 schools and 12 community-based youth organizations in Iowa using state-approved curriculum since 2005, according to a new release.

The focus has remained “on areas with the highest rates of unintended pregnancies and sexually-transmitted infections,” the news release said.

“Today’s decision ensures that teens and young adults across Iowa will continue to have access to medically accurate sex education programs, despite the narrow and reckless policies of anti-abortion lawmakers,” said Erin Davison-Rippey, executive director of Planned Parenthood North Central States.

Comments: (319) 368-8536; michaela.ramm@thegazette.com

Vice President Mike Pence owes Iowans more than a photo-op when he visits Des Moines today, according to Joe Biden’s campaign.

“Iowans are seeing up close the most consequential failure of government in modern American history,” said Kate Bedingfeld, spokeswoman for the former vice president and presumptive Democratic presidential nominee.

“With nearly 300,000 Iowans filing for unemployment, rural hospitals on life support, Latino communities disproportionately suffering and workers on the job without sufficient protection, Mike Pence owes Iowans more than a photo-op — he owes them answers,” she said.

Pence, head of the White House coronavirus task force, is scheduled to meet with Iowa Gov. Kim Reynolds and U.S. Sens. Chuck Grassley and Joni Ernst, all Republicans, as well as with faith, farm and food production leaders.

Pence will talk to faith leaders about how they are using federal and state guidelines to open their houses of worship in a safe and responsible manner.

Later, he will go to Hy-Vee’s headquarters in West Des Moines for a roundtable discussion with agriculture and food supply leaders to discuss steps being taken to ensure the food supply remains secure.

Pence has called Iowa a “success story” in its response to the COVID-19, but Bedingfeld said the Trump administration failed to protect Iowa families from the virus that has claimed the lives of 231 Iowans.

“From devastating losses across the state, at meatpacking plants to rural communities, one thing is clear — it’s Iowans and the American people who are paying the price for the Trump administration’s denials and delays in response to this pandemic,” she said.

“Instead of listening to our own intelligence agencies and public health experts, Donald Trump was fed dangerous propaganda from the Chinese Communist Party — and he bought it,” she said. “Iowans deserve better — they deserve Joe Biden.”

For his part, Grassley said he welcomes the discussion with Pence.

“There’s much work to be done, and the pandemic is disrupting all of our communities,” Grassley said. “It’s important to hear directly from those who help feed the nation and the world.”

Ernst also is looking forward to the discussion of how Iowa is working to protect the health and safety of Iowa’s families and communities while reopening the state’s economy.

“We continue to take an all-hands-on-deck approach to tackling this pandemic,” she said. “Together, we will get through this.”

Comments: (319) 398-8375; james.lynch@thegazette.com

For the second consecutive day the number of Iowa patients hospitalized with COVID-19 has dropped.

The Iowa Department of Public Health reported Saturday that 402 people were hospitalized with the coronavirus, down five from the previous day, and down 15 from its current peak of 417 on Thursday.

Saturday’s totals mark the first time back-to-back COVID-19 hospitalization decreases since figures had begun being tracked.

Nine deaths in Iowa were recorded Saturday, according to the Department of Public Health, bringing the total to 252. But it snapped a streak of four consecutive days in which 10 or more deaths were recorded in Iowa.

Four of the deaths were in Polk County, bringing Polk’s total to 58 — matching Linn County’s as most in the state.

Saturday was the first time since Monday that no deaths in Linn County were reported.

Two deaths were in Jasper County, one each in Johnson, Muscatine and Tama counties.

Four of those who died were 81 years of age and older, three were 61 to 80 and two were aged 41 to 60.

Saturday’s report also showed there now have been a total of 29 outbreaks recorded in long-term care facilities statewide.

Including Saturday’s latest figures from the Department of Public Health — with 214 positive cases, for a total of 11,671 — these are the top 10 Iowa counties in terms of total cases:

• Polk — 2,194

• Woodbury — 1,554

• Black Hawk — 1,477

• Linn — 819

• Marshall — 702

• Dallas — 660

• Johnson — 549

• Muscatine — 471

• Tama — 327

• Louisa — 282.

More than 71,000 Iowans — one of 43 — have been tested, and 16.3 percent of those tested have been positive cases, according to the state.

Forty-six percent of Iowa deaths have been those age 81 and older, while 87 percent are 61 and older. Fifty-one percent have been male.

Beginning this past Friday, Gov. Kim Reynolds permitted more businesses to partially reopen.

“I’m proud to say that Iowans do what they always do and they responded,” she said at her Thursday news conference, her most recent. “So since we’ve kind of really accomplished what we were trying to do, ... now we have shifted our focus from mitigation and resources to managing and containing virus activity as we begin to open Iowa back up.”

Reynolds met with President Donald Trump on Wednesday at the White House to discuss the pandemic and mitigation strategies in the state.

Vice President Mike Pence visited Iowa Friday, when he met with faith leaders and agricultural and food company executives.

Comments: (319) 368-8857; jeff.linder@thegazette.com

Yesterday, Cameron Koczon shared a link to the dingbat font, Pictos, by the talented, Drew Wilson. Cameron predicted that dingbats will soon be everywhere. Symbol fonts, yes, I thought. Dingbats? No, thanks. Jason Santa Maria replied:

@FictiveCameron I hope not, dingbat fonts sort of spit in the face of accessibility and semantics at the moment. We need better options.

Jason rightly pointed out the accessibility and semantic problems with dingbats. By mapping icons to letters or numbers in the character map, they are represented on the page by that icon. That’s what Pictos does. For example, by typing an ‘a’ on your keyboard, and setting Pictos as the font-face for that letter, the Pictos anchor icon is displayed.

Other folks suggested SVG and JS might be better, and other more novel workarounds to hide content from assistive technology like screen readers. All interesting, but either not workable in my view, or just a bit awkward.

Falling down with CSS text-replacement

A CSS solution in an article from Pictos creator, Drew Wilson, relies on the fact that most of his icons are mapped to a character that forms part of the common name for that symbol. The article uses the delete icon as an example which is mapped to ‘d’. Using :before and :after pseudo-elements, Drew suggests you can kind-of wrangle the markup into something sort-of semantic. However, it starts to fall down fast. For example, a check mark (tick) is mapped to ‘3’. There’s nothing semantic about that. Clever replacement techniques just hide the evidence. It’s a hack. There’s nothing wrong with a hack here and there (as box model veterans well know) but the ends have to justify the means. The end of this story is not good as a VoiceOver test by Scott at Filament Group shows. In fairness to Drew Wilson, though, he goes on to say if in doubt, do it the old way, using his font to create a background image and deploy with a negative text-indent.

I agreed with Jason, and mentioned a half-formed idea:

@jasonsantamaria that’s exactly what I was thinking. Proper unicode mapping if possible, perhaps?

The conversation continued, and thanks to Jason, helped me refine the idea into this post.

Jon Hicks flagged a common problem for some Windows users where certain Unicode characters are displayed as ‘missing character’ glyphs depending on what character it is. I think most of the problems with dingbats or missing Unicode characters can be solved with web fonts and Unicode.

Rising with Unicode and web fonts

I’d love to be able to use custom icons via optimised web fonts. I want to do so accessibly and semantically, and have optimised font files. This is how it could be done:

1. Map the icons in the font to the existing Unicode code points for those symbols wherever possible.

   Unicode code points already exist for many common symbols. Fonts could be tiny, fast, stand-alone symbol fonts. Existing typefaces could also be extended to contain symbols that match the style of individual widths, variants, slopes, and weights. Imagine a set of Clarendon or Gotham symbols for a moment. Wouldn’t that be a joy to behold?

   There may be a possibility that private code points could be used if a code-point does not exist for a symbol we need. Type designers, iconographers, and foundries might agree a common set of extended symbols. Alternatively, they could be proposed for inclusion in Unicode.

2. Include the font with font-face.

   This assumes ubiquitous support (as any use of dingbats does) — we’re very nearly there. WOFF is coming to Safari and with a bit more campaigning we may even see WOFF on iPad soon.

3. In HTML, reference the Unicode code points in UTF-8 using numeric character references.

   Unicode characters have corresponding numerical references. Named entities may not be rendered by XML parsers. Sean Coates reminded me that in many Cocoa apps in OS X the character map is accessible via a simple CMD+ALT+t shortcut. Ralf Herrmann mentioned that unicode characters ‘…have “speaking” descriptions (like Leftwards Arrow) and fall back nicely to system fonts.’

Limitations

1. Accessibility: Limited Unicode / entity support in assistive devices.

   My friend and colleague, Jon Gibbins’s old tests in JAWS 7 show some of the inconsistencies. It seems some characters are read out, some ignored completely, and some read as a question mark. Not great, but perhaps Jon will post more about this in the future.

   Elizabeth Pyatt at Penn State university did some dingbat tests in screen readers. For real Unicode symbols, there are pronunciation files that increase the character repertoire of screen readers, like this file for phonetic characters. Symbols would benefit from one.

2. Web fonts: font-face not supported.

   If font-face is not supported on certain devices like mobile phones, falling back to system fonts is problematic. Unicode symbols may not be present in any system fonts. If they are, for many designers, they will almost certainly be stylistically suboptimal. It is possible to detect font-face using the Paul Irish technique. Perhaps there could be a way to swap Unicode for images if font-face is not present.

Now, next, and a caveat

I can’t recommend using dingbats like Pictos, but the icons sure are useful as images. Beautifully crafted icon sets as carefully crafted fonts could be very useful for rapidly creating image icons for different resolution devices like the iPhone 4, and iPad.

Perhaps we could try and formulate a standard set of commonly used icons using the Unicode symbols range as a starting point. I’ve struggled to find a better visual list of the existing symbols than this Unicode symbol chart from Johannes Knabe.

Icons in fonts as Unicode symbols needs further testing in assistive devices and using font-face.

Last, but not least, I feel a bit cheeky making these suggestions. A little knowledge is a dangerous thing. Combine it with a bit of imagination, and it can be lethal. I have a limited knowledge about how fonts are created, and about Unicode. The real work would be done by others with deeper knowledge than I. I’d be fascinated to hear from Unicode, accessibility, or font experts to see if this is possible. I hope so. It feels to me like a much more elegant and sustainable solution for scalable icons than dingbat fonts.

For more on Unicode, read this long, but excellent, article recommended by my colleague, Andrei, the architect of Unicode and internationalization support in PHP 6: The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets.

In 2015 we launched Social Icons Widget by WPZOOM with the intent to provide WordPress users with a simple and easy-to-use widget for adding social links to their websites. With over 100k installs at the moment and continuous positive feedback from the users, it kept us motivated to constantly improve and keep updating this free plugin. Now, to keep the […]

Highlighting some of humanity’s biggest construction achievements is the 10 of the Top Construction Projects in the World informational infographic from 53 Quantum.

Human societies have always looked to build the biggest and best monuments to their ingenuity, resources and craftsmanship. From the Empire State Building, to the Eiffel Tower, and the Great Pyramids of Giza to the Great Wall of China, we’ve always looked to build the biggest and best. Mind blowing historic building projects now litter travel-minded folks bucket lists everywhere, and they make up a huge part of the historic tapestry.

But it’s 2019 now. We need to talk about the Burj Khalifas and Libyan Irrigation projects of the world. For the first time in history, there are societies wealthy, powerful, and most importantly, cohesive enough to build spectacularly huge projects. By working together with our geographical neighbours, we’ve been able to give the world some truly unbelievable, innovative projects. The International Space Station leaps to mind as a collaboration between nations.

With so many stunning projects continually on the go around the planet, we at 53 Quantum thought it’d be an idea to put together a quick infographic of ten of the biggest and best. Of course, there’ll be examples we missed and things we left off, because how do you compare a massive railway restoration and modernisation with a super skyscraper project? Apples and oranges!

Nevertheless, here are ten of the world’s most impressive construction projects.

Although I like the infographic, this design falls short in a few areas.

• Where’s the Data Visualization? The biggest missed opportunity in this design is that the data isn’t visualized. You want readers to understand how big or how expensive these projects were, you need a visualization that puts that into context!

• Nice illustrations, but that isn’t enough. Most of the impact of the size and scale of these projects is lost because it’s buried in the text.

• A map of the locations would be nice.

• Is there any logic to the order of these projects in the infographic? Readers will look through the list from top-to-bottom in order. They’re not sorted by cost or on a timeline.

Thanks to David for submitting the link!

When you want to succeed in the organic search engine results today, you have to focus on your website and learn what you should do to optimize it. There are many factors that can help you with that, form the technical, off-page, and on-page. All these factors and parts of a website require updating and […]

Original post: 10 On-Page SEO Factors You Should Consider [2019]

The post 10 On-Page SEO Factors You Should Consider [2019] appeared first on Daily Blog Tips.

Did you remember how was your life before Freepik and Flaticon. No I can’t remember the dark ages either. To celebrate this golden times, they are giving away once more an incredible package of 210 User Interface Icons in 3 versions: Flat, filled and lineal.  Download This work is licensed under a Creative Commons Attribution 3.0 License …

Cute Collection of 210 User Interface Icons Read More »

Icons packs are among the most desirable freebies around. There are several out there, going from a wide array of topics from user interfaces to personal finance. But sometimes you can find some rather unusual but clever additions to the icons universe. This Vector Audio DJ Pack is a nice example, brought to you exclusively …

Freebie: 264 Vector Audio DJ Pack Icons Read More »

Flat design is everywhere. Nowadays aesthetics is a lot more simple. No more glossy buttons or gradients background, or what a about the shiny table effect every client asked for?.It is all gone now. In favor of a more “undesigned” look a back to basics trend. Following that idea the guys at your favorite resources …

240 Basic Icons Vector Freebie Read More »

This paper addresses the problem of identifying the graph structure of a dynamical network using measured input/output data. This problem is known as topology identification and has received considerable attention in recent literature. Most existing literature focuses on topology identification for networks with node dynamics modeled by single integrators or single-input single-output (SISO) systems. The goal of the current paper is to identify the topology of a more general class of heterogeneous networks, in which the dynamics of the nodes are modeled by general (possibly distinct) linear systems. Our two main contributions are the following. First, we establish conditions for topological identifiability, i.e., conditions under which the network topology can be uniquely reconstructed from measured data. We also specialize our results to homogeneous networks of SISO systems and we will see that such networks have quite particular identifiability properties. Secondly, we develop a topology identification method that reconstructs the network topology from input/output data. The solution of a generalized Sylvester equation will play an important role in our identification scheme.

This work presents a novel data-driven framework for constructing eigenfunctions of the Koopman operator geared toward prediction and control. The method leverages the richness of the spectrum of the Koopman operator away from attractors to construct a rich set of eigenfunctions such that the state (or any other observable quantity of interest) is in the span of these eigenfunctions and hence predictable in a linear fashion. The eigenfunction construction is optimization-based with no dictionary selection required. Once a predictor for the uncontrolled part of the system is obtained in this way, the incorporation of control is done through a multi-step prediction error minimization, carried out by a simple linear least-squares regression. The predictor so obtained is in the form of a linear controlled dynamical system and can be readily applied within the Koopman model predictive control framework of [12] to control nonlinear dynamical systems using linear model predictive control tools. The method is entirely data-driven and based purely on convex optimization, with no reliance on neural networks or other non-convex machine learning tools. The novel eigenfunction construction method is also analyzed theoretically, proving rigorously that the family of eigenfunctions obtained is rich enough to span the space of all continuous functions. In addition, the method is extended to construct generalized eigenfunctions that also give rise Koopman invariant subspaces and hence can be used for linear prediction. Detailed numerical examples with code available online demonstrate the approach, both for prediction and feedback control.

We consider the stochastic 2-dimensional Cahn-Hilliard equation which is driven by the derivative in space of a space-time white noise. We use two different approaches to study this equation. First we prove that there exists a unique solution $Y$ to the shifted equation (see (1.4) below), then $X:=Y+{Z}$ is the unique solution to stochastic Cahn-Hilliard equaiton, where ${Z}$ is the corresponding O-U process. Moreover, we use Dirichlet form approach in cite{Albeverio:1991hk} to construct the probabilistically weak solution the the original equation (1.1) below. By clarifying the precise relation between the solutions obtained by the Dirichlet forms aprroach and $X$, we can also get the restricted Markov uniquness of the generator and the uniqueness of martingale solutions to the equation (1.1).

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.

A perfect matroid design (PMD) is a matroid whose flats of the same rank all have the same size. In this paper we introduce the q-analogue of a PMD and its properties. In order to do that, we first establish new cryptomorphic definitions for q-matroids. We show that q-Steiner systems are examples of q-PMD's and we use this matroid structure to construct subspace designs from q-Steiner systems. We apply this construction to S(2, 13, 3; q) Steiner systems and hence establish the existence of subspace designs with previously unknown parameters.

Recent studies of optimization methods and GNC of spacecraft near small bodies focusing on descent, landing, rendezvous, etc., with key safety constraints such as line-of-sight conic zones and soft landings have shown promising results; this paper considers descent missions to an asteroid surface with a constraint that consists of an onboard camera and asteroid surface markers while using a stochastic convex MPC law. An undermodeled asteroid gravity and spacecraft technology inspired measurement model is established to develop the constraint. Then a computationally light stochastic Linear Quadratic MPC strategy is presented to keep the spacecraft in satisfactory field of view of the surface markers while trajectory tracking, employing chance based constraints and up-to-date estimation uncertainty from navigation. The estimation uncertainty giving rise to the tightened constraints is particularly addressed. Results suggest robust tracking performance across a variety of trajectories.

In this paper, we give new constructions of strongly regular Cayley graphs on abelian groups as generalizations of a series of known constructions: the construction of covering extended building sets in finite fields by Xia (1992), the product construction of Menon-Hadamard difference sets by Turyn (1984), and the construction of Paley type partial difference sets by Polhill (2010). Then, we obtain new large families of strongly regular Cayley graphs of Latin square type or negative Latin square type.

We prove that all non-degenerate relative equilibria of the planar Newtonian $n$--body problem can be continued to spaces of constant curvature $kappa$, positive or negative, for small enough values of this parameter. We also compute the extension of some classical relative equilibria to curved spaces using numerical continuation. In particular, we extend Lagrange's triangle configuration with different masses to both positive and negative curvature spaces.

We propose a new method for realistic human motion transfer using a generative adversarial network (GAN), which generates a motion video of a target character imitating actions of a source character, while maintaining high authenticity of the generated results. We tackle the problem by decoupling and recombining the posture information and appearance information of both the source and target characters. The innovation of our approach lies in the use of the projection of a reconstructed 3D human model as the condition of GAN to better maintain the structural integrity of transfer results in different poses. We further introduce a detail enhancement net to enhance the details of transfer results by exploiting the details in real source frames. Extensive experiments show that our approach yields better results both qualitatively and quantitatively than the state-of-the-art methods.

Uncertain dynamic obstacles, such as pedestrians or vehicles, pose a major challenge for optimal robot navigation with safety guarantees. Previous work on motion planning has followed two main strategies to provide a safe bound on an obstacle's space: a polyhedron, such as a cuboid, or a nonlinear differentiable surface, such as an ellipsoid. The former approach relies on disjunctive programming, which has a relatively high computational cost that grows exponentially with the number of obstacles. The latter approach needs to be linearized locally to find a tractable evaluation of the chance constraints, which dramatically reduces the remaining free space and leads to over-conservative trajectories or even unfeasibility. In this work, we present a hybrid approach that eludes the pitfalls of both strategies while maintaining the original safety guarantees. The key idea consists in obtaining a safe differentiable approximation for the disjunctive chance constraints bounding the obstacles. The resulting nonlinear optimization problem is free of chance constraint linearization and disjunctive programming, and therefore, it can be efficiently solved to meet fast real-time requirements with multiple obstacles. We validate our approach through mathematical proof, simulation and real experiments with an aerial robot using nonlinear model predictive control to avoid pedestrians.

The central importance of large scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.

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 consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of $n$ agents modeled as identical finite-state machines. In each time step, a pair of agents is selected uniformly at random to interact. In an interaction, agents update their states according to a common transition function. We empirically and analytically analyze two classes of simulators for this model.

First, we consider sequential simulators executing one interaction after the other. Key to the performance of these simulators is the data structure storing the agents' states. For our analysis, we consider plain arrays, binary search trees, and a novel Dynamic Alias Table data structure.

Secondly, we consider batch processing to efficiently update the states of multiple independent agents in one step. For many protocols considered in literature, our simulator requires amortized sub-constant time per interaction and is fast in practice: given a fixed time budget, the implementation of our batched simulator is able to simulate population protocols several orders of magnitude larger compared to the sequential competitors, and can carry out $2^{50}$ interactions among the same number of agents in less than 400s.

In this work we propose lifted regression/reconstruction networks (LRRNs), which combine lifted neural networks with a guaranteed Lipschitz continuity property for the output layer. Lifted neural networks explicitly optimize an energy model to infer the unit activations and therefore---in contrast to standard feed-forward neural networks---allow bidirectional feedback between layers. So far lifted neural networks have been modelled around standard feed-forward architectures. We propose to take further advantage of the feedback property by letting the layers simultaneously perform regression and reconstruction. The resulting lifted network architecture allows to control the desired amount of Lipschitz continuity, which is an important feature to obtain adversarially robust regression and classification methods. We analyse and numerically demonstrate applications for unsupervised and supervised learning.

This paper reviews the second challenge on spectral reconstruction from RGB images, i.e., the recovery of whole-scene hyperspectral (HS) information from a 3-channel RGB image. As in the previous challenge, two tracks were provided: (i) a "Clean" track where HS images are estimated from noise-free RGBs, the RGB images are themselves calculated numerically using the ground-truth HS images and supplied spectral sensitivity functions (ii) a "Real World" track, simulating capture by an uncalibrated and unknown camera, where the HS images are recovered from noisy JPEG-compressed RGB images. A new, larger-than-ever, natural hyperspectral image data set is presented, containing a total of 510 HS images. The Clean and Real World tracks had 103 and 78 registered participants respectively, with 14 teams competing in the final testing phase. A description of the proposed methods, alongside their challenge scores and an extensive evaluation of top performing methods is also provided. They gauge the state-of-the-art in spectral reconstruction from an RGB image.

This paper provides a method for the simultaneous topology optimization of parts and their corresponding joint locations in an assembly. Therein, the joint locations are not discrete and predefined, but continuously movable. The underlying coupling equations allow for connecting dissimilar meshes and avoid the need for remeshing when joint locations change. The presented method models the force transfer at a joint location not only by using single spring elements but accounts for the size and type of the joints. When considering riveted or bolted joints, the local part geometry at the joint location consists of holes that are surrounded by material. For spot welds, the joint locations are filled with material and may be smaller than for bolts. The presented method incorporates these material and clearance zones into the simultaneously running topology optimization of the parts. Furthermore, failure of joints may be taken into account at the optimization stage, yielding assemblies connected in a fail-safe manner.

Thin structures, such as wire-frame sculptures, fences, cables, power lines, and tree branches, are common in the real world.

It is extremely challenging to acquire their 3D digital models using traditional image-based or depth-based reconstruction methods because thin structures often lack distinct point features and have severe self-occlusion.

We propose the first approach that simultaneously estimates camera motion and reconstructs the geometry of complex 3D thin structures in high quality from a color video captured by a handheld camera.

Specifically, we present a new curve-based approach to estimate accurate camera poses by establishing correspondences between featureless thin objects in the foreground in consecutive video frames, without requiring visual texture in the background scene to lock on.

Enabled by this effective curve-based camera pose estimation strategy, we develop an iterative optimization method with tailored measures on geometry, topology as well as self-occlusion handling for reconstructing 3D thin structures.

Extensive validations on a variety of thin structures show that our method achieves accurate camera pose estimation and faithful reconstruction of 3D thin structures with complex shape and topology at a level that has not been attained by other existing reconstruction methods.

Learning-based techniques are increasingly effective at controlling complex systems using data-driven models. However, most work done so far has focused on learning individual tasks or control laws. Hence, it is still a largely unaddressed research question how multiple tasks can be learned efficiently and simultaneously on the same system. In particular, no efficient state space exploration schemes have been designed for multi-task control settings. Using this research gap as our main motivation, we present an algorithm that approximates the smallest data set that needs to be collected in order to achieve high control performance for multiple learning-based control laws. We describe system uncertainty using a probabilistic Gaussian process model, which allows us to quantify the impact of potentially collected data on each learning-based controller. We then determine the optimal measurement locations by solving a stochastic optimization problem approximately. We show that, under reasonable assumptions, the approximate solution converges towards that of the exact problem. Additionally, we provide a numerical illustration of the proposed algorithm.

This paper considers a convex optimization problem with cost and constraints that evolve over time. The function to be minimized is strongly convex and possibly non-differentiable, and variables are coupled through linear constraints.In this setting, the paper proposes an online algorithm based on the alternating direction method of multipliers(ADMM), to track the optimal solution trajectory of the time-varying problem; in particular, the proposed algorithm consists of a primal proximal gradient descent step and an appropriately perturbed dual ascent step. The paper derives tracking results, asymptotic bounds, and linear convergence results. The proposed algorithm is then specialized to a multi-area power grid optimization problem, and our numerical results verify the desired properties.

Spiking neural networks (SNNs) are considered as a potential candidate to overcome current challenges such as the high-power consumption encountered by artificial neural networks (ANNs), however there is still a gap between them with respect to the recognition accuracy on practical tasks. A conversion strategy was thus introduced recently to bridge this gap by mapping a trained ANN to an SNN. However, it is still unclear that to what extent this obtained SNN can benefit both the accuracy advantage from ANN and high efficiency from the spike-based paradigm of computation. In this paper, we propose two new conversion methods, namely TerMapping and AugMapping. The TerMapping is a straightforward extension of a typical threshold-balancing method with a double-threshold scheme, while the AugMapping additionally incorporates a new scheme of augmented spike that employs a spike coefficient to carry the number of typical all-or-nothing spikes occurring at a time step. We examine the performance of our methods based on MNIST, Fashion-MNIST and CIFAR10 datasets. The results show that the proposed double-threshold scheme can effectively improve accuracies of the converted SNNs. More importantly, the proposed AugMapping is more advantageous for constructing accurate, fast and efficient deep SNNs as compared to other state-of-the-art approaches. Our study therefore provides new approaches for further integration of advanced techniques in ANNs to improve the performance of SNNs, which could be of great merit to applied developments with spike-based neuromorphic computing.

We propose an augmented Lagrangian preconditioner for a three-field stress-velocity-pressure discretization of stationary non-Newtonian incompressible flow with an implicit constitutive relation of power-law type. The discretization employed makes use of the divergence-free Scott-Vogelius pair for the velocity and pressure. The preconditioner builds on the work [P. E. Farrell, L. Mitchell, and F. Wechsung, SIAM J. Sci. Comput., 41 (2019), pp. A3073-A3096], where a Reynolds-robust preconditioner for the three-dimensional Newtonian system was introduced. The preconditioner employs a specialized multigrid method for the stress-velocity block that involves a divergence-capturing space decomposition and a custom prolongation operator. The solver exhibits excellent robustness with respect to the parameters arising in the constitutive relation, allowing for the simulation of a wide range of materials.

The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory technologies, a set of sequences which generalize sequences in the de Bruijn graph are defined. These sequences can be also defined and viewed as constrained sequences. Hence, they will be called constrained de Bruijn sequences and a set of such sequences will be called a constrained de Bruijn code. Several properties and alternative definitions for such codes are examined and they are analyzed as generalized sequences in the de Bruijn graph (and its generalization) and as constrained sequences. Various enumeration techniques are used to compute the total number of sequences for any given set of parameters. A construction method of such codes from the theory of shift-register sequences is proposed. Finally, we show how these constrained de Bruijn sequences and codes can be applied in constructions of codes for correcting synchronization errors in the $ell$-symbol read channel and in the racetrack memory channel. For this purpose, these codes are superior in their size on previously known codes.

Different state-of-the-art methods of the detection of schizophrenia symptoms based on the estimation of text coherence have been analyzed. The analysis of a text at the level of phrases has been suggested. The method based on the graph of the consistency of phrases has been proposed to evaluate the semantic coherence and the cohesion of a text. The semantic coherence, cohesion, and other linguistic features (lexical diversity, lexical density) have been taken into account to form feature vectors for the training of a model-classifier. The training of the classifier has been performed on the set of English-language interviews. According to the retrieved results, the impact of each feature on the output of the model has been analyzed. The results obtained can indicate that the proposed method based on the graph of the consistency of phrases may be used in the different tasks of the detection of mental illness.

In the Alexa Skills for Node.JS ASK SDK development world, the Alexa Skills Kit (ASK) Command-Line Interface (CLI) is one of the most overlooked tools.

Boosting Developer Productivity

With proper use, one could really increase productivity when developing Alexa Skills. This is especially so if you are creating many Alexa Skills, either because you are in the learning process or you are just managing multiple Alexa Skills projects for yourself or your clients.

At these gatherings in northeast Washington, the jackboot of tyranny is always said to be descending, the hand of the federal government always inches away from stealing your guns, your land, your freedom to speak or to pray.…

We've come a long way since the olden days before legalization, when basically the only product on the market was the flower you got from a dealer.…

A computer-implemented method is provided for statistical data learning under privacy constraints. The method includes: receiving, by a processor, a plurality of pieces of statistical information relating to a statistical object and aggregating, by the processor, the plurality of pieces of statistical information so as to provide an estimation of the statistical object. Each piece of statistical information includes an uncertainty variable, the uncertainty variable being a value determined from a function having a predetermined mean. The number of pieces of statistical information aggregated is proportional to the reliability of the estimation of the statistical object.

In embodiments of the present invention improved capabilities are described for a computer program product embodied in a computer readable medium that, when executing on one or more computers, helps determine an unknown user's preferences through the use of internet based social interactive graphical representations on a computer facility by performing the steps of (1) ascertaining preferences of a plurality of users who are part of an internet based social interactive construct, wherein the plurality of users become a plurality of known users; (2) determining the internet based social interactive graphical representation for the plurality of known users; and (3) inferring the preferences of an unknown user present in the internet based social interactive graphical representation of the plurality of known users based on the interrelationships between the unknown user and the plurality of known users within the graphical representation.

A computer implemented method of constructing formal definitions in intelligent glossaries for interpreting text, comprising the steps of: providing at least one Distinction having a Boundary, an Indication, a Counter-indication and a Frame; modeling each Distinction as a diagram to provide a Distinction Model; verifying each distinction model as being an instantiation of a generic Distinction Pattern; providing at least one Arrangement made of nonintersecting Marks of Distinction containing Indications from the verified Distinction Model; writing at least one Formulation for each Indication appearing in verified Distinction model and Arrangement, providing well-founded Indications; calculating precise Formulations in Natural Language from well-founded Indications by substituting Variables symbols and/or replacing Constants symbols to transform imprecise Formulations into precise Formulations; selecting a Definition type and embedding at least one precise Formulation and Definition type as a formal Definition in an Intelligent Glossary to provide computerized Semantic Systems of Intelligent Glossaries.

A pipe choke for use in drilling and mining operations comprising a body including a first end and a second end configured to couple to a pipe, an opening extending through the body from the first end to the second end, and wherein the body includes a first phase comprising recrystallized silicon carbide and a second phase comprising silicon.

Embodiments of the present disclosure describe device, methods, computer-readable media and system configurations for decoding codewords using a side channel. In various embodiments, a memory controller may be configured to determine that m of n die of non-volatile memory (“NVM”) have failed iterative decoding. In various embodiments, the memory controller may be further configured to generate a side channel from n-m non-failed die and the m failed die other than a first failed die. In various embodiments, the memory controller may be further configured to reconstruct, using iterative decoding, a codeword stored on the first failed die of the m failed die based on the generated side channel and on soft input to an attempt to iteratively decode data stored on the first failed die. In various embodiments, the iterative decoding may include low-density parity-check decoding. Other embodiments may be described and/or claimed.

A sine wave generator for a Direct Digital Synthesizer (DDS) converts a digital phase input into a digital sine wave output. Sine values and slopes are stored in read-only memory (ROM) for coarse upper phase bits in a first quadrant. A quadrant folder and phase splitter reflects and inverts values from the first quadrant to generate amplitudes for all four quadrants. Each sine value and slope is stored for a range of lower phase bits. A Delta bit separates upper and lower phase bits. Delta conditionally inverts the lower phase bits, the sine value, and the final polarity. A reduced AND logic array multiplies the slope by the conditionally inverted lower phase bits. A reconstructed ADD logic array then adds the conditionally inverted sine value. The conditionally inverted polarity is added to generate the final sine value. Sine generation logic is streamlined with conditional inversion based on the Delta bit.

A method for designing a transformer in an integrated circuit includes receiving one or more desired characteristics of the transformer from user input and iteratively determining a design solution for the transformer through one or more simulations and modifications using a rule-set. The method combines the one or more desired characteristics with other preset characteristics of the transformer or the integrated circuit. A first model of the transformer is defined with typical load impedances and simulated having the combined characteristics to determine performance. Results of the simulation are processed to calculate performance with the load impedances specified by the user. The results are further processed to obtain a mathematical model that includes tuning capacitors. The first and subsequent models are modified by drawing on a rule-set of expert knowledge relating to general dependency of at least one design criterion, such as a physical, geometrical or performance characteristic, with another design criterion.

Resist stripping agents useful for fabricating circuits and/or forming electrodes on semiconductor devices for semiconductor integrated circuits and/or liquid crystals with reduced metal and metal alloy etch rates (particularly copper etch rates and TiW etch rates), are provided with methods for their use. The preferred stripping agents contain low concentrations of resorcinol or a resorcinol derivative, with or without an added copper salt, and with or without an added amine to improve solubility of the copper salt. Further provided are integrated circuit devices and electronic interconnect structures prepared according to these methods.

Computer-implemented systems and methods are provided for suggesting emoticons for insertion into text based on an analysis of sentiment in the text. An example method includes: determining a first sentiment of text in a text field; selecting first text from the text field in proximity to a current position of an input cursor in the text field; identifying one or more candidate emoticons wherein each candidate emoticon is associated with a respective score indicating relevance to the first text and the first sentiment based on, at least, historical user selections of emoticons for insertion in proximity to respective second text having a respective second sentiment; providing one or more candidate emoticons having respective highest scores for user selection; and receiving user selection of one or more of the provided emoticons and inserting the selected emoticons into the text field at the current position of the input cursor.

Techniques for sorting and filtering a list in a space-constrained viewing area are described. A filter widget and a list of items are displayed in a view of an electronic display screen. In response to user input selecting the filter widget, and without changing to a different view, a filter category overlay is displayed in the view to provide various selectable filter categories. In response to selection of a filter category, a visual depiction of the selected filter category is displayed in the view. The list of items is filtered according to the selected filter category and displayed in the view without changing to any other view. Subsequently added visual depictions are linearly stacked in the view. Further, a filter modification overlay, which provides selectable filtering attributes, is displayed upon selection of a visual depiction.

A method and apparatus are disclosed of monitoring a number of virtual machines operating in an enterprise network. One example method of operation may include identifying a number of virtual machines currently operating in an enterprise network and determining performance metrics for each of the virtual machines. The method may also include identifying at least one candidate virtual machine from the virtual machines to optimize its active application load and modifying the candidate virtual machine to change its active application load.