Solidot 公告
请在发布文章时用HTML代码加上至少一条新闻来源的链接；原创性消息，可加入相关信息（如涉及公司的网址）的链接。有任何问题，邮件至：he.fang#zhiding.cn
ken：feigaobox@gmail.com
注意：收到邮件乱码的用户请修改客户端的默认字体编码，从"简体中文（GB2312）"修改为"Unicode（UTF8）"。
投 票
信息流

Debian Linux and its family of derivatives (such as Ubuntu) are partly characterized by their use of .deb as the packaging format. Packages in this format are produced not only by the distributions themselves, but also by independent software vendors. The last major change of the format internals happened back in 1995. However, a discussion of possible changes has been brought up recently on the debiandevel mailing list by Adam Borowski.
收起

Finding a way for applications to do atomic writes to files, so that either the old or new data is present after a crash and not a combination of the two, was the topic of a session led by Christoph Hellwig at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM). Application developers hate the fact that when they update files in place, a crash can leave them with old or new data—or sometimes a combination of both. He discussed some implementation ideas that he has for atomic writes for XFS and wanted to see what the other filesystem developers thought about it.
收起

An anonymous reader quotes a report from Ars Technica: YouTube Gaming is more or less shutting down this week. Google launched the standalone YouTube gaming vertical almost four years ago as a response to Amazon's purchase of Twitch, and on May 30, Google will shut down the standalone YouTube Gaming app and the standalone gaming.youtube.com website. The plan to shut down the gaming portal was announced in September, with a report from The Verge saying the site was dying because it simply wasn't popular. YouTube serves more than 50 billion hours of gaming content a year, but people just aren't viewing those hours through the gamingspecific site and apps. "A support page does detail some of the changes users will have to deal with, like the merging of YouTube Gaming and normal YouTube subscriptions," the report adds. "Users will also lose their list of followed games, which isn't supported on YouTube." "Google is directing former YouTube Gaming users to a gaming subpage on YouTube.com
收起

Ted Ts'o led a discussion on storage testing and, in particular, on his experience getting blktests running for his test environment, in a combined storage and filesystem session at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit. He has been adding more testing to his automated test platform, including blktests, and he would like to see more people running storage tests. The idea of his session was to see what could be done to help that cause.
收起

We are developers and designers making apps for the GNOME platform. We take pride in our craft and work hard to make sure our applications are a great experience for people. Unfortunately, all our efforts designing, developing, and testing our apps are made futile by theming in many cases. This is insanity – even if they claim it only applies to distribution makers. Their argument basically comes down to certain themes making certain applications look bad, and that theming removes branding from applications. First, theming making applications look bad is either an issue with the theme that needs to be fixed or an issue with Gtk+/GNOME being bad at theming, and second, your branding is irrelevant on my computer, or on my distribution. I use KDE, and one of the main reasons I do so is to ensure I can make my desktop and its applications look exactly the way I want them to look.
收起

The physical memory in a computer system is a precious resource, so a lot of effort has been put into managing it effectively. This task is made more difficult by the complexity of the memory architecture on contemporary systems. There are several layers of abstraction that deal with the details of how physical memory is laid out; one of those is simply called the "memory model". There are three models supported in the kernel, but one of them is on its way out. As a way of understanding this change, this article will take a closer look at the evolution of the kernel's memory models, their current state, and their possible future.
收起

The stable tree was the topic for a plenary session led by Sasha Levin at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM). One of the main areas that needs attention is testing, according to Levin. He wanted to discuss how to do more and better testing as well as to address any concerns that attendees might have with regard to the stable tree.
收起

WiFi technology has strong potentials in indoor and outdoor sensing applications, it has several important features which makes it an appealing option compared to other sensing technologies. This paper presents a survey on different applications of WiFi based sensing systems such as elderly people monitoring, activity classification, gesture recognition, people counting, through the wall sensing, behind the corner sensing, and many other applications. The challenges and interesting future directions are also highlighted.
收起

An analogy framework between wiretap channels (WTCs) and statedependent pointtopoint channels with noncausal encoder channel state information (referred to as GelfandPinker channels (GPCs)) is proposed. A good sequence of stealthwiretap codes is shown to induce a good sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existing results for GPCs to produce converse proofs for their wiretap analogs. The analogy readily extends to multiuser broadcasting scenarios, encompassing broadcast channels (BCs) with deterministic components, degradation ordering between users, and BCs with cooperative receivers. Given a wiretap BC (WTBC) with two receivers and one eavesdropper, an analogous GelfandPinsker BC (GPBC) is constructed by converting the eavesdropper's observation sequence into a state sequence with an appropriate product distribution (induced by the stealthwiretap code for the WTBC), and noncausally revealing the states to the encoder. The t
收起

More or less anyone using modern PCs has to wonder: why does Windows use backslash as a path separator when the rest of the world uses forward slash? The clear intermediate answer is “because DOS and OS/2 used backslash”. Both Windows 9x and NT were directly or indirectly derived from DOS and OS/2, and certainly inherited much of the DOS cultural landscape. That, of course, is not much of an answer. The obvious next question is, why did DOS use backslash as a path separator? When DOS 2.0 added support for hierarchical directory structure, it was more than a little influenced by UNIX (or perhaps more specifically XENIX), and using the forward slash as a path separator would have been the logical choice. That’s what everyone can agree on. Beyond that, things get a bit muddled. A fascinating bit of sleuthing, and the author comes to an interesting theory. What’s fascinating to me is that I don’t even consciously realise the MSDOS is the odd one out here – I just adapt t
收起

Several new system calls have been proposed for addition to the kernel in a nearfuture release. A few of those, in particular, focus on memorymanagement tasks. Read on for a look at process_vm_mmap() (for zerocopy data transfer between processes), and two new APIs for advising the kernel about memory use in a different process.
收起

In an interesting video interview, Canonical founder Mark Shuttleworth shares his thoughts on desktop Linux. Some of his most prominent statements include: “I think the bigger challenge has been that we haven’t invented anything in the Linux that was like deeply, powerfully ahead of its time” and, “if in the free software community we only allow ourselves to talk about things that look like something that already exists, then we’re sort of defining ourselves as a series of forks and fragmentations.”
收起

The linuxkernel mailing list has recently seen more than the usual amount of traffic proposing new system calls. LWN is endeavoring to catch up with that stream, starting with a couple of proposals for the management of file descriptors. pidfd_open() is a new way to create a "pidfd" file descriptor that refers to a process in the system, while close_range() is an efficient way to close many open descriptors with a single call.
收起

One thing that is known about using transparent huge pages (THPs) for filesystems is that it is a hard problem to solve, but is there a solid first step that could be taken toward that goal? That is the question Song Liu asked to open his combined filesystem and memorymanagement session at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM). His employer, Facebook, has a solid use case for using THPs on files in the page cache, which may provide a starting point.
收起

Amir Goldstein has a use case for a feature that could be called a "lazy file reflink", he said, though it might also be described as "VFSlevel snapshots". He went through the use case, looking for suggestions, in a session at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM). He has already implemented parts of the solution, but would like to get something upstream, which would mean shifting from the stackedfilesystem approach he has taken so far.
收起

The "guarantees" that existing filesystems make with regard to persistence in the face of a system crash was the subject of a session led by Amir Goldstein at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM). The problem is that filesystem developers are not willing to make much in the way of guarantees unless applications call fsync()—something that is not popular with application developers, who want a cheaper option.
收起

The relationship between SUSE and the openSUSE community is currently under discussion as the community considers different options for how it wants to be organized and governed in the future. Among the options under consideration is the possibility of openSUSE setting up an entirely independent foundation, as it seeks greater autonomy and control over its own future and operations.
收起

The openSUSE project has announced the release of openSUSE Leap 15.1. "Leap releases are scalable and both the desktop and server are equally important for professional’s workloads, which is reflected in the installation menu as well as the amount of packages Leap offers and hardware it supports. Leap is well suited and prepared for usage as a Virtual Machine (VM) or container guest, allowing professional users to efficiently run network services no matter whether it’s a single server or a data center."
收起

The cost of fsync() is well known to filesystem developers, which is why there are efforts to provide cheaper alternatives. Ric Wheeler wanted to discuss the longstanding idea of adding an asynchronous version of fsync() in a filesystem session at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM). It turns out that what he wants may already be available via the new io_uring interface.
收起

Damien Le Moal and Naohiro Aota led a combined storage and filesystem session at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit (LSFMM) on filesystem work that has been done for zoned block devices. These devices have multiple zones with different characteristics; usually there are zones that can only be written in sequential order as well as conventional zones that can be written in random order. The genesis of zoned block devices is shingled magnetic recording (SMR) devices, which were created to increase the capacity of hard disks, but at the cost of some flexibility.
收起

Android is now at the point where sRGB color gamut with 8 bits per color channel is not enough to take advantage of the display and camera technology. At Android we have been working to make wide color photography happen endtoend, e.g. more bits and bigger gamuts. This means, eventually users will be able to capture the richness of the scenes, share a wide color pictures with friends and view wide color pictures on their phones. And now with Android Q, it’s starting to get really close to reality: wide color photography is coming to Android. So, it’s very important to applications to be wide color gamut ready. This article will show how you can test your application to see whether it’s wide color gamut ready and wide color gamut capable, and the steps you need to take to be ready for wide color gamut photography.
收起

In a combined filesystem and storage session at the 2019 Linux Storage, Filesystem, and MemoryManagement Summit, Avri Altman wanted to discuss the "turbowrite" mode that is coming for Universal Flash Storage (UFS) devices. He wanted to introduce this new feature to assembled developers and to get some opinions on how to support this mode in the kernel.
收起

By the time Linus Torvalds released the 5.2rc1 kernel prepatch and closed the merge window for this development cycle, 12,064 nonmerge changesets had been pulled into the mainline repository — about 3,700 since our summary of the first "half" was written. Thus, as predicted, the rate of change did slow during the latter part of the merge window. That does not mean that no significant changes have been merged, though; read on for a summary of what else has been merged for 5.2.
收起

The everincreasing complexity of the software stacks we work with has given testing an important role. There was a recent intersection between the automated testing being done by the Yocto Project (YP) and a bug introduced into the Linux kernel that gives some insight into what the future holds and the potential available with this kind of testing.
收起

A vulnerability in the messaging app WhatsApp has allowed attackers to inject commercial Israeli spyware on to phones, the company and a spyware technology dealer said. WhatsApp, which is used by 1.5bn people worldwide, discovered in early May that attackers were able to install surveillance software on to both iPhones and Android phones by ringing up targets using the app’s phone call function. The malicious code, developed by the secretive Israeli company NSO Group, could be transmitted even if users did not answer their phones, and the calls often disappeared from call logs, said the spyware dealer, who was recently briefed on the WhatsApp hack. I never answer phone calls from telephone numbers I am not familiar with, let alone when the incoming callers his their number blocked. Apparently, though, not even protects you from attacks such as these.
收起

Researchers have found an explanation for why many drivers act out toward cyclists: They are actually dehumanizing people who ride bikes, according to an April study by Australian researchers in the journal Transportation Research. From a report: And this dehumanization  the belief that a group of people are less than human  correlates to drivers' selfreported aggressive behavior. Since 2010, cyclist fatalities have increased by 25 percent in the US. A total of 777 bicyclists were killed in crashes with drivers in 2017, and 45,000 were injured from crashes in 2015. Data compiled by the League of American Bicyclists also suggests that, in some states, bicyclists are overrepresented in the number of traffic fatalities. "The idea is that if you don't see a group of people as fully human, then you're more likely to be aggressive toward them," said Narelle Haworth, a professor and director of the Centre for Accident Research and Road Safety at Queensland University of Technology, one
收起

We introduce a family of quasiBanach spaces  which we call wave packet smoothness spaces  that includes those function spaces which can be characterised by the sparsity of their expansions in Gabor frames, wave atoms, and many other frame constructions. We construct Banach frames for and atomic decompositions of the wave packet smoothness spaces and study their embeddings in each other and in a few more classical function spaces such as Besov and Sobolev spaces.
收起

Recently the authors introduced lecture hall tableaux in their study of multivariate little $q$Jacobi polynomials. In this paper, we enumerate bounded lecture hall tableaux. We show that their enumeration is closely related to standard and semistandard Young tableaux. We also show that the number of bounded lecture hall tableaux is the coefficient of the Schur expansion of $s_\lambda(m+y_1,\dots,m+y_n)$. To prove this result, we use two main tools: nonintersecting lattice paths and bijections. In particular we use ideas developed by Krattenthaler to prove bijectively the hook content formula.
收起

We employ the proximal averaged Newtontype method for optimal control (PANOC) to solve obstacle avoidance problems in real time. We introduce a novel modeling framework for obstacle avoidance which allows us to easily account for generic, possibly nonconvex, obstacles involving polytopes, ellipsoids, semialgebraic sets and generic sets described by a set of nonlinear inequalities. PANOC is particularly wellsuited for embedded applications as it involves simple steps, its implementation comes with a low memory footprint and its fast convergence meets the tight runtime requirements of fast dynamical systems one encounters in modern mechatronics and robotics. The proposed obstacle avoidance scheme is tested on a labscale autonomous vehicle.
收起

We study the equivariant elliptic characteristic classes of Schubert varieties of the generalized full flag variety $G/B$. For this first we need to twist the notion of elliptic characteristic class of BorisovLibgober by a line bundle, and thus allow the elliptic classes to depend on extra variables. Using the BottSamelson resolution of Schubert varieties we prove a BGGtype recursion for the elliptic classes, and study the Hecke algebra of our elliptic BGG operators. For $G=GL_n(C)$ we find representatives of the elliptic classes of Schubert varieties in natural presentations of the K theory ring of $G/B$, and identify them with the TarasovVarchenko weight function (a.k.a. elliptic stable envelopes for $T^*G/B$). As a byproduct we find another recursion, different from the known Rmatrix recursion for the fixed point restrictions of weight functions. On the other hand the Rmatrix recursion generalizes for arbitrary reductive group $G$.
收起

A deviceindependent dimension test for a Bell experiment aims to estimate the underlying Hilbert space dimension that is required to produce given measurement statistical data without any other assumptions concerning the quantum apparatus. Previous work mostly deals with the twoparty version of this problem. In this paper, we propose a very general and robust approach to test the dimension of any subsystem in a multiparty Bell experiment. Our dimension test stems from the study of a new multiparty scenario which we call prepareanddistribute. This is like the prepareandmeasure scenario, but the quantum state is sent to multiple, noncommunicating parties. Through specific examples, we show that our test results can be tight. Furthermore, we compare the performance of our test to results based on known bipartite tests, and witness remarkable advantage, which indicates that our test is of a true multiparty nature. We conclude by pointing out that with some partial information about
收起

Artin's representation is an injective homomorphism from the braid group $B_n$ on $n$ strands into $\operatorname{Aut}\mathbb{F}_n$, the automorphism group of the free group $\mathbb{F}_n$ on $n$ generators. The representation induces maps $B_n\to\operatorname{Aut}C^*_r(\mathbb{F}_n)$ and $B_n\to\operatorname{Aut}C^*(\mathbb{F}_n)$ into the automorphism groups of the corresponding group $C^*$algebras of $\mathbb{F}_n$. These maps also have natural restrictions to the pure braid group $P_n$. In this paper, we consider twisted versions of the actions by cocycles with values in the circle, and discuss the ideal structure of the associated crossed products. Additionally, we make use of Artin's representation to show that the braid groups $B_\infty$ and $P_\infty$ on infinitely many strands are both $C^*$simple.
收起

This research considers the ranking and selection (R&S) problem of selecting the optimal subset from a finite set of alternative designs. Given the total simulation budget constraint, we aim to maximize the probability of correctly selecting the topm designs. In order to improve the selection efficiency, we incorporate the information from across the domain into regression metamodels. In this research, we assume that the mean performance of each design is approximately quadratic. To achieve a better fit of this model, we divide the solution space into adjacent partitions such that the quadratic assumption can be satisfied within each partition. Using the large deviation theory, we propose an approximately optimal simulation budget allocation rule in the presence of partitioned domains. Numerical experiments demonstrate that our approach can enhance the simulation efficiency significantly.
收起

In this paper we study the drawdown related Parisian ruin problem for spectrally negative L\'{e}vy risk processes. We introduce the drawdown Parisian ruin time and solve the corresponding twosided exit time via excursion theory. We also obtain an expression of the potential measure for the process killed at the drawdown Parisian time. As applications, new results are obtained for spectrally negative L\'{e}vy risk process with dividend barrier and Parisian ruin.
收起

We prove decay with respect to some Lebesgue norms for a class of Schr\"odinger equations with nonlocal nonlinearities by showing new Morawetz inequalities and estimates. As a byproduct, we obtain largedata scattering in the energy space for the solutions to the systems of $N$ defocusing Choquard equations with massenergy intercritical nonlinearities in any space dimension and of defocusing HartreeFock equations, for any dimension $d\geq3$.
收起

A hyperbolic polynomial (HP) is a real univariate polynomial with all roots real. By Descartes' rule of signs a HP with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with multiplicity, where $c$ and $p$ are the numbers of sign changes and sign preservations in the sequence of its coefficients. For $c=1$ and $2$, we discuss the question: When the moduli of all the roots of a HP are arranged in the increasing order on the real halfline, at which positions can be the moduli of its positive roots depending on the positions of the sign changes in the sequence of coefficients?
收起

The differential evolution algorithm is applied to solve the optimization problem to reconstruct the production function (inverse problem) for the spatial Solow mathematical model using additional measurements of the gross domestic product for the fixed points. Since the inverse problem is illposed the regularized differential evolution is applied. For getting the optimized solution of the inverse problem the differential evolution algorithm is paralleled to 32 kernels. Numerical results for different technological levels and errors in measured data are presented and discussed.
收起

Let $k$ be a field containing an algebraically closed field of characteristic zero. If $G$ is a finite group and $D$ is a division algebra over $k$, finite dimensional over its center, we can associate to a faithful $G$grading on $D$ a normal abelian subgroup $H$, a positive integer $d$ and an element of $Hom(M(H), k^\times)^G$, where $M(H)$ is the Schur multiplier of $H$. Our main theorem is the converse: Given an extension $1\rightarrow H\rightarrow G\rightarrow G/H\rightarrow 1$, where $H$ is abelian, a positive integer $d$, and an element of $Hom(M(H), k^\times)^G$, there is a division algebra with center containing $k$ that realizes these data. We apply this result to classify the $G$simple algebras over an algebraically closed field of characteristic zero that admit a division algebra form over a field containing an algebraically closed field.
收起

A Deza graph with parameters $(v,k,b,a)$ is a $k$regular graph on $v$ vertices in which the number of common neighbors of two distinct vertices takes two values $a$ or $b$ ($a\leq b$) and both cases exist. In the previous papers Deza graphs with parameters $(v,k,b,a)$ where $kb = 1$ were characterized. In the paper we characterise Deza graphs with $kb = 2$.
收起

Semianalytic expressions for the static limit of the $T$matrix for electromagnetic scattering are derived for a circular torus, expressed in both a basis of toroidal harmonics and spherical harmonics. The scattering problem for an arbitrary static excitation is solved using toroidal harmonics, and these are then compared to the extended boundary condition method to obtain analytic expressions for auxiliary $Q$ and $P$matrices, from which $\mathbf{T}=\mathbf{P}\mathbf{Q}^{1}$ (in a toroidal basis). By applying the basis transformations between toroidal and spherical harmonics, the quasistatic limit of the $T$matrix block $\mathbf{T}^{22}$ for electricelectric multipole coupling is obtained. For the toroidal geometry there are two similar $T$matrices on a spherical basis, for computing the scattered field both near the origin and in the far field. Static limits of the optical crosssections are computed, and analytic expressions for the limit of a thin ring are derived.
收起

We study a wireless adhoc sensor network (WASN) where $N$ sensors gather data from the surrounding environment and transmit their sensed information to $M$ fusion centers (FCs) via multihop wireless communications. This node deployment problem is formulated as an optimization problem to make a tradeoff between the sensing uncertainty and energy consumption of the network. Our primary goal is to find an optimal deployment of sensors and FCs to minimize a Lagrange combination of the sensing uncertainty and energy consumption. To support arbitrary routing protocols in WASNs, the routingdependent necessary conditions for the optimal deployment are explored. Based on these necessary conditions, we propose a routingaware Lloyd algorithm to optimize node deployment. Simulation results show that, on average, the proposed algorithm outperforms the existing deployment algorithms.
收起

The wellknown plastic number substitution gives rise to a ternary inflation tiling of the real line whose inflation factor is the smallest PisotVijayaraghavan number. The corresponding dynamical system has pure point spectrum, and the associated control point sets can be described as regular model sets whose windows in twodimensional internal space are Rauzy fractals with a complicated structure. Here, we calculate the resulting pure point diffraction measure via a Fourier matrix cocycle, which admits a closed formula for the Fourier transform of the Rauzy fractals, via a rapidly converging infinite product.
收起

The aim of this paper is to study the asymptotic properties of the maximum likelihood estimator (MLE) of the drift coefficient for fractional stochastic heat equation driven by an additive spacetime noise. We consider the traditional for stochastic partial differential equations statistical experiment when the measurements are performed in the spectral domain, and in contrast to the existing literature, we study the asymptotic properties of the maximum likelihood (type) estimators (MLE) when both, the number of Fourier modes and the time go to infinity. In the first part of the paper we consider the usual setup of continuous time observations of the Fourier coefficients of the solutions, and show that the MLE is consistent, asymptotically normal and optimal in the meansquare sense. In the second part of the paper we investigate the natural time discretization of the MLE, by assuming that the first N Fourier modes are measured at M time grid points, uniformly spaced over the time inte
收起

By allowing a mobile device to offload computationintensive tasks to a base station, mobile edge computing (MEC) is a promising solution for saving the mobile device's energy. In real applications, the offloading may span multiple fading blocks. In this paper, we investigate energyefficient offloading over multiple fading blocks with random channel gains. An optimization problem is formulated, which optimizes the amount of data for offloading to minimize the total expected energy consumption of the mobile device. Although the formulated optimization problem is nonconvex, we prove that the objective function of the problem is piecewise convex, and accordingly develop an optimal solution for the problem. Numerical results verify the correctness of our findings and the effectiveness of our proposed method.
收起

We study the bounded endomorphisms of $\ell_{N}^2(G)=\ell^2(G)\times \dots \times\ell^2(G)$ that commute with translations, where $G$ is a discrete abelian group. It is shown that they form a C*algebra isomorphic to the C*algebra of $N\times N$ matrices with entries in $L^\infty(\widehat{G})$, where $\widehat{G}$ is the dual space of $G$. Characterizations of when these endomorphisms are invertible, and expressions for their norms and for the norms of their inverses, are given. These results allow us to study Riesz systems that arise from the action of $ G $ on a finite set of elements of a Hilbert space.
收起

Math is widely considered as a powerful tool and its strong appeal depends on the high level of abstraction it allows in modelling a huge number of heterogeneous phenomena and problems, spanning from the static of buildings to the flight of swarms. As further proof, Gardner's and Carroll's problems have been intensively employed in a number of selection methods and job interviews. Despite the mathematical background, these problems are based on, several solutions and explanations are given in a trivial way. This work proposes a thorough investigation of this framework, as a whole. The results of such study are three mathematical formulations that express the understood mathematical relationship in these wellknown riddles. The proposed formulas are of help in the formalization of the solutions, which have been proven to be less timetaking when compared to the wellknown classic ones, that look more heuristic than rigorous.
收起

Two new studies reaffirm every computer dunce's worst fears: IT professionals blame the employees they're bound to help for their computer problems  at least when it comes to security. From a report: One, courtesy of SaaS operations management platform BetterCloud, offers grim reading. 91 percent of the 500 IT and security professionals surveyed admitted they feel vulnerable to insider threats. Which only makes one wonder about the supreme (over)confidence of the other 9 percent. [...] Yet now I've been confronted with another survey. This one was performed by the Ponemon Institute at the behest of securityforyoursecurity company nCipher. Its sampling was depressingly large. 5,856 IT and security professionals from around the world were asked for their views of corporate IT security. They seemed to wail in unison at the lesser and more unwashed. Oh, an objective 30 percent insisted that external hackers were the biggest cause for concern. A teethgritting 54 percent, however, s
收起

Lego Education, the educationfocused arm of the veteran Denmark company, is making its biggest product debut in three years, unveiling Spike Prime, a new kit that aims to mix the company's familiar bricks with motors, sensors and introductory coding lessons. The company is targeting kids aged between 11 to 14. From a report: Lego Mindstorms have been around for years. The Mindstorms EV3 robotics kit remains a staple of many learning centers and robotics classrooms. Lego's newest kit looks more like Lego Boost, a programmable kit that aimed to win over families in 2017 and was compatible with regular Lego bricks. It's compatible with Lego Boost, Lego Technic sets and classic Lego pieces, but not with Lego's previous Mindstorms accessories. Lego Mindstorms EV3 is remaining alongside Lego Spike Prime in Lego Education's lineup, and looks like it's aiming more at the high school crowd, while Lego Spike Prime could bridge to that higherend projects. The Spike Prime set is created specif
收起

An anonymous reader writes: Microsoft today announced that Visual Studio 2019 for Windows and Mac has hit general availability — you can download it now from visualstudio.microsoft.com/downloads. Visual Studio 2019 includes AIassisted code completion with Visual Studio IntelliCode. Separately, realtime collaboration tool Visual Studio Live Share has also hit general availability, and is now included with Visual Studio 2019.
收起

Starting today, Microsoft is ending all ebook sales in its Microsoft Store for Windows PCs. "Previously purchased ebooks will be removed from users' libraries in early July," reports The Verge. "Even free ones will be deleted. The company will offer full refunds to users for any books they've purchased or preordered." From the report: Microsoft's "official reason," according to ZDNet, is that this move is part of a strategy to help streamline the focus of the Microsoft Store. It seems that the company no longer has an interest in trying to compete with Amazon, Apple Books, and Google Play Books. It's a bit hard to imagine why anyone would go with Microsoft over those options anyway. If you have purchased ebooks from Microsoft, you can continue accessing them through the Edge browser until everything vanishes in July. After that, customers can expect to automatically receive a refund. According to a newly published Microsoft Store FAQ, "refund processing for eligible customers start rol
收起

At its DataCentric Innovation Day, Intel today announced its Cascade Lake line of Xeon Scalable data center processors. From a report: The secondgeneration lineup of Xeon Scalable processors comes in 53 flavors that span up to 56 cores and 12 memory channels per chip, but as a reminder that Intel company is briskly expanding beyond "just" processors, the company also announced the final arrival of its Optane DC Persistent Memory DIMMs along with a range of new data center SSDs, Ethernet controllers, 10nm Agilex FPGAs, and Xeon D processors. This broad spectrum of products leverages Intel's overwhelming presence in the data center, it currently occupies ~95% of the worlds server sockets, as a springboard to chew into other markets, including its new assault on the memory space with the Optane DC Persistent Memory DIMMs. The longawaited DIMMs open a new market for Intel and have the potential to disrupt the entire memory hierarchy, but also serve as a potentially key component that ca
收起

This account of Anthem’s development, based on interviews with 19 people who either worked on the game or adjacent to it (all of whom were granted anonymity because they were not authorized to talk about Anthem’s development), is a story of indecision and mismanagement. It’s a story of technical failings, as EA’s Frostbite engine continued to make life miserable for many of BioWare’s developers, and understaffed departments struggled to serve their team’s needs. It’s a story of two studios, one in Edmonton, Alberta, Canada and another in Austin, Texas, that grew resentful toward one another thanks to a tense, lopsided relationship. It’s a story of a video game that was in development for nearly seven years but didn’t enter production until the final 18 months, thanks to big narrative reboots, major design overhauls, and a leadership team said to be unable to provide a consistent vision and unwilling to listen to feedback. Perhaps most alarming, it’s a story about a studio in crisis. Do
收起