Search

Superconductivity in the cuprates is found to be intertwined with charge and spin density waves. Determining the interactions between the different types of order is crucial for understanding these important materials. Here, we elucidate the role of the charge density wave (CDW) in the prototypical cuprate La$_{1.885}$Sr$_{0.115}$CuO$_4$, by studying the effects of large magnetic fields ($H$) up to 24 Tesla. At low temperatures ($T$), the observed CDW peaks reveal two distinct regions in the material: a majority phase with short-range CDW coexisting with superconductivity, and a minority phase with longer-range CDW coexisting with static spin density wave (SDW). With increasing magnetic field, the CDW first grows smoothly in a manner similar to the SDW. However, at high fields we discover a sudden increase in the CDW amplitude upon entering the vortex-liquid state. Our results signify strong coupling of the CDW to mobile superconducting vortices and link enhanced CDW amplitude with local superconducting pairing across the $H-T$ phase diagram., 7 pages, 3 figures

The Bulk Synchronous Parallel (BSP) paradigm is gaining tremendous importance recently due to the popularity of computations as distributed machine learning and graph computation. In a typical BSP job, multiple workers concurrently conduct iterative computations, where frequent synchronization is required. Therefore, the workers should be scheduled simultaneously and their placement on different computing devices could significantly affect the performance. Simply retrofitting a traditional scheduling discipline will likely not yield the desired performance due to the unique characteristics of BSP jobs. In this work, we derive SPIN , a novel scheduling designed for BSP jobs with placement-sensitive execution to minimize the makespan of all jobs. We first prove the problem approximation hardness and then present how SPIN solves it with a rounding-based randomized approximation approach. Our analysis indicates SPIN achieves a good performance guarantee efficiently. Moreover, SPIN is robust against misestimation of job execution time by theoretically bounding its negative impact. We implement SPIN on a production-trace driven testbed with 40 GPUs. Our extensive experiments show that SPIN can reduce the job makespan and the average job completion time by up to $3\times $ and $4.68\times $ , respectively. SPIN also demonstrates better robustness to execution time misestimation compared with state-of-the-art heuristic baselines.

This study aimed to evaluate the effect of resistance exercise on peripheral inflammatory biomarkers in healthy adults.Four databases, including PubMed, Web of Science, Cochrane Library, and SPORTDiscus, were searched from inception until April 1st, 2022. A meta-analysis was conducted using a random-effects model, followed by sensitivity analysis, subgroup analysis, meta-regression analysis, and publication bias analysis.15 randomized controlled trials were included in the meta-analysis. The pooled results showed that resistance exercise significantly decreased TNF-α levels (SMD = -0.81, 95% CI: -1.42 to -0.20, p = 0.009) but did not affect IL-6 and CRP levels. Individuals with BMI 18.5-24.9 exhibited significantly decreased IL-6 levels, while moderate strength resistance exercise could significantly decrease TNF-α levels. Finally, age might be a confounding factor influencing the effect of resistance exercise on IL-6.Resistance exercise could reduce TNF-α levels in healthy adults, and resistance exercise with moderate intensity could reduce TNF-α levels more effectively.

Motivated by practical scenarios in areas such as Mobile Edge Computing (MEC) and Content Delivery Networks (CDNs), we study online file caching on multiple caches, where a file request might be relayed to other caches or bypassed directly to the memory when a cache miss happens. We can also choose to fetch files from the memory to caches and conduct file replacement if necessary. We take the relaying, bypassing and fetching costs altogether into consideration. We first show the inherent difficulty of the problem even when the online requests are of uniform costs. We propose an $O(\log {K})$ -competitive randomized online multiple caching algorithm (named Camul ) and an $O(K)$ -competitive deterministic algorithm (named Camul-Det ), where $K$ is the total number of slots in all caches. Both of them achieve asymptotically optimal competitive ratios. Moreover, our algorithms can be implemented efficiently such that each request is processed in amortized constant time. We conduct extensive simulations on production data traces from Google and a benchmark workload from Yahoo . It shows that our algorithms dramatically outperform state-of-the-art schemes, i.e., reducing the total cost by 85% and 43% respectively compared with important baselines and their strengthened versions with request relaying. More importantly, Camul achieves such a good total cost without sacrificing other performance measures, e.g., the hit ratio, and performs consistently well on various settings of experiment parameters.

With this meta-analysis we aimed at systematically evaluating the intervention effects of aerobic exercise on inflammatory factors in healthy adults and identifying an optimal aerobic exercise program with anti-inflammatory effects.Four databases, including PubMed, Web of Science, Cochrane Library and SPORTDiscus, were searched from inception until April 30, 2021. Stata version 11.0 was used for data analysis.A total of 15 studies with 1160 participants were included. The pooled estimates showed that aerobic exercise could significantly reduce TNFα levels (SMD=-0.30, 95% CI: -0.58 - -0.03, p=0.032), while the levels of IL-6 (SMD=-0.14, 95% CI: -0.32-0.03, p=0.109) and CRP (SMD=-0.09, 95% CI: -0.34-0.16, p=0.484) were not significantly affected.Aerobic exercise exerts a positive effect by preventing inflammation-related diseases.

Laser diode (LD) driven lighting is expected to be the next-generation lighting, and red CaAlSiN3:Eu2+ (CASN) phosphor is still required for high-quality LD white lighting. Utilizing glass with a suitable thermal expansion coefficient and low softening temperature as the inorganic binder, CASN phosphor-in-glass-films (PiFs) are fabricated in this work. High efficiency and thermal stability are achieved by optimizing the reaction of CASN and glass. Introducing Lu3Al5O12:Ce (LuAG) to offset the luminous spectra of CASN PiFs, broad emission spectra and high efficiency are recorded. High color rendering index (CRI, 88.6), luminous efficiency (LE, 153 lm W−1), and luminous flux (LF, 1162 lm) are achieved simultaneously when the PiFs are excited by a 455 nm blue LD. At last, the high color quality LD white lighting produced by PiFs is displayed for the first time. We believe that the results provided by this work are an enormous progress for PiFs and encourage more researchers to provide new strategies to acquire high performance of PiFs in white LD lighting.

We present a unified polynomial-time approximation scheme (PTAS) for the prize collecting traveling salesman problem (PCTSP) and the prize collecting Steiner tree problem (PCSTP) in doubling metrics. Given a metric space and a penalty function on a subset of points known as terminals, a solution is a subgraph on points in the metric space, whose cost is the weight of its edges plus the penalty due to terminals not covered by the subgraph. Under our unified framework, the solution subgraph needs to be Eulerian for PCTSP, while it needs to be connected for PCSTP. Before our work, even a QPTAS for the problems in doubling metrics is not known. Our unified PTAS is based on the previous dynamic programming frameworks proposed in [Talwar STOC 2004] and [Bartal, Gottlieb, Krauthgamer STOC 2012]. However, since it is unknown which part of the optimal cost is due to edge lengths and which part is due to penalties of uncovered terminals, we need to develop new techniques to apply previous divide-and-conquer strategies and sparse instance decompositions., Appeared in ESA 2018. This is the full version

Pancreaticojejunostomy is the most common anastomosis following pancreaticoduodenectomy and middle pancreatectomy. The detailed surgical technics of pancreaticojejunostomy vary dramatically, but none of them can achieve zero fistula rate. In recent years,with the development of new surgical concept,application of new surgical technology, high-tech materials and instruments,the incidence of pancreatic fistula has decreased. At the same time,researches on investigating the risk factors of pancreaticojejunostomy are gradually deepening. Based on years of surgical experience on pancreaticojejunostomy and current literatures, this paper analyzes the factors affecting the effect of pancreaticojejunostomy, such as the patient's basic physical state,pancreatic texture and diameter of the pancreatic duct,pathology and course of the disease,surgical technology and perioperative management,and summarizes six technical principles for pancreaticojejunostomy to be shared with surgical comrades:appropriate tension,protection of blood supply,hermetic closure of pancreatic section,accurate connection of pancreatic duct and intestinal mucosa,individualization,learning and accumulation of experience.胰肠吻合是胰十二指肠切除和胰腺中段切除后最常用的吻合方法，其具体操作技术变化多样，目前尚无一种方法可完全避免术后胰瘘的发生。近年来，随着外科理念、手术技术和高科技材料及器械的不断进步，胰瘘发生率有所降低。同时对胰肠吻合效果影响因素的研究亦在逐步深入。作者结合自己多年来实施该手术操作的经验及查阅相关文献，对患者的身体状态和基础条件、胰腺质地和主胰管直径、主要原发病及病程、手术技术、围手术期管理等影响胰肠吻合效果的因素进行了分析，并总结概括了张力适度、保护血运、胰腺断面封闭、胰管和肠黏膜精准对合、个体化、重视学习和经验积累等6条胰肠吻合的手术技术原则，供同道参考。.

In edge-cloud computing, a set of servers (called edge servers) are deployed near the mobile devices to allow these devices to offload their jobs to and subsequently obtain their results from the edge servers with low latency. One fundamental problem in edge-cloud systems is how to dispatch and schedule the jobs so that the job response time (defined as the interval between the release of the job and the arrival of the computation result at the device) is minimized. In this paper, we propose a general model for this problem, where the jobs are generated in arbitrary order and at arbitrary times at the mobile devices and then offloaded to servers with both upload and download delays. Our goal is to minimize the total weighted response time of all the jobs. The weight is set based on how latency-sensitive the job is. We derive the first online job dispatching and scheduling algorithm in edge-clouds, called OnDisc , which is scalable in the speed augmentation model; that is, OnDisc is $(1 + \varepsilon )$ -speed $O(1/\varepsilon )$ -competitive for any small constant $\varepsilon >0$ . Moreover, OnDisc can be easily implemented in distributed systems. We also extend OnDisc with a fairness knob to incorporate the trade-off between the average job response time and the degree of fairness among jobs. Extensive simulations based on a real-world data-trace from Google show that OnDisc can reduce the total weighted response time dramatically compared with heuristic algorithms.

A coflow is a collection of related parallel flows that occur typically between two stages of a multi-stage computing task in a network, such as shuffle flows in MapReduce. The coflow abstraction allows applications to convey their semantics to the network so that application-level requirements can be better satisfied. In this paper, we study the routing and scheduling of multiple coflows to minimize the total weighted coflow completion time (CCT). We first propose a rounding-based randomized approximation algorithm, called OneCoflow , for single coflow routing and scheduling. The multiple coflow problem is more challenging as coexisting coflows will compete for the same network resources, such as link bandwidth. To minimize the total weighted CCT, we derive an online multiple coflow routing and scheduling algorithm, called OMCoflow . We then derive a competitive ratio bound of our problem and prove that the competitive ratio of OMCoflow is nearly tight. To the best of our knowledge, this is the first online algorithm with theoretical performance guarantees which considers routing and scheduling simultaneously for multi-coflows. Compared with existing methods, OMCoflow runs more efficiently and avoids frequently rerouting the flows. Extensive simulations on a Facebook data trace show that OMCoflow outperforms the state-of-the-art heuristic schemes significantly (e.g., reducing the total weighted CCT by up to 41.8% and the execution time by up to 99.2% against RAPIER).

Since the concept of enhanced recovery after surgery(ERAS) has been proposed,it is valued,enriched and developed along with controversy and discussion. Although the content of ERAS involves multidisciplinary fields and is not an independent branch of surgery,surgeons,as an indispensable part,play an important role. At present,surgeons should pay more attention to post-operation complication rate,unplanned readmission rate and reoperation rate,and avoid these problems to the most extent by combining excellent surgical techniques with solid non-technical skills. As consequence,we would implement ERAS much better and be of great benefit to patients.术后加速康复（ERAS）理念自提出以来，在争议与讨论中不断地被重视、丰富与发展。虽然ERAS的内容涉及多个学科领域，并非外科学的独立分支，但外科医师作为其中不可或缺的一部分，发挥着重要作用。目前，外科医师需要给予术后并发症发生率、再住院率及再手术率等问题更多的关注，并能够结合优秀的外科技术与扎实的非外科技术最大程度地解决这些问题，从而更好地实施和开展ERAS，使患者受益。.

The Bulk Synchronous Parallel (BSP) paradigm is gaining tremendous importance recently because of the pop-ularity of computations such as distributed machine learning and graph computation. In a typical BSP job, multiple workers concurrently conduct iterative computations, where frequent synchronization is required. Therefore, the workers should be scheduled simultaneously and their placement on different computing devices could significantly affect the performance. Simply retrofitting a traditional scheduling discipline will likely not yield the desired performance due to the unique characteristics of BSP jobs. In this work, we derive SPIN, a novel scheduling designed for BSP jobs with placement-sensitive execution to minimize the makespan of all jobs. We first prove the problem approximation hardness and then present how SPIN solves it with a rounding-based randomized approximation approach. Our analysis indicates SPIN achieves a good performance guarantee efficiently. Moreover, SPIN is robust against misestimation of job execution time by theoretically bounding its negative impact. We implement SPIN on a production-trace driven testbed with 40 GPUs. Our extensive experiments show that SPIN can reduce the job makespan and the average job completion time by up to 3× and 4.68×, respectively. Our approach also demonstrates better robustness to execution time misestimation compared with heuristic baselines.

The rapid development of professional technology not only brings great benefits to patients, but also reveals the problem of non-technical skills. Technical competence is not enough to avoid the occurrence of adverse medical events or to get optimal post-operative outcomes. The development of technology is endless, we are desperately in need of non-technical skills, such as situation awareness, decision making, communication and teamwork, leadership. The only way we could achieve in the assistance of the perfect surgical operation with the combination of excellent surgical techniques and solid non-technical skills, and therefore relieve the patients as much as possible.外科领域专业技术的飞速发展在为患者带来福音的同时，也使非外科技术问题日益突显，光有外科技术不足以完全避免外科手术的失误。技术的发展是永无止境的，但作为外科医师的我们，更需要扎实的非外科技术，如情景意识、决策能力、沟通与合作、引领导向能力。只有将优秀的外科技术与扎实的非外科技术相结合，才能助力外科手术的完美，最大程度地解除患者痛苦，使患者受益。.

We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find the shortest tour that visits each of a given collection of subsets (regions or neighborhoods) in the underlying metric space. We give a randomized polynomial-time approximation scheme (PTAS) when the regions are fat weakly disjoint. This notion of regions was first defined when a QPTAS was given for the problem in SODA 2010 (Chan and Elbassioni 2010). The regions are partitioned into a constant number of groups, where in each group, regions should have a common upper bound on their diameters and each region designates one point within it such that these points are far away from one another. We combine the techniques in the previous work, together with the recent PTAS for TSP (STOC 2012: Bartal, Gottlieb, and Krauthgamer 2012) to achieve a PTAS for TSPN. However, several nontrivial technical hurdles need to be overcome for applying the PTAS framework to TSPN: (1) Heuristic to detect sparse instances. In the STOC 2012 paper, a minimum spanning tree heuristic is used to estimate the portion of an optimal tour within some ball. However, for TSPN, it is not known if an optimal tour would use points inside the ball to visit regions that intersect the ball. (2) Partially cut regions in the recursion. After a sparse ball is identified by the heuristic, the PTAS framework for TSP uses dynamic programming to solve the instance restricted to the sparse ball and recurse on the remaining instance. However, for TSPN, it is an important issue to decide whether each region partially intersecting the sparse ball should be solved in the sparse instance or considered in the remaining instance. Surprisingly, we show that both issues can be resolved by conservatively making the ball in question responsible for all intersecting regions. In particular, a sophisticated charging argument is needed to bound the cost of combining tours in the recursion. Moreover, more refined procedures are used to improve the dependence of the running time on the doubling dimension k from the previous exp[( O (1)) k 2 ] (even for just TSP) to exp[2 O ( k log k ) ].

In Mobile Edge Computing (MEC), each edge server can be configured with only a small number of functions due to the limited capacity of various resources. Meanwhile, mobile applications become more complicated, consisting of multiple dependent tasks which are typically modeled as a Directed Acyclic Graph (DAG). In edge computing, when an application arrives, we need to place and schedule its tasks onto edge servers and/or the remote cloud, where the functions to execute the tasks are configured. In this work, we jointly consider the problem of dependent task placement and scheduling with on-demand function configuration on servers. Our objective is to minimize the application completion time. Specifically, for the special case when the configuration on each edge server is fixed, we derive an algorithm to find the optimal task placement and scheduling efficiently. When the on-demand function configuration is allowed, we propose a novel approximation algorithm, named GenDoc, and analyze theoretically its additive error from the optimal solution. Our extensive experiments on the cluster trace from Alibaba (including 20365 unique applications with DAG information) show that GenDoc outperforms state-of-the-art baselines in processing 86.14% of these unique applications, and reduces their average completion time by at least 24% (and up to 54%). Moreover, GenDoc consistently performs well on various settings of key parameters.

The electronic structures of M-doped SnTe (M = Mg, Mn, Cd, and Hg) are investigated by using first-principles calculations including spin-orbit coupling. It is found that Sn vacancy plays an important role in the band engineering of SnTe, showing a different property from its related compound PbTe. The enlarged band gap and reduced energy separation between two valence bands are in good agreement with experimental measurements. Both of the two band modifications lead to the increase of Seebeck coefficients, which is explicitly confirmed by the followed Boltzmann transport calculations. The calculated Seebeck coefficients for Mn-doped SnTe agree well with the experimental data in a broad range of carrier concentration. Owing to the improved Seebeck coefficients, Mn- and Cd-doped SnTe exhibit promising thermoelectric properties with ZT = 1.32 and 1.65 at around 800 K, respectively.

Surgery is an important part of medicine, it has undergone huge changes in recent decades in China.The concepts of damage control surgery, minimally invasive surgery, and enhanced recovery after surgery are all new with the date, laparoscopic surgery, robotic surgery, natural orifice transluminalendoscopic surgery are not new words to all of us. Surgical operations are becoming more and more specialized, surgical technique is becoming more and more mature, and surgeons are becoming more and more specialized. Medical ethical issues, as the common language of surgeons and basic principle of surgery, should be recognized and understood more stronger than ever, which will enable surgeons to retrieve original intention of surgery. This paper takes this as starting point and explore the common principles of surgery, aims to arouse some mutual encouragement to growing youth surgeons.现代外科学是医学的重要组成部分，我国的外科学近几十年来经历了翻天覆地的变化，损伤控制外科、微创外科、加速康复外科等理念与日俱新，腹腔镜手术、机器人手术、经自然腔道内镜外科手术等已不再新鲜。外科手术越做越精细、技术越来越成熟，外科医师也越来越专业化。作为医学各专科的共同语言，医学伦理学比以往更有必要被提及和强调，理解它的重要性并付诸实践，能使外科医师更好地找回外科手术的初心。本文以此为切入点，探讨外科手术的共同原则，与成长中的青年外科同道共勉。.

Real estate industry is important for national economy. China and the U.S. are the world’s major economies where real estate both plays an important role during the Global Financial Crisis of 2008. Academic paper is the common form to present scholars’ opinions which are usually the most scientific and objective knowledge of a discipline. However, traditional review methods with manual inspection are considered to be time-consuming, subjective and inefficient to process them. A large-scale review gathering systematic data to find academic concerns on real estate is missing. With recent big data technologies, especially the structural topic modeling approach, we make a contribution to the understanding of experts’ views about real estate by analyzing the abstracts of all related academic papers in SCI-EXPANDED, SSCI and CSCD databases. Besides, we compare the topical differences when scholars discuss real estate issues in China and the U.S., respectively. The structural topic model indicates that the data set of the collected 1027 abstracts can be abstracted into 9 topics, which represent the major academic concerns of real estate issues in the two countries. Furthermore, we find that the real estate research of the U.S. focuses more on Financial/Bubbles, Environment/Substance, Credit/Mortgage/Crisis, Causality Test Methods, and Politics/Equality, while China’s studies address more on Urbanization, Rural Real Estate, Commercial Housing, and Foreign Investment/Other Industries. Finally, we analyze the differences of topical prevalence between China and the U.S., and find that the major differences can be derived from distinguishing features of development stage of real estate, the national economy, the stress of connections with finance and effect towards real world, the research methods employed and the political and racial background, in the two countries.

Concrete structures with fibre-reinforced plastic bars can solve steel corrosion problems very effectively. At present, glass fibre-reinforced plastic bars are more widely used among fibre-reinforced plastic bars. Different from steel bars, glass fibre-reinforced plastic bars have no yield stage before fracture, which means concrete structures with glass fibre-reinforced plastic bars will not suffer ductile failure but only brittle failure without warning. Therefore, it is of particular importance to accurately obtain a standard value of the tensile strength of glass fibre-reinforced plastic bars. This paper carried out tensile tests of glass fibre-reinforced plastic bars with different diameters, measured the ultimate tensile strength and elasticity modulus of glass fibre-reinforced plastic bars, and conducted regression analyses. Based on the test results, a three-parameter Weibull probability distribution model was proposed, model parameters were fitted, and the results of the experimental test...

We achieve a (randomized) polynomial-time approximation scheme (PTAS) for the Steiner Forest Problem in doubling metrics. Before our work, a PTAS is given only for the Euclidean plane in [FOCS 2008: Borradaile, Klein and Mathieu]. Our PTAS also shares similarities with the dynamic programming for sparse instances used in [STOC 2012: Bartal, Gottlieb and Krauthgamer] and [SODA 2016: Chan and Jiang]. However, extending previous approaches requires overcoming several non-trivial hurdles, and we make the following technical contributions. (1) We prove a technical lemma showing that Steiner points have to be "near" the terminals in an optimal Steiner tree. This enables us to define a heuristic to estimate the local behavior of the optimal solution, even though the Steiner points are unknown in advance. This lemma also generalizes previous results in the Euclidean plane, and may be of independent interest for related problems involving Steiner points. (2) We develop a novel algorithmic technique known as "adaptive cells" to overcome the difficulty of keeping track of multiple components in a solution. Our idea is based on but significantly different from the previously proposed "uniform cells" in the FOCS 2008 paper, whose techniques cannot be readily applied to doubling metrics.

The band engineering of M-doped SnTe (M = Ga, In, and Tl) is investigated by using first-principles calculations. Being consistent with experimental measurements, our calculations found that Ga doping hardly changes the valence band, while In doping introduces an obvious resonant state near the Fermi level. The resonant state is demonstrated to be from the anti-bonding of In-s and Te-p orbitals. Unexpectedly, no resonant state was observed in Tl-doped SnTe, indicating the nonmonotonic behavior of the Ga-In-Tl series. We show that the absence of the resonant state in Tl-doped SnTe is due to the downward shift of the Tl-s orbital, which may be attributed to the effect of lanthanide contraction. The increase of the Seebeck coefficient in In-doped SnTe is numerically confirmed by Boltzmann transport calculations. Moreover, we find that the mutually matched resonant state location and valence band separation is the key precondition for the combination of the resonant state and band convergence in SnTe. A further enhanced Seebeck coefficient (∼230 μV K(-1)) and ZT value (1.8 at 920 K) are predicted in codoped SnTe by In-Hg, owing to the synergy of two kinds of band engineering.

Fires resulting from titanium combustion are complex and violent processes which can instantly burn a titanium alloy once ignited. The occurrence of titanium combustion is a disaster for aircraft. Accurate measurement of the ignition temperature of titanium alloys is of significance in preventing such fires and in investigating combustion-resistance properties. In this study, monochromatic temperature and emissivity measurement methods based on reflectivity detection were used to determine the ignition temperature of a titanium alloy. Experiments were carried out using a titanium burning apparatus. The temperatures of titanium in the oxidation stage before ignition and in the combustion stage during the ignition process were measured using wavelengths of 1050 nm and 940 nm, respectively. Experimental results showed that the ignition temperature of the titanium alloy could be measured by reflectivity detection and that measurement precision during thermal oxidation (500-900 °C) was ±1 °C. The temperature of the ignition process ranged between 1653 and 1857 °C, and the ignition temperature was around 1680 °C.

The measured thermal conductivity κph of Mg2Si1−xSnx solid solutions exhibits a dramatic decrease compared with Mg2Si and Mg2Sn. By solving the full Boltzmann equation, the significantly reduced κph was quantitatively reproduced by our calculations. Besides the expected increase in phonon-phonon scattering, we also observed acoustic phonon softening in Mg2Si1−xSnx, despite their smaller average atomic mass relative to Mg2Sn. In agreement with measurements, the lowest κph appears in Mg2Si0.375Sn0.625, which has the shortest mean free path and lowest group velocity. According to our calculated cumulative curve, nanoinclusions of tens of nanometers are suggested for the further reduction of κph in Mg2Si1−xSnx solid solution.

Torus networks are widely used in supercomputing. However, due to their complex topology and their large number of nodes, it is difficult for analysts to perceive the messages flow in these networks. We propose a visualization framework called TorusVisND that uses modern information visualization techniques to allow analysts to see the network and its communication patterns in a single display and control the amount of information shown via filtering in the temporal and the topology domains. For this purpose we provide three cooperating visual interfaces. The main interface is the network display. It uses two alternate graph numbering schemes -- a sequential curve and a Hilbert curve -- to unravel the 5D torus network into a single string of nodes. We then arrange these nodes onto a circle and add the communication links as line bundles in the circle interior. A node selector based on parallel coordinates and a time slicer based on ThemeRiver help users focus on certain processor groups and time slices in the network display. We demonstrate our approach via a small use case.

Damping capacity is another primary characteristic of shape memory alloys (SMA) besides shape memory effect and superelasticity. Damping behavior of Ti-riched TiNi SMA, porous TiNi SMA and a novel TiNi/AlSi composite have been investigated using dynamic mechanical analyzer (DMA) in this investigation. All these alloys are in martensitic state at room temperature and thus possess the high potential application value. Ti 50.2 Ni 49.8 SMA has better damping capacity in pure martensitic state and phase transformation region due to the motion of martensite twin interface. As a kind of promising material for effective dampers and shock absorbing devices, porous TiNi SMA can exhibit higher damping capacity than the dense one due to the existence of the three-dimensioned connecting pore structure. It is found that the internal friction of porous TiNi SMA mainly originates from microplastic deformation and mobility of martensite interface and increases with the increase of the porosity. A novel TiNi/AlSi composite has been developed successfully by infiltrating AlSi alloy into the open pores of porous TiNi alloy with 60% porosity through compression casting. It shows the same phase transformation characteristics as the porous TiNi alloy. The damping capacity of the composite has been increased and the compressive strength has been also promoted remarkably. Suggestions for developing higher damping alloys based on TiNi shape memory alloy are proposed in this paper.

A case of severe hemophilia A was treated by living mother-to-son splenic transplantation. The recipient was a 9-year-old boy. After splenic transplantation, the level of blood factor VIII:C was increased, and no spontaneous hemorrhage occurred. The boy was followed up for over two years. This is a case of spleen allotransplantation with the longest function in the world.

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of [X](k), it holds that Sigma(x is an element of S) w(x).d(z) (x, C) is an element of (1 +/- epsilon) . Sigma(x is an element of X) d(z) (x, C)., We present an efficient algorithm that constructs an epsilon-coreset for the (k, z)-clustering problem in M(X, d), where the size of the coreset only depends on the parameters k, z, epsilon and the doubling dimension ddim(M). To the best of our knowledge, this is the first efficient epsilon-coreset construction of size independent of vertical bar X vertical bar for general clustering problems in doubling metrics., To this end, we establish the first relation between the doubling dimension of M(X, d) and the shattering dimension (or VC-dimension) of the range space induced by the distance d. Such a relation is not known before, since one can easily construct instances in which neither one can be bounded by (some function of) the other. Surprisingly, we show that if we allow a small (1 +/- epsilon)-distortion of the distance function d (the distorted distance is called the smoothed distance function), the shattering dimension can be upper bounded by O(epsilon(-O(ddim(M)))). For the purpose of coreset construction, the above bound does not suffice as it only works for unweighted spaces. Therefore, we introduce the notion of tau-error probabilistic shattering dimension, and prove a (drastically better) upper bound of O(ddim(M).log(1/epsilon)+log log 1/tau) for the probabilistic shattering dimension for weighted doubling metrics. As it turns out, an upper bound for the probabilistic shattering dimension is enough for constructing a small coreset. We believe the new relation between doubling and shattering dimensions is of independent interest and may find other applications., Furthermore, we study robust coresets for (k, z)-clustering with outliers in a doubling metric. We show an improved connection between alpha-approximation and robust coresets. This also leads to improvement upon the previous best known bound of the size of robust coreset for Euclidean space [Feldman and Langberg, STOC 11]. The new bound entails a few new results in clustering and property testing., As another application, we show constant-sized (epsilon, k, z)-centroid sets in doubling metrics can be constructed by extending our coreset construction. Prior to our result, constant-sized centroid sets for general clustering problems were only known for Euclidean spaces. We can apply our centroid set to accelerate the local search algorithm (studied in [Friggstad et al., FOCS 2016]) for the (k, z)-clustering problem in doubling metrics.

We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In each round when a new element arrives, the algorithm may accept the new element into its feasible set and possibly remove elements from it, provided that the resulting set is still independent. The goal is to maximize the value of the final feasible set under some monotone submodular function, to which the algorithm has oracle access. For k -uniform matroids, we give a deterministic algorithm with competitive ratio at least 0.2959, and the ratio approaches 1/α ∞ ≈ 0.3178 as k approaches infinity, improving the previous best ratio of 0.25 by Chakrabarti and Kale (IPCO 2014), Buchbinder et al. (SODA 2015), and Chekuri et al. (ICALP 2015). We also show that our algorithm is optimal among a class of deterministic monotone algorithms that accept a new arriving element only if the objective is strictly increased. Further, we prove that no deterministic monotone algorithm can be strictly better than 0.25-competitive even for partition matroids, the most modest generalization of k -uniform matroids, matching the competitive ratio by Chakrabarti and Kale (IPCO 2014) and Chekuri et al. (ICALP 2015). Interestingly, we show that randomized algorithms are strictly more powerful by giving a (non-monotone) randomized algorithm for partition matroids with ratio 1/α ∞ ≈ 0.3178.