Miracle-dz/UniFAR-FTUs huggingface dataset:
Genetic algorithm based multiuser scheduling for single- and multi-cell systems with successive interference cancellation

It is well-known that wireless scheduling algorithm could exploit multi-user diversity to enhance the network capacity. With multiple transmit/receive antennas, there are additional degrees of freedom which could deliver either spatial multiplexing gain and/or spatial diversity gain. With cross layer scheduling, there is also multi-user selection diversity which contributes to both network capacity and coverage. Due to the huge complexity involved for the optimal solution and big performance gap caused by greedy schemes, in this paper, we proposed a series of genetic algorithm based scheduling schemes with different chromosome code designs for both single- and multi-cell system resource allocation. For single-cell scheduling, we mainly focused on uplink multi-user scheduling with successive interference cancellation at receivers, and joint spatial-frequency scheduling. While for multi-cell scheduling, we proposed a centralized genetic algorithm based scheduling solution that could effectively increase the multi-cell cooperation gain. Simulation results show that the proposed algorithms could fill in most of the performance gap at reasonable complexity compared with optimal solution and greedy scheduling.
Multimodal medical image registration using a novel implementation of the ICP algorithm

Image registration is a valuable technique for medical diagnosis and treatment. In this paper, we present an enhanced implementation of the popular iterative closest point (ICP) algorithm developed for the registration of 3D free-form closed surfaces. The main step of the ICP consists of finding the closest points between data sets which are then used to estimate the parameters of the global rigid transformation. We propose a new technique based on the use of a look up matrix for finding the best correspondence pairs. The algorithm, called Comprehensive ICP (CICP) algorithm, is then successfully applied for the registration of 3D data of the left ventricle of the heart, acquired using two different medical imaging modalities.
Managing the interplay and tensions of consulting interventions

Grounded in case study research, the consultant‐client relationship is conceived as mediating between, and reconciling, competing enactments. Through their work, consultants seek to achieve a separation from existing organisational frames of reference, commitments and routines. To achieve any separation, consultants have to challenge the world that is shared and lived out by members of the organisation. The enactments created and sustained by interventions are experienced as competitive versions of social reality, with diverse advocates, seeking to secure a critical mass of belief and acceptance. Consultants come under pressure to conform to, or to operate within, the constructs of this organisational reality, and their interventions create tensions and the need to accommodate differing views. The consultant‐client relationship, as experienced and perceived, is central to the process of generating shared constructions, and profoundly shapes the emergent organisational reality. Reviews traditional conceptualisations of the client‐consultant relationship and contrasts them to more critical and emancipatory perspectives. Then discusses the case study research and the role and nature of the consultant‐client relationship within the theoretical framework developed.
A Linear-RBF Multikernel SVM to Classify Big Text Corpora

Support vector machine (SVM) is a powerful technique for classification. However, SVM is not suitable for classification of large datasets or text corpora, because the training complexity of SVMs is highly dependent on the input size. Recent developments in the literature on the SVM and other kernel methods emphasize the need to consider multiple kernels or parameterizations of kernels because they provide greater flexibility. This paper shows a multikernel SVM to manage highly dimensional data, providing an automatic parameterization with low computational cost and improving results against SVMs parameterized under a brute-force search. The model consists in spreading the dataset into cohesive term slices (clusters) to construct a defined structure (multikernel). The new approach is tested on different text corpora. Experimental results show that the new classifier has good accuracy compared with the classic SVM, while the training is significantly faster than several other SVM classifiers.
Unbalanced Distribution Optimal Power Flow to Minimize Losses with Distributed Photovoltaic Plants

 Abstract — Electric power systems are likely to operate with minimum losses and voltage meeting international standards. This is made possible generally by control actions provide by automatic voltage regulators, capacitors and transformers with on-load tap changer (OLTC). With the development of photovoltaic (PV) systems technology, their integration on distribution networks has increased over the last years to the extent of replacing the above mentioned techniques. The conventional analysis and simulation tools used for electrical networks are no longer able to take into account control actions necessary for studying distributed PV generation impact. This paper presents an unbalanced optimal power flow (OPF) model that minimizes losses with association of active power generation and reactive power control of single-phase and three-phase PV systems. Reactive power can be generated or absorbed using the available capacity and the adjustable power factor of the inverter. The unbalance OPF is formulated by current balance equations and solved by primal-dual interior point method. Several simulation cases have been carried out varying the size and location of PV systems and the results show a detailed view of the impact of PV distributed generation on distribution systems.
Regression test selection for C++ software

Regression testing is an important but expensive software maintenance activity performed with the aim of providing confidence in modified software. Regression test selection techniques reduce the cost of regression testing by selecting test cases for a modified program from a previously existing test suite. Many researchers have addressed the regression test selection problem for procedural language software, but few have addressed the problem for object‐oriented software. This paper presents a regression test selection technique for use with object‐oriented software. The technique constructs graph representations for software, and uses these graphs to select test cases, from the original test suite, that execute code that has been changed for the new version of the software. The technique is strictly code based, and requires no assumptions about the approach used to specify or test the software initially. The technique applies to modified and derived classes, and to application programs that use modified classes. Copyright © 2000 John Wiley & Sons, Ltd.
A visual method tor the detection of available parking slots

Visual sensors are widely used in automatic parking systems, so this paper proposes an algorithm for the visual detection of available parking slots. The proposed system consists of two stages: parking slot recognition and slot occupancy classification. The parking slot recognition stage generates parking slots using the corner features of parking slot markings. The slot occupancy classification stage verifies the availability of the parking slot using the features of detected slots. The experimental results demonstrate that the proposed method effectively detects available parking slots in AVM images.
Developmental changes in the theta response system: a single-sweep analysis

Recently, increased interest was focused on the EEG frequency responses in the theta (4-7 Hz) range because of their association with stimulus information processing. However, it is not known whether the event-related theta response depends on the development of the spontaneous theta activity and how it varies with age in children. In the present study, a single-sweep analysis was applied to assess the developmental changes in the event-related EEG theta activity. Auditory passive, oddball target, and standard event-related potentials (ERPs) were recorded at Fz, Cz, and Pz from 50 children aged 6-11 years and 10 young adults. Theta responses were analyzed in two time windows of the post-stimulus epochs for three single-sweep parameters: amplitude, phase-locking with stimulus, and enhancement relative to prestimulus activity. For all three types of stimuli adults had theta responses with lower amplitude, higher enhancement, and stronger phase-locking than those of children. Unlike adults, no reliable differences between the early and late theta response were found for children. Significant developmental changes were observed for theta response amplitude that decreased and phase-locking of early theta responses that increased with advancing age. These findings indicate that the theta component of the auditory ERP differs remarkably between children and adults and undergoes developmental alterations, possibly reflecting specific differences in stimulus information processing.
Genetic algorithms for automatic feature selection in a textureclassification system Conference or Workshop Item

This paper describes the usage of geoetic algorithms as feature selectors in a texture classification system. This is part of a system developed within a research project concerning the classification of genuine texture. An attempt is made to underline why an automised feature selector is a useful part of the texture classification system. Furthermore the way of including the genetic algorithms into the system and the necessary feedback structure is explained.
Depth-aware coherent line drawings

In this paper we utilize depth information to extend a line drawing algorithm, improving depth perception and object differentiation in large and spatially complex scenes. We consider different scales of features and apply a flow-based morphological filter to the scenes. Based on this two line drawing styles are defined. The proposed algorithm works in real-time and enables users to manipulate the parameter space through instant visual feedback. We evaluated the effectiveness of our method by performing a user study.
Identification of a vesicular aspartate transporter

Aspartate is an excitatory amino acid that is costored with glutamate in synaptic vesicles of hippocampal neurons and synaptic-like microvesicles (SLMVs) of pinealocytes and is exocytosed and stimulates neighboring cells by binding to specific cell receptors. Although evidence increasingly supports the occurrence of aspartergic neurotransmission, this process is still debated because the mechanism for the vesicular storage of aspartate is unknown. Here, we show that sialin, a lysosomal H+/sialic acid cotransporter, is present in hippocampal synaptic vesicles and pineal SLMVs. RNA interference of sialin expression decreased exocytosis of aspartate and glutamate in pinealocytes. Proteoliposomes containing purified sialin actively accumulated aspartate and glutamate to a similar extent when inside positive membrane potential is imposed as the driving force. Sialin carrying a mutation found in people suffering from Salla disease (R39C) was completely devoid of aspartate and glutamate transport activity, although it retained appreciable H+/sialic acid cotransport activity. These results strongly suggest that sialin possesses dual physiological functions and acts as a vesicular aspartate/glutamate transporter. It is possible that people with Salla disease lose aspartergic (and also the associated glutamatergic) neurotransmission, and this could provide an explanation for why Salla disease causes severe neurological defects.
Fingerprint Liveness Detection Using Local Coherence Patterns

In this letter, we propose a novel image descriptor for fingerprint liveness detection using the local coherence of a given image. Based on the observation that materials employed for making fake fingerprints (e.g., silicone, wood glue, etc.) tend to yield the nonuniformity in the captured image due to the replica fabrication process, we focus on the difference of the dispersion in the image gradient field between live and fake fingerprints. More specifically, we propose to define the local patterns of the coherence along the dominant direction, the so-called local coherence patterns, as our features, which are fed into the linear support vector machine (SVM) classifier to determine whether a given fingerprint is fake or not. Experimental results on various datasets show that the proposed image descriptor is effective for fingerprint liveness detection compared to other approaches employed in the literature.
Cells Persistently Infected with Newcastle Disease Virus

The strain of Newcastle disease virus (NDVpi) present in persistently infected L cells differed markedly from the Herts strain (NDV0) used to initiate the infection. NDVpi produced small plaques (less than 1 mm) in chick embryo cell cultures, whereas the wild type (NDV0) produced large plaques (2 to 3 mm). The two viruses differed in a number of additional properties. Whereas 80% of adsorbed NDV0 eluted from chicken red blood cells at 37 C, only about 20% of NDVpi was recovered under similar conditions. There was no significant difference in the neuraminidase content of the two viruses. The infectivity of NDV0 was stable for 1 hr at 48 C, whereas 99.9% of the infectivity of NDVpi was destroyed. The two viruses also differed in lethality for chick embryos; NDVpi had significantly reduced lethality for 9-day-old chick embryos when compared to NDV0. In contrast to NDV0, which produced an abortive infection in L cells, NDVpi not only replicated effectively and destroyed these cells, but also induced significantly higher quantities of interferon than did NDV0. These data furnished additional evidence for the lack of relationship of interferon production to abortive infection of L cells with NDV0. In contrast, interferon was found to play a significant role in the maintenance of persistent infection.
7.3 Gb/s universal BCH encoder and decoder for SSD controllers

This paper presents a universal BCH encoder and decoder that can support multiple error-correction capabilities. A novel encoding architecture and on-demand syndrome calculation technique is proposed to reduce both hardware complexity and power consumption. Based on the proposed methods, 32-parallel universal encoder and decoder are designed for BCH (8192+14t, 8192, t) codes, where the error-correction capability t is configurable to 8, 11, 16, 24, 32, and 64. The prototype chip achieves a throughput of 7.3 Gb/s and occupies 2.24 mm2 in 0. 13μm CMOS technology.
Segmental Duplications Contribute to Gene Expression Differences Between Humans and Chimpanzees

In addition to specific changes in cis- and trans-regulatory elements, structural changes in the genome are hypothesized to underlie a large number of differences in gene expression between species. Accordingly, we show that species-specific segmental duplications are enriched with genes that are differentially expressed between humans and chimpanzees.
Utility of encoder side information for the lossless Kaspi/Heegard-B erger problem

We consider the lossless Kaspi/Heegard-Berger source coding problem where an encoder communicates a common description of two sources to two decoders, and each decoder wants to reconstruct one of the sources with the help of side information. We present new results on the utility of encoder side information for this scenario. We show that for some sources and side informations - e.g., for some instances of conditionally less noisy side information - the minimum rate that is required to describe the sources is strictly reduced when the side information is also known at the encoder. On the other hand, we identify classes of sources and side informations - e.g., physically degraded side information - where encoder side information does not change the minimum description rate. We show similar results for a scenario where one decoder has to reconstruct both sources and for a scenario where the encoder is informed only about one of the decoder's side information.
A general framework for MIMO receivers with low-resolution quantization

The capacity of a discrete-time, multi-input multi-output (MIMO) channel with output quantization is investigated for different receiver architectures. A general framework for low-resolution quantization is proposed in which the antenna outputs are processed by analog combiners and sign quantizers are used for analog-to-digital conversion. The configuration of the analog combiners is chosen as a function of the channel realization so that the transmission rate can be maximized over the set of available configurations. To exemplify the proposed approach, four analog receiver architectures are considered: (a) sign quantization of the antenna outputs, (b) single antenna selection, (c) multiple antenna selection, and (d) linear processing of the antenna outputs. In each scenario, capacity is investigated as a function of the transmit power, the number of transmit/receive antennas and sign quantizers. In particular, it is shown that architecture (a) is sufficient to approach the optimal high signal-to-noise ratio (SNR)performance for a MIMO receiver in which the number of receive antennas is larger than the number of sign quantizers. Numerical evaluations of the average performance are presented for the case in which the channel gains are i.i. d. Gaussian distributed.
Efficient large-scale sequence comparison by locality-sensitive hashing

MOTIVATION Comparison of multimegabase genomic DNA sequences is a popular technique for finding and annotating conserved genome features. Performing such comparisons entails finding many short local alignments between sequences up to tens of megabases in length. To process such long sequences efficiently, existing algorithms find alignments by expanding around short runs of matching bases with no substitutions or other differences. Unfortunately, exact matches that are short enough to occur often in significant alignments also occur frequently by chance in the background sequence. Thus, these algorithms must trade off between efficiency and sensitivity to features without long exact matches. RESULTS We introduce a new algorithm, LSH-ALL-PAIRS, to find ungapped local alignments in genomic sequence with up to a specified fraction of substitutions. The length and substitution rate of these alignments can be chosen so that they appear frequently in significant similarities yet still remain rare in the background sequence. The algorithm finds ungapped alignments efficiently using a randomized search technique, locality-sensitive hashing. We have found LSH-ALL-PAIRS to be both efficient and sensitive for finding local similarities with as little as 63% identity in mammalian genomic sequences up to tens of megabases in length
The spatial power combining technique based on novel antipodal finline

This paper presents the spatial power combining technique based on new waveguide-to-microstrip antipodal finline array. The technique adopts the structure of broadband multi-way oversized coaxial waveguide which is mainly composed of a twenty-way gradually changed antipodal finline array. The new finline is designed of a complex function of a linear function, a triangular function and an exponential function. All the finlines have the high uniformity of amplitude and phase. Through the application to 6-18 GHz coaxial spatial power combiner, the new finline provides a broadband performance without any additional resonance frequency. Measured results show that the spatial power combiner has a high combining efficiency of 80% and high output power of more than 20 watts in frequency range of 6-18 GHz.
ESTIMATION AND INFERENCE FOR VERY LARGE LINEAR MIXED EFFECTS MODELS

Linear mixed models with large imbalanced crossed random effects structures pose severe computational problems for maximum likelihood estimation and for Bayesian analysis. The costs can grow as fast as $N^{3/2}$ when there are N observations. Such problems arise in any setting where the underlying factors satisfy a many to many relationship (instead of a nested one) and in electronic commerce applications, the N can be quite large. Methods that do not account for the correlation structure can greatly underestimate uncertainty. We propose a method of moments approach that takes account of the correlation structure and that can be computed at O(N) cost. The method of moments is very amenable to parallel computation and it does not require parametric distributional assumptions, tuning parameters or convergence diagnostics. For the regression coefficients, we give conditions for consistency and asymptotic normality as well as a consistent variance estimate. For the variance components, we give conditions for consistency and we use consistent estimates of a mildly conservative variance estimate. All of these computations can be done in O(N) work. We illustrate the algorithm with some data from Stitch Fix where the crossed random effects correspond to clients and items.
CRM na administração pública: desenvolvimento e validação de uma Escala de Relacionamento com o Cidadão (ERCi)

As empresas utilizam a gestao de relacionamento com o cliente ou Customer Relationship Management (CRM) para estabelecer relacionamentos de longo prazo, mantendo seus clientes satisfeitos e fieis. Neste contexto, o Citizen Relationship Management (CiRM) surge no setor publico como estrategia para aprimorar o atendimento ao cidadao e incentivar a cidadania. Considerando a lacuna da literatura sobre o tema, o objetivo deste estudo multimetodo foi validar um instrumento para avaliar a percepcao dos cidadaos quanto as iniciativas de CiRM na administracao publica. A principal contribuicao deste trabalho consistiu na validacao de um instrumento, em versoes completa e reduzida, com indices psicometricos muito confiaveis, que pode ser utilizado como ferramenta diagnostica pelos gestores publicos para promover uma gestao proficua do relacionamento com os cidadaos.
Control design approaches for parallel robot manipulators: a review

In this article, different control design approaches for parallel robot manipulators are presented with two distinguished classes of control strategies in the literature. These are the model-free control and the dynamic control strategy, which is mainly a model-based scheme, and is mostly the alternative when the control requirements are more stringent. The authors strongly believe that this paper will be helpful for researchers and engineers in the field of robotic systems.