High Abstraction Level Frameworks for the Next Decade in Computational Mechanics

Author(s):  
D. Eyheramendy
2005 ◽  
Vol 45 (2) ◽  
pp. 313-321 ◽  
Author(s):  
M. Streibl ◽  
F. Zängl ◽  
K. Esmark ◽  
R. Schwencker ◽  
W. Stadler ◽  
...  

Author(s):  
Dimitris Kehagias

Computer architecture is an essential topic in undergraduate Computer Science (CS) curricula. Teaching computer architecture courses to CS students can be challenging, as the concepts are on a high abstraction level and not easy to grasp for students. Learning of computer architecture abstracts is strongly reinforced by hands-on assignment experience. This paper presents results from a survey of assignments from 40 undergraduate computer architecture courses, which are offered in 40 CS departments. These surveyed courses are selected from universities listed among the 120 top North America universities by the Webometrics Ranking of World Universities 2015. The information used for this survey is based solely on material publicly accessible on the websites of courses.


2002 ◽  
Vol 2 (6) ◽  
pp. 769-805 ◽  
Author(s):  
YVES CASEAU ◽  
FRANÇOIS-XAVIER JOSSET ◽  
FRANÇOIS LABURTHE

This paper presents a programming language which includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (functional) language. Although these paradigms are separately well known and are available under various programming environments, the originality of the CLAIRE language comes from the tight integration, which yields interesting run-time performances, and from the richness of this combination, which yields new ways in which to express complex algorithmic patterns with few elegant lines. To achieve the opposite goals of a high abstraction level (conciseness and readability) and run-time performance (CLAIRE is used as a C++ preprocessor), we have developed two kinds of compiler: first, a pattern pre-processor handles iterations over both concrete and abstract sets (data types and program fragments), in a completely user-extensible manner; secondly, an inference compiler transforms a set of logical rules into a set of functions (demons that are used through procedural attachment).


Author(s):  
MYRIAM NOUREDDINE

This paper deals with the generation of a conceptual model of the physical structure of any manufacturing system. The obtained conceptual model shows a clear and linear view of a given manufacturing system. A generic notation is used to guarantee the scalability and the portability of the model. This model maintains a high abstraction level without ambiguity and in a simple format. The generation of a conceptual model for a given manufacturing system is obtained through two steps. The first step describes both the physical structure and the logical structure of the manufacturing system. The second step gives the generation principle of the conceptual model. The approach is illustrated using an example.


Sign in / Sign up

Export Citation Format

Share Document