No description available.

Manual design methods used successfully up to now for SSI and MSI parts are inadequate for logically complex and densely packed VLSI circuitry. Automating the design process has, therefore, become an essential goal of present-day practice. Hardware description languages form a useful front-end to the design-automation process which ultimately generates masks suitable for chip fabrication. AHPL has long been in use as a vehicle for the description of clock-mode digital systems. Supporting software packages include a simulator which allows the designer to debug his design at a functional level. A subsequent 3-stage compiler extracts global information contained in the original AHPL description to produce a comprehensive data-base. It then generates hardware specifications suitable for down-stream design and manufacturing activities. The SLA is an evolution of the PLA concept. Design with SLA's has the notable advantage of allowing hardware representation of functional and layout information, while sidestepping the costly and time-consuming placement and routing problem. This dissertation describes a methodology for translation to an SLA form of hardware realization from an AHPL description. The global information extracted from the AHPL data-base plays a prominent part in guiding the heuristic placement and routing algorithms.

Στην παρούσα διπλωματική εργασία παρουσιάζεται η δημιουργία ενός προγράμματος σε γλώσσα προγραμματισμού C++ το οποίο εναρμονίζει αυτόματα ένα μουσικό κομ- μάτι. To πρόγραμμα αυτό παίρνει στην είσοδό του μία μελωδία απλών φθογγόσημων και δίνει στην έξοδό του την ίδια μελωδία αλλά με τις συγχορδίες των φθογγόσημων. Η επιλογή των κατάλληλων συγχορδιών γίνεται με τη χρήση προεπιλεγμένων κανόνων της αρμονίας, για τους οποίους υλοποιείται πηγαίος κώδικας. Το τελικό πρόγραμμα είναι ένας συνδυασμός κατασκευασμένων προγραμματιστικά κανόνων, συγχορδιών, κλιμάκων με έξοδο την αρχική μελωδία προσαρμοσμένη σε συγχορδίες και όχι φθογγόσημα. Το πρόγραμμα αυτόματης εναρμόνισης μελωδίας, αποτυπώνει τις γνώσεις της αρμονίας σε ένα αλγοριθμικό πρόγραμμα και αναμένεται να δώσει ακριβή και σωστά αποτελέσματα στην έξοδο για την εναρμόνιση οποιασδήποτε μελωδίας και κλίμακας. / This diploma dissertation is presenting the creation of a program in C++ programming language which harmonizes automatically a piece of music. This program takes in its input a melody consisted of simple pitches and gives as an output the same melody but with 3 pitches for each entering pitch. The selection of the suitable group of the 3 pitches is being achieved with the use of preselected rules of harmony for which spontaneous code is realized. The final program is a combination of programmatically manufactured rules, groups of 3 pitches and scales with the initial melody adapted in groups of 3 pitches ,and not simple pitches, as output. The automatic harmonization program impresses the harmony’s knowledge in an algorithmic program and it is expected to give precise and correct results in the exit for the harmonization of any melody and in any scale the musical piece is written.

No description available.

No description available.

No description available.

Programming languages Visual Basic 6 and Visual Basic .NET have been compared from the point of view of rapid application development in the work. Environment differences of the programming systems have been analysed. New possibilities of Visual Basic .NET language have been investigated concerning menu creation, text files tasks, user forms creation, class heredity. Syntax changes in Visual Basic .NET programming language have been analysed. Database programming tools have been presented and compared. Differences of both systems have been illustrated by practical examples. Various rates of creating indexes for bibliographical documents have been analysed. Standard documents of construction cost data in the MS Word document format have been moved to the MS Access database. Various speed rates of database reading and editing have been analysed.

A methodology was developed in this study for identifying the cognitive, pedagogical, and computational characteristics of computer-based learning environments. The characterization of the cognitive and pedagogical features was achieved by decomposing the learning environments into episodes which were composed of sequences of "views". Each "view" was described in terms of the different types of knowledge presented, the pedagogical strategies used to present the knowledge, and the forms and functions of user-computer interactions elicited. The computational characteristics were described in terms of modularity and other programming properties. The methodology was applied to characterizing the instructional programs produced by student teachers using Logo. / The results showed that this methodology can successfully identify the cognitive, pedagogical and computational characteristics of the learning environments. It can also clarify what can be learned in a microworld, especially the "powerful ideas" in Logo environments. In addition, the usability and constraints of learning environments in meeting the learners' cognitive needs during the learning process can be assessed.

A data structure editor is presented for use in an integrated, fragment-based programming environment. This editor employs high resolution computer graphics to present the user with an iconic representation of the internal storage of a running program. / The editor allows the creation, modification, and deletion of data structures. These abilities allow the user to quickly sketch data structures with which to test incomplete program fragments, alleviating the need for driver routines. / To keep the user cognizant of events inside his program, a technique for automated display management is presented allowing the user to keep the most important objects in the viewport at all times. A history facility permits the user to see the former values of all variables. / Execution controls are provided allowing the user to control the scope and speed of execution, manipulate frames on the run-time stack, set breakpoints, and profile the executing algorithm.

No description available.