Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765435
E. K. Bankas, K. Gbolagade
In this paper, we propose a new moduli set {22n+1 - 1, 22n;22n - l} with its associated reverse converter. The proposed reverse converter is based on Mixed Radix Conversion (MRC). In addition to parallelizing and optimizing the MRC algorithm, the resulting architecture is further simplified in order to obtain a reverse converter that utilizes only 2 levels of Carry Save Adders and three Carry Propagate Adders. The proposed converter is purely adder based and memoryless. Our proposal has a delay of (10n + 4)tfa + 2tmUx with an area cost of (12n + 2)FAs and (2n)H As, which when expressed in terms of HA is (22n + 4), where FA, HA, and tfa represent Full Adder, Half Adder, and delay of a Full Adder, respectively. The proposed scheme is compared with state of the art similar dynamic range converters. Theoretically speaking, our proposal achieves about 62.3% hardware reduction and about 2.13% speed improvement when compared with the reverse converter for {2n + 1,2n 1, 22n+1 - 3, 22n - 2}. Also, in comparison with the converter for {2n - 1, 2n - 1, 22n+1 - l}, the results indicate that, our proposal is about 17.05% faster, but requires about 7.83% more hardware resources. Further, the area time square (ΔT2) metric indicates that our proposed converter is 62.3% and 24.77% better than the state of the art reverse converters for {2n + 1,2n - 1, 22n+1 - 3, 22n - 2} and {2n - 1, 2n + 1, 22n, 22n+1 - l} respectively.
{"title":"A residue to binary converter for a balanced moduli set {22n+1 − 1, 22n, 22n − 1}","authors":"E. K. Bankas, K. Gbolagade","doi":"10.1109/ICAWST.2013.6765435","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765435","url":null,"abstract":"In this paper, we propose a new moduli set {2<sup>2n+1</sup> - 1, 2<sup>2n</sup>;2<sup>2n - l</sup>} with its associated reverse converter. The proposed reverse converter is based on Mixed Radix Conversion (MRC). In addition to parallelizing and optimizing the MRC algorithm, the resulting architecture is further simplified in order to obtain a reverse converter that utilizes only 2 levels of Carry Save Adders and three Carry Propagate Adders. The proposed converter is purely adder based and memoryless. Our proposal has a delay of (10n + 4)t<sub>fa</sub> + 2t<sub>mUx</sub> with an area cost of (12n + 2)FAs and (2n)H As, which when expressed in terms of HA is (22n + 4), where FA, HA, and t<sub>fa</sub> represent Full Adder, Half Adder, and delay of a Full Adder, respectively. The proposed scheme is compared with state of the art similar dynamic range converters. Theoretically speaking, our proposal achieves about 62.3% hardware reduction and about 2.13% speed improvement when compared with the reverse converter for {2<sup>n</sup> + 1,2<sup>n</sup> 1, 2<sup>2n+1</sup> - 3, 2<sup>2n</sup> - 2}. Also, in comparison with the converter for {2<sup>n</sup> - 1, 2<sup>n</sup> - 1, 2<sup>2n+1</sup> - l}, the results indicate that, our proposal is about 17.05% faster, but requires about 7.83% more hardware resources. Further, the area time square (Δ<sub>T</sub><sup>2</sup>) metric indicates that our proposed converter is 62.3% and 24.77% better than the state of the art reverse converters for {2<sup>n</sup> + 1,2<sup>n</sup> - 1, 2<sup>2n+1</sup> - 3, 2<sup>2n</sup> - 2} and {2<sup>n</sup> - 1, 2<sup>n</sup> + 1, 2<sup>2n</sup>, 2<sup>2n+1</sup> - l} respectively.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73395286","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765509
S. Yamaguchi, T. Miyazaki, J. Kitamichi, Song Guo, T. Tsukahara, Takafumi Hayashi
A sensor node often uses a low-performance microcontroller unit (MCU) to reduce its power consumption. However, it is difficult to handle heavy tasks with the MCU. To solve this problem, we developed a new sensor node that uses an ultra-low power field-programmable gate array (FPGA) in addition to an MCU. By assigning heavy tasks, such as sensor and data processing, to the FPGA, we can avoid overloading the MCU. Both the configuration data for the FPGA and the programs running on the MCU can be injected from outside the sensor node using wireless communication. Thus, the functionality of the sensor node can be easily changed depending on the situation and/or the applications. In this paper, we describe the sensor node architecture and its prototype, and then we show the experimental results.
{"title":"Programmable wireless sensor node featuring low-power FPGA and microcontroller","authors":"S. Yamaguchi, T. Miyazaki, J. Kitamichi, Song Guo, T. Tsukahara, Takafumi Hayashi","doi":"10.1109/ICAWST.2013.6765509","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765509","url":null,"abstract":"A sensor node often uses a low-performance microcontroller unit (MCU) to reduce its power consumption. However, it is difficult to handle heavy tasks with the MCU. To solve this problem, we developed a new sensor node that uses an ultra-low power field-programmable gate array (FPGA) in addition to an MCU. By assigning heavy tasks, such as sensor and data processing, to the FPGA, we can avoid overloading the MCU. Both the configuration data for the FPGA and the programs running on the MCU can be injected from outside the sensor node using wireless communication. Thus, the functionality of the sensor node can be easily changed depending on the situation and/or the applications. In this paper, we describe the sensor node architecture and its prototype, and then we show the experimental results.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77422440","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765507
Yahui Li, M. Asghar, P. Pulli
In this study we proposed a design for a smart kitchen environment, which facilitated the senior citizens suffering from dementia and their caregivers. The idea of smart kitchen environment was that it was context aware and had the learning ability to adapt itself to fit senior citizens with dementia's habits and living conditions. This study developed a way to design steps and collect data elements of the coffee-making process for a cooking workflow system. Caregivers were able to instruct senior citizens suffering from dementia remotely using this cooking workflow system. A multiple cameras based visual surveillance system was designed to facilitate the observation of cooking objects and senior citizens with dementia's cooking conditions in the kitchen, audio and graphical assistance were used to deliver instructions to the senior citizens with dementia. The smart kitchen environment is concretized into a smart kitchen prototype, this prototype affirmed the feasibility of the smart kitchen environment, and also revealed the areas for further improvement.
{"title":"Visually-aided smart kitchen environment for senior citizens suffering from dementia","authors":"Yahui Li, M. Asghar, P. Pulli","doi":"10.1109/ICAWST.2013.6765507","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765507","url":null,"abstract":"In this study we proposed a design for a smart kitchen environment, which facilitated the senior citizens suffering from dementia and their caregivers. The idea of smart kitchen environment was that it was context aware and had the learning ability to adapt itself to fit senior citizens with dementia's habits and living conditions. This study developed a way to design steps and collect data elements of the coffee-making process for a cooking workflow system. Caregivers were able to instruct senior citizens suffering from dementia remotely using this cooking workflow system. A multiple cameras based visual surveillance system was designed to facilitate the observation of cooking objects and senior citizens with dementia's cooking conditions in the kitchen, audio and graphical assistance were used to deliver instructions to the senior citizens with dementia. The smart kitchen environment is concretized into a smart kitchen prototype, this prototype affirmed the feasibility of the smart kitchen environment, and also revealed the areas for further improvement.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77862775","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765456
Y. Hayashi, M. C. Spencer, S. Nasuto
Rhythms are manifested ubiquitously in dynamical biological processes. These fundamental processes which are necessary for the survival of living organisms include metabolism, breathing, heart beat, and, above all, the circadian rhythm coupled to the diurnal cycle. Thus, in mathematical biology, biological processes are often represented as linear or nonlinear oscillators. In the framework of nonlinear and dissipative systems (ie. the flow of energy, substances, or sensory information), they generate stable internal oscillations as a response to environmental input and, in turn, utilise such output as a means of coupling with the environment.
{"title":"A study of anticipatory non-autonomous systems","authors":"Y. Hayashi, M. C. Spencer, S. Nasuto","doi":"10.1109/ICAWST.2013.6765456","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765456","url":null,"abstract":"Rhythms are manifested ubiquitously in dynamical biological processes. These fundamental processes which are necessary for the survival of living organisms include metabolism, breathing, heart beat, and, above all, the circadian rhythm coupled to the diurnal cycle. Thus, in mathematical biology, biological processes are often represented as linear or nonlinear oscillators. In the framework of nonlinear and dissipative systems (ie. the flow of energy, substances, or sensory information), they generate stable internal oscillations as a response to environmental input and, in turn, utilise such output as a means of coupling with the environment.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73392347","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765501
Y. Watanobe, N. Mirenkov
*AIDA (Star-AIDA) is a programming (modeling) language for programming in pictures. The pictures play a role of algorithmic super-characters and their compositions can be considered as compound pictures and as "super-texts." A very-high level of the super-characters allows not only to essentially decrease the algorithm representation sizes, but also to increase understandability of algorithms. In addition to the level of the super-characters, important contributions to the compactness and understandability of *AIDA programs are related to forms of the picture compositions and displaying (visualizing) such compositions. These forms are based on folding/unfolding techniques, clarifying annotations, patterns for representing formulas, etc. In this paper, *AIDA declarations are considered and a special approach for manipulating with large-scale formulas and large number of variables is presented.
{"title":"∗AIDA declarations supporting program compactness","authors":"Y. Watanobe, N. Mirenkov","doi":"10.1109/ICAWST.2013.6765501","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765501","url":null,"abstract":"*AIDA (Star-AIDA) is a programming (modeling) language for programming in pictures. The pictures play a role of algorithmic super-characters and their compositions can be considered as compound pictures and as \"super-texts.\" A very-high level of the super-characters allows not only to essentially decrease the algorithm representation sizes, but also to increase understandability of algorithms. In addition to the level of the super-characters, important contributions to the compactness and understandability of *AIDA programs are related to forms of the picture compositions and displaying (visualizing) such compositions. These forms are based on folding/unfolding techniques, clarifying annotations, patterns for representing formulas, etc. In this paper, *AIDA declarations are considered and a special approach for manipulating with large-scale formulas and large number of variables is presented.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86206847","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765415
Shingo Watanabe, Jungpil Shin
This paper describes approaches to recognize character strings which are drawn with a laser pointer. The recognition algorithm used is based on Dynamic Programming (DP) matching. XY coordinate, directional vector Dynamic Positional Warping (DPW) is used as data. New Inter Stroke Information was also developed and used. The information can represents shape of character. Test data are obtained by following steps: 1) taking a movie which record drawing a character string with a laser pointer on screen; 2) binarization; 3) closing operation; 4) noise rejection; and 5) thinning process. Training data are recorded with a pen - tablet. This research focuses on the laser pointer process and enables to communicate with computer in a place whose color's brightness is low and improve technology using a camera.
{"title":"Recognition of character drawn on screen with laser pointer","authors":"Shingo Watanabe, Jungpil Shin","doi":"10.1109/ICAWST.2013.6765415","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765415","url":null,"abstract":"This paper describes approaches to recognize character strings which are drawn with a laser pointer. The recognition algorithm used is based on Dynamic Programming (DP) matching. XY coordinate, directional vector Dynamic Positional Warping (DPW) is used as data. New Inter Stroke Information was also developed and used. The information can represents shape of character. Test data are obtained by following steps: 1) taking a movie which record drawing a character string with a laser pointer on screen; 2) binarization; 3) closing operation; 4) noise rejection; and 5) thinning process. Training data are recorded with a pen - tablet. This research focuses on the laser pointer process and enables to communicate with computer in a place whose color's brightness is low and improve technology using a camera.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86346645","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765481
Li-Hong Juang, Ming-Ni Wu
A speech transmission method is presented to transmit an audible sound wave by an ultrasonic carrier frequency modulation with a characteristic of directional propagation. The modulated sound wave is propagated with the ultrasonic carrier to the appointed position, and then the original speech will be produced after getting rid of the ultrasonic carrier, thereby achieving the objective of speech transmission in a selected orientation due to ultrasonic high directionality meanwhile it can hide the communication voice data during its transmission.
{"title":"Hiding-type speech communication using ultrasonic carrier technology","authors":"Li-Hong Juang, Ming-Ni Wu","doi":"10.1109/ICAWST.2013.6765481","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765481","url":null,"abstract":"A speech transmission method is presented to transmit an audible sound wave by an ultrasonic carrier frequency modulation with a characteristic of directional propagation. The modulated sound wave is propagated with the ultrasonic carrier to the appointed position, and then the original speech will be produced after getting rid of the ultrasonic carrier, thereby achieving the objective of speech transmission in a selected orientation due to ultrasonic high directionality meanwhile it can hide the communication voice data during its transmission.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84528553","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765489
Wenlong Liu, Nana Sun, Minglu Jin, Shuxue Ding
Maximum-likelihood (ML) detection for binary Multiple-Input-Multiple-Output (MIMO) systems can be posed as a binary quadratic programming (BQP) which belongs to a nondeterministic polynomial-time hard (NP-hard) problem in general. In this paper, we translate the binary constraints of BQP into the equivalent quadratic equality constraints and employ the Lagrange multipliers method to deal these equivalent constraints. We derive the relation among the Lagrange multiplier, transmitting signal and noise. Since both transmitting signal and noise are unknown, it is impossible to solve the Lagrange multipliers exactly. However, in this paper, an estimation method is proposed to obtain the approximations of the Lagrange multipliers with low computational complexity. Numerical experiments show that the performance of the proposed method is very near to that of the ML detection.
{"title":"A low complexity detection for the binary MIMO system using Lagrange multipliers","authors":"Wenlong Liu, Nana Sun, Minglu Jin, Shuxue Ding","doi":"10.1109/ICAWST.2013.6765489","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765489","url":null,"abstract":"Maximum-likelihood (ML) detection for binary Multiple-Input-Multiple-Output (MIMO) systems can be posed as a binary quadratic programming (BQP) which belongs to a nondeterministic polynomial-time hard (NP-hard) problem in general. In this paper, we translate the binary constraints of BQP into the equivalent quadratic equality constraints and employ the Lagrange multipliers method to deal these equivalent constraints. We derive the relation among the Lagrange multiplier, transmitting signal and noise. Since both transmitting signal and noise are unknown, it is impossible to solve the Lagrange multipliers exactly. However, in this paper, an estimation method is proposed to obtain the approximations of the Lagrange multipliers with low computational complexity. Numerical experiments show that the performance of the proposed method is very near to that of the ML detection.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84785929","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765510
Kazuma Abe, Ruth Cortez, A. Vazhenin
In this research, we propose a strategy to support automatic task generation and verification for subjects that require handling mathematical formulas. The importance of supporting automatic problem generation is to reduce the teacher's efforts and to personalize e-learning tasks for students enforcing their understanding of a subject. Also, the automatic verification strategy provides immediate feedback. Our approach is based on a standardization of learning tasks by providing a formal definition of the structure of a learning activity. As e-Learning platforms are evolving towards service-orientation, we prototype our strategy by developing an e-Learning component that can be used as a stand-alone application, or its logic can be exposed as a set of services for external applications.
{"title":"Task management strategies for automatic task generation and verification","authors":"Kazuma Abe, Ruth Cortez, A. Vazhenin","doi":"10.1109/ICAWST.2013.6765510","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765510","url":null,"abstract":"In this research, we propose a strategy to support automatic task generation and verification for subjects that require handling mathematical formulas. The importance of supporting automatic problem generation is to reduce the teacher's efforts and to personalize e-learning tasks for students enforcing their understanding of a subject. Also, the automatic verification strategy provides immediate feedback. Our approach is based on a standardization of learning tasks by providing a formal definition of the structure of a learning activity. As e-Learning platforms are evolving towards service-orientation, we prototype our strategy by developing an e-Learning component that can be used as a stand-alone application, or its logic can be exposed as a set of services for external applications.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86540699","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}
Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765470
K. Nakayama, Y. Watanobe
This paper presents implementation of data visualization functions and the corresponding interfaces for *AIDA *AIDA is a programming/modeling language representing algorithms by pictures and moving pictures. *AIDA and its modeling environment visualize methods (algorithms) as well as output results. Libraries of the functions enable *AIDA users to visualize their computational result based on various methods of visualization. One of important features of the interfaces is that the functions analyze the corresponding data (variables) and automatically select appropriate visualization methods. The prototypes of the libraries and interfaces have been developed based on JavaScript and HTML5. The libraries include not only basic methods such as bars, pies, lines, but also particular methods including chords, meshes, and other space structures such as graphs. The proposed visualization interfaces have been integrated into the *AIDA programing environment. The libraries give *AIDA users cognitive enhancement and increase understandability of the corresponding models, simulations, and algorithms.
{"title":"Data visualization in ∗AIDA programming language","authors":"K. Nakayama, Y. Watanobe","doi":"10.1109/ICAWST.2013.6765470","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765470","url":null,"abstract":"This paper presents implementation of data visualization functions and the corresponding interfaces for *AIDA *AIDA is a programming/modeling language representing algorithms by pictures and moving pictures. *AIDA and its modeling environment visualize methods (algorithms) as well as output results. Libraries of the functions enable *AIDA users to visualize their computational result based on various methods of visualization. One of important features of the interfaces is that the functions analyze the corresponding data (variables) and automatically select appropriate visualization methods. The prototypes of the libraries and interfaces have been developed based on JavaScript and HTML5. The libraries include not only basic methods such as bars, pies, lines, but also particular methods including chords, meshes, and other space structures such as graphs. The proposed visualization interfaces have been integrated into the *AIDA programing environment. The libraries give *AIDA users cognitive enhancement and increase understandability of the corresponding models, simulations, and algorithms.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86984190","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
扫码关注我们
求助内容：
应助结果提醒方式：