37,767 results for which

github.com/fantastic-admin/basic

fantastic-admin/basic

⭐⭐⭐⭐⭐ 一款开箱即用的 Vue3 管理系统框架,支持多款 UI 组件库,兼容PC、移动端。An out-of-the-box Vue3 management system framework, which supports a variety of UI component libraries and is compatible with PC and mobile device. (⭐ 3195)

arxiv.org/abs/1404.5601v1

Renewal processes with costs and rewards

We review the theory of renewal reward processes, which describes renewal processes that have some cost or reward associated with each cycle. We present a new simplified proof of the renewal reward theorem that mimics the proof of the elementary rene...

arxiv.org/abs/1608.03265v2

Pinning of a renewal on a quenched renewal

We introduce the pinning model on a quenched renewal, which is an instance of a (strongly correlated) disordered pinning model. The potential takes value 1 at the renewal times of a quenched realization of a renewal process $σ$, and $0$ elsewhere, s...

en.wikipedia.org/wiki/Met_Operations

Met Operations - Wikipedia

Met Operations, also known as Met Ops, is one of the eight business groups which forms the Metropolitan Police Service and is responsible for providing

en.wikipedia.org/wiki/How_I_Met_Your_Mother

How I Met Your Mother - Wikipedia

How I Met Your Mother (often abbreviated HIMYM) is an American sitcom created by Craig Thomas and Carter Bays for CBS. The series, which aired from September

www.bing.com/ck/a?!&&p=33d2a7387dc9f03e5b9be8e04e16b0ce3f39569e86de2e74becf079e033155c0JmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=3d0e3ed6-0f7a-6e45-01d5-29c70e416f52&u=a1aHR0cHM6Ly93d3cubWV0ZW9yY2xpZW50LmNvbS8&ntb=1

Meteor Client

* Baritone is our fork which was previously included in Meteor itself. If you want the most up to date version, or want help with Baritone go to the official sources.

arxiv.org/abs/1707.03700v2

The exact strength of the class forcing theorem

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the correspondi...

arxiv.org/abs/2112.09846v1

Transfers on commutative group schemes

We prove that any commutative group scheme separated over a noetherian normal scheme admits a canonical structure of a presheaf with transfers, which is characterized by a simple condition on radicial transfers....

arxiv.org/abs/2602.19199v1

Counted NFT Transfers

Non-fungible tokens (NFTs) on Ethereum currently follow a binary mobility paradigm: ERC-721 enables unrestricted transfers, whereas SBTs (ERC-5192) prohibit transfers entirely. We identify a design gap in which no standard mechanism supports bounded...

arxiv.org/abs/2208.14142v3

Unit-length Rectangular Drawings of Graphs

A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter constrain...

en.wikipedia.org/wiki/Drawing_Hands

Drawing Hands - Wikipedia

Drawing Hands is a lithograph by the Dutch artist M. C. Escher first printed in January 1948. It depicts a sheet of paper, out of which two hands rise

arxiv.org/abs/1708.09221v1

Experimental Evaluation of Book Drawing Algorithms

A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the $k$ pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and onl...

en.wikipedia.org/wiki/Subtractive_drawing

Subtractive drawing - Wikipedia

Subtractive drawing is a technique in which the drawing surface is covered with graphite or charcoal marks and then erased to make the image. This technique

arxiv.org/abs/1908.08129v2

Extending Simple Drawings

Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing $D(G)$ of a graph $G$ by inserting a set of edges...