The Experts below are selected from a list of 201 Experts worldwide ranked by ideXlab platform
Mateti Prabhaker - One of the best experts on this subject based on the ideXlab platform.
-
CEG 233-01: Linux and Windows
CORE Scholar, 2011Co-Authors: Mateti PrabhakerAbstract:Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories, Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic Linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSUTSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs. Prerequisites: None
-
CEG 233: Linux and Windows
CORE Scholar, 2011Co-Authors: Mateti PrabhakerAbstract:Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic Linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs
-
CEG 2350: OS Concepts and Usage
CORE Scholar, 2011Co-Authors: Mateti PrabhakerAbstract:Introduction to Linux and Windows systems. GUT and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic Linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs. Prerequisites: CS 240 or CS 220 or equivalent
-
CEG 233-01: Linux and Windows
CORE Scholar, 2010Co-Authors: Mateti PrabhakerAbstract:Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic Linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs. Prerequisites: CS 240 or CS 220 or equivalent
-
CEG 233-01: Linux and Windows
CORE Scholar, 2008Co-Authors: Mateti PrabhakerAbstract:Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic Linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs
Kazuhiko Ohe - One of the best experts on this subject based on the ideXlab platform.
-
a corba based object framework with patient identification translation and Dynamic Linking methods for exchanging patient data
Methods of Information in Medicine, 1999Co-Authors: Cun Wang, Kazuhiko OheAbstract:Exchanging and integration of patient data across heterogeneous databases and institutional boundaries offers many problems. We focused on two issues: (1) how to identify identical patients between different systems and institutions while lacking universal patient identifiers; and (2) how to link patient data across heterogeneous databases and institutional boundaries. To solve these problems, we created a patient identification (ID) translation model and a Dynamic Linking method in the Common Object Request Broker Architecture (CORBA) environment. The algorithm for the patient ID translation is based on patient attribute matching plus computer-based human checking; the method for Dynamic Linking is temporal mapping. By implementing these methods into computer systems with help of the distributed object computing technology, we built a prototype of a CORBA-based object framework in which the patient ID translation and Dynamic Linking methods were embedded. Our experiments with a Web-based user interface using the object framework and Dynamic Linking-through the object framework were successful. These methods are important for exchanging and integrating patient data across heterogeneous databases and institutional boundaries.
Philip W. L. Fong - One of the best experts on this subject based on the ideXlab platform.
-
ABSTRACT Pluggable Verification Modules: An Extensible Protection Mechanism for the JVM
2008Co-Authors: Philip W. L. FongAbstract:Through the design and implementation of a JVM that supports Pluggable Verification Modules (PVMs), the idea of an extensible protection mechanism is entertained. Link-time bytecode verification becomes a pluggable service that can be readily replaced, reconfigured and augmented. Application-specific verification services can be safely introduced into the Dynamic Linking process of the JVM. This feature is enabled by the adoption of a previously proposed modular verification architecture, Proof Linking [23, 24], which decouples bytecode verification from the Dynamic Linking process, rendering the verifier a replaceable module. The PVM mechanism has been implemented in an open source JVM, the Aegis VM [21]. To evaluate the software engineering and security engineering benefits of this extensible protection mechanism, an augmented type system JAC (Java Access Control) [37] has been successfully implemented as a PVM
-
Title of thesis: Proof Linking: A Modular Verification Architecture
2008Co-Authors: Philip W. L. Fong, Simon Fraser UniversityAbstract:ii This dissertation presents a critical rethinking of the Java bytecode verification archi-tecture from the perspective of a software engineer. In existing commercial implemen-tations of the Java Virtual Machine, there is a tight coupling between the Dynamic Linking process and the bytecode verifier. This leads to delocalized and interleaving program plans, making the verifier difficult to maintain and comprehend. A modular mobile code verification architecture, called Proof Linking, is proposed. By establish-ing explicit verification interfaces in the form of proof obligations and commitments, and by careful scheduling of Linking events, Proof Linking supports the construction of bytecode verifier as a separate engineering component, fully decoupled from Java’s Dynamic Linking process. This turns out to have two additional benefits: (1) Modu-larization enables distributed verification protocols, in which part of the verification burden can be safely offloaded to remote sites; (2) Alternative static analyses can now be integrated into Java’s Dynamic Linking process with ease, thereby making it conve-nient to extend the protection mechanism of Java. These benefits make Proof Linking a competitive verification architecture for mobile code systems. A prototype of the Proof Linking Architecture has been implemented in an open source Java Virtual Machine, the Aegis V
-
Proof Linking: A Modular Verification Architecture for Mobile Code Systems
2004Co-Authors: Philip W. L. FongAbstract:This dissertation presents a critical rethinking of the Java bytecode verification architecture from the perspective of a software engineer. In existing commercial implementations of the Java Virtual Machine, there is a tight coupling between the Dynamic Linking process and the bytecode verifier. This leads to delocalized and interleaving program plans, making the verifier difficult to maintain and comprehend. A modular mobile code verification architecture, called Proof Linking, is proposed. By establishing explicit verification interfaces in the form of proof obligations and commitments, and by careful scheduling of Linking events, Proof Linking supports the construction of bytecode verifier as a separate engineering component, fully decoupled from Java's Dynamic Linking process. This turns out to have two additional benefits: (1) Modularization enables distributed verification protocols, in which part of the verification burden can be safely offloaded to remote sites; (2) Alternative static analyses can now be integrated into Java's Dynamic Linking process with ease, thereby making it convenient to extend the protection mechanism of Java. These benefits make Proof Linking a competitive verification architecture for mobile code systems. A prototype of the Proof Linking Architecture has been implemented in an open source Java Virtual Machine, the Aegis VM (http://aegisvm.sourceforge.net). On th
Yunhao Liu - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Linking and loading in networked embedded systems
2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems MASS '09, 2009Co-Authors: Wei Dong, Jiajun Bu, Chun Chen, Xue Liu, Yunhao LiuAbstract:We present a holistic Dynamic Linking and loading mechanism in networked embedded systems. Our design and implementation are guided by four requirements, which are to provide (i) minimal code size (ii) efficient execution and loading speed (iii) portable design (iv) isolated kernel/application development. First, we develop a tool to minimize the standard ELF format via many techniques in order to reduce the code dissemination cost. Second, we employ the techniques of pre-relocating and pre-Linking (to kernel functions) to reduce the run-time Linking overhead, thus improving the loading speed. Third, based on relocatable ELF and the modular design of the Dynamic linker and loader, our approach can be easily ported to different platforms. Fourth, by maintaining a kernel jump table, we provide a clean isolation between kernel and application development. We have implemented the Dynamic Linking and loading mechanism on SenSpire OS, a micro sensor node operating system. The evaluation results show that our design and implementation meet our design goals: the code size of our SELF format is only 15%-30% of that of standard ELF, 38%-83% of that of CELF, a compact ELF format for the Contiki operating system; the loading speed improvement varies from 40%-50% compared to the standard mechanism; our design is portable to both MicaZ and TelosB motes, and we allow updating both application modules and kernel services in isolation without prior knowledge about the whole system information.
Cun Wang - One of the best experts on this subject based on the ideXlab platform.
-
a corba based object framework with patient identification translation and Dynamic Linking methods for exchanging patient data
Methods of Information in Medicine, 1999Co-Authors: Cun Wang, Kazuhiko OheAbstract:Exchanging and integration of patient data across heterogeneous databases and institutional boundaries offers many problems. We focused on two issues: (1) how to identify identical patients between different systems and institutions while lacking universal patient identifiers; and (2) how to link patient data across heterogeneous databases and institutional boundaries. To solve these problems, we created a patient identification (ID) translation model and a Dynamic Linking method in the Common Object Request Broker Architecture (CORBA) environment. The algorithm for the patient ID translation is based on patient attribute matching plus computer-based human checking; the method for Dynamic Linking is temporal mapping. By implementing these methods into computer systems with help of the distributed object computing technology, we built a prototype of a CORBA-based object framework in which the patient ID translation and Dynamic Linking methods were embedded. Our experiments with a Web-based user interface using the object framework and Dynamic Linking-through the object framework were successful. These methods are important for exchanging and integrating patient data across heterogeneous databases and institutional boundaries.
