Outpatient transoral laser vaporization of anterior glottic webs and keel placement: Risks of airway compromise

Management of acquired anterior glottic webs involves resection of the web with reconstitution of a linear vocal fold edge and anterior commissure. Traditional procedures such as transcervical midline thyrotomy (with tracheostomy) and keel placement have been used for patients with extensive scar formation and airway compromise. However, in selected patients with more limited scarring and minimal-to-no airway compromise, a transoral endoscopic approach may be a viable option. In three patients, transoral laser vaporization followed by transoral keel placement and outpatient removal resulted in a vocal quality that perceptually improved without any evidence of respiratory compromise postoperatively.     

Knot Placement for B-Spline Curve Approximation via $L_{∞, 1}$-Norm and Differential Evolution Algorithm

In this paper, we consider the knot placement problem in B-spline curve approximation. A novel two-stage framework is proposed for addressing this problem. In the first step, the $l_{\infty, 1}$-norm model is introduced for the sparse selection of candidate knots from an initial knot vector. By this step, the knot number is determined. In the second step, knot positions are formulated into a nonlinear optimization problem and optimized by a global optimization algorithm — the differential evolution algorithm (DE). The candidate knots selected in the first step are served for initial values of the DE algorithm. Since the candidate knots provide a good guess of knot positions, the DE algorithm can quickly converge. One advantage of the proposed algorithm is that the knot number and knot positions are determined automatically. Compared with the current existing algorithms, the proposed algorithm finds approximations with smaller fitting error when the knot number is fixed in advance. Furthermore, the proposed algorithm is robust to noisy data and can handle with few data points. We illustrate with some examples and applications.     

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N²).     

Multiple gateway placement in large‐scale constellation networks with inter‐satellite links

Multiple gateways are required in large satellite constellation networks (LSCNs) with inter‐satellite links (ISLs), and their placement may greatly affect the system performance. Gateway placement can be optimized to achieve better network performance under the non‐uniform ground demand distribution. This paper formulates a gateway placement optimization model for LSCN with ISLs, aiming at achieving an optimal overall performance including delay, traffic peak, and load balance. The constraints of potential gateway location, gateway‐satellite connectivity, and max hop‐count are considered. A genetic algorithm (GA)‐based method is proposed to solve the integer optimization problem with the help of quasi‐evenly distributed reference layout. A Starlink‐like constellation with ISLs is adopted in the simulation. The simulation results show that the optimized layout has better performance than the reference layout. Additionally, the locations with high user demand or at the middle of ocean are preferred by gateways. The network performance is jointly influenced by gateway placement, demand distribution, constellation configuration, node, and link capacities. The abnormally high ISL hop‐count is found in the south Indian Ocean, which is caused by constellation and ISL configuration.     

A generalized service deployment framework for OSPF networks using multi‐topology routing: Modeling and methodology

The exponential growth of various applications requires deploying an ever‐growing number of network services. A generalized service deployment framework for Open Shortest Path First (OSPF) networks is proposed in this paper. The framework includes placing programmable routers, distributing different types of services on these routers, and leading traffic flow through them according to the predetermined sequence order requirement. However, it is not possible to direct all the traffic flows through the required service nodes along the shortest path with a single and suitable set of link weights. To address the issue, multiple topology routing (MTR) technique is incorporated to have various logical topologies with multiple sets of link weights. Correspondingly, the problem of jointly optimizing Placement of programmable routers, Distribution of different types of services among these routers, and Link Weights setting based on MTR (shortened to PD‐LW‐MTR) and its mixed integer linear programming formulation are presented in this paper. A novel decomposition algorithm is also proposed to address this problem efficiently. Experiment results validate the correctness and feasibility of our algorithm. It is also shown that the optimization algorithm can obtain near‐optimal solution and just only a few logical topologies over multiple sets of link weights are necessary for traffic flows to guarantee service order requirements.     

Multiobjective virtual machine placement mechanisms using nature‐inspired metaheuristic algorithms in cloud environments: A comprehensive review

Cloud computing introduced a new paradigm in IT industry by providing on‐demand, elastic, ubiquitous computing resources for users. In a virtualized cloud data center, there are a large number of physical machines (PMs) hosting different types of virtual machines (VMs). Unfortunately, the cloud data centers do not fully utilize their computing resources and cause a considerable amount of energy waste that has a great operational cost and dramatic impact on the environment. Server consolidation is one of the techniques that provide efficient use of physical resources by reducing the number of active servers. Since VM placement plays an important role in server consolidation, one of the main challenges in cloud data centers is an efficient mapping of VMs to PMs. Multiobjective VM placement is generating considerable interest among researchers and academia. This paper aims to represent a detailed review of the recent state‐of‐the‐art multiobjective VM placement mechanisms using nature‐inspired metaheuristic algorithms in cloud environments. Also, it gives special attention to the parameters and approaches used for placing VMs into PMs. In the end, we will discuss and explore further works that can be done in this area of research.     

Survey of controller placement problem in software defined network

In order to change situation of high management complexity in current Internet,software defined network (SDN) was proposed,which mainly aimed to directly control forwarding behaviors of data-flow by using flow strategies generated by controllers.With the deployment and applications of SDN,research communities found that the controller placement in SDN network could directly affect network performance.In recent years,controller placement problem (CPP) has become a hot topic,where performance metric and searching algorithms are important research areas.Based on current researches,the existing controller placement problem was systematically analyzed and summarized,which was expected to be helpful for the follow-up research.     

An experimental study on the effect of ad placement,product involvement and motives on Facebook ad avoidance

Facebook users do not visit the social networking site to see advertising. They are either just surfing the platform or searching for information. Therefore, advertising content is vulnerable to ad avoidance. In this study, the effect of two Facebook ad placements, sidebar ads and message stream ads, on ad avoidance intention was investigated through an online experiment. Sidebar placements are put next to the content stream, while message stream advertising is interwoven with the original Facebook content. 253 Respondents (M_age?=?39.4, SD?=?8.7, 50.2% female) were given either a searching or surfing task. The intention of respondents to avoid ads placed in the message stream was significantly higher than to avoid ads placed in the sidebar. Through multiple moderation analysis, we found that Facebook motivations and product involvement were significant moderators of the effect of ad placement on ad avoidance intent. Our results point to the crucial role of the degree of product involvement when targeting Facebook ads to the right audience and choosing the appropriate ad placement. We discussed implications for research and the professional field.     

Edge-first-based cooperative caching strategy in information centric networking

In order to optimize the replica placement in information centric networking,an edge-first-based cooperative caching strategy (ECCS) was proposed.According to the strategy,cache decision was made during the interest forwarding stage.The decision result and statistic information would been forwarded to upstream routers step by step.Utilizing the information,upstream nodes could update their cache information table immediately to achieve cooperative caching.The experimental results indicate ECCS can achieve salient performance gain in terms of server load reduction ratio,average hop reduction ratio,average cache hit ratio,compared with current strategies.     

基于小波变换算法的新型防攻击数字水印技术

随着Internet的迅猛发展，数字水印技术越来越受到人们的关注。在其发展的同时数字水印攻击手段也在不断的发展。因此，介绍一种在小波变换的基础上加以改进，从而提高数字水印的防攻击能力新型算法：它借助于随机平放算法，通过DWT变换嵌入水印，同时对图象质量无影响。此法能抵制多种攻击，如：图象旋转、裁剪、伪造等，在实践中表现出较好的健壮性。