Search results for "Programming Languages"
showing 10 items of 138 documents
Space-Time, Phenomenology, and the Picture Theory of Language
2010
To estimate Minkowski’s introduction of space-time in relativity, the case is made for the view that abstract language and mathematics carries meaning not only by its connections with observation but as pictures of facts. This view is contrasted to the more traditional intuitionism of Hume, Mach, and Husserl. Einstein’s attempt at a conceptual reconstruction of space and time as well as Husserl’s analysis of the loss of meaning in science through increasing abstraction is analysed. Wittgenstein’s picture theory of language is used to explain how meaning is conveyed by abstract expressions, with the Minkowski space as a case.
Designing for Student-Centered Hybrid Learning Environments: A Framework for Programming Languages Course Design
2022
Hybrid learning environments are a means of delivering instructional content in that online educational materials and opportunities for interaction were combined with traditional classroom methods. Hybrid learning environments give students the opportunity to work in an environment enriched with digital learning tools, and to support student-based learning approach. Student-based learning approach promotes engagement to make students active learners via various ways such as interactivity, feedback, etc. Researchers identified feedback as an activity for promoting effective online learning and more so creating the environment for teacher-student teaching and learning interaction. Besides, so…
Onset of Convection in an Inclined Anisotropic Porous Layer with Internal Heat Generation
2019
The onset of convection in an inclined porous layer which is heated internally by a uniform distribution of heat sources is considered. We investigate the combined effects of inclination, anisotropy and internal heat generation on the linear instability of the basic parallel flow. When the Rayleigh number is sufficiently large, instability occurs and a convective motion is set up. It turns out that the preferred motion at convection onset depends quite strongly on the anisotropy ratio, &xi
Optimality conditions for nondifferentiable convex semi-infinite programming
1983
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.
Another defence of enumerated types
1991
I claim that enumerations, while of course not strictly necessary, are an elegant and useful facility in modern programming languages. I try to show that arguments recently given against them are weak at best and bogus a t worst, for general-purpose programming. Some related issues on types in programming languages are touched as well. These make it even more questionable whether Oberon marks progress or regress in language design.
Kvanttikoneohjelmointi
2016
Työssä tutkittiin kvanttiohjelmointikielten nykytilaa. Tavoitteena oli pintapuolisesti kartoittaa millaisia kieliä on olemassa, mitä niiden erot ovat ja miksi niitäonkehitetty,vaikkakäytännönkvanttitietokoneitaeivieläolekaan.Tämätutki- mustavoite toteutui hyvin. Johtopäätöksenä voidaan sanoa, että kvanttiohjelmoin- tikieliä on kehitetty suhteellisen paljon kvanttitietokoneiden puuttumiseen nähden, ja ne eroavat monilta osin. Myös niiden kehittämiseen löydettiin paljon hyviä syitä. In this paper the current state of quantum programming languages was studied. The objective was to do a survey of existing languages, their differences, and the reasons for their development, even though practical…
Semantics of UML 2.0 Activity Diagram for Business Modeling by Means of Virtual Machine
2005
The paper proposes a more formalized definition of UML 2.0 Activity Diagram semantics. A subset of activity diagram constructs relevant for business process modeling is considered. The semantics definition is based on the original token flow methodology, but a more constructive approach is used. The Activity Diagram Virtual machine is defined by means of a metamodel, with operations defined by a mix of pseudocode and OCL pre- and postconditions. A formal procedure is described which builds the virtual machine for any activity diagram. The relatively complicated original token movement rules in control nodes and edges are combined into paths from an action to action. A new approach is the us…
On the class of languages recognizable by 1-way quantum finite automata
2000
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Multi-Dimensional motivic pattern extraction founded on adaptive redundancy filtering
2005
Abstract We present a computational model for discovering repeated patterns in symbolic representations of monodic music. Patterns are discovered through an incremental adaptive identification along a multi-dimensional parametric space. The difficulties of pattern discovery mainly come from combinatorial redundancies, that our model is able to control efficiently. A specificity relation is defined between pattern descriptions, unifying suffix and inclusion relations and enabling a filtering of redundant descriptions. Combinatorial proliferation caused by successive repetitions of patterns is managed using cyclic patterns. The modelling of these redundancy control mechanisms enables an autom…
Accessibility of the Italian institutional web pages: a survey on the compliance of the Italian public administration web pages to the Stanca Act and…
2014
Accessibility of the Italian public administration web pages is ruled by the Stanca Act and in particular the Decree of the Minister issued on July 8, 2005. In this paper, an objective test is performed on the official web pages of the Italian province and region chief towns to check their compliance to the 22 technical requirements defined by the Stanca Act. A sample of 976 web pages belonging to the websites of the Italian chief towns have been downloaded in the period October---December 2012. Such a data collection has been submitted to Achecker, the worldwide recognized syntax and accessibility validation service. Several accessibility and syntax errors have been found following the aut…