Miracle-dz/UniFAR-FTUs huggingface dataset:
The Industrial Organisation of the Australian Agricultural Economics Society

There has recently been much soul searching among US agricultural economists concerning future directions of the American Agricultural Economics Association. In Australia, however, little direct attention has been paid to the Australian Agricultural Economics Society. Utilising an industrial organisation framework, this paper seeks to investigate issues pertaining to the structure, conduct and performance of the Society. To that end, a survey of members was recently undertaken. This information, along with the views of Past Presidents of the Society, minutes of previous Annual General Meetings and student feedback on the future direction of the profession, is used as the main database for the analysis. The results suggest that, while demand for the product mix is generally strong, supply constraints are impinging on the performance of the Society. Alternative approaches to overcoming these constraints are explored.
How to Measure the Tax Burden on Labour at the Macro-Level?

The purpose of this paper is threefold. First, we survey the way in which the tax burden on labour has been proxied for in recent multi-country macro-economic studies. Second, we critically evaluate these proxies. Finally, we examine to what extent the conclusions of some studies change if some alternative indicator for the tax burden on labour is employed. We conclude that the widely used tax ratios as developed by Mendoza et al. (1994) may not be very reliable. The choice of the indicator for the tax burden on labour is also shown to affect the conclusions of some well-known empirical models.
A review on travelling wave solutions of one-dimensional reaction diffusion equations with non-linear diffusion term

In this paper we review the existence of different types of travelling wave solutions $u(x,t) = \phi(x - ct)$ of degenerate non-linear reaction-diffusion equations of the form $u_t = [D(u)u_x]_x + g(u)$ for different density-dependent diffusion coefficients D and kinetic part g. These include the non-linear degenerate generalized Fisher-KPP and the Nagumo equations. Also, we consider an equation whose diffusion coefficient changes sign as the diffusive substance increases. This describes a diffusive-aggregative process. In this case the travelling wave solutions are explored and the ill-posedness of two boundary-value problems associated with the above equation is stated.
A Regularized Sampling Method for Solving Three-Dimensional Inverse Scattering Problems

The inverse scattering problem under consideration is to determine the shape of an obstacle in $\RE^3$ from a knowledge of the time harmonic incident acoustic wave and the far field pattern of the scattered wave with frequency in the resonance region. A method for solving this nonlinear and improperly posed problem is presented which is based on solving a linear integral equation of the first kind and avoids the use of nonlinear optimization methods. Numerical examples are given showing the practicality of this new approach.
Systematic construction of full diversity algebraic constellations

A simple and systematic approach for constructing full diversity m-dimensional constellations, carved from lattices over a number ring R, is proposed for an arbitrary dimension m. When R=Z[wn], the nth cyclotomic number ring, all the possible dimensions that allow for achieving the optimal minimum product distances using the proposed approach are determined. It turns out that one can construct optimal unitary transformations using our construction if and only if m factors into a power of 2 and powers of the primes dividing n. For m not satisfying these conditions, a method based on Diophantine approximation theory is proposed to "optimize" the minimum product distance. A lower bound on the product distance is given in this case, thus ensuring full diversity with "good" minimum product distances. Furthermore, the proposed approach subsumes the optimal unitary transformations proposed by Giraud et al. over R=Z[w4] and R=Z[w3], while giving optimal unitary transformations for infinitely many new values of n and m.
Detecting Duplicate Bug Report Using Character N-Gram-Based Features

We present an approach to identify duplicate bug reports expressed in free-form text. Duplicate reports needs to be identified to avoid a situation where duplicate reports get assigned to multiple developers. Also, duplicate reports can contain complementary information which can be useful for bug fixing. Automatic identification of duplicate reports (from thousands of existing reports in a bug repository) can increase the productivity of a Triager by reducing the amount of time a Triager spends in searching for duplicate bug reports of any incoming report. The proposed method uses character N-gram-based model for the task of duplicate bug report detection. Previous approaches are word-based whereas this study investigates the usefulness of low-level features based on characters which have certain inherent advantages (such as natural-language independence, robustness towards noisy data and effective handling of domain specific term variations) over word-based features for the problem of duplicate bug report detection. The proposed solution is evaluated on a publicly-available dataset consisting of more than 200 thousand bug reports from the open-source Eclipse project. The dataset consists of ground-truth (pre-annotated dataset having bug reports tagged as duplicate by the Triager). Empirical results and evaluation metrics quantifying retrieval performance indicate that the approach is effective.
GigaManP 2 P – A Peer-to-Peer Infrastructure for Managing Optical Networks

—The management of long distance backbones based on high speed optical networks requires new solutions for challenging tasks. For instance, operators and users located at different administrative domains must communicate with each other in order to configure and monitor agreed quality of service levels. This paper proposes a novel peer-to-peer (P2P) management architecture for optical networks, focused initially on the new RNP Giga backbone. In the proposed architecture, peers provide, in a ubiquitous fashion, management information to modules that interface with both the optical infrastructure and network users. This paper also presents preliminary experiments carried out in order to evaluate the processing overhead imposed by the P2P infrastructure on the SNMP-based management platform.
2 8 Fe b 20 05 Reduction and unfolding : the Kepler problem

In this paper we show, in a systematic way, how to relate the Kepler problem to the isotropic harmonic oscillator. Unlike previous approaches, our constructions are carried over in the Lagrangian formalism dealing, with second order vector fields. We therefore provide a tangent bundle version of the Kustaanheimo-Stiefel map.
Optimal control of multivariate crystallization processes with size-dependent growth kinetics

Optimal control of multivariate particulate processes in the context of crystal morphology manipulation is discussed in this work. The presented solution based on a conjunction of the method of characteristics, the minimum principle and a coordinate transformation in the property space of the underlying population balance equation extends a previous authors' approach to the broader class of crystallization processes involving size-dependent growth kinetics. As a consequence of a model idealization, the proposed methodology leads to low order boundary value problems resulting in computationally efficient near-optimal solutions.
Noise margins of threshold logic gates containing resonant tunneling diodes

Threshold gates consisting of RTDs in conjunction, with HBTs or CHFETs or MOS transistors can form extremely compact, ultrafast, digital logic alternatives. The resonant tunneling phenomenon causes these circuits to exhibit super-high-speed switching capabilities. Additionally, by virtue of being threshold logic gates, they are guaranteed to be more compact than traditional digital logic circuits while achieving the same functionality. However, reliable logic design with these gates will need a thorough understanding of their noise performance and power dissipation among other things. In this paper, we present an analytical study of the noise performance of these threshold gates supplemented by computer simulation results, with the objective of obtaining reliable circuit design guidelines.
Redundancy reduction revisited

Soon after Shannon defined the concept of redundancy it was suggested that it gave insight into mechanisms of sensory processing, perception, intelligence and inference. Can we now judge whether there is anything in this idea, and can we see where it should direct our thinking? This paper argues that the original hypothesis was wrong in over-emphasizing the role of compressive coding and economy in neuron numbers, but right in drawing attention to the importance of redundancy. Furthermore there is a clear direction in which it now points, namely to the overwhelming importance of probabilities and statistics in neuroscience. The brain has to decide upon actions in a competitive, chance-driven world, and to do this well it must know about and exploit the non-random probabilities and interdependences of objects and events signalled by sensory messages. These are particularly relevant for Bayesian calculations of the optimum course of action. Instead of thinking of neural representations as transformations of stimulus energies, we should regard them as approximate estimates of the probable truths of hypotheses about the current environment, for these are the quantities required by a probabilistic brain working on Bayesian principles.
Understanding Urban Land Use through the Visualization of Points of Interest

Semantic data regarding points of interest in urban areas are hard to visualize. Due to the high number of points and categories they belong, as well as the associated textual information, maps become heavily cluttered and hard to read. Using traditional visualization techniques (e.g. dot distribution maps, typographic maps) partially solve this problem. Although, these techniques address different issues of the problem, their combination is hard and typically results in an efficient visualization. In our approach, we present a method to represent clusters of points of interest as shapes, which is based on vacuum package metaphor. The calculated shapes characterize sets of points and allow their use as containers for textual information. Additionally, we present a strategy for placing text onto polygons. The suggested method can be used in interactive visual exploration of semantic data distributed in space, and for creating maps with similar characteristics of dot distribution maps, but using shapes instead of points.
Exploiting Monge structures in optimum subwindow search

Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a four dimensional (4D) maximum entry search problem wherein each entry corresponds to the quality score of the subimage contained in a subwindow. For n × n images, a naive exhaustive search requires O(n4) sequential computations of the quality scores for all subwindows. To reduce the time complexity, we prove that, for some typical similarity functions like Euclidian metric, χ2 metric on image histograms, the associated 4D array carries some Monge structures and we utilise these properties to speed up the optimum subwindow search and the time complexity is reduced to O(n3). Furthermore, we propose a locally optimal alternating column and row search method with typical quadratic time complexity O(n2). Experiments on PASCAL VOC 2006 demonstrate that the alternating method is significantly faster than the well known efficient subwindow search (ESS) method whilst the performance loss due to local maxima problem is negligible.
Spectrum sharing method to form bundle of white space in cognitive radio

Spectrum sharing by using cognitive radio technology has attracted attention as an effective solution to shortage of spectrum resource. In the spectrum sharing, unlicensed users (secondary users: SUs) exploit white space (WS) which is unused band by licensed users (primary users: PUs). In the related works, the channel assignment method maximizing the SU communication quality while protecting the PU is proposed when multiple SUs exist. In this method, the distance between SUs on the same channel is maximized in order to minimize the mutual interference among SUs. Therefore, it may cause the spatial fragmentation of spectrum resource and new SUs are difficult to share the same spectrum. In this paper, a novel channel assignment method based on perimeter to area ratio of WS is proposed. In the proposed method, WS is formed for easy entry of new SUs when the channels are assigned to SUs. The central control server with SU information is prepared and it assigns a channel to new SUs successively. Through computer simulations, we show that the number of SUs with an assigned channel increases by using the proposed method and new SUs can utilize WS effectively.
Optimizing the Web Search Engines with Features and Caching

Large web search engines have to answer thousands of queries per second with interactive response times under tight latency constraints. Query processing is a major cost factor in operating large web search engines. To keep up with this immense workload, a number of techniques such as caching, index compression, and index and query pruning are used to improve scalability. We focus on two techniques, inverted index compression and feature-based caching. We perform a comparison and evaluation of several inverted compression algorithms. We then set a new feature-based eviction policies that achieve significant improvements over previous methods. Experimental results shows that this approach can achieve hit rate improvements.
Fontes de conhecimento domésticas e estrangeiras para a inovação em redes de produção internacionalizadas: os casos das indústrias automotiva e siderúrgica

This paper studies the relative relevance of domestic knowledge sources for innovation in internationalized production activities in an emerging economy. Two Production Networks from Argentina with a different kind of internationalization were considered: organized around subsidiaries of multinational companies (the automotive case) and organized around local headquarters (the iron and steel case). A multiple factor analysis was carried out and cluster techniques were applied using a specific innovation survey done to 163 automotive and iron and steel firms from Argentina from the period of 2001 to2005, to evaluate the relative importance of domestic and foreign knowledge sources. The main finding is that in a production network organized around domestic headquarters the best innovative performance underrates the importance of international linkages, in comparison with networks organized around foreign subsidiaries.
European Macro-Financial Solidarity Mechanisms 1971-1993: Balance of Payments Assistance between the End of Bretton Woods and the Launch of EMU

Financial solidarity between member states of the European Union has a 60 years-old history going back right to the origins of the European project in the early 1950s. However, the first 20 years or so were dominated by the financing of projects in the context of rapidly rebuilding European economies. This early period has to be seen also in the broader context of the Bretton Woods system and in particular the creation of the IMF. The first severe tests to the Union's solidarity mechanisms with a macro-financial dimension came during the oil shocks which led to peaks in macroeconomic imbalances in the mid-seventies and mid-eighties. I explain the origins and motivations for the instruments for balance-of-payments assistance developed during this period. I document the evolution of European macro-financial solidarity mechanisms by examining various episodes of activation of the instrument, filling a gap in the literature on the history of European economic and financial integration. Finally, revisiting the history of European macro-financial stability tools during the period between the Bretton Woods system of fixed exchange rates and the creation of Economic and Monetary Union (EMU) can further our understanding of recently developed and reinforced financial solidarity mechanisms at the European and the global level.
String Kernels with Feature Selection for SVM Protein Classification

We introduce a general framework for string kernels. This framework can produce various types of kernels, including a number of existing kernels, to be used with support vector machines (SVMs). In this framework, we can select the informative subsequences to reduce the dimensionality of the feature space. We can model the mutations in biological sequences. Finally, we combine contributions of subsequences in a weighted fashion to get the target kernel. In practical computation, we develop a novel tree structure, coupled with a traversal algorithm to speed up the computation. The experimental results on a benchmark SCOP data set show that the kernels produced by our framework outperform the existing spectrum kernels, in both e‐ciency and ROC50 scores.
Trafﬁc Shaping via Congestion Signals Delegation

—This paper presents a new architecture that enables a set of clients to enforce trafﬁc shaping policies among them through the delegation of congestion signals. When congestion-aware Internet ﬂows share a bottleneck link, they compete for bandwidth and must respond to congestion signals promptly by decreasing their throughput. For clients running real-time applications (e.g., gaming, streaming), this may impose strict limitation on their achievable throughput over short time-scales. To that end, this paper presents an architecture, whereby a set of TCP connections (we refer to them as the Stunts) sacriﬁce/trade their performance on behalf of another TCP connection (we refer to it as the Free) by picking up a delegated subset of the congestion signals and reacting to them in lieu of the Free connection. This gives the Free connection just enough freedom to meet speciﬁc throughput requirements as requested by the application running on top, without affecting the level of congestion in the network. We present numerical model and analysis, which we validate by extensive simulation as well as through a pluggable module implementation for the Linux kernel.
Pharmacological antilipolysis restores insulin sensitivity during growth hormone exposure.

Stimulation of lipolysis and the induction of resistance to insulin's actions on glucose metabolism are well-recognized effects of growth hormone (GH). To evaluate whether these two features are causally linked, we studied the impact of pharmacologically induced antilipolysis in seven GH-deficient patients (mean [+/- SE] age 37 +/- 4 years). Each subject was studied under four different conditions: during continuation of GH replacement alone (A), after discontinuation of GH replacement for 2 days (B), after GH replacement and short-term coadministration of acipimox (250 mg, p.o., b.i.d., for 2 days) (C), and after administration of acipimox alone (D). At the end of each study, total and regional substrate metabolisms were assessed in the basal state and after a 3-h hyperinsulinemic/euglycemic clamp. Serum levels of free fatty acids (FFAs) were elevated with GH alone (A) and suppressed with acipimox (C and D). Basal rates of lipid oxidation were highest with GH alone (A), and suppressed by 50% with acipimox (B versus D, P < 0.01; A versus C, P < 0.05). Basal glucose oxidation rates were lowest with GH alone (A) and highest with acipimox (C and D) (P = 0.01). Insulin-stimulated rates of total glucose turnover were significantly lower with GH alone as compared with all other conditions (P = 0.004). Insulin sensitivity as assessed by the M value (rate of glucose infusion) was reduced with GH alone as compared with all other conditions (M value in mg. kg(-1). min(-1): GH alone [A], 2.55 +/- 0.64; discontinuation of GH [B], 4.01 +/- 0.70; GH plus acipimox [C], 3.96 +/- 1.34; acipimox alone [D], 4.96 +/- 0.91; P < 0.01). During pharmacological antilipolysis, GH did not significantly influence insulin sensitivity (C versus D; P = 0.19). From our results, we reached the following conclusions: 1) Our data strongly suggest that the insulin antagonistic actions of GH on glucose metabolism are causally linked to the concomitant activation of lipolysis. 2) In addition, GH may induce residual insulin resistance through non-FFA-dependent mechanisms. 3) The cellular and molecular mechanisms subserving the insulin antagonistic effects of GH remain to be elucidated.
Implicit effect of decoding time on fault tolerance in erasure coded Cloud Storage systems

International Data Company (IDC) has estimated the total amount of digital data stored in the world will reach 40 thousand Exabytes at the end of 2020. The idea of accessing this volume of data, anywhere at any time by exploiting commodity hardware, led to the introduction of cloud storage. The abounded rate and variety of failures in the equipment used in cloud storage systems, placed fault tolerance, at top of the challenges in these systems. Hadoop Distributed File System (HDFS) has provided cloud with reliable storage via replication. Storage overhead of replication is high and therefore it's going to be replaced with erasure codes. Despite the significant number of researches on overcoming different challenges in erasure codes (including decoding time), the study on fault tolerance of these codes is pale in previous works. This was the motivation for this paper to focus on fault tolerance of erasure codes. In this regard, a model has been proposed for decoding time procedure to identify parameters such as block size, number of blocks, stripe size, stripe length and number of stripes, which explicitly affect decoding time and implicitly affect fault tolerance. Minimum code distance is the concept which establishes the implicit relation between decoding time and fault tolerance. Identified parameters have an identical impact on decoding and encoding time in Maximum Distance Separable (MDS) erasure codes. Since the encoding time and bandwidth consumption of simultaneous decoding and encoding operations can affect decoding time, the influence of identified parameters has been also evaluated on encoding time and bandwidth consumption. Evaluations have been taken place by embedding erasure codes in Hadoop by means of HDFS-RAID module. Results of implementations show that use of small blocks and small stripe lengths and less number of stripes, could implicitly strengthen the fault tolerance of erasure coded cloud storage systems, through decrement of decoding time.
Abnormality of the Corpus Callosum in Coalmine Gas Explosion-Related Posttraumatic Stress Disorder

Abnormal corpus callosum (CC) has been reported in childhood trauma-related posttraumatic stress disorder (PTSD); however, the nature of white matter (WM) integrity alterations in the CC of young adult-onset PTSD patients is unknown. In this study, 14 victims of a coal mine gas explosion with PTSD and 23 matched coal miners without experiencing the coal mine explosion were enrolled. The differences in fractional anisotropy (FA) within 7 sub-regions of the CC were compared between the two groups. Compared to the controls, PTSD coal miners exhibited significantly reduced FA values in the anterior sub-regions of the CC (P < 0.05, Bonferroni-corrected), which mainly interconnect the bilateral frontal cortices. Our findings indicated that the anterior part of the CC was more severely impaired than the posterior part in young adult-onset PTSD, which suggested the patterns of CC impairment may depend on the developmental stage of the structure when the PTSD occurs.