New Generation Computing

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Prolog-ELF kết hợp logic mờ Dịch bởi AI
New Generation Computing - Tập 3 - Trang 479-486 - 1985
Mitsuru Ishizuka, Naoki Kanai
Prolog-ELF kết hợp logic mờ và một số hàm hữu ích vào Prolog đã được triển khai như một ngôn ngữ cơ bản để xây dựng các hệ thống tri thức có sự không chắc chắn hoặc độ mơ hồ. Prolog-ELF kế thừa tất cả các đặc điểm cơ bản mong muốn của Prolog. Ngoài các khẳng định với giá trị chân lý giữa 1.0 và 0.5 (0 cho các trường hợp đặc biệt), các tập mờ có thể được thao tác rất dễ dàng. Một ứng dụng của cơ sở...... hiện toàn bộ
#Prolog-ELF #logic mờ #hệ thống tri thức #sự không chắc chắn #tập mờ
Discovering validation rules from microbiological data
New Generation Computing - Tập 21 - Trang 123-133 - 2003
Evelina Lamma, Fabrizio Riguzzi, Sergio Storari, Paola Mello, Anna Nanetti
A huge amount of data is daily collected from clinical microbiology laboratories. These data concern the resistance or susceptibility of bacteria to tested antibiotics. Almost all microbiology laboratories follow standard antibiotic testing guidelines which suggest antibiotic test execution methods and result interpretation and validation (among them, those annually published by NCCLS2,3). Guideli...... hiện toàn bộ
Giving priority to “information-oriented technology” over “computer-oriented technology”
New Generation Computing - Tập 6 - Trang 359-360 - 1989
Toshio Yokoi
Memory referencing characteristics and caching performance of AND-Parallel Prolog on shared-memory multiprocessors
New Generation Computing - Tập 7 - Trang 37-58 - 1989
M. Hermenegildo, E. Tick
This paper presents the performance analysis results for the RAP-WAM AND-Parallel Prolog architecture on shared-memory multiprocessor organizations. The goal of this parallel model is to provide inference speeds beyond those attainable in sequential systems, while supporting conventional logic programming semantics. Special emphasis is placed on sequential performance, storage efficiency, and low ...... hiện toàn bộ
ODM: An object oriented data model
New Generation Computing - Tập 7 - Trang 3-35 - 1989
Mojtaba Mozaffari, Yuzuru Tanaka
ODM is a new data model thatintegrates the features of object oriented programming languages (e.g. Smalltalk-80) and Relational Data Model (RDM). It extends the data structures and operations of RDM and also provides the features of object oriented programming such as improved semantics, data abstraction, reusability of data structures and codes, and extensibility. We have introduced the concept o...... hiện toàn bộ
Join strategies using data space partitioning
New Generation Computing - Tập 6 - Trang 19-39 - 1988
Esen A. Ozkarahan, Cem H. Bozsahin
In the recent investigations of reducing the relational join operation complexity several hash-based partitioned-join stategies have been introduced. All of these strategies depend upon the costly operation of data space partitioning before the join can be carried out. We had previously introduced a partitioned-join based on a dynamic and order preserving multidimensional data organization called ...... hiện toàn bộ
Condition-based Maintenance with Multi-Target Classification Models
New Generation Computing - Tập 29 - Trang 245-260 - 2011
Mark Last, Alla Sinaiski, Halasya Siva Subramania
Condition-based maintenance (CBM) recommends maintenance actions based on the information collected through condition monitoring. In many modern cars, the condition of each subsystem can be monitored by onboard vehicle telematics systems. Prognostics is an important aspect in a CBM program as it deals with prediction of future faults. In this paper, we present a data mining approach to prognosis o...... hiện toàn bộ
Closed world assumptions having precedence in predicates
New Generation Computing - Tập 8 - Trang 185-209 - 1990
Hirofumi Katsuno
This paper extends Reiter’s closed world assumption to cases where the assumption is applied in a precedence order between predicates. The extended assumptions are: thepartial closed world assumption, thehierarchical closed world assumption and thestepwise closed world assumption. The paper also defines an extension of Horn formulas and shows several consistency results about the theory obtained f...... hiện toàn bộ
Concurrent Treaps and Impact of Locking Objects
New Generation Computing - Tập 38 - Trang 187-212 - 2019
Praveen Alapati, Madhu Mutyam, Swamy Saranam
We propose algorithms to perform operations concurrently on treaps in a shared memory multi-core environment. Concurrent treaps hold the advantage of using nodes’ priority for maintaining the height of the treaps. To achieve synchronization, concurrent treaps make use of fine-grained locking mechanism along with logical ordering and physical ordering of nodes’ keys. We initially study the throughp...... hiện toàn bộ
Report on the Workshop on Object-Oriented Computing
New Generation Computing - Tập 3 - Trang 230-231 - 1985
Norihisa Suzuki
Tổng số: 709   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10