Tran Thi Thuy, Nguyen Van Nam, Ngo Tung Son, Tran Van Dinh
The beamforming technique is increasingly used in multi-user relay networks for directional signal transmission. The main purpose of this paper is to design beamforming coefficients to minimize the total relay transmitted power under destination Quality-of-Service (QoS) constraints. There are some techniques have been proposed previously to solve the class of these problems such as: semidefinite relaxation approach (SDR) and convex second-order cone programing form (SOCP). We propose another method named Difference of Convex functions Algorithm (DCA) and evaluate the performance of this approach.
{"title":"DC Programming and DCA for Power Minimization Problem in Multi-User Beamforming Networks","authors":"Tran Thi Thuy, Nguyen Van Nam, Ngo Tung Son, Tran Van Dinh","doi":"10.1145/3316615.3316665","DOIUrl":"https://doi.org/10.1145/3316615.3316665","url":null,"abstract":"The beamforming technique is increasingly used in multi-user relay networks for directional signal transmission. The main purpose of this paper is to design beamforming coefficients to minimize the total relay transmitted power under destination Quality-of-Service (QoS) constraints. There are some techniques have been proposed previously to solve the class of these problems such as: semidefinite relaxation approach (SDR) and convex second-order cone programing form (SOCP). We propose another method named Difference of Convex functions Algorithm (DCA) and evaluate the performance of this approach.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123701600","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}
Farooq Haider, M. H. Chaudary, M. S. Naveed, M. Asif
Since the last decade, we have seen a swift formation of real-time applications on the web and numerous exploration regarding Quality of Service (QoS) [1] in mainly IPv4 (Internet Protocol version 4). In IPv4 the address pool has to turn out to be exhausted gradually. As the current development of Internet Protocol (IP) goes on, the placement of IPv6 QoS is proceeding. In IPv4 QoS solutions, DiffServ is the finest method to meet QoS needs for real-time applications. The aim of this research project is to assess the IPv4/IPv6 QoS performance for real-time multimedia applications like streaming of videos which drives over DiffServ in IPv4/IPv6 networks. In this paper, we also studied the Assured Forwarding (AF), Expedited Forwarding (EF), Traffic aggregation and the outcome of multiple performance parameters such as throughput packet loss, end-to-end delay, and variation in delay. Using different tools and techniques, we measured and analyzed DiffServ integration in IPv4/IPv6 network the research project shows that, IPV6 abilities against IPV4 and give confidence to ISP's to deploy IPv6 to provide their customer quality of services support.
{"title":"IPv6 QoS for Multimedia Applications: A Performance Analysis","authors":"Farooq Haider, M. H. Chaudary, M. S. Naveed, M. Asif","doi":"10.1145/3316615.3316653","DOIUrl":"https://doi.org/10.1145/3316615.3316653","url":null,"abstract":"Since the last decade, we have seen a swift formation of real-time applications on the web and numerous exploration regarding Quality of Service (QoS) [1] in mainly IPv4 (Internet Protocol version 4). In IPv4 the address pool has to turn out to be exhausted gradually. As the current development of Internet Protocol (IP) goes on, the placement of IPv6 QoS is proceeding. In IPv4 QoS solutions, DiffServ is the finest method to meet QoS needs for real-time applications. The aim of this research project is to assess the IPv4/IPv6 QoS performance for real-time multimedia applications like streaming of videos which drives over DiffServ in IPv4/IPv6 networks. In this paper, we also studied the Assured Forwarding (AF), Expedited Forwarding (EF), Traffic aggregation and the outcome of multiple performance parameters such as throughput packet loss, end-to-end delay, and variation in delay. Using different tools and techniques, we measured and analyzed DiffServ integration in IPv4/IPv6 network the research project shows that, IPV6 abilities against IPV4 and give confidence to ISP's to deploy IPv6 to provide their customer quality of services support.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"36 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125521165","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}
Requirements elicitation process faces major challenges about how stakeholders can easily verify requirements. Requirements document allows developers to visualize requirements using modeling language to ensure stakeholders have the same perspective as them. It is also effective to give presentations to stakeholders about how business processes will be carried out after the requirements are implemented. Issues are raised in building requirements modeling as business users generally do not have enough knowledge to build requirements models in specific notations. Transforming requirements (natural language) into semi-formal notation (BPMN) manually lead to inconsistency of elements structure. The need to automatically generate requirements model become crucial because it will be the basis for the programming process. Existing studies are mostly concerned on auto-completion of modeling language using domain ontology as basic knowledge, and let the stakeholders building initial requirements model with limited knowledge. The idea of this paper is to propose a methodology for building business process model in semi-formal language (BPMN) to represent future business processes using ontology approach. This research continues from previous study which transform requirements list into requirements ontology to formalize the elements such as problem, actor and process. By using requirements ontology as input, rule-based mapping method is proposed to map ontology instances to BPMN elements.
{"title":"Automating Business Process Model Generation from Ontology-based Requirements","authors":"Amarilis Putri Yanuarifiani, Fang-Fang Chua, Gaik-Yee Chan","doi":"10.1145/3316615.3316683","DOIUrl":"https://doi.org/10.1145/3316615.3316683","url":null,"abstract":"Requirements elicitation process faces major challenges about how stakeholders can easily verify requirements. Requirements document allows developers to visualize requirements using modeling language to ensure stakeholders have the same perspective as them. It is also effective to give presentations to stakeholders about how business processes will be carried out after the requirements are implemented. Issues are raised in building requirements modeling as business users generally do not have enough knowledge to build requirements models in specific notations. Transforming requirements (natural language) into semi-formal notation (BPMN) manually lead to inconsistency of elements structure. The need to automatically generate requirements model become crucial because it will be the basis for the programming process. Existing studies are mostly concerned on auto-completion of modeling language using domain ontology as basic knowledge, and let the stakeholders building initial requirements model with limited knowledge. The idea of this paper is to propose a methodology for building business process model in semi-formal language (BPMN) to represent future business processes using ontology approach. This research continues from previous study which transform requirements list into requirements ontology to formalize the elements such as problem, actor and process. By using requirements ontology as input, rule-based mapping method is proposed to map ontology instances to BPMN elements.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122992731","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}
Poverty in one place can be reduced or minimized if proper poverty alleviation programs are given to the community. In this study different clustering algorithms were evaluated using silhouette index to get the best clustering algorithm to group the households and analyze the poverty data. The k-means algorithm where k=3 outperformed DBSCAN and k-medoids with a silhouette of 0.308. The algorithm produced three groups or clusters and labelled as non-poor, near poor and poor. The result can help policy-makers formulate and implement poverty reduction policies and programs that are clear, reasonable, realistic, and enforceable.
{"title":"Data Mining Using Clustering Algorithm as Tool for Poverty Analysis","authors":"J. A. Talingdan","doi":"10.1145/3316615.3316672","DOIUrl":"https://doi.org/10.1145/3316615.3316672","url":null,"abstract":"Poverty in one place can be reduced or minimized if proper poverty alleviation programs are given to the community. In this study different clustering algorithms were evaluated using silhouette index to get the best clustering algorithm to group the households and analyze the poverty data. The k-means algorithm where k=3 outperformed DBSCAN and k-medoids with a silhouette of 0.308. The algorithm produced three groups or clusters and labelled as non-poor, near poor and poor. The result can help policy-makers formulate and implement poverty reduction policies and programs that are clear, reasonable, realistic, and enforceable.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004215","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}
Zhen Wang, Yanling Qian, Long Wang, Shigang Zhang, Xu Luo
Due to small quantities, lack of service experience, and poor fault diagnosis knowledge of new-type equipment, it is often difficult to determine the exact location of a trouble. To address this problem, a knowledge capitalization and fault diagnosis method based on semantic annotation was proposed, which can extract deep fault knowledge implied in the technical publications. Firstly, the unstructured nature of deep fault knowledge in the technical publications is outlined. And the role of semantic annotation in the process of knowledge acquisition is highlighted. Secondly, an ontology model for deep fault diagnosis knowledge extraction is developed to annotate the technical publications semantically. And the annotation method is presented to translate the unstructured and implicit knowledge into formal-defined and computer readable semantic net. Then, a fault diagnostic algorithm is proposed to use the annotation results based on hierarchical diagnosis algorithm of directed graph. Finally, an application case of VE-type fuel-injection pump verifies the feasibility and effectiveness of this method.
{"title":"The Extraction of Hidden Fault Diagnostic Knowledge in Equipment Technology Manual Based on Semantic Annotation","authors":"Zhen Wang, Yanling Qian, Long Wang, Shigang Zhang, Xu Luo","doi":"10.1145/3316615.3316659","DOIUrl":"https://doi.org/10.1145/3316615.3316659","url":null,"abstract":"Due to small quantities, lack of service experience, and poor fault diagnosis knowledge of new-type equipment, it is often difficult to determine the exact location of a trouble. To address this problem, a knowledge capitalization and fault diagnosis method based on semantic annotation was proposed, which can extract deep fault knowledge implied in the technical publications. Firstly, the unstructured nature of deep fault knowledge in the technical publications is outlined. And the role of semantic annotation in the process of knowledge acquisition is highlighted. Secondly, an ontology model for deep fault diagnosis knowledge extraction is developed to annotate the technical publications semantically. And the annotation method is presented to translate the unstructured and implicit knowledge into formal-defined and computer readable semantic net. Then, a fault diagnostic algorithm is proposed to use the annotation results based on hierarchical diagnosis algorithm of directed graph. Finally, an application case of VE-type fuel-injection pump verifies the feasibility and effectiveness of this method.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126088257","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}
Recommender System is a technique which is used to recommend an item or product to a user based on the user's preference'. Collaborative filtering is an approach that is vastly used in recommender systems. Item-item-based collaborative filtering is a collaborative filtering recommender system technique where the user got the recommendation based on the similarity among the item ratings. Here, we present an approach where we calculate the similarity among the items based on the genre of items. Any item may belong to more than one genre or category. Based on items propensity to a specific genre or category we propose a new item-item-based similarity metric and a little improvement in prediction method that can efficiently compute the ratings and provide more accurate recommendation compare to the state-of-art works. Our model addresses the problem of the cold start since traditional similarity model takes the user ratings into account whereas our model can calculate the similarity based on item genre or category among them. We also show the extensive simulation results based on sparsity and other recommender system evaluation techniques. We also distinguish that our result outperforms than the traditional collaborative filtering recommender systems.
{"title":"A Genre-Based Item-Item Collaborative Filtering: Facing the Cold-Start Problem","authors":"Surajit Das Barman, M. Hasan, Falguni Roy","doi":"10.1145/3316615.3316732","DOIUrl":"https://doi.org/10.1145/3316615.3316732","url":null,"abstract":"Recommender System is a technique which is used to recommend an item or product to a user based on the user's preference'. Collaborative filtering is an approach that is vastly used in recommender systems. Item-item-based collaborative filtering is a collaborative filtering recommender system technique where the user got the recommendation based on the similarity among the item ratings. Here, we present an approach where we calculate the similarity among the items based on the genre of items. Any item may belong to more than one genre or category. Based on items propensity to a specific genre or category we propose a new item-item-based similarity metric and a little improvement in prediction method that can efficiently compute the ratings and provide more accurate recommendation compare to the state-of-art works. Our model addresses the problem of the cold start since traditional similarity model takes the user ratings into account whereas our model can calculate the similarity based on item genre or category among them. We also show the extensive simulation results based on sparsity and other recommender system evaluation techniques. We also distinguish that our result outperforms than the traditional collaborative filtering recommender systems.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126229032","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}
Masita Masila Bt Abd Jalil, Fatihah Mohd, M. Man, N. Ali, S. Muhamad
Over the decades, Information and Communication Technology (ICT) has become a new trend in the business environment and widely spread in no time at all. Considering all the benefits of ICT, the study utilizes Facebook social media as the electronic business (e-business) and networking platform in marketing the local products of Setiu Wetland women entrepreneurs into wider customer base. This paper presents a case study of rural women entrepreneur in Setiu Wetland, Terengganu, Malaysia from the period of March 2017 until February 2018. To help improve the livelihood through e-business, women entrepreneurs needs to be equipped with entrepreneurship skill explicitly and Information and Communication (ICT) skill implicitly. Through the twelve months' period of tracking the respondent's income, the outcome of this project depicts a 100% achievement with linear proportion of increasing income rate.
{"title":"Social Media Application Usage and Women Entrepreneurship Achievement through E-Business Model: Case of Setiu Wetland","authors":"Masita Masila Bt Abd Jalil, Fatihah Mohd, M. Man, N. Ali, S. Muhamad","doi":"10.1145/3316615.3316709","DOIUrl":"https://doi.org/10.1145/3316615.3316709","url":null,"abstract":"Over the decades, Information and Communication Technology (ICT) has become a new trend in the business environment and widely spread in no time at all. Considering all the benefits of ICT, the study utilizes Facebook social media as the electronic business (e-business) and networking platform in marketing the local products of Setiu Wetland women entrepreneurs into wider customer base. This paper presents a case study of rural women entrepreneur in Setiu Wetland, Terengganu, Malaysia from the period of March 2017 until February 2018. To help improve the livelihood through e-business, women entrepreneurs needs to be equipped with entrepreneurship skill explicitly and Information and Communication (ICT) skill implicitly. Through the twelve months' period of tracking the respondent's income, the outcome of this project depicts a 100% achievement with linear proportion of increasing income rate.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122209497","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}
Muhammad Asyraf Asbullah, M. Ariffin, Z. Mahad, Muhamad Azlan Daud
The AAβ cryptosystem is a well-designed encryption scheme for securing a message (or plaintext) which could transmit large dataset than its key size. Nevertheless, the idea to transmit data larger than the specified condition is not a good idea. This work will explain why it is the case. As a result, we show that some most significant bit of the data can be recovered. In spite the very fact that the complete parameter cannot be recovered fully, anyway by leaks of its most significant bits, even of a very little amount could lead any cryptosystem insecure.
{"title":"(In)Security of the AAβ Cryptosystem for Transmitting Large Data","authors":"Muhammad Asyraf Asbullah, M. Ariffin, Z. Mahad, Muhamad Azlan Daud","doi":"10.1145/3316615.3316661","DOIUrl":"https://doi.org/10.1145/3316615.3316661","url":null,"abstract":"The AAβ cryptosystem is a well-designed encryption scheme for securing a message (or plaintext) which could transmit large dataset than its key size. Nevertheless, the idea to transmit data larger than the specified condition is not a good idea. This work will explain why it is the case. As a result, we show that some most significant bit of the data can be recovered. In spite the very fact that the complete parameter cannot be recovered fully, anyway by leaks of its most significant bits, even of a very little amount could lead any cryptosystem insecure.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133434282","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}
Generally, the concentration of the study and research in the understanding of sounds revolves around the speech and music area, on the contrary, there are few in environmental and non-speech recognition. This paper carries out a meta-analysis of the acoustic transformation and feature set extraction of the environmental sound raw signal form into a parametric type representation in handling analysis, perception, and labeling for audio analysis of sound identification systems. We evaluated and analyzed the various contemporary methods and feature algorithms surveyed for the acoustic identification and perception of surrounding sounds, the Gammatone spectral coefficients (GSTC) and Mel Filterbank (FBEs) then the acoustic signal classification the Convolutional Neural Network (ConvNet) was applied. The outcome demonstrates that GSTC accomplished better as a feature in contrast to FBEs, but FBEs tend to improve performance when merge or incorporated with other feature. The analysis demonstrates that merging or incorporating with other features set is encouraging in achieving a much better accuracy in contrast to a single feature in classifying environmental sounds that is useful in the advancement of the intelligent machine listening frameworks.
{"title":"Meta-Analysis of Acoustic Feature Extraction for Machine Listening Systems","authors":"Ricardo A. Catanghal, T. Palaoag, C. Dayagdag","doi":"10.1145/3316615.3316664","DOIUrl":"https://doi.org/10.1145/3316615.3316664","url":null,"abstract":"Generally, the concentration of the study and research in the understanding of sounds revolves around the speech and music area, on the contrary, there are few in environmental and non-speech recognition. This paper carries out a meta-analysis of the acoustic transformation and feature set extraction of the environmental sound raw signal form into a parametric type representation in handling analysis, perception, and labeling for audio analysis of sound identification systems. We evaluated and analyzed the various contemporary methods and feature algorithms surveyed for the acoustic identification and perception of surrounding sounds, the Gammatone spectral coefficients (GSTC) and Mel Filterbank (FBEs) then the acoustic signal classification the Convolutional Neural Network (ConvNet) was applied. The outcome demonstrates that GSTC accomplished better as a feature in contrast to FBEs, but FBEs tend to improve performance when merge or incorporated with other feature. The analysis demonstrates that merging or incorporating with other features set is encouraging in achieving a much better accuracy in contrast to a single feature in classifying environmental sounds that is useful in the advancement of the intelligent machine listening frameworks.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"24 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132835638","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 Curry-Howard isomorphism shows that an intuitionistic deductive system is similar to a formal computational system; propositions correspond to types, proofs to lambda-terms, and a proof normalization procedure to an evaluation strategy. Furthermore, the duality between computation values and continuations is discovered under the Curry-Howard isomorphism. In the traditional lambda calculus, duplication and erasing of values are allowed but those of continuations prohibited. On the other hand, in the lambda calculus with first-class continuations, both values and continuations are permitted to be duplicated and erased. In our previous paper, we proposed a linear lambda calculus with first-class continuations, in which we cannot duplicate and erase values but can do continuations. In this paper, we propose an ML polymorphic type system for the linear lambda calculus with first-class continuations and design a type inference algorithm of the type system.
{"title":"ML Polymorphism of Linear Lambda Calculus with First-class Continuations","authors":"S. Nishizaki","doi":"10.1145/3316615.3316668","DOIUrl":"https://doi.org/10.1145/3316615.3316668","url":null,"abstract":"The Curry-Howard isomorphism shows that an intuitionistic deductive system is similar to a formal computational system; propositions correspond to types, proofs to lambda-terms, and a proof normalization procedure to an evaluation strategy. Furthermore, the duality between computation values and continuations is discovered under the Curry-Howard isomorphism. In the traditional lambda calculus, duplication and erasing of values are allowed but those of continuations prohibited. On the other hand, in the lambda calculus with first-class continuations, both values and continuations are permitted to be duplicated and erased. In our previous paper, we proposed a linear lambda calculus with first-class continuations, in which we cannot duplicate and erase values but can do continuations. In this paper, we propose an ML polymorphic type system for the linear lambda calculus with first-class continuations and design a type inference algorithm of the type system.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126988324","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
扫码关注我们
求助内容：
应助结果提醒方式：