In this paper, we present an object-oriented approach to modeling systems targeted for the fast growing multimedia applications market. We focus on techniques to reach the first executable model in C++ and propose a d...
详细信息
ISBN:
(纸本)0780365429
In this paper, we present an object-oriented approach to modeling systems targeted for the fast growing multimedia applications market. We focus on techniques to reach the first executable model in C++ and propose a design flow to refine the system to its implementation while minimizing re-coding efforts. We propose to take advantage for C++ expressiveness and SystemC modeling constructs to simplify mapping of the blocks, and provide possibilities for IP reuse. We enforce a strict separation of the internal behavior from the interface behavior of the design components and propose to explore those possibilities through a settop-box case study.
Learning a programming language is difficult for the beginner of the computer. therefore, it is necessary to build an intelligent programming environment in which the program can be written directly in the grammar of ...
ISBN:
(纸本)0769505716
Learning a programming language is difficult for the beginner of the computer. therefore, it is necessary to build an intelligent programming environment in which the program can be written directly in the grammar of one's mother tongue. In this paper, we propose a model of an intelligent programming environment that is oriented to the Japanese. In this model, the text that describes in Japanese the layout of multimedia contents and the relationship between two multimedia contents can be parsed withthe technology of machine translation, translated into an executable program, and executed. As an application of the proposed model, an environment culled ACORNS is implemented. the performance study of ACORNS is performed. the results of the performance study shows that the proposed model is robust.
FPGA technology offers the potential for low cost, high performance for certain applications, including image processing. However, the programming model which FPGAs typically present to application developers is prohi...
详细信息
ISBN:
(纸本)0780365429
FPGA technology offers the potential for low cost, high performance for certain applications, including image processing. However, the programming model which FPGAs typically present to application developers is prohibitively low level. the purpose of this paper is to present a novel bit-serial architecture based on a time-interleaved structure. To overcome the problem of wait cycles within the structure, a second line of bit adders is provided. this allows the structure to use additional "dummy" cycles to deal with additional bits. the proposed architecture is modular and scalable, which allows a bit-level parameterisation. To assess the effectiveness of the approach the design has been implemented efficiently on the Xilinx 4000 series FPGAs.
In this paper we define a semantic foundation for an abstract interpretation approach to universal termination and we develop a new abstract domain useful for termination analysis. Based on this approximation we defin...
详细信息
ISBN:
(纸本)3540412859
In this paper we define a semantic foundation for an abstract interpretation approach to universal termination and we develop a new abstract domain useful for termination analysis. Based on this approximation we define a method which is able to detect classes of goals which universally terminate (with a fair selection rule). We also define a method which is able to characterize classes of programs and goals for which depth-first search is fair.
the object-oriented (OO) distributed real-time (RT) programming movement started in 1990's and is growing rapidly at this turn of the century. the motivations are reviewed and then a brief overview is given of the...
详细信息
ISBN:
(纸本)0769505686
the object-oriented (OO) distributed real-time (RT) programming movement started in 1990's and is growing rapidly at this turn of the century. the motivations are reviewed and then a brief overview is given of the particular programming scheme which this author and his collaborators have been establishing. the scheme is called the time-triggered message triggered object (TMO) programming scheme and it is used to make specific illustrations of the issues and potentials of OO RT programming. the desirable features of middleware providing execution support for OO RT distributed programs are then discussed. the issue of fault-tolerant execution of distributed RT objects and that of RT distributed / parallel simulation are also discussed.
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a q...
详细信息
ISBN:
(纸本)3540412859
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are systems based on stable model semantics, abductive systems, and first order logic model generators which compute solutions as models of some theory. this paper compares these different approaches from the point of view of knowledge representation (how declarative are the programs) and from the point of view of performance (how good are they at solving typical problems).
We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability probl...
详细信息
ISBN:
(纸本)3540412859
We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability problems. Such problems can then be decided, via a reification transformation, using a highly optimised reasoner for the SHIQ description logic. We use a simple example to support our hypothesis that this procedure will work well with realistic problems.
the main goal of the paper is to propose a tool for a semantic specification of program updates (in the context of dynamic logic programming paradigm). A notion of Kripke structure K-P associated with a generalized lo...
详细信息
ISBN:
(纸本)3540412859
the main goal of the paper is to propose a tool for a semantic specification of program updates (in the context of dynamic logic programming paradigm). A notion of Kripke structure K-P associated with a generalized logic program P is introduced. It is shown that some paths in K-P specify stable models of P and vice versa, to each stable model of P corresponds a path in K-P. An operation on Kripke structures is defined: for Kripke structures K-P and K-U associated with P (the original program) and U (the updating program), respectively, a Kripke structure K-Pcircle plusU is constructed. K-Pcircle plusU specifies (in a reasonable sense) a set of updates of P by U. there is a variety of possibilities for a selection of an updated program.
We present the Λ75;μμ75;-calculus, a syntax for Λ-calculus+control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. this calculus is derived from implicational Gentzen&...
详细信息
We present the Λ¯μμ¯-calculus, a syntax for Λ-calculus+control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. this calculus is derived from implicational Gentzen's sequent calculus LK, a key classical logical system in proof theory. Under the Curry-Howard correspondence between proofs and programs, we can see LK, or more precisely a formulation called LKμμ¯, as a syntax-directed system of simple types for Λ¯μμ¯-calculus. For Λ¯μμ¯-calculus, choosing a call-by-name or call-by-value discipline for reduction amounts to choosing one of the two possible symmetric orientations of a critical pair. Our analysis leads us to revisit the question of what is a natural syntax for call-by-value functional computation. We define a translation of Λμ-calculus into Λ¯μμ¯-calculus and two dual translations back to Λ-calculus, and we recover known CPS translations by composing these translations.
Jewel programs are invaluable assets of human beings. thoroughly, stud), these programs will dramatically promote one's understanding and skills. this kind of knowledge promotion has many folds of implication. It ...
详细信息
ISBN:
(纸本)0769505716
Jewel programs are invaluable assets of human beings. thoroughly, stud), these programs will dramatically promote one's understanding and skills. this kind of knowledge promotion has many folds of implication. It will not only improve one's programming skill, but also will strengthen the capabilities of one 's imagination and creativity However, tens of thousands of lines of source codes are rather tedious and time consuming to study. We need good instructor to guide us to do efficiently and effectively study: However, twenty-four hours' good instructor is hard to find. In this paper a multimedia jewel program training environment will be introduced this environment provides functions for both content designing and jewel program learning. Within this system, a jewel program instructor can edits the jewel program into incremented versions. Associated with each version, multimedia explanation will be added. Via carefully designed versions, learners can study jewel programs very efficiently.
暂无评论