PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638507
A. Sokolov
{"title":"Optimization strategies of stack control","authors":"A. Sokolov","doi":"10.1145/638476.638507","DOIUrl":"https://doi.org/10.1145/638476.638507","url":null,"abstract":"This paper concerns issues related to building mathematical models and optimal algorithms of stacks [1] control in single-and two-level memory. These models were constructed as 1, 2 and 3 dimensional random walks. In our opinion the algorithms, constructed for concrete data structure, will work better, than universal replacement algorithms in paging virtual and cache-memory. It was confirmed by the practice of construction of stack computers [1].Some scientists think, that non-Merkov model is more exact model of stacks behavior[12]. In [13] we have studied models, which include the possibility that, probabilities of the operations depend on the operations performed at the previous step. We can't include this models to the paper because of its small volume. On the other hand Ertl's finding concerns only particular application of stacks - stack caching for interpreters. It is very important, but there are many other applications of stacks. For example recursive algorithms, computer graphics, system tables and many other, when dynamic allocation of stacks after compilation(in the time of program running) it requires.This research work was supported by the Russian Foundation for Fundamental Research. grant 01-01-00113.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127228312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638489
B. Milosavljević, M. Vidaković, Z. Konjovic
{"title":"Automatic code generation for database-oriented web applications","authors":"B. Milosavljević, M. Vidaković, Z. Konjovic","doi":"10.1145/638476.638489","DOIUrl":"https://doi.org/10.1145/638476.638489","url":null,"abstract":"The paper presents an architecture for database-oriented web applications. Then it introduces concepts which form a foundation for a code generation tool that supports the software construction process in the web application domain. The tool follows simple rules about mapping JavaBean components to the database schema and generates components, as well as a set of standardized JSP pages. The mapping is specified as an instance of an XML Schema document presented here. Efficiency of this tool is analyzed in several projects.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124583510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638493
Andrew Burnett, Keith Winters, T. Dowling
{"title":"A Java implementation of an elliptic curve cryptosystem","authors":"Andrew Burnett, Keith Winters, T. Dowling","doi":"10.1145/638476.638493","DOIUrl":"https://doi.org/10.1145/638476.638493","url":null,"abstract":"We describe a Java implementation of an ElGamal based elliptic curve cryptosystem. We then illustrate the use of this implementation in a working prototype.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127976251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638480
Jaroslav Kacer
{"title":"Discrete event simulations with J-Sim","authors":"Jaroslav Kacer","doi":"10.1145/638476.638480","DOIUrl":"https://doi.org/10.1145/638476.638480","url":null,"abstract":"This paper describes J-Sim, a Java library for discrete-time process-oriented simulation. J-Sim is a fully portable successor to C-Sim, an already existing library written in C. The concepts used in both libraries are inherited from the Simula language. In this paper, the theoretical background, basic principles of implementation, and a simple example of use are presented.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"52 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132831277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638509
Jeremy Singer
{"title":"Porting legacy interpretive bytecode to the CLR","authors":"Jeremy Singer","doi":"10.1145/638476.638509","DOIUrl":"https://doi.org/10.1145/638476.638509","url":null,"abstract":"We describe and evaluate five different approaches to executing legacy BCPL programs on the Common Language Runtime. The approaches cover the entire spectrum of machine-independent compilation, from high-level source code to low-level bytecode. We discuss the trade-offs involved with each approach.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638497
E. Hyland, Gary Clynch
{"title":"Initial experiences gained and initiatives employed in the teaching of Java programming in the Institute of Technology Tallaght","authors":"E. Hyland, Gary Clynch","doi":"10.1145/638476.638497","DOIUrl":"https://doi.org/10.1145/638476.638497","url":null,"abstract":"This paper describes recent experiences gained and initiatives employed in the teaching of Java programming to first and second year students in the Institute of Technology Tallaght from September 2000 to March 2002. It outlines some e-learning, technological and pedagogical initiatives that were undertaken within the department and the resultant preliminary outcomes. The outcomes have been determined after detailed analysis of the results of a survey which was commissioned to determine the effectiveness of the initiatives and also to identify those parts of the Java language which were causing students particular difficulty. The students surveyed are currently completing their fourth and final Java programming module. The Java programming modules make up the software development stream of a 2-year National Certificate in Computing (Information Systems). The typical profile of a first year computing student in IT Tallaght is someone who has achieved a reasonable but not exceptional level of academic attainment in the Leaving Certificate and who has had little or no previous exposure to software development. The design of the Java programming modules, while geared towards novices, is ambitious in an institutional learning context.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638488
B. Nolan
{"title":"The JAM suite: a voice-enabled network-based virtual band application","authors":"B. Nolan","doi":"10.1145/638476.638488","DOIUrl":"https://doi.org/10.1145/638476.638488","url":null,"abstract":"The Java Audio Music-suite (J.A.M. for short) is a suite of applications that provides tools and audio processing utilities for musicians. Its core functionality includes a means whereby musicians who are geographically dispersed can play music together. An additional utility determines the actual musical notes from a piece of music using Fourier Transform techniques. All of these functions are complemented by a voice-enabled, animated help agent that takes in voice commands using speech recognition and reports errors via text-to-speech technology.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123421899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638496
Bob Lang
{"title":"Teaching new programmers: a Java tool set as a student teaching aid","authors":"Bob Lang","doi":"10.1145/638476.638496","DOIUrl":"https://doi.org/10.1145/638476.638496","url":null,"abstract":"The javac compiler does not always produce error message suitable for learners and there are many Java traps which the compiler does not report. This paper describes a tool set which helps students avoid some of these difficulties.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126723964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638512
J. Ronne, A. Hartmann, W. Amme, M. Franz
{"title":"Efficient online optimization by utilizing offline analysis and the safeTSA representation","authors":"J. Ronne, A. Hartmann, W. Amme, M. Franz","doi":"10.1145/638476.638512","DOIUrl":"https://doi.org/10.1145/638476.638512","url":null,"abstract":"Conventional mobile-code representations, e.g. Java bytecode, provide machine-independence and type-safety, but do so at the expense of performance. This performance hit can be taken in the form of decreased throughput or in increased latency. SafeTSA was designed to reduce this performance hit, especially when producing high-quality optimized machine code. It does this by utilizing SSA form and thus shifting dataflow analysis effort from the online JIT compiler to the offline producer of the safeTSA program.This paper describes the extension of safeTSA to support a greater shifting of optimiza- tion effort away from the online JIT compiler, increase the performance, without sacrificing type-safety or machine-independence. Specifically, we describe mechanisms to reduce.the cost of online register allocation through offline analysis, and to use offline escape analysis so the online JIT compiler can produce less heap allocations.","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116099453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PPPJ/IREPub Date : 2002-06-13DOI: 10.1145/638476.638487
Geraldine Gray
{"title":"Virtual credit card processing system","authors":"Geraldine Gray","doi":"10.1145/638476.638487","DOIUrl":"https://doi.org/10.1145/638476.638487","url":null,"abstract":"The Institute of Technology Blanchardstown decided in 1999 to teach Java to our computing students from 1st year. Java is now being used to support the practical component of all our subjects. This paper presents a project implemented by two of our third year students as a case study of what students can achieve after 3 years of Java programming. The virtual credit card processing system is an e-business system which provides a secure and universal mechanism for making purchases over the Internet. The system uses Remote Method Invocation(RMI), Java Server Pages(JSP), Java Servlets and Java Database Connectivity(JDBC).","PeriodicalId":120999,"journal":{"name":"PPPJ/IRE","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121624609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}