Whereas it is generally acknowledged that code tangling reduces the quality of software and that aspect-oriented programming (AOP) is a means of addressing this problem, there is — as yet — no clear definition or ch...
详细信息
The transportation of prerecorded, compressed video data without loss of picture quality requires the network and video servers to support large fluctuations in bandwidth requirements. Fully utilizing a client-side bu...
详细信息
The transportation of prerecorded, compressed video data without loss of picture quality requires the network and video servers to support large fluctuations in bandwidth requirements. Fully utilizing a client-side buffer for smoothing bandwidth requirements can limit the fluctuations in bandwidth required from the underlying network and the video-on-demand servers. This paper shows that, for a fixed-size buffer constraint, the critical bandwidth allocation technique results in plans for continuous playback of stored video that have (1) the minimum number of bandwidth increases, (2) the smallest peak bandwidth requirements, and (3) the largest minimum bandwidth requirements. In addition, this paper introduces an optimal bandwidth allocation algorithm which, in addition to the three critical bandwidth allocation properties, minimizes the total number of bandwidth changes necessary for continuous playback. A comparison between the optimal bandwidth allocation algorithm and other critical bandwidth-based algorithms using 17 full-length movie videos and 3 seminar videos is also presented.
As companies increase the level of customization in their products, move towards smaller lot production and experiment with more flexible customer/supplier arrangements such as those made possible by Electronic Data I...
详细信息
The transportation of compressed video data without loss of picture quality requires the network to support large fluctuations in bandwidth requirements. These fluctuations can be smoothed, but straightforward approac...
详细信息
The transportation of compressed video data without loss of picture quality requires the network to support large fluctuations in bandwidth requirements. These fluctuations can be smoothed, but straightforward approaches to smoothing can still suffer from excessive buffering requirements, poor buffer utilization and an excessive number of bandwidth changes. This paper introduces critical bandwidth allocation, which reduces the number of bandwidth changes to a very small number, and achieves the maximum effectiveness from client-side buffers. A comparison between critical bandwidth allocation algorithms and other smoothing algorithms is presented, the sensitivity of the algorithm to jitter is examined, and, implications for the design of network services are discussed.
Examines »program adjustment», a formal and practical approach to developing correct concurrent programs, by automatically adjusting an imperfect program to satisfy given constraints. A concurrent program is...
详细信息
Our research goal is to construct an environment that mechanically supports human intellectual activities through software development with reuse. We propose a model of software development with systematic reuse in wh...
详细信息
Our research goal is to construct an environment that mechanically supports human intellectual activities through software development with reuse. We propose a model of software development with systematic reuse in which the existing program can be altered to meet the given specification change using the program derivation process from the specification. We consider what kinds of knowledge must be acquired when a specification is changed and how they have to be integrated so well as to implement our method on a computer system. In particular, we focus on the following points in terms of program synthesis. First, a wide spectrum language, Extended IML, defines a framework in which specifications, program and the elaborate derivation process can be expressed formally on a computer system. This forms a basic unit of reusable knowledge for specification change. Second, a reuse process is formulated in which a new requirement changes the efficient specification and its program is altered to meet this requirement correctly. Third, we consider some conditions and a mechanism by which the knowledge can be integrated so as to obtain an objective program automatically, implying that we will yet profit from reusing the knowledge.
We propose an extension to Prolog called the count term for controlling Prolog *** purpose is to allow the programmers as well as the users to have greater flexibility in controlling the execution behavior of Prolog p...
详细信息
We propose an extension to Prolog called the count term for controlling Prolog *** purpose is to allow the programmers as well as the users to have greater flexibility in controlling the execution behavior of Prolog programs and for limiting the number of answers retrieved when Prolog is used as a database query language. Both syntax and operational semantics of the count term are *** analyze the possible meanings one might associate with the count *** possible replacement of cut and fail by the count term is *** ease of analysis of programs with count terms is discussed.
This paper proposes fuzzy inference neural network (FiNN) as a framework for an incorporated system involving fuzzy theory and neural network theory. The FiNN is structured on a skeleton of specified fuzzy rules so th...
详细信息
ISBN:
(纸本)0819408751
This paper proposes fuzzy inference neural network (FiNN) as a framework for an incorporated system involving fuzzy theory and neural network theory. The FiNN is structured on a skeleton of specified fuzzy rules so that the FiNN can store the fuzzy rules smoothly. A FiNN system implements approximate inference from the fuzzy rules. There are three types for the structured parts, which are called `antecedent network,' or `conclusion network,' or `logic network.' Each structured part is a neural network component. Each neural network component executes an elementary function which is a part of an approximate inference procedure. The FiNN categorizes practical data by itself to generate learning samples for the conclusion networks. Membership functions in the antecedent networks are initialized by a priori knowledge, and modified by solving inverse problems of the logic network. A numerical example clarifies the applicability to the system identification.
An ordinary expert system controls a plant according to heuristics. So, it fails to control the plant for lack of heuristics if unforeseen events occur as a result of abnormal situations. We propose a new framework of...
ISBN:
(纸本)9780897913720
An ordinary expert system controls a plant according to heuristics. So, it fails to control the plant for lack of heuristics if unforeseen events occur as a result of abnormal situations. We propose a new framework of model-based reasoning that can dynamically generate the knowledge for plant control against unforeseen events. This proposed framework consists of three functions: (a) generation of the goal state after recovery from the unforeseen events; (b) generation of knowledge for plant control; (c) prediction of process trend curves and estimation of the generated knowledge. In the proposed framework, various kinds of models which correspond to the fundamental knowledge about plant control are used. We have implemented a thermal power plant control expert system on the basis of this proposed framework. This paper describes the model-based reasoning mechanism of the experimental plant control expert system to realize each of three functions. Especially as for (c), this paper explains qualitative reasoning mechanism using fuzzy logic.
暂无评论