10.1128/EC.00036-07

%0 Conference Paper %B Image Processing, 2007. ICIP 2007. IEEE International Conference on %D 2007 %T Noise Features for Image Tampering Detection and Steganalysis %A Gou,Hongmei %A Swaminathan,A. %A M. Wu %K analysis;cryptography;data %K analysis;image %K analysis;wavelet %K authenticity;hidden %K computing;statistical %K data;image %K denoising %K denoising;multimedia %K detection;low-cost %K editing %K encapsulation;feature %K extraction;image %K features;steganalysis;wavelet %K forensic %K forensics;neighborhood %K image %K NOISE %K operations;digital %K prediction;statistical %K softwares;multimedia %K tampering %K transforms; %X With increasing availability of low-cost image editing softwares, the authenticity of digital images can no longer be taken for granted. Digital images have also been used as cover data for transmitting secret information in the field of steganography. In this paper, we introduce a new set of features for multimedia forensics to determine if a digital image is an authentic camera output or if it has been tampered or embedded with hidden data. We perform such image forensic analysis employing three sets of statistical noise features, including those from denoising operations, wavelet analysis, and neighborhood prediction. Our experimental results demonstrate that the proposed method can effectively distinguish digital images from their tampered or stego versions. %B Image Processing, 2007. ICIP 2007. IEEE International Conference on %V 6 %P VI -97 -VI -100 - VI -97 -VI -100 %8 2007/10/16/19 %G eng %R 10.1109/ICIP.2007.4379530 %0 Journal Article %J Information Forensics and Security, IEEE Transactions on %D 2007 %T Nonintrusive component forensics of visual sensors using output images %A Swaminathan,A. %A M. Wu %A Liu,K. J.R %K ACQUISITION %K array;color %K authenticating %K component %K filter %K forensics;patent %K infringements;visual %K Interpolation %K manipulations;intellectual %K modules;content %K property %K property; %K protection;nonintrusive %K rights %K sensors;image %K sensors;industrial %K sources;color %X Rapid technology development and the widespread use of visual sensors have led to a number of new problems related to protecting intellectual property rights, handling patent infringements, authenticating acquisition sources, and identifying content manipulations. This paper introduces nonintrusive component forensics as a new methodology for the forensic analysis of visual sensing information, aiming to identify the algorithms and parameters employed inside various processing modules of a digital device by only using the device output data without breaking the device apart. We propose techniques to estimate the algorithms and parameters employed by important camera components, such as color filter array and color interpolation modules. The estimated interpolation coefficients provide useful features to construct an efficient camera identifier to determine the brand and model from which an image was captured. The results obtained from such component analysis are also useful to examine the similarities between the technologies employed by different camera models to identify potential infringement/licensing and to facilitate studies on technology evolution %B Information Forensics and Security, IEEE Transactions on %V 2 %P 91 - 106 %8 2007/03// %@ 1556-6013 %G eng %N 1 %R 10.1109/TIFS.2006.890307 %0 Journal Article %J Magnetics, IEEE Transactions on %D 2007 %T Numerical Analysis of Nanoparticle-Structured Plasmon Waveguides of Light %A Mayergoyz, Issak D %A Zhang,Zhenyu %K analysis;optical %K analysis;resonant %K cross-sections;light %K Frequency %K frequency;light %K nanoparticle-structured %K plasmon %K polarisation;light %K polarization;numerical %K propagation;numerical %K waveguides;light %K waveguides;plasmonics;plasmons; %X A novel numerical approach to the analysis of nanoparticle-structured plasmon waveguides of light is presented. The extinct cross-sections and resonance (propagation) frequencies are computed for various geometries of these waveguides and compared with available experimental data. The computational results for resonance frequencies corresponding to different light polarizations are reported as well %B Magnetics, IEEE Transactions on %V 43 %P 1685 - 1688 %8 2007/04// %@ 0018-9464 %G eng %N 4 %R 10.1109/TMAG.2006.892270 %0 Journal Article %J Magnetics, IEEE Transactions on %D 2007 %T Numerical Analysis of Plasmon Resonances in Metallic Nanoshells %A Mayergoyz, Issak D %A Zhang,Zhenyu %K analysis;plasmon %K and %K boundary %K eigenfunctions;nanostructured %K equation-based %K equations;eigenvalues %K frequency;boundary %K integral %K materials;nanotechnology;plasmons; %K nanoshells;numerical %K problems;metallic %K resonance;resonant %K techniques;eigenvalue %X A novel boundary integral equation-based technique for the direct computations of resonance frequencies for plasmon resonances in metallic nanoshells is presented. In this technique, the calculation of resonance frequencies is reduced to a generalized eigenvalue problem. Numerical results that demonstrate fairly good agreement with theoretical results and available experimental data are reported %B Magnetics, IEEE Transactions on %V 43 %P 1689 - 1692 %8 2007/04// %@ 0018-9464 %G eng %N 4 %R 10.1109/TMAG.2006.892271 %0 Journal Article %J Magnetics, IEEE Transactions on %D 2007 %T Numerical Analysis of Plasmon Resonances in Nanoparticles Based on Fast Multipole Method %A Zhang,Zhenyu %A Mayergoyz, Issak D %A Gumerov, Nail A. %A Duraiswami, Ramani %K analysis;boundary %K and %K boundary %K eigenfunctions;nanoparticles;plasmons; %K equations;eigenvalue %K equations;eigenvalues %K integral %K method;nanoparticle %K multipole %K plasmon %K problems;fast %K resonance;numerical %X A novel technique for the numerical analysis of plasmon resonances by using the fast multipole method (FMM) is presented. This approach is based on the solution of the eigenvalue problem for boundary integral equations, which can be naturally implemented by using the FMM. Numerical examples that highlight the efficiency of the fast multipole implementation are reported %B Magnetics, IEEE Transactions on %V 43 %P 1465 - 1468 %8 2007/04// %@ 0018-9464 %G eng %N 4 %R 10.1109/TMAG.2007.891413 %0 Journal Article %J SIAM International Conference on Data Mining %D 2006 %T Name reference resolution in organizational email archives %A Diehl,C. P %A Getoor, Lise %A Namata,G. %B SIAM International Conference on Data Mining %P 20 - 22 %8 2006/// %G eng %0 Journal Article %J IEEE Transactions on Visualization and Computer Graphics %D 2006 %T Network Visualization by Semantic Substrates %A Shneiderman, Ben %A Aris,A. %K Automatic control %K data visualisation %K Data visualization %K Displays %K Filters %K Graphical user interfaces %K Information Visualization %K information visualization designers %K Law %K legal citations %K Legal factors %K legal precedent data %K network visualization %K NVSS 1.0 %K scalability %K semantic substrate %K Terminology %K Tunneling %K user-defined semantic substrates %X Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations %B IEEE Transactions on Visualization and Computer Graphics %V 12 %P 733 - 740 %8 2006/10//Sept %@ 1077-2626 %G eng %N 5 %R 10.1109/TVCG.2006.166 %0 Conference Paper %B 3rd AIAA Flow Control Conference %D 2006 %T New DNS results of shockwave/turbulent boundary layer interaction %A Wu,M. %A Martin, M.P %B 3rd AIAA Flow Control Conference %8 2006/// %G eng %0 Journal Article %J International Journal of High Performance Computing Applications %D 2006 %T A New Hardware Monitor Design to Measure Data Structure-Specific Cache Eviction Information %A Buck, B. R %A Hollingsworth, Jeffrey K %X In this paper, we propose a hardware performance monitor that provides support not only for measuring cache misses and the addresses associated with them, but also for determining what data is being evicted from the cache when a miss occurs. We describe how to use this hardware support to efficiently determine the cache behavior of application data structures at the source code level. We also present the results of a simulation-based study of this technique, in which we examined the overhead, perturbation of results, and usefulness of collecting this information. %B International Journal of High Performance Computing Applications %V 20 %P 353 - 363 %8 2006/// %G eng %U http://hpc.sagepub.com/content/20/3/353.abstract %N 3 %R 10.1177/1094342006067470 %0 Conference Paper %B Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm %D 2006 %T New lower bounds for oblivious routing in undirected graphs %A Hajiaghayi, Mohammad T. %A Kleinberg,R. D %A Leighton,T. %A R\äcke,H. %B Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm %P 918 - 927 %8 2006/// %G eng %0 Journal Article %J Vision Research %D 2006 %T Noise causes slant underestimation in stereo and motion %A Hui Ji %A Fermüller, Cornelia %K Bias %K Partial bias correction %K shape estimation %K Shape from motion %K Stereo orientation disparity %X This paper discusses a problem, which is inherent in the estimation of 3D shape (surface normals) from multiple views. Noise in the image signal causes bias, which may result in substantial errors in the parameter estimation. The bias predicts the underestimation of slant found in psychophysical and computational experiments. Specifically, we analyze the estimation of 3D shape from motion and stereo using orientation disparity. For the case of stereo, we show that bias predicts the anisotropy in the perception of horizontal and vertical slant. For the case of 3D motion we demonstrate the bias by means of a new illusory display. Finally, we discuss statistically optimal strategies for the problem and suggest possible avenues for visual systems to deal with the bias. %B Vision Research %V 46 %P 3105 - 3120 %8 2006/10// %@ 0042-6989 %G eng %U http://www.sciencedirect.com/science/article/pii/S0042698906002124 %N 19 %R 10.1016/j.visres.2006.04.010 %0 Conference Paper %B Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on %D 2006 %T Non-Intrusive Forensic Analysis of Visual Sensors Using Output Images %A Swaminathan,A. %A M. Wu %A Liu,K. J.R %K algorithms;interpolation %K analysis;image %K analysis;output %K array %K cameras;forensic %K Color %K colour %K engineering;forensic %K forensic %K images;visual %K methods;nonintrusive %K PROCESSING %K sensor;digital %K sensors;cameras;image %K sensors;interpolation; %K signal %X This paper considers the problem of non-intrusive forensic analysis of the individual components in visual sensors and its implementation. As a new addition to the emerging area of forensic engineering, we present a framework for analyzing technologies employed inside digital cameras based on output images, and develop a set of forensic signal processing algorithms for visual sensors based on color array sensor and interpolation methods. We show through simulations that the proposed method is robust against compression and noise, and can help identify various processing components inside the camera. Such a non-intrusive forensic framework would provide useful evidence for analyzing technology infringement and evolution for visual sensors %B Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on %V 5 %P V - V %8 2006/05// %G eng %R 10.1109/ICASSP.2006.1661297 %0 Journal Article %J Linear Algebra and its Applications %D 2006 %T A note on generalized and hypergeneralized projectors %A Stewart, G.W. %K Generalized projection %K projection %K Spectral decomposition %X Groß and Trenkler [Generalized and hypergeneralized projectors, Linear Algebra Appl. 264 (1997) 463–474] have introduced two generalizations of orthogonal projectors called generalized projectors and hypergeneralized projectors. In this note we characterize these generalizations by their spectral decompositions. %B Linear Algebra and its Applications %V 412 %P 408 - 411 %8 2006/01/15/ %@ 0024-3795 %G eng %U http://www.sciencedirect.com/science/article/pii/S0024379505003836 %N 2–3 %R 10.1016/j.laa.2005.07.022 %0 Report %D 2006 %T A Novel Information-Aware Octree for the Visualization of Large Scale Time-Varying Data %A Kim,Jusub %A JaJa, Joseph F. %K Technical Report %X Large scale scientific simulations are increasingly generatingvery large data sets that present substantial challenges to current visualization systems. In this paper, we develop a new scalable and efficient scheme for the visual exploration of 4-D isosurfaces of time varying data by rendering the 3-D isosurfaces obtained through an arbitrary axis-parallel hyperplane cut. The new scheme is based on: (i) a new 4-D hierarchical indexing structure, called Information-Aware Octree; (ii) a controllable delayed fetching technique; and (iii) an optimized data layout. Together, these techniques enable efficient and scalable out-of-core visualization of large scale time varying data sets. We introduce an entropy-based dimension integration technique by which the relative resolutions of the spatial and temporal dimensions are established, and use this information to design a compact size 4-D hierarchical indexing structure. We also present scalable and efficient techniques for out-of-core rendering. Compared with previous algorithms for constructing 4-D isosurfaces, our scheme is substantially faster and requires much less memory. Compared to the Temporal Branch-On-Need octree (T-BON), which can only handle a subset of our queries, our indexing structure is an order of magnitude smaller and is at least as effective in dealing with the queries that the T-BON can handle. We have tested our scheme on two large time-varying data sets and obtained very good performance for a wide range of isosurface extraction queries using an order of magnitude smaller indexing structures than previous techniques. In particular, we can generate isosurfaces at intermediate time steps very quickly. %I Instititue for Advanced Computer Studies, Univ of Maryland, College Park %V UMIACS-TR-2006-03 %8 2006/04/20/T16:3 %G eng %U http://drum.lib.umd.edu/handle/1903/3335 %0 Report %D 2006 %T NSF Workshop Storage Resource Broker Data Grid Preservation Assessment %A JaJa, Joseph F. %I San Diego Supercomputer Center %V TR-2006.3 %8 2006/// %G eng %0 Journal Article %J BrainBrain %D 2006 %T Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb–MyoD Pathways in Muscle Regeneration %A Bakay,Marina %A Wang,Zuyi %A Melcon,Gisela %A Schiltz,Louis %A Xuan,Jianhua %A Zhao,Po %A Sartorelli,Vittorio %A Seo,Jinwook %A Pegoraro,Elena %A Angelini,Corrado %A Shneiderman, Ben %A Escolar,Diana %A Chen,Yi-Wen %A Winokur,Sara T %A Pachman,Lauren M %A Fan,Chenguang %A Mandler,Raul %A Nevo,Yoram %A Gordon,Erynn %A Zhu,Yitan %A Dong,Yibin %A Wang,Yue %A Hoffman,Eric P %K EDMD = Emery–Dreifuss muscular dystrophy %K emerin %K Emery-Dreifuss muscular dystrophy %K FSHD = fascioscapulohumeral muscular dystrophy %K IDG = individual discriminatory genes %K JDG = jointly discriminatory genes %K lamin A/C %K LGMD = limb-girdle muscular dystrophy %K LOO = leave-one-out %K RT–PCR = reverse transcription–polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer %K Skeletal muscle %K wFC = weighted Fisher criterion %X Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery–Dreifuss muscular dystrophy (EDMD). EDMD is also caused by X-linked recessive loss-of-function mutations of emerin, another component of the inner nuclear lamina that directly interacts with LMNA. One model for disease pathogenesis of LMNA and emerin mutations is cell-specific perturbations of the mRNA transcriptome in terminally differentiated cells. To test this model, we studied 125 human muscle biopsies from 13 diagnostic groups (125 U133A, 125 U133B microarrays), including EDMD patients with LMNA and emerin mutations. A Visual and Statistical Data Analyzer (VISDA) algorithm was used to statistically model cluster hierarchy, resulting in a tree of phenotypic classifications. Validations of the diagnostic tree included permutations of U133A and U133B arrays, and use of two probe set algorithms (MAS5.0 and MBEI). This showed that the two nuclear envelope defects (EDMD LMNA, EDMD emerin) were highly related disorders and were also related to fascioscapulohumeral muscular dystrophy (FSHD). FSHD has recently been hypothesized to involve abnormal interactions of chromatin with the nuclear envelope. To identify disease-specific transcripts for EDMD, we applied a leave-one-out (LOO) cross-validation approach using LMNA patient muscle as a test data set, with reverse transcription–polymerase chain reaction (RT–PCR) validations in both LMNA and emerin patient muscle. A high proportion of top-ranked and validated transcripts were components of the same transcriptional regulatory pathway involving Rb1 and MyoD during muscle regeneration (CRI-1, CREBBP, Nap1L1, ECREBBP/p300), where each was specifically upregulated in EDMD. Using a muscle regeneration time series (27 time points) we develop a transcriptional model for downstream consequences of LMNA and emerin mutations. We propose that key interactions between the nuclear envelope and Rb and MyoD fail in EDMD at the point of myoblast exit from the cell cycle, leading to poorly coordinated phosphorylation and acetylation steps. Our data is consistent with mutations of nuclear lamina components leading to destabilization of the transcriptome in differentiated cells. %B BrainBrain %V 129 %P 996 - 1013 %8 2006/04/01/ %@ 0006-8950, 1460-2156 %G eng %U http://brain.oxfordjournals.org/content/129/4/996 %N 4 %R 10.1093/brain/awl023 %0 Conference Paper %B Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on %D 2006 %T Numerical Analysis of Plasmon Resonances Based on Fast Multipole Method %A Zhang,Zhenyu %A Mayergoyz, Issak D %A Gumerov, Nail A. %A Duraiswami, Ramani %K analysis;plasmon %K and %K boundary %K eigenfunctions;plasmons; %K equations;eigenvalue %K equations;eigenvalues %K integral %K method;numerical %K multipole %K problem;fast %K resonances;boundary %X A novel technique for the numerical analysis of plasmon resonances by using fast multipole method (FMM) is presented. This approach is based on the solution of eigenvalue problem for boundary integral equations, which can be naturally implemented by using the fast multipole method. Numerical examples that highlight the efficiency of the fast multipole implementation are reported %B Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on %P 459 - 459 %8 2006/// %G eng %R 10.1109/CEFC-06.2006.1633249 %0 Journal Article %J Magnetics, IEEE Transactions on %D 2006 %T Numerical analysis of plasmon resonances in nanoparticles %A Mayergoyz, Issak D %A Zhang,Zhenyu %K 3D %K analysis;plasmon %K and %K boundary %K eigenfunctions;electrostatics;nanoparticles;permittivity;surface %K equation;boundary %K equations;eigenvalues %K integral %K nanoparticles;eigenvalue %K plasmon %K problem;numerical %K resonance; %K resonances;specific %X Plasmon (electrostatic) resonances in nanoparticles are treated as an eigenvalue problem for a specific boundary integral equation. This leads to direct calculation of resonance values of permittivity and resonance frequency. The numerical technique is illustrated by examples of calculation of resonance frequencies for three-dimensional nanoparticles %B Magnetics, IEEE Transactions on %V 42 %P 759 - 762 %8 2006/04// %@ 0018-9464 %G eng %N 4 %R 10.1109/TMAG.2006.870976 %0 Journal Article %J Optics ExpressOpt. Express %D 2006 %T Numerical computation of the Green?s function for two-dimensional finite-size photonic crystals of infinite length %A Seydou,F. %A Ramahi,Omar M. %A Duraiswami, Ramani %A Seppänen,T. %K Diffraction and gratings %K Multiple scattering %X We develop a numerical algorithm that computes the Green’s function of Maxwell equation for a 2D finite-size photonic crystal, composed of rods of arbitrary shape. The method is based on the boundary integral equation, and a Nyström discretization is used for the numerical solution. To provide an exact solution that validates our code we derive multipole expansions for circular cylinders using our integral equation approach. The numerical method performs very well on the test case. We then apply it to crystals of arbitrary shape and discuss the convergence. %B Optics ExpressOpt. Express %V 14 %P 11362 - 11371 %8 2006/11/13/ %G eng %U http://www.opticsexpress.org/abstract.cfm?URI=oe-14-23-11362 %N 23 %R 10.1364/OE.14.011362 %0 Conference Paper %B Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing %D 2005 %T NeurAlign: combining word alignments using neural networks %A Ayan,Necip Fazil %A Dorr, Bonnie J %A Monz,Christof %X This paper presents a novel approach to combining different word alignments. We view word alignment as a pattern classification problem, where alignment combination is treated as a classifier ensemble, and alignment links are adorned with linguistic features. A neural network model is used to learn word alignments from the individual alignment systems. We show that our alignment combination approach yields a significant 20--34% relative error reduction over the best-known alignment combination technique on English-Spanish and English-Chinese data. %B Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing %S HLT '05 %I Association for Computational Linguistics %C Stroudsburg, PA, USA %P 65 - 72 %8 2005/// %G eng %U http://dx.doi.org/10.3115/1220575.1220584 %R 10.3115/1220575.1220584 %0 Journal Article %J EURASIP Journal on Applied Signal Processing %D 2005 %T Neuromimetic sound representation for percept detection and manipulation %A Zotkin,Dmitry N %A Chi,T. %A Shamma,S.A. %A Duraiswami, Ramani %X The acoustic wave received at the ears is processed by the human auditory system to separate different sounds along the intensity,pitch, and timbre dimensions. Conventional Fourier-based signal processing, while endowed with fast algorithms, is unable to easily represent a signal along these attributes. In this paper, we discuss the creation of maximally separable sounds in auditory user interfaces and use a recently proposed cortical sound representation, which performs a biomimetic decomposition of an acoustic signal, to represent and manipulate sound for this purpose. We briefly overview algorithms for obtaining, manipulating, and inverting a cortical representation of a sound and describe algorithms for manipulating signal pitch and timbre separately. The algorithms are also used to create sound of an instrument between a “guitar” and a “trumpet.” Excellent sound quality can be achieved if processing time is not a concern, and intelligible signals can be reconstructed in reasonable processing time (about ten seconds of computational time for a one-second signal sampled at 8 kHz). Work on bringing the algorithms into the real-time processing domain is ongoing. %B EURASIP Journal on Applied Signal Processing %V 9 %P 1350 - 1350 %8 2005/// %G eng %0 Conference Paper %B Information Fusion, 2005 8th International Conference on %D 2005 %T A new approach to image fusion based on cokriging %A Memarsadeghi,N. %A Le Moigne,J. %A Mount, Dave %A Morisette,J. %K ALI; %K analysis; %K based %K cokriging; %K component %K data; %K forecasting %K fusion %K fusion; %K geophysical %K geostatistical %K Hyperion %K image %K Interpolation %K interpolation; %K invasive %K ISFS %K method; %K metrics; %K PCA; %K principal %K processing; %K project; %K QUALITY %K quantitative %K remote %K remotely %K sensed %K sensing; %K sensor %K sensors; %K signal %K species %K system; %K techniques; %K transforms; %K wavelet %K wavelet-based %X We consider the image fusion problem involving remotely sensed data. We introduce cokriging as a method to perform fusion. We investigate the advantages of fusing Hyperion with ALI. This evaluation is performed by comparing the classification of the fused data with that of input images and by calculating well-chosen quantitative fusion quality metrics. We consider the invasive species forecasting system (ISFS) project as our fusion application. The fusion of ALI with Hyperion data is studied using PCA and wavelet-based fusion. We then propose utilizing a geostatistical based interpolation method called cokriging as a new approach for image fusion. %B Information Fusion, 2005 8th International Conference on %V 1 %P 8 pp. - 8 pp. %8 2005/07// %G eng %R 10.1109/ICIF.2005.1591912 %0 Journal Article %J AIAA paper %D 2005 %T New experimental data of STBLI at DNS/LES accessible Reynolds numbers %A Bookey,P. %A Wyckham,C. %A Smits,A. J. %A Martin, M.P %B AIAA paper %V 309 %P 2005 - 2005 %8 2005/// %G eng %0 Journal Article %J Theoretical Computer Science %D 2005 %T A new framework for addressing temporal range queries and some preliminary results %A Shi,Qingmin %A JaJa, Joseph F. %K algorithms %K Data structures %K Orthogonal range search %K temporal data %X Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing space efficient indexing structures such that a class of temporal range search queries can be handled efficiently. When m = 1 , our problem reduces to the d-dimensional orthogonal search problem. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O ( log n log m + f ) for one-sided queries when d = 1 , where f is the number of objects satisfying the query. A similar result is shown for counting queries. We also show that the most general problem can be solved with a polylogarithmic query time using superlinear space data structures. %B Theoretical Computer Science %V 332 %P 109 - 121 %8 2005/02/28/ %@ 0304-3975 %G eng %U http://www.sciencedirect.com/science/article/pii/S0304397504007005 %N 1–3 %R 10.1016/j.tcs.2004.10.013 %0 Conference Paper %B Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on %D 2005 %T Non-negative lighting and specular object recognition %A Shirdhonkar,S. %A Jacobs, David W. %K and %K distribution %K eigenfunctions;image %K eigenvalue %K harmonic %K Lambertian %K lighting;nonnegative %K lighting;semidefinite %K matching;object %K object %K objects;Szego %K optimization;incident %K programming;specular %K recognition;optimisation; %K recognition;spherical %K representation;eigenvalues %K theorem;constrained %X Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an approach in which we use a 3D model to deduce the lighting that best matches the model to the image. In this case, an important constraint is that incident lighting should be non-negative everywhere. In this paper, we propose a new method to enforce this constraint and explore its usefulness in specular object recognition, using the spherical harmonic representation of lighting. The method follows from a novel extension of Szego's eigenvalue distribution theorem to spherical harmonics, and uses semidefinite programming to perform a constrained optimization. The new method is faster as well as more accurate than previous methods. Experiments on both synthetic and real data indicate that the constraint can improve recognition of specular objects by better separating the correct and incorrect models %B Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on %V 2 %P 1323 -1330 Vol. 2 - 1323 -1330 Vol. 2 %8 2005/10// %G eng %R 10.1109/ICCV.2005.168 %0 Journal Article %J Proc. of IEEE International Conference on Computer Vision %D 2005 %T Non-negative lighting and specular object recognition %A Jacobs, David W. %A Shirdhonkar,S. %B Proc. of IEEE International Conference on Computer Vision %V 2 %8 2005/// %G eng %0 Conference Paper %B Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on %D 2005 %T Non-Stationary "Shape Activities" %A Vaswani, N. %A Chellapa, Rama %X The changing configuration of a group of moving landmarks can be modeled as a moving and deforming shape. The landmarks defining the shape could be moving objects(people/vehicles/robots) or rigid components of an articulated shape like the human body. In past work, the term "shape activity" has been used to denote a particular stochastic model for shape deformation. Dynamical models have been proposed for characterizing stationary shape activities (assume constant mean shape). In this work we define stochastic dynamic models for non-stationary shape activities and show that the stationary shape activity model follows as a special case of this. Most activities performed by a group of moving landmarks (here, objects) are not stationary and hence this more general model is needed. We also define a piecewise stationary model with non-stationary transitions which can be used to segment out and track a sequence of activities. Noisy observations coming from these models can be tracked using a particle filter. We discuss applications of our framework to abnormal activity detection, tracking and activity sequence segmentation. %B Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on %P 1521 - 1528 %8 2005/12// %G eng %R 10.1109/CDC.2005.1582374 %0 Journal Article %J SIAM Journal on Computing %D 2005 %T Novel transformation techniques using q-heaps with applications to computational geometry %A Shi,Q. %A JaJa, Joseph F. %X Using the notions of Q-heaps and fusion trees developed by Fredman and Willard,we develop general transformation techniques to reduce a number of computational geometry prob- lems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading technique, which uses linear space and enables sublogarithmic iterative search on catalog trees in the case when the degree of each node is bounded by O(log∈ n), for some constant ϵ > 0, where n is the total size of all the lists stored in the tree. We apply the fast fractional cascading tech- nique in combination with the other techniques to derive the first linear-space sublogarithmic time algorithms for the two fundamental geometric retrieval problems: orthogonal segment intersection and rectangular point enclosure. %B SIAM Journal on Computing %V 34 %P 1474 - 1492 %8 2005/// %G eng %N 6 %0 Conference Paper %D 2004 %T New directions in design for manufacturing %A Herrmann,J.W. %A Cooper,J. %A Gupta,S.K. %A Hayes,C. C. %A Ishii,K. %A Kazmer,D. %A Sandborn,P. A. %A Wood,W. H. %X This paper gives an overview of research that is expandingthe domain of design for manufacturing (DFM) into new and important areas. This paper covers DFM and concurrent engineering, DFM for conceptual design, DFM for embodiment design, DFM for detailed design, design for production, platform design for reducing time-to-market, design for system quality, design for life cycle costs, and design for environment. The paper concludes with some general guidelines that suggest how manufacturing firms can develop useful, effective DFM tools. %P 1 - 9 %8 2004/// %G eng %U http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.198.8706&rep=rep1&type=pdf %0 Journal Article %J IEEE Software %D 2004 %T New year’s resolutions for software quality %A Basili, Victor R. %A Boehm,B. %A Davis,A. %A Humphrey,W. S %A Leveson,N. %A Mead,N. R %A Musa,J. D %A Parnas,D. L %A Pfleeger,S. L %A Weyuker,E. %X In the spirit of making resolutions for betterment in the New Year, ten distinguished individuals in the software quality field offer their recommendations on how organizations can improve software quality In the spirit of making resolutions for betterment in the New Year, ten distinguished individuals in the software quality field offer their recommendations on how organizations can improve software quality. %B IEEE Software %V 21 %P 12 - 13 %8 2004/// %G eng %N 1 %0 Journal Article %J Journal of Computational Biology %D 2004 %T A Note on Efficient Computation of Haplotypes via Perfect Phylogeny %A Bafna,Vineet %A Gusfield,Dan %A Hannenhalli, Sridhar %A Yooseph,Shibu %X The problem of inferring haplotype phase from a population of genotypes has received a lot of attention recently. This is partly due to the observation that there are many regions on human genomic DNA where genetic recombination is rare (Helmuth, 2001; Daly et al., 2001; Stephens et al., 2001; Friss et al., 2001). A Haplotype Map project has been announced by NIH to identify and characterize populations in terms of these haplotypes. Recently, Gusfield introduced the perfect phylogeny haplotyping problem, as an algorithmic implication of the no-recombination in long blocks observation, together with the standard population-genetic assumption of infinite sites. Gusfield's solution based on matroid theory was followed by direct θ(nm2 ) solutions that use simpler techniques (Bafna et al., 2003; Eskin et al., 2003), and also bound the number of solutions to the PPH problem. In this short note, we address two questions that were left open. First, can the algorithms of Bafna et al. (2003) and Eskin et al. (2003) be sped-up to O(nm + m2 ) time, which would imply an O(nm) time-bound for the PPH problem? Second, if there are multiple solutions, can we find one that is most parsimonious in terms of the number of distinct haplotypes.We give reductions that suggests that the answer to both questions is "no." For the first problem, we show that computing the output of the first step (in either method) is equivalent to Boolean matrix multiplication. Therefore, the best bound we can presently achieve is O(nmω–1), where ω ≤ 2.52 is the exponent of matrix multiplication. Thus, any linear time solution to the PPH problem likely requires a different approach. For the second problem of computing a PPH solution that minimizes the number of distinct haplotypes, we show that the problem is NP-hard using a reduction from Vertex Cover (Garey and Johnson, 1979). %B Journal of Computational Biology %V 11 %P 858 - 866 %8 2004/10// %@ 1066-5277, 1557-8666 %G eng %U http://www.liebertonline.com/doi/abs/10.1089/cmb.2004.11.858 %N 5 %R 10.1089/cmb.2004.11.858 %0 Journal Article %J Magnetics, IEEE Transactions on %D 2004 %T A novel approach to removing intersymbol interference from spin-stand images %A Mayergoyz, Issak D %A Tse,C. %A Krafft,C. %A McAvoy,P. %K algorithm; %K characterization; %K Deconvolution %K function %K function; %K giant %K giant-magnetoresistive %K Head %K heads; %K image %K image; %K imaging; %K Interference %K interference; %K intersymbol %K ISI-distorted %K ISI-free %K magnetic %K magnetization %K magnetoresistance; %K patterns; %K readback %K removal; %K response %K signal; %K spin-stand %K suppression; %X A novel intersymbol interference (ISI) removal technique based on the "response function" characterization of giant-magnetoresistive heads is presented. It is demonstrated that the ISI-free readback image that corresponds to the actual underlying magnetization patterns can be extracted from the ISI-distorted readback signal through deconvolution. A new image deconvolution algorithm has been implemented, and it has been shown that it effectively removes the ISI distortions. %B Magnetics, IEEE Transactions on %V 40 %P 2197 - 2199 %8 2004/07// %@ 0018-9464 %G eng %N 4 %R 10.1109/TMAG.2004.830153 %0 Conference Paper %B Proceedings of EMNLP %D 2004 %T Np bracketing by maximum entropy tagging and SVM reranking %A Daumé, Hal %A Marcu,D. %B Proceedings of EMNLP %V 4 %8 2004/// %G eng %0 Book Section %B The craft of information visualization: readings and reflections %D 2003 %T Navigation Patterns and Usability of Zoomable User Interfaces With and Without an Overview %A Bederson, Benjamin B. %A Plaisant, Catherine %B The craft of information visualization: readings and reflections %I Morgan Kaufmann Publishers Inc. %P 120 - 120 %8 2003/// %@ 978-1-55860-915-0 %G eng %0 Journal Article %J interactions %D 2003 %T Navigation patterns & usability of zoomable user interfaces: with and without an overview %A Hornbaek,Kasper %A Bederson, Benjamin B. %A Plaisant, Catherine %X The following abstracts are from recent issues and the forthcoming issue of ACM's Transactions of Computer Human Interaction (ToCHI). They are included here to alert interactions' readers to what research is being done in the field of Computer Human Interaction. The complete papers, when published, can be found in ACM's Digital Library at www.acm.org/pubs/contents/journals/tochi/ %B interactions %V 10 %P 11 - 12 %8 2003/01// %@ 1072-5520 %G eng %U http://doi.acm.org/10.1145/604575.604582 %N 1 %R 10.1145/604575.604582 %0 Journal Article %J J Parallel Distr Com %D 2003 %T Necessity is the mother of invention: a simple grid computing system using commodity tools %A Myers,D. S %A Cummings, Michael P. %K Apache; %K computing; %K distributed %K Grid %K HTTP; %K Java; %K Linux; %K Perl; %K SQL; %K Unix; %K XML-RPC %X Access to sufficient resources is a barrier to scientific progress for many researchers facing large computational problems. Gaining access to large-scale resources (i.e., university-wide or federally supported computer centers) can be difficult, given their limited availability, particular architectures, and request/review/approval cycles. Simultaneously, researchers often find themselves with access to workstations and older clusters overlooked by their owners in favor of newer hardware. Software to tie these resources into a coherent Grid, however, has been problematic. Here, we describe our experiences building a Grid computing system to conduct a large-scale simulation study using "borrowed" computing resources distributed over a wide area. Using standard software components, we have produced a Grid computing system capable of coupling several hundred processors spanning multiple continents and administrative domains. We believe that this system fills an important niche between a closely coupled local system and a heavyweight, highly customized wide area system. (C) 2003 Elsevier Science (USA). All rights reserved. %B J Parallel Distr Com %V 63 %P 578 - 589 %8 2003/05// %G eng %N 5 %R DOI 10.1016/S0743-7315(03)00004-2 %0 Conference Paper %B Proceedings of the 2003 annual national conference on Digital government research %D 2003 %T New approaches to help users get started with visual interfaces: multi-layered interfaces and integrated initial guidance %A Kang,Hyunmo %A Plaisant, Catherine %A Shneiderman, Ben %X We are investigating new ways to help users learn to use public access interactive tools, in particular for the visual exploration of government statistics. Our work led to a series of interfaces using multi-layered design and a new help method called Integrated Initial Guidance. Multi-layer designs structure an interface so that a simpler interface is available for users to get started and more complex features are accessed as users move through the more advanced layers. Integrated Initial Guidance provides help within the working interface, right at the start of the application. Using the metaphor of "sticky notes" overlaid on top of the functional interface locates the main widgets, demonstrates their manipulation, and explains the resulting actions using preset animation of the interface. Usability testing with 12 participants led to refined designs and guidelines for the design of Integrated Initial Guidance interfaces. %B Proceedings of the 2003 annual national conference on Digital government research %S dg.o '03 %I Digital Government Society of North America %P 1 - 6 %8 2003/// %G eng %U http://dl.acm.org/citation.cfm?id=1123196.1123269 %0 Conference Paper %B 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings %D 2003 %T New eyes for robotics %A Baker, P. %A Ogale, A. S %A Fermüller, Cornelia %A Aloimonos, J. %K 3D motion estimation %K Argus eye %K array signal processing %K Birds %K Calibration %K CAMERAS %K Control systems %K Eyes %K geometric configuration %K imaging %K imaging system %K Layout %K Motion estimation %K multiple stereo configurations %K Robot kinematics %K robot vision %K Robot vision systems %K ROBOTICS %K Robotics and automation %K SHAPE %K shape models %X This paper describes an imaging system that has been designed to facilitate robotic tasks of motion. The system consists of a number of cameras in a network arranged so that they sample different parts of the visual sphere. This geometric configuration has provable advantages compared to small field of view cameras for the estimation of the system's own motion and consequently the estimation of shape models from the individual cameras. The reason is that inherent ambiguities of confusion between translation and rotation disappear. Pairs of cameras may also be arranged in multiple stereo configurations which provide additional advantages for segmentation. Algorithms for the calibration of the system and the 3D motion estimation are provided. %B 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings %I IEEE %V 1 %P 1018- 1023 vol.1 - 1018- 1023 vol.1 %8 2003/10/27/31 %@ 0-7803-7860-1 %G eng %R 10.1109/IROS.2003.1250761 %0 Conference Paper %B Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on %D 2003 %T Nonlinear collusion attacks on independent fingerprints for multimedia %A Zhao,Hong %A M. Wu %A Wang,Z.J. %A Liu,K. J.R %K attacks; %K average %K bounded %K collusion %K computing; %K content %K copies; %K digital %K distribution; %K fingerprinted %K fingerprinting; %K fingerprints; %K Gaussian %K independent %K multimedia %K nonlinear %K perceptual %K quality; %K robustness; %K watermarking; %X Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we investigate average and nonlinear collusion attacks of independent Gaussian fingerprints and study both their effectiveness and the perceptual quality. We also propose the bounded Gaussian fingerprints to improve the perceptual quality of the fingerprinted copies. We further discuss the tradeoff between the robustness against collusion attacks and the perceptual quality of a fingerprinting system. %B Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on %V 5 %P V - 664-7 vol.5 - V - 664-7 vol.5 %8 2003/04// %G eng %R 10.1109/ICASSP.2003.1200058 %0 Conference Paper %B IEEE International Conference on Systems, Man and Cybernetics, 2003 %D 2003 %T Non-parametric expectation maximization: a learning automata approach %A Abd-Almageed, Wael %A El-Osery,A. %A Smith,C.E. %K Automatic speech recognition %K bivariate simulation data %K Computational modeling %K Computer vision %K Density functional theory %K expectation maximization technique %K learning automata %K mixture parameters estimation %K nonparametric expectation maximization %K nonparametric statistics %K optimisation %K parameter estimation %K Parzen Window %K PDF %K probability %K probability density function %K Speech processing %K Speech recognition %K stochastic learning automata %K Stochastic processes %K stochastic technique %X The famous expectation maximization technique suffers two major drawbacks. First, the number of components has to be specified apriori. Also, the expectation maximization is sensitive to initialization. In this paper, we present a new stochastic technique for estimating the mixture parameters. Parzen Window is used to estimate a discrete estimate of the PDF of the given data. Stochastic learning automata is then used to select the mixture parameters that minimize the distance between the discrete estimate of the PDF and the estimate of the expectation maximization. The validity of the proposed approach is verified using bivariate simulation data. %B IEEE International Conference on Systems, Man and Cybernetics, 2003 %I IEEE %V 3 %P 2996- 3001 vol.3 - 2996- 3001 vol.3 %8 2003/10// %@ 0-7803-7952-7 %G eng %R 10.1109/ICSMC.2003.1244347 %0 Journal Article %J ACM Transactions on Computer-Human Interaction (TOCHI) %D 2002 %T Navigation patterns and usability of zoomable user interfaces with and without an overview %A Hornbaek,K. %A Bederson, Benjamin B. %A Plaisant, Catherine %B ACM Transactions on Computer-Human Interaction (TOCHI) %V 9 %P 362 - 389 %8 2002/// %G eng %N 4 %0 Journal Article %J Proceedings of ITCOM %D 2002 %T Network-wide BGP route prediction for traffic engineering %A Feamster, Nick %A Rexford,J. %X The Internet consists of about 13,000 Autonomous Systems (AS’s) that exchange routing information using the BorderGateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS’s. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS’s. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T’s commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering. %B Proceedings of ITCOM %8 2002/// %G eng %0 Journal Article %J Eukaryotic cell %D 2002 %T A new, expressed multigene family containing a hot spot for insertion of retroelements is associated with polymorphic subtelomeric regions of Trypanosoma brucei %A Bringaud,F. %A Biteau,N. %A Melville,S. E. %A Hez,S. %A El‐Sayed, Najib M. %A Leech,V. %A Berriman,M. %A Hall,N. %A Donelson,J. E %A Baltz,T. %B Eukaryotic cell %V 1 %P 137 - 137 %8 2002/// %G eng %N 1 %0 Conference Paper %B Proceedings of the 40th Annual Meeting on Association for Computational Linguistics %D 2002 %T A noisy-channel model for document compression %A Daumé, Hal %A Marcu,Daniel %X We present a document compression system that uses a hierarchical noisy-channel model of text production. Our compression system first automatically derives the syntactic structure of each sentence and the overall discourse structure of the text given as input. The system then uses a statistical hierarchical model of text production in order to drop non-important syntactic and discourse constituents so as to generate coherent, grammatical document compressions of arbitrary length. The system outperforms both a baseline and a sentence-based compression system that operates by simplifying sequentially all sentences in a text. Our results support the claim that discourse knowledge plays an important role in document summarization. %B Proceedings of the 40th Annual Meeting on Association for Computational Linguistics %S ACL '02 %I Association for Computational Linguistics %C Stroudsburg, PA, USA %P 449 - 456 %8 2002/// %G eng %U http://dx.doi.org/10.3115/1073083.1073159 %R 10.3115/1073083.1073159 %0 Conference Paper %B American Control Conference, 2002. Proceedings of the 2002 %D 2002 %T A non-intrusive Kalman filter-based tracker for pursuit eye movement %A Abd-Almageed, Wael %A Fadali,M. S %A Bebis,G. %K Application software %K characterization %K Computer vision %K Current measurement %K deterministic component %K Electric variables measurement %K eye position estimation %K eye tracking %K gaze tracking %K Human computer interaction %K Kalman filter %K Kalman filters %K Lenses %K Motion estimation %K Optical reflection %K pursuit eye movement %K pursuit motion %K random component %K Skin %K tracking %X In this paper, we introduce a new non-intrusive approach to estimating the eye position during pursuit motion of the eye. We introduce a new characterization for the pursuit eye movement. Our characterization is based on the decomposition of the pursuit eye motion into a deterministic component and random component. We use a discrete Kalman filter to estimate the random component and calculate the deterministic component. We add the two components to obtain an estimate of the eye position. Simulation results are provided to illustrate the eye position estimation. %B American Control Conference, 2002. Proceedings of the 2002 %I IEEE %V 2 %P 1443- 1447 vol.2 - 1443- 1447 vol.2 %8 2002/// %@ 0-7803-7298-0 %G eng %U http://ieeexplore.ieee.org/ielx5/7965/22015/01023224.pdf?tp=&arnumber=1023224&isnumber=22015 %R 10.1109/ACC.2002.1023224 %0 Journal Article %J submitted to IEEE Trans. on Image Proc %D 2002 %T Nonlinear collusion attacks on independent multimedia fingerprints %A Zhao,H. %A Wu,M. %A Wang,Z.J. %A Liu,K. J.R %B submitted to IEEE Trans. on Image Proc %8 2002/// %G eng %0 Conference Paper %B Discrete Geometry for Computer Imagery %D 2002 %T Non-manifold decomposition in arbitrary dimensions %A De Floriani, Leila %A Mesmoudi,M. %A Morando,F. %A Puppo,E. %X In this paper we consider the problem of decomposing a nonmanifold n-dimensional object described by an abstract simplicial complex into an assembly of ‘more-regular’ components. Manifolds, which would be natural candidates for components, cannot be used to this aim in high dimensions because they are not decidable sets. Therefore, we define d-quasi-manifolds, a decidable superset of the class of combinatorial d-manifolds that coincides with d-manifolds in dimension less or equal than two. We first introduce the notion of d-quasi-manifold complexes, then we sketch an algorithm to decompose an arbitrary complex into an assembly of quasi-manifold components abutting at non-manifold joints. This result provides a rigorous starting point for our future work, which includes designing efficient data structures for non-manifold modeling, as well as defining a notion of measure of shape complexity of such models. %B Discrete Geometry for Computer Imagery %P 59 - 115 %8 2002/// %G eng %R 10.1007/3-540-45986-3_6 %0 Conference Paper %B Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on %D 2002 %T Numerical study of the influence of the torso on the HRTF %A Gumerov, Nail A. %A Duraiswami, Ramani %A Tang,Z. %B Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on %V 2 %P II–II - II–II %8 2002/// %G eng %0 Journal Article %J DIMACS Mini-Workshop on Quality of Service Issues in the Internet %D 2001 %T Near-optimal design of MP S tunnels with shared recovery %A Fleischer,L. %A Meyerson,A. %A Saniee,I. %A Shepherd,FB %A Srinivasan, Aravind %X We describe the optimization problem associ-ated with the concurrent routing of demands with guar- anteed shared recovery in case of network failures. This problem arises in routing with protection in meshes and is known to be hard. We describe the problem in the context of the efficient design of restorable MP S tunnels in optical networks. The underlying design gives rise to a stochastic optimization problem that is equivalent to a (very) large- scale linear programming (LP) problem that explicitly in- corporates the network failure scenarios. The feasible re- gion for this LP is given by combined packing and cover- ing constraints for concurrent and optimal multicommodity flows. We develop a novel -approximation procedure for this problem and demonstrate its performance for a variety of real network sizes. An attraction of our approach is that its main computation consists of routing flow along a pair of short paths and these paths are easily found. Commer- cial general-purpose LP solvers are typically unable to solve these problems once they become large enough, while our approach scales for large networks. We conclude that the proposed scheme provides guaranteed approximation to the design of restorable MP S tunnels with shared protection within realistic network settings. %B DIMACS Mini-Workshop on Quality of Service Issues in the Internet %8 2001/// %G eng %0 Conference Paper %B Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms %D 2001 %T New approaches to covering and packing problems %A Srinivasan, Aravind %X Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic probabilistic method: showing that a certain randomized approach produces a good approximation with positive probability. This approach seems inherently sequential; by employing the method of alteration we present the first RNC and NC approximation algorithms that match the best sequential guarantees. Extending our approach, we get the first RNC and NC approximation algorithms for certain multi-criteria versions of these problems. We also present the first NC algorithms for two packing and covering problems that are not subsumed by the above result: finding large independent sets in graphs, and rounding fractional Group Steiner solutions on trees. %B Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms %S SODA '01 %I Society for Industrial and Applied Mathematics %C Philadelphia, PA, USA %P 567 - 576 %8 2001/// %@ 0-89871-490-7 %G eng %U http://dl.acm.org/citation.cfm?id=365411.365535 %0 Conference Paper %B Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on %D 2000 %T Nearly optimal expected-case planar point location %A Arya,S. %A Malamatos,T. %A Mount, Dave %K computational geometry %K convex cells %K data structure %K expected search time %K nearly optimal expected-case planar point location %K optimal binary search tree %K planar point location %K planar polygonal subdivision %K polygonal cells %K polygonal subdivision %K probability %K search problems %K search structure %K subdivision %K trees (mathematics) %X We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time. This is a generalization of the classical problem of computing an optimal binary search tree for one-dimensional keys. In the one-dimensional case it has long been known that the entropy H of the distribution is the dominant term in the lower bound on the expected-case search time, and further there exist search trees achieving expected search times of at most H+2. Prior to this work, there has been no known structure for planar point location with an expected search time better than 2H, and this result required strong assumptions on the nature of the query point distribution. Here we present a data structure whose expected search time is nearly equal to the entropy lower bound, namely H+o(H). The result holds for any polygonal subdivision in which the number of sides of each of the polygonal cells is bounded, and there are no assumptions on the query distribution within each cell. We extend these results to subdivisions with convex cells, assuming a uniform query distribution within each cell %B Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on %P 208 - 218 %8 2000/// %G eng %R 10.1109/SFCS.2000.892108 %0 Journal Article %J Proc. IEEE Pacific RIM Conference on Multimedia, Sydney, Australia %D 2000 %T A Neural Network Approach for Predicting Network Resource Requirements in Video Transmission Systems %A Wong,H.S. %A Wu,M. %A Joyce,R.A. %A Guan,L. %A Kung, S.Y. %X Dynamic resource allocation is important for ensuring ef-ficient network utilization in Internet-based multimedia content delivery system. To allow accurate network traf- fic prediction in the case of video delivery, relevant infor- mation based on video contents and the short term traffic pattern has to be taken into account, while the inclusion of non-relevant features will deterioriate the prediction per- formance due to the "curse of dimensionality" problem. In this work, we propose a neural network-based predic- tion system and specifically address the determination of relevant input features for the system. Experiments have shown that the current system is capable of identifying a highly relevant subset of features for traffic prediction given a large number of video content and short-term net- work traffic descriptors. %B Proc. IEEE Pacific RIM Conference on Multimedia, Sydney, Australia %8 2000/// %G eng %0 Journal Article %J Computational Geometry %D 2000 %T New eyes for building models from video %A Fermüller, Cornelia %A Aloimonos, J. %A Brodský,Tomáš %K model building %K shape reconstruction %K structure from motion %K video analysis %X Models of real-world objects and actions for use in graphics, virtual and augmented reality and related fields can only be obtained through the use of visual data and particularly video. This paper examines the question of recovering shape models from video information. Given video of an object or a scene captured by a moving camera, a prerequisite for model building is to recover the three-dimensional (3D) motion of the camera which consists of a rotation and a translation at each instant. It is shown here that a spherical eye (an eye or system of eyes providing panoramic vision) is superior to a camera-type eye (an eye with restricted field of view such as a common video camera) as regards the competence of 3D motion estimation. This result is derived from a geometric/statistical analysis of all the possible computational models that can be used for estimating 3D motion from an image sequence. Regardless of the estimation procedure for a camera-type eye, the parameters of the 3D rigid motion (translation and rotation) contain errors satisfying specific geometric constraints. Thus, translation is always confused with rotation, resulting in inaccurate results. This confusion does not happen for the case of panoramic vision. Insights obtained from this study point to new ways of constructing powerful imaging devices that suit particular tasks in visualization and virtual reality better than conventional cameras, thus leading to a new camera technology. Such new eyes are constructed by putting together multiple existing video cameras in specific ways, thus obtaining eyes from eyes. For a new eye of this kind we describe an implementation for deriving models of scenes from video data, while avoiding the correspondence problem in the video sequence. %B Computational Geometry %V 15 %P 3 - 23 %8 2000/02// %@ 0925-7721 %G eng %U http://www.sciencedirect.com/science/article/pii/S0925772199000449 %N 1–3 %R 10.1016/S0925-7721(99)00044-9 %0 Book Section %B Biologically Motivated Computer VisionBiologically Motivated Computer Vision %D 2000 %T New Eyes for Shape and Motion Estimation %A Baker,Patrick %A Pless,Robert %A Fermüller, Cornelia %A Aloimonos, J. %E Lee,Seong-Whan %E Bülthoff,Heinrich %E Poggio,Tomaso %X Motivated by the full field of view of insect eyes and their fast and accurate estimation of egomotion, we constructed a system of cameras to take advantage of the full field of view (FOV) constraints that insects use. In this paper, we develop a new ego-motion algorithm for a rigidly mounted set of cameras undergoing arbitrary rigid motion. This egomotion algorithm combines the unambiguous components of the motion computed by each separate camera. We prove that the cyclotorsion is resistant to errors and show this empirically. We show how to calibrate the system with two novel algorithms, one using secondary cameras and one using self calibration. Given this system calibration, the new 3D motion algorithm first computes the rotation and then the 3D translation. We apply this algorithm to a camera system constructed with four rigidly mounted synchronized cameras pointing in various directions and present motion estimation results at www.cfar.umd.edu/ pbaker/argus.html. %B Biologically Motivated Computer VisionBiologically Motivated Computer Vision %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 1811 %P 23 - 47 %8 2000/// %@ 978-3-540-67560-0 %G eng %U http://dx.doi.org/10.1007/3-540-45482-9_12 %0 Conference Paper %B Mustererkennung 2000, 22. DAGM-Symposium %D 2000 %T A New Framework for Multi-camera Structure from Motion %A Neumann, J. %A Fermüller, Cornelia %A Aloimonos, J. %B Mustererkennung 2000, 22. DAGM-Symposium %P 75 - 82 %8 2000/// %G eng %0 Journal Article %J Linear Algebra and its Applications %D 2000 %T A new relative perturbation theorem for singular subspaces %A Li,Ren-Cang %A Stewart, G.W. %K Multiplicative perturbation %K Relative gap %K Relative perturbation theory %K Singular subspace %X This note addresses the sensitivity of singular subspaces of a matrix under relative perturbations. It employs a new technique of separating a multiplicative perturbation D into two components: one is the distance of a scalar multiple of D to the nearest unitary matrix Q and the other is the distance of Q to the identity. Consequently, the new bounds reflect the intrinsic differences in how left and right multiplicative perturbations affect left and right singular subspaces. %B Linear Algebra and its Applications %V 313 %P 41 - 51 %8 2000/07/01/ %@ 0024-3795 %G eng %U http://www.sciencedirect.com/science/article/pii/S0024379500000744 %N 1–3 %R 10.1016/S0024-3795(00)00074-4 %0 Conference Paper %B Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures %D 2000 %T A no-busy-wait balanced tree parallel algorithmic paradigm %A Vishkin, Uzi %X Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy wait to another thread. A thread can proceed till its termination, but no new threads can be formed. What kind of problems can such restrictive algorithms solve and still be competitive in the total number of operations they perform with the fastest serial algorithm for the same problem?Intrigued by this informal question, we considered one of the most elementary parallel algorithmic paradigms, that of balanced binary trees. The main contribution of this paper is a new balanced (not necessarily binary) tree no-busy-wait paradigm for parallel algorithms; applications of the basic paradigm to two problems are presented: building heaps, and executing parallel tree contraction (assuming a preparatory stage); the latter is known to be applicable to evaluating a family of general arithmetic expressions. For putting things in context, we also discuss our “PRAM-on-chip” vision (actually a small update to it), presented at SPAA98. %B Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures %S SPAA '00 %I ACM %C New York, NY, USA %P 147 - 155 %8 2000/// %@ 1-58113-185-2 %G eng %U http://doi.acm.org/10.1145/341800.341818 %R 10.1145/341800.341818 %0 Journal Article %J Solid-State Electronics %D 2000 %T Numerical simulation of small-signal microwave performance of 4H–SiC MESFET %A Huang,Mingwei %A Mayergoyz, Issak D %A Goldsman,Neil %X Small-signal high frequency characteristics of 4H–SiC MESFET has been studied by using two-dimensional numerical drift-diffusion model in frequency domain. Non-ideal Schottky boundary conditions have been introduced that take into account a thin interfacial layer and interface energy states. It has been demonstrated that the 10 dB/dec small-signal current gain roll-off can be attributed to the existence of high density interface states at the metal–semiconductor interface. It has been found that as the gate length is reduced to 0.1 μm, fT and fmax may reach as high as 30 and 62 GHz, respectively. %B Solid-State Electronics %V 44 %P 1281 - 1287 %8 2000/07/01/ %@ 0038-1101 %G eng %U http://www.sciencedirect.com/science/article/pii/S0038110100000253 %N 7 %R 10.1016/S0038-1101(00)00025-3 %0 Journal Article %J Components and Packaging Technologies, IEEE Transactions on %D 1999 %T Nano-to-millimeter scale integrated systems %A Last,H.R. %A Deeds,M. %A Garvick,D. %A Kavetsky,R. %A Sandborn,P. A. %A Magrab,E. B. %A Gupta,S.K. %K fabrication technology %K In2m %K integrated nano to millimeter system %K micromechanical devices %K nanotechnology %X Over the last several years various industries have been developing nano, micro, and millimeter scale technologies, which have resulted in components ranging from quantum transistors, to widely commercialized integrated circuits, to microelectromechanical sensors. A common emphasis of these fabrication industries has been on the integration of different functions in miniaturized systems; however, the technology currently used to realize these systems is monolithic. A unique class of hybrid technology systems is Integrated nano to millimeter (In2m) systems. An In2m system typically has components spanning multiple sizes, diverse technology domains, and mixtures of electrical, mechanical, thermal, chemical, fluidic, and biological functions %B Components and Packaging Technologies, IEEE Transactions on %V 22 %P 338 - 343 %8 1999/06// %@ 1521-3331 %G eng %N 2 %R 10.1109/6144.774758 %0 Book Section %B Internet Programming LanguagesInternet Programming Languages %D 1999 %T Network Programming Using PLAN %A Hicks, Michael W. %A Kakkar,Pankaj %A Moore,Jonathan %A Gunter,Carl %A Nettles,Scott %E Bal,Henri %E Belkhouche,Boumediene %E Cardelli,Luca %X We present here a methodology for programming active networks in the environment defined by our new language PLAN (Packet Language for Active Networks). This environment presumes a two-level architecture consisting of: 1. active packets carrying PLAN code; and 2. downloadable, node-resident services written in more general-purpose languages. We present several examples which illustrate how these two features can be combined to implement various network functions. %B Internet Programming LanguagesInternet Programming Languages %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 1686 %P 127 - 143 %8 1999/// %@ 978-3-540-66673-8 %G eng %U http://dx.doi.org/10.1007/3-540-47959-7_7 %0 Conference Paper %B Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings %D 1999 %T Network service selection for distributed multimedia applications %A Simon,R. %A Sood,A. %A Mundur, Padma %K Admission control %K Application software %K application-adequate end-to-end service %K Bandwidth %K Communication system traffic control %K Computer science %K Delay %K distributed processing %K end-to-end delivery delay control %K flexibility %K high-bandwidth distributed multimedia applications %K interactive multimedia %K multimedia systems %K network service selection %K network throughput %K nonpreemptive earliest deadline first %K queueing theory %K Regulators %K system support %K telecommunication services %K Throughput %K Traffic control %K weighted fair queueing %X An important question in the development of system support for distributed multimedia is the type of network service offered to applications. This paper compares two network service disciplines: weighted fair queueing (WFQ) and non-preemptive earliest deadline first (NEDF). We show that, for a broad class of high-bandwidth distributed multimedia applications, WFQ outperforms NEDF in terms of network throughput while still providing an application-adequate end-to-end service. This result holds despite the fact that NEDF offers applications far greater flexibility in terms of control over end-to-end delivery delay %B Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings %I IEEE %P 388 - 392 %8 1999/// %@ 0-7695-0300-4 %G eng %R 10.1109/ICCIMA.1999.798561 %0 Journal Article %J Journal of Cognitive Neuroscience %D 1999 %T A neural network model of lateralization during letter identification %A Shevtsova,N. %A Reggia, James A. %B Journal of Cognitive Neuroscience %V 11 %P 167 - 181 %8 1999/// %G eng %N 2 %0 Conference Paper %B Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms %D 1999 %T New algorithmic aspects of the Local Lemma with applications to routing and partitioning %A Leighton,Tom %A Rao,Satish %A Srinivasan, Aravind %B Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms %S SODA '99 %I Society for Industrial and Applied Mathematics %C Philadelphia, PA, USA %P 643 - 652 %8 1999/// %@ 0-89871-434-6 %G eng %U http://dl.acm.org/citation.cfm?id=314500.314886 %0 Journal Article %J Journal of Experimental Algorithmics (JEA) %D 1998 %T A new deterministic parallel sorting algorithm with an experimental evaluation %A Helman,David R. %A JaJa, Joseph F. %A Bader,David A. %K generalized sorting %K integer sorting %K Parallel algorithms %K parallel performance %K sorting by regular sampling %X We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead. Moreover, unlike previous variations, our algorithm efficiently handles the presence of duplicate values without the overhead of tagging each element with a unique identifier. This algorithm was implemented in SPLIT-C and run on a variety of platforms, including the Thinking Machines CM-5, the IBM SP-2-WN, and the Cray Research T3D. We ran our code using widely different benchmarks to examine the dependence of our algorithm on the input distribution. Our experimental results illustrate the efficiency and scalability of our algorithm across different platforms. In fact, the performance compares closely to that of our random sample sort algorithm, which seems to outperform all similar algorithms known to the authors on these platforms. Together, their performance is nearly invariant over the set of input distributions, unlike previous efficient algorithms. However, unlike our randomized sorting algorithm, the performance and memory requirements of our regular sorting algorithm can be deterministically guaranteed. %B Journal of Experimental Algorithmics (JEA) %V 3 %8 1998/09// %@ 1084-6654 %G eng %U http://doi.acm.org/10.1145/297096.297128 %R 10.1145/297096.297128 %0 Journal Article %J VLSI DESIGN %D 1998 %T A New Method to Recover Vectorial Electric Fields and Current Densities from Unstructured Meshes %A Kerr,D. C. %A Mayergoyz, Issak D %X In the context of 2-D and 3-D unstructured mixed-element meshes, a new method of recover-ing vectorial fields and currents in multidimensional simulation is introduced. The new method, called the method of edge elements, directly interpolates the projections of the vec- tors on the edges of an element into its interior. The new method is compared to two other recovery methods on the basis of resolution, consistency, and implementation ease. %B VLSI DESIGN %V 6 %P 117 - 122 %8 1998/// %G eng %N 1/4 %0 Journal Article %J Proc Natl Acad Sci USA %D 1998 %T Nucleotide sequence diversity at the alcohol dehydrogenase 1 locus in wild barley (ıt Hordeum vulgare ssp. ıt spontaneum): an evaluation of the background selection hypothesis %A Cummings, Michael P. %A Clegg,M. T %X The background selection hypothesis predicts a reduction in nucleotide site diversity and an excess of rare variants, owing to linkage associations with deleterious alleles. This effect is expected to be amplified in species that are predominantly self-fertilizing. To examine the predictions of the background selection hypothesis in self-fertilizing species, we sequenced 1,362 bp of adh1, a gene for alcohol dehydrogenase (Adh; alcohol:NAD+ oxidoreductase, EC 1.1.1.1), in a sample of 45 accessions of wild barley, Hordeum vulgare ssp. spontaneum, drawn from throughout the species range. The region sequenced included 786 bp of exon sequence (part of exon 4, all of exons 5-9, and part of exon 10) and 576 bp of intron sequence (all of introns 4-9). There were 19 sites polymorphic for nucleotide substitutions, 8 in introns, and 11 in exons. Of the 11 nucleotide substitutions in codons, 4 were synonymous and 7 were nonsynonymous, occurring uniquely in the sample. There was no evidence of recombination in the region studied, and the estimated effective population size (Ne) based on synonymous sites was approximately 1.8-4.2 x 10(5). Several tests reveal that the pattern of nonsynonymous substitutions departs significantly from neutral expectations. However, the data do not appear to be consistent with recovery from a population bottleneck, recent population expansion, selective sweep, or strong positive selection. Though several features of the data are consistent with background selection, the distributions of polymorphic synonymous and intron sites are not perturbed toward a significant excess of rare alleles as would be predicted by background selection. %B Proc Natl Acad Sci USA %V 95 %P 5637 - 5642 %8 1998/05// %G eng %N 10 %0 Conference Paper %B Proceedings of the 1997 symposium on Interactive 3D graphics %D 1997 %T Navigating static environments using image-space simplification and morphing %A Darsa,Lucia %A Costa Silva,Bruno %A Varshney, Amitabh %B Proceedings of the 1997 symposium on Interactive 3D graphics %S I3D '97 %I ACM %C New York, NY, USA %8 1997/// %@ 0-89791-884-3 %G eng %U http://doi.acm.org/10.1145/253284.253298 %R 10.1145/253284.253298 %0 Journal Article %J Journal of Algorithms %D 1997 %T A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees %A Fekete,Sándor P %A Khuller, Samir %A Klemmstein,Monika %A Raghavachari,Balaji %A Young,Neal %X Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, the problem of computing a low-weight spanning tree such that the degree of each vertex is at most its specified bound is considered. In particular, modifying a given spanning treeTusingadoptionsto meet the degree constraints is considered. A novel network-flow-based algorithm for finding a good sequence of adoptions is introduced. The method yields a better performance guarantee than any previous algorithm. If the degree constraintd(v) for eachvis at least 2, the algorithm is guaranteed to find a tree whose weight is at most the weight of the given tree times 2 − min{(d(v) − 2)/(degT(v) − 2) : degT(v) > 2}, where degT(v) is the initial degree ofv. Equally importantly, it takes this approach to the limit in the following sense: if any performance guarantee that is solely a function of the topology and edge weights of a given tree holds foranyalgorithm at all, then it also holds for the given algorithm. Examples are provided in which no lighter tree meeting the degree constraint exists. Linear-time algorithms are provided with the same worst-case performance guarantee. ChoosingTto be a minimum spanning tree yields approximation algorithms with factors less than 2 for the general problem on geometric graphs with distances induced by variousLpnorms. Finally, examples of Euclidean graphs are provided in which the ratio of the lengths of an optimal Traveling Salesman path and a minimum spanning tree can be arbitrarily close to 2. %B Journal of Algorithms %V 24 %P 310 - 324 %8 1997/08// %@ 0196-6774 %G eng %U http://www.sciencedirect.com/science/article/pii/S0196677497908622 %N 2 %R 10.1006/jagm.1997.0862 %0 Journal Article %J Displays %D 1997 %T The next generation of graphical user interfaces: information visualization and better window management %A Shneiderman, Ben %B Displays %V 17 %P 125 - 129 %8 1997/05/01/ %@ 0141-9382 %G eng %U http://www.sciencedirect.com/science/article/pii/S014193829700005X %N 3–4 %R 10.1016/S0141-9382(97)00005-X %0 Journal Article %J Numerische Mathematik %D 1997 %T A note on conjugate gradient convergence %A Naiman, A. E %A Babuška, I. M %A Elman, Howard %B Numerische Mathematik %V 76 %P 209 - 230 %8 1997/// %G eng %N 2 %0 Conference Paper %B Computer Aided Verification %D 1996 %T The NCSU concurrency workbench %A Cleaveland, Rance %A Sims,S. %B Computer Aided Verification %P 394 - 397 %8 1996/// %G eng %0 Journal Article %J Schizophrenia Bulletin %D 1996 %T A neural model of positive schizophrenic symptoms %A Ruppin,E. %A Reggia, James A. %A Horn,D. %B Schizophrenia Bulletin %V 22 %P 105 - 123 %8 1996/// %G eng %N 1 %0 Journal Article %J Advances in Neural Information Processing Systems %D 1995 %T A neural model of delusions and hallucinations in schizophrenia %A Ruppin,E. %A Reggia, James A. %A Horn,D. %B Advances in Neural Information Processing Systems %P 149 - 156 %8 1995/// %G eng %0 Journal Article %J The British Journal of Psychiatry %D 1995 %T A neural model of memory impairment in diffuse cerebral atrophy %A Ruppin,E. %A Reggia, James A. %B The British Journal of Psychiatry %V 166 %P 19 - 19 %8 1995/// %G eng %N 1 %0 Journal Article %J AIP Conference Proceedings %D 1995 %T Next generation network management technology %A Baras,John S %A Atallah,George C %A Ball,Mike %A Goli,Shravan %A Karne,Ramesh K %A Kelley,Steve %A Kumar,Harsha %A Plaisant, Catherine %A Roussopoulos, Nick %A Schneiderman,Ben %A Srinivasarao,Mulugu %A Stathatos,Kosta %A Teittinen,Marko %A Whitefield,David %X Today’s telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be ‘‘mixed media’’ (copper, fiber‐optic, radio, and satellite); the subnetworks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be ‘‘multimedia’’ (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g., data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub‐networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object‐oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment. © 1995 American Institute of Physics %B AIP Conference Proceedings %V 325 %P 75 - 82 %8 1995/01/25/ %@ 0094243X %G eng %U http://proceedings.aip.org/resource/2/apcpcs/325/1/75_1?isAuthorized=no %N 1 %R doi:10.1063/1.47255 %0 Conference Paper %B Parallel Processing Symposium, 1995. Proceedings., 9th International %D 1995 %T A note on reducing parallel model simulations to integer sorting %A Matias,E. %A Vishkin, Uzi %B Parallel Processing Symposium, 1995. Proceedings., 9th International %P 208 - 212 %8 1995/// %G eng %0 Journal Article %J Communications of the ACM %D 1994 %T Navigating in hyperspace: designing a structure-based toolbox %A Rivlin,Ehud %A Botafogo,Rodrigo %A Shneiderman, Ben %B Communications of the ACM %V 37 %P 87 - 96 %8 1994/02// %@ 0001-0782 %G eng %U http://doi.acm.org/10.1145/175235.175242 %N 2 %R 10.1145/175235.175242 %0 Journal Article %J Artificial Intelligence in Medicine %D 1994 %T A neural model of cortical map reorganization following a focal lesion %A Armentrout,S. L %A Reggia, James A. %A Weinrich,M. %B Artificial Intelligence in Medicine %V 6 %P 383 - 400 %8 1994/// %G eng %N 5 %0 Report %D 1994 %T Next Generation Network Management Technology %A Atallah,George C %A Ball,Michael O %A Baras,John S %A Goli,Shravan K %A Karne,Ramesh K %A Kelley,Stephen %A Kumar,Harsha P. %A Plaisant, Catherine %A Roussopoulos, Nick %A Shneiderman, Ben %A Srinivasarao,Mulugu %A Stathatos,Kostas %A Teittinen,Marko %A Whitefield,David %K Constraints for Network Management. %K Network Configuration Management %K network management %K Object Oriented Data Base Model for Network Management %K Rules %K Systems Integration %K Visual Information Management for Network Configuration Management %X Today's telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be ﲭixed media (copper, fiber- optic, radio, and satellite); the sub networks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be ﲭultimedia (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g. data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object-oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment.- A revised version of this technical report has been published in