Sentiment analysis, the meta field of Natural Language Processing (NLP), attempts to analyze and identify thesentiments in the opinionated text data. People share their judgments, reactions, and feedback on the intern...Sentiment analysis, the meta field of Natural Language Processing (NLP), attempts to analyze and identify thesentiments in the opinionated text data. People share their judgments, reactions, and feedback on the internetusing various languages. Urdu is one of them, and it is frequently used worldwide. Urdu-speaking people prefer tocommunicate on social media in Roman Urdu (RU), an English scripting style with the Urdu language dialect.Researchers have developed versatile lexical resources for features-rich comprehensive languages, but limitedlinguistic resources are available to facilitate the sentiment classification of Roman Urdu. This effort encompassesextracting subjective expressions in Roman Urdu and determining the implied opinionated text polarity. Theprimary sources of the dataset are Daraz (an e-commerce platform), Google Maps, and the manual effort. Thecontributions of this study include a Bilingual Roman Urdu Language Detector (BRULD) and a Roman UrduSpelling Checker (RUSC). These integrated modules accept the user input, detect the text language, correct thespellings, categorize the sentiments, and return the input sentence’s orientation with a sentiment intensity score.The developed system gains strength with each input experience gradually. The results show that the languagedetector gives an accuracy of 97.1% on a close domain dataset, with an overall sentiment classification accuracy of94.3%.展开更多
A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for ...A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for any v ∈ V, where N [v] is the closed neighborhood and N(v) is the neighborhood of v, and(ii) every vertex v for which f(v) =-1 is adjacent to a vertex u for which f(u) = 2. The weight of a SRDF(res. STRDF) is the sum of its function values over all vertices.The signed(res. signed total) Roman domination number of G is the minimum weight among all signed(res. signed total) Roman dominating functions of G. In this paper,we compute the exact values of the signed(res. signed total) Roman domination numbers of complete bipartite graphs and wheels.展开更多
A Roman dominating function on a graph G = （V, E） is a function f ： V→{0, 1, 2} satisfying the condition that every vertex u for which f（u） = 0 is adjacent to at least one vertex v for which f（v） = 2. The weig...A Roman dominating function on a graph G = （V, E） is a function f ： V→{0, 1, 2} satisfying the condition that every vertex u for which f（u） = 0 is adjacent to at least one vertex v for which f（v） = 2. The weight of a Roman dominating function is the value f（V） = Σu∈Vf（u）. The minimum weight of a Roman dominating function on a graph G, denoted by γR（G）, is called the Roman dominating number of G. In this paper, we will characterize a tree T with γR（T） = γ（T） ＋ 3.展开更多
The domination problem of graphs is an important issue in the field of graph theory.This paper mainly considers the Italian domination number of the strong product between two paths.By constructing recursive Italian d...The domination problem of graphs is an important issue in the field of graph theory.This paper mainly considers the Italian domination number of the strong product between two paths.By constructing recursive Italian dominating functions,the upper bound of its Italian domination number is obtained,and then a partition method is proposed to prove its lower bound.Finally,this paper yields a sharp bound for the Italian domination number of the strong product of paths.展开更多
In this case study we explore Cicero’s processes of framing and image-building regarding the concept of an anti-mother/-woman.For this we examine Cicero’s portrayal of Sassia,a woman who features as one of the main ...In this case study we explore Cicero’s processes of framing and image-building regarding the concept of an anti-mother/-woman.For this we examine Cicero’s portrayal of Sassia,a woman who features as one of the main antagonists of his speech Pro Cluentio.We analyse Cicero’s depiction of Sassia’s evilness towards her son,Cluentius,through the lens of frame and framing theories.By doing so,this case study aims to present a deeper understanding of Cicero’s stratagems(e.g.,priming,calling for action;nudging,pushing someone towards action;and affordance,offering a frame to act outside of or within)which were employed in order to devise a negative characterisation of Sassia.The application of this methodological approach to Cicero’s framing of Sassia provides a new scope for analysing not only the classical text itself but also for the analysis of ancient human society to which it belonged.展开更多
Many sources are brought together in scholarship in order to write the linear story of a specific tax,the half shekel tax paid each year by the Jews to the Temple of Jerusalem and,then,confiscated by the fiscus Iudaic...Many sources are brought together in scholarship in order to write the linear story of a specific tax,the half shekel tax paid each year by the Jews to the Temple of Jerusalem and,then,confiscated by the fiscus Iudaicus in Roman times.But do these sources refer to the same tax?In this paper,I defend the idea that the linearity of this story is a fiction.Many taxes were levied and justified by the memory of a Biblical tax,but they are all different in meaning,in administration and sometimes even in value.The story is a political one:how to justify a tax in ancient Judaism?展开更多
Let k be a positive integer. A Roman k-dominating function on a graph G is a labeling f ： V（G） → {0, 1, 2} such that every vertex with label 0 has at least k neighbors with label 2. A set {f1, f2,..., fd} of disti...Let k be a positive integer. A Roman k-dominating function on a graph G is a labeling f ： V（G） → {0, 1, 2} such that every vertex with label 0 has at least k neighbors with label 2. A set {f1, f2,..., fd} of distinct Roman k-dominating functions on G with the property that ∑di=1 fi（v） ≤ 2 for each v C V（G）, is called a Roman k-dominating family （of functions） on G. The maximum number of functions in a Roman k-dominating family on G is the Roman k-domatic number of G, denoted by dkR（G）. Note that the Roman 1-domatic number dlR（G） is the usual Roman domatic number dR（G）. In this paper we initiate the study of the Roman k-domatic number in graphs and we present sharp bounds for dkR（G）. In addition, we determine the Roman k-domatic number of some graphs. Some of our results extend those given by Sheikholeslami and Volkmann in 2010 for the Roman domatic number.展开更多
Many graph domination applications can be expanded to achieve complete cototal domination.If every node in a dominating set is regarded as a record server for a PC organization,then each PC affiliated with the organiz...Many graph domination applications can be expanded to achieve complete cototal domination.If every node in a dominating set is regarded as a record server for a PC organization,then each PC affiliated with the organization has direct access to a document server.It is occasionally reasonable to believe that this gateway will remain available even if one of the scrape servers fails.Because every PC has direct access to at least two documents’servers,a complete cototal dominating set provides the required adaptability to non-critical failure in such scenarios.In this paper,we presented a method for calculating a graph’s complete cototal roman domination number.We also examined the properties and determined the bounds for a graph’s complete cototal roman domination number,and its applications are presented.It has been observed that one’s interest fluctuate over time,therefore inferring them just from one’s own behaviour may be inconclusive.However,it may be able to deduce a user’s constant interest to some level if a user’s networking is also watched for similar or related actions.This research proposes a method that considers a user’s and his channel’s activity,as well as common tags,persons,and organizations from their social media posts in order to establish a solid foundation for the required conclusion.展开更多
This article contributes to developing an indicator-based vulnerability assessment framework for cultural heritage sites.It provides a vulnerability index for heritage sites potentially exposed to multiple hazards,inc...This article contributes to developing an indicator-based vulnerability assessment framework for cultural heritage sites.It provides a vulnerability index for heritage sites potentially exposed to multiple hazards,including sudden-onset and slow-onset hazards,while considering climate change influences.Through determining particular criteria and indicators,the Cultural Heritage Vulnerability Index incorporates structural and non-structural factors of the heritage site and its local and national settings.The assessment procedure was applied to the case of the Roman Ruins of Tróia in Portugal.The findings highlight those areas of sensitivity(e.g.,the existing deterioration patterns and types of foundation)and coping and adaptive capacities(e.g.,institutional setting and response plan)that significantly contribute to the level of vulnerability and risk.The results of vulnerability assessment will further enable determining priorities and developing risk mitigation and preparedness measures,in particular reducing structural sensitivity and promoting coping capacities.展开更多
文摘Sentiment analysis, the meta field of Natural Language Processing (NLP), attempts to analyze and identify thesentiments in the opinionated text data. People share their judgments, reactions, and feedback on the internetusing various languages. Urdu is one of them, and it is frequently used worldwide. Urdu-speaking people prefer tocommunicate on social media in Roman Urdu (RU), an English scripting style with the Urdu language dialect.Researchers have developed versatile lexical resources for features-rich comprehensive languages, but limitedlinguistic resources are available to facilitate the sentiment classification of Roman Urdu. This effort encompassesextracting subjective expressions in Roman Urdu and determining the implied opinionated text polarity. Theprimary sources of the dataset are Daraz (an e-commerce platform), Google Maps, and the manual effort. Thecontributions of this study include a Bilingual Roman Urdu Language Detector (BRULD) and a Roman UrduSpelling Checker (RUSC). These integrated modules accept the user input, detect the text language, correct thespellings, categorize the sentiments, and return the input sentence’s orientation with a sentiment intensity score.The developed system gains strength with each input experience gradually. The results show that the languagedetector gives an accuracy of 97.1% on a close domain dataset, with an overall sentiment classification accuracy of94.3%.
基金The NSF(11271365)of Chinathe NSF(BK20151117)of Jiangsu Province
文摘A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for any v ∈ V, where N [v] is the closed neighborhood and N(v) is the neighborhood of v, and(ii) every vertex v for which f(v) =-1 is adjacent to a vertex u for which f(u) = 2. The weight of a SRDF(res. STRDF) is the sum of its function values over all vertices.The signed(res. signed total) Roman domination number of G is the minimum weight among all signed(res. signed total) Roman dominating functions of G. In this paper,we compute the exact values of the signed(res. signed total) Roman domination numbers of complete bipartite graphs and wheels.
基金Supported by the NSF of education Department of Henan Province(200510475038)
文摘A Roman dominating function on a graph G = （V, E） is a function f ： V→{0, 1, 2} satisfying the condition that every vertex u for which f（u） = 0 is adjacent to at least one vertex v for which f（v） = 2. The weight of a Roman dominating function is the value f（V） = Σu∈Vf（u）. The minimum weight of a Roman dominating function on a graph G, denoted by γR（G）, is called the Roman dominating number of G. In this paper, we will characterize a tree T with γR（T） = γ（T） ＋ 3.
基金Supported by the National Natural Science Foundation of China(Grant No.11551002)The Natural Science Foundation of Qinghai Province(Grant No.2019-ZJ-7093).
文摘The domination problem of graphs is an important issue in the field of graph theory.This paper mainly considers the Italian domination number of the strong product between two paths.By constructing recursive Italian dominating functions,the upper bound of its Italian domination number is obtained,and then a partition method is proposed to prove its lower bound.Finally,this paper yields a sharp bound for the Italian domination number of the strong product of paths.
文摘In this case study we explore Cicero’s processes of framing and image-building regarding the concept of an anti-mother/-woman.For this we examine Cicero’s portrayal of Sassia,a woman who features as one of the main antagonists of his speech Pro Cluentio.We analyse Cicero’s depiction of Sassia’s evilness towards her son,Cluentius,through the lens of frame and framing theories.By doing so,this case study aims to present a deeper understanding of Cicero’s stratagems(e.g.,priming,calling for action;nudging,pushing someone towards action;and affordance,offering a frame to act outside of or within)which were employed in order to devise a negative characterisation of Sassia.The application of this methodological approach to Cicero’s framing of Sassia provides a new scope for analysing not only the classical text itself but also for the analysis of ancient human society to which it belonged.
文摘Many sources are brought together in scholarship in order to write the linear story of a specific tax,the half shekel tax paid each year by the Jews to the Temple of Jerusalem and,then,confiscated by the fiscus Iudaicus in Roman times.But do these sources refer to the same tax?In this paper,I defend the idea that the linearity of this story is a fiction.Many taxes were levied and justified by the memory of a Biblical tax,but they are all different in meaning,in administration and sometimes even in value.The story is a political one:how to justify a tax in ancient Judaism?
文摘Let k be a positive integer. A Roman k-dominating function on a graph G is a labeling f ： V（G） → {0, 1, 2} such that every vertex with label 0 has at least k neighbors with label 2. A set {f1, f2,..., fd} of distinct Roman k-dominating functions on G with the property that ∑di=1 fi（v） ≤ 2 for each v C V（G）, is called a Roman k-dominating family （of functions） on G. The maximum number of functions in a Roman k-dominating family on G is the Roman k-domatic number of G, denoted by dkR（G）. Note that the Roman 1-domatic number dlR（G） is the usual Roman domatic number dR（G）. In this paper we initiate the study of the Roman k-domatic number in graphs and we present sharp bounds for dkR（G）. In addition, we determine the Roman k-domatic number of some graphs. Some of our results extend those given by Sheikholeslami and Volkmann in 2010 for the Roman domatic number.
文摘Many graph domination applications can be expanded to achieve complete cototal domination.If every node in a dominating set is regarded as a record server for a PC organization,then each PC affiliated with the organization has direct access to a document server.It is occasionally reasonable to believe that this gateway will remain available even if one of the scrape servers fails.Because every PC has direct access to at least two documents’servers,a complete cototal dominating set provides the required adaptability to non-critical failure in such scenarios.In this paper,we presented a method for calculating a graph’s complete cototal roman domination number.We also examined the properties and determined the bounds for a graph’s complete cototal roman domination number,and its applications are presented.It has been observed that one’s interest fluctuate over time,therefore inferring them just from one’s own behaviour may be inconclusive.However,it may be able to deduce a user’s constant interest to some level if a user’s networking is also watched for similar or related actions.This research proposes a method that considers a user’s and his channel’s activity,as well as common tags,persons,and organizations from their social media posts in order to establish a solid foundation for the required conclusion.
基金based on the Safeguarding Cultural Heritage through Technical and Organisational Resources Management(STORM)project,funded by the European Union’s Horizon 2020 Research and Innovation Programme under Grant Agreement no.700191.
文摘This article contributes to developing an indicator-based vulnerability assessment framework for cultural heritage sites.It provides a vulnerability index for heritage sites potentially exposed to multiple hazards,including sudden-onset and slow-onset hazards,while considering climate change influences.Through determining particular criteria and indicators,the Cultural Heritage Vulnerability Index incorporates structural and non-structural factors of the heritage site and its local and national settings.The assessment procedure was applied to the case of the Roman Ruins of Tróia in Portugal.The findings highlight those areas of sensitivity(e.g.,the existing deterioration patterns and types of foundation)and coping and adaptive capacities(e.g.,institutional setting and response plan)that significantly contribute to the level of vulnerability and risk.The results of vulnerability assessment will further enable determining priorities and developing risk mitigation and preparedness measures,in particular reducing structural sensitivity and promoting coping capacities.
