Arama Sonuçları
Listeleniyor 1 - 10 / 69
Yayın The economic lot-sizing problem with perishable items and consumption order preference(Elsevier Science BV, 2015-08-01) Önal, Mehmet; Romeijn, H. Edwin; Sapra, Amar; Van den Heuvel, WilcoWe consider the economic lot-sizing problem with perishable items (ELS-PI), where each item has a deterministic expiration date. Although all items in stock are equivalent regardless of procurement or expiration date, we allow for an allocation mechanism that defines an order in which the items are allocated to the consumers. In particular, we consider the following allocation mechanisms: First Expiration, First Out (FEFO), Last Expiration, First Out (LEFO), First In, First Out (FIFO) and Last In, First Out (LIFO). We show that the ELS-PI can be solved in polynomial time under all four allocation mechanisms in case of no procurement capacities. This result still holds in case of time-invariant procurement capacities under the FIFO and LEFO allocation mechanisms, but the problem becomes NP-hard under the FEFO and LIFO allocation mechanisms.Yayın Volumetric ultrasound imaging using 2-D CMUT arrays(IEEE-Inst Electrical Electronics Engineers Inc, 2003-11) Oralkan, Ömer; Ergün, Arif Sanlı; Cheng, Ching-Hsiang; Johnson, Jeremy A.; Karaman, Mustafa; H. Lee, Thomas; Khuri-Yakub, Butrus ThomasRecently, capacitive micromachined ultrasonic transducers (CMUTs) have emerged as a candidate to overcome the difficulties in the realization of 2-D arrays for real-time 3-D imaging. In this paper, we present the first volumetric images obtained using a 2-D CMUT array. We have fabricated a 128 x 128-element 2-D CMUT array with through-wafer via interconnects and a 420-mum element pitch. As an experimental prototype, a 32 x 64-element portion of the 128 X 128-element array was diced and flip-chip bonded onto a glass fanout chip. This chip provides individual leads from a central 16 X 16-element portion of the array to surrounding bondpads. An 8 x 16-element poition of the array was used in the experiments along with a 128-channel data acquisition system. For imaging phantoms, we used a 2.37-mm diameter steel sphere located 10 mm from the array center and two 12-mm-thick Plexiglas plates located 20 mm and 60 mm from the array. A 4 X 4 group of elements in the middle of the 8 X 16-element array was used in transmit, and the remaining elements were used to receive the echo signals. The echo signal obtained from the spherical target presented a frequency spectrum centered at 4.37 MHz with a 100% fractional bandwidth, whereas the frequency spectrum for the echo signal from the parallel plate phantom was centered at 3.44 MHz with a 91% fractional bandwidth. The images were reconstructed by using RF beamforming and synthetic phased array approaches and visualized by surface rendering and multiplanar slicing techniques. The image of the spherical target has been used to approximate the point spread function of the system and is compared with theoretical expectations. This study experimentally demonstrates that 2-D CMUT arrays can be fabricated with high yield using silicon IC-fabrication processes, individual electrical connections can be provided using through-wafer vias, and flip-chip bonding can be used to integrate these dense 2-D arrays with electronic circuits for practical 3-D imaging applications.Yayın Maximum likelihood blind channel estimation for space-time coding systems(Hindawi Publishing Corporation, 2002-05) Çırpan, Hakan Ali; Panayırcı, Erdal; Çekli, ErdinçSophisticated signal processing techniques have to be developed for capacity enhancement of future wireless communication systems, In recent years, space-time coding is proposed to provide significant capacity gains over the traditional communication systems in fading wireless channels. Space-time codes are obtained by combining channel coding, modulation, transmit diversity, and optional receive diversity in order to provide diversity at the receiver and coding gain without sacrificing the bandwidth. In this paper, we consider the problem of blind estimation of space-time coded signals along with the channel parameters. Both conditional and unconditional maximum likelihood approaches are developed and iterative solutions are proposed. The conditional maximum likelihood algorithm is based on iterative least squares with projection whereas the unconditional maximum likelihood approach is developed by means of finite state Markov process modelling. The performance analysis issues of the proposed methods are studied. Finally, some simulation results are presented.Yayın Spectral coding of mesh geometry with a hierarchical set partitioning algorithm(Spie-Int Soc Optical Engineering, 2008) Konur, Umut; Bayazıt, Uluğ; Ateş, Hasan Fehmi; Gürgen, Sadık FikretThis work proposes a progressive mesh geometry coder, which expresses geometry information in terms of spectral coefficients obtained through a transformation and codes these coefficients using a hierarchical set partitioning algorithm that assigns right priorities to those coefficients at all bit planes. The spectral transformation used is the one proposed in [8] where the spectral coefficients are obtained by projecting the mesh geometry on an orthonormal basis determined by mesh topology. The set partitioning method used in coding, treats spectral coefficients belonging to the three spatial coordinates with the right priority at all bit planes and realizes a truly embedded system by achieving implicit bit allocation via joint coding the zeroes of coefficients at the bit planes. The experiments performed on common irregular meshes reveal that the rate-distortion performance of the coder is significantly superior to the coding system proposed in [8].Yayın On the equilibrium of a rigid body suspended by a set of linear springs(John Wiley & Sons, 2000-08) Tokad, YılmazIn this paper an approach is described for determining equilibrium states of a rigid body suspended elastically in space by a set of linear springs. This system is considered as a two-terminal generalized spring with terminal across (translational and rotational velocities, V-G, omega(G)) and terminal through (terminal force and moment, f(G), m(G)) variables. The algorithmic approach used for the solution of six nonlinear and coupled equilibrium equations consists of two major steps. The first step is to assign an initial orientation to the rigid body which is represented by the transformation (rotation) matrix T(theta,n) and reduce the problem to the solution of force equations only through a computer program. This yields the position vector xi of a preselected point G on the rigid body. Although the terminal force f(G) becomes zero at this position, the calculated terminal moment m(G), in general, is not equal to zero. The second step is to try to determine the correct orientation of the rigid body based on an argument that the terminal moment should vanish. The same argument is also used for the solution of force equilibrium equations. These two steps are repeated several times until both f(G) and m(G) vanish simultaneously yielding an equilibrium state (xi,T(theta, n)). Application of the approach is illustrated through various examples. It is observed that, if there are nonstable equilibrium states of the system, then sometimes all possible physical equilibrium states may not be obtained with this approach.Yayın A priority based packet scheduler with deadline considerations(IEEE Computer Soc, 2006) Dağ, Tamer; Gökgöl, OralQoS 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.Yayın A sequential Monte Carlo method for blind phase noise estimation and data detection(IEEE, 2005) Panayırcı, Erdal; Çırpan, Hakan Ali; Moeneclaey, MarcIn this paper, a computationally efficient algorithm is presented for blind phase noise estimation and data detection jointly, based on a sequential Monte Carlo method. The basic idea is to treat the transmitted symbols as " missing data" and draw samples sequentially of them based on the observed signal samples up to time t. This way, the Bayesian estimates of the phase noise and the incoming data are obtained through these samples, sequentially drawn, together with their importance weights. The proposed receiver structure is seen to be ideally suited for high-speed parallel implementation using VLSI technology.Yayın Low complexity inter-mode selection for H.264(IEEE, 2006) Ba, Seydou Nourou; Altunbaşak, Yücel; Ateş, Hasan FehmiThe coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitions, the Motion estimation module has extremely high complexity that makes it unpractical for most real-time applications on resource-limited platforms such as hand held devices. In this paper we propose a novel algorithm that significantly reduces the encoding complexity while maintaining high rate distortion performance. The proposed method reduces the Motion estimation (ME) computational complexity by accurately predicting the optimal MB partitions and restricting the number of candidate modes based on a-priori probabilities computed from spatio-temporal information. The experimental results show that the speed up of UmHexagonS [1] (one of the most efficient ME algorithms) can be doubled while maintaining the coding efficiency of Full Search.Yayın 3-B nesne bilgilerinin vektor nicemleme yöntemleri ile sıkıştırılması(IEEE, 2004-10-25) Orcay, Özgür; Konur, Umut; Bayazıt, Uluğ; Gürgen, Sadık FikretBu çalışmanın amacı, bağlanırlık kodlaması için gerçeklenmiş [I]'deki algoritmayı bazı yenilikler ile uygulamak ve koordinat sıkıştırması için 3-B (3 Boyutlu) nesne gösterimleri alanında kullanımı kısıtlı olan kayıplı bir göz sıkıştırma algoritması geliştirmektir. İlk kısımda, bağlanırlık kodlamasını gerçeklemek için kullanılan algoritma ([I]) üzerinde yapılan ufak değişiklikler ile amaca uygun iyileştirmeler sağlanmıştır. İkinci kısımda ise bu alanda kullanımı kısıtlı olan Vektor Nicemleme yöntemleri gerçekleştirilmiştir. Çalışmanın diğer önerilen algoritmalardan farkı, Entropi kısıtlı Vektör Nicemleme (ECVQ) yönteminin geometri sıkıştırma algoritması olarak kullanılmasıdır. Bu sayede gerek bağlanırlık gerekse geometri sıkıştırması algoritmaları için tatmin edici hata düşürme oranlarına ulaşılmıştır.Yayın New criteria for the existence of stable equilibrium points in nonsymmetric cellular neural networks(IEEE, 2003) Özcan, Neyir; Arık, Sabri; Tavşanoğlu, Ahmet VedatA new criteria for the existence of stable equilibrium points in nonsymmetric cellular neural networks (CNN) was presented. It was shown that the results obtained can be used to derive some complete stability conditions for some special classes of CNNs such as positive cell-linking CNNs, opposite-sign CNNs and dominant-template CNNs. The model of the CNN whose dynamical behavior was described by the state equations was discussed.
