Law is all but not known for innovation.This is also true for studies in Roman private law,which have followed a system that is imagined to derive from the 2nd century AD jurist Gaius and late antique Justinianic codi...Law is all but not known for innovation.This is also true for studies in Roman private law,which have followed a system that is imagined to derive from the 2nd century AD jurist Gaius and late antique Justinianic codification.The shaping hands of the ancient codifiers and those of the medieval,early modern and 19th century jurists on Roman private law and the related legal discourses have been identified and studied at length.However,a real shift to discover the ways in which Roman private law became formed and was practiced has not been undertaken in comprehensive manner until the publication of the Handbook of Roman Private Law which is reviewed in the following from the perspective of an ancient historian.展开更多
Outer-independent Roman domination on graphs originates from the defensive strategy of Ancient Rome,which is that if any city without an army is attacked,a neighboring city with two armies could mobilize an army to su...Outer-independent Roman domination on graphs originates from the defensive strategy of Ancient Rome,which is that if any city without an army is attacked,a neighboring city with two armies could mobilize an army to support it and any two cities that have no army cannot be adjacent.The outer-independent Roman domination on graphs is an attractive topic in graph theory,and the definition is described as follows.Given a graph G=(V,E),a function f:V(G)→{0,1,2}is an outer-independent Roman dominating function(OIRDF)if f satisfies that every vertex v∈V with f(v)=0 has at least one adjacent vertex u∈N(v)with f(u)=2,where N(v)is the open neighborhood of v,and the set V0={v|f(v)=0}is an independent set.The weight of an OIRDF f is w(f)=∑_(v∈V)f(v).The value of minf w(f)is the outerindependent Roman domination number of G,denoted asγoiR(G).This paper is devoted to the study of the outer-independent Roman domination number of the Cartesian product of paths P_(n)□P_(m).With the help of computer,we find some recursive OIRDFs and then we present an upper bound ofγoiR(P_(n)□P_(m)).Furthermore,we prove the lower bound ofγoiR(P_(n)□P_(m))(n≤3)is equal to the upper bound.Hence,we achieve the exact value ofγoiR(P_(n)□P_(m))for n≤3 and the upper bound ofγoiR(P_(n)□P_(m))for n≥4.展开更多
Consider a graph G=(V,E).A perfect double Roman dominating function(PDRDF for short)is a function h:V→{0,1,2,3}that satisfies the condition∑_(y∈NG[x],h(y)≥1)h(y)=|{y∈NG(x):h(y)≥1}|+2 for any x∈V with h(x)≤1.Th...Consider a graph G=(V,E).A perfect double Roman dominating function(PDRDF for short)is a function h:V→{0,1,2,3}that satisfies the condition∑_(y∈NG[x],h(y)≥1)h(y)=|{y∈NG(x):h(y)≥1}|+2 for any x∈V with h(x)≤1.The weightω(h)of this function is∑_(y∈V)h(y).The perfect double Roman domination number(PDRD-number)of G,denoted byγ_(dR)^(p)(G),is defined as the minimum weight among all PDRDFs of G.This article presents a comprehensive analysis of the PDRD-number of connected cographs,demonstrating that it falls within the set{2,3,4,5,6}.Furthermore,it establishes that for any integer i≥7,there is a connected cograph G such that its PDRD-number is equal to i.展开更多
The Roman domination problem is an important combinatorial optimization problem that is derived from an old story of defending the Roman Empire and now regains new significance in cyber space security,considering back...The Roman domination problem is an important combinatorial optimization problem that is derived from an old story of defending the Roman Empire and now regains new significance in cyber space security,considering backups in the face of a dynamic network security requirement.In this paper,firstly,we propose a Roman domination game(RDG)and prove that every Nash equilibrium(NE)of the game corresponds to a strong minimal Roman dominating function(S-RDF),as well as a Pareto-optimal solution.Secondly,we show that RDG is an exact potential game,which guarantees the existence of an NE.Thirdly,we design a game-based synchronous algorithm(GSA),which can be implemented distributively and converge to an NE in O(n)rounds,where n is the number of vertices.In GSA,all players make decisions depending on local information.Furthermore,we enhance GSA to be enhanced GSA(EGSA),which converges to a better NE in O(n2)rounds.Finally,we present numerical simulations to demonstrate that EGSA can obtain a better approximate solution in promising computation time compared with state-of-the-art algorithms.展开更多
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.展开更多
This article aims to make a brief presentation on the elements of material culture in the ancient Palestinian region,mainly coins,which were removed from their production context and placed in funerary contexts(coins ...This article aims to make a brief presentation on the elements of material culture in the ancient Palestinian region,mainly coins,which were removed from their production context and placed in funerary contexts(coins were often buried in graves),thus converted in amulets,acquiring magical and apotropaic senses.We will use examples verified in different parts of the Roman Empire,as in Pithekússai(modest island,which is in the Italian Peninsula),on the banks of the Thames,in Celtic contexts,more specifically in the current city of Lezoux,France,in the ancient city of Aquincum,present day Budapest,also in Tel Maresha and Tiberias,present-day Israel,to demonstrate how these practices were recurrent throughout the Empire.It is also our intention to observe iconographic elements that bring apotropaic content in their formulations,because,in addition to the role that coins could play in connecting the worlds of men and gods,many people believed that they had the power to project magical and apotropaic strength through images powerful that they portrayed.展开更多
For a graph G=(V,E),a Roman{2}-dominating function f:V→{0,1,2}has the property that for every vertex v∈V with f(v)=0,either v is adjacent to at least one vertex u for which f(u)=2,or at least two vertices u1 and u2 ...For a graph G=(V,E),a Roman{2}-dominating function f:V→{0,1,2}has the property that for every vertex v∈V with f(v)=0,either v is adjacent to at least one vertex u for which f(u)=2,or at least two vertices u1 and u2 for which f(u1)=f(u2)=1.A Roman{2}-dominating function f=(V0,V1,V2)is called independent if V1∪V2 is an independent set.The weight of an independent Roman{2}-dominating function f is the valueω(f)=Σv∈V f(v),and the independent Roman{2}-domination number i{R2}(G)is the minimum weight of an independent Roman{2}-dominating function on G.In this paper,we characterize all trees with i{R2}(T)=γ(T)+1,and give a linear time algorithm to compute the value of i{R2}(T)for any tree T.展开更多
Purpose: The purpose of this study is to investigate the historical and linguistic coverage of Google Scholar, using publications in the field of Roman law as an example.Design/methodology/approach: To create a datase...Purpose: The purpose of this study is to investigate the historical and linguistic coverage of Google Scholar, using publications in the field of Roman law as an example.Design/methodology/approach: To create a dataset of Roman law publications, we retrieved a total of 21,300 records of publications, published between years 1500 and 2016, with title including words denoting "Roman law" in English, French, German, Italian, and Spanish. Findings: We were able to find publications dating back to 1727. The largest number of publications and authors date to the late 19th century, and this peak might be explained by the role of Roman law in French legal education at the time. Furthermore, we found exceptionally skewed concentration of publications to authors, as well as of citations to publications. We speculate that this could be explained by the long time-frame of the study, and the importance of classic works. Research limitation: Major limitations, and potential future work, relate to data quality, and cleaning, disambiguation of publications and authors, as well as comparing coverage with other data sources. Practical implications: We find Google Scholar to be a promising data source for historical bibliometrics. This approach may help bridge the gap between bibliometrics and the "digital humanities".Originality/value: Earlier studies have focused mainly on Google Scholar's coverage of publications and citations in general, or in specific fields. The historical coverage has, however, received less attention.展开更多
Roman Urdu has been used for text messaging over the Internet for years especially in Indo-Pak Subcontinent.Persons from the subcontinent may speak the same Urdu language but they might be using different scripts for ...Roman Urdu has been used for text messaging over the Internet for years especially in Indo-Pak Subcontinent.Persons from the subcontinent may speak the same Urdu language but they might be using different scripts for writing.The communication using the Roman characters,which are used in the script of Urdu language on social media,is now considered the most typical standard of communication in an Indian landmass that makes it an expensive information supply.English Text classification is a solved problem but there have been only a few efforts to examine the rich information supply of Roman Urdu in the past.This is due to the numerous complexities involved in the processing of Roman Urdu data.The complexities associated with Roman Urdu include the non-availability of the tagged corpus,lack of a set of rules,and lack of standardized spellings.A large amount of Roman Urdu news data is available on mainstream news websites and social media websites like Facebook,Twitter but meaningful information can only be extracted if data is in a structured format.We have developed a Roman Urdu news headline classifier,which will help to classify news into relevant categories on which further analysis and modeling can be done.The author of this research aims to develop the Roman Urdu news classifier,which will classify the news into five categories(health,business,technology,sports,international).First,we will develop the news dataset using scraping tools and then after preprocessing,we will compare the results of different machine learning algorithms like Logistic Regression(LR),Multinomial Naïve Bayes(MNB),Long short term memory(LSTM),and Convolutional Neural Network(CNN).After this,we will use a phonetic algorithm to control lexical variation and test news from different websites.The preliminary results suggest that a more accurate classification can be accomplished by monitoring noise inside data and by classifying the news.After applying above mentioned different machine learning algorithms,results have shown that Multinomial Naïve Bayes classifier is giving the best accuracy of 90.17%which is due to the noise lexical variation.展开更多
Sentiment analysis task has widely been studied for various languages such as English and French.However,Roman Urdu sentiment analysis yet requires more attention from peer-researchers due to the lack of Off-the-Shelf...Sentiment analysis task has widely been studied for various languages such as English and French.However,Roman Urdu sentiment analysis yet requires more attention from peer-researchers due to the lack of Off-the-Shelf Natural Language Processing(NLP)solutions.The primary objective of this study is to investigate the diverse machine learning methods for the sentiment analysis of Roman Urdu data which is very informal in nature and needs to be lexically normalized.To mitigate this challenge,we propose a fine-tuned Support Vector Machine(SVM)powered by Roman Urdu Stemmer.In our proposed scheme,the corpus data is initially cleaned to remove the anomalies from the text.After initial pre-processing,each user review is being stemmed.The input text is transformed into a feature vector using the bag-of-word model.Subsequently,the SVM is used to classify and detect user sentiment.Our proposed scheme is based on a dictionary based Roman Urdu stemmer.The creation of the Roman Urdu stemmer is aimed at standardizing the text so as to minimize the level of complexity.The efficacy of our proposed model is also empirically evaluated with diverse experimental configurations,so as to fine-tune the hyper-parameters and achieve superior performance.Moreover,a series of experiments are conducted on diverse machine learning and deep learning models to compare the performance with our proposed model.We also introduced the largest dataset on Roman Urdu,i.e.,Roman Urdu e-commerce dataset(RUECD),which contains 26K+user reviews annotated by the group of experts.The RUECD is challenging and the largest dataset available of Roman Urdu.The experiments show that the newly generated dataset is quite challenging and requires more attention from the peer researchers for Roman Urdu sentiment analysis.展开更多
This paper firstly introduced characteristics of the food production( or grain production) and regulation of the prosperous period of the Roman Empire. Then,it discussed the shortcomings and summarized the experience ...This paper firstly introduced characteristics of the food production( or grain production) and regulation of the prosperous period of the Roman Empire. Then,it discussed the shortcomings and summarized the experience and lessons. It is expected to provide some references for construction of China's food security.展开更多
The Roman high(RHA) and low-Avoidance (RLA) rats were selectively bred for rapid vs poor acquisition of two-way active avoidance behavior. These lines differ in numerous behavioral traits, with RLA rats being more fea...The Roman high(RHA) and low-Avoidance (RLA) rats were selectively bred for rapid vs poor acquisition of two-way active avoidance behavior. These lines differ in numerous behavioral traits, with RLA rats being more fearful/anxious than RHA rats, and the latter being novelty-seekers and showing larger intake of, and preference for, addictive substances including ethanol (ETH). Moreover, several differences in central dopaminergic, serotonergic, and GABAergic functions have been reported in these two lines. Since those neural systems are involved in the regulation of ETH consumption, it was considered of interest to investigate: 1) the differences in ETH intake and preference between RHA and RLA rats, 2) the effects of ETH on DA release in the shell of the nucleus accumbens (AcbSh) using brain microdialysis. ETH solutions of increasing concentrations (2% - 10%) were presented on alternate days in a free choice with water. To examine ETH intake and preference stability, animals were subsequently switched to daily presentations of 10% ETH for 10 consecutive days. RHA rats consumed significantly larger amounts of ETH and displayed higher ETH preference than did RLA rats throughout the acquisition and maintenance phases. Following chronic exposure to ETH the animals were habituated to a restricted access to ETH schedule (2% ETH, 2 h per day × 4 days) before surgical implantation of a dialysis probe in the AcbSh. Under these experimental conditions, voluntary ETH intake (2%, 1 h, p.o.) produced a significant increase in accumbal DA output in RHA rats but not in their RLA counterparts. Finally, the i.p. administration of ETH (0.25 g/kg) to na?ve Roman rats produced a significant increment in accumbal DA output only in RHA rats. These results indicate that the mesolimbic dopaminergic system of RHA rats is more responsive to the effects of ETH than that of RLA rats.展开更多
In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum ...In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the square bishop’s graph for odd board sizes. Also found are the number of minimum total dominating sets associated with the light-colored squares when n?≡1(mod12)? (with n>1), and same for the dark-colored squares when n?≡7(mod12) .展开更多
文摘Law is all but not known for innovation.This is also true for studies in Roman private law,which have followed a system that is imagined to derive from the 2nd century AD jurist Gaius and late antique Justinianic codification.The shaping hands of the ancient codifiers and those of the medieval,early modern and 19th century jurists on Roman private law and the related legal discourses have been identified and studied at length.However,a real shift to discover the ways in which Roman private law became formed and was practiced has not been undertaken in comprehensive manner until the publication of the Handbook of Roman Private Law which is reviewed in the following from the perspective of an ancient historian.
文摘Outer-independent Roman domination on graphs originates from the defensive strategy of Ancient Rome,which is that if any city without an army is attacked,a neighboring city with two armies could mobilize an army to support it and any two cities that have no army cannot be adjacent.The outer-independent Roman domination on graphs is an attractive topic in graph theory,and the definition is described as follows.Given a graph G=(V,E),a function f:V(G)→{0,1,2}is an outer-independent Roman dominating function(OIRDF)if f satisfies that every vertex v∈V with f(v)=0 has at least one adjacent vertex u∈N(v)with f(u)=2,where N(v)is the open neighborhood of v,and the set V0={v|f(v)=0}is an independent set.The weight of an OIRDF f is w(f)=∑_(v∈V)f(v).The value of minf w(f)is the outerindependent Roman domination number of G,denoted asγoiR(G).This paper is devoted to the study of the outer-independent Roman domination number of the Cartesian product of paths P_(n)□P_(m).With the help of computer,we find some recursive OIRDFs and then we present an upper bound ofγoiR(P_(n)□P_(m)).Furthermore,we prove the lower bound ofγoiR(P_(n)□P_(m))(n≤3)is equal to the upper bound.Hence,we achieve the exact value ofγoiR(P_(n)□P_(m))for n≤3 and the upper bound ofγoiR(P_(n)□P_(m))for n≥4.
基金Supported by the National Natural Science Foundation Youth Fund of China(Grant No.11701059)The Chongqing Natural Science Foundation Innovation and Development Joint Fund(Municipal Education Commission)(Grant No.CSTB2022NSCQ-LZX0003)The Open Research Fund of Key Laboratory of Nonlinear Analysis&Applications(Central China Normal University),Ministry of Education,P.R.China。
文摘Consider a graph G=(V,E).A perfect double Roman dominating function(PDRDF for short)is a function h:V→{0,1,2,3}that satisfies the condition∑_(y∈NG[x],h(y)≥1)h(y)=|{y∈NG(x):h(y)≥1}|+2 for any x∈V with h(x)≤1.The weightω(h)of this function is∑_(y∈V)h(y).The perfect double Roman domination number(PDRD-number)of G,denoted byγ_(dR)^(p)(G),is defined as the minimum weight among all PDRDFs of G.This article presents a comprehensive analysis of the PDRD-number of connected cographs,demonstrating that it falls within the set{2,3,4,5,6}.Furthermore,it establishes that for any integer i≥7,there is a connected cograph G such that its PDRD-number is equal to i.
基金supported in part by the National Natural Science Foundation of China(U20A2068)Zhejiang Provincial Natural Science Foundation of China(LD19A010001,LZ24F030009).
文摘The Roman domination problem is an important combinatorial optimization problem that is derived from an old story of defending the Roman Empire and now regains new significance in cyber space security,considering backups in the face of a dynamic network security requirement.In this paper,firstly,we propose a Roman domination game(RDG)and prove that every Nash equilibrium(NE)of the game corresponds to a strong minimal Roman dominating function(S-RDF),as well as a Pareto-optimal solution.Secondly,we show that RDG is an exact potential game,which guarantees the existence of an NE.Thirdly,we design a game-based synchronous algorithm(GSA),which can be implemented distributively and converge to an NE in O(n)rounds,where n is the number of vertices.In GSA,all players make decisions depending on local information.Furthermore,we enhance GSA to be enhanced GSA(EGSA),which converges to a better NE in O(n2)rounds.Finally,we present numerical simulations to demonstrate that EGSA can obtain a better approximate solution in promising computation time compared with state-of-the-art algorithms.
文摘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.
文摘This article aims to make a brief presentation on the elements of material culture in the ancient Palestinian region,mainly coins,which were removed from their production context and placed in funerary contexts(coins were often buried in graves),thus converted in amulets,acquiring magical and apotropaic senses.We will use examples verified in different parts of the Roman Empire,as in Pithekússai(modest island,which is in the Italian Peninsula),on the banks of the Thames,in Celtic contexts,more specifically in the current city of Lezoux,France,in the ancient city of Aquincum,present day Budapest,also in Tel Maresha and Tiberias,present-day Israel,to demonstrate how these practices were recurrent throughout the Empire.It is also our intention to observe iconographic elements that bring apotropaic content in their formulations,because,in addition to the role that coins could play in connecting the worlds of men and gods,many people believed that they had the power to project magical and apotropaic strength through images powerful that they portrayed.
基金Supported by National Natural Science Foundation of China(Grant No.12171440)。
文摘For a graph G=(V,E),a Roman{2}-dominating function f:V→{0,1,2}has the property that for every vertex v∈V with f(v)=0,either v is adjacent to at least one vertex u for which f(u)=2,or at least two vertices u1 and u2 for which f(u1)=f(u2)=1.A Roman{2}-dominating function f=(V0,V1,V2)is called independent if V1∪V2 is an independent set.The weight of an independent Roman{2}-dominating function f is the valueω(f)=Σv∈V f(v),and the independent Roman{2}-domination number i{R2}(G)is the minimum weight of an independent Roman{2}-dominating function on G.In this paper,we characterize all trees with i{R2}(T)=γ(T)+1,and give a linear time algorithm to compute the value of i{R2}(T)for any tree T.
文摘Purpose: The purpose of this study is to investigate the historical and linguistic coverage of Google Scholar, using publications in the field of Roman law as an example.Design/methodology/approach: To create a dataset of Roman law publications, we retrieved a total of 21,300 records of publications, published between years 1500 and 2016, with title including words denoting "Roman law" in English, French, German, Italian, and Spanish. Findings: We were able to find publications dating back to 1727. The largest number of publications and authors date to the late 19th century, and this peak might be explained by the role of Roman law in French legal education at the time. Furthermore, we found exceptionally skewed concentration of publications to authors, as well as of citations to publications. We speculate that this could be explained by the long time-frame of the study, and the importance of classic works. Research limitation: Major limitations, and potential future work, relate to data quality, and cleaning, disambiguation of publications and authors, as well as comparing coverage with other data sources. Practical implications: We find Google Scholar to be a promising data source for historical bibliometrics. This approach may help bridge the gap between bibliometrics and the "digital humanities".Originality/value: Earlier studies have focused mainly on Google Scholar's coverage of publications and citations in general, or in specific fields. The historical coverage has, however, received less attention.
基金This work is supported by the KIAS(Research Number:CG076601)and in part by Sejong University Faculty Research Fund.
文摘Roman Urdu has been used for text messaging over the Internet for years especially in Indo-Pak Subcontinent.Persons from the subcontinent may speak the same Urdu language but they might be using different scripts for writing.The communication using the Roman characters,which are used in the script of Urdu language on social media,is now considered the most typical standard of communication in an Indian landmass that makes it an expensive information supply.English Text classification is a solved problem but there have been only a few efforts to examine the rich information supply of Roman Urdu in the past.This is due to the numerous complexities involved in the processing of Roman Urdu data.The complexities associated with Roman Urdu include the non-availability of the tagged corpus,lack of a set of rules,and lack of standardized spellings.A large amount of Roman Urdu news data is available on mainstream news websites and social media websites like Facebook,Twitter but meaningful information can only be extracted if data is in a structured format.We have developed a Roman Urdu news headline classifier,which will help to classify news into relevant categories on which further analysis and modeling can be done.The author of this research aims to develop the Roman Urdu news classifier,which will classify the news into five categories(health,business,technology,sports,international).First,we will develop the news dataset using scraping tools and then after preprocessing,we will compare the results of different machine learning algorithms like Logistic Regression(LR),Multinomial Naïve Bayes(MNB),Long short term memory(LSTM),and Convolutional Neural Network(CNN).After this,we will use a phonetic algorithm to control lexical variation and test news from different websites.The preliminary results suggest that a more accurate classification can be accomplished by monitoring noise inside data and by classifying the news.After applying above mentioned different machine learning algorithms,results have shown that Multinomial Naïve Bayes classifier is giving the best accuracy of 90.17%which is due to the noise lexical variation.
基金the Deputy for Study and Innovation,Ministry of Education,Kingdom of Saudi Arabia,for funding this research through a Grant(NU/IFC/INT/01/008)from the Najran University Institutional Funding Committee.
文摘Sentiment analysis task has widely been studied for various languages such as English and French.However,Roman Urdu sentiment analysis yet requires more attention from peer-researchers due to the lack of Off-the-Shelf Natural Language Processing(NLP)solutions.The primary objective of this study is to investigate the diverse machine learning methods for the sentiment analysis of Roman Urdu data which is very informal in nature and needs to be lexically normalized.To mitigate this challenge,we propose a fine-tuned Support Vector Machine(SVM)powered by Roman Urdu Stemmer.In our proposed scheme,the corpus data is initially cleaned to remove the anomalies from the text.After initial pre-processing,each user review is being stemmed.The input text is transformed into a feature vector using the bag-of-word model.Subsequently,the SVM is used to classify and detect user sentiment.Our proposed scheme is based on a dictionary based Roman Urdu stemmer.The creation of the Roman Urdu stemmer is aimed at standardizing the text so as to minimize the level of complexity.The efficacy of our proposed model is also empirically evaluated with diverse experimental configurations,so as to fine-tune the hyper-parameters and achieve superior performance.Moreover,a series of experiments are conducted on diverse machine learning and deep learning models to compare the performance with our proposed model.We also introduced the largest dataset on Roman Urdu,i.e.,Roman Urdu e-commerce dataset(RUECD),which contains 26K+user reviews annotated by the group of experts.The RUECD is challenging and the largest dataset available of Roman Urdu.The experiments show that the newly generated dataset is quite challenging and requires more attention from the peer researchers for Roman Urdu sentiment analysis.
文摘This paper firstly introduced characteristics of the food production( or grain production) and regulation of the prosperous period of the Roman Empire. Then,it discussed the shortcomings and summarized the experience and lessons. It is expected to provide some references for construction of China's food security.
文摘The Roman high(RHA) and low-Avoidance (RLA) rats were selectively bred for rapid vs poor acquisition of two-way active avoidance behavior. These lines differ in numerous behavioral traits, with RLA rats being more fearful/anxious than RHA rats, and the latter being novelty-seekers and showing larger intake of, and preference for, addictive substances including ethanol (ETH). Moreover, several differences in central dopaminergic, serotonergic, and GABAergic functions have been reported in these two lines. Since those neural systems are involved in the regulation of ETH consumption, it was considered of interest to investigate: 1) the differences in ETH intake and preference between RHA and RLA rats, 2) the effects of ETH on DA release in the shell of the nucleus accumbens (AcbSh) using brain microdialysis. ETH solutions of increasing concentrations (2% - 10%) were presented on alternate days in a free choice with water. To examine ETH intake and preference stability, animals were subsequently switched to daily presentations of 10% ETH for 10 consecutive days. RHA rats consumed significantly larger amounts of ETH and displayed higher ETH preference than did RLA rats throughout the acquisition and maintenance phases. Following chronic exposure to ETH the animals were habituated to a restricted access to ETH schedule (2% ETH, 2 h per day × 4 days) before surgical implantation of a dialysis probe in the AcbSh. Under these experimental conditions, voluntary ETH intake (2%, 1 h, p.o.) produced a significant increase in accumbal DA output in RHA rats but not in their RLA counterparts. Finally, the i.p. administration of ETH (0.25 g/kg) to na?ve Roman rats produced a significant increment in accumbal DA output only in RHA rats. These results indicate that the mesolimbic dopaminergic system of RHA rats is more responsive to the effects of ETH than that of RLA rats.
文摘In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the square bishop’s graph for odd board sizes. Also found are the number of minimum total dominating sets associated with the light-colored squares when n?≡1(mod12)? (with n>1), and same for the dark-colored squares when n?≡7(mod12) .
