Optimization of fractional composition of the excipient in the elastomeric covering for asphalt highways by E. M. Nurullaev, A. S. Ermilov

“…The computational method of optimum fractional composition of a dispersible filler of polymeric composite on the basis of three-dimensionally linked elastomer is developed according to non-linear programming. The coefficient of dynamic viscosity of polymeric suspension or the initial module of a viscoelasticity of the join solidification low-molecular rubbers with the final functional groups, filled by many fractional dioxide of silicon are considered as criteria of optimization. …”
Get full text

Optimization mechanism for network-coding based on rate-match by Zan-qiang DONG, Su-bin SHEN, Yan-qin MAO

“…The mechanism achieves the rate m olution of the linear programming func-tion on data transport rate and the introduction of the data ticket parameter in coding-aware multi-path routing. …”
Get full text

Energy efficient optimal sink position selection algorithm for multi-sink wireless sensor networks by TANG Wei, GUO Wei

“…In combination with the energy efficient routing algorithm,the optimal sink position selection problem was studied,which aimed to minimize the overall network energy consumption.When the candidate set of sink positions is finite,the problem is shown to be an integer linear programming problem,when the candidate set is the whole space,the problem is shown to be a nonlinear programming problem.Due to the NP-completeness of the problems,several heuristic algorithms were designed accordingly.The proposed algorithms were examined by extensive simulation experiments,the results show that the performances of presented algorithms are close to the optimality.…”
Get full text

A Fast Approach to Bimatrix Games with Intuitionistic Fuzzy Payoffs by Min Fan, Ping Zou, Shao-Rong Li, Chin-Chia Wu

“…Thirdly, Nash equilibrium of the algorithm was proved by the fixed point theory and the algorithm was simplified by linear programming methods. Finally, an example was solved through Matlab; it showed the validity, applicability, and superiority.…”
Get full text

Delay and energy minimization for MEC-based secure communication by Pinyi REN, Qian XU

“…Considering a physical-layer-security-aided confidential document transmission problem,a secure transmission strategy was proposed where the base station equipped with a mobile edge computing (MEC) server served as a relay to help compress,forward,and decompress.First,the Poisson point process was used to calculate the secure transmission probability for the scenario with multiple potential eavesdroppers.Then,a delay and energy minimization problem was formulated under a constraint on the two-hop secure transmission probability.The optimal compression and decompression scheme was obtained using the one-dimensional search combined with linear programming.Simulation results show that the document compression is necessary for the link with small achievable secrecy rate under a given secure transmission probability; otherwise,the document should be directly transmitted without compression.…”
Get full text

Multicast service protection algorithm based on elastic optical network by Jingjing WU, Jianfang ZHANG

“…With the rapid growth of the network traffic,the elastic optical network (EON) has been proposed as a promising solution due to its high spectrum efficiency and flexible bandwidth provision.Meanwhile,multicast routing and spectrum allocation,and the survivability of the network become more challenging than that in the conventional optical network.The routing for multicast traffic and its protection algorithm in EON was investigated.An integer linear programming (ILP) formulation with the objective to minimize total spectrum consumption was presented.In addition,a heuristic algorithm called multicast sub-tree protection algorithm (MSPA) to achieve sufficient protection and satisfy resources savings was designed.The simulation results demonstrate that comparing with the traditional multicast routing and protection algorithm,MSPA performs well in improving the blocking probability and the spectrum utilization of the network.…”
Get full text

Dynamic fair allocation of multi-resources based on shared resource quantity by Xiao-lu ZHANG, Xi LIU, Wei-dong LI, Xue-jie ZHANG

“…A dynamic fair allocation of multi-resources was proposed based on shared resource quantity for multi-resoures allocation problem in cloud shared computing system. Firstly, a linear programming model was given based on resource requirements and quantity of shared resource and this model was further proved which satisfies four fairness properties such as DPO, SI, DEF and SP. …”
Get full text

A Proposed Method for Solving Fuzzy System of Linear Equations by Reza Kargar, Tofigh Allahviranloo, Mohsen Rostami-Malkhalifeh, Gholam Reza Jahanshaloo

“…The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.…”
Get full text

Graph partition based mapping algorithm on multiprocessors for streaming applications by Qi TANG, Shang-feng WU, Jun-wu SHI, Ji-bo WEI

“…To take advantage of multiprocessor platform,it is a necessity to map tasks of the application properly onto different processors to exploit the concurrency in the application and thus meet the stringent timing requirements.Parallelism graph was proposed to quantify and model the concurrency among tasks of the application.An algorithm was also proposed to construct the parallelism graph based on the self-timed schedule and transform the mapping problem to a graph partitioning problem.The graph partitioning problem as a pure 0-1 integer linear programming model was further formulated and the ILP solver to find the optimal result.A lot of randomly generated synchronous dataflow graphs and a set of practical applications were used to evaluate the performance of the proposed method.The experimental results demonstrate that the proposed method outperforms available algorithms.…”
Get full text

Development of model of optimal control of water supply system by A. D. Taghiyeva

“…To control the system, the problem of optimal distribution of products is developed whereas non-linear programming problems are applied. We consider a system for providing products, consisting of magistral and distribution pipelines, taking products from the magistral pipeline. …”
Get full text

QGA-based network service extension algorithm in NFV by Hang QIU, Hongbo TANG, Wei YOU, Yu ZHAO, Yi BAI

“…To meet the client’s new business requirements or add additional security protection functions, the already hosted network service extension problem in the cloud network based on network function virtualization was researched.The network service extension in the cloud network was modeled as an integer linear programming, considering the impact on initial service, extended graph deployment, resource capacity and virtual network function affinity constraints, and so on.To deal with the computational complexity and dynamism of future large-scale cloud networks, a QGA-based network service extension algorithm was proposed to improve solution efficiency and solution quality through quantum parallel computing.Simulation results prove that the efficient performance of the proposed algorithm in terms of extension successful ratio and average resource costs, and the proposed algorithm has low time complexity.…”
Get full text

Topology design and capacity planning of wide-area network based on delay constraint by Xiaoqing XU, Hong TANG, Ke RUAN, Juan WU, Xiaojun LIU

“…In order to optimize network performance and reduce construction cost, the topology design and dimensioning problems in wide-area network planning were investigated based on delay constraint with the use of linear programming (LP) and heuristic greedy-drop algorithm.Firstly, demands’ weights were considered and LP was exploited with given paths to solve the capacity expansion problems of minimum delay and minimum delay with minimum cost.Secondly, greedy-drop algorithm was applied and candidate edges were removed from full mesh topology according to the global normalized delay increments.Thus, new added edges to satisfy the delay constraint were determined.Moreover, the combination of LP and greedy-drop algorithm was proposed to determine new added edges and capacity expansion of the delay-constraint scenario with minimum cost.The results turn out that the proposed algorithms are effective to solve the problems of topology design and capacity planning in wide-area network planning targeting delay optimization.…”
Get full text

Dynamic heterogeneous scheduling method based on Stackelberg game model in container cloud by Wei ZENG, Hongchao HU, Lingshu LI, Shumin HUO

“…Container technology promotes the rapid development of cloud computing with its flexible and efficient features, but it also introduces security threats such as co-resident attacks, escape attacks, and common mode attacks.In response to these security threats, a dynamic heterogeneous scheduling method based on Stackelberg game in the container cloud was proposed.First, a heterogeneous mirrored resource pool is constructed to suppress the spread of attacks based on common-mode vulnerabilities on the cloud.Then, the offensive and defense interaction process is modeled as a Stackelberg game model.Finally, the offensive and defensive model is analyzed, and the system scheduling problem is modeled as a mixed integer non-linear programming problem to solve the system's optimal scheduling strategy.Experiments show that the proposed method can improve the defense effect of the cloud platform and reduce the system defense overhead.…”
Get full text

Profitable portfolio using fermatean fuzzy numbers by Amal Adak, Manish Gunjan

“…In this study, we discuss the portfolio's risk amount, rate of risk-return, and expected return rate under a Fermatean fuzzy environment. A linear programming problem is used to formulate a Fermatean fuzzy portfolio. …”
Get full text

Usage of computer algebra in teaching process by Aleksas Domarkas, Gintautas Misevičius, Violeta Pakalnytė, Albertas Pincevičius, Rimantas-Jonas Rakauskas

“…Namely, it is the problems of linear algebra, analyse of graphs, numerical calculation, integration, solution of differential equations, statistics for management, linear programming. The authors share his experience of utilising of computer algebra to effect the education of cadets. …”
Get full text

Problem of the dynamic topology architecture of rechargeable wireless sensor networks by Xu DING, Jiang-hong HAN, Lei SHI, Wei XIA, Zhen-chun WEI

“…The time-varying dynamic topology model for rechargeable wireless sensor networks is proposed in accordance with the scenario that the wireless charging equipment plays the role of a data collector while charging sensor nodes at the meantime.An optimization problem aiming to maximize the vacation time ratio of the wireless charging equipment is then raised from the study of the model established.Through comprehensively analyzing of the working states and constraints of different sensor nodes as well as the wireless charging equipment during different time instances,the multi-phase linear programming problem with the identical optimality is then obtained.The optimal dynamic data routing schemes of different phases compatible with the dynamic topology architecture are acquired from solving this optimization problem.What is more,the working strategies of the wireless charging/data collecting equipment are also obtained,simultaneously.Compared with the results of the previous work,the objective values are increased by no less than 20%.…”
Get full text

Orchestration mechanism for VNF hardware acceleration resources in SDN/NFV architecture by Tong DUAN, Julong LAN, Yuxiang HU, Hongwei FAN

“…The hardware acceleration mechanism for VNF (virtual network function) is recently a hot research topic in SDN/NFV architecture because of the low processing performance of VNF.Once hardware acceleration resources have been plugged into the network,how to optimally mange and orchestrate these resources under service requirements remains a question to be solved.Firstly,a unified management architecture based on separated control for hardware acceleration resources was proposed.Then,traditional network topology together with hardware acceleration resources were modeled into a unified network model and then the hardware acceleration resource orchestration problem was transferred into a multi-objective linear programming problem.Finally,a hardware-accelerator-card-prior’ heuristic algorithm was designed.Experimental results show that compared with existing methods,the proposed orchestration mechanism can efficiently manage hardware acceleration resources and reduce the processing latency by 30%.…”
Get full text

A Benders Decomposition Algorithm for the Passenger Train Service Planning by Song Pu

“…In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. …”
Get full text

NEW PROFILE MODIFICATION METHOD OF NON⁃UNIFORM MESHES BASED ON SHAPE FUNCTION by LIU Meng, GANG XianYue, CHE YeJun, MENG Peng, ZHANG Fan

“…A new profile modification method of non⁃uniform meshes was proposed to solve the problem of premature failure of mechanical components due to uneven contact pressure distribution.Based on the element shape function and"virtual nodes",a formula was developed to formulate the mechanical relation between the contact nodes of the non⁃uniform mesh,a mathematical equation was derived to formulate the correspondence between the node modification and the contact pressure,and a minimax model was developed to solve the modification by minimizing the maximum contact pressure.In order to improve global convergence and computational efficiency of the modification calculation,the minimax model was transformed into a linear programming model.The applicability and effectiveness of this new profile modification method for general elastic contact modification problems was verified by three elastic contact modification examples.…”
Get full text

A New Approach for Solving Fully Fuzzy Linear Systems by Amit Kumar, Neetu, Abhinav Bansal

“…The method incorporates the principles of linear programming in solving an FFLS with arbitrary coefficients and is not only easier to understand but also widens the scope of fuzzy linear equations in scientific applications. …”
Get full text