نتایج جستجو برای: friendly index set

تعداد نتایج: 1071538  

2008
JANE GILMAN LINDA KEEN

Conjugacy classes of primitive words in the free group of rank two can indexed by the rationals. A representative for each conjugacy class is given by a recursive enumeration scheme and the representative, usually called a Farey word, is denoted by Wp/q where p and q are relatively prime integers. Primitive pairs, that is, pairs of words that generate the free group, correspond to pairs of word...

2007
Valerie Hower Clint McCrory Valery Alexeev Rodney Canfield William Graham Robert Varley Maureen Grasso John Aurie Dean

We introduce the notion of a cosheaf on a fan Σ and define the Z2 Hodge spaces Hpq(Σ), which are the homology groups Hp(∧E ) of the qth exterior power of the cosheaf E on Σ. Geometrically, for σ ∈ Σ the stalk Eσ of the cosheaf E is the compact real torus in the real orbit Oσ(R) of the real toric variety XΣ(R). The Z2 Hodge spaces Hpq(Σ) are indexed by pairs p, q with 0 ≤ q ≤ p ≤ d, where d = di...

2012
Dongwon Lee

As the number of users accessing web sites from their mobile devices rapidly increases, it becomes increasingly important for libraries to make their homepages “mobile-friendly.” However, to our best knowledge, there has been little attempt to survey how ready existing libraries are towards this upcoming mobile era and to quantitatively analyze the findings via data exploration methods. In this...

Journal: :Discrete Mathematics 2006
Gary Chartrand Sin-Min Lee Ping Zhang

LetG be a graph with vertex set V (G) and edge setE(G). A labeling f : V (G) → {0, 1} induces an edge labeling f ∗ : E(G) → {0, 1}, defined by f ∗(xy) = |f (x) − f (y)| for each edge xy ∈ E(G). For i ∈ {0, 1}, let ni(f ) = |{v ∈ V (G) : f (v) = i}| and mi(f )=|{e ∈ E(G) : f ∗(e)= i}|. Let c(f )=|m0(f )−m1(f )|.A labeling f of a graphG is called friendly if |n0(f )−n1(f )| 1. A cordial labeling ...

2010
Z. W. Zhong B. Song

This work analyzes a process known as flash pyrolysis, which produces bio fuels using biomass for power generation. A life-cycle assessment of flash pyrolysis of wood waste was conducted to study whether a flash pyrolysis plant set up locally would be environmentally friendly. The results obtained show that the process of flash pyrolysis of wood waste is in fact environmentally friendly, and th...

2004
Markku Kojo Davide Astuti Laila Daniel Aki Nyrhinen Kimmo E. E. Raatikainen

In this paper we propose the use of a TCP/IP-friendly link level error recovery mechanism with novel design in conjunction with state-of-the-art Transmission Control Protocol (TCP) enhancements to improve TCP performance on network paths involving Wireless Wide-Area Network (W-WAN) links. We show that by combining a selected set of TCP enhancements TCP performance is significantly improved over...

2012
Esther M. M. van de Glind Barbara C. van Munster René Spijker Rob J. P. M. Scholten Lotty Hooft

OBJECTIVES To create user-friendly search filters with high sensitivity, specificity, and precision to identify articles on geriatric medicine in Medline. DESIGN A diagnostic test assessment framework was used. A reference set of 2255 articles was created by hand-searching 22 biomedical journals in Medline, and each article was labeled as 'relevant', 'not relevant', or 'possibly relevant' for...

Journal: :Jurnal Ekonomi & Studi Pembangunan 2023

This research aims to determine the relationship between provincial minimum wages, poverty, unemployment, and income inequality environmental quality index (EQI). also demonstrate if Environmental Kuznet Curve (EKC) hypothesis is applicable in Indonesia. utilized secondary data collected from 33 provinces Indonesia 2012 2021. used panel regression with Fixed Effect Model (FEM) as method. The re...

2009
Soo-Hyun Choi Mark Handley

Real-time multimedia applications prefer smooth and predictable throughput to TCP-like abrupt sending rate changes, and this led to the development of TCP-Friendly Rate-based Congestion Control (TFRC). However, we observed a longterm throughput imbalance between TFRC and TCP sources, especially under a low level of statistical multiplexing. We set out to reduce these differences by re-introduci...

Journal: :CoRR 2016
Keiji Okano

Pairing-based cryptographic schemes require so-called pairing-friendly elliptic curves, which have special properties. The set of pairing-friendly elliptic curves that are generated by given polynomials form a complete family. Although a complete family with a ρ-value of 1 is the ideal case, there is only one such example that is known; this was given by Barreto and Naehrig (Lecture Notes in Co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید