The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 4634 of Mathematical Reviews Vol. , Issue 2000g
[page]
2000
Mathematical Reviews
Preserved Fulltext
(F-PARIS6-CM; Paris)
Gracefulness of replicated paths and cycles. (English summary)
Ars Combin. 53 (1999), 257-269. ...
Summary: “We investigate whether replicated paths and replicated cycles are graceful. We also investigate the number of different graceful labelings of the complete bipartite graph.” ...
BDS
2018
Proceedings of the Thirteenth EuroSys Conference on - EuroSys '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To quickly react to network dynamics and workload churns, BDS speeds up the control algorithm by decoupling it into selection of overlay paths and scheduling of data transfers, each can be optimized efficiently ...
store-and-forward data, as well as the rich inter-DC overlay paths that exist in geo-distributed DCs. ...
We would like to thank our shepherd, Paolo Romano, and the anonymous EuroSys reviewers for their valuable feedback. ...
doi:10.1145/3190508.3190519
dblp:conf/eurosys/ZhangJ0NRWYZC18
fatcat:k4eqoiukfzb5xgby4bwocobxim
Significance driven computation
2009
Proceedings of the 14th ACM/IEEE international symposium on Low power electronics and design - ISLPED '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, our design includes an adaptive quality compensation (AQC) block which "tunes" the algorithm and architecture depending on the magnitude of voltage over-scaling and severity of process variations ...
The fundamental premise of our approach lies in the fact that all computations are not equally significant in shaping the output response of video systems. ...
ACKNOWLEDGEMENTS The authors acknowledge the support of the GSRC, one of five research centers funded under the FCRP, a SRC program. ...
doi:10.1145/1594233.1594282
dblp:conf/islped/MohapatraKR09
fatcat:36l5hdzwzzacncsunugrvfayke
Graceful and Strongly Graceful Permutations
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A lobster or a 2-distant tree is a tree T that contains a path P such that any vertex of T is a distance at most 2 from a vertex of P. ...
In this paper, we define generalised strongly graceful permutations and discover two new permutations in addition to the known permutation that is obtained by replacing each vertex label f(v) by |ET|- ...
This is exactly the same as case 1 in the proof of theorem 4 and hence can be replicated here. Case 2b. path P` is not maximal. ...
arXiv:2107.14007v1
fatcat:4dt6wmrk4bfkpmcxziscs3arua
NS-FTR: A fault tolerant routing scheme for networks on chip with permanent and runtime intermittent faults
2011
16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
However, these turn model based algorithms are either too restrictive in the choice of paths that flits can traverse, or are tailored to work efficiently only on very specific fault distribution patterns ...
A majority of existing fault tolerant routing algorithms are based on the turn model approach due to its simplicity and inherent freedom from deadlock. ...
Minimal paths and the replication threshold ensure low power dissipation under a diverse set of fault rates and distributions. ...
doi:10.1109/aspdac.2011.5722231
dblp:conf/aspdac/PasrichaZ11
fatcat:ikz6l456o5awhma56krl2uzgii
RevivePath: Resilient Network-on-Chip Design Through Data Path Salvaging of Router
2013
Journal of Computer Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experimental results show that it achieves quite high reliability with graceful performance degradation even under high fault rate. ...
In this paper, we notice that data path such as links, buffers and crossbars in NoC can be divided into multiple identical parallel slices, which can be utilized as inherent redundancy to enhance reliability ...
Thus, direct replication of data path component results in quite a large area overhead. ...
doi:10.1007/s11390-013-1396-3
fatcat:qgxdpdbdyzejjdxpmldikjgjmi
On the generation of alpha graphs
2022
Journal of Algebra Combinatorics Discrete Structures and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this work, we explore new techniques to generate α-labeled graphs, such as vertex and edge duplications, replications of the entire graph, and k-vertex amalgamations. ...
Graceful labelings constitute one of the classical subjects in the area of graph labelings; among them, the most restrictive type are those called α-labelings. ...
[9] proved that the duplication of an edge of an even cycle is graceful. ...
doi:10.13069/jacodesmath.1111733
fatcat:buc2omodujaf7eujilz4hj32nq
OE+IOE
2010
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis - CODES/ISSS '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed scheme uses replication opportunistically to optimize the balance between energy overhead and arrival rate. ...
However, existing turn model based fault tolerant routing algorithms are either too restrictive in the choice of paths that flits can traverse, or are tailored to work efficiently only on very specific ...
Minimal paths and the replication threshold ensure low power dissipation under a diverse set of fault rates and distributions. ...
doi:10.1145/1878961.1878979
dblp:conf/codes/PasrichaZCS10
fatcat:whpjck3qergbfndyerpennuika
A resilient on-chip router design through data path salvaging
2011
16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose fine-grained data path salvaging techniques by splitting data path components, i.e., links, input buffers and crossbar into slices, instead of introducing redundancies. ...
Prior work mainly focuses on introducing redundancies, which can't achieve satisfactory reliability and also involve large hardware overhead, especially for data path components. ...
Thus, straightforward replication of data path component results in unaffordable area overhead. In fact, when data path such as a 64-bit channel fail, it rarely means all the 64 wires are broken. ...
doi:10.1109/aspdac.2011.5722230
dblp:conf/aspdac/LiuZHL11a
fatcat:dbhzbrw5mjbanhdjqsvinkupfa
Performance of Graceful Degradation for Cache Faults
2007
IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In sub-90nm technologies, more frequent hard faults pose a serious burden on processor design and yield control. ...
This paper considers defects in cache memory and studies their impact on program performance using a fault degradable cache model. ...
Graceful degradation approaches do not replicate resources for fault tolerance, but use existing replication to overcome faults. ...
doi:10.1109/isvlsi.2007.81
dblp:conf/isvlsi/LeeCC07
fatcat:5qkwz6wwkzesdnkivg7m3zvb44
Improved Fault Tolerant Sparse KOGGE Stone ADDER
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The latency will be increased because of the voter in the circuit's critical path. More advanced fault tolerant methods exist including roving and graceful degradation approaches. ...
The power analysis and the timing analysis for the estimation of setup time and hold time is also performed. General Terms Sparse Kogge-Stone adder, Triple Mode Redundancy, Fault tolerant. ...
half, and graceful degradation are obtained for a Vertex5 FPGA. ...
doi:10.5120/13150-0582
fatcat:enh6dfo4uvhpbgnl6mncnia3du
Telomeres and Telomerase: Molecular Views and Perspectives
2018
Advances in Aging Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Telomeric DNA loss is apparent with each cell division, which marks an endpoint to the indefinite replication of the cell by causing replicative senescence that may lead to the programmed cell death. ...
However, 5% -10% of the cells undergo telomerase-independent mechanism. This review presents the molecular view of the telomere and telomerase along with its associated complex structures. ...
Telomerase: Path towards Tumorigenesis After each division of somatic cells, telomere shortening occurs due to the inability of DNA polymerase to completely replicate chromosomal ends. ...
doi:10.4236/aar.2018.75008
fatcat:vu66g4unwfchbenclxap25tup4
Structural equation modelling reveals plant-community drivers of carbon storage in boreal forest ecosystems
2009
Biology Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Boreal forest ecosystems are important drivers of the global carbon (C) cycle by acting as both sinks and sources of atmospheric CO 2 . ...
Our results suggest that while boreal forests have great potential for storing significant amounts of C, traits of dominant plant species that promote below-ground C accumulation and the absence of wildfire ...
SEM is an advanced and robust multivariate statistical method that allows for hypotheses testing of complex path-relation networks (Malaeb et al. 2000; Grace et al. 2007 ). ...
doi:10.1098/rsbl.2009.0613
pmid:19755530
pmcid:PMC2817262
fatcat:ztmykye7zfdxjlazyhnllkhsc4
New opportunities for load balancing in network-wide intrusion detection systems
2012
Proceedings of the 8th international conference on Emerging networking experiments and technologies - CoNEXT '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As traffic volumes and the types of analysis grow, network intrusion detection systems (NIDS) face a continuous scaling challenge. ...
To this end, we design a general architecture for network-wide NIDS deployment that leverages three scaling opportunities: on-path distribution to split responsibilities, replicating traffic to NIDS clusters ...
This work was supported in part by NSF grants 0831245 and 1040626, and by grant number N00014-10-1-0155 from the Office of Naval Research. ...
doi:10.1145/2413176.2413218
dblp:conf/conext/HeorhiadiRS12
fatcat:a7qqbv3ye5eahczvep4mundw5q
The Water Cycle of the Baltic Sea Region From GRACE/GRACE-FO Missions and ERA5 Data
2022
Frontiers in Earth Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The water cycle of the Baltic Sea has been estimated from the Gravity Recovery and Climate Experiment (GRACE) and the GRACE Follow-On satellite time-variable gravity measurements, and precipitation and ...
On average, the Baltic Sea evaporates 199 ± 3 km3/year, which is overcompensated with 256 ± 6 km3/year of precipitation and 476 ± 17 km3/year of water from land. ...
The number of bootstrap replications was set to 10,000. ...
doi:10.3389/feart.2022.879148
fatcat:bun7fjvmgzhltfbbvvomylclq4
« Previous
Showing results 1 — 15 out of 9,746 results