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

abstrACT data TYPES AS INITIAL ALGEBRAS & THE CORRECTNESS OF data REPRESENTATIONS.

1975年 89-93页

作者： Goguen, J.A. Thatcher, J.W. Wagner, E.G. Wright, J.B.

One reason for the recent interest in ″abstract″ data types is their extensions of structured programming ideas for control to data, by permitting the user to define new data types and then use them as part of the language. From a top-down structured development point of view, one can write a high-level program assuming whatever data types (and operations upon them) are convenient, and then provide them later using other data types, which are provided still later, etc. (For a simple example, provide push-down-of-sets-of-lists assuming sets-of-lists, etc. ). Moreover, with abstract data types one can provide either (1) quick to program but inefficient implementations or (2) more complex but efficient implementations, depending on the situation; one is not limited to an implementation provided by the compiler. ″abstract″ means that the details of the implementation are truly internal to the data type: one is not allowed to use anything except the explicit operations provided for the type; thus one can later improve an implementation without having to change any code using it. It is shown that the algebraic approach is more powerful than the logical and that equations and initiality can do what formula cannot.

关键词： data procESSING

来源：评论

学校读者我要写书评

暂无评论

FUZZY REPRESENTATIONS AS MEANS OF OVERCOMING THE OVERCOMMITMENT OF SEGMENTATION.

FUZZY REPRESENTATIONS AS MEANS OF OVERCOMING THE OVERCOMMITM...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Pavlidis, Theodosios

The results of a fuzzy segmentation can be used for subsequent classification algorithms which can evaluate fuzzy predicates. For example a peak detection algorithm searching for particular sequences of corners can answer a question about the presence of a peak not by yes or no but by the min left bracket f(x//i) right bracket where I is a member of the set I, and where I is the set of corners forming the peak. Such fuzzy predicates can be combined and used for the final classification. If the final classes are well defined then the fuzziness measured in this way can be used to adjust the design of the overall recognizer. Thus a ″well segmented″ sample will have a high degree of membership while the opposite will be true for a ″poorly segmented″ sample. Misclassification of the former indicates deficiencies in the structure of the classification algorithm which could be corrected without changing the original feature generation algorithm. On the other hand if numerous ″poorly segmented″ samples are found this would suggest the need for a thorough redesign of the feature generation procedure. Notice that ″poorly segmented″ samples are counted regardless of correct or erroneous classification.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

RANDOM-ACCESS VIDEO FRAME BUFFER.

RANDOM-ACCESS VIDEO FRAME BUFFER.

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Kajiya, James T. Sutherland, Ivan E. Cheadle, Edward C.

This paper describes a random-access semiconductor memory designed to drive a shaded-picture television display. The memory provides eight bits per picture element to store a shaded grey-scale picture. The memory has four ports, one for the host computer, one for the TV display, and two which can service an external picture-processing device. A color map, 256 words of 36 bits each, provides for conversion of the eight bit codes into red, green, and blue components of 12 bits each. A flexible addressing and synchronizing system is included to provide for variable picture format and to simplify memory management. Analog deflection signals for precision CRT recording are generated in addition to the RTMA standard TV synchronizing signals. This paper discusses the central design considerations of this type of display system.

关键词： data storage, Semiconductor

来源：评论

学校读者我要写书评

暂无评论

RANDOM ACCESS, MULTI FILE structURE ORGANIZATION.

RANDOM ACCESS, MULTI FILE STRUCTURE ORGANIZATION.

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Von Miden, Paul

When utilizing an on-line communication system in an interactive mode, one need is to have easy access to a multiple (unlimited) file structure organization. This paper describes the fundamentals of such a system, which can be logically generated on a computer system by the definition of one physical file on a mass-storage random access device. The physical file forms the scratch pad on which the logical subfiles are generated. Since the system is generalized it can provide quick start-up for new system development, and allow new logic to be validated to satisfy new requirements. Although the prototype system was developed to emulate a small scale data base as its first objective, the main intent was to give maximum fluidity for the application of automated file definition relevant to heuristic analysis and allow incorporation of logic structures not yet defined. The data structure is reviewed from three aspects. First, the thought process which led to the formation of the need for a multiple file structure organization. Second, theoretical design of the data structure and components in the system. Third, application of the design in the development of a communication oriented data base.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

CLUSTERING CONCEPT AND SECONDARY KEY RETRIEVAL FOR ON-LINE SYSTEMS.

CLUSTERING CONCEPT AND SECONDARY KEY RETRIEVAL FOR ON-LINE S...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Subas, S. Kashyap, R.L. Yao, S.B.

The doubly-chained tree for single-attribute files, has received fresh interest lately in the context of secondary key retrieval in multiple attribute files. It is demonstrated that the construction of such trees corresponds to a form of hierarchical clustering of the records in the data base. This concept enables one to obtain a realistic estimate for the expected number of pages retrieved per query. Using a small generated file and by simulating the retrieval process it is shown that this estimate approximates the actual average number of pages retrieved per query more closely than the earlier estimate used by A. F. Cardenas and J. P. Sagamang. The clustering concept also offers a basis for ranking attributes according to their probability of occurrence in a query is shown to have a much greater advantage than ranking them so as to have increasing average filial set size. A parametric study is also made of the effect of changes in the query set (changes which affect the probability of occurrence of an attribute in a query).

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC DETECTION OF SUSPICIOUS ABNORMALITIES IN BREAST RADIOGRAPHS.

AUTOMATIC DETECTION OF SUSPICIOUS ABNORMALITIES IN BREAST RA...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Kimme, Carolyn O'Loughlin, Bernard J. Sklansky, Jack

The authors describe some of the techniques they employ in processing xeromammograms so that abnormal regions of the breasts can be detected automatically. computing is restricted to a minicomputer with 8,000, 16-bit words of core memory, thereby stimulating the construction of cost-effective algorithms. The methods proceed as follows. First breast tissue in the xeromammogram is identified. The tissue is then partitioned into at most 144 sections per breast in such a way that a particular section on the right breast has a similarly placed section on the left breast. Next, 10 statistics are computed for each section to use as features representing texture. The features are normalized and then selected or eliminated by evaluating how well they separate abnormal from normal tissue on a small training set of sections. The training set is also used to devise simple classification rules for the selected features. The complete classification of 2,270 sections for eight patients takes less than 2 minutes of minicomputer time and yields a false positive rate of 26 percent and a false negative rate (for cancerous sections) of . 6 percent.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

abstrACT data TYPES AS INITIAL ALGEBRAS & THE CORRECTNESS OF data REPRESENTATIONS.

ABSTRACT DATA TYPES AS INITIAL ALGEBRAS & THE CORRECTNESS OF...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Goguen, J.A. Thatcher, J.W. Wagner, E.G. Wright, J.B.

One reason for the recent interest in ″abstract″ data types is their extensions of structured programming ideas for control to data, by permitting the user to define new data types and then use them as part of the language. From a top-down structured development point of view, one can write a high-level program assuming whatever data types (and operations upon them) are convenient, and then provide them later using other data types, which are provided still later, etc. (For a simple example, provide push-down-of-sets-of-lists assuming sets-of-lists, etc. ). Moreover, with abstract data types one can provide either (1) quick to program but inefficient implementations or (2) more complex but efficient implementations, depending on the situation;one is not limited to an implementation provided by the compiler. ″abstract″ means that the details of the implementation are truly internal to the data type: one is not allowed to use anything except the explicit operations provided for the type;thus one can later improve an implementation without having to change any code using it. It is shown that the algebraic approach is more powerful than the logical and that equations and initiality can do what formula cannot.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

ieee confERENCE ON computER graphics, pattern recognition, and data structURE, procEEDINGS, 1975.

IEEE Comput Soc

引用

ieee comput Soc 1975年

作者： Anon

This volume includes 89 technical papers, of which 17 are abstracts or summaries only, arranged by sessions, as follows: Raster Scan graphics;data structures (3 sessions);Texture Analysis;Analysis of Medical Images;Formal Definitions of data structure;pattern recognition (4 sessions);computer graphics (3 sessions);Fuzzy Representation and recognition;Semantic pattern recognition;Human Engineering and computer graphics;computer-Aided Design;computer graphics, pattern recognition and data structure Applied to Chemical structure Analysis. Seventy-one selected papers are indexed separately.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

FUZZY ACCESS TO COLOR AND TEXTURE data IN A GRAPHIC APPLICATION SYSTEM.

引用

1975年 220页

作者： Amano, Takako Kunii, Tosiyasu L.

The efficiency of a man-machine system will be improved as a whole, if a user can get access to shared data by ones daily ill-defined terminology. This paper considers an interface between shared color data and color names in a color graphic application system like INFADS. It shows that the association of a color name with shared color data can be accomplished in a normalized relational form regarding the color name as a fuzzy set.

关键词： computER graphics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：