Modern high-performance embedded systems face many challenges. systems must function in rapidly changing environments. Power/size constraints limit hardware size, while extreme performance requirements demand algorith...
详细信息
Modern high-performance embedded systems face many challenges. systems must function in rapidly changing environments. Power/size constraints limit hardware size, while extreme performance requirements demand algorithm specific architectures. Hardware architectures must structurally adapt to achieve high performance with changing algorithms. Reconfigurable computing devices offer the promise of architectures that change in response to the changing environment. The primary difficulty in this approach lies in system design. A model-integrated approach is used in the design capture and synthesis of these systems. The target systems are built on a heterogeneous computing platform including configurable hardware, ASIC and general purpose processors and DSPs. This project is a DARPA Adaptive Computing systems funded effort, involving close cooperation with US ARMY/AMICOM.
Context dependency is an important problem of knowledge. Fuzzy information also suffers from this dependency when any fuzzy concept, once described, is isolated from its context. The paper describes a cognitive model ...
详细信息
Context dependency is an important problem of knowledge. Fuzzy information also suffers from this dependency when any fuzzy concept, once described, is isolated from its context. The paper describes a cognitive model in which fuzzy knowledge is processed with respect to its surrounding context. The model is derived from some psycho-cognitive approaches: the integrity of knowledge and its context as well as the episodic character of contextual effects on knowledge. The model consists of some functional modules performing related cognitive tasks. Fuzzy knowledge is kept within a layered long-term memory. Layers form an episodic base for contextual knowledge: each layer represents a different context and keeps related fuzzy knowledge. A context selector module evaluates existence of context information in order to choose appropriate context layers. An aggregation module which is an optimization module evaluates implicit contexts. The model is supported by a car brake example, which shows its simplicity and adaptability, and thus the power of this cognitive model. The model is useful especially for mobile fuzzy system applications where knowledge on environment conditions are constantly changing and adaptation of the fuzzy system's descriptive aspects are necessary.
Lee's algorithm (1961) for routing always finds a minimum length path, if one exists. We discuss an enhancement to an earlier maze-routing algorithm to reduce the number of zig-zag line segments in the routing pat...
详细信息
Lee's algorithm (1961) for routing always finds a minimum length path, if one exists. We discuss an enhancement to an earlier maze-routing algorithm to reduce the number of zig-zag line segments in the routing path. This method would find a path between two points, if one exists, on a rectangular grid of cells. A line search method using efficient data structures has been applied that would reduce the number of line segments in the path. Blocking cells are introduced as obstacles in finding the path. All line segments are considered as horizontal and vertical only. An implementation of the method and its experimental results are reported.
This paper presents a new fine-grained temporal Petri net model for distributed multimedia synchronization that can handle fuzzy temporal requirements and facilitate to verify the possibility of satisfying QoS require...
详细信息
This paper presents a new fine-grained temporal Petri net model for distributed multimedia synchronization that can handle fuzzy temporal requirements and facilitate to verify the possibility of satisfying QoS requirements. We present a procedure for constructing the fine-grained model, starting from a set of relative temporal relations among multimedia objects. And we give an approach to infer unknown durations. Finally, we discuss how to model intra-stream and inter-stream synchronizations so as to guarantee the QoS.
This paper defines a computational protocol for evaluating the performance of raster to vector conversion systems. The graphical entities handled by this protocol are continuous and dashed lines, arcs, and circles, an...
详细信息
As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work becom...
详细信息
As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work become widespread, it becomes very important to optimize network resources. One such optimization is multicast tree generation. The problem of generating a minimum cost multicast tree given the network topology and costs associated with the connecting links can be modelled as a Steiner tree problem which is NP-complete. Much work has been done in the direction of obtaining near-optimal multicast trees when the objective is only to minimize the cost. However, many real time applications such as videoconferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. We deal with the delay-bounded cost-optimal multicast tree (DBCPAT) generation problem. Specifically, we discuss a closely related problem which is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used as a starting point to solve the DBCMT. We present an exact solution to the DBCP which is based on the branch-and-bound paradigm. We also propose a heuristic technique to solve the DBCP using the principle of evolutionary computing. The results obtained using the two techniques are compared for several large networks.
This paper addresses the problem of selecting the optimum training sequence for channel estimation in communication systems over time-dispersive channels. By processing in the frequency domain, a new explicit form of ...
详细信息
This paper addresses the problem of selecting the optimum training sequence for channel estimation in communication systems over time-dispersive channels. By processing in the frequency domain, a new explicit form of search criterion is found, the gain loss factor (GLF), which minimises the variance of the estimation error and is easy to compute. Theoretical upper and lower bounds on the GLF are derived. An efficient directed search strategy and optimal sequences up to length 42 are given. These sequences are optimal only for frequency domain estimation, not for time domain estimation.
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.
暂无评论