The Experts below are selected from a list of 162 Experts worldwide ranked by ideXlab platform
Kisok Kong - One of the best experts on this subject based on the ideXlab platform.
-
LCTES - A Design and Implementation of a Remote Debugging Environment for Embedded Internet Software
Lecture Notes in Computer Science, 2001Co-Authors: Kisok KongAbstract:It is necessary to use development tools in developing embedded real-time application software for Internet appliances. In this paper, we describe an integrated remote debugging environment for Q+(QPlus) real-time kernel which has been built for an embedded internet application. The remote development toolset called Q+Esto consists of several independent support tools: an Interactive Shell, a remote debugger, a resource monitor, a target manager and a debug agent. Using the remote debugger on the host, the developer can spawn and debug tasks on the target run-time system. It can also be attached to already-running tasks spawned from the application or from Interactive Shell. Applicatoin code can be viewed as C source, or as assembly-level code. It incorporates a variety of display windows for source, registers, local/global variables, stack frame, memory, event traces and so on. The target manager implements common functions that are shared by Esto tools, e.g., the host target communiction, object file loading, and management of target-resident host tool's memory pool and of target system symbol-table, and so on. These functions are called OPEN C APIs and they greatly improve the extensibility of the Esto Toolset. Debug agent is a daemon task on real-time operating systems in the target system. It gets requests from the host tools including debugger, interprets the requests, executes them and sends the results to the host.
-
a design and implementation of a remote debugging environment for embedded internet software
Lecture Notes in Computer Science, 2001Co-Authors: Kisok KongAbstract:It is necessary to use development tools in developing embedded real-time application software for Internet appliances. In this paper, we describe an integrated remote debugging environment for Q+(QPlus) real-time kernel which has been built for an embedded internet application. The remote development toolset called Q+Esto consists of several independent support tools: an Interactive Shell, a remote debugger, a resource monitor, a target manager and a debug agent. Using the remote debugger on the host, the developer can spawn and debug tasks on the target run-time system. It can also be attached to already-running tasks spawned from the application or from Interactive Shell. Applicatoin code can be viewed as C source, or as assembly-level code. It incorporates a variety of display windows for source, registers, local/global variables, stack frame, memory, event traces and so on. The target manager implements common functions that are shared by Esto tools, e.g., the host target communiction, object file loading, and management of target-resident host tool's memory pool and of target system symbol-table, and so on. These functions are called OPEN C APIs and they greatly improve the extensibility of the Esto Toolset. Debug agent is a daemon task on real-time operating systems in the target system. It gets requests from the host tools including debugger, interprets the requests, executes them and sends the results to the host.
L.h. De Figueiredo - One of the best experts on this subject based on the ideXlab platform.
-
INTERSECTING AND TRIMMING PARAMETRIC MESHES ON FINITE-ELEMENT ShellS
International Journal for Numerical Methods in Engineering, 2000Co-Authors: Luiz Cristovão Gomes Coelho, Marcelo Gattass, L.h. De FigueiredoAbstract:LUIZ CRISTOVAO G. COELHO MARCELO GATTASS˜ Department of Computer Science, PUC-Rio, Rio de Janeiro, BrazilLUIZ HENRIQUE DE FIGUEIREDOLNCC–Laborato´rio Nacional de Computac¸a˜o Cient´ifica, P etro´polis, BrazilABSTRACTWe present an algorithm for intersecting finite-element meshes defined on parametric surface patches. The inter-section curves are modeled precisely and both meshes are adjusted to the newly formed borders, without unwantedreparametrizations. The algorithm is part of an Interactive Shell modeling program that has been used in the designof large offshore oil structures. To achieve good Interactive response, we represent meshes with a topological datastructure that stores its entities in spatial indexing trees instead of linear lists. These trees speed up the intersectioncomputations required to determine points of the trimming curves; moreover, when combined with the topologicalinformation, they allow remeshing using only local queries.
-
An algorithm for intersecting and trimming parametric meshes
Proceedings SIBGRAPI'98. International Symposium on Computer Graphics Image Processing and Vision (Cat. No.98EX237), 1Co-Authors: Luiz Cristovão Gomes Coelho, Marcelo Gattass, L.h. De FigueiredoAbstract:We present an algorithm for intersecting finite-element meshes defined on parametric surface patches. The intersection curves are modeled precisely and both meshes are adjusted to the newly formed borders. The algorithm is part of an Interactive Shell modeling program, which has been used in the design of large offshore oil structures. We avoid unacceptable interaction delays by using a variant of the DCEL data structure that stores topological entities in spatial indexing trees instead of linked lists. These trees speed up the intersection computations required to determine points of the trimming curves, and also allows mesh reconstruction using only local queries.
Yihua Huang - One of the best experts on this subject based on the ideXlab platform.
-
ICA3PP (4) - iPLAR: Towards Interactive Programming with Parallel Linear Algebra in R
Algorithms and Architectures for Parallel Processing, 2015Co-Authors: Zhaokang Wang, Shiqing Fan, Chunfeng Yuan, Yihua HuangAbstract:R is a widely-used statistical programming language in the data science community. However, in the big data era, R faces the challenges from large scale data analysis tasks. It lacks the ability of distributed linear algebra computation in its local Interactive Shell. In this paper, we propose iPLAR, a system that runs in the Interactive R environment, wraps the high performance parallel linear algebra library, and provides a group of easy-to-use interfaces. iPLAR adopts the client-server model to uncouple the Interactive Shell from the ScaLAPACK/MPI distributed computing backend. In addition, it provides R users with a group of parallel-detail-transparent interfaces that are similar to the native R linear algebra interfaces. We evaluate the efficiency of iPLAR with representative basic matrix operations and two widely-used machine learning algorithms. Experimental results show that iPLAR achieves the near-linear data scalability and enhances the Interactive processing capability of R to large problem scales.
-
iplar towards Interactive programming with parallel linear algebra in r
International Conference on Algorithms and Architectures for Parallel Processing, 2015Co-Authors: Zhaokang Wang, Shiqing Fan, Chunfeng Yuan, Yihua HuangAbstract:R is a widely-used statistical programming language in the data science community. However, in the big data era, R faces the challenges from large scale data analysis tasks. It lacks the ability of distributed linear algebra computation in its local Interactive Shell. In this paper, we propose iPLAR, a system that runs in the Interactive R environment, wraps the high performance parallel linear algebra library, and provides a group of easy-to-use interfaces. iPLAR adopts the client-server model to uncouple the Interactive Shell from the ScaLAPACK/MPI distributed computing backend. In addition, it provides R users with a group of parallel-detail-transparent interfaces that are similar to the native R linear algebra interfaces. We evaluate the efficiency of iPLAR with representative basic matrix operations and two widely-used machine learning algorithms. Experimental results show that iPLAR achieves the near-linear data scalability and enhances the Interactive processing capability of R to large problem scales.
Rinus Plasmeijer - One of the best experts on this subject based on the ideXlab platform.
-
Advanced Functional Programming - A functional Shell that operates on typed and compiled applications
Advanced Functional Programming, 2005Co-Authors: Rinus Plasmeijer, Arjen Van WeeldenAbstract:Esther is the Interactive Shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, the Shell can be used for manipulating files, applications, data and processes at the command line. A special feature of Esther is that the Shell language provides the basic functionality of a strongly typed lazy functional language, at the command line. The Shell type checks each command line and only executes well-typed expressions. Files are typed as well, and applications are simply files with a function type. The type checking/inferencing performed by the Shell is actually performed by the hybrid static/dynamic type system of Clean. The Shell behaves like an interpreter, but it actually executes a command line by combining existing compiled code of functions/programs on disk. Clean’s dynamic linker is used to store (and retrieve) any expression (both data and code) with its type on disk. This linker is also used to communicate values of any type, e.g., data, closures, and functions (i.e., compiled code), between running applications in a type safe way. The Shell combines the advantages of interpreters (direct response) and compilers (statically typed, fast code). Applications (compiled functions) can be used, in a type safe way, in the Shell, and functions defined in the Shell can be used by any compiled application.
-
A functional Shell that operates on typed and compiled applications
Lecture Notes in Computer Science, 2005Co-Authors: Rinus Plasmeijer, Arjen Van WeeldenAbstract:Esther is the Interactive Shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, the Shell can be used for manipulating files, applications, data and processes at the command line. A special feature of Esther is that the Shell language provides the basic functionality of a strongly typed lazy functional language, at the command line. The Shell type checks each command line and only executes well-typed expressions. Files are typed as well, and applications are simply files with a function type. The type checking/inferencing performed by the Shell is actually performed by the hybrid static/dynamic type system of Clean. The Shell behaves like an interpreter, but it actually executes a command line by combining existing compiled code of functions/programs on disk. Clean's dynamic linker is used to store (and retrieve) any expression (both data and code) with its type on disk. This linker is also used to communicate values of any type, e.g., data, closures, and functions (i.e., compiled code), between running applications in a type safe way. The Shell combines the advantages of interpreters (direct response) and compilers (statically typed, fast code). Applications (compiled functions) can be used, in a type safe way, in the Shell, and functions defined in the Shell can be used by any compiled application.
-
IFL - Towards a strongly typed functional operating system
Implementation of Functional Languages, 2003Co-Authors: Arjen Van Weelden, Rinus PlasmeijerAbstract:In this paper, we present Famke. It is a prototype implementation of a strongly typed operating system written in Clean. Famke enables the creation and management of independent distributed Clean processes on a network of workstations. It uses Clean's dynamic type system and its dynamic linker to communicate values of any type, e.g. data, closures, and functions (i.e. compiled code), between running applications in a type safe way. Mobile processes can be implemented using Famke's ability to communicate functions. We have built an Interactive Shell on top of Famke that enables user interaction. The Shell uses a functional-style command language that allows construction of new processes, and it type checks the command line before executing it. Famke's type safe run-time extensibility makes it a strongly typed operating system that can be tailored to a given situation.
-
Towards a strongly typed functional operating system
Lecture Notes in Computer Science, 2003Co-Authors: Arjen Van Weelden, Rinus PlasmeijerAbstract:In this paper, we present Famke. It is a prototype implementation of a strongly typed operating system written in Clean. Famke enables the creation and management of independent distributed Clean processes on a network of workstations. It uses Clean's dynamic type system and its dynamic linker to communicate values of any type, e.g. data, closures, and functions (i.e. compiled code), between running applications in a type safe way. Mobile processes can be implemented using Famke's ability to communicate functions. We have built an Interactive Shell on top of Famke that enables user interaction. The Shell uses a functional-style command language that allows construction of new processes, and it type checks the command line before executing it. Famke's type safe run-time extensibility makes it a strongly typed operating system that can be tailored to a given situation.
Luiz Cristovão Gomes Coelho - One of the best experts on this subject based on the ideXlab platform.
-
INTERSECTING AND TRIMMING PARAMETRIC MESHES ON FINITE-ELEMENT ShellS
International Journal for Numerical Methods in Engineering, 2000Co-Authors: Luiz Cristovão Gomes Coelho, Marcelo Gattass, L.h. De FigueiredoAbstract:LUIZ CRISTOVAO G. COELHO MARCELO GATTASS˜ Department of Computer Science, PUC-Rio, Rio de Janeiro, BrazilLUIZ HENRIQUE DE FIGUEIREDOLNCC–Laborato´rio Nacional de Computac¸a˜o Cient´ifica, P etro´polis, BrazilABSTRACTWe present an algorithm for intersecting finite-element meshes defined on parametric surface patches. The inter-section curves are modeled precisely and both meshes are adjusted to the newly formed borders, without unwantedreparametrizations. The algorithm is part of an Interactive Shell modeling program that has been used in the designof large offshore oil structures. To achieve good Interactive response, we represent meshes with a topological datastructure that stores its entities in spatial indexing trees instead of linear lists. These trees speed up the intersectioncomputations required to determine points of the trimming curves; moreover, when combined with the topologicalinformation, they allow remeshing using only local queries.
-
An algorithm for intersecting and trimming parametric meshes
Proceedings SIBGRAPI'98. International Symposium on Computer Graphics Image Processing and Vision (Cat. No.98EX237), 1Co-Authors: Luiz Cristovão Gomes Coelho, Marcelo Gattass, L.h. De FigueiredoAbstract:We present an algorithm for intersecting finite-element meshes defined on parametric surface patches. The intersection curves are modeled precisely and both meshes are adjusted to the newly formed borders. The algorithm is part of an Interactive Shell modeling program, which has been used in the design of large offshore oil structures. We avoid unacceptable interaction delays by using a variant of the DCEL data structure that stores topological entities in spatial indexing trees instead of linked lists. These trees speed up the intersection computations required to determine points of the trimming curves, and also allows mesh reconstruction using only local queries.