Code obfuscation is a crucial technique for protecting software against reverse engineering and security attacks.Among various obfuscation methods,opaque predicates,which are recognized as flexible and promising,are w...Code obfuscation is a crucial technique for protecting software against reverse engineering and security attacks.Among various obfuscation methods,opaque predicates,which are recognized as flexible and promising,are widely used to increase control-flow complexity.However,traditional opaque predicates are increasingly vulnerable to Dynamic Symbolic Execution(DSE)attacks,which can efficiently identify and eliminate them.To address this issue,this paper proposes a novel approach for anti-DSE opaque predicates that effectively resists symbolic execution-based deobfuscation.Our method introduces two key techniques:single-way function opaque predicates,which leverage hash functions and logarithmic transformations to prevent constraint solvers from generating feasible inputs,and path-explosion opaque predicates,which generate an excessive number of execution paths,overwhelming symbolic execution engines.To evaluate the effectiveness of our approach,we implemented a prototype obfuscation tool and tested it against prominent symbolic execution engines.Experimental results demonstrate that our approach signifi-cantly increases resilience against symbolic execution attacks while maintaining acceptable performance overhead.This paper provides a robust and scalable obfuscation technique,contributing to the enhancement of software protection strategies in adversarial environments.展开更多
This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals noth...This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals nothing about the predicate f,as long as f is drawn from an evasive distribution with sufficient entropy.The proposed scheme extends the group-based public-key function-private predicate encryption(FP-PE)for“small superset predicates”proposed by Bartusek et al.(Asiacrypt 19),to the setting of inner-product predicates.This is the first construction of public-key FP-PE with enhanced function privacy security beyond the equality predicates,which is previously proposed by Boneh et al.(CRYPTO 13).The proposed construction relies on bilinear groups,and the security is proved in the generic bilinear group model.展开更多
Networking,storage,and hardware are just a few of the virtual computing resources that the infrastruc-ture service model offers,depending on what the client needs.One essential aspect of cloud computing that improves ...Networking,storage,and hardware are just a few of the virtual computing resources that the infrastruc-ture service model offers,depending on what the client needs.One essential aspect of cloud computing that improves resource allocation techniques is host load prediction.This difficulty means that hardware resource allocation in cloud computing still results in hosting initialization issues,which add several minutes to response times.To solve this issue and accurately predict cloud capacity,cloud data centers use prediction algorithms.This permits dynamic cloud scalability while maintaining superior service quality.For host prediction,we therefore present a hybrid convolutional neural network long with short-term memory model in this work.First,the suggested hybrid model is input is subjected to the vector auto regression technique.The data in many variables that,prior to analysis,has been filtered to eliminate linear interdependencies.After that,the persisting data are processed and sent into the convolutional neural network layer,which gathers intricate details about the utilization of each virtual machine and central processing unit.The next step involves the use of extended short-term memory,which is suitable for representing the temporal information of irregular trends in time series components.The key to the entire process is that we used the most appropriate activation function for this type of model a scaled polynomial constant unit.Cloud systems require accurate prediction due to the increasing degrees of unpredictability in data centers.Because of this,two actual load traces were used in this study’s assessment of the performance.An example of the load trace is in the typical dispersed system.In comparison to CNN,VAR-GRU,VAR-MLP,ARIMA-LSTM,and other models,the experiment results demonstrate that our suggested approach offers state-of-the-art performance with higher accuracy in both datasets.展开更多
This paper explores a tree kernel based method for semantic role labeling （SRL） of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependenc...This paper explores a tree kernel based method for semantic role labeling （SRL） of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependency-driven constituent parse tree （D-CPT）, is proposed to combine the advantages of both constituent and dependence parse trees. This is achieved by directly representing various kinds of dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT （Constituent Parse Tree）. In this way, D-CPT not only keeps the dependency relationship information in the dependency parse tree （DPT） structure but also retains the basic hierarchical structure of CPT style. Moreover, several schemes are designed to extract various kinds of necessary information, such as the shortest path between the nominal predicate and the argument candidate, the support verb of the nominal predicate and the head argument modified by the argument candidate, from D-CPT. This largely reduces the noisy information inherent in D-CPT. Finally, a convolution tree kernel is employed to compute the similarity between two parse trees. Besides, we also implement a feature-based method based on D-CPT. Evaluation on Chinese NomBank corpus shows that our tree kernel based method on D-CPT performs significantly better than other tree kernel-based ones and achieves comparable performance with the state-of-the-art feature-based ones. This indicates the effectiveness of the novel D-CPT structure in representing various kinds of dependency relations in a CPT-style structure and our tree kernel based method in exploring the novel D-CPT structure. This also illustrates that the kernel-based methods are competitive and they are complementary with the feature- based methods on SRL.展开更多
Frege argued that a predicate was a functional expression and the reference of it a concept, which as a predicative function had one or more empty places and was thus incomplete. Frege＇s view gives rise to what has b...Frege argued that a predicate was a functional expression and the reference of it a concept, which as a predicative function had one or more empty places and was thus incomplete. Frege＇s view gives rise to what has been known as the paradox of the concept ＂horse.＂ In order to resolve this paradox, I argue for an opposite view which retains the point that a predicate is a function, i.e. that a predicative function is complete in a sense. Specifically speaking, a predicate performing the function of a predicate has at least one empty place and has no reference, while a predicate performing the function of a subject does not have any empty place but does have a reference. Frege not only regarded a concept with one or more empty places as the reference of a predicate but also took a set of objects without any empty place to be the extension of a concept with one or more empty places. Thus, it presents a complex relationship between the reference of a predicate and its corresponding extension, leading to disharmony in his theory. I argue that this is because there is a major defect in Frege＇s theory of meaning, namely the neglect of common names. What he called extensions of concepts are actually extensions of common names, and the references of predicates and the extensions of common names have a substantial difference despite being closely related.展开更多
The pozzolanic activity of coal gangue, which is calcining at 500 to 1 000 ℃, differs distinctly. The simplex-centroid design with upper and lower bounds of component proportion is adopted to study the compressive st...The pozzolanic activity of coal gangue, which is calcining at 500 to 1 000 ℃, differs distinctly. The simplex-centroid design with upper and lower bounds of component proportion is adopted to study the compressive strength of mortars made with ternary blends of cement, activated coal gangue and fly ash. Based on the results of a minimum of seven design points, three special cubic polynomial models are used to establish the strength predicating equations at different ages for mortars. Five experimental checkpoints were also designed to verify the precision of the equations. The most frequent errors of the predicted values are within 3%. A simple and practical way is provided for determining the optimal proportion of two admixtures when they are used in concrete.展开更多
English and Chinese belong to different language families,employing two distinct syntactic systems.English is subject-prominent,following the pattern of subject first,then predicate;while Chinese is topic-prominent,sh...English and Chinese belong to different language families,employing two distinct syntactic systems.English is subject-prominent,following the pattern of subject first,then predicate;while Chinese is topic-prominent,showing much flexibility in word arrangement as well as the necessity of subject and predicate.展开更多
The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storin...The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storing,and retrieving essential information from the manufacturing stage.Data collected at sites are shared with others where execution automatedly occurs.The obtained information must be validated at manufacturing to avoid undesirable data losses during the de-manufacturing process.However,information sharing from the assembly level at the manufacturing stage to disassembly at the product end-of-life state is a major concern.The current research validates the information optimally to offer a minimum set of activities to complete the disassembly process.An optimal disassembly sequence plan(DSP)can possess valid information to organize the necessary actions in manufacturing.However,finding an optimal DSP is complex because of its combinatorial nature.The genetic algorithm(GA)is a widely preferred artificial intelligence(AI)algorithm to obtain a near-optimal solution for the DSP problem.The converging nature at local optima is a limitation in the traditional GA.This study improvised the GA workability by integrating with the proposed priori crossover operator.An optimality function is defined to reduce disassembly effort by considering directional changes as parameters.The enhanced GA method is tested on a real-time product to evaluate the performance.The obtained results reveal that diversity control depends on the operators employed in the disassembly attributes.The proposed method’s solution can be stored in the cloud and shared through IoT devices for effective resource allocation and disassembly for maximum recovery of the product.The effectiveness of the proposed enhanced GA method is determined by making a comparative assessment with traditional GA and other AI methods at different population sizes.展开更多
The present research deals with the problem of development of an integrated expert-analytical system for optimum selection of calculated oil-field-geophysical parameters of oil and gas deposits with the purpose of inc...The present research deals with the problem of development of an integrated expert-analytical system for optimum selection of calculated oil-field-geophysical parameters of oil and gas deposits with the purpose of increasing the accuracy of assessment of the reserves of oil and gas deposits. The purpose of the system is to make current adequate decisions on determining of oil-and-gas saturation of strata and future identification of the most significant methods for that, with these methods forming the foundation of knowledge bases for oil-and-gas deposits of the Apsheron peninsula of Azerbaijan. The system architecture allows for expanding the system with its subsequent transformation into a cluster of expert-analytical systems. A logical model of the proposed system is presented. The paper contains a detailed description of the mechanism of operation of the system as a whole and of its individual blocks. Mathematical and formal-logical bases of the intelligent system are explained. The system is equipped with a tool for dynamic statistical analysis of decisions made by it, with representation of the results in real-time mode. The results of the system testing on specific oil-and-gas deposit of the Apsheron peninsula of Azerbaijan in 2013 are given.展开更多
The purpose of reoptimization using approximation methods—application of knowledge about the solution of the initial instance I, provided to achieve a better quality of approximation (approximation ratio) of an algor...The purpose of reoptimization using approximation methods—application of knowledge about the solution of the initial instance I, provided to achieve a better quality of approximation (approximation ratio) of an algorithm for determining optimal or close to it solutions of some “minor” changes of instance I. To solve the problem Ins-Max-EkCSP-P (reoptimization of Max-EkCSP-P with the addition of one constraint) with approximation resistant predicate P exists a polynomial threshold (optimal) -approximation algorithm, where the threshold “random” approximation ratio of P). When the unique games conjecture (UGC) is hold there exists a polynomial threshold (optimal) -approximation algorithm (where and the integrality gap of semidefinite relaxation of Max-EkCSP-P problem Z) to solve the problem Ins-Max-EkCSP-P.展开更多
The subjunctive mood is one of the most difficult English grammar items for most English learners. In this thesis,the author discusses the usage of the subjunctive mood in English,especially its usage in English subor...The subjunctive mood is one of the most difficult English grammar items for most English learners. In this thesis,the author discusses the usage of the subjunctive mood in English,especially its usage in English subordinate clauses. At the same time,the author provides a lot of examples. In the author's opinion,as long as the English learners find out the rules of it and practice it more,they will definitely grasp the subjunctive mood and use it correctly and skillfully.展开更多
In this paper, a formal approach based on predicate logic is proposed for representing and reasoning of trusted computing models. Predicates are defined to represent the characteristics of the objects and the relation...In this paper, a formal approach based on predicate logic is proposed for representing and reasoning of trusted computing models. Predicates are defined to represent the characteristics of the objects and the relationship among these objects in a trusted system according to trusted computing specifications. Inference rules of trusted relation are given too. With the semantics proposed, some trusted computing models are formalized and verified, which shows that Predicate calculus logic provides a general and effective method for modeling and reasoning trusted computing systems.展开更多
Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the ...Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.展开更多
Ebis is the intelligent environmental biotechnological informatics software developed for judging the effectiveness of the microorganism strain in the industrial wastewater treatment system(IWTS) at the optimal status...Ebis is the intelligent environmental biotechnological informatics software developed for judging the effectiveness of the microorganism strain in the industrial wastewater treatment system(IWTS) at the optimal status. The parameter, as the objective function for the judgment, is the minimum reactor volume( V _ min ) calculated by Ebis for microorganism required in wastewater treatment. The rationality and the universality of Ebis were demonstrated in the domestic sewage treatment system(DSTS) with the data published in USA and China at first,then Fhhh strain's potential for treating the purified terephthalic acid(PTA) was proved. It suggests that Ebis would be useful and universal for predicating the technique effectiveness in both DSTS and IWTS.展开更多
It has been known that the productivity of artesian wells is strongly dependent on the rheological properties of crude oils. This work targets two deep artesian wells(>5000 m) that are producing heavy crude oil. Th...It has been known that the productivity of artesian wells is strongly dependent on the rheological properties of crude oils. This work targets two deep artesian wells(>5000 m) that are producing heavy crude oil. The impacts of well conditions including temperature, pressure and shear rate, on the crude oil rheology were comprehensively investigated and correlated using several empirical rheological models. The experimental data indicate that this heavy oil is very sensitive to temperature as result of microstructure change caused by hydrogen bonding. The rheological behavior of the heavy oil is also significantly impacted by the imposed pressure, i.e., the viscosity flow activation energy(Eμ) gently increases with the increasing pressure. The viscosity–shear rate data are well fitted to the power law model at low temperature. However, due to the transition of fluid feature at high temperature(Newtonian fluid), the measured viscosity was found to slightly deviate from the fitting data. Combining the evaluated correlations, the viscosity profile of the heavy crude oil in these two deep artesian wells as a function of well depth was predicted using the oilfield producing data.展开更多
Due to the nature of ultra-short-acting opioid remifentanil of high time-varying,complex compartment model and low-accuracy of plasma concentration prediction,the traditional estimation method of population pharmacoki...Due to the nature of ultra-short-acting opioid remifentanil of high time-varying,complex compartment model and low-accuracy of plasma concentration prediction,the traditional estimation method of population pharmacokinetics parameters,nonlinear mixed effects model(NONMEM),has the abuses of tedious work and plenty of man-made jamming factors.The Elman feedback neural network was built.The relationships between the patients’plasma concentration of remifentanil and time,patient’age,gender,lean body mass,height,body surface area,sampling time,total dose,and injection rate through network training were obtained to predict the plasma concentration of remifentanil,and after that,it was compared with the results of NONMEM algorithm.In conclusion,the average error of Elman network is 6.34%,while that of NONMEM is 18.99%.The absolute average error of Elman network is 27.07%,while that of NONMEM is 38.09%.The experimental results indicate that Elman neural network could predict the plasma concentration of remifentanil rapidly and stably,with high accuracy and low error.For the characteristics of simple principle and fast computing speed,this method is suitable to data analysis of short-acting anesthesia drug population pharmacokinetic and pharmacodynamics.展开更多
To solve the shortage problem of the semantic descrip- tion scope and verification capability existed in the security policy, a semantic description method for the security policy based on ontology is presented. By de...To solve the shortage problem of the semantic descrip- tion scope and verification capability existed in the security policy, a semantic description method for the security policy based on ontology is presented. By defining the basic elements of the security policy, the relationship model between the ontology and the concept of security policy based on the Web ontology language （OWL） is established, so as to construct the semantic description framework of the security policy. Through modeling and reasoning in the Protege, the ontology model of authorization policy is proposed, and the first-order predicate description logic is introduced to the analysis and verification of the model. Results show that the ontology-based semantic description of security policy has better flexibility and practicality.展开更多
基金supported byOpen Foundation of Key Laboratory of Cyberspace Security,Ministry of Education of China(No.KLCS20240211)Henan Science and Technology Major Project No.241110210100.
文摘Code obfuscation is a crucial technique for protecting software against reverse engineering and security attacks.Among various obfuscation methods,opaque predicates,which are recognized as flexible and promising,are widely used to increase control-flow complexity.However,traditional opaque predicates are increasingly vulnerable to Dynamic Symbolic Execution(DSE)attacks,which can efficiently identify and eliminate them.To address this issue,this paper proposes a novel approach for anti-DSE opaque predicates that effectively resists symbolic execution-based deobfuscation.Our method introduces two key techniques:single-way function opaque predicates,which leverage hash functions and logarithmic transformations to prevent constraint solvers from generating feasible inputs,and path-explosion opaque predicates,which generate an excessive number of execution paths,overwhelming symbolic execution engines.To evaluate the effectiveness of our approach,we implemented a prototype obfuscation tool and tested it against prominent symbolic execution engines.Experimental results demonstrate that our approach signifi-cantly increases resilience against symbolic execution attacks while maintaining acceptable performance overhead.This paper provides a robust and scalable obfuscation technique,contributing to the enhancement of software protection strategies in adversarial environments.
基金National Key Research and Development Program of China(2021YFB3101402)National Natural Science Foundation of China(62202294)。
文摘This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals nothing about the predicate f,as long as f is drawn from an evasive distribution with sufficient entropy.The proposed scheme extends the group-based public-key function-private predicate encryption(FP-PE)for“small superset predicates”proposed by Bartusek et al.(Asiacrypt 19),to the setting of inner-product predicates.This is the first construction of public-key FP-PE with enhanced function privacy security beyond the equality predicates,which is previously proposed by Boneh et al.(CRYPTO 13).The proposed construction relies on bilinear groups,and the security is proved in the generic bilinear group model.
基金funded by Multimedia University(Ref:MMU/RMC/PostDoc/NEW/2024/9804).
文摘Networking,storage,and hardware are just a few of the virtual computing resources that the infrastruc-ture service model offers,depending on what the client needs.One essential aspect of cloud computing that improves resource allocation techniques is host load prediction.This difficulty means that hardware resource allocation in cloud computing still results in hosting initialization issues,which add several minutes to response times.To solve this issue and accurately predict cloud capacity,cloud data centers use prediction algorithms.This permits dynamic cloud scalability while maintaining superior service quality.For host prediction,we therefore present a hybrid convolutional neural network long with short-term memory model in this work.First,the suggested hybrid model is input is subjected to the vector auto regression technique.The data in many variables that,prior to analysis,has been filtered to eliminate linear interdependencies.After that,the persisting data are processed and sent into the convolutional neural network layer,which gathers intricate details about the utilization of each virtual machine and central processing unit.The next step involves the use of extended short-term memory,which is suitable for representing the temporal information of irregular trends in time series components.The key to the entire process is that we used the most appropriate activation function for this type of model a scaled polynomial constant unit.Cloud systems require accurate prediction due to the increasing degrees of unpredictability in data centers.Because of this,two actual load traces were used in this study’s assessment of the performance.An example of the load trace is in the typical dispersed system.In comparison to CNN,VAR-GRU,VAR-MLP,ARIMA-LSTM,and other models,the experiment results demonstrate that our suggested approach offers state-of-the-art performance with higher accuracy in both datasets.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61331011 and 61273320the National High Technology Research and Development 863 Program of China under Grant No.2012AA011102the Natural Science Foundation of Jiangsu Provincial Department of Education under Grant No.10KJB520016
文摘This paper explores a tree kernel based method for semantic role labeling （SRL） of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependency-driven constituent parse tree （D-CPT）, is proposed to combine the advantages of both constituent and dependence parse trees. This is achieved by directly representing various kinds of dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT （Constituent Parse Tree）. In this way, D-CPT not only keeps the dependency relationship information in the dependency parse tree （DPT） structure but also retains the basic hierarchical structure of CPT style. Moreover, several schemes are designed to extract various kinds of necessary information, such as the shortest path between the nominal predicate and the argument candidate, the support verb of the nominal predicate and the head argument modified by the argument candidate, from D-CPT. This largely reduces the noisy information inherent in D-CPT. Finally, a convolution tree kernel is employed to compute the similarity between two parse trees. Besides, we also implement a feature-based method based on D-CPT. Evaluation on Chinese NomBank corpus shows that our tree kernel based method on D-CPT performs significantly better than other tree kernel-based ones and achieves comparable performance with the state-of-the-art feature-based ones. This indicates the effectiveness of the novel D-CPT structure in representing various kinds of dependency relations in a CPT-style structure and our tree kernel based method in exploring the novel D-CPT structure. This also illustrates that the kernel-based methods are competitive and they are complementary with the feature- based methods on SRL.
文摘Frege argued that a predicate was a functional expression and the reference of it a concept, which as a predicative function had one or more empty places and was thus incomplete. Frege＇s view gives rise to what has been known as the paradox of the concept ＂horse.＂ In order to resolve this paradox, I argue for an opposite view which retains the point that a predicate is a function, i.e. that a predicative function is complete in a sense. Specifically speaking, a predicate performing the function of a predicate has at least one empty place and has no reference, while a predicate performing the function of a subject does not have any empty place but does have a reference. Frege not only regarded a concept with one or more empty places as the reference of a predicate but also took a set of objects without any empty place to be the extension of a concept with one or more empty places. Thus, it presents a complex relationship between the reference of a predicate and its corresponding extension, leading to disharmony in his theory. I argue that this is because there is a major defect in Frege＇s theory of meaning, namely the neglect of common names. What he called extensions of concepts are actually extensions of common names, and the references of predicates and the extensions of common names have a substantial difference despite being closely related.
基金The National Basic Research Program of China (973Program)(No2000CB610703)
文摘The pozzolanic activity of coal gangue, which is calcining at 500 to 1 000 ℃, differs distinctly. The simplex-centroid design with upper and lower bounds of component proportion is adopted to study the compressive strength of mortars made with ternary blends of cement, activated coal gangue and fly ash. Based on the results of a minimum of seven design points, three special cubic polynomial models are used to establish the strength predicating equations at different ages for mortars. Five experimental checkpoints were also designed to verify the precision of the equations. The most frequent errors of the predicted values are within 3%. A simple and practical way is provided for determining the optimal proportion of two admixtures when they are used in concrete.
文摘English and Chinese belong to different language families,employing two distinct syntactic systems.English is subject-prominent,following the pattern of subject first,then predicate;while Chinese is topic-prominent,showing much flexibility in word arrangement as well as the necessity of subject and predicate.
基金The authors are grateful to the Raytheon Chair for Systems Engineering for funding.
文摘The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storing,and retrieving essential information from the manufacturing stage.Data collected at sites are shared with others where execution automatedly occurs.The obtained information must be validated at manufacturing to avoid undesirable data losses during the de-manufacturing process.However,information sharing from the assembly level at the manufacturing stage to disassembly at the product end-of-life state is a major concern.The current research validates the information optimally to offer a minimum set of activities to complete the disassembly process.An optimal disassembly sequence plan(DSP)can possess valid information to organize the necessary actions in manufacturing.However,finding an optimal DSP is complex because of its combinatorial nature.The genetic algorithm(GA)is a widely preferred artificial intelligence(AI)algorithm to obtain a near-optimal solution for the DSP problem.The converging nature at local optima is a limitation in the traditional GA.This study improvised the GA workability by integrating with the proposed priori crossover operator.An optimality function is defined to reduce disassembly effort by considering directional changes as parameters.The enhanced GA method is tested on a real-time product to evaluate the performance.The obtained results reveal that diversity control depends on the operators employed in the disassembly attributes.The proposed method’s solution can be stored in the cloud and shared through IoT devices for effective resource allocation and disassembly for maximum recovery of the product.The effectiveness of the proposed enhanced GA method is determined by making a comparative assessment with traditional GA and other AI methods at different population sizes.
文摘The present research deals with the problem of development of an integrated expert-analytical system for optimum selection of calculated oil-field-geophysical parameters of oil and gas deposits with the purpose of increasing the accuracy of assessment of the reserves of oil and gas deposits. The purpose of the system is to make current adequate decisions on determining of oil-and-gas saturation of strata and future identification of the most significant methods for that, with these methods forming the foundation of knowledge bases for oil-and-gas deposits of the Apsheron peninsula of Azerbaijan. The system architecture allows for expanding the system with its subsequent transformation into a cluster of expert-analytical systems. A logical model of the proposed system is presented. The paper contains a detailed description of the mechanism of operation of the system as a whole and of its individual blocks. Mathematical and formal-logical bases of the intelligent system are explained. The system is equipped with a tool for dynamic statistical analysis of decisions made by it, with representation of the results in real-time mode. The results of the system testing on specific oil-and-gas deposit of the Apsheron peninsula of Azerbaijan in 2013 are given.
文摘The purpose of reoptimization using approximation methods—application of knowledge about the solution of the initial instance I, provided to achieve a better quality of approximation (approximation ratio) of an algorithm for determining optimal or close to it solutions of some “minor” changes of instance I. To solve the problem Ins-Max-EkCSP-P (reoptimization of Max-EkCSP-P with the addition of one constraint) with approximation resistant predicate P exists a polynomial threshold (optimal) -approximation algorithm, where the threshold “random” approximation ratio of P). When the unique games conjecture (UGC) is hold there exists a polynomial threshold (optimal) -approximation algorithm (where and the integrality gap of semidefinite relaxation of Max-EkCSP-P problem Z) to solve the problem Ins-Max-EkCSP-P.
文摘The subjunctive mood is one of the most difficult English grammar items for most English learners. In this thesis,the author discusses the usage of the subjunctive mood in English,especially its usage in English subordinate clauses. At the same time,the author provides a lot of examples. In the author's opinion,as long as the English learners find out the rules of it and practice it more,they will definitely grasp the subjunctive mood and use it correctly and skillfully.
基金Supported by the National High-Technology Re-search and Development Program ( 863 Program)China(2004AA113020)
文摘In this paper, a formal approach based on predicate logic is proposed for representing and reasoning of trusted computing models. Predicates are defined to represent the characteristics of the objects and the relationship among these objects in a trusted system according to trusted computing specifications. Inference rules of trusted relation are given too. With the semantics proposed, some trusted computing models are formalized and verified, which shows that Predicate calculus logic provides a general and effective method for modeling and reasoning trusted computing systems.
基金National Natural Science Foundation of China (No. 60875034)Spanish Ministry of Education and Science Fund,Spain (No.TIN-2009-0828)Spanish Regional Government (Junta de Andalucia) Fund,Spain (No. P08-TIC-3548)
文摘Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.
文摘Ebis is the intelligent environmental biotechnological informatics software developed for judging the effectiveness of the microorganism strain in the industrial wastewater treatment system(IWTS) at the optimal status. The parameter, as the objective function for the judgment, is the minimum reactor volume( V _ min ) calculated by Ebis for microorganism required in wastewater treatment. The rationality and the universality of Ebis were demonstrated in the domestic sewage treatment system(DSTS) with the data published in USA and China at first,then Fhhh strain's potential for treating the purified terephthalic acid(PTA) was proved. It suggests that Ebis would be useful and universal for predicating the technique effectiveness in both DSTS and IWTS.
基金Supported by the National Key Science&Technology Projects during 13th Five-Year Plan(2016ZX05053-003)Young Scholars Development fund of SWPU(201499010121)
文摘It has been known that the productivity of artesian wells is strongly dependent on the rheological properties of crude oils. This work targets two deep artesian wells(>5000 m) that are producing heavy crude oil. The impacts of well conditions including temperature, pressure and shear rate, on the crude oil rheology were comprehensively investigated and correlated using several empirical rheological models. The experimental data indicate that this heavy oil is very sensitive to temperature as result of microstructure change caused by hydrogen bonding. The rheological behavior of the heavy oil is also significantly impacted by the imposed pressure, i.e., the viscosity flow activation energy(Eμ) gently increases with the increasing pressure. The viscosity–shear rate data are well fitted to the power law model at low temperature. However, due to the transition of fluid feature at high temperature(Newtonian fluid), the measured viscosity was found to slightly deviate from the fitting data. Combining the evaluated correlations, the viscosity profile of the heavy crude oil in these two deep artesian wells as a function of well depth was predicted using the oilfield producing data.
基金Project(31200748)supported by the National Natural Science Foundation of China
文摘Due to the nature of ultra-short-acting opioid remifentanil of high time-varying,complex compartment model and low-accuracy of plasma concentration prediction,the traditional estimation method of population pharmacokinetics parameters,nonlinear mixed effects model(NONMEM),has the abuses of tedious work and plenty of man-made jamming factors.The Elman feedback neural network was built.The relationships between the patients’plasma concentration of remifentanil and time,patient’age,gender,lean body mass,height,body surface area,sampling time,total dose,and injection rate through network training were obtained to predict the plasma concentration of remifentanil,and after that,it was compared with the results of NONMEM algorithm.In conclusion,the average error of Elman network is 6.34%,while that of NONMEM is 18.99%.The absolute average error of Elman network is 27.07%,while that of NONMEM is 38.09%.The experimental results indicate that Elman neural network could predict the plasma concentration of remifentanil rapidly and stably,with high accuracy and low error.For the characteristics of simple principle and fast computing speed,this method is suitable to data analysis of short-acting anesthesia drug population pharmacokinetic and pharmacodynamics.
基金Supported by the National Natural Science Foundation of China(61462020,61363006,61163057)the Guangxi Experiment Center of Information Science Foundation(20130329)the Guangxi Natural Science Foundation(2014GXNSFAA118375)
文摘To solve the shortage problem of the semantic descrip- tion scope and verification capability existed in the security policy, a semantic description method for the security policy based on ontology is presented. By defining the basic elements of the security policy, the relationship model between the ontology and the concept of security policy based on the Web ontology language （OWL） is established, so as to construct the semantic description framework of the security policy. Through modeling and reasoning in the Protege, the ontology model of authorization policy is proposed, and the first-order predicate description logic is introduced to the analysis and verification of the model. Results show that the ontology-based semantic description of security policy has better flexibility and practicality.
