The Biodiversity Photography Contest has as main objective to promote the theme of biological natural heritage, namely the natural regions, the ecosystems, the habitats and [...]

The post The Biodiversity Photography Contest appeared first on Photocompete.

By David Suzuki with contributions from Senior Editor Ian Hanington David Suzuki Foundation By 2002, drivers in London, England, were spending as much as half their commuting time stalled in traffic, contributing to much of the city centre’s dangerous particulate … Continue reading →

The notoriously independent-minded federal judge who once said he was disgusted by the conduct of Michael Flynn could block the administration's bid to drop criminal charges against the former adviser to President Donald Trump, legal experts said.

“It’s impossible to move forward while staying the same”. That’s what motivated Tyler Babin, a 25 year old up & coming filmmaker, who hustled his way into his dream job only to leave it to pursue the riskier thing, an even bigger bet – on himself. I’ve had literally hundreds of requests over the years to have someone on the show who isn’t Richard Branson or Brene Brown or {fill in the blank star}…ie. host someone who hasn’t “made it big” and is, instead, on the come-up themselves…someone from within our very own community who has been listening for years, connecting dots, gleaning knowledge and is now taking major action on that.  Well THIS is Tyler’s story. If you’ve  followed my pal Gary Vaynerchuk, it’s likely you’ve actually seen some of Tyler’s work. For the last 3-4 years, he’s been a whirlwind tour traveling the world with Gary, shooting photo + video, creative directing projects at Vayner… and it all started right here on this show nearly 8 years ago.  This episode goes full circle, friends. Also – instead of the usual studio conversation, Tyler and I recorded the show while grabbing a burger & margarita just around the corner […]

The post Say Yes, Figure It Out Later. Starting from the Start with Tyler Babin appeared first on Chase Jarvis Photography.

When it was time to think about the cover – the whole design package – for my NEW BOOK, Creative Calling, I knew I wanted it to be something different. After all…see if you follow me here… it’s just wrong to make a book about creativity with just any old trend, cliche book cover.  Instead, the package needed to embody the ideas within. So when we approached this design challenge of a hard bound book – it had to be meaningful, beautiful, AND stand out in a sea of other books on the shelf.  No small task… And consider this:  you know that this isn’t just a nice story about the book cover.  This is a metaphor for any creative challenge.  Like every episode of podcast is full of practical advice….this is the real life story of ups and downs on this process…on how we struggled to overcame the challenge front of us… with costs, design options, time, publisher feedback, and other real-life constraints.  In short of EVERY CREATIVE PROCESS.  I’ve included 2 live-recorded phone calls with the designers on the project, Lou and Vasco, so you get their take on the creation process, challenges, the concepts behind what we set out to […]

The post A [big] new challenge—the story behind the Creative Calling book cover appeared first on Chase Jarvis Photography.

Debbie Millman is one of my dear friends, a powerhouse creative and someone who inspires me every day. When I was developing my online companion class to the Creative Calling book, of course I had to ask Debbie to join me on stage for a conversation around designing our life with intention. Debbie’s insight is pure gold. AND – this is just one of the segments from the class. If you already have my book, you can access the entire class for free. All you need to do is visit www.creativelive.com/creativecalling and sign up there. Enjoy! FOLLOW DEBBIE: instagram | twitter | website Listen to the Podcast Subscribe   This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub for online creative education in photo/video, art/design, music/audio, craft/maker, money/life and the ability to make a living in any of those disciplines. They are high quality, highly curated classes taught by the world’s top experts — Pulitzer, Oscar, Grammy Award winners, New York Times best selling authors and the best entrepreneurs of our times.

The post Design Your Life with Creative Calling + Debbie Millman appeared first on Chase Jarvis Photography.

Recently sat down with my man Jordan Harbinger on his podcast The Jordan Harbinger Show. As a radio personality and a podcaster long before it was cool, Jordan is no stranger to the mic. It was a fun conversation and I hope you enjoy! A few of my fav topics: I share my framework for learning from the masters by deconstructing what they do and applying it My creative slumps and how I dug out How mindset matters and unwinding our self-limiting beliefs and much more … Big shoutout to Jordan for having me on the show … and if you haven’t already, be sure to check out his podcast The Jordan Harbinger Show anywhere you listen to podcasts. Enjoy! FOLLOW JORDAN: instagram| facebook | twitter | website Listen to the Podcast Subscribe   This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub for online creative education in photo/video, art/design, music/audio, craft/maker, money/life and the ability to make a living in any of those disciplines. They are high quality, highly curated classes taught by the world’s top experts — Pulitzer, Oscar, Grammy Award winners, New York Times best selling authors and the best entrepreneurs of our […]

The post Choose Creativity – A Conversation with Jordon Harbinger appeared first on Chase Jarvis Photography.

Guys, great news! Our friends at Freepik has released exclusively for s2o readers 10 Cool & Free Mobile Wallpapers in several awesome styles. They come in AI, EPS and jpg files. The wallpapers are easily resizable for any kind of mobile —or any other project ;)— so you can adapt them in a no time …

10 Cool & Free Mobile Wallpapers 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 »

Oftentimes, the focus on mobile websites isn’t on adding as much information as possible or even as much detail. It’s all about making the mobile viewing experience as simple and enjoyable as the web designer possibly can. People who use their mobile devices for browsing and research do not have as much time or patience …

Little Details That Matter on a Mobile Website 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 »

It has been a month since we launched our first online workshop and, to be honest, we really didn’t know whether people would enjoy them — or if we would enjoy running them. It was an experiment, but one we are so glad we jumped into! I spoke about the experience of taking my workshop online on a recent episode of the Smashing podcast. As a speaker, I had expected it to feel very much like I was presenting into the empty air, with no immediate feedback and expressions to work from.

The web is awash with words. They’re everywhere. On websites, in emails, advertisements, tweets, pop-ups, you name it. More people are publishing more copy than at any point in history. That means a lot of information, and a lot of competition. In recent years a slew of ‘readability’ programs have appeared to help us tidy up the things we write. (Grammarly, Readable, and Yoast are just a handful that come to mind.

Aputure’s been coming pretty thick and fast on the announcements lately, and now they’ve announced their new Light Storm 60D daylight and 60X bi-colour adjustable focusing LED lights. As the name suggests, these are 60 Watt LEDs, and everything is built inside the head, meaning there’s no external control unit to have to deal with. […]

The post Aputure announces new LS-60D daylight and LX-60X bicolour LED lights appeared first on DIY Photography.

St-Donat, Bas-St-Laurent, Québec

Let $mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $mathrm{rex}(n, F)$, that are best possible up to a constant factor, when $F$ is one of $C_4$, $K_{2,t}$, $K_{3,3}$ or $K_{s,t}$ when $t>s!$.

This paper begins the project of defining Arthur packets of all unipotent representations for the $p$-adic exceptional group $G_2$. Here we treat the most interesting case by defining and computing Arthur packets with component group $S_3$. We also show that the distributions attached to these packets are stable, subject to a hypothesis. This is done using a self-contained microlocal analysis of simple equivariant perverse sheaves on the moduli space of homogeneous cubics in two variables. In forthcoming work we will treat the remaining unipotent representations and their endoscopic classification and strengthen our result on stability.

In this note, we unify and extend various concepts in the area of $G$-complete reducibility, where $G$ is a reductive algebraic group. By results of Serre and Bate--Martin--R"{o}hrle, the usual notion of $G$-complete reducibility can be re-framed as a property of an action of a group on the spherical building of the identity component of $G$. We show that other variations of this notion, such as relative complete reducibility and $sigma$-complete reducibility, can also be viewed as special cases of this building-theoretic definition, and hence a number of results from these areas are special cases of more general properties.

Given graphs $T$ and $H$, the generalized Tur'an number ex$(n,T,H)$ is the maximum number of copies of $T$ in an $n$-vertex graph with no copies of $H$. Alon and Shikhelman, using a result of ErdH os, determined the asymptotics of ex$(n,K_3,H)$ when the chromatic number of $H$ is greater than 3 and proved several results when $H$ is bipartite. We consider this problem when $H$ has chromatic number 3. Even this special case for the following relatively simple 3-chromatic graphs appears to be challenging.

The suspension $widehat H$ of a graph $H$ is the graph obtained from $H$ by adding a new vertex adjacent to all vertices of $H$. We give new upper and lower bounds on ex$(n,K_3,widehat{H})$ when $H$ is a path, even cycle, or complete bipartite graph. One of the main tools we use is the triangle removal lemma, but it is unclear if much stronger statements can be proved without using the removal lemma.

Let $k ,=, mathbb{Q}(sqrt[5]{n},zeta_5)$, where $n$ is a positive integer, $5^{th}$ power-free, whose $5-$class group is isomorphic to $mathbb{Z}/5mathbb{Z} imesmathbb{Z}/5mathbb{Z}$. Let $k_0,=,mathbb{Q}(zeta_5)$ be the cyclotomic field containing a primitive $5^{th}$ root of unity $zeta_5$. Let $C_{k,5}^{(sigma)}$ the group of the ambiguous classes under the action of $Gal(k/k_0)$ = $<sigma>$. The aim of this paper is to determine all integers $n$ such that the group of ambiguous classes $C_{k,5}^{(sigma)}$ has rank $1$ or $2$.

In this paper, we develop the theory for classifying all the geometric fibrations of compact, connected, flat $n$-orbifolds, over a 1-orbifold, up to affine equivalence. We apply our classification theory to classify all the geometric fibrations of compact, connected, flat $2$-orbifolds, over a 1-orbifold, up to affine equivalence. This paper is an essential part of our project to give a geometric proof of the classification of all closed flat 4-manifolds.

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.

We study the regularity of exceptional actions of groups by $C^{1,alpha}$ diffeomorphisms on the circle, i.e. ones which admit exceptional minimal sets, and whose elements have first derivatives that are continuous with concave modulus of continuity $alpha$. Let $G$ be a finitely generated group admitting a $C^{1,alpha}$ action $ ho$ with a free orbit on the circle, and such that the logarithms of derivatives of group elements are uniformly bounded at some point of the circle. We prove that if $G$ has spherical growth bounded by $c n^{d-1}$ and if the function $1/alpha^d$ is integrable near zero, then under some mild technical assumptions on $alpha$, there is a sequence of exceptional $C^{1,alpha}$ actions of $G$ which converge to $ ho$ in the $C^1$ topology. As a consequence for a single diffeomorphism, we obtain that if the function $1/alpha$ is integrable near zero, then there exists a $C^{1,alpha}$ exceptional diffeomorphism of the circle. This corollary accounts for all previously known moduli of continuity for derivatives of exceptional diffeomorphisms. We also obtain a partial converse to our main result. For finitely generated free abelian groups, the existence of an exceptional action, together with some natural hypotheses on the derivatives of group elements, puts integrability restrictions on the modulus $alpha$. These results are related to a long-standing question of D. McDuff concerning the length spectrum of exceptional $C^1$ diffeomorphisms of the circle.

This paper is devoted to the study of the singularity phenomenon of timelike extremal hypersurfaces in Minkowski spacetime $mathbb{R}^{1+3}$. We find that there are two explicit lightlike self-similar solutions to a graph representation of timelike extremal hypersurfaces in Minkowski spacetime $mathbb{R}^{1+3}$, the geometry of them are two spheres. The linear mode unstable of those lightlike self-similar solutions for the radially symmetric membranes equation is given. After that, we show those self-similar solutions of the radially symmetric membranes equation are nonlinearly stable inside a strictly proper subset of the backward lightcone. This means that the dynamical behavior of those two spheres is as attractors. Meanwhile, we overcome the double roots case (the theorem of Poincar'{e} can't be used) in solving the difference equation by construction of a Newton's polygon when we carry out the analysis of spectrum for the linear operator.

We study the geometry and topology of exotic Springer fibers for orbits corresponding to one-row bipartitions from an explicit, combinatorial point of view. This includes a detailed analysis of the structure of the irreducible components and their intersections as well as the construction of an explicit affine paving. Moreover, we compute the ring structure of cohomology by constructing a CW-complex homotopy equivalent to the exotic Springer fiber. This homotopy equivalent space admits an action of the type C Weyl group inducing Kato's original exotic Springer representation on cohomology. Our results are described in terms of the diagrammatics of the one-boundary Temperley-Lieb algebra (also known as the blob algebra). This provides a first step in generalizing the geometric versions of Khovanov's arc algebra to the exotic setting.

Tree balance plays an important role in different research areas like theoretical computer science and mathematical phylogenetics. For example, it has long been known that under the Yule model, a pure birth process, imbalanced trees are more likely than balanced ones. Therefore, different methods to measure the balance of trees were introduced. The Sackin index is one of the most frequently used measures for this purpose. In many contexts, statements about the minimal and maximal values of this index have been discussed, but formal proofs have never been provided. Moreover, while the number of trees with maximal Sackin index as well as the number of trees with minimal Sackin index when the number of leaves is a power of 2 are relatively easy to understand, the number of trees with minimal Sackin index for all other numbers of leaves was completely unknown. In this manuscript, we fully characterize trees with minimal and maximal Sackin index and also provide formulas to explicitly calculate the number of such trees.

The article is devoted to the expansion of iterated Stratonovich stochastic integrals of arbitrary multiplicity $k$ $(kinmathbb{N})$ based on the generalized iterated Fourier series. The case of Fourier-Legendre series as well as the case of trigonotemric Fourier series are considered in details. The obtained expansion provides a possibility to represent the iterated Stratonovich stochastic integral in the form of iterated series of products of standard Gaussian random variables. Convergence in the mean of degree $2n$ $(nin mathbb{N})$ of the expansion is proved. Some modifications of the mentioned expansion were derived for the case $k=2$. One of them is based of multiple trigonomentric Fourier series converging almost everywhere in the square $[t, T]^2$. The results of the article can be applied to the numerical solution of Ito stochastic differential equations.

In this paper, we are concerned with the numerical solution of one type integro-differential equation by a probability method based on the fundamental martingale of mixed Gaussian processes. As an application, we will try to simulate the estimation of ruin probability with an unknown parameter driven not by the classical L'evy process but by the mixed fractional Brownian motion.

Let $f colon X o X$ be a surjective endomorphism of a normal projective surface. When $operatorname{deg} f geq 2$, applying an (iteration of) $f$-equivariant minimal model program (EMMP), we determine the geometric structure of $X$. Using this, we extend the second author's result to singular surfaces to the extent that either $X$ has an $f$-invariant non-constant rational function, or $f$ has infinitely many Zariski-dense forward orbits; this result is also extended to Adelic topology (which is finer than Zariski topology).

We address the problem of optimal path planning for a simple nonholonomic vehicle in the presence of obstacles. Most current approaches are either split hierarchically into global path planning and local collision avoidance, or neglect some of the ambient geometry by assuming the car is a point mass. We present a Hamilton-Jacobi formulation of the problem that resolves time-optimal paths and considers the geometry of the vehicle.

We study the bi-commutators $[T_1, [b, T_2]]$ of pointwise multiplication and Calder'on-Zygmund operators, and characterize their $L^{p_1}L^{p_2} o L^{q_1}L^{q_2}$ boundedness for several off-diagonal regimes of the mixed-norm integrability exponents $(p_1,p_2) eq(q_1,q_2)$. The strategy is based on a bi-parameter version of the recent approximate weak factorization method.

A reaction-diffusion model was developed describing the spread of the COVID-19 virus considering the mean daily movement of susceptible, exposed and asymptomatic individuals. The model was calibrated using data on the confirmed infection and death from France as well as their initial spatial distribution. First, the system of partial differential equations is studied, then the basic reproduction number, R0 is derived. Second, numerical simulations, based on a combination of level-set and finite differences, shown the spatial spread of COVID-19 from March 16 to June 16. Finally, scenarios of unlockdown are compared according to variation of distancing, or partially spatial lockdown.

In cite{S 2017}, Suh gave a non-existence theorem for Hopf real hypersurfaces in the complex quadric with parallel normal Jacobi operator. Motivated by this result, in this paper, we introduce some generalized conditions named $mathcal C$-parallel or Reeb parallel normal Jacobi operators. By using such weaker parallelisms of normal Jacobi operator, first we can assert a non-existence theorem of Hopf real hypersurfaces with $mathcal C$-parallel normal Jacobi operator in the complex quadric $Q^{m}$, $m geq 3$. Next, we prove that a Hopf real hypersurface has Reeb parallel normal Jacobi operator if and only if it has an $mathfrak A$-isotropic singular normal vector field.

We define local indices for projective umbilics and godrons (also called cusps of Gauss) on generic smooth surfaces in projective 3-space. By means of these indices, we provide formulas that relate the algebraic numbers of those characteristic points on a surface (and on domains of the surface) with the Euler characteristic of that surface (resp. of those domains). These relations determine the possible coexistences of projective umbilics and godrons on the surface. Our study is based on a "fundamental cubic form" for which we provide a closed simple expression.

Classical studies on aspiration-based dynamics suggest that a dissatisfied individual changes strategy without taking into account the success of others. This promotes defection spreading. The imitation-based dynamics allow individuals to imitate successful strategies without taking into account their own-satisfactions. In this article, we propose to study a dynamic based on aspiration which takes into account imitation of successful strategies for dissatisfied individuals. This helps cooperative members to resist. Individuals compare their success to their desired satisfaction level before making a decision to update their strategies. This mechanism helps individuals with a minimum of self-satisfaction to maintain their strategies. If an individual is dissatisfied, it will learn from others by choosing successful strategies. We derive an exact expression of the fixation probability in well-mixed populations as in structured populations in networks. As a result, we show that selection may favor cooperation more than defection in well-mixed populations as in populations ranged over a regular graph. We show that the best scenario is a graph with small connectivity.

We construct semiglobal singular spacetimes for the Einstein equations coupled to a massless scalar field. Consistent with the heuristic analysis of Belinskii, Khalatnikov, Lifshitz or BKL for this system, there are no oscillations due to the scalar field. (This is much simpler than the oscillatory BKL heuristics for the Einstein vacuum equations.) Prior results are due to Andersson and Rendall in the real analytic case, and Rodnianski and Speck in the smooth near-spatially-flat-FLRW case. Similar to Andersson and Rendall we give asymptotic data at the singularity, which we refer to as final data, but our construction is not limited to real analytic solutions. This paper is a test application of tools (a graded Lie algebra formulation of the Einstein equations and a filtration) intended for the more subtle vacuum case. We use homological algebra tools to construct a formal series solution, then symmetric hyperbolic energy estimates to construct a true solution well-approximated by truncations of the formal one. We conjecture that the image of the map from final data to initial data is an open set of anisotropic initial data.

We study a problem concerning parabolic induction in certain p-adic unitary groups. More precisely, for $E/F$ a quadratic extension of p-adic fields the associated unitary group $G=mathrm{U}(n,n)$ contains a parabolic subgroup $P$ with Levi component $L$ isomorphic to $mathrm{GL}_n(E)$. Let $pi$ be an irreducible supercuspidal representation of $L$ of depth zero. We use Hecke algebra methods to determine when the parabolically induced representation $iota_P^G pi$ is reducible.

A subset of vertices in a graph $G$ is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1 and the subset has maximum cardinality. The dissociation number of $G$, denoted by $psi(G)$, is the cardinality of a maximum dissociation set. A subcubic tree is a tree of maximum degree at most 3. In this paper, we give the lower and upper bounds on the dissociation number in a subcubic tree of order $n$ and show that the number of maximum dissociation sets of a subcubic tree of order $n$ and dissociation number $psi$ is at most $1.466^{4n-5psi+2}$.

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. We consider the system $mathcal L (H)$ of all sets of lengths of $H$ and study when $mathcal L (H)$ contains or is contained in a system $mathcal L (H')$ of a Krull monoid $H'$ with finite class group $G'$, prime divisors in all classes and Davenport constant $mathsf D (G')=mathsf D (G)$. Among others, we show that if $G$ is either cyclic of order $m ge 7$ or an elementary $2$-group of rank $m-1 ge 6$, and $G'$ is any group which is non-isomorphic to $G$ but with Davenport constant $mathsf D (G')=mathsf D (G)$, then the systems $mathcal L (H)$ and $mathcal L (H')$ are incomparable.

In the present paper by the Fourier transform we show that every linear differential equations of $n$-th order has a solution in $L^1(Bbb{R})$ which is infinitely differentiable in $Bbb{R} setminus {0}$. Moreover the Hyers-Ulam stability of such equations on $L^1(Bbb{R})$ is investigated.

We investigate the evolution in time of the position of a fixed number inthe insertion tableau when the Robinson-Schensted-Knuth algorithm is applied to asequence of random numbers. When the length of the sequence tends to infinity, a typical trajectory after scaling converges uniformly in probability to some deterministiccurve.

We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are list recoverable beyond the Johnson bound. It was previously known that there are Reed-Solomon codes that do not have this property. As an immediate corollary to our main theorem, we obtain better degree bounds on unbalanced expanders that come from Reed-Solomon codes.

Hearing is often believed to be more sensitive than touch. This assertion is based on a comparison of sensitivities to weak stimuli. The respective stimuli, however, are not easily comparable since hearing is gauged using acoustic pressure and touch using skin displacement. We show that under reasonable assumptions the auditory and tactile detection thresholds can be reconciled on a level playing field. The results indicate that the capacity of touch and hearing to detect weak stimuli varies according to the size of a sensed object as well as to the frequency of its oscillations. In particular, touch is found to be more effective than hearing at detecting small and slow objects.

The global health threat from COVID-19 has been controlled in a number of instances by large-scale testing and contact tracing efforts. We created this document to suggest three functionalities on how we might best harness computing technologies to supporting the goals of public health organizations in minimizing morbidity and mortality associated with the spread of COVID-19, while protecting the civil liberties of individuals. In particular, this work advocates for a third-party free approach to assisted mobile contact tracing, because such an approach mitigates the security and privacy risks of requiring a trusted third party. We also explicitly consider the inferential risks involved in any contract tracing system, where any alert to a user could itself give rise to de-anonymizing information.

More generally, we hope to participate in bringing together colleagues in industry, academia, and civil society to discuss and converge on ideas around a critical issue rising with attempts to mitigate the COVID-19 pandemic.

It has recently been shown that word embeddings encode social biases, with a harmful impact on downstream tasks. However, to this point there has been no similar work done in the field of graph embeddings. We present the first study on social bias in knowledge graph embeddings, and propose a new metric suitable for measuring such bias. We conduct experiments on Wikidata and Freebase, and show that, as with word embeddings, harmful social biases related to professions are encoded in the embeddings with respect to gender, religion, ethnicity and nationality. For example, graph embeddings encode the information that men are more likely to be bankers, and women more likely to be homekeepers. As graph embeddings become increasingly utilized, we suggest that it is important the existence of such biases are understood and steps taken to mitigate their impact.

Histopathology is a reflection of the molecular changes and provides prognostic phenotypes representing the disease progression. In this study, we introduced feature scores generated from hematoxylin and eosin histology images based on deep learning (DL) models developed for prostate pathology. We demonstrated that these feature scores were significantly prognostic for time to event endpoints (biochemical recurrence and cancer-specific survival) and had simultaneously molecular biologic associations to relevant genomic alterations and molecular subtypes using already trained DL models that were not previously exposed to the datasets of the current study. Further, we discussed the potential of such feature scores to improve the current tumor grading system and the challenges that are associated with tumor heterogeneity and the development of prognostic models from histology images. Our findings uncover the potential of feature scores from histology images as digital biomarkers in precision medicine and as an expanding utility for digital pathology.

Robots are required to operate autonomously in response to changing situations. Previously, imitation learning using 4ch-bilateral control was demonstrated to be suitable for imitation of object manipulation. However, cooperative work between humans and robots has not yet been verified in these studies. In this study, the task was expanded by cooperative work between a human and a robot. 4ch-bilateral control was used to collect training data for training robot motion. We focused on serving salad as a task in the home. The task was executed with a spoon and a fork fixed to robots. Adjustment of force was indispensable in manipulating indefinitely shaped objects such as salad. Results confirmed the effectiveness of the proposed method as demonstrated by the success of the task.

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.

Within the field of multilinear algebra, inverses and generalized inverses of tensors based on the Einstein product have been investigated over the past few years. In this paper, we explore the singular value decomposition and full-rank decomposition of arbitrary-order tensors using {it reshape} operation. Applying range and null space of tensors along with the reshape operation; we further study the Moore-Penrose inverse of tensors and their cancellation properties via the Einstein product. Then we discuss weighted Moore-Penrose inverses of arbitrary-order tensors using such product. Following a specific algebraic approach, a few characterizations and representations of these inverses are explored. In addition to this, we obtain a few necessary and sufficient conditions for the reverse-order law to hold for weighted Moore-Penrose inverses of arbitrary-order tensors.

We investigate sparse matrix bipartitioning -- a problem where we minimize the communication volume in parallel sparse matrix-vector multiplication. We prove, by reduction from graph bisection, that this problem is $mathcal{NP}$-complete in the case where each side of the bipartitioning must contain a linear fraction of the nonzeros.

We present an improved exact branch-and-bound algorithm which finds the minimum communication volume for a given matrix and maximum allowed imbalance. The algorithm is based on a maximum-flow bound and a packing bound, which extend previous matching and packing bounds.

We implemented the algorithm in a new program called MP (Matrix Partitioner), which solved 839 matrices from the SuiteSparse collection to optimality, each within 24 hours of CPU-time. Furthermore, MP solved the difficult problem of the matrix cage6 in about 3 days. The new program is on average more than ten times faster than the previous program MondriaanOpt.

Benchmark results using the set of 839 optimally solved matrices show that combining the medium-grain/iterative refinement methods of the Mondriaan package with the hypergraph bipartitioner of the PaToH package produces sparse matrix bipartitionings on average within 10% of the optimal solution.