检索结果-内蒙古大学图书馆

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： N. DeClaris D. Harman C. Faloutsos S. Dumais D. Oard School of Medicine and College of Engineering University of Maryland College Park MD USA Computer Systems Laboratory National Institute for Standards and Technology Gaithersburg MD USA Department of Computer Science and Institute for Systems Research University of Maryland College Park MD USA Information Science Research Group Bellcore Morristown NJ USA Department of Electrical Engineering University of Maryland College Park MD USA

This paper is intended to serve as a springboard for a panel discussion with audience participation on information filtering and retrieval. Medical informatics is an emerging specialty which links medicine and technology. With the unprecedented availability of digital information, retrieval and filtering are becoming important aspects of medical informatics. The authors offer an overview of medical applications for filtering and retrieval, and introduce important state-of-the-art techniques in a way that does not presuppose prior knowledge in this field. This provides a basis for understanding issues and research developments in this field. The ensuing discussion examines challenges and opportunities for workers in this field.< >

关键词： Information filtering Information retrieval Biomedical informatics Information filters Digital filters Medical services Biomedical equipment

来源：评论

学校读者我要写书评

暂无评论

3-D EDGE ELEMENT ANALYSIS OF DIELECTRIC-LOADED RESONANT CAVITIES

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1994年第1期7卷 35-41页

作者： ZHU, ZL DAVIES, JB FERNANDEZ, FA Department of Electronic and Electrical Engineering University College London WC1E 7JE U.K. On leave from the Department of Radio Electronics Peking University Beijing 100871 People's Republic of China. Le-zhu Zhou was born in Guizhou China in 1944. He received the B.S. degree in Physics and M.S. degree in Electronics from Peking University Beijing China in 1968 and 1981 respectively. Since 1981 he has been on the staff of the Department of Radio-Electronics of Peking University. In 1983 he was appointed as a Lecturer. In 1989 he became an Associate Professor. Since September 1991 he has been doing research as an Academic Visitor at the Department of Electronic and Electrical Engineering of University College London. He has been engaged in the electromagnetic field theory and its application. Recently his research interest has been in the computer modelling of optical and microwave structures by using edge element methods. J. Brian Davies was born in Liverpool England in 1932. He received the B.A. degree in mathematics in 1955 from Jesus College Cambridge England. He received the M.Sc. degree in mathematics the Ph.D. degree in mathematical physics and the D.Sc. (Eng) degree in engineering in 1957 1960 and 1980 respectively from the University of London England. From 1955 to 1963 he worked at the Mullard Research Laboratories Salford Surrey England except for two years spent at University College London. In 1963 he joined the academic staff of the Department of Electrical Engineering University of Sheffield England. Since 1967 he has been on the staff at University College London where he is now Professor of Electrical Engineering. From 1971 to 1972 he was Visiting Scientist at the National Bureau of Standards Boulder CO. In 1983 he was a Visitor at the Department of Engineering Science University of Oxford England. From 1988 to 1989 he was a Visiting Professor at the University of Colorado Boulder CO. His research interests have included microwave and optical aspects of electr

The eigenmodes in electromagnetic cavities, loaded with arbitrarily shaped dielectric materials, are computed by the edge element method. The computation shows that the well known 'spurious modes' no longer appear. Formulae are given and verified so that the number of zero eigenvalues, which come from del x H = 0, may be accurately predicted. Formulae for the order and density of the global matrices are given for a rectangular cavity regularly divided into bricks and tetrahedra, allowing an associated comparison between the contrasting edge and nodal element formulations. Comparison of the computed results with available theoretical and previously published data show the edge element approach to be a robust, accurate and effective method.

关键词： Dielectric waveguides

来源：评论

学校读者我要写书评

暂无评论

Networks with quantum amplifiers

Networks with quantum amplifiers

引用

Conference on Lasers and Electro-Optics Europe (CLEO EUROPE)

作者： A. Karlsson L. Gillner E. Goobar G. Bjork Department of Electronics Royal Institute of Technology (KTH) Electrum 229 164 40 Kista Sweden ERATO Quantum Fluctuation project Edward L. Ginzton Laboratory Stanford University Stanford CA 94305 USA Fibre Optics Research Centre Ericsson Telecom S-164 81 Stockholm Sweden Department of Electrical and Computer Engineering University of California Santa Barbara CA 93106 USA

As the best fibre optical systems are approaching fundamental quantum limits, the role of Heisenberg's uncertainty principle in communications has shifted from being of academic interest to becoming an (un)practic... 详细信息

关键词： Optical noise Semiconductor device noise Semiconductor optical amplifiers Optical amplifiers Erbium-doped fiber amplifier Noise figure Optical fiber polarization Stimulated emission Optical crosstalk Optical receivers

来源：评论

学校读者我要写书评

暂无评论

Fast parallel constraint satisfaction 20th

引用

20th International Colloquium on Automata, Languages and Programming, ICALP 1993

作者： Kirousis, Lefteris M. Department of Computer Engineering and Informatics University of Patras Rio Patras265 00 Greece Computer Technology Institute P.O. Box 1122 Patras261 10 Greece

ISBN: (纸本)9783540569398

A Constraint Satisfaction Problem (CSP) involves searching for an assignment of values to a given set of variables so that the values assigned satisfy a given set of constraints. The general CSP is NP-complete. To confront the intractability of the general CSP, relaxation procedures have been devised: instead of searching for a globally consistent assignment of values to the variables, try to restrict the domain of values of each variable in a way that ensures local consistency only. The relaxation procedures are efficient, but have been proved to be inherently sequential. In this paper, we define a class of CSPs for which a global solution can be found by a fast parallel algorithm. No relaxation preprocessing is needed for the parallel algorithm to work. The result is motivated from the problem of labelling a 2-D line drawing of a 3-D object by the Clowes-Huffman-Malik labelling scheme--an important application of CSP in computer vision. For such a labelling CSP, the constraint graph can be general, but the constraint relations are usually of the type we call implicational. It is shown here that a CSP with this type of constraint relations (and no restrictions on its graph) can be solved by an efficient (i.e., with polynomial time complexity) sequential algorithm. Also, it is shown that it can be solved by a fast parallel algorithm that executes in time O(log3n) with O((m + n3)/logn) processors on a Exlusive-Read-Exclusive-Write Parallel Random Access Machine (n is the number of variables and m is the number of constrain relations-the constraint relations may have arity more than two). © Springer-Verlag Berlin Heidelberg 1993.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Optimal pr-qmf design for subband image coding

引用

Journal of Visual Communication and Image Representation 1993年第3期4卷 242-253页

作者： Caglar, H. Liu, Y. Akansu, A.N. Department of Electrical and Computer Engineering Center for Communications and Signal Processing Research New Jersey Institute of Technology Newark NJ 07102 United States TUBITAK Research Center Gebze Turkey

A multivariable optimization problem is set to design 2-band PR-QMFs. The energy compaction, aliasing energy, unit step response, zero-mean high-pass filter, uncorrelated subband signals, constrained nonlinearity of the phase-response, and the given input statistics are simultaneously considered in the proposed optimal filter design technique. A set of optimal PR-QMF solutions and the optimization criteria along with their objective performance is given for comparison. This PR-QMF design approach leads to an input driven adaptive subband filter bank structure. It is shown that the optimal filters objectively outperform the well known fixed PR-QMFs in the literature. The proposed PR-QMF design technique provides the mathematical tools for subjective performance improvements in subband image and video coding applications. © 1993 academic Press. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for checking the atomicity of a run of read and write operations 7th

引用

7th International Workshop on Distributed Algorithms, WDAG 1993

作者： Kirousis, Lefteris M. Veneris, Andreas G. Department of Computer Engineering and Informatics University of Patras Rion265 00 Greece Computer Technology Institute P.O. Box 1122 Patras261 10 Greece Department of Computer Science University of Illinois at Urbana-Champaign Room 2412 DCL 1304 West Springfield Avenue UrbanaIL61801 United States

ISBN: (纸本)9783540572718

Let X1,…, Xc be variables shared by a number of processors p1,…, Pq which operate in a totally asynchronous and wait-free manner. An operation by a processor is either a write to one of the variables or a read of the values of all variables. Operations are not assumed to be instantaneous and may arbitrarily overlap in time. A succession of possibly overlapping operations a1,…, an (i.e., a run) is said to be atomic, if these operations can be serialized in a way compatible with any existing precedences among them and so that any read operation returns for each variable the value of the most recent —with respect to the serialization— write operation on this variable. This paper examines the complexity of the combinatorial problem of testing a run for atomicity. First it is pointed out that when there is only one shared variable or when only one processor is allowed to write to each variable, known theorems lead to polynomial-time algorithms for checking the atomicity of a run (the variable of the time-complexity function is the number of operations in the run). It is then proved that checking atomicity has polynomial-time complexity in the general case of more than one variables and with all procesors allowed to read and write. For the proof, the atomicity problem is reduced to the problem of consecutive 1s in matrices. The reduction entails showing a combinatorial result which might be interesting on its own. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Documentation of requirements for computer systems

Documentation of requirements for computer systems

引用

IEEE International Symposium on Requirements engineering

作者： A.J. van Schouwen D.L. Parnas J. Madey Bell Northern Research Limited Ottawa ONT Canada Communications Research Laboratory Department of Electrical and Computer Engineering McMaster University Hamilton ONT Canada Institute of Informatics University of Warmia and Mazury Warsaw Poland

A functional approach to specifying the requirements of a computer system is discussed. The method allows system requirements to be documented, whether the system is implemented using a computer and peripheral devices, or, for example, relays and analog components. The method is a refinement of the method used in the A-7 aircraft software requirements model document. The approach is illustrated with examples derived from a software requirements document for a water level monitoring system.< >

关键词： Documentation Software design computer peripherals Buildings Software systems Analog computers Relays computerized monitoring Aerospace engineering Design engineering

来源：评论

学校读者我要写书评

暂无评论

A framework for performance engineering during information system development 4th

引用

4th International Conference on Advanced Information Systems engineering, CAiSE 1992

作者： Opdahl, Andreas L. Sølvberg, Arne The University of Trondheim Norway Department of Informatics Faculty of Nature Sciences College of Arts and Science Norway Information Systems Group Department of Electrical Engineering and Computer Science The Norwegian Institute of Technology Norway

ISBN: (纸本)9783540554813

Software performance engineering aims at predicting and improving the performance of applications during development and in production. This paper presents a framework for performance engineering of information systems with emphasis on parameter estimation support. The need for performance engineering of information systems is discussed. Views of information system and performance modelling are presented. It is shown how application specifcations can be extended with performance annotations. The resulting framework is applied to predict and improve the performance of projected applications during development. Sensitivity analysis is supported to point out performance bottlenecks in the application and suggest which parameters to estimate with most care. Target platform modelling is provided to relieve the information system developer from assessing the performance of the target platform and operating system software. The framework is realised in terms of the PrM language for software specification. Finally, some conclusions are offered. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Quantitative assessment of 12-lead ECG synthesis using CAVIAR

引用

Journal of Electrocardiology 1992年第SUPPL.期25卷 137-142页

作者： Scherer, Julie Ann Rubel, Paul Fayn, Jocelyne Willems, Jos L. Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor MI United States National Institute of Health and Medical Research INSERM U121 Lyon France Department of Medical Informatics Katholieke Universiteit Leuven Belgium

The objective of this study is to assess the performance of patient-specific segment-specific (PSSS) synthesis in QRST complexes using CAVIAR, a new method of the serial comparison for electrocardiograms and vectorcardiograms. A collection of 250 multi-lead recordings from the Common Standards for Quantitative Electrocardiography (CSE) diagnostic pilot study is employed. QRS and ST-T segments are independently synthesized using the PSSS algorithm so that the mean-squared error between the original and estimated waveforms is minimized. CAVIAR compares the recorded and synthesized QRS and ST-T segments and calculates the mean-quadratic deviation as a measure of error. The results of this study indicate that estimated QRS complexes are good representatives of their recorded counterparts, and the integrity of the spatial information is maintained by the PSSS synthesis process. Analysis of the ST-T segments suggests that the deviations between recorded and synthesized waveforms are considerably greater than those associated with the QRS complexes. The poorer performance of the ST-T segments is attributed to magnitude normalization of the spatial loops, low-voltage passages, and noise interference. Using the meanquadratic deviation and CAVIAR as methods of performance assessment, this study indicates that the PSSS-synthesis algorithm accurately maintains the signal information within the 12-lead electrocardiogram. © 1993.

关键词： 12-lead ECG CAVIAR ECG serial analysis ECG synthesis

来源：评论

学校读者我要写书评

暂无评论

Nonlinear analog networks for image smoothing and segmentation

引用

Journal of VLSI Signal Processing 1991年第1-2期3卷 53-68页

作者： Lumsdaine, A. Wyatt Jr., J.L. Elfadel, I.M. Research Laboratory of Electronics Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge 02139 MA United States

Image smoothing and segmentation algorithms are frequently formulated as optimization problems. Linear and nonlinear (reciprocal)resistive networks have solutions characterized by an extremum principle. Thus, appropriately designed networks can automatically solve certain smoothing and segmentation problems in robot vision. This paper considers switched linear resistive networks and nonlinear resistive networks for such tasks. Following [1] the latter network type is derived from the former via an intermediate stochastic formulation, and a new result relating the solution sets of the two is given for the "zero temperature" limit. We then present simulation studies of several continuation methods that can be gracefully implemented in analog VLSI and that seem to give "good" results for these nonconvex optimization problems. © 1991 Kluwer academic Publishers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：