High-level languages for small devices: A case study

In this paper we study, through a concrete case, the feasibility of using a high-level, general-purpose logic language in the design and implementation of applications targeting wearable computers. The case study is a "sound spatializer" which, given real-time signáis for monaural audio and heading, generates stereo sound which appears to come from a position in space. The use of advanced compile-time transformations and optimizations made it possible to execute code written in a clear style without efñciency or architectural concerns on the target device, while meeting strict existing time and memory constraints. The final executable compares favorably with a similar implementation written in C. We believe that this case is representative of a wider class of common pervasive computing applications, and that the techniques we show here can be put to good use in a range of scenarios. This points to the possibility of applying high-level languages, with their associated flexibility, conciseness, ability to be automatically parallelized, sophisticated compile-time tools for analysis and verification, etc., to the embedded systems field without paying an unnecessary performance penalty.

Towards a high-level implementation of flexible parallelism primitives for symbolic languages

An abstract is not available.

Improvement and evaluation of the MS2SV for mixed systems design described in abstraction high level

This paper presents an important improvement of the MS2SV tool. The MS2SV performs the translation of mixed systems developed in MATLAB / Simulink for a structural or behavioral description in VHDL-AMS. Previously, the MS2SV translated only models of the LIB MS2SV library. This improvement allows designer to create your own library to translation. As case study was used a rudder controller employed in an unmanned aerial vehicle. For comparison with the original model the VHDL-AMS code obtained by the translation was simulated in SystemVision environment. The results proved the efficiency of the tool using the translation improvement proposed in this paper.

PyGirl Generating Whole-System VMs from high-level models using PyPy

Virtual machines emulating hardware devices are generally implemented in low-level languages and using a low-level style for performance reasons. This trend results in largely difficult to understand, difficult to extend and unmaintainable systems. As new general techniques for virtual machines arise, it gets harder to incorporate or test these techniques because of early design and optimization decisions. In this paper we show how such decisions can be postponed to later phases by separating virtual machine implementation issues from the high-level machine-specific model. We construct compact models of whole-system VMs in a high-level language, which exclude all low-level implementation details. We use the pluggable translation toolchain PyPy to translate those models to executables. During the translation process, the toolchain reintroduces the VM implementation and optimization details for specific target platforms. As a case study we implement an executable model of a hardware gaming device. We show that our approach to VM building increases understandability, maintainability and extendability while preserving performance.

PyGirl: Generating Whole-System VMs from High-Level Prototypes Using PyPy

Virtual machines (VMs) emulating hardware devices are generally implemented in low-level languages for performance reasons. This results in unmaintainable systems that are difficult to understand. In this paper we report on our experience using the PyPy toolchain to improve the portability and reduce the complexity of whole-system VM implementations. As a case study we implement a VM prototype for a Nintendo Game Boy, called PyGirl, in which the high-level model is separated from low-level VM implementation issues. We shed light on the process of refactoring from a low-level VM implementation in Java to a high-level model in RPython. We show that our whole-system VM written with PyPy is significantly less complex than standard implementations, without substantial loss in performance.

High-level characteristics of or-and independent and-parallelism in prolog

Although studies of a number of parallel implementations of logic programming languages are now available, their results are difficult to interpret due to the multiplicity of factors involved, the effect of each of which is difficult to sepárate. In this paper we present the results of a high-level simulation study of or- and independent and-parallelism with a wide selection of Prolog programs that aims to determine the intrinsic amount of parallelism, independently of implementation factors, thus facilitating this separation. We expect this study will be instrumental in better understanding and comparing results from actual implementations, as shown by some examples provided in the paper. In addition, the paper examines some of the issues and tradeoffs associated with the combination of and- and or-parallelism and proposes reasonable solutions based on the simulation data obtained.

Formal modeling and analysis techniques for high level Petri nets

Petri Nets are a formal, graphical and executable modeling technique for the specification and analysis of concurrent and distributed systems and have been widely applied in computer science and many other engineering disciplines. Low level Petri nets are simple and useful for modeling control flows but not powerful enough to define data and system functionality. High level Petri nets (HLPNs) have been developed to support data and functionality definitions, such as using complex structured data as tokens and algebraic expressions as transition formulas. Compared to low level Petri nets, HLPNs result in compact system models that are easier to be understood. Therefore, HLPNs are more useful in modeling complex systems. ^ There are two issues in using HLPNs—modeling and analysis. Modeling concerns the abstracting and representing the systems under consideration using HLPNs, and analysis deals with effective ways study the behaviors and properties of the resulting HLPN models. In this dissertation, several modeling and analysis techniques for HLPNs are studied, which are integrated into a framework that is supported by a tool. ^ For modeling, this framework integrates two formal languages: a type of HLPNs called Predicate Transition Net (PrT Net) is used to model a system's behavior and a first-order linear time temporal logic (FOLTL) to specify the system's properties. The main contribution of this dissertation with regard to modeling is to develop a software tool to support the formal modeling capabilities in this framework. ^ For analysis, this framework combines three complementary techniques, simulation, explicit state model checking and bounded model checking (BMC). Simulation is a straightforward and speedy method, but only covers some execution paths in a HLPN model. Explicit state model checking covers all the execution paths but suffers from the state explosion problem. BMC is a tradeoff as it provides a certain level of coverage while more efficient than explicit state model checking. The main contribution of this dissertation with regard to analysis is adapting BMC to analyze HLPN models and integrating the three complementary analysis techniques in a software tool to support the formal analysis capabilities in this framework. ^ The SAMTools developed for this framework in this dissertation integrates three tools: PIPE+ for HLPNs behavioral modeling and simulation, SAMAT for hierarchical structural modeling and property specification, and PIPE+Verifier for behavioral verification.^

Formal Modeling and Analysis Techniques for High Level Petri Nets

Petri Nets are a formal, graphical and executable modeling technique for the specification and analysis of concurrent and distributed systems and have been widely applied in computer science and many other engineering disciplines. Low level Petri nets are simple and useful for modeling control flows but not powerful enough to define data and system functionality. High level Petri nets (HLPNs) have been developed to support data and functionality definitions, such as using complex structured data as tokens and algebraic expressions as transition formulas. Compared to low level Petri nets, HLPNs result in compact system models that are easier to be understood. Therefore, HLPNs are more useful in modeling complex systems. There are two issues in using HLPNs - modeling and analysis. Modeling concerns the abstracting and representing the systems under consideration using HLPNs, and analysis deals with effective ways study the behaviors and properties of the resulting HLPN models. In this dissertation, several modeling and analysis techniques for HLPNs are studied, which are integrated into a framework that is supported by a tool. For modeling, this framework integrates two formal languages: a type of HLPNs called Predicate Transition Net (PrT Net) is used to model a system's behavior and a first-order linear time temporal logic (FOLTL) to specify the system's properties. The main contribution of this dissertation with regard to modeling is to develop a software tool to support the formal modeling capabilities in this framework. For analysis, this framework combines three complementary techniques, simulation, explicit state model checking and bounded model checking (BMC). Simulation is a straightforward and speedy method, but only covers some execution paths in a HLPN model. Explicit state model checking covers all the execution paths but suffers from the state explosion problem. BMC is a tradeoff as it provides a certain level of coverage while more efficient than explicit state model checking. The main contribution of this dissertation with regard to analysis is adapting BMC to analyze HLPN models and integrating the three complementary analysis techniques in a software tool to support the formal analysis capabilities in this framework. The SAMTools developed for this framework in this dissertation integrates three tools: PIPE+ for HLPNs behavioral modeling and simulation, SAMAT for hierarchical structural modeling and property specification, and PIPE+Verifier for behavioral verification.

Proposal of a High-Level Language for Writing Self Modifying Programs

This paper proposes a simple high-level programming language, endowed with resources that help encoding self-modifying programs. With this purpose, a conventional imperative language syntax (not explicitly stated in this paper) is incremented with special commands and statements forming an adaptive layer specially designed with focus on the dynamical changes to be applied to the code at run-time. The resulting language allows programmers to easily specify dynamic changes to their own program`s code. Such a language succeeds to allow programmers to effortless describe the dynamic logic of their adaptive applications. In this paper, we describe the most important aspects of the design and implementation of such a language. A small example is finally presented for illustration purposes.

High-level and phonological awareness abilities of children following management for supratentorial tumour: Part II

Background. Limited information is available regarding the impact of childhood tumour on the cerebral hemispheres and supratentorial cranial fossa. However, a recent study found that children managed for a tumour located in this region may demonstrate reduced general language abilities. However, the indirect or direct impact of a tumour in this region on higher-level language abilities in childhood is at present largely unknown. Materials and methods. The present study examined the higher language and phonological awareness abilities of five children treated for supratentorial tumour ranging in age from seven to fourteen years in age. Assessments included measures of receptive and expressive semantic abilities, inferencing, figurative language, and problem solving, as well as a comprehensive pre-literacy test. Results. As a group, reductions were evident in problem solving, and in the ability to receive and decode content of high-level language when compared to a group of age- and gender-matched peers. At an individual level, only two of five children managed for supratentorial tumour demonstrated language deficits. These two cases were noted to be the same children previously identified as also having general language deficits. More widespread findings were noted in phonological awareness, with four of the five children previously managed for supratentorial tumour demonstrating weaknesses in one or more areas. Conclusions. Findings demonstrated that weaknesses in general language ability in children managed for supratentorial tumour may indicate higher-level language difficulties. Language abilities beyond general measures of language should be monitored, as well as long-term consideration of phonological awareness abilities in this population.

A rapid selection/amplification procedure for high-level expression of recombinant protein in a metal-amplifiable mammalian expression system

We describe a strategy for the selection and amplification of foreign gene expression in Chinese hamster ovary (CHO) cells employing a metallothionein gene-containing expression vector. This report describes an amplification procedure that results in an enrichment of clones exhibiting high levels of recombinant protein production and reduces the labour required for screening recombinant cell lines.

High level of aspartic acid-bond isomerization during the synthesis of an N-linked tau glycopeptide

An increased degree of utilization of the potential N-glycosylation site In the fourth repeat unit of the human tau protein may be involved in the inability of tau to bind to the corresponding tubulin sequence(s) and in the subsequent development of the paired helical filaments of Alzheimer's disease. To model these processes, we synthesized the octadecapeptide spanning this region without sugar, and with the addition of an N-acetyl-glucosamine moiety. The carbohydrate-protected, glycosylated asparagine was incorporated as a building block during conventional Fmoc-solid phase peptide synthesis. While the crude non-glycosylated analog was obtained as a single peptide, two peptides with, the identical, expected masses, in approximately equal amounts, were detected after the cleavage of the peracetylated glycopeptide. Surprisingly, the two glycopeptides switched positions on the reversed-phase high performance liquid chromatogram after removal of the sugar-protecting acetyl groups. Nuclear magnetic resonance spectroscopy and peptide sequencing identified the more hydrophobic deprotected peak as the target peptide, and the more hydrophilic deprotected peak as a peptide analog in which the aspartic acid-bond just preceding the glycosylated asparagine residue was isomerized resulting in the formation of a beta-peptide. The anomalous chromatographic behavior of the acetylated beta-isomer could be explained on the basis of the generation of an extended hydrophobic surface which is not present in any of the other three glycopeptide variants. Repetition of the syntheses, with altered conditions and reagents, revealed reproducibly high levels of aspartic acid-bond isomerization of the glycopeptide as well as lack of isomerization for the non-glycosylated parent analog. If similar increased aspartic acid-bond isomerization occurs in vivo, a protein modification well known to take place for both the amyloid deposits and the neurofibrillary tangles in Alzheimer's disease, this process may explain the aggregation of glycosylated tau into the paired helical filaments in the affected brains. Copyright (C) 1999 European Peptide Society and John Wiley & Sons, Ltd.

Stable and high-level production of recombinant Factor IX in human hepatic cell line

Hemophilia B is a genetic disease of the coagulation system that affects one in 30,000 males worldwide. Recombinant human Factor IX (rhFIX) has been used for hemophilia B treatment, but the amount of active protein generated by these systems is inefficient, resulting in a high-cost production of rhFIX. In this study, we developed an alternative for rhFIX production. We used a retrovirus system to obtain two recombinant cell lines. We first tested rhFIX production in the human embryonic kidney 293 cells (293). Next, we tested a hepatic cell line (HepG2) because FIX is primarily expressed in the liver. Our results reveal that intracellular rhFIX expression was more efficient in HepG2/rhFIX (46%) than in 293/rhFIX (21%). The activated partial thromboplastin time test showed that HepG2/rhFIX expressed biologically active rhFIX 1.5 times higher than 293/rhFIX (P = 0.016). Recovery of rhFIX from the HepG2 by reversed-phase chromatography was straightforward. We found that rhFIX has a pharmacokinetic profile similar to that of FIX purified from human plasma when tested in hemophilic B model. HepG2/rhFIX cell line produced the highest levels of rhFIX, representing an efficient in vitro expression system. This work opens up the possibility of significantly reducing the costs of rhFIX production, with implications for expanding hemophilia B treatment in developing countries.

Features of colorectal cancers with high-level microsatellite instability occurring in familial and sporadic settings

High-level microsatellite instability (AISI-H) is demonstrated in 10 to 15% of sporadic colorectal cancers and in most cancers presenting In the inherited condition hereditary nonpolyposis colorectal cancer (HNPCC). Distinction between these categories of MSI-H cancer is of clinical importance and the aim of this study was to assess clinical, pathological, and molecular features that might he discriminatory. One hundred and twelve MSI-H colorectal cancers from families fulfilling the Bethesda criteria were compared with 57 sporadic MSI-H colorectal cancers. HNPCC cancers presented at a lower age (P < 0.001) with no sporadic MSI-H cancer being diagnosed before the age of 57 years. MSI was less extensive in HNPCC cancers with 72% microsatellite markers showing band shifts compared with 87% in sporadic tumors (P < 0.001). Absent immunostaining for hMSH2 was only found in HNPCC tumors. Methylation of bMLH1 was observed in 87% of sporadic cancers but also in 55% of HNPCC tumors that showed loss of expression of hMLH1 (P = 0.02). HNPCC cancers were more frequently characterized by aberrant beta -catenin immunostaining as evidenced by nuclear positivity (P < 0.001). Aberrant p53 immunostaining was infrequent in both groups. There were no differences with respect to 5q loss of heterozygosity or codon 12 K-ras mutation, which were infrequent in both groups. Sporadic MSI-H cancers were more frequently heterogeneous (P < 0.001), poorly differentiated (P = 0.02), mucinous (P = 0.02), and proximally located (P = 0.04) than RNPCC tumors. In sporadic MSI-H cancers, contiguous adenomas were likely to be serrated whereas traditional adenomas were dominant in HNPCC. Lymphocytic infiltration was more pronounced in HNPCC but the results did not reach statistical significance. Overall, HNPCC cancers were more like common colorectal cancer in terms of morphology and expression of beta -catenin whereas sporadic MSI-H cancers displayed features consistent with a different morphogenesis. No individual feature was discriminatory for all RN-PCC cancers. However, a model based on four features was able to classify 94.5% of tumors as sporadic or HNPCC. The finding of multiple differences between sporadic and familial MSI-H colorectal cancer with respect to both genotype and phenotype is consistent with tumorigenesis through parallel evolutionary pathways and emphasizes the importance of studying the two groups separately.