Filtreler

2006 - 200932010 - 20121
Filtreleri Sıfırla

Ayarlar

Bölüm: Işık University, Faculty of Engineering, Department of Computer Engineering × Konu: Computer simulation ×

Arama Sonuçları

Listeleniyor 1 - 4 / 4
  • Küçük Resim
    Yayın
    A priority based packet scheduler with deadline considerations
    (IEEE Computer Soc, 2006) Dağ, Tamer; Gökgöl, Oral
    QoS issues have become a focal point of research on Next Generation Networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper introduces a new kind of packet scheduler which tries to integrate an important QoS parameter (the delay) with the classical schedulers. The two sets of algorithms introduced; Static Priority with Deadline Considerations (SPD) and Dynamic Priority with Deadline Considerations (DPD); not only simplify the complexity and overhead of a classical Earliest Deadline First (EDF) or Static Priority (SP) algorithm, but also provide a better QoS based on the results of the simulations conducted.
  • Küçük Resim
    Yayın
    Colored simultaneous geometric embeddings
    (Springer-Verlag Berlin, 2007) Brandes, Ulrik; Erten, Cesim; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios
    We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored paths and (2) a 2-colored outerplanar graph together with any number of 2-colored paths. We also show that there does not exist a universal pointset of size n for paths colored with five colors. We finally show that the following simultaneous embeddings are not possible: (1) three 6-colored cycles, (2) four 6-colored paths, and (3) three 9-colored paths.
  • Küçük Resim
    Yayın
    Cost-conscious comparison of supervised learning algorithms over multiple data sets
    (Elsevier Sci Ltd, 2012-04) Ulaş, Aydın; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem
    In the literature, there exist statistical tests to compare supervised learning algorithms on multiple data sets in terms of accuracy but they do not always generate an ordering. We propose Multi(2)Test, a generalization of our previous work, for ordering multiple learning algorithms on multiple data sets from "best" to "worst" where our goodness measure is composed of a prior cost term additional to generalization error. Our simulations show that Multi2Test generates orderings using pairwise tests on error and different types of cost using time and space complexity of the learning algorithms.
  • Küçük Resim
    Yayın
    The routine design-modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies
    (Cambridge University Press, 2008-12-12) Eskil, Mustafa Taner; Sticklen, Jon; Radcliffe, Clark
    In this paper we describe a conceptual framework and implementation of a tool that supports task-directed, distributed routine design (RD) augmented with simulation-based design testing. In our research, we leverage the modular distributed modeling (MDM) methodology to simulate the interaction of design components in an assembly. The major improvement we have made in the RD methodology is to extend it with the capabilities of incorporating remotely represented off-the-shelf components in design and simulation-based testing of a distributed assembly. The deliverable of our research is the RD-MDM platform, which is capable of automatically selecting intellectually protected off the shelf design components over the Internet, integrating these components in an assembly, running simulations for design testing, and publishing the approved design without disclosing the proprietary information.