Miracle-dz/UniFAR-FTUs huggingface dataset:
Distributed Strong Diameter Network Decomposition: Extended Abstract

For a pair of positive parameters D,Χ, a partition P of the vertex set V of an n-vertex graph G = (V,E) into disjoint clusters of diameter at most D each is called a (D,Χ) network decomposition}, if the supergraph G(P), obtained by contracting each of the clusters of P, can be properly Χ-colored. The decomposition P is said to be strong (resp., weak) if each of the clusters has strong (resp., weak) diameter at most D, i.e., if for every cluster C ∈ P and every two vertices u,v ∈ C, the distance between them in the induced graph G(C) of C (resp., in G) is at most D. Network decomposition is a powerful construct, very useful in distributed computing and beyond. It was introduced by Awerbuch et. al. [AGLP89] in the end of the eighties. These authors showed that strong (2O(√log n log log n), 2O(√log n log log n) network decompositions can be computed in 2O(√log n log log n) distributed time. Their result was improved at the beginning of nineties by Panconesi and Srinivasan [PS92], who showed that 2O(√log n in all the three expressions can be replaced by 2O(√log n. Around the same time Linial and Saks [LS93] devised an ingenious randomized algorithm that constructs weak (O(log n),O(log n)) network decompositions in O(log2 n) time. Awerbuch et. al. [ABCP96] devised a randomized algorithm that builds a strong (O(log n),O(log n)) network decomposition in O(log4 n) time, using very large messages and heavy local computations. It was however open till now if strong network decompositions with both parameters 2o(√log n) can be constructed in distributed 2o(√log n) time using short messages, or if a result of [LS93] can be strengthened to provide a strong (O(log n),O(log n)) network decomposition within O(log2 n) time (even using large messages). In this paper we answer these long-standing open questions in the affirmative, and show that strong (O(log n),O(log n)) network decompositions can be computed in O(log2 n) time. We also present a tradeoff between parameters of our network decomposition. Our work is inspired by and relies on the "shifted shortest path approach", due to Blelloch et. al. [BGKMPT11], and Miller et. al. [MPX13]. These authors developed this approach for PRAM algorithms for padded partitions. We adapt their approach to network decompositions in the distributed model of computation.
Optimization for Design of PID Controller Based on Improved PSO

A new algorithm which is the average local best position is presented to replace the local best of the traditional velocity update rule. One particle can acquire more messages of the other particles to adjust is movement in this method. Integrating PSO algorithm with PID controller, the three parameters of the PID controller can be optimized, which has the features of simple structure, easy implementation and robust performance. The simulation shows the PID controller integrated with the improved PSO algorithm achieved a good performance.
Cross-Layer P2P Traffic Engineering in Content-based Networks

Peer-to-peer (P2P) content sharing applications account for a significant fraction of the traffic volumes and is expected to increase [1]. Data is distributed to a large population of end client peers from end source peers in P2P systems, without the need for big investments to deploy servers. The costs of the content distribution are thus shared among end users and Internet service providers (ISPs). Consequently, negative impacts, such as increased inter-ISP traffic in particular, have become critical issues that need to be kept low, due to that most popular P2P protocols are not designed to be aware of network topology. On the other hand, substantial access burden at source peers’ side can be increased due to their limited uploading bandwidth capacities, compared to the massive data demand. The top-level technical objectives of this work are thus to 1) achieve optimised usage of network resources through reducing P2P content traffic, and at the same time, 2) to provide enhanced network support to P2P applications. Specifically, we address the above issues in mainly two ways: First, in order to reduce the P2P traffic load especially over the costly inter-ISP links, we propose an advanced hybrid scheme for peer selections across multi-domains, by promoting cooperation and non-cooperation among adjacent ISPs. An analytical modelling framework is developed for analysing inter-domain peer selection schemes concerning ISP business policies. Our analytical modelling framework can be used as a guide for analysing and evaluating future network-aware P2P peer selection paradigms in general multi-domain scenarios. Second, with the concern of improving service quality for P2P users in terms of content access delay and transmission delay, we propose an intelligent in-network caching scheme enabled by Information-Centric Networking (ICN). A simple analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching policy. We further design an ICN-driven protocol for the efficient P2P content delivery with in-network caching support. Bloom Filter (BF) techniques are adopted to save cache space and also to reduce communication overhead. A P2P-like content delivery simulator with In-network caching functionalities is built, with which extensive simulation experiments are conducted to validate the analytical results and to further prove the efficiency of the proposed caching scheme.
Automatic sense clustering in eurowordnet

This paper addresses ways in which we envisage to reduce the fine-grainedness of WordNet and express in a more systematic way the relations between its numerous sense distinctions. In the EuroWordNet project, we have distinguished various automatic methods for grouping senses into more coarse-grained sense groups. These resulting clusters reflect aspects of lexical organization, displaying a variety of semantic regularities or generalizations. In this way, the compatibility of the language-specific wordnets in the EuroWordNet multilingual knowledge base is increased.
Bioinformatics Original Paper a Comparison Study: Applying Segmentation to Array Cgh Data for Downstream Analyses

Motivation: Array comparative genomic hybridization (CGH) allows detection and mapping of copy number of DNA segments. A challenge is to make inferences about the copy number structure of the genome. Several statistical methods have been proposed to determine genomic segments with different copy number levels. However, to date, no comprehensive comparison of various characteristics of these methods exists. Moreover, the segmentation results have not been utilized in downstream analyses. Results: We describe a comparison of three popular and publicly available methods for the analysis of array CGH data and we demonstrate how segmentation results may be utilized in the downstream analyses such as testing and classification, yielding higher power and prediction accuracy. Since the methods operate on individual chromosomes, we also propose a novel procedure for merging segments across the genome, which results in an interpretable set of copy number levels, and thus facilitate identification of copy number alterations in each genome.
An upper bound on the zero-error list-coding capacity

Presents an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list-3 capacity of the 4/3 channel is at most 0.3512 bits, improving the best previous bound. The relation of the bound to earlier similar bounds, in particular, to Korner's (1986) graph-entropy bound, is discussed. >
The Peripheral Binding of 14-3-3γ to Membranes Involves Isoform-Specific Histidine Residues

Mammalian 14-3-3 protein scaffolds include seven conserved isoforms that bind numerous phosphorylated protein partners and regulate many cellular processes. Some 14-3-3-isoforms, notably γ, have elevated affinity for membranes, which might contribute to modulate the subcellular localization of the partners and substantiate the importance of investigating molecular mechanisms of membrane interaction. By applying surface plasmon resonance we here show that the binding to phospholipid bilayers is stimulated when 14-3-3γ is complexed with its partner, a peptide corresponding to the Ser19-phosphorylated N-terminal region of tyrosine hydroxylase. Moreover, membrane interaction is dependent on salts of kosmotropic ions, which also stabilize 14-3-3γ. Electrostatic analysis of available crystal structures of γ and of the non-membrane-binding ζ-isoform, complemented with molecular dynamics simulations, indicate that the electrostatic potential distribution of phosphopeptide-bound 14-3-3γ is optimal for interaction with the membrane through amphipathic helices at the N-terminal dimerization region. In addition, His158, and especially His195, both specific to 14-3-3γ and located at the convex lateral side, appeared to be pivotal for the ligand induced membrane interaction, as corroborated by site-directed mutagenesis. The participation of these histidine residues might be associated to their increased protonation upon membrane binding. Overall, these results reveal membrane-targeting motifs and give insights on mechanisms that furnish the 14-3-3γ scaffold with the capacity for tuned shuffling from soluble to membrane-bound states.
Evaluation of priority based real time scheduling algorithms: choices and tradeoffs

Real time scheduling algorithms like RM and EDF have been analyzed extensively in the literature. Many recent works on scheduling address energy consumption as a performance metric. In this work we analyze priority scheduling algorithms RM, EDF, and LLF along with a few power-aware scheduling algorithms: MLLF, RM_RCS and EDF_RCS. Our analysis addresses the following metrics: response time, response time jitter, latency, time complexity, preemptions, and energy consumption. We extend past work in this direction by characterizing the performance of the scheduling algorithms -- theoretically as well as experimentally. Results of our analysis can be used to control design choices for real time systems.
A minimal communication approach to parallel time integration

We explore an approach due to Nievergelt of decomposing a time-evolution equation along the time dimension and solving it in parallel with as little communication as possible between the processors. This method computes a map from initial conditions to final conditions locally on slices of the time-domain, and then patches these operators together into a global solution using a single communication step. A basic error analysis is given, and some comparisons are made with other parallel in time methods. Based on the assumption that parallel computation is cheap but communication is very expensive, it is shown that this method can be competitive for some problems. We present numerical simulations on graphic chips and on traditional parallel clusters using hundreds of processors for a variety of problems to show the practicality and scalability of the proposed method.
Independently-Developed Real-Time Systems on Multi-cores with Shared Resources

In this paper we propose a synchronization protocol for resource sharing among independently-developed real-time systems on multi-core platforms. The systems may use different scheduling policies and they may have their own local priority settings. Each system is allocated on a dedicated processor (core). In the proposed synchronization protocol, each system is abstracted by an interface which abstracts the information needed for supporting global resources. The protocol facilitates the composability of various real-time systems with different scheduling and priority settings on a multi-core platform. We have performed experimental evaluations and compared the performance of our proposed protocol (MSOS) against the two existing synchronization protocols MPCP and FMLP. The results show that the new synchronization protocol enables composability without any significant loss of performance. In fact, in most cases the new protocol performs better than at least one of the other two synchronization protocols. Hence, we believe that the proposed protocol is a viable solution for synchronization among independently-developed real-time systems executing on a multi-core platform.
Bone mass improved effect of icariin for postmenopausal osteoporosis in ovariectomy-induced rats: a meta-analysis and systematic review

Objective:Ovariectomy (OVX)-induced rats are the most frequently used animal model to research postmenopausal osteoporosis. Our objective was to summarize and critically assess the bone mass improved effect of icariin (ICA) for treatment of postmenopausal osteoporosis in an OVX-induced rat model. Methods:The PUBMED, EMBASE, and Chinese databases were searched from their inception date to February 2015. Two reviewers independently selected animal studies that evaluated the bone mass improved effect of ICA compared with control in OVX-induced rats. Extracted data were analyzed by RevMan statistical software, and the methodological quality of each study was assessed. Results:Seven studies with adequate randomization were included in the systematic review. Overall, ICA seemed to significantly improve bone mass as assessed using the bone mineral density (seven studies, n = 169; weighted mean difference, 0.02; 95% CI, 0.01-0.02, I2 = 77%, P < 0.00001) using a random-effects model. There is no significant difference between ICA and estrogen (E) (six studies, n = 128; weighted mean difference, 0.00; 95% CI, −0.00 to 0.01, I2 = 54%, P = 0.01). Conclusions:Bone mass improved effect of ICA for postmenopausal osteoporosis was observed in OVX-induced rats. Assessment of the methodological quality of studies involving OVX-induced animal models is required, and good methodological quality should be valued in systematic reviews of animal studies.
A tunable external cavity laser using a micromachined silicon flexure for atomic spectroscopy

This paper reports a novel external cavity diode laser system for applications in atomic physics that employs a micromachined silicon flexure to sweep the laser frequency near the rubidium absorption spectrum. The advantages of using a silicon flexure are its simple microfabrication process and reduction of the overall size of the laser system. The results demonstrate the 87Rb, 85Rb (rubidium) D2 line absorption at 780 nm in an atomic optics test experiment. Our novel laser system design has a size of 26.3 x 20 x 20 mm. The wavelength can be tuned and swept from 780.2533 to 780.2344 nm equivalent to 9.31 GHz using only piezoelectric transducer PZT actuators integrated on the silicon flexure. The deflection of the silicon flexure is 157.45 nm. The advantage of combining a VHG and a silicon flexure is that the frequency can be coarsely tuned to 780.24 nm and swept at this center frequency with a range of 9.31 GHz by PZT. Moreover, the frequency fine tuning can be achieved by changing the VHG temperature to observe the rubidium spectrum. The laser output power is measured as 9.72 mW at 780.24385 nm.
Multifrontral multithreaded rank-revealing sparse QR factorization

SuiteSparseQR is a sparse multifrontal QR factorization algorithm. Dense matrix methods within each frontal matrix enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel's Threading Building Blocks library. Rank-detection is performed within each frontal matrix using Heath's method, which does not require column pivoting. The resulting sparse QR factorization obtains a substantial fraction of the theoretical peak performance of a multicore computer.
On-board 22 kW fast charger “NLG6”

With NLG6, BRUSA enters a new dimension of charging! BRUSA Elektronik AG is the first company to produce a battery charger for electric vehicles that is capable of operating on a three-phase current with a power of up to 22 kW. Thereby, the fast charger will be able to fully charge a typical electric car in less than one hour, this is six time faster than the former technology (one-phase with 3.3 kW). Cars from a major European car manufacturer equipped with this charger are already available; other manufacturers have started the evaluation of the new charger in their vehicles [7]. It can be expected that the immense reduction of the charging time will influence the acceptance of e-mobility, as the charging time now corresponds to the duration of a shopping visit or just the time for taking a meal.
Social and health factors influencing poor nutritional status among rural elderly Malays.

BACKGROUND Older people especially those residing in rural areas are at a greater risk of malnutrition. OBJECTIVE To assess nutritional status and social and health factors influencing poor nutritional status among rural elderly Malays. DESIGN AND METHODS Cross-sectional study on 350 elderly Malays, aged 60 years and above selected from 11 traditional villages in a rural area of Malaysia. Nutritional status was assessed using anthropometric measurements such as body weight, height, demispan and mid-upper arm circumference (MUAC). A questionnaire was administered to obtain information on social and health aspects. Multiple regression analysis was used to determine social and health predictors of poor nutritional status as assessed by Body Mass Index (BMI) and mid-upper arm circumference (MUAC). RESULTS In this sample, 38% of the subjects were underweight according to BMI < 18.5 kg/m2, particularly women. Women were also found to be four and three times more likely to be peripherally wasted, as assessed respectively by MUAC (p<0.05), and by corrected arm muscle area (p<0.005). It was found that 12% of subjects were overweight, the majority of whom were women. The predictors of BMI were unable to cook, reported insufficient money to buy food, smokers and perceived weight loss. The predictors of MUAC were: unable to cook, single, reported insufficient money to buy food, smokers, loss of appetite, depended on others for main economic resources, and perceived weight loss. CONCLUSION The nutritional status of the elderly is rather unsatisfactory. Recognition of social and health factors associated with the poor nutritional status will allow appropriate intervention to enhance the quality of life of the elderly.
Flagellin-dependent TLR5/caveolin-1 as a promising immune activator in immunosenescence

The age‐associated decline of immune responses causes high susceptibility to infections and reduced vaccine efficacy in the elderly. However, the mechanisms underlying age‐related deficits are unclear. Here, we found that the expression and signaling of flagellin (FlaB)‐dependent Toll‐like receptor 5 (TLR5), unlike the other TLRs, were well maintained in old macrophages, similar to young macrophages. The expression and activation of TLR5/MyD88, but not TLR4, were sensitively regulated by the upregulation of caveolin‐1 in old macrophages through direct interaction. This interaction was also confirmed using macrophages from caveolin‐1 or MyD88 knockout mice. Because TLR5 and caveolin‐1 were well expressed in major old tissues including lung, skin, intestine, and spleen, we analyzed in vivo immune responses via a vaccine platform with FlaB as a mucosal adjuvant for the pneumococcal surface protein A (PspA) against Streptococcus pneumoniae infection in young and aged mice. The FlaB‐PspA fusion protein induced a significantly higher level of PspA‐specific IgG and IgA responses and demonstrated a high protective efficacy against a lethal challenge with live S. pneumoniae in aged mice. These results suggest that caveolin‐1/TLR5 signaling plays a key role in age‐associated innate immune responses and that FlaB‐PspA stimulation of TLR5 may be a new strategy for a mucosal vaccine adjuvant against pneumococcal infection in the elderly.
Modeling Queueing and Channel Access Delay in Unsaturated IEEE 802.11 Random Access MAC Based Wireless Networks

In this paper, we present an analytic model for evaluating the queueing delays and channel access times at nodes in wireless networks using the IEEE 802.11 Distributed Coordination Function (DCF) as the MAC protocol. The model can account for arbitrary arrival patterns, packet size distributions and number of nodes. Our model gives closed form expressions for obtaining the delay and queue length characteristics and models each node as a discrete time G/G/l queue. The service time distribution for the queues is derived by accounting for a number of factors including the channel access delay due to the shared medium, impact of packet collisions, the resulting backoffs as well as the packet size distribution. The model is also extended for ongoing proposals under consideration for 802.11e wherein a number of packets may be transmitted in a burst once the channel is accessed. Our analytical results are verified through extensive simulations. The results of our model can also be used for providing probabilistic quality of service guarantees and determining the number of nodes that can be accommodated while satisfying a given delay constraint.
Deriving animations from recursive definitions

This paper describes a generic method to derive an animation from a recursive definition, with the objective of debugging and understanding this definition by expliciting its control structure. This method is based on a well known algorithm of factorizing a recursive function into the composition of the producer and the consumer of its call tree. We developed a systematic method to transform both the resulting functions in order to draw the tree step by step. The theory of data types as fixed points of functors, generic recursion patterns, and monads, are fundamental to our work and are briefly presented. Using polytypic implementations of monadic recursion patterns and an application to manipulate and generate graph layouts we developed a prototype that, given a recursive function written in a subset of Haskell, returns a function whose execution yields the desired animation.
A tele-operated humanoid robot drives a lift truck

We have been developing new abilities of humanoid robots to realize proxy driving of a lift truck. Construction machines such as a lift truck play an important role in many tasks, but sometimes the environments are too hazardous for human operators. If a tele-operated humanoid robot can drive a construction machine, it can work at a dangerous place. This humanoid robot operator has two advantages over an automated construction machine. It is much easier to carry the robot to a disaster site than moving the special construction machine. Besides, the robot may be less expensive than developing the special automated machine whose required number is relatively small. We have been developing new abilities of the tele-operated humanoid robot HRP-1 to realize the application. The paper describes results of investigations and experiments for proxy driving of a lift truck by HRP-1.