Miracle-dz/UniFAR-FTUs huggingface dataset:
Petri Net Representation for Parallel Loop SchedulingUsing a Genetic

Scheduling is an important combinatorial optimization problem that has many practical applications. This paper introduces an application of GA's to scheduling iterative, or repeating operations. Iterative schedules occur in many tasks including manufacturing, production control and compiling iterative programs. A petri net representation of schedules is introduced that enables the GA to search the space of legal schedules by incorporating resource and dependency constraints. Each genome represents the space of possible delay allocations to arcs of the petri net. The cost function simulates the Petri net to identify the iterative schedule, which is then evaluated. This paper includes a study of the approach applied to scheduling machine instructions for a parallel computer architecture given iterative programs. Results indicate that GA is robust and produces more eecient schedules that a traditional heuristic method when applied to a diversity of iterative programs. Abstract Scheduling is an important combinatorial optimization problem that has many practical applications. This paper introduces an application of GA's to scheduling iterative, or repeating operations. Iterative schedules occur in many tasks including manufacturing, production control and compiling iterative programs. A petri net representation of schedules is introduced that enables the GA to search the space of legal schedules by incorporating resource and dependency constraints. Each genome represents the space of possible delay allocations to arcs of the petri net. The cost function simulates the Petri net to identify the iterative schedule, which is then evaluated. This paper includes a study of the approach applied to scheduling machine instructions for a parallel computer architecture given iterative programs. Results indicate that GA is robust and produces more eecient schedules that a traditional heuristic method when applied to a diversity of iterative programs.
BiSim: A Simple and Efficient Biclustering Algorithm

Analysis of gene expression data includes classification of the data into groups and subgroups based on similar expression patterns. Standard clustering methods for the analysis of gene expression data only identifies the global models while missing the local expression patterns. In order to identify the missed patterns biclustering approach has been introduced. Various biclustering algorithms have been proposed by scientists. Among them Binary Inclusion maximal algorithm (BiMax) forms biclusters when applied on a gene expression data through divide and conquer approach. The worst-case running-time complexity of BiMax for matrices containing disjoint biclusters is O(nmb) and for arbitrary matrices is of order O(nmb min{n, m}) where b is the number of all inclusion-maximal biclusters in matrix. In this paper we present an improved algorithm, BiSim, for biclustering which is easy and avoids complex computations as in BiMax. The complexity of our approach is O(n*m) for n genes and m conditions, i.e, a matrix of size n*m. Also it avoids extra computations within the same complexity class and avoids missing of any biclusters.
SPECTRAL EVOLUTION OF THE CONTINUUM AND DISC LINE IN DIPPING IN GROJ 1655-40

The discovery is reported of emission features in the X-ray spectrum of GRO J1655-40 obtained using RossiXTE on 1997, Feb 26. The features have been fitted firstly by two Gaussian lines, which in four spectra have average energies of 5.85± 0.08 keV and 7.32± 0.13 keV, strongly suggestive that these are the red and blue shifted wings of an iron disc line from material with velocity ∼0.33 c. The blue wing is apparently less bright than expected for a disc line subject to Doppler boosting, however, known absorption in the spectrum of GRO J1655-40 at energies between ∼7 and 8 keV can reduce the apparent brightness of the blue wing. The spectra have also been fitted well using the full relativistic disc line model of Laor, plus an absorption line. This gives a restframe energy between 6.4 and 6.8 keV indicating that the line is from highly ionized iron Kα. The Laor model also shows that the line originates at radii extending from ∼10 Schwarzschild radii (rS) outwards. The line is direct evidence for the black hole nature of the compact object. The continuum is well described by dominant disc blackbody emission plus Comptonized emission. During dipping, spectral evolution is well modelled by allowing progressive covering of the disc blackbody and simple absorption of the Comptonized emission showing that the thermal emission is more extended. Acceptable fits are only obtained by including the disc line in the covering term, indicating that it originates in the same inner disc region as the thermal continuum. Dip ingress times and durations are used to provide the radius of the disc blackbody emitter as 170–370 rS, and the radius of the absorber.
E3BFT: Energy efficient and energy balanced fault tolerance clustering in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) consist of sensor nodes, which are small in size with limited energy and computational power. The main function of WSN is to route sensed data to base station (BS), however the main constraint in WSN is irreplaceable power sources of sensor nodes. In this paper, a distributed energy efficient and energy balanced clustering algorithm is proposed. A sensor node selects a cluster head (CH) having minimum routing overhead with higher ratio of residual energy of CH and corresponding distance. Routing overhead of CH is calculated only when the route from individual CH to base station (BS) is defined, so for defining the route amongst CH, we execute GA based routing algorithm named as GAR [1] before selection of CH by sensor nodes. Proposed algorithm also takes care of those sensor nodes, which are not in communication range of CH. This is also complimented with fault tolerant issue of WSNs as the sensor nodes are prone to failure.
Most probable paths and performance formulae for buffers with gaussian input traffic

[Abstract]: In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder’s theorem, the large deviation result for Gaussian processes. Most probable paths leading to a given buffer occupancy are identified. Special attention is given to the case where the sample paths of the Gaussian process are smooth. The performance approximations are compared with known analytical results or by means of simulation. The approximations appear to be surprisingly accurate.
An Efficient 3D Face Recognition Algorithm

This paper proposes an efficient expression invariant algorithm for 3D face recognition of subjects. The proposed algorithm uses a surface-based approach to extract automatically and to define geometrically the facial features like eyebrows, nose and lips. These extracted features are used to obtain some unique control points that can be used for matching. The algorithm is tested on Binghamton University 3D Facial Expression (BU-3DFE) database where each subject is having at least 6 expressions and is found to be more than 98.5% accurate.
Mobility Parameter Planning for 3 GPP LTE : Basic Concepts and Intra-Layer Mobility

This white paper discusses the design of intra-layer mobility parameters for 3GPP LTE radio networks. Firstly, basic UE measurements defined in 3GPP Release 9 are reviewed. A measurement example illustrates their basic differences. Both idle mode and connected mode measurements and cell change rules from 3GPP are summarized in a vendor-independent way. Secondly, design criteria for setting handover margin, time to trigger and measurement filtering coefficient are discussed in detail. A simple parameter design example is given. The scope of this paper is limited to a review basic of concepts and design of intra-layer (intra-frequency) mobility parameters.
CFA pattern identification of digital cameras using intermediate value counting

In digital image forensics, estimating the color filter array (CFA) pattern can be useful for digital camera identification. In this paper, we proposed the new method to estimate the CFA pattern of the digital cameras from a single image. Our method is based on the basic principal of CFA interpolation which fills an empty pixel using neighbor pixels. For each channel, we define the specific neighbor pattern and count the intermediate values. The CFA pattern is estimated by utilizing this counting information of three channels. The experimental results show that the proposed method achieves high accuracy with various camera models and CFA interpolation algorithms.
Generalized Transmission Scheme for MIMO Y Channel

This paper proposes a novel scheme for a multi-way communication where users combine bi-directional multi-pair messages exchange with multi-directional multi-pair exchange. Particularly, we focus on the system where multiple users have multiple antennas exchange both private and common messages with each other. In this scheme, we can use simple zero forcing combined with successive network code decoding enables all user to decipher the encryption message from the relay despite the fact that they all have difierent self-information which they use as a key.
On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation

Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of the deforming shape. We investigate topological invariants (based on winding number) of planar morphs between compatible triangulations that do allow global self-intersections but avoid local ones. Equivalently, such morphs do not make any of the triangles degenerate. We discuss a variant of the as rigid as possible morphing algorithm based on these invariants that allows to handle cases when a large amount of twist is required to transform the source triangulation into the target triangulation. 1 Background
Morphology Generation for Statistical Machine Translation

State of the art Machine Translation (MT) systems tend to perform poorly when translating into languages with rich morphological systems. When multiple morphemes inflect a single word stem, the total lexicon of surface forms can be very large, and any given surface form may occur infrequently in a text, leading to a significant data sparsity problem. In this paper, we examine how morphological information incorporated into MT models can be used to address this problem. Our first approach is adapted from previous work (Popović and Ney, 2004; de Gispert and Mariño, 2008), which segments the morphologically complex language into stems and suffixes and then trains the MT system on the segmentations, treating each as an individual word; the motivation is that productive stems and suffixes in isolation may reduce sparsity, as well as increase the level of lexical symmetry between source and target in the translation model. The second approach we use was proposed in (Minkov et al., 2007; Toutanova et al., 2008), in which complex words in the target are stemmed before translation, and then the morphologically inflected forms are generated for the target stem output as a post-processing step by predicting a sequence of morphemes using a Maximum Entropy Markov Model (MEMM). We implemented this approach using Conditional Random Fields (CRFs) instead of MEMMs.
High‐resolution solid modeling of biological samples imaged with 3D fluorescence microscopy

Optical‐sectioning, digital fluorescence microscopy provides images representing temporally‐ and spatially‐resolved molecular‐scale details of the substructures of living cells. To render such images into solid models for further computational analyses, we have developed an integrated system of image acquisition, processing, and rendering, which includes a new empirical technique to correct for axial distortions inherent in fluorescence microscopy due to refractive index mismatches between microscope objective immersion medium, coverslip glass, and water. This system takes advantage of the capabilities of ultra‐high numerical aperture objectives (e.g. total internal reflection fluorescence microscopy) and enables faithful three‐dimensional rendering of living cells into solid models amenable to further computational analysis. An example of solid modeling of bovine aortic endothelial cells and their nuclei is presented. Since many cellular level events are temporally and spatially confined, such integrated image acquisition, processing, rendering, and computational analysis, will enable, in silico, the generation of new computational models for cell mechanics and signaling. Microsc. Res. Tech., 2006. © 2006 Wiley‐Liss, Inc.
Measurement of Fibronectin in Human Body Fluids

Two facts must be taken into consideration when quantifying fibronectin in biological samples: the sensitivity of the assay method and the appropriate handling of samples. A three-antibody, non-competitive ELISA was used in the present study. This procedure offers a simple, inexpensive and very sensitive technique for evaluating fibronectin: reproducible standard curves in the range 5-100 micrograms/l, 3% variability in the assay, and a detection limit of 0.5 ng/well that allows accurate measurement of fibronectin in segmental bronchoalveolar lavage and in ascites liquid samples. Typical dilution ranged from 1/10000 for plasma to 1/100 for bronchoalveolar lavages. For long-term storage of samples two procedures are recommended. First, a rapid freezing with liquid nitrogen, storage at -20 degrees C and thawing once at 37 degrees C avoiding refreezing. Losses of immunoreactive fibronectin after 35 days storage were 15, 15 and 22% in plasma, bronchoalveolar lavages and ascites fluid, respectively. Alternatively, samples can be stored as ammonium sulphate precipitates. This allows the easy availability of the samples when assays have to be repeated, and avoids fractionation in vials and freeze-thawing cycles. Using this storage procedure, losses are, however, slightly higher (22, 25, 25%, respectively, after 35 days).
An Improvement in Lossless Data Compression via Substring Enumeration

Dube ´ and Beaudoin proposed a new technique of loss less data compression called compression via sub string enumeration (CSE) in 2010. It has been indicated that the compression ratio of CSE achieves competitive performance for ones of the best PPM variants and BZIP2 from the viewpoint of experimental results. We refine the technique of CSE to reduce the candidate value of range to encode, and make the compression performance of our improvement clear analytically for some input strings, which have zero entropy rate. We show that the performance of compression ratio of the improved CSE never becomes worse than one of the original CSE for any source string in linear-time and linear-space complexity for the length of string.
Real‐time multiple linear regression for fMRI supported by time‐aware acquisition and processing

Real‐time parametric statistical analysis of functional MRI (fMRI) data would potentially enlarge the scope of experimentation and facilitate its application to clinical populations. A system is described that addresses the need for rapid analysis of fMRI data and lays the foundation for dealing with problems that impede the application of fMRI to clinical populations. The system, I/OWA (Input/Output time‐aWare Architecture), combines a general architecture for sampling and time‐stamping relevant information channels in fMRI (image acquisition, stimulation, subject responses, cardiac and respiratory monitors, etc.) and an efficient approach to manipulating these data, featuring incremental subsecond multiple linear regression. The advantages of the system are the simplification of event timing and efficient and unified data formatting. Substantial parametric analysis can be performed and displayed in real‐time. Immediate (replay) and delayed off‐line analysis can also be performed with the same interface. The capabilities of the system are demonstrated in normal subjects using a polar visual angle phase mapping paradigm. The system provides a time‐accounting infrastructure that readily supports standard and innovative approaches to fMRI. Magn Reson Med 45:289–298, 2001. © 2001 Wiley‐Liss, Inc.
PERCEPTION OF INTONATION IN CANTONESE: NATIVE LISTENERS VERSUS AN EXEMPLAR-BASED MODEL

Speech perception researchers (Peterson and Barney 1952, among others) have known for many years that the phonemic categories of speech have highly variable acoustic/phonetic manifestations. Variation in speech depends on many factors, including the size and shape of the vocal tract (Fant 1960, 1972), the phonetic environment in which speech sounds are produced, and the speaker’s sociolect. For example, Peterson and Barney (1952) measured the formant frequencies of 10 vowels in hVd words (i.e., heed, hid, head, had, hod, hawed, hood, who’d, hud, and heard), produced by 76 English speakers. They found considerable variation among different groups of speakers primarily due to their vocal tracts: on average, children produced the highest formant frequencies, women produced the second highest formant frequencies, and men produced the lowest formant frequencies. Such variation in speech poses a serious challenge to the question of how human beings can successfully identify consistent, abstract phonemic and lexical categories across a wide spectrum of different speakers, styles, and contexts. One theoretical approach that has had success in dealing with this variability in real-world tests is Exemplar Theory, which takes the variability in speech to be a resource for perception, rather than a problem. In this paper, we investigated whether a computational model, based on Exemplar Theory principles, could account for the human perception of intonation.
Ladies First? Firm-Level Evidence on the Labor Impacts of the East Asian Crisis

In a crisis, do employers place the burden of adjustment disproportionately on female employees? Relying on household and labor force data, existing studies of the distributional impact of crises have not been able to address this question. This paper uses Indonesia's census of manufacturing firms to analyze employer responses and to identify mechanisms by which gender differences in impact may arise, notably differential treatment of men and women within firms as well as gender sorting across firms that varied in their exposure to the crisis. On average, women experienced higher job losses than their male colleagues within the same firm. However, the aggregate adverse effect of such differential treatment was more than offset by women being disproportionately employed in firms hit relatively less hard by the crisis. The null hypothesis that there were no gender differences in wage adjustment is not rejected. Analyzing how employer characteristics impact labor market adjustment patterns contributes to the understanding of who is vulnerable in volatile times.
The Globular Cluster System of the Virgo Dwarf Elliptical Galaxy VCC 1087

We present an analysis of the globular cluster (GC) system of the nucleated dwarf elliptical galaxy VCC 1087 in the Virgo Cluster based on Keck LRIS spectroscopy and archival Hubble Space Telescope Advanced Camera for Surveys imaging. We estimate that VCC 1087 hosts a total population of 77 ± 19 GCs, which corresponds to a relatively high V-band specific frequency of 5.8 ± 1.4. The g475 - z850 color distribution of the GCs shows a blue (metal-poor) peak with a tail of redder (metal-rich) clusters similar in color to those seen in luminous elliptical galaxies. The luminosity function of the GCs is lognormal and peaks at M = -7.2 ± 0.3, M = -8.1 ± 0.2. These peak positions are consistent with those found for luminous Virgo elliptical galaxies, suggesting either the lack of or, surprisingly similarly, the dynamical destruction processes of GCs among dwarf and giant galaxies. Spectroscopy of a subsample of 12 GCs suggests that the GC system is old and coeval (≳10 Gyr), with a fairly broad metallicity distribution (-1.8 ≲ [M/H] ≲ -0.8). In contrast, an integrated spectrum of the underlying galaxy starlight reveals that its optical luminosity is dominated by metal-rich, intermediate-age stars. The radial velocities of the GCs suggest rotation close to the major axis of the galaxy, and this rotation is dynamically significant with (vrot/σlos)* > 1. A compilation of the kinematics of the GC systems of nine early-type galaxies shows surprising diversity in the (vrot/σlos) parameter for GC systems. In this context, the GC system of VCC 1087 exhibits the most significant rotation-to-velocity dispersion signature. Dynamical mass modeling of the velocity dispersion profile of the GCs and galaxy stars suggests fairly constant mass-to-light ratios of ∼3 out to 6.5 kpc. The present observations can entertain both baryonic and nonbaryonic solutions, and GC velocities at larger radii would be most valuable with regard to this issue. Finally, we discuss the evolution of VCC 1087 in terms of the galaxy "harassment" scenario and conclude that this galaxy may well be the remains of a faded, tidally perturbed Sc spiral.
Analysis of delinquent firms using multi-state transitions

This paper analyzes the behavior of firms with defaulted credits in terms of recovery or extinction. By defining classes for the severity of default, survival models for the multiple transitions from each class are estimated. The models are used to simulate the evolution of a firm’s credit conditional on its characteristics. Estimates for the expected recovery or extinction rates are constructed from these simulations. They show that (i) the severity of default strongly influences the probability of extinction; (ii) for less severe default episodes, recovery is faster than extinction, and the opposite is true for more severe defaults; (iii) larger firms tend to display better outcomes; (iv) and the number of employees is the single most important determinant of the time profile of the extinction/recovery process. Estimates of a loss given default measure suggest that the supervision recommendations found in the literature are appropriate.
Can Statistical Post-Editing with a Small Parallel Corpus Save a Weak MT Engine?

Statistical post-editing has been shown in several studies to increase BLEU score for rule-based MT systems. However, previous studies have relied solely on BLEU and have not conducted further study to determine whether those gains indicated an increase in quality or in score alone. In this work we conduct a human evaluation of statistical post-edited output from a weak rule-based MT system, comparing the results with the output of the original rule-based system and a phrase-based statistical MT system trained on the same data. We show that for this weak rule-based system, despite significant BLEU score increases, human evaluators prefer the output of the original system. While this is not a generally conclusive condemnation of statistical post-editing, this result does cast doubt on the efficacy of statistical post-editing for weak MT systems and on the reliability of BLEU score for comparison between weak rule-based and hybrid systems built from them.