scholarly journals Priority Forcing Scheme: A New Strategy for Getting Better than Best Effort Service in IP-based Network

2002 ◽  
pp. 135-149 ◽  
Author(s):  
Wojciech Burakowski ◽  
Monika Fudała
Keyword(s):  
Best Effort ◽  
New Strategy ◽  
Better Than

scholarly journals PRIORITIZATION OF COMBINATORIAL TEST CASES BY INCREMENTAL INTERACTION COVERAGE

2013 ◽  
Vol 23 (10) ◽  
pp. 1427-1457 ◽  
Author(s):  
RUBING HUANG ◽  
XIAODONG XIE ◽  
DAVE TOWEY ◽  
TSONG YUEH CHEN ◽  
YANSHENG LU ◽  
...  
Keyword(s):  
Test Case ◽  
Test Cases ◽  
New Strategy ◽  
Testing Cost ◽  
Test Prioritization ◽  
Interaction Testing ◽  
Parameter Interactions ◽  
Combinatorial Interaction Testing ◽  
Alternative Assumption ◽  
Better Than

Combinatorial interaction testing is a well-recognized testing method, and has been widely applied in practice, often with the assumption that all test cases in a combinatorial test suite have the same fault detection capability. However, when testing resources are limited, an alternative assumption may be that some test cases are more likely to reveal failure, thus making the order of executing the test cases critical. To improve testing cost-effectiveness, prioritization of combinatorial test cases is employed. The most popular approach is based on interaction coverage, which prioritizes combinatorial test cases by repeatedly choosing an unexecuted test case that covers the largest number of uncovered parameter value combinations of a given strength (level of interaction among parameters). However, this approach suffers from some drawbacks. Based on previous observations that the majority of faults in practical systems can usually be triggered with parameter interactions of small strengths, we propose a new strategy of prioritizing combinatorial test cases by incrementally adjusting the strength values. Experimental results show that our method performs better than the random prioritization technique and the technique of prioritizing combinatorial test suites according to test case generation order, and has better performance than the interaction-coverage-based test prioritization technique in most cases.

Tasklets: "Better than Best-Effort" Computing

2016 ◽  
Author(s):  
Dominik Schafer ◽  
Janick Edinger ◽  
Justin Mazzola Paluska ◽  
Sebastian VanSyckel ◽  
Christian Becker
Keyword(s):  
Best Effort ◽  
Better Than

scholarly journals Nanoemulsions as Edible Coatings: A Potential Strategy for Fresh Fruits and Vegetables Preservation

Foods ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 2438
Author(s):  
Josemar Gonçalves de Oliveira de Oliveira Filho ◽  
Marcela Miranda ◽  
Marcos David Ferreira ◽  
Anne Plotto
Keyword(s):  
Shelf Life ◽  
Fruits And Vegetables ◽  
Storage Period ◽  
Food Storage ◽  
Antioxidant Compounds ◽  
Edible Coatings ◽  
New Strategy ◽  
Potential Strategy ◽  
Available Information ◽  
Better Than

Fresh fruits and vegetables are perishable commodities requiring technologies to extend their postharvest shelf life. Edible coatings have been used as a strategy to preserve fresh fruits and vegetables in addition to cold storage and/or controlled atmosphere. In recent years, nanotechnology has emerged as a new strategy for improving coating properties. Coatings based on plant-source nanoemulsions in general have a better water barrier, and better mechanical, optical, and microstructural properties in comparison with coatings based on conventional emulsions. When antimicrobial and antioxidant compounds are incorporated into the coatings, nanocoatings enable the gradual and controlled release of those compounds over the food storage period better than conventional emulsions, hence increasing their bioactivity, extending shelf life, and improving nutritional produce quality. The main goal of this review is to update the available information on the use of nanoemulsions as coatings for preserving fresh fruits and vegetables, pointing to a prospective view and future applications.

Biosurfactants of Lactobacillus helveticus for biodiversity inhibit the biofilm formation of Staphylococcus aureus and cell invasion

2019 ◽  
Vol 14 (13) ◽  
pp. 1133-1146 ◽  
Author(s):  
Xinpeng Jiang ◽  
Xin Yan ◽  
Shanshan Gu ◽  
Yan Yang ◽  
Lili Zhao ◽  
...  
Keyword(s):  
Staphylococcus Aureus ◽  
Host Cell ◽  
Biofilm Formation ◽  
Lactobacillus Helveticus ◽  
Real Time Quantitative Pcr ◽  
Autoinducer 2 ◽  
New Strategy ◽  
Better Than

Aim: This study aimed to evaluate the differences of biosurfactants produced by two Lactobacillus helveticus strains against the biofilm formation of Staphylococcus aureus in vitro and in vivo. Materials & methods: Scanning electron microscopy, Real time-quantitative PCR (RT-qPCR) and cell assay were used to analyze the inhibiting effect of biosurfactants against biofilm formation. Results & conclusion: Results showed that the biosurfactants have anti-adhesive and inhibiting effects on biofilm formation in vivo and in vitro. The biofilm-formative genes and autoinducer-2 signaling regulated these characteristics, and the biosurfactant L. helveticus 27170 is better than that of 27058. Host cell adhesion and invasion results indicated that the biosurfactants L. helveticus prevented the S. aureus invading the host cell, which may be a new strategy to eliminate biofilms.

scholarly journals Boundary Strategy for Optimization-based Structural Damage Detection Problem using Metaheuristic Algorithms

2020 ◽  
Author(s):  
Ali Kaveh ◽  
Seyed Milad Hosseini ◽  
Ataollah Zaerreza
Keyword(s):  
Damage Detection ◽  
Structural Damage ◽  
Optimization Method ◽  
Metaheuristic Algorithms ◽  
Structural Elements ◽  
Detection Problem ◽  
Vibration Data ◽  
New Strategy ◽  
Optimum Solution ◽  
Better Than

The present paper proposes a new strategy namely Boundary Strategy (BS) in the process of optimization-based damage detection using metaheuristic algorithms. This strategy gradually neutralizes the effects of structural elements that are healthy in the optimization process. BS causes the optimization method to find the optimum solution better than conventional methods that do not use the proposed BS. This technique improves both aspects of the accuracy and convergence speed of the algorithms in identifying and quantifying the damage. To evaluate the performance of the developed strategy, a new damage-sensitive cost function, which is defined based on vibration data of the structure, is optimized utilizing the Shuffled Shepherd Optimization Algorithm (SSOA). Different examples including truss, beam, and frame are investigated numerically in order to indicate the applicability of the proposed technique. The proposed approach is also applied to other well-known optimization algorithms including TLBO, GWO, and MFO. The obtained results illustrate that the proposed method improves the performance of the utilized algorithms in identifying and quantifying of the damaged elements, even for noise-contaminated data.

GALO: A DEPLOYABLE FRAMEWORK FOR PROVIDING BETTER THAN BEST-EFFORT QUALITY OF SERVICE

2006 ◽  
Vol 07 (03) ◽  
pp. 319-351
Author(s):  
RAHEEM BEYAH ◽  
RAGHUPATHY SIVAKUMAR ◽  
JOHN COPELAND
Keyword(s):  
Quality Of Service ◽  
Significant Contribution ◽  
Peer To Peer ◽  
Area Network ◽  
Wide Area Network ◽  
Application Layer ◽  
Best Effort ◽  
Routing Schemes ◽  
Better Than

In this paper we propose a deployable approach to improving QoS by using a generic, extendable, overlay architecture; the Generalized Application Layer Overlay (GALO). The goals of this work are to 1) create an overlay architecture which allows us to sample specific path quality metrics among different paths; 2) utilize the proposed overlay architecture in order to implement our proposed QoS-based routing schemes, Application Layer Switching (ALSW) and Application Layer Striping (ALST). Perhaps the most significant contribution of this research is that we are able to achieve better than best-effort QoS without modifying intermediate nodes (i.e., routers), thus encouraging immediate deployment. Additionally, this research is performed on an actual wide area network (WAN) testbed, comprised of universities across the nation. Also, we assemble this architecture as a peer-to-peer framework, encouraging collaborating individuals with average workstations to improve the QoS of their traffic.

scholarly journals A Nonmonotone Gradient Algorithm for Total Variation Image Denoising Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Peng Wang ◽  
Shifang Yuan ◽  
Xiangyun Xie ◽  
Shengwu Xiong
Keyword(s):  
Image Denoising ◽  
Total Variation ◽  
Gradient Method ◽  
State Of The Art ◽  
Gradient Algorithm ◽  
Projected Gradient Method ◽  
New Strategy ◽  
A New Technique ◽  
Tv Model ◽  
Better Than

The total variation (TV) model has been studied extensively because it is able to preserve sharp attributes and capture some sparsely critical information in images. However, TV denoising problem is usually ill-conditioned that the classical monotone projected gradient method cannot solve the problem efficiently. Therefore, a new strategy based on nonmonotone approach is digged out as accelerated spectral project gradient (ASPG) for solving TV. Furthermore, traditional TV is handled by vectorizing, which makes the scheme far more complicated for designing algorithms. In order to simplify the computing process, a new technique is developed in view of matrix rather than traditional vector. Numerical results proved that our ASPG algorithm is better than some state-of-the-art algorithms in both accuracy and convergence speed.

Towards a better-than-best-effort forwarding service for multimedia flows

1999 ◽  
Vol 6 (4) ◽  
pp. 84-87 ◽  
Author(s):  
K. Jeffay
Keyword(s):  
Best Effort ◽  
Better Than

Perbandingan Metode Antrian Paket HTB dan EDCA Untuk Layanan Multimedia Pada WLAN IEEE 802.11n

2020 ◽  
Vol 3 (2) ◽  
pp. 132-143
Author(s):  
Taufik Hidayat ◽  
Zulfan Zulfan ◽  
Munawir Munawir ◽  
Susmanto Susmanto
Keyword(s):  
Data Transfer ◽  
Mean Value ◽  
Data Packet ◽  
Multimedia Data ◽  
Service Needs ◽  
Wireless Technology ◽  
Delay Test ◽  
Best Effort ◽  
The Impact ◽  
Better Than

The development of wireless technology continues to improve quality and increase the speed of data transfer into one important factor that is considered. Each year, wireless technology users continue to increase and communication service needs also experience tremendous traffic surge. The impact of high traffic intensity of data sent can lead to increased data queue and transient transmission network. The problem of network crunch resulting from a high amount of queue data may affect service performance. To get the solution, in this study was tested using Hierarchy Token Bucket (HTB) and Enhanced Distributed Channel Access (EDCA) on 802.11n wireless network. Queuing tests are performed on four types of traffic: voice, video, best effort (BE) and background (BG). Assessment of QoS of HTB and EDCA is based on throughput and delay parameters. The results obtained from throughput testing of the mean value of each data packet, the results show that the EDCA method is better than HTB method. The best throughput results are given on Best Effort(BE) traffic. While on the delay test by using HTB and EDCA method, obtained the average of EDCA delay smaller in multimedia data packet for Video and Voice. In conclusion, the results show that the EDCA method is better than HTB.

Sign in / Sign up

Export Citation Format

Share Document