solidot新版网站常见问题，请点击这里查看。

## 信息流

• We study the scheduling of computation tasks across $n$ workers in a large scale distributed learning problem. Computation speeds of the workers are assumed to be heterogeneous and unknown to the master, and redundant computations are assigned to workers in order to tolerate straggling workers. We consider sequential computation and instantaneous communication from each worker to the master, and each computation round, which can model a single iteration of the stochastic gradient descent algorithm, is completed once the master receives $k$ distinct computations from the workers. Our goal is to characterize the average completion time as a function of the computation load, which denotes the portion of the dataset available at each worker. We propose two computation scheduling schemes that specify the computation tasks assigned to each worker, as well as their computation schedule, i.e., the order of execution, and derive the corresponding average completion time in closed-form. We also

收起

• We investigate the connectivity of wireless sensor networks secured by the heterogeneous random pairwise key predistribution scheme. In contrast to the homogeneous scheme proposed by Chan et al., where each node is paired (offline) with $K$ other nodes chosen uniformly at random; herein, each node is classified as class-$1$ with probability $\mu$ or class-$2$ with probability $1-\mu$, for $0<\mu<1$, independently. Then, each class-$1$ (respectively, class-$2$) node is paired (offline) with $K_1$ (respectively, $K_2$) other nodes selected uniformly at random. We consider the particular case when $K_1=1$ and $K_2=K$. The heterogeneous random pairwise scheme induces an inhomogeneous random K-out graph $\mathbb{H} (n;\mu,K_n)$, where $n$ denotes the number of nodes and $K_n$ denotes a scaling of $K$ with respect to the network size $n$. Hence, establishing the connectivity of wireless sensor networks secured by the heterogeneous random pairwise scheme maps to deriving conditions on h

收起

• This paper deals with a homoskedastic errors-in-variables linear regression model and properties of the total least squares (TLS) estimator. We partly revise the consistency results for the TLS estimator previously obtained by the author [18]. We present complete and comprehensive proofs of consistency theorems. A theoretical foundation for construction of the TLS estimator and its relation to the generalized eigenvalue problem is explained. Particularly, the uniqueness of the estimate is proved. The Frobenius norm in the definition of the estimator can be substituted by the spectral norm, or by any other unitarily invariant norm; then the consistency results are still valid.

收起

• In this paper we prove that when the geodesic flow of a compact or non-compact complete manifold without conjugate points is of the Anosov type, then the average along of the sectional curvature in planes tangent to the geodesic is negative away from zero for some uniform time. Moreover, in dimension two, if the manifold has no focal points, then the latter condition is sufficient to obtain that the geodesic flow is of Anosov type.

收起

• We study weak solutions of the two-dimensional (2D) filtered Euler equations whose vorticity is a finite Radon measure and velocity has locally finite kinetic energy, which is called the vortex sheet solution. The 2D filtered Euler equations are considered as a regularized 2D Euler equations with a spatial filtering and these equations have a unique global weak solution for vortex sheet initial data. On the other hand, the 2D Euler equations require a distinguished sign of initial vorticity for the existence of a global solution with vortex sheet initial data and its uniqueness remains an open question. In this paper, we prove that vortex sheet solutions of the 2D filtered Euler equations converge to those of the 2D Euler equations in the limit of the filtering parameter provided that initial vortex sheet has a distinguished sign. We also show that a simple application of our proof yields the convergence of the vortex method that is a point vortex approximation of vortex sheets. We mak

收起

• It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite rank need not have maximal completely decomposable summands, but when they do, this summand is unique up to isomorphism.

收起

• For a map $f:X \to M$ into a manifold $M$, we study the sets of deficient and multiple points of $f$. In case of the set of deficient points, we estimate its dimension. For multiple points, we study its density in $X$, and we also provide examples where its complement is dense.

收起

•   10-23 Ars Technica 3571

Sometimes, design takes a backseat to practicality—but these aren't cheap.

收起

• We determine the Rolle function in Lagrange polynomial approximation using a suitable differential equation. We then propose a device for improving the Lagrange approximation by exploiting our knowledge of the Rolle function.

收起

•   10-23 MIT Technology 2508

Precision medicine has led to incredibly effective treatments for cancer and inherited disease. But not everyone gets treated.

收起

•   10-23 Hacker News 2407

Emil Post: Psychological Fidelity

收起

• We derive limit distributions for certain empirical regularized optimal transport distances between probability distributions supported on a finite metric space and show consistency of the (naive) bootstrap. In particular, we prove that the empirical regularized transport plan itself asymptotically follows a Gaussian law. The theory includes the Boltzmann-Shannon entropy regularization and hence a limit law for the widely applied Sinkhorn divergence. Our approach is based on an application of the implicit function theorem to necessary and sufficient optimality conditions for the regularized transport problem. The asymptotic results are investigated in Monte Carlo simulations. We further discuss computational and statistical applications, e.g. confidence bands for colocalization analysis of protein interaction networks based on regularized optimal transport.

收起

• This paper analyzes different models for evaluating investments in Energy Storage Systems (ESS) in power systems with high penetration of Renewable Energy Sources (RES). First of all, two methodologies proposed in the literature are extended to consider ESS investment: a unit commitment model that uses the System States (SS) method of representing time; and another one that uses a representative periods (RP) method. Besides, this paper proposes two new models that improve the previous ones without a significant increase of computation time. The enhanced models are the System States Reduced Frequency Matrix (SS-RFM) model which addresses short-term energy storage more approximately than the SS method to reduce the number of constraints in the problem, and the Representative Periods with Transition Matrix and Cluster Indices (RP-TM&CI) model which guarantees some continuity between representative periods, e.g. days, and introduces long-term storage into a model originally designed on

收起

• Estimating the number of sources received by an antenna array have been well known and investigated since the starting of array signal processing. Accurate estimation of such parameter is critical in many applications that involve prior knowledge of the number of received signals. Information theo- retic approaches such as Akaikes information criterion (AIC) and minimum description length (MDL) have been used extensively even though they are complex and show bad performance at some stages. In this paper, a new algorithm for estimating the number of sources is presented. This algorithm exploits the estimated eigenvalues of the auto correlation coefficient matrix rather than the auto covariance matrix, which is conventionally used, to estimate the number of sources. We propose to use either of a two simply estimated decision statistics, which are the moving increment and moving standard deviation as metric to estimate the number of sources. Then process a simple calculation of the increm

收起

• Let $G$ be a finite group and let $H_1,H_2<G$ be two subgroups. In this paper, we are concerned with the bipartite graph whose vertices are $G/H_1\cup G/H_2$ and a coset $g_1H_1$ is connected with another coset $g_2H_2$ if and only if $g_1H_1\cap g_2 H_2\neq\varnothing$. The main result of the paper establishes the existence of such graphs with large girth and large spectral gap. Lubotzky, Manning and Wilton use such graphs to construct certain infinite groups of interest in geometric group theory.

收起

• This article gives a precise description of the Fatou sets and Julia sets of matrix-valued polynomials in $\mathcal{M}(2,\mathbb{C})$ in terms of the corresponding polynomials in $\mathbb{C}$. Further, we construct Green functions and B\"{o}ttcher-type functions for these matrix-valued polynomials.

收起

•   10-23 MIT Technology 2401

Anti-aging pioneer Judith Campisi explains how a recent breakthrough could ward off age-related disease.

收起

•   10-23 Hacker News 2379

Focals by North

收起

• A binary interface defect is any interface between two (not necessarily invertible) domain walls. We compute all possible binary interface defects in Kitaev's $\mathbb{Z}/p\mathbb{Z}$ model and all possible fusions between them. Our methods can be applied to any Levin-Wen model. We also give physical interpretations for each of the defects in the $\mathbb{Z}/p\mathbb{Z}$ model. These physical interpretations provide a new graphical calculus which can be used to compute defect fusion.

收起

• We consider a programming language based on the lamplighter group that uses only composition and iteration as control structures. We derive generating functions and counting formulas for this language and special subsets of it, establishing lower and upper bounds on the growth rate of semantically distinct programs. Finally, we show how to sample random programs and analyze the distribution of runtimes induced by such sampling.

收起

•   10-23 MIT Technology 2369

Enough with the useless genes. Here are some that would actually come in handy.

收起

•   10-22 Hacker News 3543

New Theory Explains Why Europe's Original Dogs Vanished

收起

•   10-21 Hacker News 3538

Most Initial Conversations Go Better Than People Think

收起

• We study the large N expansion of a family of matrix models related to topological strings on toric Calabi-Yau threefolds. These matrix models compute spectral observables of underlying operators obtained by quantizing the mirror curves. They have the form of a deformed O(2) matrix model, with a specific non-polynomial potential involving the Faddeev quantum dilogarithm. Their planar limit is studied using a particular conformal mapping depending on two parameters, from which several universal results can be obtained. As expected, the spectral curves controlling the planar limit of the matrix models are the mirror curves themselves, which in our cases have genus 1. Our results encompass all those toric geometries with genus $1$ mirror where an explicit one-cut matrix integral is known: local $P^2$, local $F_0$, local $F_2$, and degenerations of the resolved $C^3/Z_5$, the resolved $C^3/Z_6$ and the resolved $Y^{3,0}$ geometries amongst others.

收起

• We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic one modular representation theory, or a matroidal representation theory---and we draw from all three perspectives. After some general properties and constructions, including a weak tropical analogue of Maschke's theorem, we turn to a study of the regular representation of a finite group and its tropicalization. For abelian groups we find an interesting interplay between elementary number theory and matroid theory---even cyclic groups are surprisingly rich---and we conclude with some possible first steps toward a tropical character theory.

收起

• The main purpose of this paper is to investigate the concept of maximal $L^p$-regularity for perturbed evolution equations in Banach spaces. We mainly consider three classes of perturbations: Miyadera-Voigt perturbations, Desch-Schappacher perturbations, and more general Staffans-Weiss perturbations. We introduce conditions for which the maximal $L^p$-regularity can be preserved under these kind of perturbations. We give examples for a boundary perturbed heat equation in $L^r$-spaces and a perturbed boundary integro-differential equation. We mention that our results mainly extend those in the works: [P. C. Kunstmann and L. Weis, Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 30 (2001), 415-435] and [B.H. Haak, M. Haase, P.C. Kunstmann, Adv. Differential Equations 11 (2006), no. 2, 201-240].

收起

•   10-20 arXiv 2006

Metagories are metrically enriched directed multigraphs with designated loops. Their structure assigns to every directed triangle in the graph a value which may be interpreted as the area of the triangle; alternatively, as the distance of a pair of consecutive arrows to any potential candidate for their composite. These values may live in an arbitrary commutative quantale. Generalizing and extending recent work by Aliouche and Simpson, we give a condition for the existence of an Yoneda-type embedding which, in particular, gives the isometric embeddability of a metagory into a metrically enriched category. The generality of the value quantale allows for applications beyond the classical metric context.

收起

• We establish several inequalities for manifolds with positive scalar curvature and, more generally, for the scalar curvature bounded from below, in the spirit of the classical bound on the distances between conjugates points in surfaces with positive sectional curvature.

收起

• In this thesis, we study the wrapped Fukaya category of the rational homology ball $B_{p,q}$ and the traditional/wrapped microlocal sheaves on its skeleton $L_{p,q}$, called pinwheel. We explicitly calculate both for $q=1$, and show they match in wrapped case.

收起

• In this paper, we present new applications of our general minimax theorems. In particular, one of them concerns the multiplicity of global minima for the integral functional of the Calculus of Variations.

收起

• A recent result by J. \v{S}aroch and J. \v{S}\v{t}ov\'{\i}\v{c}ek asserts that there is a unique abelian model structure on the category of left $R$-modules, for any associative ring $R$ with identity, whose (trivially) cofibrant and (trivially) fibrant objects are given by the classes of Gorenstein flat (resp., flat) and cotorsion (resp., Gorenstein cotorsion) modules. In this paper, we generalise this result to a certain relativisation of Gorenstein flat modules, which we call Gorenstein $\mathcal{B}$-flat modules, where $\mathcal{B}$ is a class of right $R$-modules. Using some of the techniques considered by \v{S}aroch and \v{S}\v{t}ov\'{\i}\v{c}ek, plus some other arguments coming from model theory, we determine some conditions for $\mathcal{B}$ so that the class of Gorenstein $\mathcal{B}$-modules is closed under extensions. This will allow us to show approximation properties concerning these modules, and also to obtain a relative version of the model structure described before. M

收起

• Recovery of multispecies oral biofilms is investigated following treatment by chlorhexidine gluconate (CHX), iodine-potassium iodide (IPI) and Sodium hypochlorite (NaOCl) both experimentally and theoretically. Experimentally, biofilms taken from two donors were exposed to the three antibacterial solutions (irrigants) for 10 minutes, respectively. We observe that (a) live bacterial cell ratios decline for a week after the exposure and the trend reverses beyond a week; after fifteen weeks, live bacterial cell ratios in biofilms fully return to their pretreatment levels; (b) NaOCl is shown as the strongest antibacterial agent for the oral biofilms; (c) multispecies oral biofilms from different donors showed no difference in their susceptibility to all the bacterial solutions. Guided by the experiment, a mathematical model for biofilm dynamics is developed, accounting for multiple bacterial phenotypes, quorum sensing, and growth factor proteins, to describe the nonlinear time evolutionary

收起

• We introduce first the large-cardinal notion of $\Sigma_n$-supercompactness as a higher-level analog of the well-known Magidor's characterization of supercompact cardinals, and show that a cardinal is $C^{(n)}$-extendible if and only if it is $\Sigma_{n+1}$-supercompact. This yields a new characterization of $C^{(n)}$-extendible cardinals which underlines their role as natural milestones in the region of the large-cardinal hierarchy between the first supercompact cardinal and Vop\v{e}nka's Principle ($\rm{VP}$). We then develop a general setting for the preservation of $\Sigma_n$-supercompact cardinals under class forcing iterations. As a result we obtain new proofs of the consistency of the GCH with $C^{(n)}$-extendible cardinals (cf.~\cite{Tsa13}) and the consistency of $\rm{VP}$ with the GCH (cf.~\cite{Broo}). Further, we show that $C^{(n)}$-extendible cardinals are preserved after forcing with standard Easton class forcing iterations for any $\Pi_1$-definable possible behaviour of

收起

• The aim of this paper is to present the global bounds for renormalized solutions to the following quasilinear elliptic problem: \begin{align*} \begin{cases} -\div(A(x,\nabla u)) &= \mu \quad \text{in} \ \ \Omega, \\ u &=0 \quad \text{on} \ \ \partial \Omega, \end{cases} \end{align*} in Lorentz-Morrey spaces, where $\Omega \subset \mathbb{R}^n$ ($n \ge 2$), $\mu$ is a finite Radon measure, $A$ is a monotone Carath\'eodory vector valued function defined on $W^{1,p}_0(\Omega)$ and the $p$-capacity uniform thickness condition is imposed on our domain. There have been research activities on the gradient estimates in Lorentz-Morrey spaces with various hypotheses. For instance, in \cite{55Ph1} Nguyen Cong Phuc proposed the Morrey global bounds of solution to this equation, but for the regular case $2-\frac{1}{n}<p\le n$, in \cite{MP2018}, our first result provides us with the good-$\lambda$ bounds of solution in Lorentz space for $\frac{3n-2}{2n-1}<p \le 2 - \frac{1}{n}$; and in

收起

• In this article we lay out the details of Fukaya's A $\infty$-structure of the Morse com-plexe of a manifold possibily with boundary. We show that this A $\infty$-structure is homotopically independent of the made choices. We emphasize the transversality arguments that some fiber product constructions make valid.

收起

• We obtain an improved version of a recent result concerning the existence of nonnegative nonradial solutions $u\in D^{1,2}(\mathbb{R}^{N})\cap L^{2}(\mathbb{R}^{N},\left| x\right| ^{-\alpha }dx)$ to the equation $-\triangle u+\displaystyle\frac{A}{\left| x\right| ^{\alpha }}u=f\left( u\right) \quad \text{in }\mathbb{R}^{N},\quad N\geq 3,\quad A,\alpha >0,$ where $f$ is a continuous nonlinearity satisfying $f\left( 0\right) =0$.

收起

• The dichromatic number of a digraph $D$, denoted by $\chi_A(D)$, is the minimum $k$ such that $D$ admits a $k$-coloring of its vertex set in such a way that each color class is acyclic. In 1976, Bondy proved that the chromatic number of a digraph $D$ is at most its circumference, the length of a longest cycle. In this paper we will construct three graphs from $D$ whose chromatic numbers will bound $\chi_A(D)$. Moreover, we prove: i) for integers $k\geq 2$, $s\geq 1$ and $r_1, \ldots, r_s$ with $k\geq r_i\geq 0$ and $r_i\neq 1$ for each $i\in[s]$, that if all cycles in $D$ have length $r$ modulo $k$ for some $r\in\{r_1,\ldots,r_s\}$, then $\chi_A(D)\leq 2s+1;$ ii) if $D$ has girth $g$, the length of a shortest cycle, and circumference $c$, then $\chi_A(D)\leq \lceil \frac{c-1}{g-1} \rceil +1$, which improves, substantially, the bound proposed by Bondy; iii) if $D$ has girth $g$ and there are integers $k$ and $p,$ with $k\geq g-1\geq p\geq 1$ such that $D$ contains no cycle of length $r$

收起

• This paper derives non-central asymptotic results for non-linear integral functionals of homogeneous isotropic Gaussian random fields defined on hypersurfaces in $\mathbb{R}^d$. We obtain the rate of convergence for these functionals. The results extend recent findings for solid figures. We apply the obtained results to the case of sojourn measures and demonstrate different limit situations.

收起

• For a noetherian scheme that has an ample family of invertible sheaves, we prove that direct products in the category of quasi-coherent sheaves are not exact unless the scheme is affine. This result can especially be applied to all quasi-projective schemes over commutative noetherian rings. The main tools of the proof are the Gabriel-Popescu embedding and Roos' characterization of Grothendieck categories satisfying Ab6 and Ab4*.

收起

• Non-transversal intersection of the free and fixed boundary is shown to hold and a classification of blow-up solutions is given for obstacle problems generated by fully nonlinear uniformly elliptic operators in two dimensions which appear in the mean-field theory of superconducting vortices.

收起

• Consider an i.i.d. sample from an unknown density function supported on an unknown manifold embedded in a high dimensional Euclidean space. We tackle the problem of learning a distance between points, able to capture both the geometry of the manifold and the underlying density. We prove the convergence of this microscopic distance, as the sample size goes to infinity, to a macroscopic one that we call Fermat distance as it minimizes a path functional, resembling Fermat principle in optics. The proof boils down to the study of geodesics in Euclidean first-passage percolation for nonhomogeneous Poisson point processes.

收起

• In this paper, we propose a nonintrusive filter-based stabilization of reduced order models (ROMs) for uncertainty quantification (UQ) of the time-dependent Navier-Stokes equations in convection-dominated regimes. We propose a novel high-order ROM differential filter and use it in conjunction with an evolve-filter-relax algorithm to attenuate the numerical oscillations of standard ROMs. We also examine how stochastic collocation methods (SCMs) can be combined with the evolve-filter-relax algorithm for efficient UQ of fluid flows. We emphasize that the new stabilized SCM-ROM framework is nonintrusive and can be easily used in conjunction with legacy flow solvers. We test the new framework in the numerical simulation of a two-dimensional flow past a circular cylinder with a random viscosity that yields a random Reynolds number with mean $Re=100$.

收起

• Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well established questions: Distance Geometry Problem is about finding a Euclidean realization of an incomplete set of distances in a Euclidean space, whereas Nonlinear Mapping is a weighted Least Square Scaling (LSS) method. We show how all these methods (LSS, NLM, DGP) can be assembled in a common framework, being each identified as an instance of an optimization problem with a choice of a weight matrix. We study the continuity between the solutions (which are point clouds) when the weight matrix varies, and the compactness of the set of solutions (after centering). We finally study a numerical example, showing that solving the optimization problem is far from being simple and that the numerical solution for a given procedure may be trapped in a local minimum.

收起

• A function $U:\left[ \omega_{1}\right] ^{2}\longrightarrow\omega$ is called $\left( 1,\omega_{1}\right)$\emph{-weakly universal }if for every function $F:\left[ \omega_{1}\right] ^{2}\longrightarrow\omega$ there is an injective function $h:\omega_{1}\longrightarrow\omega_{1}$ and a function $e:\omega \longrightarrow\omega$ such that $F\left( \alpha,\beta\right) =e\left( U\left( h\left( \alpha\right) ,h\left( \beta\right) \right) \right)$ for every $\alpha,\beta\in\omega_{1}$. We will prove that it is consistent that there are no $\left( 1,\omega_{1}\right)$\emph{-}weakly universal functions, this answers a question of Shelah and Stepr\={a}ns. In fact, we will prove that there are no $\left( 1,\omega_{1}\right)$\emph{-}weakly universal functions in the Cohen model and after adding $\omega_{2}$ Sacks reals side-by-side. However, we show that there are $\left( 1,\omega _{1}\right)$\emph{-}weakly universal functions in the Sacks model. In particular, the existence of such graphs is co

收起

• Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special $s$ and graphs with other restrictions we show that $s$-distance-transitivity implies distance-regularity.

收起

• We prove that if the edges of a graph G can be colored blue or red in such a way that every vertex belongs to a monochromatic k-clique of each color, then G has at least 4(k-1) vertices. This confirms a conjecture of Bucic, Lidicky, Long, and Wagner (arXiv:1805.11278[math.CO]) and thereby solves the 2-dimensional case of their problem about partitions of discrete boxes with the k-piercing property. We also characterize the case of equality in our result.

收起

• In this paper, we prove an isoperimetric inequality for lower order eigenvalues of the Dirichlet Laplacian in bounded domains of a Euclidean space which strengthens the well-known Ashbaugh-Beguria inequality about the ratio of the first two Dirichlet eigenvalues of the same domains and supports strongly a conjecture of Ashbaugh-Benguria.

收起

• Comon's conjecture on the equality of the rank and the symmetric rank of a symmetric tensor, and Strassen's conjecture on the additivity of the rank of tensors are two of the most challenging and guiding problems in the area of tensor decomposition. We survey the main known results on these conjectures, and, under suitable bounds on the rank, we prove them, building on classical techniques used in the case of symmetric tensors, for mixed tensors. Finally, we improve the bound for Comon's conjecture given by flattenings by producing new equations for secant varieties of Veronese and Segre varieties.

收起

• In this paper, we develop a new computational approach which is based on minimizing the difference of two convex functionals (DC) to solve a broader class of phase retrieval problems. The approach splits a standard nonlinear least squares minimizing function associated with the phase retrieval problem into the difference of two convex functions and then solves a sequence of convex minimization sub-problems. For each subproblem, the Nesterov's accelerated gradient descent algorithm or the Barzilai-Borwein (BB) algorithm is used. In the setting of sparse phase retrieval, a standard $\ell_1$ norm term is added into the minimization mentioned above. The subproblem is approximated by a proximal gradient method which is solved by the shrinkage-threshold technique directly without iterations. In addition, a modified Attouch-Peypouquet technique is used to accelerate the iterative computation. These lead to more effective algorithms than the Wirtinger flow (WF) algorithm and the Gauss-Newton (

收起

•   10-18 Hacker News 2384

A university IT guy plans to bid in two government airwave auctions

收起

•   10-18 Ars Technica 2307

Google announces a number of Android licensing changes in response to the EC's ruling.

收起

•   10-18 Slashdot 2139

An anonymous reader shares a report: Amazon cracked down on fake reviews two years ago by prohibiting shoppers from getting free products directly from merchants in exchange for writing reviews. It was a major turning point for the world's largest online retailer, which had previously seen "incentivized reviews" as a key way for consumers to discover new products. Amazon changed course because it realized some merchants were using such reviews to game its search algorithm, undermining faith in the customer feedback that helps drive e-commerce. Amazon instead used its "Vine" program, in which Amazon serves as a middleman between prolific Amazon reviewers and vendors eager for exposure. Amazon would still allow freebies in exchange for feedback so long as there was no direct contact between its retail partners and reviewers, theoretically lessening the chance of quid-pro-quo. Amazon would select shoppers eligible for the program, and Amazon vendors would pay a fee and provide free produc

收起

•   10-18 Hacker News 2415

Android Creator’s Startup Essential Products Cuts About 30% of Staff

收起

•   10-18 Slashdot 2033

An anonymous reader quotes a report from Bloomberg: Apple on Wednesday began allowing users in the U.S. to download a copy of all of the data that they have stored with the company from a single online portal. U.S. users will be able to download data such as all of their address book contacts, calendar appointments, music streaming preferences and details about past Apple product repairs. Previously, customers could get their data by contacting Apple directly. In May, when Apple first launched the online privacy portal, it only allowed U.S. users to either correct their data or delete their Apple accounts.

收起

•   10-18 Hacker News 1929

Are Black Holes Actually Dark Energy Stars?

收起

• The future of technology will be brought to you by the number five, say speakers at ARM TechCon

收起

•   10-18 Ars Technica 2372

Part two of a chat with Sam Harris takes us on an MDMA-fueled journey to enlightenment.

收起

•   10-18 Hacker News 2415

收起

• OpenSourceAllTheWay writes: There are many fantastic open-source tools out there for everything from scanning documents to making interactive music to creating 3D assets for games. Many of these tools have an Achilles heel though -- while the code quality is great and the tool is fully functional, the user interface (UI) and user experience (UX) are typically significantly inferior to what you get in competing commercial tools. In an nutshell, with open source, the code is great, the tool is free, there is no DRM/activation/telemetry bullshit involved in using the tool, but you very often get a weak UI/UX with the tool that -- unfortunately -- ultimately makes the tool far less of a joy to use daily than should be the case. A prime example would be the FOSS 3D tool Blender, which is great technically, but ultimately flops on its face because of a poorly designed UI that is a decade behind commercial 3D software. So here is the question: should open-source developer teams for larger FOS

收起

•   10-18 MIT Technology 2438

This paper is the first step in the project of categorifying the bialgebra structure on the half of quantum group $U_{q}(\mathfrak{g})$ by using geometry and Hall algebras. We equip the category of D-modules on the moduli stack of objects of the category $Rep_{\mathbb{C}}(Q)$ of representations of a quiver with the structure of an algebra object in the category of stable $\infty$-categories. The data for this construction is provided by an extension of the Waldhausen construction for the category $Rep_{\mathbb{C}}(Q)$. We discuss the connection to the Khovanov-Lauda-Rouquier categorification of half of the quantum group $U_{q}(\mathfrak{g})$ associated to the quiver $Q$ and outline our approach to the categorification of the bialgebra structure.

收起

•   10-18 Hacker News 2342

Building a Cross-Browser, Cross-Platform, Real-Time Game Streaming Protocol

收起

•   10-18 Hacker News 2245

Building a Titan: Better security through a tiny chip

收起

•   10-18 Hacker News 2374

Cambly (YC W14) is hiring engineers who are passionate about language education

收起

•   10-18 Hacker News 2346

CodeStream Master Plan: addressing the messaging gap for developers with markers

收起

•   10-18 Hacker News 2329

Dandelion Seeds Fly Using ‘Impossible’ Method Never Before Seen in Nature

收起

•   10-18 MIT Technology 2273

As climate dangers rise, researchers are testing new ways of communicating clearly about uncertainty.

收起

•   10-18 Slashdot 2548

Millions of dollars in funding and billions of dollars in valuations have made scooters the next big thing since the last big thing. From a report: When Michael Ramsey, an analyst for technology research firm Gartner, started in February to put together his 2018 "hype cycle" report for the future of transportation, he had plenty of topics to choose from: electric vehicles, flying cars, 5G, blockchain, and, of course, autonomous vehicles. But one type of transportation is conspicuously absent from the results of the report: electric scooters. "At the time, outside of California, these scooters were really not that common," Ramsey said. "That's how much has happened." As for autonomous vehicles, which have enjoyed years of hype as the next big thing, Ramsey labeled them sliding into "the trough of disillusionment," which Ramsey described as "when expectations don't meet the truth." In a matter of months, electric scooter startups have gone from tech oddity to global phenomenon. In some c

收起

• Essential Products, a startup founded in 2015 by Android creator Andy Rubin, was started to create a smartphone with high-end design features that wasn't associated with a particular operating-system maker. Unfortunately, reaching that goal has been harder than anticipated as the company has laid off about 30 percent of its staff. Fortune reports: Cuts were particularly deep in hardware and marketing. The company's website indicates it has about 120 employees. A company spokesperson didn't confirm the extent of layoffs, but said that the decision was difficult for the firm to make and, "We are confident that our sharpened product focus will help us deliver a truly game changing consumer product." The firm was Rubin's first startup after leaving Google in 2014, which had acquired his co-founded firm, Android, in 2005. Essential's first phone came out in August 2017, a few weeks later than initially promised. It received mixed reviews, with most critics citing its lower quality and missi

收起

收起

•   10-18 Slashdot 2042

People's Facebook posts might predict whether they are suffering from depression, researchers reported this week. From a report: The researchers found that the words people used seemed to indicate whether they would later be diagnosed with depression. The findings offer a way to flag people who may be in need of help, but they also raise important questions about people's health privacy, the team reported in the Proceedings of the National Academy of Sciences. People who were later clinically diagnosed with depression used more "I" language, according to Johannes Eichstaedt of the University of Pennsylvania and his colleagues. They also used more words reflecting loneliness, sadness and hostility. "We observed that users who ultimately had a diagnosis of depression used more first-person singular pronouns, suggesting a preoccupation with the self," they wrote. That is an indicator of depression in some people. The team recruited 683 people who visited an emergency room for their study

收起

• Three state treasurers and a top official from New York have joined a shareholders' motion to install an independent chairman at Facebook, claiming the move would improve governance and accountability. [...] The move comes as Facebook was presented with a new legal challenge. The technology company has been accused of misleading advertisers by inflating the viewing figures for videos on its site. A group of US advertisers launched a fraud claim against the social media giant on Tuesday, stating that it had overstated the average viewing time of advertising videos on the site by between 100 and 900pc before reporting them in 2016. All tech companies are pretty terrible as far as companies go, but Facebook really seems to be going out of its way to lead the pack. As far as I'm concerned, we shut it down. Would anyone really miss it?

收起

• In the early days of what ultimately became Waymo, Google's self-driving car division (known at the time as "Project Chauffeur"), there were "more than a dozen accidents, at least three of which were serious," according to a new article in The New Yorker . From a report: The magazine profiled Anthony Levandowski, the former Google engineer who was at the center of the Waymo v. Uber trade secrets lawsuit. According to the article, back in 2011, Levandowski also modified the autonomous software to take the prototype Priuses on "otherwise forbidden routes." Citing an anonymous source, The New Yorker reports that Levandowski sat behind the wheel as the safety driver, along with Isaac Taylor, a Google executive. But while they were in the car, the Prius "accidentally boxed in another vehicle," a Camry. As The New Yorker wrote: "A human driver could easily have handled the situation by slowing down and letting the Camry merge into traffic, but Google's software wasn't prepared for this scena

收起

•   10-18 Slashdot 2027

An anonymous reader shares a report: Sellers have been modifying lower end NVIDIA graphics cards and selling them more powerful cards online. In a recent version of the GPU-Z graphics card information utility, TechPowerUp has added the ability to now detect these fake NVIDIA cards. This new feature allows buyers of cards to detect if the card is actually a relabled NVIDIA G84, G86, G92, G94, G96, GT215, GT216, GT218, GF108, GF106, GF114, GF116, GF119, or GK106 GPU by displaying an exclamation point where the NVIDIA logo would normally appear and also prepends the string "[FAKE]" before the card's name.

收起

•   10-18 THE NEW YORKER 2331

Helen Rosner writes about how restaurants like the Spotted Pig have responded to sexual-misconduct scandals by promoting women to leadership roles to clean up the messes men have made.

收起

•   10-18 Hacker News 1939

Good sleep, good learning, good life (2012)

收起

•   10-18 THE NEW YORKER 1941

Daniel Penny writes about the rapper Gucci Mane’s appearance at the Hypefest convention, at the Brooklyn Navy Yard, to promote a collaboration with the Italian denim brand Diesel, called “Hate Couture.”

收起

• In this paper, we prove a new cohomology theory that is an invariant of a planar trivalent graph with a given perfect matching. This bigraded cohomology theory appears to be very powerful: the graded Euler characteristic of the cohomology is a one variable polynomial (called the 2-factor polynomial) that, if nonzero when evaluated at one, implies that the perfect matching is even. This polynomial can be used to construct a polynomial invariant of the graph called the even matching polynomial. We conjecture that the even matching polynomial is positive when evaluated at one for all bridgeless planar trivalent graphs. This conjecture, if true, implies the existence of an even perfect matching for the graph, and thus the trivalent planar graph is 3-edge-colorable. This is equivalent to the four color theorem---a famous conjecture in mathematics that was proven using a computer program in 1970s. While these polynomial invariants may not have enough strength as invariants to prove such a co

收起

• This article provides a decidable criterion for when a subgroup of Out(Fr) generated by two Dehn twists consists entirely of polynomially growing elements, answering an earlier question of the author.

收起

• In this paper, we extend a class of globally convergent evolution strategies to handle general constrained optimization problems. The proposed framework handles relaxable constraints using a merit function approach combined with a specific restoration procedure. The unrelaxable constraints in our framework, when present, are treated either by using the extreme barrier function or through a projection approach. The introduced extension guaranties to the regarded class of evolution strategies global convergence properties for first order stationary constraints. Preliminary numerical experiments are carried out on a set of known test problems as well as on a multidisciplinary design optimization problem

收起

• In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove in a simple way an asymptotic relation between the class of Sparse-paving matroids and the whole class of matroids. Additionally we introduce a matrix based method which render an explicit partition of the $r$-subsets of $S$, $\binom{S}{r}=\sqcup_{i=1}^{\gamma }\mathcal{U}_{i}$ such that each $\mathcal{U}_{i}$ defines a sparse-paving matroid of rank $r$.

收起