Yayın tarihi için Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 188, listelenen: 1-20
-
A designing practice and two coding practices for extreme programming (XP)
(Springer Verlag, 2003)This paper introduces three new XP practices and reports the experience of applying them to web based software development. These are issue- based programming, comment-first coding and just in time code ownership. The ... -
Error propagation through generalized high dimensional model representation for data partitioning
(Wiley-V C H Verlag GMBH, 2004)In many circumstances the explicit form of a multivariate function is not known; rather a finite number of data is listed from some physical experiments. In such cases a function can be constructed only by imposing some ... -
Design of real-time VBR traffic shaping schemes by considering the impact of both buffer overflows and deadline violations
(Int Inst Informatics & Systemics, 2005)While smoothing the traffic of time sensitive applications at the user premises can reduce the losses due to buffer overflows within the network, it may have an adverse effect on the losses due to the deadline violations ... -
QoS-constrained core selection for group communication
(IEEE, 2005)The core-based approach in multipoint communication enhances the solution space in terms of QoS-efficiency of solutions in inter and intra-domain routing. In an earlier work [KH04], we showed that the constrained cost ... -
A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid
(Elsevier Science inc, 2005-05-25)When the values of a multivariate function f(x(1),...,x(N)), having N independent variables like x(1),...,x(N) are given at the nodes of a cartesian, product set in the space of the independent variables and ail interpolation ... -
A priority based packet scheduler with deadline considerations
(IEEE Computer Soc, 2006)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 ... -
ICamp - The educational web for higher education
(Springer Verlag, 2006)iCamp is an EC-funded research project in the area of Technology Enhanced Learning (TEL) that aims to support collaboration and social networking across systems, countries and disciplines in higher education. The concept ... -
Force-directed approaches to sensor localization
(SIAM, 2006)We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information ... -
Hybrid high dimensional model representation (HHDMR) on the partitioned data
(Elsevier B.V., 2006-01-01)A multivariate interpolation problem is generally constructed for appropriate determination of a multivariate function whose values are given at a finite number of nodes of a multivariate grid. One way to construct the ... -
An interoperability infrastructure for distributed feed networks
(2007)Blogs have the affordance to become an integral part of teaching and learning processes as a vehicle for knowledge management. Open, flexible systems integrating blogs provide user-friendly, personalised microlearning ... -
GSPIM: Graphical visualization tool for MIPS assembly programming and simulation
(2007)We describe our system, GSPIM, used for visualization of low-level MIPS Assembly programming and simulation. Although many visualization tools for algorithms and high-level programs have been considered in educational ... -
SPD (Static Priority with Deadline considerations) packet scheduling algorithm for achieving better QoS
(IEEE, 2007)Providing quality of service (QoS) to applications with different traffic characteristics based on their needs is an important research area for today's and tomorrow's high speed networks. Various techniques have been ... -
Crossing minimization in weighted bipartite graphs
(Springer, 2007)Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ... -
Colored simultaneous geometric embeddings
(Springer-Verlag Berlin, 2007)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 ... -
The modified proactive feedback based flow control scheme for best-effort applications
(International Institute of Informatics and Systemics (IIIS), 2007)High speed networks that are characterized by large bandwidth propagation delay products are expected to support applications with diverse traffic characteristics and Quality of Service (QoS) requirements. Thus, flow control ... -
Parallel univariate decision trees
(Elsevier B.V., 2007-05-01)Univariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the ... -
E-learning and microformats: A learning object harvesting model and a sample application
(2008)In order to support interoperability of learning tools and reusability of resources, this paper introduces a framework for harvesting learning objects from web-based content. Therefore, commonly-known web technologies are ... -
Driver recognition using gaussian mixture models and decision fusion techniques
(Springer-Verlag Berlin, 2008)In this paper we present our research in driver recognition. The goal of this study is to investigate the performance of different classifier fusion techniques in a driver recognition scenario. We are using solely driving ... -
Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)]
(American Institute of Physics Inc., 2008-09)In this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can ... -
Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2008-11-17)Recently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the ...