Scispace (Formerly Typeset)
  1. Home
  2. Topics
  3. Aliasing (computing)
  4. 1987
  1. Home
  2. Topics
  3. Aliasing (computing)
  4. 1987
Showing papers on "Aliasing (computing) published in 1987"
Proceedings Article•10.1145/317426.317440•
SuperBook: an automatic tool for information exploration—hypertext?

[...]

Joel R. Remde1, Louis M. Gomez1, Thomas K. Landauer1•
Telcordia Technologies1
1 Nov 1987
TL;DR: Although SuperBook and hypertext share common goals of improved search and navigation, SuperBook is designed for accessing existing documents while most hypertext systems are better suited for authoring new information structures.
Abstract: The goals and methods of the text browser, SuperBook, are compared with those of hypertext systems in general. SuperBook, intended to provide improved access to text existing in electronic form, employs cognitive tools arising from human computer interaction research, such as full-text indexing, adaptive aliasing, and dynamic views of hierarchical information. Superbook automatically preprocesses on-line text written for paper publication, and produces a multi-window display, including a dynamic table of contents, pages of text, and a history of search words. Although SuperBook and hypertext share common goals of improved search and navigation, SuperBook is designed for accessing existing documents while most hypertext systems are better suited for authoring new information structures. Further studies are needed to evaluate the effectiveness of each of these kinds of systems.

258 citations

Journal Article•10.1109/MDT.1987.295105•
Aliasing Errors in Signature in Analysis Registers

[...]

Thomas Walter Williams1, W. Daehn, M. Gruetzner, C.W. Starke1•
IBM1
01 Mar 1987-IEEE Design & Test of Computers
TL;DR: The results show that when p, the probability that an error will occur at a network output, is close to 1/2, there is a bound of the aliasing error and primitive polynomials are much better with respect to aliasing.
Abstract: The authors discuss aliasing errors in signature analysis registers for self-testing networks and review analytical results. The results show that when p, the probability that an error will occur at a network output, is close to 1/2, there is a bound of the aliasing error. The analysis uses a graph to represent the probability of transition, the Markov process, and z-transforms to analyze the behavior of the signature analysis register. For very small p(p?0) and very large p(p?1), the aliasing error solution for primitive polynomials is a series of terms (1-?)n in magnitude (where n is the number of random patterns being applied to the network or the length of the network output sequence). As compared with nonprimitive polynomials, whose solution is n(1-?)n or n2(1-?)n, in general primitive polynomials are much better with respect to aliasing. Simulation results are shown for aliasing errors for these polynomials, which give insight as to how aliasing occurs.

92 citations

Journal Article•10.1364/JOSAA.4.001530•
Aliasing in the parafovea with incoherent light.

[...]

Robert A. Smith1, Peter F. Cass1•
University of New Hampshire1
01 Aug 1987-Journal of The Optical Society of America A-optics Image Science and Vision
TL;DR: In this article, the authors compared discrimination and detection in the parafovea for oblique, cathode-ray-tube-generated, square-wave gratings, and found that the site of the aliasing is neural rather than receptoral.
Abstract: We compared discrimination and detection in the parafovea for oblique, cathode-ray-tube-generated, square-wave gratings. There is a band of frequencies between roughly 10 and 20 cycles/deg wherein such gratings are detected only in an apparently aliased form. The existence of aliasing is consistent with the cone density and optical quality of the parafoveal visual system, but the spatial frequency at which the aliasing is observed is only about half of what is suggested by cone density. The reason for this result is unclear, but one provocative possibility is that the site of the aliasing is neural rather than receptoral.

57 citations

Journal Article•10.1088/0143-0815/8/4A/011•
Limitations in hardware design in impedance imaging

[...]

A.D. Seagar, Brian H. Brown
01 Nov 1987-Clinical Physics and Physiological Measurement
TL;DR: The design is analysed at the functional rather than electronic level, so the results are of general use and factors considered include the number of measurements, speed of data collection, noise, bandwidth, isolation, common mode feedback, dynamic range, and quantisation.
Abstract: The collection of data suitable for impedance imaging is a well defined task. Once the number of electrodes is chosen, it is possible to specify the number of independent measurements which must be made. Having done so, a data collection system can be designed; preferably with the view to both maximising the speed of data collection and minimising the noise on the measurements. The former is desirable to eliminate aliasing when taking measurements on regions in which the conductivity varies with time, the latter to ensure maximum image quality. When designing such a system many practical problems become apparent. Some are a result of the electrical components used. In principle these can be overcome, although in practice they will always be important. Other problems arise from the nature of the measurements and the way in which they must be taken. These problems do not depend on how the hardware is implemented. They impose fundamental constraints on the quality of the measurements. The problems in the design of a data collection system are considered here. The design is analysed at the functional rather than electronic level, so the results are of general use. Factors considered include the number of measurements, speed of data collection, noise, bandwidth, isolation, common mode feedback, dynamic range, and quantisation.

25 citations

Journal Article•10.1109/MCG.1987.277055•
On the Parameters of Human Visual Performance: An Investigation of the Benefits of Antialiasing

[...]

Kellogg S. Booth1, M.P. Bryden1, W.B. Cowan1, M.F. Morgan1, B.L. Plante1 •
University of Waterloo1
01 Aug 1987-IEEE Computer Graphics and Applications
TL;DR: The subjective ratings indicate that for both high and low resolution the elimination of aliasing artifacts does not improve quality, whereas images rendered at intermediate resolutions are significantly degraded by Aliasing artifacts to the extent that antialiasing improves the subjective rating.
Abstract: A two-part experiment was conducted to investigate the effects of aliasing artifacts and screen resolution on a simple visual recognition task. The results indicate that in many cases far less realism may be necessary in synthetic computer-generated imagery than is often assumed. The first part of the experiment was a subjective rating of image quality. The second part measured the relationship between image quality and task effectiveness: Subjects were asked to discriminate between images of two types of objects similar to objects used in experiments involving mental rotation. At higher resolutions, the elimination of aliasing artifacts did not significantly improve subjects' performances. At intermediate and low resolutions, comparable to what might be used for iconic menus, the reduction in aliasing artifacts improved performance. The subjective ratings indicate that for both high and low resolution the elimination of aliasing artifacts does not improve quality, whereas images rendered at intermediate resolutions are significantly degraded by aliasing artifacts to the extent that antialiasing improves the subjective rating. These results are interpreted in the context of an ongoing research program aimed at identifying the parameters of real-time human performance for graphics workstations.

24 citations

Journal Article•10.1016/0165-1684(87)90113-7•
On the computation of complex cepstrum through differential cepstrum

[...]

G. R. Reddy1, V. V. Rao•
Indian Institute of Technology Madras1
01 Jul 1987-Signal Processing
TL;DR: The problem of aliasing associated with the computation of complex cepstrum through differential cepStrum is demonstrated with an example.

8 citations

Journal Article•
Perceived motion reversal in parafoveal aliasing (A)

[...]

Robert A. Smith, Peter F. Cass
01 Jan 1987-Journal of The Optical Society of America A-optics Image Science and Vision

6 citations

Journal Article•10.1080/00411458708204674•
The effect of aliasing error upon numerical solutions of the hydrodynamic and magnetohydrodynamic equations

[...]

Wayner Arter1, James W. Eastwood1•
European Atomic Energy Community1
01 Mar 1987-Transport Theory and Statistical Physics
TL;DR: In this article, instability caused by aliasing error with respect to both the viscous Burgers' equation and the incompressible magnetohydrodynamic equations was studied in tokamak simulations.
Abstract: We study instability caused by aliasing error with repect to both the viscous Burgers' equation and the incompressible magnetohydrodynamic equations. “Soft” and “hard” breakdowns are predicted to occur in tokamak simulations. Nonlinear stability criteria can be formulated, but it seems preferable to use numerical schemes that are not prone to these breakdowns, notably EPIC.

5 citations

Journal Article•10.1109/TCS.1987.1086025•
A note on general parallel QMF banks

[...]

P.P. Vaidyanathan1•
California Institute of Technology1
01 Jan 1987-IEEE Transactions on Circuits and Systems
TL;DR: In this article, a scheme for modifying a synthesis bank to take care of aliasing errors caused by linear channel-distortion in a simple manner is proposed. But this scheme is not suitable for the case of parallel, quadrature mirror filter banks.
Abstract: Two issues concerning alias-free, parallel, quadrature mirror filter (QMF) banks are addressed in this correspondence. First, a property concerning alias-free analysis/synthesis systems is established; second, a scheme is proposed, by which a synthesis bank can be modified in order to take care of aliasing errors caused by linear channel-distortion in a simple manner. Applications of the stated results are outlined.

4 citations

Book Chapter•10.1007/BFB0022119•
Experience with Fortran Verifier. A tool for documentation and error diagnosis of Fortran-77 programs

[...]

Reidar Conradi1•
Norwegian Institute of Technology1
1 Dec 1987
TL;DR: FORTRAN verifier as discussed by the authors is a tool to assist the development, testing and maintenance of large FORTRAN-77 programs, which can compute interprocedural, flow-insensitive sideeffects with complete static and dynamic aliasing in order to diagnose unused, unevaluated, unassigned, or otherwise illegally used variables.
Abstract: FORTRAN VERIFIER (FORTVER) is a tool to assist the development, testing and maintenance of large FORTRAN-77 programs. FORTVER will check module interfaces, and produce various documentation and cross-references. It will compute interprocedural, flow-insensitive sideeffects with complete static and dynamic aliasing in order to diagnose unused, unevaluated, unassigned, or otherwise illegally used variables. An improvement of Banning's algorithm for REF-parameter aliases is also introduced.

3 citations

Journal Article•10.1016/0165-1684(87)90095-8•
An extension of the expression of the aliasing error bound

[...]

V. Tiponut
01 Apr 1987-Signal Processing
TL;DR: In this paper, a bound for aliasing errors for non-periodic and band limited signals was established and the equations established were then used in order to discuss the problem of aliasing error resulting from applying sampling theorem to periodic signals.
Journal Article•10.1016/0141-1195(87)90005-2•
A framework for efficient FE vibration software

[...]

Ayse Alaylioglu, H. Alaylioglu
01 Jul 1987-Advances in Engineering Software
TL;DR: A new hybrid stress finite plate vibration capability, providing high accuracy for coarse-meshes is presented with a view to enhancing the behavioural characteristics of the standard hybrid FEM.
Journal Article•10.1016/0169-7552(87)90019-5•
Mapping of X.400 and RFC822 addresses

[...]

Gerrit Henken
01 Dec 1987-Computer Networks and Isdn Systems
TL;DR: This paper argues that the use of domain defined attributes in RFC987 and the insertion of new country codes (and also PRMDs) in the DFN specifications should not be used when interconnecting X.40 and RFC822 mail networks.
Abstract: Both proposals have one important disadvantage, i.e. the use of domain defined attributes in RFC987 and the insertion of new country codes (and also PRMDs) in the DFN specifications. If possible, these solutions should not be used when interconnecting X.40 and RFC822 mail networks. The mapping solutions of both proposals are very similar and with a little extension of the RFC987 aliasing mechanism the DFN solution can be seen as a special case of RFC87. This is especially true for the encoding of X.400 O/R Names in RFC822; for the mapping of RFC822 addresses to X.400 a “gateway addressing” seems to be necessary.
Aliasing err signaturef ana re gisters

[...]

TW Willians
1 Jan 1987
Journal Article•10.1111/J.1467-9892.1987.TB00439.X•
A note on embedding a discrete parameter arma model in a continuous parameter arma model

[...]

Kung-Sik Chan1, Howell Tong1•
The Chinese University of Hong Kong1
01 May 1987-Journal of Time Series Analysis
TL;DR: It is shown that it is not always possible to embed a real‐valued discrete parameter Gaussian AR(1) model in a real-valued continuous parameter Gaussian AR(2) model.
Abstract: . We have shown that it is not always possible to embed a real-valued discrete parameter Gaussian AR(1) model in a real-valued continuous parameter Gaussian AR(1). The problem with general ARMA models is also discussed.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve