This work proposes a visual grammar-based approach to support web designers during the analysis and design phases of complex hypermedia structures. The hypermedia is defined through a formal visual language at two abstraction levels: the hypermedia graph outer and inner structures. The model makes it possible to verify the correctness of hypermedia structures and to perform structural analysis for the description and the evaluation of their complexity. A visual environment for hypermedia structures is also presented.
{"title":"Visual hypermedia authoring","authors":"G. Costagliola, A. Dattolo, R. Francese","doi":"10.1109/HCC.2001.995297","DOIUrl":"https://doi.org/10.1109/HCC.2001.995297","url":null,"abstract":"This work proposes a visual grammar-based approach to support web designers during the analysis and design phases of complex hypermedia structures. The hypermedia is defined through a formal visual language at two abstraction levels: the hypermedia graph outer and inner structures. The model makes it possible to verify the correctness of hypermedia structures and to perform structural analysis for the description and the evaluation of their complexity. A visual environment for hypermedia structures is also presented.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133161758","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}
This paper describes our research into the expansion of the spreadsheet paradigm by the incorporation of solvers for systems of linear and finite-domain constraints. An extended spreadsheet system, called Intellisheet, allows the entry of expressions that represent linear and finite-domain constraints, along with arithmetic expressions, in individual cells. The systems of constraints that have been entered are automatically solved by constraint solvers and the resulting solutions are displayed in the cells that contain the expressions or in other assigned cells. Intellisheet's GUI also has some special features to facilitate constraint programming. Incorporating constraint solvers extends the scope of the spreadsheet paradigm to declarative programming and provides an easier way to solve a broad class of problems, including linear optimization and discrete problems.
{"title":"Intellisheet: a spreadsheet system expanded by including constraint","authors":"Y. Adachi","doi":"10.1109/HCC.2001.995256","DOIUrl":"https://doi.org/10.1109/HCC.2001.995256","url":null,"abstract":"This paper describes our research into the expansion of the spreadsheet paradigm by the incorporation of solvers for systems of linear and finite-domain constraints. An extended spreadsheet system, called Intellisheet, allows the entry of expressions that represent linear and finite-domain constraints, along with arithmetic expressions, in individual cells. The systems of constraints that have been entered are automatically solved by constraint solvers and the resulting solutions are displayed in the cells that contain the expressions or in other assigned cells. Intellisheet's GUI also has some special features to facilitate constraint programming. Incorporating constraint solvers extends the scope of the spreadsheet paradigm to declarative programming and provides an easier way to solve a broad class of problems, including linear optimization and discrete problems.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130389870","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}
Stereotypes provide a mechanism for extending the vocabulary of the UML. Present UML-based formalisms for geographic information system use the concept of visual stereotypes in order to represent geographic types. This paper extends the expressiveness of stereotypes currently defined for geographic types and describes an algorithm for the computation of visual stereotypes resulting from aggregation operations.
{"title":"An algorithm for stereotype deduction in UML-based formalism and its application in geographic information systems","authors":"F. Pinet, A. Lbath","doi":"10.1109/HCC.2001.995277","DOIUrl":"https://doi.org/10.1109/HCC.2001.995277","url":null,"abstract":"Stereotypes provide a mechanism for extending the vocabulary of the UML. Present UML-based formalisms for geographic information system use the concept of visual stereotypes in order to represent geographic types. This paper extends the expressiveness of stereotypes currently defined for geographic types and describes an algorithm for the computation of visual stereotypes resulting from aggregation operations.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131550250","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}
As a major evolutionary step in computer technology, users have come to rely on ready-made application software, rather than writing their own programs. If computer users no longer program, does it follow that the art of programming should only be taught to computing professionals? We argue the case for programming as a component of general education - not because of any direct utilitarian benefit, but in order to gain a personal experience as to what it means, and what it takes, to specify processes that evolve over time. An analogy to mathematics education shows that schools teach the concept of "proof", although in daily life people use mathematical formulas without knowledge of their proof. Programming practiced as an educational exercise, free from utilitarian constraints, is best learned in a toy environment, designed to illustrate selected concepts in the simplest possible setting. As an example, we present the programming system Kara based on the concept of finite state machines.
{"title":"Kara, finite state machines, and the case for programming as part of general education","authors":"Werner Hartmann, J. Nievergelt, Raimond Reichert","doi":"10.1109/HCC.2001.995251","DOIUrl":"https://doi.org/10.1109/HCC.2001.995251","url":null,"abstract":"As a major evolutionary step in computer technology, users have come to rely on ready-made application software, rather than writing their own programs. If computer users no longer program, does it follow that the art of programming should only be taught to computing professionals? We argue the case for programming as a component of general education - not because of any direct utilitarian benefit, but in order to gain a personal experience as to what it means, and what it takes, to specify processes that evolve over time. An analogy to mathematics education shows that schools teach the concept of \"proof\", although in daily life people use mathematical formulas without knowledge of their proof. Programming practiced as an educational exercise, free from utilitarian constraints, is best learned in a toy environment, designed to illustrate selected concepts in the simplest possible setting. As an example, we present the programming system Kara based on the concept of finite state machines.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370699","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}
This formal study proposes a transformational approach to the definition of general purpose visual languages based on hierarchical structures, addressing more specifically DTD visualization as its application area. We show that such visual languages can be constructed through progressive refinement of a syntax based on nested/juxtaposed rectangles. Several transformation stages, which can all be formally characterized, produce a high quality visual representation which expresses the fundamental properties of the original structure. Moreover, this approach opens some perspectives in proving visual properties through standard mathematical tools such as inductive proofs, thus establishing some practical links between visual language theory and classical language theory.
{"title":"A formal study of a visual language for the visualization of document type definition","authors":"Jean-Yves Vion-Dury, Emmanuel Pietriga","doi":"10.1109/HCC.2001.995236","DOIUrl":"https://doi.org/10.1109/HCC.2001.995236","url":null,"abstract":"This formal study proposes a transformational approach to the definition of general purpose visual languages based on hierarchical structures, addressing more specifically DTD visualization as its application area. We show that such visual languages can be constructed through progressive refinement of a syntax based on nested/juxtaposed rectangles. Several transformation stages, which can all be formally characterized, produce a high quality visual representation which expresses the fundamental properties of the original structure. Moreover, this approach opens some perspectives in proving visual properties through standard mathematical tools such as inductive proofs, thus establishing some practical links between visual language theory and classical language theory.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267095","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}
Summary form only given. For spatio-temporal applications which are very 2D- or 3D-oriented, visual languages look more attractive than alphanumeric languages. In this paper, an overview is given to the evolution and characteristics of visual languages for those applications, overall for accessing and manipulation information. Examples are taken especially from urban and environmental planning.
{"title":"Visual languages for spatio-temporal applications","authors":"R. Laurini","doi":"10.1109/HCC.2001.995270","DOIUrl":"https://doi.org/10.1109/HCC.2001.995270","url":null,"abstract":"Summary form only given. For spatio-temporal applications which are very 2D- or 3D-oriented, visual languages look more attractive than alphanumeric languages. In this paper, an overview is given to the evolution and characteristics of visual languages for those applications, overall for accessing and manipulation information. Examples are taken especially from urban and environmental planning.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730895","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}
Research in schema evolution has been driven by the need for more effective software development and maintenance. Finding impacts of schema changes on the applications and presenting them in an appropriate way are particularly challenging. We have developed a tool that finds impacts of schema changes on applications in object-oriented systems. This tool displays components (packages, classes, interfaces, methods and fields) of a database application system as a graph. Components potentially affected by a change are indicated by changing the shape of the boxes representing those components. Two versions of the tool are available. One version identifies affected parts of applications at the granularity of packages, classes, and interfaces, whereas the other version identifies affected parts at the finer granularity of fields and methods. This paper presents the design and results of a controlled student experiment testing these two granularity levels with respect to productivity and user satisfaction. There are indications that identifying impacts at the finer granularity can reduce the time needed to conduct schema changes and reduce the number of errors. Our results also show that the subjects of the experiment appreciated the idea of visualizing the impacts of schema changes.
{"title":"Visualizing impacts of database schema changes - A controlled experiment","authors":"Amela Karahasanovic, Dag I.K. Sjøberg","doi":"10.1109/HCC.2001.995292","DOIUrl":"https://doi.org/10.1109/HCC.2001.995292","url":null,"abstract":"Research in schema evolution has been driven by the need for more effective software development and maintenance. Finding impacts of schema changes on the applications and presenting them in an appropriate way are particularly challenging. We have developed a tool that finds impacts of schema changes on applications in object-oriented systems. This tool displays components (packages, classes, interfaces, methods and fields) of a database application system as a graph. Components potentially affected by a change are indicated by changing the shape of the boxes representing those components. Two versions of the tool are available. One version identifies affected parts of applications at the granularity of packages, classes, and interfaces, whereas the other version identifies affected parts at the finer granularity of fields and methods. This paper presents the design and results of a controlled student experiment testing these two granularity levels with respect to productivity and user satisfaction. There are indications that identifying impacts at the finer granularity can reduce the time needed to conduct schema changes and reduce the number of errors. Our results also show that the subjects of the experiment appreciated the idea of visualizing the impacts of schema changes.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669589","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}
This paper gives an overview of the Moses tool suite, a set of tools for visual language programming. In Moses, visual language syntax is defined by first-order predicates over the abstract syntax of a picture, represented by an attributed graph. One way of specifying language semantics in Moses is by writing an abstract state machine that interprets a given attributed graph. This paper shows how the editor is parameterized with a description of a visual language, and discusses briefly the generic architecture used to animate and debug visual programs.
{"title":"Moses-a tool suite for visual modeling of discrete-event systems","authors":"R. Esser, J. Janneck","doi":"10.1109/HCC.2001.995274","DOIUrl":"https://doi.org/10.1109/HCC.2001.995274","url":null,"abstract":"This paper gives an overview of the Moses tool suite, a set of tools for visual language programming. In Moses, visual language syntax is defined by first-order predicates over the abstract syntax of a picture, represented by an attributed graph. One way of specifying language semantics in Moses is by writing an abstract state machine that interprets a given attributed graph. This paper shows how the editor is parameterized with a description of a visual language, and discusses briefly the generic architecture used to animate and debug visual programs.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115022466","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}
Programming language design and implementation are still one of the challenges of computer science. Programmers use a variety of languages in their daily work, and new languages appear frequently. With formal methods for programming language description, a language designer has the chance to automatically generate a compiler or an interpreter. Unfortunately, compiler generators nowadays use linear textual specifications, which are less suitable then visual presentations. In this paper, a language development in a visual manner is described.
{"title":"Language development in a visual manner","authors":"Robet Krusec, M. Lenic, M. Mernik, V. Zumer","doi":"10.1109/HCC.2001.995299","DOIUrl":"https://doi.org/10.1109/HCC.2001.995299","url":null,"abstract":"Programming language design and implementation are still one of the challenges of computer science. Programmers use a variety of languages in their daily work, and new languages appear frequently. With formal methods for programming language description, a language designer has the chance to automatically generate a compiler or an interpreter. Unfortunately, compiler generators nowadays use linear textual specifications, which are less suitable then visual presentations. In this paper, a language development in a visual manner is described.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117231155","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}
The relation of aesthetics and computation has intrigued researchers, artists, and philosophers throughout the history of Western mind. In a long-range project, compArt, we take computer art as a case to explore and create sites for learning, art, and programming. We set up situations for students to gain insight into the algorithmic fabric of certain classes of graphic art. An indicator of the students' comprehension is the reformulation of hidden algorithms. An easy exercise is to use tools of a GUI to generate replicas. A greater challenge is a precise symbolic description of classes of graphics. We use the children's play of Chinese whispers as an interface metaphor for the description of data flow. The user is not required to know anything about data flow when he sets up a communication structure between agents and thus creates a total algorithmic behavior from local semantics. We bridge the gap between vague idea and precise formalism by semiotic embedding.
{"title":"Chinese whispers. Semiotically mediating between idea and program","authors":"Matthias Krauß, F. Nake, Susan Grabowski","doi":"10.1109/HCC.2001.995255","DOIUrl":"https://doi.org/10.1109/HCC.2001.995255","url":null,"abstract":"The relation of aesthetics and computation has intrigued researchers, artists, and philosophers throughout the history of Western mind. In a long-range project, compArt, we take computer art as a case to explore and create sites for learning, art, and programming. We set up situations for students to gain insight into the algorithmic fabric of certain classes of graphic art. An indicator of the students' comprehension is the reformulation of hidden algorithms. An easy exercise is to use tools of a GUI to generate replicas. A greater challenge is a precise symbolic description of classes of graphics. We use the children's play of Chinese whispers as an interface metaphor for the description of data flow. The user is not required to know anything about data flow when he sets up a communication structure between agents and thus creates a total algorithmic behavior from local semantics. We bridge the gap between vague idea and precise formalism by semiotic embedding.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752000","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：