Bibliographies thématiques / FCBFS

Littérature scientifique sur le sujet « FCBFS »

Auteur : Grafiati
Publié le 16 janvier 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « FCBFS ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "FCBFS"

1

Saha, Rony Kumer, et Chaodit Aswakul. « Incentive and Architecture of Multi-Band Enabled Small Cell and UE for Up-/Down-Link and Control-/User-Plane Splitting for 5G Mobile Networks ». Frequenz 71, no 1-2 (1 janvier 2017) : 95–118. http://dx.doi.org/10.1515/freq-2016-0014.

Texte intégral
Résumé :
Abstract In this paper, a multi-band enabled femtocell base station (FCBS) and user equipment (UE) architecture is proposed in a multi-tier network that consists of small cells, including femtocells and picocells deployed over the coverage of a macrocell for splitting uplink and downlink (UL/DL) as well as control-plane and user-plane (C-/U-plane) for 5G mobile networks. Since splitting is performed at the same FCBS, we define this architecture as the same base station based split architecture (SBSA). For multiple bands, we consider co-channel (CC) microwave and different frequency (DF) 60 GHz millimeter wave (mmWave) bands for FCBSs and UEs with respect to the microwave band used by their over-laid macrocell base station. All femtocells are assumed to be deployed in a 3-dimensional multi-storage building. For CC microwave band, cross-tier CC interference of femtocells with macrocell is avoided using almost blank subframe based enhanced inter-cell interference coordination techniques. The co-existence of CC microwave and DF mmWave bands for SBSA on the same FCBS and UE is first studied to show their performance disparities in terms of system capacity and spectral efficiency in order to provide incentives for employing multiple bands at the same FCBS and UE and identify a suitable band for routing decoupled UL/DL or C-/U-plane traffic. We then present a number of disruptive architectural design alternatives of multi-band enabled SBSA for 5G mobile networks for UL/DL and C-/U-plane splitting, including a disruptive and complete splitting of UL/DL and C-/U-plane as well as a combined UL/DL and C-/U-plane splitting, by exploiting dual connectivity on CC microwave and DF mmWave bands. The outperformances of SBSA in terms of system level capacity, average spectral efficiency, energy efficiency, and control-plane overhead traffic capacity in comparison with different base stations based split architecture (DBSA) are shown. Finally, a number of technical and business perspectives as well as key research issues of SBSA are discussed.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Nasouri, Komeil, et Ahmad Mousavi Shoushtari. « Fabrication of magnetite nanoparticles/polyvinylpyrrolidone composite nanofibers and their application as electromagnetic interference shielding material ». Journal of Thermoplastic Composite Materials 31, no 4 (25 avril 2017) : 431–46. http://dx.doi.org/10.1177/0892705717704488.

Texte intégral
Résumé :
Magnetite (Fe3O4) nanoparticles/polyvinylpyrrolidone (PVP) composite nanofibers (FCNFs) have been fabricated to evaluate the potential of FCNFs as electromagnetic interference (EMI) shielding material in the frequency range of 8.2–12.4 GHz. The scanning electron microscope and viscosity analyses confirmed the presence of good dispersion Fe3O4 nanoparticles encapsulated within the electrospun nanofibers and showed FCNF morphologies with diameters of 150–500 nm. The magnetic properties and electrical conductivity of FCNFs were found to be dependent on Fe3O4 nanoparticles concentration and showed an increase with increasing Fe3O4 nanoparticles loading. The EMI shielding efficiency of FCNFs increased up to approximately 22 dB. The EMI shielding results for FCNFs showed that absorption was the major shielding mechanism and reflection was the secondary shielding mechanism. The present study has shown the possibility of utilizing magnetic FCNFs as EMI shielding/absorption materials.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Feng, Yadong, Chunhua Jiao, Yang Cao, Ye Zhao, Yanfang Chen, Lin Fang et Ruihua Shi. « A Comparison of a Fully Covered and an Uncovered Segmented Biodegradable Esophageal Stent in a Porcine Model : Preclinical Evaluation of Degradation, Complications, and Tissue Reactions ». Gastroenterology Research and Practice 2016 (2016) : 1–7. http://dx.doi.org/10.1155/2016/8690858.

Texte intégral
Résumé :
Aims. This study was to compare the degradation, complications, and tissue reactions of two segmented biodegradable esophageal stents in a porcine model.Methods. Uncovered biodegradable segmented stents and fully covered biodegradable segmented stents (FCBDS) were transplanted into the porcine esophagus lumen. Data on biodegradation, complications, and tissue reactions were collected and compared.Results. All animals kept good general conditions. No severe complications and stents migration occurred. Stents degradation commenced at week 3. Compared with uncovered stents, stents structure breakage and complete stents absorption in FCBDS were postponed for 1-2 weeks. Hyperplasia was prominent at early stage and ameliorated at late stage after stents insertion. Tissue reactions in FCBDS were milder than those in uncovered stents in the early stage. A longer degradation period was present in FCBDS than in uncovered stents, while FCBDS induced tissue reaction at late stage was mild.Conclusions. Biodegradable esophageal stents with a segmented trunk may be further evaluated in refractory benign esophagus strictures. This FCBDS may be advantageous compared with uncovered stents for a longer degradation period.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Xue, Hai, Kyung Tae Kim et Hee Yong Youn. « Packet Scheduling for Multiple-Switch Software-Defined Networking in Edge Computing Environment ». Wireless Communications and Mobile Computing 2018 (18 novembre 2018) : 1–11. http://dx.doi.org/10.1155/2018/7659085.

Texte intégral
Résumé :
Software-defined networking (SDN) decouples the control plane and data forwarding plane to overcome the limitations of traditional networking infrastructure. Among several communication protocols employed for SDN, OpenFlow is most widely used for the communication between the controller and switch. In this paper two packet scheduling schemes, FCFS-Pushout (FCFS-PO) and FCFS-Pushout-Priority (FCFS-PO-P), are proposed to effectively handle the overload issue of multiple-switch SDN targeting the edge computing environment. Analytical models on their operations are developed, and extensive experiment based on a testbed is carried out to evaluate the schemes. They reveal that both of them are better than the typical FCFS-Block (FCFS-BL) scheduling algorithm in terms of packet wait time. Furthermore, FCFS-PO-P is found to be more effective than FCFS-PO in the edge computing environment.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Grosof, Isaac, Kunhe Yang, Ziv Scully et Mor Harchol-Balter. « Nudge : Stochastically Improving upon FCFS ». Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, no 2 (juin 2021) : 1–29. http://dx.doi.org/10.1145/3460088.

Texte intégral
Résumé :
The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about the asymptotic tail? What if we also care about the 99th percentile of response time, or the fraction of jobs that complete in under one second? Is FCFS still best? Outside of the asymptotic regime, only loose bounds on the tail of FCFS are known, and optimality is completely open. In this paper, we introduce a new policy, Nudge, which is the first policy to provably stochastically improve upon FCFS. We prove that Nudge simultaneously improves upon FCFS at every point along the tail, for light-tailed job size distributions. As a result, Nudge outperforms FCFS for every moment and every percentile of response time. Moreover, Nudge provides a multiplicative improvement over FCFS in the asymptotic tail. This resolves a long-standing open problem by showing that, counter to previous conjecture, FCFS is not strongly asymptotically optimal.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Grosof, Isaac, Kunhe Yang, Ziv Scully et Mor Harchol-Balter. « Nudge : Stochastically Improving upon FCFS ». ACM SIGMETRICS Performance Evaluation Review 49, no 1 (22 juin 2022) : 11–12. http://dx.doi.org/10.1145/3543516.3460102.

Texte intégral
Résumé :
The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about the asymptotic tail? What if we also care about the 99th percentile of response time, or the fraction of jobs that complete in under one second? Is FCFS still best? Outside of the asymptotic regime, only loose bounds on the tail of FCFS are known, and optimality is completely open. In this paper, we introduce a new policy, Nudge, which is the first policy to provably stochastically improve upon FCFS. We prove that Nudge simultaneously improves upon FCFS at every point along the tail, for light-tailed job size distributions. As a result, Nudge outperforms FCFS for every moment and every percentile of response time. Moreover, Nudge provides a multiplicative improvement over FCFS in the asymptotic tail. This resolves a long-standing open problem by showing that, counter to previous conjecture, FCFS is not strongly asymptotically optimal. This paper represents an abridged version of [2].
Styles APA, Harvard, Vancouver, ISO, etc.
7

Qi, Ke, Yamin Dang, Changhui Xu et Shouzhou Gu. « Performance Analysis of BDS-3 FCB Estimated by Reference Station Networks over a Long Time ». Mathematics 10, no 19 (2 octobre 2022) : 3610. http://dx.doi.org/10.3390/math10193610.

Texte intégral
Résumé :
The stability and validity of the BDS-3 precise point positioning ambiguity solution (PPP-AR) is becoming more and more important along with the development of BDS-3 orbit and clock products over long durations. Satellite phase fractional cycle biases (FCBs) are key in PPP-AR, so it is important to ensure the validity and stability of FCBs over a long duration. In this study, we analyzed the validity and stability of BDS-3 phase FCBs by estimating them. The BDS-3 FCB experiments showed that BDS-3 FCBs have the same stability as GPS/GAL/BDS-2. BDS-3 widelane (WL) FCBs also have stable characteristics and the maximal fluctuation value of WL FCBs was found to be 0.2 cycles in a month. BDS-3 narrowlane (NL) FCBs were found to be unstable and the maximal fluctuation value of NL FCBs was more than 0.25 cycles over one day. Analyzing the posteriori residual errors of BDS-3 WL and NL ambiguities showed that the BDS-3 FCBs had the same accuracy as GPS/GAL/BDS-2. However, the ambiguity-fixed rate of BDS-3 was about 70%, which was less than GPS/GAL/BDS-2 in PPP-AR experiments. For this reason, we analyzed the quality of data and the accuracy of orbit and clock products by using different analysis center products. The results showed that the low accuracy of the BDS-3 orbit and clock products was the main reason for the low-ambiguity fixed rate.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Hoopes, David G., et Danny Miller. « Ownership Preferences, Competitive Heterogeneity, and Family-Controlled Businesses ». Family Business Review 19, no 2 (juin 2006) : 89–101. http://dx.doi.org/10.1111/j.1741-6248.2006.00064.x.

Texte intégral
Résumé :
This article models ownership concentration, owner preferences, and competitive advantage. It argues that ownership structure and owner preferences can give rise to resources and capabilities that increase firm profits. The model is then used to explain how successful family-controlled businesses (FCBs) differ from firms with less concentrated ownership and less successful FCBs. Because of their ownership concentration and reduced monitoring costs, many FCBs will have a resource surplus. That surplus and the tendency toward long-term investment among some FCBs create unique competitive opportunities under conditions we specify.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Rasool, Saman, et Ritika Gakher. « Reformed FCFS Disk Scheduling Algorithm ». International Journal of Computer Applications 127, no 13 (15 octobre 2015) : 38–41. http://dx.doi.org/10.5120/ijca2015906592.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Lee, Chun-Yao, et Wen-Cheng Lin. « Induction Motor Fault Classification Based on FCBF-PSO Feature Selection Method ». Applied Sciences 10, no 15 (4 août 2020) : 5383. http://dx.doi.org/10.3390/app10155383.

Texte intégral
Résumé :
This study proposes a fast correlation-based filter with particle-swarm optimization method. In FCBF–PSO, the weights of the features selected by the fast correlation-based filter are optimized and combined with backpropagation neural network as a classifier to identify the faults of induction motors. Three significant parts were applied to support the FCBF–PSO. First, Hilbert–Huang transforms were used to analyze the current signals of motor normal, bearing damage, broken rotor bars and short circuits in stator windings. Second, ReliefF, symmetrical uncertainty and FCBF three feature-selection methods were applied to select the important features after the feature was captured. Moreover, the accuracy comparison was performed. Third, particle-swarm optimization (PSO) was combined to optimize the selected feature weights which were used to obtain the best solution. The results showed excellent performance of the FCBF–PSO for the induction motor fault classification such as had fewer feature numbers and better identification ability. In addition, the analyzed of the induction motor fault in this study was applied with the different operating environments, namely, SNR = 40 dB, SNR = 30 dB and SNR = 20 dB. The FCBF–PSO proposed by this research could also get the higher accuracy than typical feature-selection methods of ReliefF, SU and FCBF.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "FCBFS"

1

Tirmazi, Syed Hasnain Raza, et Shashank Sharma. « Switched multi-hop FCFS networks - the influence of traffic shapers on soft real-time performance ». Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-4428.

Texte intégral
Résumé :

In the past 10 years, the bandwidths and processing capabilities of the networks have increased dramatically. The number of real-time applications using these networks has also increased. The large number of real-time packets might, in a switched multi-hop network, lead to unpredictable traffic patterns. This is not a problem when the traffic intensity is low, but if the same network is used by a large number of users simultaneously, the overall performance of the network degrades. In fact, unpredictable delays in the delivery of the message can adversely affect the execution of the tasks dependent on these messages, even if we take into account the soft real-time performance.

In this paper, we investigate the effect of traffic shapers on soft real-time performance. We will consider a switched multi-hop network with FCFS queues. We will implement two versions of the network simulator. One version will be without traffic shaper and the other version will use a traffic shaper. By comparing the results (for average delay, deadline miss ratio etc.) from both the versions, we will try to conclude if it is really beneficial to use traffic shapers for soft real-time performance. Leaky bucket and token bucket algorithms are the most popular ones for traffic shaper implementation. We will consider leaky bucket algorithm for our analysis. We analyse different versions of the leaky bucket and present the trade-off’s involved.

Styles APA, Harvard, Vancouver, ISO, etc.
2

Mendonca, Fernando. « Politiques polyvalentes et efficientes d'allocation de ressources pour les systèmes parallèles ». Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM021/document.

Texte intégral
Résumé :
Les plateformes de calcul à grande échelle ont beaucoup évoluées dernières années. La réduction des coûts des composants simplifie la construction de machines possédant des multicœurs et des accélérateurs comme les GPU.Ceci a permis une propagation des plateformes à grande échelle,dans lesquelles les machines peuvent être éloignées les unes des autres, pouvant même être situées sur différents continents. Le problème essentiel devient alors d'utiliser ces ressources efficacement.Dans ce travail nous nous intéressons d'abord à l'allocation efficace de tâches sur plateformes hétérogènes composées CPU et de GPU. Pour ce faire, nous proposons un outil nommé SWDUAL qui implémente l'algorithme de Smith-Waterman simultanément sur CPU et GPU, en choisissant quelles tâches il est plus intéressant de placer sur chaque type de ressource. Nos expériences montrent que SWDUAL donne de meilleurs résultats que les approches similaires de l'état de l'art.Nous analysons ensuite une nouvelle méthode d'ordonnancement enligne de tâches indépendantes de différentes tailles. Nous proposons une nouvelle technique qui optimise la métrique du stretch. Elle consiste à déplacer les jobs qui retardent trop de petites tâches sur des machines dédiées. Nos résultats expérimentaux montrent que notre méthode obtient de meilleurs résultats que la politique standard et qu'elle s'approche dans de nombreux cas des résultats d'une politique préemptive, qui peut être considérée comme une borne inférieure.Nous nous intéressons ensuite à l'impact de différentes contraintes sur la politique FCFS avec backfilling. La contrainte de contiguïté essaye de compacter les jobs et de réduire la fragmentation dans l'ordonnancement. La contrainte de localité basique place les jobs de telle sorte qu'ils utilisent le plus petit nombre de groupes de processeurs appelés textit. Nos résultats montrent que les bénéfices de telles contraintes sont suffisants pour compenser la réduction du nombre de jobs backfillés due à la réduction de la fragmentation.Nous proposons enfin une nouvelle contrainte nommée localité totale, dans laquelle l'ordonnanceur modélise la plateforme par un fat tree et se sert de cette information pour placer les jobs là où leur coût de communication est minimal.Notre campagne d'expériences montre que cette contrainte obtient de très bons résultats par rapport à un backfilling basique, et de meilleurs résultats que les contraintes précédentes
The field of parallel supercomputing has been changing rapidly inrecent years. The reduction of costs of the parts necessary to buildmachines with multicore CPUs and accelerators such as GPUs are ofparticular interest to us. This scenario allowed for the expansion oflarge parallel systems, with machines far apart from each other,sometimes even located on different continents. Thus, the crucialproblem is how to use these resources efficiently.In this work, we first consider the efficient allocation of taskssuitable for CPUs and GPUs in heterogeneous platforms. To that end, weimplement a tool called SWDUAL, which executes the Smith-Watermanalgorithm simultaneously on CPUs and GPUs, choosing which tasks aremore suited to one or another. Experiments show that SWDUAL givesbetter results when compared to similar approaches available in theliterature.Second, we study a new online method for scheduling independent tasksof different sizes on processors. We propose a new technique thatoptimizes the stretch metric by detecting when a reasonable amount ofsmall jobs is waiting while a big job executes. Then, the big job isredirected to separate set of machines, dedicated to running big jobsthat have been redirected. We present experiment results that show thatour method outperforms the standard policy and in many cases approachesthe performance of the preemptive policy, which can be considered as alower bound.Next, we present our study on constraints applied to the Backfillingalgorithm in combination with the FCFS policy: Contiguity, which is aconstraint that tries to keep jobs close together and reducefragmentation during the schedule, and Basic Locality, that aims tokeep jobs as much as possible inside groups of processors calledclusters. Experiment results show that the benefits of using theseconstrains outweigh the possible decrease in the number of backfilledjobs due to reduced fragmentation.Finally, we present an additional constraint to the Backfillingalgorithm called Full Locality, where the scheduler models the topologyof the platform as a fat tree and uses this model to assign jobs toregions of the platform where communication costs between processors isreduced. The experiment campaign is executed and results show that FullLocality is superior to all the previously proposed constraints, andspecially Basic Backfilling
Styles APA, Harvard, Vancouver, ISO, etc.
3

Cherry, Brian B. « Characterizing the Three-Dimensional Behavior of Bistable Micromechanisms ». Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2274.pdf.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

BUIATTI-TCHENG, MURIEL. « Implications des fcfs (fibroblast growth factors) dans la croissance, la differenciation et la transdifferenciation des cellules de retine d'embryons de poulet ». Paris 6, 1993. http://www.theses.fr/1993PA066525.

Texte intégral
Résumé :
La retine est a la fois la source et un tissu cible privilegie des formes acide et basique des fgfs (fibroblast growth factor). Ces facteurs stimulent la proliferation des neuroblastes, la differenciation des cellules gliales ainsi que leur survie. La retine neurale de poulet a la capacite de se transdifferencier en corps lentoidiens riches en cristallines et en cellules epitheliales pigmentees. Le but de ce travail a ete d'etudier les roles et implications des fgfs dans les processus de differenciation et transdifferenciation de la retine de poulet. Nous avons prealablement etudie par hybridation northern et hybridation in situ (his) la presence de deux types de recepteurs, fgf-r1 et fgf-r2 dans la retine de poulet pendant sa formation. Les etudes d'his montrent pour les deux recepteurs l'existence d'un marquage dans les trois couches nucleaires de la retine et la couche des segments internes des photorecepteurs. Nous avons ensuite effectue une recherche des marqueurs de differenciation des cellules de retine de poulet. Nous nous sommes ensuite attaches a l'etude de l'action directe de fgfa et fgfb sur des cultures de cellules dissociees de retine neurale et de retine epitheliale pigmentee d'embryons de poulet de differents stades. La proliferation cellulaire a ete evaluee par comptage et par incorporation de thymidine tritiee. Les populations cellulaires presentes ont ete identifiees par immunohistochimie. Les proteines accumulees et neosynthetisees dans ces cultures ont ete etudiees et plus particulierement la quantite de fgfa presente et l'activite acetylcholine esterase
Styles APA, Harvard, Vancouver, ISO, etc.
5

Kumar, Nachegari Kishore, et Eadi Suresh Babu. « Simulation of Switched Ethernet ». Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-231.

Texte intégral
Résumé :

Switched Ethernet is an Ethernet LAN that uses switches to connect individual nodes.

This is popular because of its effective and convenient way of extending the bandwidth of

existing Ethernets. Switched Ethernet is being considered by the industry community because

of its open standardization, cost effectiveness, and the support for higher data rates up to

10Gbps. Even though many special-purposed solutions were proposed to support time

constrained communication over Switched Ethernet, still there were some doubts about the

real time handling capability of Switched Ethernet. To achieve reliable transmission

guarantees for real time traffic over Switched Ethernet, it is important to measure the

performance of Switched Ethernet networks for real time communication. In this thesis work

we have observed the average end-to-end packet delay for real time traffic over a Switched

Ethernet by simulation, which is very much essential for real time communication in

industrial applications, where the communication is time-deterministic. In our thesis we used

FCFS priority queuing in both the source nodes and switch. In this thesis we also discussed

about the feasibility analysis for fixed sized frames and some traffic handling methods. We

used 100mbp/s single full duplex Ethernet switch for our simulation. Finally simulation

analysis and simulation results are discussed. Our purpose of simulation of Switched Ethernet

networks is of good importance for the real time industrial applications.

Styles APA, Harvard, Vancouver, ISO, etc.
6

Ninjbat, Uuganbaatar. « Essays on Mathematical Economics ». Doctoral thesis, Handelshögskolan i Stockholm, Institutionen för Nationalekonomi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hhs:diva-2233.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Fan, Xing. « Real-Time Services in Packet-Switched Networks for Embedded Applications ». Doctoral thesis, Högskolan i Halmstad, Centrum för forskning om inbyggda system (CERES), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-1984.

Texte intégral
Résumé :
Embedded applications have become more and more complex, increasing the demands on the communication network. For reasons such as safety and usability, there are real-time constraints that must be met. Also, to offer high performance, network protocols should offer efficient user services aimed at specific types of communication. At the same time, it is desirable to design and implement embedded networks with reduced cost and development time, which means using available hardware for standard networks. To that end, there is a trend towards using switched Ethernet for embedded systems because of its hight bit rate and low cost. Unfortunately, since switched Ethernet is not specifically designed for embedded systems, it has several limitations such as poor support for QoS because of FCFS queuing policy and high protocol overhead. This thesis contributes towards fulfilling these requirements by developing (i) real-time analytical frameworks for providing QoS guarantees in packet-switched networks and (II) packet-merging techniques to reduce the protocol overhead. We have developed two real-time analytical frameworks for networks with FCFS queuing in the switches, one for FCFS queuing in the source nodes and one for EDF queuing in the source nodes. The correctness and tightness of the real-time analytical frameworks for different network components in a singel-switch neetwork are given by strict theoretical proofs, and the performance of our end-to-end analyses is evaluated by simulations. In conjunction with this, we have compared our results to Network Calculus (NC), a commonly used analytical scheme for FCFS queuing. Our comparison study shows that our anlysis is more accurate than NC for singel-switch networks. To reduce the protocol overhead, we have proposed two active switched Ethernet approaches, one for real-time many-to-many communication and the other for the real-time short message traffic that is often present in embedded applications. A significant improvement in performance achieved by using our proposed active networks is demonstrated. Although our approaches are exemplified using switched Ethernet, the general approaches are not limited to switched Ethernet networks but can easily be moified to other similar packet-switched networks.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Maiyama, Kabiru M. « Performance Analysis of Virtualisation in a Cloud Computing Platform. An application driven investigation into modelling and analysis of performance vs security trade-offs for virtualisation in OpenStack infrastructure as a service (IaaS) cloud computing platform architectures ». Thesis, University of Bradford, 2019. http://hdl.handle.net/10454/18587.

Texte intégral
Résumé :
Virtualisation is one of the underlying technologies that led to the success of cloud computing platforms (CCPs). The technology, along with other features such as multitenancy allows delivering of computing resources in the form of service through efficient sharing of physical resources. As these resources are provided through virtualisation, a robust agreement is outlined for both the quantity and quality-of-service (QoS) in a service level agreement (SLA) documents. QoS is one of the essential components of SLA, where performance is one of its primary aspects. As the technology is progressively maturing and receiving massive acceptance, researchers from industry and academia continue to carry out novel theoretical and practical studies of various essential aspects of CCPs with significant levels of success. This thesis starts with the assessment of the current level of knowledge in the literature of cloud computing in general and CCPs in particular. In this context, a substantive literature review was carried out focusing on performance modelling, testing, analysis and evaluation of Infrastructure as a Service (IaaS), methodologies. To this end, a systematic mapping study (SMSs) of the literature was conducted. SMS guided the choice and direction of this research. The SMS was followed by the development of a novel open queueing network model (QNM) at equilibrium for the performance modelling and analysis of an OpenStack IaaS CCP. Moreover, it was assumed that an external arrival pattern is Poisson while the queueing stations provided exponentially distributed service times. Based on Jackson’s theorem, the model was exactly decomposed into individual M/M/c (c ≥ 1) stations. Each of these queueing stations was analysed in isolation, and closed-form expressions for key performance metrics, such as mean response time, throughput, server (resource) utilisation as well as bottleneck device were determined. Moreover, the research was extended with a proposed open QNM with a bursty external arrival pattern represented by a Compound Poisson Process (CPP) with geometrically distributed batches, or equivalently, variable Generalised Exponential (GE) interarrival and service times. Each queueing station had c (c ≥ 1) GE-type servers. Based on a generic maximum entropy (ME) product form approximation, the proposed open GE-type QNM was decomposed into individual GE/GE/c queueing stations with GE-type interarrival and service times. The evaluation of the performance metrics and bottleneck analysis of the QNM were determined, which provided vital insights for the capacity planning of existing CCP architectures as well as the design and development of new ones. The results also revealed, due to a significant impact on the burstiness of interarrival and service time processes, resulted in worst-case performance bounds scenarios, as appropriate. Finally, an investigation was carried out into modelling and analysis of performance and security trade-offs for a CCP architecture, based on a proposed generalised stochastic Petri net (GSPN) model with security-detection control model (SDCM). In this context, ‘optimal’ combined performance and security metrics were defined with both M-type or GE-type arrival and service times and the impact of security incidents on performance was assessed. Typical numerical experiments on the GSPN model were conducted and implemented using the Möbius package, and an ‘optimal’ trade-offs were determined between performance and security, which are crucial in the SLA of the cloud computing services.
Petroleum technology development fund (PTDF) of the government of Nigeria Usmanu Danfodiyo University, Sokoto
Styles APA, Harvard, Vancouver, ISO, etc.
9

YADAV, RAJIV. « EVOLUTIONARY ALGORITHMS FOR IMPROVING ENERGY EFFICIENCY AND SECURITY IN WIRELESS SENSOR NETWORKS ». Thesis, 2023. http://dspace.dtu.ac.in:8080/jspui/handle/repository/20396.

Texte intégral
Résumé :
Wireless Sensor Network (WSN) finds vast real-world applications in the field of energy control, security, health care, defense, and environment monitoring. WSNs are subdued by limited power with a specific battery backup. Due to the large distance between Sensor Nodes (SNs) and the sink, more power consumption occurs in the sensors. The limited energy of SNs is a major drawback to empower a large network coverage area. Therefore, the battery life and location of Cluster Heads (CHs) play an important role in increasing the efficiency and lifetime of SNs for long-term operation in WSNs. Researchers face significant challenges in developing more energy-efficient and secure clustering and routing protocols for WSNs. The bulk of existing routing protocols focuses on CH election while disregarding other important aspects of routing including cluster formation, data aggregation, and security, among others. Nature-inspired algorithms like Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Gray Wolf Optimization (GWO), and Butterfly Optimization Algorithm (BOA) have been used for addressing important challenges in WSNs, such as sensor lifespan, transmission distance, and energy consumption. The introduction of hybrid techniques has proven to be more effective. Hybrid techniques like GA PSO, PSO-ACO, PSO-GWO, etc. have gained traction as viable solutions for bio inspired algorithms to improve the energy efficiency of WSNs. Such techniques have been found more optimum in comparison to the conventional techniques. The present thesis focuses on comparative analysis of hybridization techniques with conventional techniques for improving the energy efficiency of WSNs. In addition, an Improved Butterfly Optimization Algorithm (IBOA) has been proposed for global optimization problems in WSNs. Lastly, the present thesis focuses on addressing threats and security issues in WSNs through a feature selection and Machine Learning (ML) based intrusion detection pipeline. The Fast Correlation based Feature Selection (FCBFS) has been utilized as the feature selection method. The ML classifiers include Decision Tree (DT), Random Forest (RF), ix Naïve Bays (NB), Extra Tree (ET), and Extreme Gradient Boosting (XG-Boost). The contributions presented in this thesis are outlined below: • We propose a comprehensive review of Bio-inspired Hybrid Optimization Algorithms for Energy-Efficient WSN. We have aimed to discuss and compare various newly implemented, conventional, and hybrid methodologies for establishing a robust energy-efficient WSN wherein parameters like packet loss, energy, throughput, delay, and overhead have been utilized. Various open issues and challenges in WSN development using bio-inspired optimization techniques such as network stability, network dynamic character, secure transmission lines, methods to improve QoS, etc., have been addressed. • We propose a variable sensor modality IBOA for global optimization problems. The modified optimization approach focuses on unconstrained issues, performs on restricted problems, and remains the future scope of this work. • We propose an FCBFS method with XG-Boost for the National Security Laboratory-Knowledge Discovery Dataset (NSL-KDD) intrusion detection benchmark dataset to address the threats and security issues in a complicated WSN for IoT applications. Evaluation metrics such as accuracy, precision, recall, and F1-Score have been calculated to gauge the performance and robustness of the proposed research work. A classic accuracy score of 99.84% is achieved in the case of the XG-Boost classifier, wherein the best ten obtained features were selected after applying the proposed FCBFS. The proposed technique, which has ten features, outperforms the existing techniques in the literature for the NSL-KDD dataset. Experimental analysis has been done extensively to prove the efficacy of the developed solutions.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Lin, Jung-Jyh, et 林忠誌. « QoS Control by Modified FCFS Scheme in ATM Networks ». Thesis, 1997. http://ndltd.ncl.edu.tw/handle/49144717669963650579.

Texte intégral
Résumé :
碩士
國立清華大學
資訊科學研究所
85
Multiple services with heterogeneous Quality Of Services (QoS) requirements are supported in ATM networks. The cell scheduling discipline is needed to utilize the network resources efficiently and guarantee the QoS requirements. FCFS is the simplest and easiest scheme for hardware implemeyntation. However, because of its lack of support of prioritizing scheme and inefficiency of buffer usage, it is not suitable to support QoS -guarantee servics .Therefore, a modified FCFS scheme with QoSguarantee is proposed in this paper. Inheriting the simplicity of FCFS, we modify the FIFO by adding adaptive queues for priority handing to satisfy the diverse QoS requirements. The buffer sizes of the adaptive queues could be decided by the traffic load and cell delay constraint to grarantee the cell loss rate. As a result, the proposed modified FIFO scheme is simple in hardware implementation, while it has the ability to handle multiple QoS priorities. The performance evaluation shows that the accessible offered load in our proposed scheme is better than the others proposed before.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "FCBFS"

1

Nicol, David M. Parallel discrete-event simulation of FCFS stochastic queueing networks. Hampton, Va : ICASE, 1988.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Conolly, Brian. Single and double FCFS M/M/Models with two classes of customer and no priority. London : Queen Mary College, Department of Computer Science and Statistics, 1987.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Alister, Ward Sheila Henderson. Forestry Statistics 2002 (Forestry Statistics (FCFS)). Forestry Commission, 2002.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

National Aeronautics and Space Administration (NASA) Staff. Parallel Discrete-Event Simulation of Fcfs Stochastic Queueing Networks. Independently Published, 2018.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "FCBFS"

1

Nishihiro, Jun, Shohei Koike et Atsushi Ono. « Biodiversity Conservation through Various Citizen Activities in a Flood Control Basin ». Dans Ecological Research Monographs, 225–36. Singapore : Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-6791-6_14.

Texte intégral
Résumé :
AbstractFlood control basins (FCBs) are artificially constructed facilities with the potential to conserve the biodiversity of floodplain ecosystems. However, the intensity of disturbance in FCBs is generally lower than that in natural floodplains; thus, habitats for plants with disturbance-dependent life histories and for animals that use temporary waters or mudflats can be lost in the years following FCB construction. Here, the Asahata FCB in Shizuoka city, Japan, was studied as an example, where the species diversity of wetland plants has been conserved as a result of diverse activities. Although most activities had objectives other than biodiversity conservation, they contributed to conserving plant diversity and providing habitats for endangered plants. The FCB is a green infrastructure that not only enables flood control but also supports activities for various purposes. Additionally, its proper use contributes to biodiversity conservation.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Harrison, P. G., et E. Pitel. « M/G/1 Queues with FCFS Negative Arrivals ». Dans Quantitative Methods in Parallel Systems, 153–60. Berlin, Heidelberg : Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-79917-4_10.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Bonuccelli, Maurizio A., et Alessandro Urpi. « A Multicast FCFS Output Queued Switch without Speedup ». Dans NETWORKING 2002 : Networking Technologies, Services, and Protocols ; Performance of Computer and Communication Networks ; Mobile and Wireless Communications, 1057–68. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_86.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Zhang, Hong-lei, Bo-tang Han, Jing-chao Xu et Yu Feng. « Preparation of the Public Bus Schedule Based on FCFS ». Dans Proceedings of 20th International Conference on Industrial Engineering and Engineering Management, 1021–29. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40063-6_100.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Magdalene, R., et D. Sridharan. « Comparative Analysis of FCFS and SJF for Multimedia Process Scheduling ». Dans Lecture Notes in Electrical Engineering, 639–46. Singapore : Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3992-3_54.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Jayanti, Prasad, Srdjan Petrovic et Neha Narula. « Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion ». Dans SOFSEM 2005 : Theory and Practice of Computer Science, 209–18. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30577-4_24.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Bruneel, Herwig, Tom Maertens, Bart Steyaert, Dieter Claeys, Dieter Fiems et Joris Walraevens. « Analysis of a Two-Class FCFS Queueing System with Interclass Correlation ». Dans Analytical and Stochastic Modeling Techniques and Applications, 32–46. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30782-9_3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Boualem, Mohamed, Mouloud Cherfaoui, Natalia Djellab et Djamil Aïssani. « Stochastic Analysis of an M/G/1 Retrial Queue with FCFS ». Dans Functional Statistics and Applications, 127–39. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22476-3_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Li, Hongguang, Ying Guo, Zisen Qi, Ping Sui et Linghua Su. « Fingerprint Feature Recognition of Frequency Hopping Radio with FCBF-NMI Feature Selection ». Dans Lecture Notes in Electrical Engineering, 819–31. Singapore : Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-13-9409-6_96.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Legato, Pasquale, et Rina Mary Mazza. « Class Aggregation for Multi-class Queueing Networks with FCFS Multi-server Stations ». Dans Queueing Theory and Network Applications, 221–39. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-27181-7_14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "FCBFS"

1

Liu, Tuanjie, Xiaohong Chen et Wei Ye. « Concept Selection Philosophy for Floating Control Facilities ». Dans ASME 2010 29th International Conference on Ocean, Offshore and Arctic Engineering. ASMEDC, 2010. http://dx.doi.org/10.1115/omae2010-20805.

Texte intégral
Résumé :
Floating control facilities (FCFs) are designed to support fields using only subsea production system. Potential concepts, including Tension Leg Platform (TLP), Spar and semi-submersible can be selected as the FCFs. This paper discusses the philosophy of concept selection for FCFs. Two basic considerations for concept selection for FCFs are functional requirements and costs. Different structure types are first to be sized to meet the functional requirements for given water depths, environmental conditions and soil conditions. Then the costs for the procurement, construction, installation, hook up and commissioning for different concepts are estimated based on the sizes. Finally, the most cost-effective concept is chosen for further study to confirm the feasibilities of the concept by detailed analyses. Global sizing tools assisting concept selection have been developed by Ocean Dynamics LLC (Limited Liability Company) (ODL) over the past years. For a given concept, these sizing tools can find the optimized size based on costs to meet the functional requirements. Capabilities of the sizing tools cover the general layout, weight estimate (hull and deck), riser weight and stiffness estimate, loading conditions (transportation, normal operating, extreme, survival), hydrostatics and stability, natural periods, motions, air gap, environmental loads (wind, current, and mean wave forces), mooring sizing, cost estimate, and optimization based on the total costs. Two case studies in two different water depths, 140m and 1200m, are presented to illustrate the procedures and considerations in concept selection for floating control facilities. The FCFs used in the case studies are to support a Super Puma helideck, satellite communication equipment, an umbilical riser and option for a 3.5″ pipeline riser, with a total estimated topside payload as 400 Metric Ton (MT).
Styles APA, Harvard, Vancouver, ISO, etc.
2

Grosof, Isaac, Kunhe Yang, Ziv Scully et Mor Harchol-Balter. « Nudge : Stochastically Improving upon FCFS ». Dans SIGMETRICS '21 : ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA : ACM, 2021. http://dx.doi.org/10.1145/3410220.3460102.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Jiang, Hong, et Tianwei Ni. « PB-FCFS-a task scheduling algorithm based on FCFS and backfilling strategy for grid computing ». Dans 2009 Joint Conferences on Pervasive Computing (JCPC). IEEE, 2009. http://dx.doi.org/10.1109/jcpc.2009.5420131.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Peng, Ya-Pei, Lina Suo, Haimiao Zhou, Shijie Ren, Xinhe Lu et Nan-Kuang Chen. « High-sensitivity multicore-fiber strain sensors based on asymmetric supermodes interference ». Dans Conference on Lasers and Electro-Optics/Pacific Rim. Washington, D.C. : Optica Publishing Group, 2022. http://dx.doi.org/10.1364/cleopr.2022.cwp17b_05.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Adan, Ivo, Rhonda Righter et Gideon Weiss. « FCFS Parallel Service Systems and Matching Models ». Dans VALUETOOLS 2017 : 11th EAI International Conference on Performance Evaluation Methodologies and Tools. New York, NY, USA : ACM, 2017. http://dx.doi.org/10.1145/3150928.3150951.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Li, Wenzheng, et Hongyan Shi. « Dynamic Load Balancing Algorithm Based on FCFS ». Dans 2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC). IEEE, 2009. http://dx.doi.org/10.1109/icicic.2009.182.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Gore, Ashutosh Deepak, et Abhay Karandikar. « Power Controlled FCFS Splitting Algorithm for Wireless Networks ». Dans MILCOM 2007 - IEEE Military Communications Conference. IEEE, 2007. http://dx.doi.org/10.1109/milcom.2007.4454867.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Nicol, David M. « Parallel discrete-event simulation of FCFS stochastic queueing networks ». Dans the ACM/SIGPLAN conference. New York, New York, USA : ACM Press, 1988. http://dx.doi.org/10.1145/62115.62128.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Ying, Cuan, Gaowei Wang et Hang Li. « Design of Feature Selection Algorithm Based on Improved FCBF ». Dans 2021 6th International Conference on Intelligent Computing and Signal Processing (ICSP). IEEE, 2021. http://dx.doi.org/10.1109/icsp51882.2021.9408729.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Guo, Jian, Peng Ge, Weidong Jin et Wenqiang Zhang. « Radar Signal Recognition Based on FCBF and AdaBoost Algorithm ». Dans 2018 37th Chinese Control Conference (CCC). IEEE, 2018. http://dx.doi.org/10.23919/chicc.2018.8483351.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "FCBFS"

1

Nordmark, E., M. Bagnulo et E. Levy-Abegnoli. FCFS SAVI : First-Come, First-Served Source Address Validation Improvement for Locally Assigned IPv6 Addresses. RFC Editor, mai 2012. http://dx.doi.org/10.17487/rfc6620.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « FCBFS » pour d’autres types de sources :
Articles de revues Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie