The importance of argumentation in academic writing,while historically recognised,has arguably lost prominence alongside the rapid expansion of higher education since the early 1990s in the UK.This has been exacerbate...The importance of argumentation in academic writing,while historically recognised,has arguably lost prominence alongside the rapid expansion of higher education since the early 1990s in the UK.This has been exacerbated by an increasingly prevalent technological intervention in teaching and learning processes.With this as a background,this article presents a semiotic analysis of student dissertation extracts to illustrate the role of intertextuality in governing interpretative,evaluative,and concluding propositions in argumentation.Each proposition is perceived as indexed to syntactical compositionality by which a previous proposition elicits a present one that awaits a future one,thus forming a line of argument.The analysis teases out what is at stake concerning the interdependence of signifying codes in textual relations and functions.This brings into view a network of sign actions that lends itself to instances of signification in mediating and coordinating propositions in argumentation.The article concludes with reflection on the medium of English as a lingua franca for studies in higher education,highlighting a semiotic understanding of the intertextuality of argumentation in academic writing.展开更多
UG NX三维造型软件课程是目前高职院校机械类相关专业所开设的一门重要课程,它是计算机辅助设计与制造的重要手段,软件功能强大,知识点多,在有限的教学时间内学生对其掌握不够,很难将其应用于实践。采用实例贯穿计算机辅助设计课程教学...UG NX三维造型软件课程是目前高职院校机械类相关专业所开设的一门重要课程,它是计算机辅助设计与制造的重要手段,软件功能强大,知识点多,在有限的教学时间内学生对其掌握不够,很难将其应用于实践。采用实例贯穿计算机辅助设计课程教学的整个过程,引导和帮助学生主动完成学习过程,树立正确的建模思路和绘图习惯,在课堂上加大师生互动的力度,可有效提升学生应用软件的能力。展开更多
The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solvi...The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solving MAX-SAT.Recently,a powerful SLS algorithm called CCLS shows efficiency on solving random and crafted MAX-SAT instances.However,the performance of CCLS on solving industrial MAX-SAT instances lags far behind.In this paper,we focus on experimentally analyzing the performance of SLS algorithms for solving industrial MAXSAT instances.First,we conduct experiments to analyze why CCLS performs poor on industrial instances.Then we propose a new strategy called additive BMS (Best from Multiple Selections)to ease the serious issue.By integrating CCLS and additive BMS,we develop a new SLS algorithm for MAXSAT called CCABMS,and related experiments indicate the efficiency of CCABMS.Also,we experimentally analyze the effectiveness of initialization methods on SLS algorithms for MAX-SAT,and combine an effective initialization method with CCABMS,resulting in an enhanced algorithm.Experimental results show that our enhanced algorithm performs better than its state-of-the-art SLS competitors on a large number of industrial MAX-SAT instances.展开更多
A k-CNF(conjunctive normal form)formula is a regular(k,s)-CNF one if every variable occurs s times in the formula,where k≥2 and s>0 are integers.Regular(3,s)-CNF formulas have some good structural properties,so ca...A k-CNF(conjunctive normal form)formula is a regular(k,s)-CNF one if every variable occurs s times in the formula,where k≥2 and s>0 are integers.Regular(3,s)-CNF formulas have some good structural properties,so carry-ing out a probability analysis of the structure for random formulas of this type is easier than conducting such an analysisfor random 3-CNF formulas.Some subclasses of the regular(3,s)-CNF formula have also characteristics of intractabilitythat differ from random 3-CNF formulas.For this purpose,we propose strictly d-regular(k,2s)-CNF formula,which is aregular(k,2s)-CNF formula for which d≥0 is an even num-ber and each literal occurs s-d/2 or s+d/2 times(the literals from a variable x are x and-x,where x is positive and-x isnegative).In this paper,we present a new model to generatestrictly d-regular random(k,2s)-CNF formulas,and focuson the strictly d-regular random(3,2s)-CNF formulas.Let F be a strictly d-regular random(3,2s)-CNF formula suchthat 2s>d.We show that there exists a real number so suchthat the formula F is unsatisfiable with high probability whens>so,and present a numerical solution for the real numberso.The result is supported by simulated experiments,and isconsistent with the existing conclusion for the case of d=0.Furthermore,we have a conjecture:for a given d,the strictlyd-regular random(3,2s)-SAT problem has an SAT-UNSAT(satisfiable-unsatisfiable)phase transition.Our experimentssupport this conjecture.Finally,our experiments also showthat the parameter d is correlated with the intractability of the 3-SAT problem.Therefore,our research maybe helpful for generating random hard instances of the 3-CNF formula.展开更多
Our long-term objective is to develop a software toolbox for pre-embodiment design of complex and heterogeneous systems, such as cyber-physical systems. The novelty of this toolbox is that it uses system manifestation...Our long-term objective is to develop a software toolbox for pre-embodiment design of complex and heterogeneous systems, such as cyber-physical systems. The novelty of this toolbox is that it uses system manifestation features(SMFs) for transdisciplinary modeling of these systems. The main challenges of implementation of the toolbox are functional design- and language-independent computational realization of the warehouses, and systematic development and management of the various evolving implements of SMFs(genotypes, phenotypes, and instances). Therefore, an information schema construct(ISC) based approach is proposed to create the schemata of the associated warehouse databases and the above-mentioned SMF implements. ISCs logically arrange the data contents of SMFs in a set of relational tables of varying semantics. In this article we present the ISCs necessary for creation of genotypes and phenotypes. They increase the efficiency of the database development process and make the data relationships transparent. Our follow-up research focuses on the elaboration of the SMF instances based system modeling methodology.展开更多
Many international brands have a phenomenal Chinese name which,paradoxically,comes from a rather prosaic name.The reason for this may lie in the fact that they need an outstanding translation of their names in order t...Many international brands have a phenomenal Chinese name which,paradoxically,comes from a rather prosaic name.The reason for this may lie in the fact that they need an outstanding translation of their names in order to be successful in international marketing.Hence the translation of brand names is an important part of the advertisement.And a good translation is expected to bridge the differences of cultures,languages,spending habits,thinking patterns,etc.展开更多
The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and ...The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and literature Instances, was divided into three stages: Stage 1, data treatment;Stage 2, “metaheuristic approaches” (hybrid or non-hybrid), used comparatively, more specifically: NSGA-II (Non-dominated Sorting Genetic Algorithm II), MOPSO (Multi-Objective Particle Swarm Optimization), which were compared with the new approaches proposed by the authors, CWNSGA-II (Clarke and Wright’s Savings with the Non-dominated Sorting Genetic Algorithm II) and CWTSNSGA-II (Clarke and Wright’s Savings, Tabu Search and Non-dominated Sorting Genetic Algorithm II);Stage 3, analysis of the results, with a comparison of the algorithms. An optimization of 19.9% was achieved for Objective Function 1 (OF<sub>1</sub>;minimization of CO<sub>2</sub> emissions) and consequently the same percentage for the minimization of total distance, and 87.5% for Objective Function 2 (OF<sub>2</sub>;minimization of the difference in demand). Metaheuristic approaches hybrid achieved superior results for case study and instances. In this way, the procedure presented here can bring benefits to society as it considers environmental issues and also balancing work between the routes, ensuring savings and satisfaction for the users.展开更多
This paper analyzes the resolution complexity of a random CSP model named model RBmix, the instance of which is composed by constraints with different length. For model RBmix, the existence of phase transitions has be...This paper analyzes the resolution complexity of a random CSP model named model RBmix, the instance of which is composed by constraints with different length. For model RBmix, the existence of phase transitions has been established and the threshold points have been located exactly. By encoding the random instances into CNF formulas, it is proved that almost all instances of model RBmix have no tree-like resolution proofs of less than exponential size. Thus the model RBmix can generate abundant hard instances in the threshold. This result is of great significance for algorithm testing and complexity analysis in NP-complete problems.展开更多
文摘The importance of argumentation in academic writing,while historically recognised,has arguably lost prominence alongside the rapid expansion of higher education since the early 1990s in the UK.This has been exacerbated by an increasingly prevalent technological intervention in teaching and learning processes.With this as a background,this article presents a semiotic analysis of student dissertation extracts to illustrate the role of intertextuality in governing interpretative,evaluative,and concluding propositions in argumentation.Each proposition is perceived as indexed to syntactical compositionality by which a previous proposition elicits a present one that awaits a future one,thus forming a line of argument.The analysis teases out what is at stake concerning the interdependence of signifying codes in textual relations and functions.This brings into view a network of sign actions that lends itself to instances of signification in mediating and coordinating propositions in argumentation.The article concludes with reflection on the medium of English as a lingua franca for studies in higher education,highlighting a semiotic understanding of the intertextuality of argumentation in academic writing.
基金the National Key Research and Development Program of China (2016YFE0100300, 2017YFB02025)partially supported by the 100 Talents Program of the Chinese Academy of Sciences (2920154070)+2 种基金partially supported by the Knowledge Innovation Project of the Chinese Academy of Sciences (5120146040)partially supported by the Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing (2016A06)partially supported by the National Natural Science Foundation of China (Grant No.61502464).
文摘The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solving MAX-SAT.Recently,a powerful SLS algorithm called CCLS shows efficiency on solving random and crafted MAX-SAT instances.However,the performance of CCLS on solving industrial MAX-SAT instances lags far behind.In this paper,we focus on experimentally analyzing the performance of SLS algorithms for solving industrial MAXSAT instances.First,we conduct experiments to analyze why CCLS performs poor on industrial instances.Then we propose a new strategy called additive BMS (Best from Multiple Selections)to ease the serious issue.By integrating CCLS and additive BMS,we develop a new SLS algorithm for MAXSAT called CCABMS,and related experiments indicate the efficiency of CCABMS.Also,we experimentally analyze the effectiveness of initialization methods on SLS algorithms for MAX-SAT,and combine an effective initialization method with CCABMS,resulting in an enhanced algorithm.Experimental results show that our enhanced algorithm performs better than its state-of-the-art SLS competitors on a large number of industrial MAX-SAT instances.
基金The authors would like to thank the National Natural Science Foundation of China for supporting this work(Grant Nos.61762019,61462001 and 61862051)thank Haiyue Zhang,and ZufengFu for their suggestions for the article writing.
文摘A k-CNF(conjunctive normal form)formula is a regular(k,s)-CNF one if every variable occurs s times in the formula,where k≥2 and s>0 are integers.Regular(3,s)-CNF formulas have some good structural properties,so carry-ing out a probability analysis of the structure for random formulas of this type is easier than conducting such an analysisfor random 3-CNF formulas.Some subclasses of the regular(3,s)-CNF formula have also characteristics of intractabilitythat differ from random 3-CNF formulas.For this purpose,we propose strictly d-regular(k,2s)-CNF formula,which is aregular(k,2s)-CNF formula for which d≥0 is an even num-ber and each literal occurs s-d/2 or s+d/2 times(the literals from a variable x are x and-x,where x is positive and-x isnegative).In this paper,we present a new model to generatestrictly d-regular random(k,2s)-CNF formulas,and focuson the strictly d-regular random(3,2s)-CNF formulas.Let F be a strictly d-regular random(3,2s)-CNF formula suchthat 2s>d.We show that there exists a real number so suchthat the formula F is unsatisfiable with high probability whens>so,and present a numerical solution for the real numberso.The result is supported by simulated experiments,and isconsistent with the existing conclusion for the case of d=0.Furthermore,we have a conjecture:for a given d,the strictlyd-regular random(3,2s)-SAT problem has an SAT-UNSAT(satisfiable-unsatisfiable)phase transition.Our experimentssupport this conjecture.Finally,our experiments also showthat the parameter d is correlated with the intractability of the 3-SAT problem.Therefore,our research maybe helpful for generating random hard instances of the 3-CNF formula.
文摘Our long-term objective is to develop a software toolbox for pre-embodiment design of complex and heterogeneous systems, such as cyber-physical systems. The novelty of this toolbox is that it uses system manifestation features(SMFs) for transdisciplinary modeling of these systems. The main challenges of implementation of the toolbox are functional design- and language-independent computational realization of the warehouses, and systematic development and management of the various evolving implements of SMFs(genotypes, phenotypes, and instances). Therefore, an information schema construct(ISC) based approach is proposed to create the schemata of the associated warehouse databases and the above-mentioned SMF implements. ISCs logically arrange the data contents of SMFs in a set of relational tables of varying semantics. In this article we present the ISCs necessary for creation of genotypes and phenotypes. They increase the efficiency of the database development process and make the data relationships transparent. Our follow-up research focuses on the elaboration of the SMF instances based system modeling methodology.
文摘Many international brands have a phenomenal Chinese name which,paradoxically,comes from a rather prosaic name.The reason for this may lie in the fact that they need an outstanding translation of their names in order to be successful in international marketing.Hence the translation of brand names is an important part of the advertisement.And a good translation is expected to bridge the differences of cultures,languages,spending habits,thinking patterns,etc.
文摘The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and literature Instances, was divided into three stages: Stage 1, data treatment;Stage 2, “metaheuristic approaches” (hybrid or non-hybrid), used comparatively, more specifically: NSGA-II (Non-dominated Sorting Genetic Algorithm II), MOPSO (Multi-Objective Particle Swarm Optimization), which were compared with the new approaches proposed by the authors, CWNSGA-II (Clarke and Wright’s Savings with the Non-dominated Sorting Genetic Algorithm II) and CWTSNSGA-II (Clarke and Wright’s Savings, Tabu Search and Non-dominated Sorting Genetic Algorithm II);Stage 3, analysis of the results, with a comparison of the algorithms. An optimization of 19.9% was achieved for Objective Function 1 (OF<sub>1</sub>;minimization of CO<sub>2</sub> emissions) and consequently the same percentage for the minimization of total distance, and 87.5% for Objective Function 2 (OF<sub>2</sub>;minimization of the difference in demand). Metaheuristic approaches hybrid achieved superior results for case study and instances. In this way, the procedure presented here can bring benefits to society as it considers environmental issues and also balancing work between the routes, ensuring savings and satisfaction for the users.
文摘This paper analyzes the resolution complexity of a random CSP model named model RBmix, the instance of which is composed by constraints with different length. For model RBmix, the existence of phase transitions has been established and the threshold points have been located exactly. By encoding the random instances into CNF formulas, it is proved that almost all instances of model RBmix have no tree-like resolution proofs of less than exponential size. Thus the model RBmix can generate abundant hard instances in the threshold. This result is of great significance for algorithm testing and complexity analysis in NP-complete problems.
