Miracle-dz/UniFAR-FTUs huggingface dataset:
Performance Analysis of Dual-Priority Multilayer Multistage Interconnection Networks under Multicast Environment

Next-generation network architectures strive to achieve high bandwidth and ultralow latency for the packets traversing the offered end-to-end paths. Multistage Interconnection Networks (MINs) are often employed for implementing NGNs, but while MINs are fairly flexible in handling varieties of traffic loads, they tend to quickly saturate under broadcast and multicast traffic, especially at increasing size networks. As a response to this issue, multilayer MINs have been proposed, however their performance prediction and evaluation has not been studied sufficiently insofar. In this paper, we evaluate and discuss the performance of multilayer MINs under multicast traffic, considering also two levels of packet priorities, since support for multiple QoS levels is an indispensible requirement for NGNs. Different offered loads and buffer size configurations are examined in this context, and performance results are given for the two most important network performance factors, namely packet throughput and delay. We also introduce and calculate a universal performance fac­tor, which includes the importance aspect of each of the above main performance factors. The findings of this study can be used by NGN system designers in order to predict the performance of each configuration and adjust the design of their communication infrastructure to the traffic requirements at hand.
The comfort of approach: self-soothing effects of behavioral approach in response to meaning violations

People maintain systems of beliefs that provide them with a sense of belongingness, control, identity, and meaning, more generally. Recent research shows that when these beliefs are threatened a syndrome of negatively valenced arousal is evoked that motivates people to seek comfort in their ideologies or other personally valued beliefs. In this paper we will provide an overview of this process and discuss areas for future research. Beginning with the neural foundations of meaning violations, we review findings that show the anterior cingulate cortex is responsible for detecting inconsistencies, and importantly, that this is experienced as aversive. Next, we evaluate the evidential support for a psychophysiological arousal response as measured by cardiography and skin conductance. We discuss how current theorizing proposes that subsequent behavioral approach ameliorates the negative arousal and serves as an effective, well-adapted coping response, but we also aim to further integrate this process in the existing threat-compensation literature. Finally, we speculate on whether approach motivation is likely to result when one feels capable of handling the threat, thereby incorporating the biopsychosocial model that distinguishes between challenge and threat into the motivational threat-response literature. We believe the current literature on threat and meaning has much to offer and we aim to provide new incentives for further development.
Position-restricted approximate string matching with metric Hamming distance

Approximate string matching is an important problem in many applications such as computer security, bioinformatics, and time series analysis. This paper presents a simple data structure for the position-restricted approximate string matching problem under a metric distance measure. In the problem discussed in this paper, a query is given as a triplet of a pattern string of a fixed length, a threshold, and a searching interval, so all occurrences of the pattern in the interval on a preprocessed text allowing errors within the threshold should be reported. Our proposed method is a framework which combines metric data structures and succinct rank/select data structure, and allows to execute such position-restricted approximate string matching queries efficiently. We show the experimental results to demonstrate when and how our method outperforms other alternatives.
Approximating Directed Steiner Problems via Tree Embedding

In the k-edge connected directed Steiner tree (k-DST) problem, we are given a directed graph G on n vertices with edge-costs, a root vertex r, a set of h terminals T and an integer k. The goal is to find a min-cost subgraph H of G that connects r to each terminal t by k edge-disjoint r,t-paths. This problem includes as special cases the well-known directed Steiner tree (DST) problem (the case k = 1) and the group Steiner tree (GST) problem. Despite having been studied and mentioned many times in literature, e.g., by Feldman et al. [SODA'09, JCSS'12], by Cheriyan et al. [SODA'12, TALG'14] and by Laekhanukit [SODA'14], there was no known non-trivial approximation algorithm for k-DST for k >= 2 even in the special case that an input graph is directed acyclic and has a constant number of layers. If an input graph is not acyclic, the complexity status of k-DST is not known even for a very strict special case that k= 2 and |T| = 2. In this paper, we make a progress toward developing a non-trivial approximation algorithm for k-DST. We present an O(D k^{D-1} log n)-approximation algorithm for k-DST on directed acyclic graphs (DAGs) with D layers, which can be extended to a special case of k-DST on "general graphs" when an instance has a D-shallow optimal solution, i.e., there exist k edge-disjoint r,t-paths, each of length at most D, for every terminal t. For the case k= 1 (DST), our algorithm yields an approximation ratio of O(D log h), thus implying an O(log^3 h)-approximation algorithm for DST that runs in quasi-polynomial-time (due to the height-reduction of Zelikovsky [Algorithmica'97]). Consequently, as our algorithm works for general graphs, we obtain an O(D k^{D-1} log n)-approximation algorithm for a D-shallow instance of the k-edge-connected directed Steiner subgraph problem, where we wish to connect every pair of terminals by k-edge-disjoint paths.
Representing Data by a Mixture of Activated Simplices

We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our method requires that the data are unit normalized (and thus lie on the unit sphere). We show that under this restriction, building a model with simplices amounts to constructing a convex hull inside the sphere whose boundary facets is close to the data. We call the boundary facets of the convex hull that are close to the data Activated Simplices. While the total number of bases used to build the simplices is a parameter of the model, the dimensions of the individual activated simplices are learned from the data. Simplices can have different dimensions, which facilitates modeling of inhomogeneous data sources. The simplicial structure is bounded --- this is appropriate for modeling data with constraints, such as human elbows can not bend more than 180 degrees. The simplices are easy to interpret and extremes within the data can be discovered among the vertices. The method provides good reconstruction and regularization. It supports good nearest neighbor classification and it allows realistic generative models to be constructed. It achieves state-of-the-art results on benchmark datasets, including 3D poses and digits.
A reversible mesoscopic model of diffusion in liquids: from giant fluctuations to Fick’s law

We study diffusive mixing in the presence of thermal fluctuations under the assumption of large Schmidt number. In this regime we obtain a limiting equation that contains a diffusive stochastic drift term with diffusion coefficient obeying a Stokes–Einstein relation, in addition to the expected advection by a random velocity. The overdamped limit correctly reproduces both the enhanced diffusion in the ensemble-averaged mean and the long-range correlated giant fluctuations in individual realizations of the mixing process, and is amenable to efficient numerical solution. Through a combination of Eulerian and Lagrangian numerical methods we demonstrate that diffusion in liquids is not most fundamentally described by Fick’s irreversible law; rather, diffusion is better modeled as reversible random advection by thermal velocity fluctuations. We find that the diffusion coefficient is effectively renormalized to a value that depends on the scale of observation. Our work reveals somewhat unexpected connections between flows at small scales, dominated by thermal fluctuations, and flows at large scales, dominated by turbulent fluctuations.
Optimization of Biosorptive Removal of Dye from Aqueous System by Cone Shell of Calabrian Pine

The biosorption performance of raw cone shell of Calabrian pine for C.I. Basic Red 46 as a model azo dye from aqueous system was optimized using Taguchi experimental design methodology. L9 (33) orthogonal array was used to optimize the dye biosorption by the pine cone shell. The selected factors and their levels were biosorbent particle size, dye concentration, and contact time. The predicted dye biosorption capacity for the pine cone shell from Taguchi design was obtained as 71.770 mg g−1 under optimized biosorption conditions. This experimental design provided reasonable predictive performance of dye biosorption by the biosorbent (R 2: 0.9961). Langmuir model fitted better to the biosorption equilibrium data than Freundlich model. This displayed the monolayer coverage of dye molecules on the biosorbent surface. Dubinin-Radushkevich model and the standard Gibbs free energy change proposed physical biosorption for predominant mechanism. The logistic function presented the best fit to the data of biosorption kinetics. The kinetic parameters reflecting biosorption performance were also evaluated. The optimization study revealed that the pine cone shell can be an effective and economically feasible biosorbent for the removal of dye.
Controller coefficient truncation using Lyapunov performance certificate

We describe a method for truncating the coefficients of a linear controller while guaranteeing that a given set of relaxed performance constraints is met. Our method sequentially and greedily truncates individual coefficients, using a Lyapunov certificate, typically in linear matrix inequality (LMI) form, to guarantee performance. Numerical examples show that the method is surprisingly effective at finding controllers with aggressively truncated coefficients, that meet typical performance constraints.
Efficient large-scale image annotation by probabilistic collaborative multi-label propagation

Annotating large-scale image corpus requires huge amount of human efforts and is thus generally unaffordable, which directly motivates recent development of semi-supervised or active annotation methods. In this paper we revisit this notoriously challenging problem and develop a novel multi-label propagation scheme, whereby both the efficacy and accuracy of large-scale image annotation are further enhanced. Our investigation starts from a survey of previous graph propagation based annotation approaches, wherein we analyze their main drawbacks when scaling up to large-scale datasets and handling multi-label setting. Our proposed scheme outperforms the state-of-the-art algorithms by making the following contributions. 1) Unlike previous approaches that propagate over individual label independently, our proposed large-scale multi-label propagation (LSMP) scheme encodes the tag information of an image as a unit label confidence vector, which naturally imposes inter-label constraints and manipulates labels interactively. It then utilizes the probabilistic Kullback-Leibler divergence for problem formulation on multi-label propagation. 2) We perform the multi-label propagation on the so-called hashing-based L1-graph, which is efficiently derived with Locality Sensitive Hashing approach followed by sparse L1-graph construction within the individual hashing buckets. 3) An efficient and convergency provable iterative procedure is presented for problem optimization. Extensive experiments on NUS-WIDE dataset (both lite version with 56k images and full version with 270k images) well validate the effectiveness and scalability of the proposed approach.
Removal of methylene blue from aqueous solution by adsorption onto NaOH-treated rambutan peel

Adsorption of methylene blue (MB) by NaOH-treated rambutan peel (N-RP) was examined. The adsorption experiments were carried out under different conditions of initial concentration (25-500 mg/L), solution pH 2-12 and N-RP dose (0.05-1.0 g). The influence of these parameters on the adsorption capacity was studied using the batch process. MB adsorption uptake was found to increase with increase in initial concentration and contact time. The MB adsorption was unfavourable at pH<;4. Langmuir, Freundlich and Temkin isotherm models were used to illustrate the experimental isotherms and isotherms constant. The equilibrium data were best represented by Langmuir isothem model, showing maximum monolayer adsorption capacity of 231.34 mg/g. The rates of adsorption were found to obey the rules of pseudo-second order model with good correlation. The result suggested that the N-RP would be an excellent alternative for the removal of MB by adsorption process.
Application of the Wavelet Packet Transform for the Identification of Chaotic Signals in the Current-Programmed DC/DC Boost Converters

The wavelet packet transform (WPT), a digital realization of the wavelet transform (WT), has been used in this work for identifying and characterizing sub-harmonic and chaotic signals in a current-mode-controlled boost converter. The operation of the boost converter under current-programmed control is explained, and some computer-generated waveforms are presented in order to illustrate the various possible operating regimes of the current-programmed dc/dc converters. Samples of the state variables of different periodic and chaotic operating conditions of the converter are decomposed up to a certain level of resolution of the wavelet packet tree using a selected mother wavelet in order to characterize different sub-harmonic and chaotic signals occurred in the converter. The wavelet-transformed coefficients of the sampled state variables of different frequency sub bands of the wavelet packet tree are able to differentiate effectively between different periodic and chaotic operating conditions of the converter.
Small Open Chemical Systems Theory and Its Implications to Darwinian Evolutionary Dynamics, Complex Self-Organization and Beyond

The study of biological cells in terms of mesoscopic, nonequilibrium, nonlinear, stochastic dynamics of open chemical systems provides a paradigm for other complex, self-organizing systems with ultra-fast stochastic fluctuations, short-time deterministic nonlinear dynamics, and long-time evolutionary behavior with exponentially distributed rare events, discrete jumps among punctuated equilibria, and catastrophe.
Heuristic Motion Planning with Many Degrees of Freedom

We present a general heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search strategy which makes inquiries about feasible paths; to answer these, we develop an efficient collision detection scheme that handles translations and rotations of polyhedra to compute all times of collision. The whole algorithm can be easily implemented and universally applied and has been successfully tested in a program for assembly planning.
Loss of Hsp110 Leads to Age-Dependent Tau Hyperphosphorylation and Early Accumulation of Insoluble Amyloid β

ABSTRACT Accumulation of tau into neurofibrillary tangles is a pathological consequence of Alzheimer's disease and other tauopathies. Failures of the quality control mechanisms by the heat shock proteins (Hsps) positively correlate with the appearance of such neurodegenerative diseases. However, in vivo genetic evidence for the roles of Hsps in neurodegeneration remains elusive. Hsp110 is a nucleotide exchange factor for Hsp70, and direct substrate binding to Hsp110 may facilitate substrate folding. Hsp70 complexes have been implicated in tau phosphorylation state and amyloid precursor protein (APP) processing. To provide evidence for a role for Hsp110 in central nervous system homeostasis, we have generated hsp110−/− mice. Our results show that hsp110−/− mice exhibit accumulation of hyperphosphorylated-tau (p-tau) and neurodegeneration. We also demonstrate that Hsp110 is in complexes with tau, other molecular chaperones, and protein phosphatase 2A (PP2A). Surprisingly, high levels of PP2A remain bound to tau but with significantly reduced activity in brain extracts from aged hsp110−/− mice compared to brain extracts from wild-type mice. Mice deficient in the Hsp110 partner (Hsp70) also exhibit a phenotype comparable to that of hsp110−/− mice, confirming a critical role for Hsp110-Hsp70 in maintaining tau in its unphosphorylated form during aging. In addition, crossing hsp110−/− mice with mice overexpressing mutant APP (APPβsw) leads to selective appearance of insoluble amyloid β42 (Aβ42), suggesting an essential role for Hsp110 in APP processing and Aβ generation. Thus, our findings provide in vivo evidence that Hsp110 plays a critical function in tau phosphorylation state through maintenance of efficient PP2A activity, confirming its role in pathogenesis of Alzheimer's disease and other tauopathies.
Influence of the Substrate / Photoactive Solution Interaction in Patterning and Adhesion of Photodeposited Films

Using the photochemical deposition of chromium hydroxide layers driven by a continuous Ar laser wave in a potassium chromate solution, we explored the adhesion and patterning properties of the induced deposit on glass substrates versus the composition and the pH of the photoactive solution. The experiments were performed with two interfering beams imprinting an optical pattern on the substrate and analyzing the resulting morphology of the deposit. The solubility, patterning and adhesion are investigated using both organic (acetic acid) and inorganic ( ) acids. The observed adhesion as a function of the HCl pH in the photodeposition process (surface versus bulk) was compared for several substrates. 1 ha l-0 00 95 27 1, v er si on 1 15 M ay 2 00 9 Author manuscript, published in "Applied Surface Science vol. 248, 1-4 (2005) 479-483" DOI : 10.1016/j.apsusc. 2005.03. 068 Ms# L-4053 Revised Version 4-ICPEPA, Lecce Italy 5-9 September 2004 PACS Numbers: 81.15. Fg, 81.10. Dn, 42.40. Eq, 42.70. Gi
Partnership reviewing: a cooperative approach for peer review of complex educational resources

Review of digital educational resources, such as course modules, simulations, and data analysis tools, can differ from review of scholarly articles, in the heterogeneity and complexity of the resources themselves. The Partnership Review Model, as demonstrated in two cases, appears to promote cooperative interactions between distributed resource reviewers, enabling reviewers to effectively divide up the task of reviewing complex resources with little explicit coordination. The shared structural outline of the resource made visible in the review environment enables participants to monitor other reviewers' actions and to thus target their efforts accordingly. This reviewing approach may be effective in educational digital libraries that depend on community volunteers for most of their reviewing.
Safety and Efficacy Data on Vaccines and Immunization to Human Papillomavirus

Since the discovery of the causal association between human papillomavirus (HPV) and cervical cancer, efforts to develop an effective prophylactic vaccine to prevent high-risk HPV infections have been at the forefront of modern medical research. HPV causes 530,000 cervical cancer cases worldwide, which is the second most common cause of cancer deaths in women; a worldwide collaboration among epidemiologists, molecular biologists, vaccinologists, virologists, and clinicians helped lead to the development of two highly effective prophylactive HPV vaccines. The first, Gardasil, is a quadrivalent vaccine made up of recombinant HPV L1 capsid proteins from the two high-risk HPV types (16/18) responsible for 70% of cervical cancer cases as well as two low-risk HPV types (6/11) which are the causative agent for genital warts. The second, Cervarix, is a bivalent vaccine that was FDA approved three years after Gardasil and is also composed of L1 capsid proteins from HPV types 16/18. This review article focuses on the safety and efficacy data of both FDA-approved vaccines, as well as highlighting a few advances in future HPV vaccines that show promise in becoming additional treatment options for this worldwide disease.
Identification : Revisiting the Online Consumer Purchasing Intent Research

Every business dreams of having committed, loyal and enthusiastic customers. However, many challenges stand in the way. This is especially true of electronic vendors who must not only grapple with the traditional product issues but also technology issues related to competition in the digital economy. Prior studies in information systems have emphasized technology and relational factors such as trust and stickiness in their modeling. This study proposes website identification as a concept that can help turn customers into “super customers” and provide lasting and deep relationships between the electronic vendor and the customer leading to creation of economic value. A structural equation model with website identification as a mediating variable was tested using a sample of 406 individuals. The results support the model hypotheses.
On the distribution of Brownian areas

We nd the distribution of the areas under the positive parts of a Brownian motion process and a Brownian bridge process, and compare these distributions with the corresponding areas for the absolute values of these processes. AMS 1980 subject classiications. Primary: 60G15, 60G999 secondary 60E05.
C Consiglio Nazionale delle Ricerche The sociable traveller : human travelling patterns in social-based mobility

Understanding how humans move is a key factor for the design and evaluation of networking protocols and mobility management solutions in mobile networks. This is particularly true for mobile scenarios in which conventional singlehop access to the infrastructure is not always possible, and multi-hop wireless forwarding is a must. We specifically focus on one of the most recent mobile networking paradigms, i.e., opportunistic networks. In this paradigm the communication takes place directly between the personal devices (e.g., smartphones and PDAs) that the users carry with them during their daily activities, without any assumption about pre-existing infrastructures. Among all mobility characteristics that may affect the performance of opportunistic networks, the users’ travelling patterns have recently gained a lot of attention due to their impact on the spreading of both viruses and messages in such a network. In this paper we consider a social-based mobility model (HCMM) and we extend this model to account for the typical travelling behaviour of users. To the best of our knowledge, the resulting mobility model is the first model in which movements driven by social relations also match statistical features of travelling patterns as measured in reality. Finally, we evaluate our proposal through simulations over a wide range of scenarios, emphasizing the effect of finite sampling on the obtained results.