|
1. |
Estimating the performance of multiple functional unit and pipelined processor using statistical instruction dependencies |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 1-16
Yasuo Kinouchi,
Takayuki Hoshiko,
Kouichi Inamori,
Preview
|
PDF (1289KB)
|
|
摘要:
AbstractThis paper considers the processor with the parallel operation and lookahead control functions based on the real‐time system program. The relation between the logical dependencies among instructions and the performance improvement is analyzed. With respect to the dependency, the number of dynamic steps that are processed between logically dependent instructions is considered, and the histogram is examined in the program actually run.A method is devised wherein the behavior of the processor executing the instructions following the written order is represented in terms of the probability based on the statistical data. The effects of the dependency and the number of functional units on the processor also is evaluated by a simulation. The validity of the proposed method is verified and the effect is evaluated of performance improvement when the order of instruction execution is made variabl
ISSN:0882-1666
DOI:10.1002/scj.4690250901
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
2. |
Implementation and evaluation of SCSE for OSI secure communications |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 17-31
Kouji Nakao,
Toshiaki Tanaka,
Kenji Suzuki,
Yoshiyori Urano,
Preview
|
PDF (1256KB)
|
|
摘要:
AbstractThe authors have proposed a secure communications service element (SCSE) which can provide such security functions as authentification, information confidentiality, and data integrity (prevention of data modification), as application service elements (ASE) in the open‐type system interconnection(OSI) application layer. The proposal is evaluated highly from the viewpoint of OSI protocol design technique to realize the security function.This paper attempts to verify the realizability of the proposed SCSE and the applicability to OSI communication. Further, it reports on the design of the SCSE software package and the implementation/evaluation. In the implementation/evaluation of the proposed package, especially, it is intended to demonstrate the applicability to OSI communication applications.As typical examples of SCSE applications, file transfer access and management (FTAM) assuming the totally duplicate communication function in the session layer, as well as document transfer and manipulation (DTAM) assuming the use of the semiduplicate communication function are adopted. Through the verification experiment such as the measurement of the processing load, the practical usefulness and the applicability of SCSE are evaluated. As a result, it is shown that the efficient OSI security communication system can be realized by SCSE. Since the proposed approach can be applied to the totally duplicate and the semiduplicate communications, it is shown that the method is applicable to all OSI communication application
ISSN:0882-1666
DOI:10.1002/scj.4690250902
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
3. |
Construction of pseudorandom permutations |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 32-40
Yasuhiro Ohnishi,
Akira Maruoka,
Preview
|
PDF (682KB)
|
|
摘要:
AbstractThe permutation from {0, 1}2nto {0, 1}2nrepresented byS(f)in DES (Data Encryption Standard) is used as the basic operation. Letfbe a function from {0, 1}nto {0, 1}nand ⊕ denote bitwise exclusive or. ThenS(f)is definedS(f)(L.R) = R.[L⊕f(R)]whereL, R ϵ{0, 1}n, Moreover, letS(f2,f1,fo) denote the composition ofS(f2,S(f1) andS(fo), and {S(f2,f1,fo)} denote a set ofS(f2,f1,fo) obtained when fo,f1andf2are chosen randomly from a set of pseudorandom functions. Luby et al. have shown that {S(f2,f1,fo)} is pseudorandom.This paper investigates the case in which there are two different pseudorandom functions and shows that while {{S(f1,f1,,fo)} and {S(f1,fo,fo)} are pseudorandom, {S(fo,f1,fo)} is
ISSN:0882-1666
DOI:10.1002/scj.4690250903
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
4. |
Design and fault diagnosis of cellular arrays realizing multiple‐valued logic functions |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 41-52
Naotake Kamiura,
Yutaka Hata,
Kazuharu Yamato,
Preview
|
PDF (938KB)
|
|
摘要:
AbstractAn efficient fault diagnostic method should be developed to reduce the turnaround time and the cost for developing binary LSI's. For the multiple‐valued logic system that has been expected in the post‐binary electronics, research on the fault diagnosis for the logic circuit will be essential.This paper discusses the design and the fault diagnosis in multiple‐valued cellular arrays. First, the single‐level array, two‐level array, three‐level array, andn‐level array realizingk‐valuedn‐variable logic functions are introduced. It is clarified that the two‐level array is the most suitable structure solving both problems of the number of cells and the fault location.Next, further investigation is made for the fault diagnosis. The stuck‐at faults, the open fault, and the AND bridging fault are treated under the assumption that the single fault occurs in the array. In the authors' fault diagnostic method, the test inputs can easily be generated from the control inputs that specify the switches of cells. Moreover, the comparison with other testing methods for cellular arrays shows that our method reduces the order of steps for gener
ISSN:0882-1666
DOI:10.1002/scj.4690250904
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
5. |
A distributed shortest‐paths algorithm with distance‐dependent message complexities |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 53-66
Kouji Miura,
Toshimitsu Masuzawa,
Nobuki Tokura,
Preview
|
PDF (947KB)
|
|
摘要:
AbstractThis paper presents a distributed algorithm for the single‐source shortest‐paths problem in a network with nonnegative integral link weights. Its message complexity is\documentclass{article}\pagestyle{empty}\begin{document}$$ O\left({\sqrt {nDe} + e} \right) $$\end{document}, wherenis the number of processors,eis the number of links, andDis the maximum distance from the root. The known shortest‐paths algorithm with the distance‐dependent message complexity requiresO(min(Dn+e, n2)) messages. The algorithm of this paper is more efficient for networks withD=o(n3/e) andD= ω(e/n).Moreover, the breadth‐first search tree problem is
ISSN:0882-1666
DOI:10.1002/scj.4690250905
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
6. |
Development of document architecture extraction |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 67-82
Miwako Doi,
Mika Fukui,
Kouji Tamaguchi,
Youichi Takebyashi,
Isamu Iwai,
Preview
|
PDF (1172KB)
|
|
摘要:
AbstractThe purpose of this study is the reduction of the burden in the document structurization process. A technique is presented for extracting the document architecture. As the technical document, 12,000 articles are extracted from the proceedings of a national convention. A summary of sample sentences as well as approximately 500 office documents within the organization also are examined as business documents. The rules for extracting the architecture are derived. The technique developed for document architecture extraction can extract such hierarchical structures as chapters and sections, as well as the reference structure to figures and tables from the technical document. The technique can also extract the hierarchical structure such as communications and reports from the business document. The technical and business documents can be discriminated by analyzing the character strings.As a result of evaluation using proceedings and in‐office documents other than those used for deriving the rules, the error rate is 10.0 percent for the technical document and 23.0 percent for the business document. The error in extracting the reference structure is 8 percent. A field test is executed after improving the method so that the equations, figures and tables embedded in the text can be handled. The error rate is 5.4 percent for the technical document and 15.4 percent for the business document. It is verified through examples that the structurization can be achieved in a considerably shorter time than by manual processing. The developed document architecture extraction technique is commercialized as an automatic system by combining the technique with the layout attribute. The developed extraction technique will be utilized effectively in the hypertext conversion of the existing document and other problems, in addition to the layout processin
ISSN:0882-1666
DOI:10.1002/scj.4690250906
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
7. |
Speech segmentation and clustering problem based on an unknown‐multiple N signal source model—an application to segmented speech clustering based on speaker features |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 83-92
Masahide Sugiyama,
Jinichi Murakami,
Hideyuki Watanabe,
Preview
|
PDF (776KB)
|
|
摘要:
AbstractThis paper describes the speech segmentation and clustering problem based on unknown‐multiple signal source modeling, where a sequence of signals is generated by signal sources one by one without overlap. This problem and its subproblem with given segmentation information have wide applications in various fields.This paper formulates the problem, and the solution and its application of the subproblem are proposed. The solution is based on clustering symbol output probability functions. The other possible solution, which gives the segmentation and clustering simultaneously, is based on an ergodic HMM which can transit among all states.In this paper the subproblem is applied to speech clustering based on speaker features. Here, each speaker corresponds to a single signal source. The performance is evaluated using simulated dialog speech dat
ISSN:0882-1666
DOI:10.1002/scj.4690250907
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
8. |
Reconstruction of a decision tree with learning examples generated from an original tree and its characteristics |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 93-105
Tohru Asami,
Hachisu Unoki,
Kazuo Hashimoto,
Seiichi Yamamoto,
Preview
|
PDF (1050KB)
|
|
摘要:
AbstractThis paper describes thea posteriorimethod of decision tree learning after the tree is applied to a real domain, such as medical diagnoses. Without collecting a new set of diagnosis examples, the presented algorithm reconstructs a decision tree preserving the error rate of diagnosis from an original tree and a frequency of diagnoses, which is counted at reaching the corresponding terminal node of that tree when applied to a real domain. The new tree has a shorter path length to diagnose and a logically same meaning with the original tree because of generating a set of pseudoexamples whose unobserved attribute values uniformly distribute in the value range.To reduce the computational cost, a method to avoid a generation of a pseudoexample set also is presented. The context dependencies between attributes are considered by introducing an attribute concatenation. The experiments show that an average path length will be reduced by 6 to 10 percent after reconstruction of a randomly generated decision tree with nonoptimized diagnosis frequencies.
ISSN:0882-1666
DOI:10.1002/scj.4690250908
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
9. |
Errata |
|
Systems and Computers in Japan,
Volume 25,
Issue 9,
1994,
Page 105-105
Preview
|
PDF (107KB)
|
|
ISSN:0882-1666
DOI:10.1002/scj.4690250909
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1994
数据来源: WILEY
|
|