Miracle-dz/UniFAR-FTUs huggingface dataset:
Millimeter-Wave Sources at 60 and 140 GHz by Magnetic-Plasmon-Waveguide-Based In-Phase Coupled Oscillator Network in 65-nm CMOS

High output power density millimeterwave (mm-wave) signal sources are demonstrated at 60 and 140 GHz by a magnetic plasmon waveguide (MPW) based in-phase coupled oscillator network (CON) in 65-nm CMOS. Each oscillator unit-cell is designed by an MPW-based low-loss inter-digital zero-phase coupler (ZPC). With multiple in-phase coupled ZPC unit-cells, a high output power mm-wave signal is generated at the center of the CON by an in-phase power combination. A 60-GHz CON-based signal source is implemented with four in-phase CON unit-cells at 60 GHz in a compact core chip area of 0.11 mm2. It is measured with 2-mW peak differential output power, 2.2% power efficiency, 18.2-mW/mm2 output power density, -113.9-dBc/Hz phase noise at 10-MHz offset, and 15.8% frequency tuning range (FTR) centered at 63.1 GHz. Moreover, a 140-GHz signal source is implemented by the combination of second-order harmonics of four in-phase coupled ZPC unit-cells at 70 GHz in a compact core chip area of 0.13 mm2. It is measured with 3.5-mW peak output power, 2.4% power efficiency, 26.9-mW/mm2 output power density, -104.9-dBc/Hz phase noise at 25-MHz offset, and 9.7% FTR centered at 133.5 GHz.
Estimability and Likelihood Inference for Generalized Linear Mixed Models Using Data Cloning

Maximum likelihood estimation for Generalized Linear Mixed Models (GLMM), an important class of statistical models with substantial applications in epidemiology, medical statistics, and many other fields, poses significant computational difficulties. In this article, we use data cloning, a simple computational method that exploits advances in Bayesian computation, in particular the Markov Chain Monte Carlo method, to obtain maximum likelihood estimators of the parameters in these models. This method also leads to a simple estimator of the asymptotic variance of the maximum likelihood estimators. Determining estimability of the parameters in a mixed model is, in general, a very difficult problem. Data cloning provides a simple graphical test to not only check if the full set of parameters is estimable but also, and perhaps more importantly, if a specified function of the parameters is estimable. One of the goals of mixed models is to predict random effects. We suggest a frequentist method to obtain prediction intervals for random effects. We illustrate data cloning in the GLMM context by analyzing the Logistic–Normal model for over-dispersed binary data, and the Poisson–Normal model for repeated and spatial counts data. We consider Normal–Normal and Binary–Normal mixture models to show how data cloning can be used to study estimability of various parameters. We contend that whenever hierarchical models are used, estimability of the parameters should be checked before drawing scientific inferences or making management decisions. Data cloning facilitates such a check on hierarchical models.
Greedy Embeddings , Trees , and Euclidean vs . Lobachevsky Geometry

A greedy embedding of an unweighted undirected graph G = (V, E) into a metric space (X, ρ) is a function f : V → X such that for every source-sink pair of different vertices s, t ∈ V it is the case that s has a neighbor v in G with ρ(f(v), f(t)) < ρ(f(s), f(t)). Finding greedy embeddings of connectivity graphs helps to build distributed routing schemes with compact routing tables. In this paper we take a refined look at greedy embeddings, previously addressed in [1, 2], by examining their description complexity as a key parameter in conjunction with their dimensionality. We give arguments showing that the dimensionality lower-bounds for monotone maps do not extend to greedy embeddings. We prove a unified O(log n) lower-bound on the dimension of no-stretch greedy embeddings when the host metric is Euclidean or Lobachevsky geometry. The essence of the lower bound entails showing that low-dimensional spaces lack the topological capacity to realize the embeddings of certain graphs with “hard crossroads. ” This technique might be of independent interest. We develop new methods for building concise embeddings of trees (and some other graphs) in 3-dimensional Lobachevsky spaces using recursive applications of hyperbolic isometries guided by caterpillar-like decompositions. Our embeddings improve over prior work [1] by achieving O(κ(T ) · log n) description complexity, where κ(T ) is the caterpillar dimension. We further demonstrate concise O(log n)-dimensional greedy embeddings of trees into Euclidean space using techniques inspired by [3], thereby strengthening our belief and intuition that all graphs can be embedded with no stretch in ` n) 2 .
Leaky Vaccines Protect Highly Exposed Recipients at a Lower Rate: Implications for Vaccine Efficacy Estimation and Sieve Analysis

“Leaky” vaccines are those for which vaccine-induced protection reduces infection rates on a per-exposure basis, as opposed to “all-or-none” vaccines, which reduce infection rates to zero for some fraction of subjects, independent of the number of exposures. Leaky vaccines therefore protect subjects with fewer exposures at a higher effective rate than subjects with more exposures. This simple observation has serious implications for analysis methodologies that rely on the assumption that the vaccine effect is homogeneous across subjects. We argue and show through examples that this heterogeneous vaccine effect leads to a violation of the proportional hazards assumption, to incomparability of infected cases across treatment groups, and to nonindependence of the distributions of the competing failure processes in a competing risks setting. We discuss implications for vaccine efficacy estimation, correlates of protection analysis, and mark-specific efficacy analysis (also known as sieve analysis).
A Structured Methodology for Developing IT Strategy

This paper presents a practical case study of a methodology for the systematic creation of an IT strategy, as developed at the University of Pretoria, a large South African research university. The methodology is pragmatic rather than academic and was developed for implementation in a university environment. The resulting strategy takes into account strategic alignment, business drivers and external influences. The current IT organisation and infrastructure is assessed and contextualised. IT risks, as aligned with the corporate risk management process, are identified, as are current and planned IT projects. The key results of the application of the methodology are a set of aligned and interlinked documents describing the IT strategy, enterprise architecture, IT governance and information technology planning.
Distance magic labelings of graphs

As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = k, where N(x) is the set of vertices adjacent to x. We completely solve the existence problem of 1-vertex-magic vertex labelings for all complete bipartite, tripartite and regular multipartite graphs, and obtain some non-existence results for other natural families of graphs.
Interactive Grid Architecture for Application Service Providers

This paper presents our Interactive Grid architecture for Application Service Providers (I-GASP). We envision IGASP as a solution for making computers available primarily for interactive use in a grid computing environment. A user might access such a computer for running diverse applications such as graphics rendering, scientific visualization or mechanical CAD. I-GASP consists of a grid middleware for provisioning these computers, remote display technology that goes across firewalls and several techniques for making the computers suitable for use in a grid environment, namely controlled shell and desktop, dynamic accounts, admission control, and monitoring and management agents. To minimize the amount of user data that needs to migrate to the assigned computer before an interactive session begins, we present our affinity scheduling algorithm that favors a computer where the user has previously had an interactive session.
A reliability transmission routing metric algorithm for wireless sensor network

A reliability transmission routing metric algorithm based on ETX was proposed, which aimed at the limited energy and the special requirement of transmission reliability for wireless sensor network. This paper finds the several key characteristics of wireless sensor networks communication link, such as high loss rate, obvious asymmetry, according to the experimental study. From these, an energy efficient and reliable routing metric algorithms is provided. Then the routing metric proposed in the paper is adopted to improve the traditional AODV routing protocol. Simulation results show that this algorithm is an excellent routing metric for improving reliability transmission.
A Modified Magnitude System that Produces Well-Behaved Magnitudes, Colors, and Errors Even for Low Signal-to-Noise Ratio Measurements

We describe a modification of the usual definition of astronomical magnitudes, replacing the usual logarithm with an inverse hyperbolic sine function; we call these modified magnitudes "asinh magnitudes. " For objects detected at signal-to-noise ratios of greater than about 5, our modified definition is essentially identical to the traditional one; for fainter objects (including those with a formally negative flux), our definition is well behaved, tending to a definite value with finite errors as the flux goes to zero. This new definition is especially useful when considering the colors of faint objects, as the difference of two "asinh" magnitudes measures the usual flux ratio for bright objects, while avoiding the problems caused by dividing two very uncertain values for faint objects. The Sloan Digital Sky Survey data products will use this scheme to express all magnitudes in their catalogs.
Trust and Privacy: Informal Ways to Assess Risk on Opportunistic Exchanges

With the astounding number of mobile devices and the increase of wireless capabilities, including the possibilities of direct interactions between them, without the use of a provider, the overall scenario becomes increasingly attractive. Whether on the way to work or out shopping, opportunistic encounters and exchanges of information can take place and render windows of opportunity, given one has the right tools. This work deals with the problem of assessing the risks that users take to interact with each other without a reliable source of information that could assign them a trust level. Informal signs such as periodicity of eventual early encounters are used to assess trust. The trust management system uses an ontology to normalize terms and facilitate the conversation between newly encountered concepts, possibly from other ontologies. A case is implemented to show the system’s possibilities.
Avoiding convergence in cooperative coevolution with novelty search

Cooperative coevolution is an approach for evolving solutions composed of coadapted components. Previous research has shown, however, that cooperative coevolutionary algorithms are biased towards stability: they tend to converge prematurely to equilibrium states, instead of converging to optimal or near-optimal solutions. In single-population evolutionary algorithms, novelty search has been shown capable of avoiding premature convergence to local optima - a pathology similar to convergence to equilibrium states. In this study, we demonstrate how novelty search can be applied to cooperative coevolution by proposing two new algorithms. The first algorithm promotes behavioural novelty at the team level (NS-T), while the second promotes novelty at the individual agent level (NS-I). The proposed algorithms are evaluated in two popular multiagent tasks: predator-prey pursuit and keepaway soccer. An analysis of the explored collaboration space shows that (i) fitness-based evolution tends to quickly converge to poor equilibrium states, (ii) "NS-I" almost never reaches any equilibrium state due to constant change in the individual populations, while (iii) "NS-T" explores a variety of equilibrium states in each evolutionary run and thus significantly outperforms both fitness-based evolution and "NS-I".
Comparative evaluation of heuristics for time slot assignment in IEEE 802.16j relay networks

In this paper, we propose two heuristic algorithms for time slot assignment in IEEE 802.16j relay networks. In the proposed methods, we calculate an appropriate group of time slots for each link in the network or calculate an appropriate group of links for each time slot. We show that the latter algorithm is better in terms of the balance between the calculation time and network performance.
On boundary value problems for second-order discrete inclusions

We prove some existence theorems regarding solutions to boundary value problems for systems of second-order discrete inclusions. For a certain class of right-hand sides, we present some lemmas showing that all solutions to discrete second-order inclusions satisfy an a priori bound. Then we apply these a priori bounds, in conjunction with an appropriate fixed point theorem for inclusions, to obtain the existence of solutions. The theory is highlighted with several examples.
Computer Model for Automobile Climate Control System Simulation and Application

A software to simulate the dynamic operation of climate control system for a generic automobile has been developed. The transient nature of passenger cabin temperature and relative humidity are predicted using the principles of thermodynamics. Analysis include detailed simulations of every component of the automobile air conditioning network. The methodology is validated by comparing the simulation results with the experimental results.
Cell Wall Remodeling in Abscission Zone Cells during Ethylene-Promoted Fruit Abscission in Citrus

Abscission is a cell separation process by which plants can shed organs such as fruits, leaves, or flowers. The process takes place in specific locations termed abscission zones. In fruit crops like citrus, fruit abscission represents a high percentage of annual yield losses. Thus, understanding the molecular regulation of abscission is of capital relevance to control production. To identify genes preferentially expressed within the citrus fruit abscission zone (AZ-C), we performed a comparative transcriptomics assay at the cell type resolution level between the AZ-C and adjacent fruit rind cells (non-abscising tissue) during ethylene-promoted abscission. Our strategy combined laser microdissection with microarray analysis. Cell wall modification-related gene families displayed prominent representation in the AZ-C. Phylogenetic analyses of such gene families revealed a link between phylogenetic proximity and expression pattern during abscission suggesting highly conserved roles for specific members of these families in abscission. Our transcriptomic data was validated with (and strongly supported by) a parallel approach consisting on anatomical, histochemical and biochemical analyses on the AZ-C during fruit abscission. Our work identifies genes potentially involved in organ abscission and provides relevant data for future biotechnology approaches aimed at controlling such crucial process for citrus yield.
What Can We Learn from Bargaining Models About Union Power? The Decline in Union Power in Germany, 1992–2009

type="main"> Building on the right-to-manage model of collective bargaining, this paper tries to infer union power from the observed results in wage setting. It derives a time-varying indicator of union strength taking account of taxation, unemployment benefits, and the labour market situation and confronts this indicator with annual data for Germany. The results show that union power did not change much from 1992 to 2002 but fell markedly (by about one-third) from 2002 to 2007 in the aftermath of substantial labour market reforms.
Enriching the Bioscope Corpus with Lexical and Syntactic Information

This paper details the method used to augment an epistemic modality corpus (the Bioscope corpus), incorporating results from the lexical and syntactic analysis of its sentences. The features resulting from these analyses were consolidated in a single data structure, that can be used for interactive experimentation on the corpus. Some visualization aids developed for corpus browsing are also described.
Quasithermal neutrinos from rotating protoneutron stars born during core collapse of massive stars

Rotating and magnetized protoneutron stars (PNSs) may drive relativistic magneto-centrifugally accelerated winds as they cool immediately after core collapse. The wind fluid near the star is composed of neutrons and protons, and the neutrons become relativistic while collisionally coupled with the ions. Here, we argue that the neutrons in the flow eventually undergo inelastic collisions around the termination shock inside the stellar material, producing ~0.1-1 GeV neutrinos, without relying on cosmic-ray acceleration mechanisms. Even higher-energy neutrinos may be produced via particle acceleration mechanisms. We show that PINGU and Hyper-Kamiokande can detect such neutrinos from nearby core-collapse supernovae, by reducing the atmospheric neutrino background via coincident detection of MeV neutrinos or gravitational waves and optical observations. Detection of these GeV and/or higher-energy neutrinos would provide important clues to the physics of magnetic acceleration, nucleosynthesis, the relation between supernovae and gamma-ray bursts, and the properties of newly born neutron stars.
Efficient and secure routing protocol for wireless sensor networks using mine detection An extension of triple umpiring system for WSN

It is a significant challenge to design a secure routing protocol for wireless sensor networks (WSN), because a WSN has dynamic topology, limited energy, confined computing ability and small memory size. The performance metrics usually considered when working with a WSN are power consumption, connectivity, scalability, and limited resources. Sensor nodes play the dual role of data collection and routing and therefore need energy to perform. Malfunctioning of a few nodes, due to hardware or lack of energy, in the network will cause significant topology changes, leading to greater consumption of energy and rerouting of packets. Triple Umpiring System (TUS) has already been proved its better performance on mobile ad hoc network (MANET) in which each node in the path from source to destination has dual roles to perform: Packet forwarding and umpiring. In this paper, we modified the TUS by incorporating Mine detection feature. Extensive investigation studies using Qualnet 5.0 simulator show that Mine detection significantly improves the Packet Delivery Ratio and decreases the latency in packet delivery.
Distributed Storage and Querying Techniques for a Semantic Web of Scientific Workflow Provenance

In scientific workflow environments, scientific discovery reproducibility, result interpretation, and problem diagnosis primarily depend on provenance, which records the history of an in-silico experiment. Resource Description Framework is frequently used to represent provenance based on vocabularies such as the Open Provenance Model. For complex scientific workflows that generate large amounts of RDF triples, single-machine provenance management becomes inadequate over time. In this paper, we research how HBase Bigtable-like capabilities can be leveraged for distributed storage and querying of provenance data represented in RDF. In particular, we architect the ProvBase system that incorporates an HBase/Hadoop backend, propose a storage schema to hold provenance triples, and design querying algorithms to evaluate SPARQL queries in the system. Using the Third Provenance Challenge queries, we conduct an experimental study to show the feasibility of our approach.
Learning Term Taxonomy Relationship from a Large Collection of Plain Text

In this paper, we present a heuristic for labeling a given term a taxonomy label. Specifically, for a given term, our goal is to construct a model for determining an "is-a" relationship between the given term and an inferred concept. Such term-labelling problem is not new, but the existing solutions require semi-supervised training processing, e.g., supervised LDA, or rely on lexicographers, e.g., wordnet. The model construction cost becomes burdens for employing such semantic understanding capability in various emerging applications. Aiming at these issues, in this study, we present a lightweight approach with the following features. First, the proposed approach is unsupervised and take only pain text as inputs. Second, the proposed approach allows incremental model construction. Third, the proposed approach is simple but effective and computationally efficient in comparison with the existing solutions. We demonstrate these results through experiments by comparing our approach with DBpedia and employ the popular search terms as test set. From experiment results, we see that 30 percent improvement in accuracy can be achieved by the proposed approach.
A Systematic Mapping Study on Gamified Software Quality

Gamified software is currently very popular, and it is expected that it will be widely adopted over the coming years. The social impact of gamified software will probably be very high, and we therefore believe that the assessment and improvement of gamified software quality may be necessary. The aim of this paper is to present a systematic mapping study (SMS) carried out to discover the current state of the research on software gamification quality, in order to identify gaps that merit rigorous future investigation. This SMS allowed us to select 35 papers found in five digital libraries up to April 2014. This paper summarizes the main issues of the planning and the conducting of the SMS. The main results of the data synthesis are detailed and future work is also outlined.
Automatic Translation of Court Judgments

This document presents an experiment in the automatic translation of Canadian Court judgments from English to French and from French to English. We show that although the language used in this type of legal text is complex and specialized, an SMT system can produce intelligible and useful translations, provided that the system can be trained on a vast amount of legal text. We also describe the results of a human evaluation of the output of the system.
Exchange Rate Pass-Through in Turkey : Looking for Asymmetries

This paper uses the VAR framework introduced in McCarthy (1999) to investigate the nature and extent of pass-through to prices in Turkey. Furthermore, Threshold VAR (TVAR) models are used to assess the possibility of asymmetries in the pass-through. Annual change in the industrial production index, exchange rate and inflation as well as deviation of the change in annual exchange rate from its sample mean are used as threshold variables. The latter variable is used to capture asymmetric effects of small versus big changes in exchange rates on the extent of pass-through. Estimating several TVAR models imply significant asymmetries in the relationship between exchange rate and inflation as measured by Wholesale and Consumer Price Indices. More specifically, we find that pass-through to prices is lower during significant economic contractions, periods with higher exchange rate depreciation and periods with lower inflation. Evidence for asymmetries arise from the magnitude of the change in exchange rates is weaker and quantitatively not very significant.