Filters








3,081 Hits in 5.9 sec

Nyquist-WDM filter shaping with a high-resolution colorless photonic spectral processor

David Sinefeld, Shalva Ben-Ezra, Dan M. Marom
2013 Optics Letters  
We employ a spatial-light-modulator-based colorless photonic spectral processor with a spectral addressability of 100 MHz along 100 GHz bandwidth, for multichannel, high-resolution reshaping of Gaussian  ...  The authors thank the Israel Ministry of Industry and Trade TeraSanta program and EC FP7 ICT FOX-C and OTONES programs for funding.  ...  The SLM applies linear phase tilts to each spectral component for encoding coupling losses to the desired spectral shape. the PLC edge collimates the light in the guided direction.  ... 
doi:10.1364/ol.38.003268 pmid:23988931 fatcat:by44nqarrvfdflikh4tnq4itp4

Page 2786 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
2002d:68080 known approximation algorithms for the minimum bandwidth linear arrangement (which are based on the principle of volume respecting embeddings) output a linear arrangement which has bandwidth  ...  An orthogonal drawing of a graph is a drawing where the edges are drawn as paths along the segments of a rectangular grid.  ... 

Page 6772 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
edge counts for linear arrangements of rectangular grids.  ...  We prove that the number of edges in a bandwidth-achieving linear arrangement f from the vertex set of G,, onto {1,2,---,am} for which \f(u) — f(v)| =n can range from 2(n—1)+n(m-—n) up to n(m—1).  ... 

The cyclic cutwidth of trees

J.D. Chavez, R. Trapp
1998 Discrete Applied Mathematics  
We consider the problem of embedding trees into cyclic host graphs in such a way as to minimize the cutwidth, the maximum number of edges along any point in the cycle.  ...  We show that the cyclic cutwidth of trees equals the linear cutwidth. 0 1998 Elsevier Science B.V. All rights reserved.  ...  In [l] , the problem of minimizing the cutwidth of the n-dimensional cube when the host graph is a rectangular grid is solved.  ... 
doi:10.1016/s0166-218x(98)00098-5 fatcat:pn5tev36pfbe5eekxiut4jtk2u

P3DFFT: A Framework for Parallel Computations of Fourier Transforms in Three Dimensions

Dmitry Pekurovsky
2012 SIAM Journal on Scientific Computing  
Designed for portable performance, P3DFFT achieves excellent timings for a number of systems and problem sizes.  ...  Library features include Fourier and Chebyshev transforms, Fortran and C interfaces, in- and out-of-place transforms, uneven data grids, single and double precision.  ...  Brethouwer for helpful discussions.  ... 
doi:10.1137/11082748x fatcat:ccdohteslfdfjjtr5jxbflbuvy

Objective Assessment and Design Improvement of a Staring, Sparse Transducer Array by the Spatial Crosstalk Matrix for 3D Photoacoustic Tomography

Philip Wong, Ivan Kosik, Avery Raess, Jeffrey J. L. Carson, Heye Zhang
2015 PLoS ONE  
Transducer arrangement, array radius, and array angular coverage were the design parameters examined.  ...  We observed that the performance of a 129-element staring transducer array for 3D PAT could be improved by selection of optimal values of the design parameters.  ...  (d) Same as (c) but for aliasing for a voxel near the edge of object space. doi:10.1371/journal.pone.0124759.g002 rectangular lattice for the experimental transducer arrangement (E) and a hexagonal lattice  ... 
doi:10.1371/journal.pone.0124759 pmid:25875177 pmcid:PMC4398465 fatcat:qoq5a4vbvjbonhtx2nyb3xpdcm

Placement and Routing in 3D Integrated Circuits

C. Ababei, Yan Feng, B. Goplen, H. Mogal, Tianpei Zhang, K. Bazargan, S. Sapatnekar
2005 IEEE Design & Test of Computers  
These flows have been used to obtain optimized layouts for benchmarks with tens to hundreds of thousands of cells.  ...  We present our placement and routing algorithms for 3D FPGA and ASIC designs.  ...  When the above procedure is run on the example on the left of Figure 4 , the linear arrangement on the right is created.  ... 
doi:10.1109/mdt.2005.150 fatcat:a45rykei6bbzvmzjxmujlgydpu

Parallelizable Methods for Modeling Flow and Transport in Heterogeneous Porous Media [chapter]

Myron B. Allen, Mark C. Curran
1993 Flow in Porous Media  
A parallelizable, multigrid-based iterative scheme for the lowest-order mixed method largely overcomes both sources of poor behavior.  ...  The fine grids needed to resolve heterogeneities aggravate the poor conditioning.  ...  Department of Energy Office of Energy Research. The work was performed in part at Sandia National Laboratories for the U.S. DOE under contract number DE-AC04 -76DP00789.  ... 
doi:10.1007/978-3-0348-8564-5_2 fatcat:23qjesszsveitlxe4t4hqcohry

Architecture and Design of Coarse/Fine Hybrid Granular Routing Optical Networks

Yusaku ITO, Yojiro MORI, Hiroshi HASEGAWA, Ken-ichi SATO
2019 IEICE transactions on communications  
The effectiveness of the proposed architecture is demonstrated through both numerical and experimental evaluations; the number of fibers necessary in a network, and the spectrum bandwidth and hop count  ...  Acknowledgments This work was partly supported by National Institute of Information and Communications Technology (NICT).  ...  However, optical filters cannot yield passbands with ideal rectangular shape and hence dense optical path arrangements in the frequency domain incurs signal impairment at the edges of the filter passbands  ... 
doi:10.1587/transcom.2019ebp3026 fatcat:ei6aqlhdkfb5tdvb53yaj4bkvm

Convex Recovery of Continuous Domain Piecewise Constant Images From Nonuniform Fourier Samples

Greg Ongie, Sampurna Biswas, Mathews Jacob
2018 IEEE Transactions on Signal Processing  
We also show that the incoherency property is dependent on the geometry of the edge set curve, implying higher sampling burden for smaller curves.  ...  We assume the discontinuities/edges of the image are localized to the zero levelset of a bandlimited function.  ...  Put in words, among all possible arrangements of R points along the edge-set {µ 0 = 0}, we seek the arrangement such that the minimum eigenvalue G(P ) is as large as possible.  ... 
doi:10.1109/tsp.2017.2750111 pmid:30140146 pmcid:PMC6101269 fatcat:ljmzynddqrfozdnupwuadxywlm

High-performance synthetic aperture radar image formation on commodity multicore architectures

Daniel S. McFarlin, Franz Franchetti, Markus Püschel, José M. F. Moura, Edmund G. Zelnio, Frederick D. Garber
2009 Algorithms for Synthetic Aperture Radar Imagery XVI  
the memory bandwidth.  ...  Specifically, we show an average performance of 39 Gigaflops/sec for 16-Megapixel and 100-Megapixel SAR images with runtimes of 0.56 and 3.76 seconds respectively.  ...  The Core i7's improved memory bandwidth enables a 100 Megapixel runtime that edges out the Cell's by .5 seconds.  ... 
doi:10.1117/12.818399 fatcat:meue4pcpmzdlpjfx4w2nndt5z4

Algorithm for hyperfast cone-beam spiral backprojection

Sven Steckmann, Michael Knaup, Marc Kachelrieß
2010 Computer Methods and Programs in Biomedicine  
in the order of 10 9 to 10 11 floating point values for typical spiral scans.  ...  Storage of the weights is prohibitive since the amount of memory required equals the number of voxels per spiral rotation times the number of projections a voxel receives contributions and therefore is  ...  Parts of the reconstruction software were provided by RayConStruct GmbH, Nürnberg, Germany. We thank the Intel Corporation, for providing their latest multi-core platforms.  ... 
doi:10.1016/j.cmpb.2009.08.003 pmid:19765852 fatcat:wskxgmkxirgxxe4qlbblamggrm

Counting people in crowds with a real-time network of simple image sensors

Yang, Gonzalez-Banos, Guibas
2003 Proceedings Ninth IEEE International Conference on Computer Vision  
Most vision-based counting techniques depend on detecting individuals in order to count, an unrealistic proposition in crowded settings.  ...  The computational requirements scale well with the number of sensors and the number of people, and only limited amounts of data are transmitted over the network.  ...  Acknowledgments The authors wish to thank the DARPA Software for Distributed Robotics Program, the Stanford Networking Research Center, and Honda R&D Americas for their support.  ... 
doi:10.1109/iccv.2003.1238325 dblp:conf/iccv/YangGG03 fatcat:5vbifbjwavf43avflckdd7oaze

Parameterized Complexity of Graph Constraint Logic

Tom C. Van Der Zanden, Marc Herbstritt
2015 International Symposium on Parameterized and Exact Computation  
set and dominating set) are PSPACE-complete on planar graphs of bounded bandwidth.  ...  As a main result we show that restricted NCL remains PSPACEcomplete on graphs of bounded bandwidth, strengthening Hearn and Demaine's framework.  ...  Given a restricted NCL graph on n vertices with cutwidth k, it is possible to arrange it in a 3n × (k + 1) grid, so that vertices of the graph are mapped to vertices of the grid, the edges of the graph  ... 
doi:10.4230/lipics.ipec.2015.282 dblp:conf/iwpec/Zanden15 fatcat:b6zwiy3j6ra7bkv42dnpye5sp4

Urban Street Cleanliness Assessment Using Mobile Edge Computing and Deep Learning

Pengcheng Zhang, Qi Zhao, Jerry Gao, Wenrui Li, Jiamin Lu
2019 IEEE Access  
During the process of smart city construction, city managers always spend a lot of energy and money for cleaning street garbage due to the random appearances of street garbage.  ...  At the same time, Faster Region-Convolutional Neural Network (Faster R-CNN) is used to identify the street garbage categories and count the number of garbage.  ...  For a better calculation of the street cleanliness, when a rectangular box is generated, we automatically count the number of rectangular boxes.  ... 
doi:10.1109/access.2019.2914270 fatcat:oj55qizyubdi7nsm67andzhzoq
« Previous Showing results 1 — 15 out of 3,081 results