An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however the rules tend to be dependent on each other and instead of just adding rules, existing rules need to be changed. The unique rules in Cartoonist, a rule-based visual programming environment to build simulations, provides a solution to this problem. Cartoonist's rules can be used in a more modular way supporting an iterative mode of programming. Libraries of visual descriptions can be built and reused to compose complex behavior from these descriptions. This makes exploring the space of possible descriptions of simulations easier, which is valuable for intended educational use of Cartoonist. Another advantage of Cartoonist is that its programs tend to have fewer and simpler rules than programs written for comparable systems.
{"title":"Composing complex behavior from simple visual descriptions","authors":"R. Hubscher","doi":"10.1109/VL.1996.545273","DOIUrl":"https://doi.org/10.1109/VL.1996.545273","url":null,"abstract":"An often-mentioned advantage of rule-based programming languages is that a program can be extended simply by adding a few more rules. In practice however the rules tend to be dependent on each other and instead of just adding rules, existing rules need to be changed. The unique rules in Cartoonist, a rule-based visual programming environment to build simulations, provides a solution to this problem. Cartoonist's rules can be used in a more modular way supporting an iterative mode of programming. Libraries of visual descriptions can be built and reused to compose complex behavior from these descriptions. This makes exploring the space of possible descriptions of simulations easier, which is valuable for intended educational use of Cartoonist. Another advantage of Cartoonist is that its programs tend to have fewer and simpler rules than programs written for comparable systems.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115226592","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}
ToonTalk/sup TM/ is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a video game. Every abstract computational aspect is mapped into a concrete metaphor. For example, a computation is a city, a concurrent object is a house, inter-process communication is represented by birds carrying messages between houses, a method or clause is a robot trained by the user, and so on. The programmer controls a "programmer persona" in this video world to construct run, observe, debug, and modify programs. ToonTalk has been described in detail elsewhere. Here we show how systolic programs can be constructed and animated in ToonTalk. Systolic computations run on multiple processors connected in a regular topology, where all communication is via local message passing. A ToonTalk city can be seen as a systolic multi-processor and each house in the city as an active processor. One is able to construct systolic algorithms and watch their execution as houses are built and destroyed (i.e., processes are spawned and terminate) and birds carry messages between houses.
{"title":"Seeing systolic computations in a video game world","authors":"K. Kahn","doi":"10.1109/VL.1996.545274","DOIUrl":"https://doi.org/10.1109/VL.1996.545274","url":null,"abstract":"ToonTalk/sup TM/ is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a video game. Every abstract computational aspect is mapped into a concrete metaphor. For example, a computation is a city, a concurrent object is a house, inter-process communication is represented by birds carrying messages between houses, a method or clause is a robot trained by the user, and so on. The programmer controls a \"programmer persona\" in this video world to construct run, observe, debug, and modify programs. ToonTalk has been described in detail elsewhere. Here we show how systolic programs can be constructed and animated in ToonTalk. Systolic computations run on multiple processors connected in a regular topology, where all communication is via local message passing. A ToonTalk city can be seen as a systolic multi-processor and each house in the city as an active processor. One is able to construct systolic algorithms and watch their execution as houses are built and destroyed (i.e., processes are spawned and terminate) and birds carry messages between houses.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115091957","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}
Paolo Bottoni, M. Costabile, S. Levialdi, P. Mussio
In order to manage visual interaction problems, we deepen a formalisation of visual languages, based on the notion of visual sentence, introduced in a previous paper (Bottoni et al., 1995). Visual conditional attributed rewriting systems (vCARWs) are proposed for the specification of visual languages. We argue that vCARWs can be viewed as a generalisation of conditional set rewrite systems, which in turn were shown to be as expressive as textual context-free grammars, picture layout grammars, and constraint multiset grammars. Last, we outline a procedure to translate visual gestures into visual sentences according to vCARW rules.
为了管理视觉交互问题，我们在之前的一篇论文(Bottoni et al.， 1995)中介绍的视觉句子概念的基础上，深化了视觉语言的形式化。为了规范视觉语言，提出了视觉条件属性重写系统(vCARWs)。我们认为，vcarw可以被视为条件集重写系统的泛化，而条件集重写系统又被证明与文本上下文无关的语法、图片布局语法和约束多集语法一样具有表达能力。最后，我们概述了一个根据vCARW规则将视觉手势翻译成视觉句子的过程。
{"title":"Visual conditional attributed rewriting systems in visual language specification","authors":"Paolo Bottoni, M. Costabile, S. Levialdi, P. Mussio","doi":"10.1109/VL.1996.545282","DOIUrl":"https://doi.org/10.1109/VL.1996.545282","url":null,"abstract":"In order to manage visual interaction problems, we deepen a formalisation of visual languages, based on the notion of visual sentence, introduced in a previous paper (Bottoni et al., 1995). Visual conditional attributed rewriting systems (vCARWs) are proposed for the specification of visual languages. We argue that vCARWs can be viewed as a generalisation of conditional set rewrite systems, which in turn were shown to be as expressive as textual context-free grammars, picture layout grammars, and constraint multiset grammars. Last, we outline a procedure to translate visual gestures into visual sentences according to vCARW rules.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122595426","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 analysis of large amounts of data to extract generalizations, exceptions, trends, and hidden relationships is a common activity in the business and scientific communities. While some kinds of "knowledge" can be extracted automatically with preselected algorithms or data mining techniques, others require an experienced human, often an expert in analysis, the business or scientific context, or both. We have found that such humans combine exploration, the search for a relevant subset or view of the data, with analysis, statistical or other techniques for measurement. We designed and implemented a visual language, IDEA, to assist the data analyst in these two intertwined tasks. The language is a convenient representation for data analysis and provides environmental support for keeping track of sequences of operations, reuse of the data analysis itself, and enforced semantics between operations and data.
{"title":"A visual language for interactive data exploration and analysis","authors":"P. Selfridge, D. Srivastava","doi":"10.1109/VL.1996.545272","DOIUrl":"https://doi.org/10.1109/VL.1996.545272","url":null,"abstract":"The analysis of large amounts of data to extract generalizations, exceptions, trends, and hidden relationships is a common activity in the business and scientific communities. While some kinds of \"knowledge\" can be extracted automatically with preselected algorithms or data mining techniques, others require an experienced human, often an expert in analysis, the business or scientific context, or both. We have found that such humans combine exploration, the search for a relevant subset or view of the data, with analysis, statistical or other techniques for measurement. We designed and implemented a visual language, IDEA, to assist the data analyst in these two intertwined tasks. The language is a convenient representation for data analysis and provides environmental support for keeping track of sequences of operations, reuse of the data analysis itself, and enforced semantics between operations and data.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"53 55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129825989","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}
Understanding and interpreting large data sets is an important but challenging operation in many technical disciplines. Computer visualization has become a valuable tool to help portray characteristics of large data sets. In software visualization, illustrating the operation of very large programs or programs working on very large data sets has remained one of the key open problems. We introduce an approach that uses semantic zooming to depict large program executions. Our method utilizes abstract, clustered graphics to portray program operations on the entire data set. Then, by interacting with the presentation, a viewer can zoom in to examine details and individual values. At this "magnified" level, the presentation adjusts to reflect displays common in existing algorithm animation and program visualization systems.
{"title":"Visualizing program executions on large data sets","authors":"J. Stasko, Jeyakumar Muthukumarasamy","doi":"10.1109/VL.1996.545283","DOIUrl":"https://doi.org/10.1109/VL.1996.545283","url":null,"abstract":"Understanding and interpreting large data sets is an important but challenging operation in many technical disciplines. Computer visualization has become a valuable tool to help portray characteristics of large data sets. In software visualization, illustrating the operation of very large programs or programs working on very large data sets has remained one of the key open problems. We introduce an approach that uses semantic zooming to depict large program executions. Our method utilizes abstract, clustered graphics to portray program operations on the entire data set. Then, by interacting with the presentation, a viewer can zoom in to examine details and individual values. At this \"magnified\" level, the presentation adjusts to reflect displays common in existing algorithm animation and program visualization systems.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371380","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 paper describes three new visual languages far use in the coordination of collaborative work in large CSCW environments. EVPL describes work plans and is used to define the context of work. VQL is a query language, and VEPL is an event processing language.
{"title":"Visual language support for planning and coordination in cooperative work systems","authors":"J. Grundy, J. Hosking","doi":"10.1109/VL.1996.545305","DOIUrl":"https://doi.org/10.1109/VL.1996.545305","url":null,"abstract":"The paper describes three new visual languages far use in the coordination of collaborative work in large CSCW environments. EVPL describes work plans and is used to define the context of work. VQL is a query language, and VEPL is an event processing language.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131996128","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 authors evaluate a new general-purpose visual programming system, PrologSpace. The system addresses classic issues of visual interfaces: layout, shape, colour, and iconography; and those of particular concern to visual programming: multiple views (visual abstractions), synchronised views, integration of visual and textual dimensions, visual debugging, cognitive dimensions, and the problems of scale. They describe the system and examine its cognitive dimensions. They argue that: (1) PrologSpace enhances Prolog programming, and (2) PrologSpace has better 'viscosity', 'visibility', and 'secondary notation' than two other notable general visual programming systems and without any significant loss of dimensionality in other respects.
{"title":"Reducing the cognitive requirements of visual programming","authors":"M. Yazdani, L. Ford","doi":"10.1109/VL.1996.545295","DOIUrl":"https://doi.org/10.1109/VL.1996.545295","url":null,"abstract":"The authors evaluate a new general-purpose visual programming system, PrologSpace. The system addresses classic issues of visual interfaces: layout, shape, colour, and iconography; and those of particular concern to visual programming: multiple views (visual abstractions), synchronised views, integration of visual and textual dimensions, visual debugging, cognitive dimensions, and the problems of scale. They describe the system and examine its cognitive dimensions. They argue that: (1) PrologSpace enhances Prolog programming, and (2) PrologSpace has better 'viscosity', 'visibility', and 'secondary notation' than two other notable general visual programming systems and without any significant loss of dimensionality in other respects.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163787","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}
Unlike current GUI or WIMP style interfaces, non-WIMP user interfaces, such as virtual environments, involve parallel, continuous interactions with the user. However, most current visual (and non-visual) languages for describing human-computer interaction are based on serial, discrete, token-based models. The paper introduces a visual language for describing and programming the fine-grained aspects of non-WIMP interaction. It is based on the notion that the essence of a non-WIMP dialogue is a set of continuous relationships, most of which are temporary. The underlying model combines a data-flow or constraint-like component for the continuous relationships with an event-based component for discrete interactions, which can enable or disable individual continuous relationships. The language thus separates non-WIMP interaction into two components, each based on existing visual language approaches, and then provides a framework for connecting the two.
{"title":"A visual language for non-WIMP user interfaces","authors":"R. Jacob","doi":"10.1109/VL.1996.545292","DOIUrl":"https://doi.org/10.1109/VL.1996.545292","url":null,"abstract":"Unlike current GUI or WIMP style interfaces, non-WIMP user interfaces, such as virtual environments, involve parallel, continuous interactions with the user. However, most current visual (and non-visual) languages for describing human-computer interaction are based on serial, discrete, token-based models. The paper introduces a visual language for describing and programming the fine-grained aspects of non-WIMP interaction. It is based on the notion that the essence of a non-WIMP dialogue is a set of continuous relationships, most of which are temporary. The underlying model combines a data-flow or constraint-like component for the continuous relationships with an event-based component for discrete interactions, which can enable or disable individual continuous relationships. The language thus separates non-WIMP interaction into two components, each based on existing visual language approaches, and then provides a framework for connecting the two.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130890037","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}
We present dynamic visual languages for Tele-Action Objects, which are complex multimedia objects with associated hypergraph and knowledge structures, capable of automatically reacting to events and supporting effective presentation and efficient communication of multimedia information. To design TAOs, we need generalized icons and spatial/temporal operators. The definition of relational visual languages is extended to multidimensional languages, with special emphasis on dynamic multidimensional languages. Application examples are illustrated.
{"title":"Dynamic visual languages","authors":"Shi-Kuo Chang","doi":"10.1109/VL.1996.545303","DOIUrl":"https://doi.org/10.1109/VL.1996.545303","url":null,"abstract":"We present dynamic visual languages for Tele-Action Objects, which are complex multimedia objects with associated hypergraph and knowledge structures, capable of automatically reacting to events and supporting effective presentation and efficient communication of multimedia information. To design TAOs, we need generalized icons and spatial/temporal operators. The definition of relational visual languages is extended to multidimensional languages, with special emphasis on dynamic multidimensional languages. Application examples are illustrated.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"1035 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116268138","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}
Peer Griebel, G. Lehrenfeld, Wolfgang Müller, C. Tahedl, Holger Uhr
Investigates the integration of an interactive constraint solver into an existing 2D real-time animation environment in order to achieve a better observability, traceability and stability of the individual graphical objects. We present two approaches for assigning constraints to the objects. The first approach assigns constraints to the objects when they are created, keeping them stable during their entire life-time. The second approach dynamically changes constraints before the computation of each frame. The investigation is based on our practical experience with the complete visual programming language Pictorial Janus and the parallel constraint solver Parcon.
{"title":"Integrating a constraint solver into a real-time animation environment","authors":"Peer Griebel, G. Lehrenfeld, Wolfgang Müller, C. Tahedl, Holger Uhr","doi":"10.1109/VL.1996.545262","DOIUrl":"https://doi.org/10.1109/VL.1996.545262","url":null,"abstract":"Investigates the integration of an interactive constraint solver into an existing 2D real-time animation environment in order to achieve a better observability, traceability and stability of the individual graphical objects. We present two approaches for assigning constraints to the objects. The first approach assigns constraints to the objects when they are created, keeping them stable during their entire life-time. The second approach dynamically changes constraints before the computation of each frame. The investigation is based on our practical experience with the complete visual programming language Pictorial Janus and the parallel constraint solver Parcon.","PeriodicalId":340993,"journal":{"name":"Proceedings 1996 IEEE Symposium on Visual Languages","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125631527","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
扫码关注我们
求助内容：
应助结果提醒方式：