找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Information Systems; COINS IV Julius T. Tou Book 1974 Plenum Press, New York 1974 data model.data structure.information processing.informat

[復(fù)制鏈接]
樓主: 不足木
11#
發(fā)表于 2025-3-23 10:50:42 | 只看該作者
An Analysis of Document Retrieval Systems Using a Generalized Model,es, strong points, and inadequacies. The generalized model represents a flexible, comprehensive, modular structure of a retrieval system, as opposed to previous models, which generally emphasize only a specific aspect of the retrieval problem.
12#
發(fā)表于 2025-3-23 16:00:16 | 只看該作者
13#
發(fā)表于 2025-3-23 21:34:01 | 只看該作者
Processing Systems Optimization through Automatic Design and Reorganization of Program Modules, as to produce an optimal design with respect to a specific target machine. Performance criteria for the optimal design is defined in terms of four components: (1) processing time, (2) transport volume, (3) core size, and (4) number and type of I/O units required.
14#
發(fā)表于 2025-3-24 00:01:16 | 只看該作者
Verification and Semantic Checking of APL Programs,rification of programs with arrays. (2) The partial operators introduce the complication of showing program executability. The latter reason leads to a new form of programming, called “semantic checking.”
15#
發(fā)表于 2025-3-24 05:17:06 | 只看該作者
16#
發(fā)表于 2025-3-24 08:43:26 | 只看該作者
17#
發(fā)表于 2025-3-24 14:25:57 | 只看該作者
https://doi.org/10.1007/978-1-4684-2694-6data model; data structure; information processing; information retrieval; information system; learning; m
18#
發(fā)表于 2025-3-24 17:11:08 | 只看該作者
19#
發(fā)表于 2025-3-24 22:43:44 | 只看該作者
A Relational Data Management System,RDMS is a flexible data analysis and manipulation system based on Codd’s relational operations and Child’s set-theoretic operations. This presentation focuses on the application of these techniques to practical problems. Some details of our implementation on a large virtual memory computer will be given.
20#
發(fā)表于 2025-3-25 00:20:24 | 只看該作者
A Data Base Search Problem,The problem of constructing an efficient retrieval algorithm for responding to queries of arbitrary complexity on a relational data base is considered. A query, represented by a relation-defining expression in the relational calculus, is translated into a retrieval algorithm.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-21 22:57
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
兴义市| 永善县| 乾安县| 宁海县| 大丰市| 余江县| 永川市| 甘德县| 镇坪县| 遂溪县| 高州市| 工布江达县| 大安市| 监利县| 神池县| 会泽县| 福州市| 西畴县| 黑河市| 闵行区| 韩城市| 新余市| 葵青区| 鹿邑县| 松桃| 连江县| 梅州市| 尼勒克县| 安多县| 信宜市| 什邡市| 澳门| 峨山| 文登市| 临泽县| 呼和浩特市| 镇平县| 奎屯市| 丰台区| 嵊泗县| 明溪县|