Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90049-3
J.M. Fernández, F. Moreno, S. Alexandres, J. Meneses
This paper is about a parallel and pipelined hardware system for real-time isolated speech recognition for medium-large Spanish vocabularies, based on Hidden Markov Models (HMMs). The system, relied on a VLSI circuit developed by the authors [1] that implements the Viterbi Algorithm, can keep-up with continuous input and is connected to a host Personal Computer. A software package controls the hardware and runs the user interface.
{"title":"A flexible VLSI-based hardware system for medium-large-vocabulary real-time speech recognition","authors":"J.M. Fernández, F. Moreno, S. Alexandres, J. Meneses","doi":"10.1016/0165-6074(94)90049-3","DOIUrl":"10.1016/0165-6074(94)90049-3","url":null,"abstract":"<div><p>This paper is about a parallel and pipelined hardware system for real-time isolated speech recognition for medium-large Spanish vocabularies, based on Hidden Markov Models (HMMs). The system, relied on a VLSI circuit developed by the authors [1] that implements the Viterbi Algorithm, can keep-up with continuous input and is connected to a host Personal Computer. A software package controls the hardware and runs the user interface.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 825-828"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90049-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134490901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90051-5
Massimo Bartolucci , Giacomo R. Sechi
This paper presents a study about rounding error arising in the addition of opposite sign floating point operands: the algebraic study of the adder functionalities provides the possibility to modify hardware in order to measure the rounding error effect in terms of error size and incoming rate.
{"title":"Rounding error in the computation of opposite sign floating point number parametric addition: a case study","authors":"Massimo Bartolucci , Giacomo R. Sechi","doi":"10.1016/0165-6074(94)90051-5","DOIUrl":"10.1016/0165-6074(94)90051-5","url":null,"abstract":"<div><p>This paper presents a study about rounding error arising in the addition of opposite sign floating point operands: the algebraic study of the adder functionalities provides the possibility to modify hardware in order to measure the rounding error effect in terms of error size and incoming rate.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 833-839"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90051-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133877620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90075-2
{"title":"Author index to volume 40 (1994)","authors":"","doi":"10.1016/0165-6074(94)90075-2","DOIUrl":"https://doi.org/10.1016/0165-6074(94)90075-2","url":null,"abstract":"","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 943-947"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90075-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136510389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90030-2
Yong-Kee Paek , Jungyun Seo, Gil-Chang Kim
This paper presents the potential for case-based reasoning in design problems, specifically as applied to relational database schema design. The proposed system relies on two case-bases that consist of a Domain Dependent Case-Base (DDCB) and a Domain Independent Case-Base (DICB). We focus on the DDCB in this paper. The organization of domain dependent cases and their features for design are identified. The strategies for retrieving the relevant cases, for building a rough solution, for repairing the rough solution, and for learning cases, currently under development, are also described.
{"title":"Constructing a domain dependent case-base for database schema design with case-based reasoning","authors":"Yong-Kee Paek , Jungyun Seo, Gil-Chang Kim","doi":"10.1016/0165-6074(94)90030-2","DOIUrl":"10.1016/0165-6074(94)90030-2","url":null,"abstract":"<div><p>This paper presents the potential for case-based reasoning in design problems, specifically as applied to relational database schema design. The proposed system relies on two case-bases that consist of a Domain Dependent Case-Base (DDCB) and a Domain Independent Case-Base (DICB). We focus on the DDCB in this paper. The organization of domain dependent cases and their features for design are identified. The strategies for retrieving the relevant cases, for building a rough solution, for repairing the rough solution, and for learning cases, currently under development, are also described.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 737-741"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90030-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123136972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90072-8
I. Erényi, Z. Fazekas
Determining the viability of livestock-embryos is an important procedure in minimizing the economic risk arising in case of transplantation of ‘engineered’ embryos into recipient animals. This evaluation is carried out at various segmentation phases of the embryos. In this paper we present a possible way to ease and/or automate the evaluation of embryo-viability for embryos being in their 8-cell stadium. We mention some grayscale morphological filtering techniques that has proved to be useful for the image segmentation in this stadium of the embryo segmentation. Meaningful circles (or circle-arcs) are fitted to the silhouette of the embryo and that of its constituent cells. Based on these circles morphological indices are calculated which are reported to be useful for the viability check.
{"title":"Morphological evaluation of embryo viability","authors":"I. Erényi, Z. Fazekas","doi":"10.1016/0165-6074(94)90072-8","DOIUrl":"10.1016/0165-6074(94)90072-8","url":null,"abstract":"<div><p>Determining the viability of livestock-embryos is an important procedure in minimizing the economic risk arising in case of transplantation of ‘engineered’ embryos into recipient animals. This evaluation is carried out at various segmentation phases of the embryos. In this paper we present a possible way to ease and/or automate the evaluation of embryo-viability for embryos being in their 8-cell stadium. We mention some grayscale morphological filtering techniques that has proved to be useful for the image segmentation in this stadium of the embryo segmentation. Meaningful circles (or circle-arcs) are fitted to the silhouette of the embryo and that of its constituent cells. Based on these circles morphological indices are calculated which are reported to be useful for the viability check.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 931-934"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90072-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115663979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90034-5
Inhwan Jung , Kisoo Han , Songchun Moon
In this paper, we describe a new transaction management scheme, MTM, for incorporating existing applications of local database systems into multidatabase applications. By capitalizing on the structural semantics of a global transaction, which can be specified in terms of intra-transaction dependencies, global transactions are modeled and executed as open-nested transactions. We design and implement a middleware facility to address issues related to managing transactions when they are described only with high-level operations which are explicitly exported by local database systems. We also describe a group checkpointing scheme to maintain MTM architecture tolerable from failures.
{"title":"Middleware transaction manager in multidatabase management systems","authors":"Inhwan Jung , Kisoo Han , Songchun Moon","doi":"10.1016/0165-6074(94)90034-5","DOIUrl":"10.1016/0165-6074(94)90034-5","url":null,"abstract":"<div><p>In this paper, we describe a new transaction management scheme, <strong><em>MTM</em></strong>, for incorporating existing applications of local database systems into multidatabase applications. By capitalizing on the <em>structural semantics</em> of a global transaction, which can be specified in terms of intra-transaction dependencies, global transactions are modeled and executed as open-nested transactions. We design and implement a <em>middleware</em> facility to address issues related to managing transactions when they are described only with high-level operations which are explicitly exported by local database systems. We also describe <em>a group checkpointing scheme</em> to maintain MTM architecture tolerable from failures.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 755-758"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90034-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127307383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90025-6
Ana Maria Ponce
The conformance testing documents and their formal description in ACT ONE are briefly explained.
简要解释了ACT ONE中的一致性测试文件及其正式描述。
{"title":"Documenting the process of conformance testing","authors":"Ana Maria Ponce","doi":"10.1016/0165-6074(94)90025-6","DOIUrl":"https://doi.org/10.1016/0165-6074(94)90025-6","url":null,"abstract":"<div><p>The conformance testing documents and their formal description in ACT ONE are briefly explained.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 715-717"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90025-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72293930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90039-6
Miroslaw Thor
The main objective of this paper is to present a newly developed high performance reconfigurable multitransputer heterogeneous topology architecture called HP-FLEXAR. The proposed architecture is aimed to be used for time critical applications, especially for performing such computational tasks which could be solved in separate heterogeneous topology execution units using parallel decomposition and allocation algorithms.
The HP-FLEXAR enables dynamic assignment of program tasks to the worker transputers of separate execution units. The heterogeneous topology of these units can be also dynamically changed (during a program execution) according to the run-time analysis performed in the HP-FLEXAR decision and distribution unit (a DD unit). A feedback between the execution and DD units is one of the most important features of the HP-FLEXAR architecture. This enables taking full advantage of its dynamic reconfiguration capabilities.
The HP-FLEXAR being a flexible architecture is not limited to the above applications. One of the other areas of its potential applications is support of development of architectural concepts and communication strategies aimed to increase the efficiency of reconfigurable multi-transputer systems. This can be achieved through direct mapping of different multi-transputer architectural designs onto the HP-FLEXAR structure.
{"title":"HP-FLEXAR: A reconfigurable multi-unit heterogeneous topology architecture for time critical applications","authors":"Miroslaw Thor","doi":"10.1016/0165-6074(94)90039-6","DOIUrl":"10.1016/0165-6074(94)90039-6","url":null,"abstract":"<div><p>The main objective of this paper is to present a newly developed high performance reconfigurable multitransputer heterogeneous topology architecture called HP-FLEXAR. The proposed architecture is aimed to be used for time critical applications, especially for performing such computational tasks which could be solved in separate heterogeneous topology execution units using parallel decomposition and allocation algorithms.</p><p>The HP-FLEXAR enables dynamic assignment of program tasks to the worker transputers of separate execution units. The heterogeneous topology of these units can be also dynamically changed (during a program execution) according to the run-time analysis performed in the HP-FLEXAR decision and distribution unit (a DD unit). A feedback between the execution and DD units is one of the most important features of the HP-FLEXAR architecture. This enables taking full advantage of its dynamic reconfiguration capabilities.</p><p>The HP-FLEXAR being a flexible architecture is not limited to the above applications. One of the other areas of its potential applications is support of development of architectural concepts and communication strategies aimed to increase the efficiency of reconfigurable multi-transputer systems. This can be achieved through direct mapping of different multi-transputer architectural designs onto the HP-FLEXAR structure.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 777-781"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90039-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124378641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90036-1
A. Clematis
Methods and tools for fault tolerance in network based parallel computing are analyzed. Different communications libraries are now available which make it possible to use a local area network as a parallel computer. These libraries provide different services, however only little attention is devoted to the problem of fault tolerance. Using the fact that most of parallel applications exhibit a regular structure it is shown that to provide fault tolerance to this type of computation is much more simple than to provide fault tolerance in a general concurrent program. The primitives which are necessary to support the proposed design, and general implementation problems with respect to shared virtual memory and message passing communications models are briefly considered.
{"title":"Fault tolerant programming for network based parallel computing","authors":"A. Clematis","doi":"10.1016/0165-6074(94)90036-1","DOIUrl":"10.1016/0165-6074(94)90036-1","url":null,"abstract":"<div><p>Methods and tools for fault tolerance in network based parallel computing are analyzed. Different communications libraries are now available which make it possible to use a local area network as a parallel computer. These libraries provide different services, however only little attention is devoted to the problem of fault tolerance. Using the fact that most of parallel applications exhibit a regular structure it is shown that to provide fault tolerance to this type of computation is much more simple than to provide fault tolerance in a general concurrent program. The primitives which are necessary to support the proposed design, and general implementation problems with respect to shared virtual memory and message passing communications models are briefly considered.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 765-768"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90036-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124790550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-12-01DOI: 10.1016/0165-6074(94)90035-3
Hyeokmin Kwon, Songchun Moon
If buffer retention effect is taken into account, validation schemes for optimistic concurrency control (OCC) should be approached in some different point of view: rather than killing the conflicting transactions immediately in the middle of their execution, it would be better to allow them to run to their completion for bringing the required data objects into main memory. In this respect, we propose a new validation scheme for OCC called reordering serial equivalence (RSE) by introducing reverse serializability, which ensures the correctness of RSE when we allow the serialization in the reverse order of transactions' commits.
{"title":"Reverse serializability as a correctness criterion for optimistic concurrency control","authors":"Hyeokmin Kwon, Songchun Moon","doi":"10.1016/0165-6074(94)90035-3","DOIUrl":"10.1016/0165-6074(94)90035-3","url":null,"abstract":"<div><p>If buffer retention effect is taken into account, validation schemes for optimistic concurrency control (OCC) should be approached in some different point of view: rather than killing the conflicting transactions immediately in the middle of their execution, it would be better to allow them to run to their completion for bringing the required data objects into main memory. In this respect, we propose a new validation scheme for OCC called <strong><em>reordering serial equivalence</em></strong> (<strong>RSE</strong>) by introducing <em>reverse serializability</em>, which ensures the correctness of RSE when we allow the serialization in the reverse order of transactions' commits.</p></div>","PeriodicalId":100927,"journal":{"name":"Microprocessing and Microprogramming","volume":"40 10","pages":"Pages 759-762"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0165-6074(94)90035-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}