Using the Method of Maximizing Deviation to Make Decision for M ultiindices

This paper takes the synthesizing evaluation about industrial economic benefits by examples and proposes a new method named maximizing deviation method for multiindices decision. The new method can automatically determine the weight coefficients among the multiindices and also can obtain the exact and reliable evaluation results without subjectivity.

Maximizing deviation method for multiple attribute decision making under q-rung orthopair fuzzy environment

Because of the uncertainty and subjectivity of decision makers in the complex decision-making environment,the evaluation information of alternatives given by decision makers is often fuzzy and uncertain.As a generalization of intuitionistic fuzzy set(IFSs)and Pythagoras fuzzy set(PFSs),q-rung orthopair fuzzy set(q-ROFS)is more suitable for expressing fuzzy and uncertain information.But,in actual multiple attribute decision making(MADM)problems,the weights of DMs and attributes are always completely unknown or partly known,to date,the maximizing deviation method is a good tool to deal with such issues.Thus,combine the q-ROFS and conventional maximizing deviation method,we will study the maximizing deviation method under q-ROFSs and q-RIVOFSs in this paper.Firstly,we briefly introduce the basic concept of q-rung orthopair fuzzy sets(q-ROFSs)and q-rung interval-valued orthopair fuzzy sets(q-RIVOFSs).Then,combine the maximizing deviation method with q-rung orthopair fuzzy information,we establish two new decision making models.On this basis,the proposed models are applied to MADM problems with q-rung orthopair fuzzy information.Compared with existing methods,the effectiveness and superiority of the new model are analyzed.This method can effectively solve the MADM problem whose decision information is represented by q-rung orthopair fuzzy numbers(q-ROFNs)and whose attributes are incomplete.

A VMIMO-Based Cooperative Routing Algorithm for Maximizing Network Lifetime

Energy efficiency is an important criterion for routing algorithms in the wireless sensor network. Cooperative routing can reduce energy consumption effectively stemming from its diversity gain advantage. To solve the energy consumption problem and maximize the network lifetime, this paper proposes a Virtual Multiple Input Multiple Output based Cooperative Routing algorithm(VMIMOCR). VMIMOCR chooses cooperative relay nodes based on Virtual Multiple Input Multiple Output Model, and balances energy consumption by reasonable power allocation among transmitters, and decides the forwarding path finally. The experimental results show that VMIMOCR can improve network lifetime from 37% to 348% in the medium node density, compared with existing routing algorithms.

DESIGN OF SPARSE ARRAY FOR MAD IMAGING BASED ON MAXIMIZING INFORMATION CAPACITY

In past years,growing efforts have been made to the rapid interpretation of magnetic field data acquired by a sparse synthetic or real magnetic sensor array.An appealing requirement on such sparse array arranged within a specified survey region is that to make the number of sensor elements as small as possible,meanwhile without deteriorating imaging quality.For this end,we propose a novel methodology of arranging sensors in an optimal manner,exploring the concept of information capacity developed originally in the communication society.The proposed scheme reduces mathematically the design of a sparse sensor array into solving a combinatorial optimization problem,which can be resolved efficiently using widely adopted Simultaneous Perturbation and Statistical Algorithm(SPSA).Three sets of numerical examples of designing optimal sensor array are provided to demonstrate the performance of proposed methodology.

Maximizing Resilient Throughput in Peer-to-Peer Network

A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to consider fault resilience in peer selection, little understanding is achieved regarding the solvability and solution complexity of this problem from the optimization perspective. To this end, we propose an optimization framework based on the generalized flow theory. Key concepts introduced by this framework include resilience factor, resilience index, and generalized throughput, which collectively model the peer resilience in a probabilistic measure. Under this framework, we divide the domain of optimal peer selection along several dimensions including network topology, overlay organization, and the definition of resilience factor and generalized flow. Within each sub-problem, we focus on studying the problem complexity and finding optimal solutions. Simulation study is also performed to evaluate the effectiveness of our model and performance of the proposed algorithms.

Maximizing Comparative Advantages

China＇s domestic market and locally manufactured products set to drive future economic growth

Maximizing Influence in Temporal Social Networks:A Node Feature-Aware Voting Algorithm

Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social networks.To bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation model.Firstly,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes selection.Specifically,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their features.During the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability accordingly.The process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based algorithms.Secondly,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node features.Finally,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.

Adaptive Algorithms on Maximizing Monotone Nonsubmodular Functions

Submodular optimization is widely used in large datasets.In order to speed up the problems solving,it is essential to design low-adaptive algorithms to achieve acceleration in parallel.In general,the function values are given by a value oracle,but in practice,the oracle queries may consume a lot of time.Hence,how to strike a balance between optimizing them is important.In this paper,we focus on maximizing a normalized and strictly monotone set function with the diminishing-return ratio under a cardinality constraint,and propose two algorithms to deal with it.We apply the adaptive sequencing technique to devise the first algorithm,whose approximation ratio is arbitrarily close to 1-e^(-γ)in O(logn·log(log k/γ)) adaptive rounds,and requires O(logn^(2)·log(log k/γ)) queries.Then by adding preprocessing and parameter estimation steps to the first algorithm,we get the second one.The second algorithm trades a small sacrifice in adaptive complexity for a significant improvement in query complexity.With the same approximation and adaptive complexity,the query complexity is improved to.To the best of our knowledge,this is the first paper of designing adaptive algorithms for maximizing a monotone function using the diminishing-return ratio.

A Variant of Multi-task n-vehicle Exploration Problem: Maximizing Every Processor's Average Profit

We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor＇s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.

Delivering an Intelligent Foundation for RFID: Maximizing Network Efficiency with Cisco RFID Solutions

Radio frequency identification (RFID) is one of today s most anticipated technologies for a broad range of enterprises. Based on the promise of lower operating costs combined with more accurate product and asset information, organizations .Rfrom manufacturers to government agencies, retailers to healthcare providers , Rare introducing RFID technologies in the supply chain, for asset tracking and management, and for security and regulatory purposes.

Budget Allocation for Maximizing Viral Advertising in Social Networks

Viral advertising in social networks has arisen as one of the most promising ways to increase brand awareness and product sales. By distributing a limited budget, we can incentivize a set of users as initial adopters so that the advertising can start from the initial adopters and spread via sociM links to become viral. Despite extensive researches in how to target the most influential users, a key issue is often neglected： how to incentivize the initial adopters. In the problem of influence maximization, the assumption is that each user has a fixed cost for being initial adopters, while in practice, user decisions for accepting the budget to be initial adopters are often probabilistic rather than deterministic. In this paper, we study optimal budget allocation in social networks to maximize the spread of viral advertising. In particular, a concave probability model is introduced to characterize each user＇s utility for being an initial adopter. Under this model, we show that it is NP-hard to find an optimal budget allocation for maximizing the spread of viral advertising. We then present a novel discrete greedy algorithm with near optimal performance, and further propose scaling-up techniques to improve the time-efficiency of our algorithm. Extensive experiments on real-world social graphs are implemented to validate the effectiveness of our algorithm in practice. The results show that our algorithm can outperform other intuitive heuristics significantly in almost all cases.

Maximizing Spectral Radius of Trees with Given Maximal Degree

In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respectively.

MAXIMIZING THE VALUE OF VIDEO IN ELT IN THE CHINESE CONTEXT

The advantages and possible limitations of using video in ELT are examined, and some suggestions for maximizing its value are put forward. 1. Introduction SINCE the 1980s, there have been significant developments in the field of English language teaching ELT) in China, the most remarkable of which is the integration of educational technology into ELT.

Efficient Algorithms for Maximizing Group Influence in Social Networks

In social network applications,individual opinion is often influenced by groups,and most decisions usually reflect the majority’s opinions.This imposes the group influence maximization(GIM) problem that selects k initial nodes,where each node belongs to multiple groups for a given social network and each group has a weight,to maximize the weight of the eventually activated groups.The GIM problem is apparently NP-hard,given the NP-hardness of the influence maximization(IM) problem that does not consider groups.Focusing on activating groups rather than individuals,this paper proposes the complementary maximum coverage(CMC) algorithm,which greedily and iteratively removes the node with the approximate least group influence until at most k nodes remain.Although the evaluation of the current group influence against each node is only approximate,it nevertheless ensures the success of activating an approximate maximum number of groups.Moreover,we also propose the improved reverse influence sampling(IRIS) algorithm through fine-tuning of the renowned reverse influence sampling algorithm for GIM.Finally,we carry out experiments to evaluate CMC and IRIS,demonstrating that they both outperform the baseline algorithms respective of their average number of activated groups under the independent cascade(IC)model.

花椒病虫害绿色防控技术研究进展

花椒(Zanthoxylum bungeanum Maxim.)经济价值较高,在中国广泛种植,但其生长过程中易遭受病虫危害,科学的防治技术措施对花椒的绿色发展至关重要。从生态调控技术、生物防治技术、理化诱控技术、科学用药技术4个方面对花椒病虫害绿色防控技术进行综述,以期为生产上花椒病虫害绿色防控提供参考。

Yield and Nutritive Values of Semi- and Non-Fall Dormant Alfalfa Cultivars under Late-Cutting Schedule in California’s Central Valley

California is one of the major alfalfa (Medicago sativa L) forage-producing states in the U.S, but its production area has decreased significantly in the last couple of decades. Selection of cultivars with high yield and nutritive value under late-cutting schedule strategy may help identify cultivars that growers can use to maximize yield while maintaining area for sustainable alfalfa production, but there is little information on this strategy. A field study was conducted to determine cumulative dry matter (DM) and nutritive values of 20 semi- and non-fall dormant (FD) ratings (FD 7 and FD 8 - 10, respectively) cultivars under 35-day cut in California’s Central Valley in 2020-2022. Seasonal cumulative DM yields ranged from 6.8 in 2020 to 37.0 Mg·ha−1 in 2021. Four FD 8 - 9 cultivars were the highest yielding with 3-yrs avg. DM greater than the lowest yielding lines by 46%. FD 7 cultivar “715RR” produced the highest crude protein (CP: 240 g·Kg−1) while FD 8 cultivar “HVX840RR” resulted in the highest neutral detergent fiber digestibility (NDFD: 484 g·Kg−1, 7% greater than the top yielding cultivars) but with DM yield intermediate. Yields and NDFD correlated positively but weakly indicating some semi- and non-FD cultivars performing similarly. These results suggest that selecting high yielding cultivars under 35-day cutting schedule strategy can be used as a tool to help growers to maximize yield while achieving good quality forages for sustainable alfalfa production in California’s Central Valley.

二分图中高效计算top-n maximalα-biclique的方法研究

针对当二分图中一类节点的数量固定时,如何搜索另一类型节点数量排序为前n的maximalα-biclique的问题,提出了一种基础搜索算法和一种基于共同邻居概念的改进搜索算法。在使用(1,α)-core剪枝方法加快搜索的算法基础上,基于共同邻居搜索算法使用共同邻居的概念对算法进行了改进,该算法只遍历节点的二跳邻居,并利用节点顺序和最小阈值提高搜索效率。实验结果表明,两种算法都可以有效且高效地搜索节点数量排名为前n的maximalα-biclique。与基础搜索算法相比,基于共同邻居搜索算法的搜索效率提升了80%,在实际应用场景中更具优势。

Revisiting the stretch-induced force deficit:A systematic review with multilevel meta-analysis of acute effects

Background:When recommending avoidance of static stretching prior to athletic performance,authors and practitioners commonly refer to available systematic reviews.However,effect sizes(ES)in previous reviews were extracted in major part from studies lacking control conditions and/or prepost testing designs.Also,currently available reviews conducted calculations without accounting for multiple study outcomes,with ES:0.03 to 0.10,which would commonly be classified as trivial.Methods:Since new meta-analytical software and controlled research articles have appeared since 2013,we revisited the available literatures and performed a multilevel meta-analysis using robust variance estimation of controlled prepost trials to provide updated evidence.Furthermore,previous research described reduced electromyography activity—also attributable to fatiguing training routines—as being responsible for decreased subsequent performance.The second part of this study opposed stretching and alternative interventions sufficient to induce general fatigue to examine whether static stretching induces higher performance losses compared to other exercise routines.Results:Including 83 studies with more than 400 ES from 2012 participants,our results indicate a significant,small ES for a static stretch-induced maximal strength loss(ES=0.21,p=0.003),with high magnitude ES(ES=0.84,p=0.004)for stretching durations≥60 s per bout when compared to passive controls.When opposed to active controls,the maximal strength loss ranges between ES:0.17 to0.28,p<0.001 and 0.040 with mostly no to small heterogeneity.However,stretching did not negatively influence athletic performance in general(when compared to both passive and active controls);in fact,a positive effect on subsequent jumping performance(ES=0.15,p=0.006)was found in adults.Conclusion:Regarding strength testing of isolated muscles(e.g.,leg extensions or calf raises),our results confirm previous findings.Nevertheless,since no(or even positive)effects could be found for athletic performance,our results do not support previous recommendations to exclude static stretching from warm-up routines prior to,for example,jumping or sprinting.

VARIATIONAL ANALYSIS FOR THE MAXIMAL TIME FUNCTION IN NORMED SPACES

For a general normed vector space,a special optimal value function called a maximal time function is considered.This covers the farthest distance function as a special case,and has a close relationship with the smallest enclosing ball problem.Some properties of the maximal time function are proven,including the convexity,the lower semicontinuity,and the exact characterizations of its subdifferential formulas.

GLOBAL BOUND ON THE GRADIENT OF SOLUTIONS TO p-LAPLACE TYPE EQUATIONS WITH MIXED DATA

In this paper,the study of gradient regularity for solutions of a class of elliptic problems of p-Laplace type is offered.In particular,we prove a global result concerning Lorentz-Morrey regularity of the non-homogeneous boundary data problem:-div((s^(2)+|▽u|^(2)p-2/2)▽u)=-div(|f|^(p-2)f)+g inΩ,u=h in■Ω,with the(sub-elliptic)degeneracy condition s∈[0,1]and with mixed data f∈L^(p)(Q;R^(n)),g∈Lp/(p-1)(Ω;R^(n))for p∈(1,n).This problem naturally arises in various applications such as dynamics of non-Newtonian fluid theory,electro-rheology,radiation of heat,plastic moulding and many others.Building on the idea of level-set inequality on fractional maximal distribution functions,it enables us to carry out a global regularity result of the solution via fractional maximal operators.Due to the significance of M_(α)and its relation with Riesz potential,estimates via fractional maximal functions allow us to bound oscillations not only for solution but also its fractional derivatives of orderα.Our approach therefore has its own interest.