Miracle-dz/UniFAR-FTUs huggingface dataset:
Voltage-Control Based Pmbldcm By Using Cuk Converter With Pfc

This paper deals with a Cuk dc-dc converter as a single-stage power-factor-correction converter for a permanent magnet (PM) brushless dc motor (PMBLDCM) fed through a diode bridge rectifier from a single- phase ac mains. A three-phase voltage-source inverter is used as an electronic commutator to operate the PMBLDCM driving an air-conditioner compressor. The speed of the compressor is controlled to achieve optimum air-conditioning using a concept of the voltage control at dc link proportional to the desired speed of the PMBLDCM. The stator currents of the PMBLDCM during step change in the reference PMBLDCM drive (PMBLDCMD) without PFC. speed are controlled within the specified limits by an addition of a rate limiter in the reference dc link voltage. The proposed induction motor-based Air-Con system operating in ―on/off‖ PMBLDCM drive (PMBLDCMD) is designed and modeled, and control mode. Its performance is evaluated in Matlab Simulink environment. A PMBLDCM has the developed torque proportional to its Simulated results are presented to demonstrate an improved phase current and its back electromotive force (EMF), which power quality at ac mains of the PMBLDCMD system in a wide is proportional to the speed (1)-(4). Therefore, a constant range of speed and input ac voltage. Test results of a developed controller are also presented to validate the design and model of current in its stator windings with variable voltage across it's the drive.
Shared Register File Based ILP for Multicore

With the development of semi-conductor industry, more transistors can be integrated onto a single chip. But the software programming model cannot fit the parallelism requirement of CMP (Chip Multi Processor) based architecture. The communication between different cores becomes a very serious problem, and it made bad effectiveness on performance. This paper proposes an approach called API (Architecture of Parallelism on Instructions) which can scan the source code of the programs, analyze the data dependency, and cluster retentive instructions together. The instructions without dependency can be issued directly in parallel by different cores. API provides a global register file for the effective execution of the programs on CMP chips. We have also evaluated the time consuming comparison between API and the traditional architecture in our experiments by using SPEC benchmark CPU2000. The experimental results show that the instruction clock in API is only 49 percent of original instruction clocks. Moreover, there only need 4 cores to approach the best performance.
Detection of central and obstructive sleep apnea in children using pulse transit time

The aim of this study was to validate the use of pulse transit time (PTT) as a method to monitor sleep apnea in children. PTT was estimated as the interval between the ECGR-wave and the point at which the pulse wave at the finger reached 50% amplitude. First, we assessed changes in the PTT during breathing against known resistances in 15 awake children; resistance was applied with a modified nose and mouth two-way nonrebreathing face mask, having the inhalation valve port fitted with drilled plastic cylinders of various diameters. Second, we analyzed 20 events of obstructive apnea and 90 events of central apnea during sleep in 10 children. Our data showed good correlation between the inspiratory effort and PTT oscillation amplitude. In addition, PTT oscillation amplitude tuned out to successfully discriminate central from obstructive apnea.
Adaptive Cancellation of a Sinusoidal Disturbance with Rapidly Varying Frequency Using an Augmented Error Algorith

This paper considers a compensator for a sinusoidal disturbance with known but rapidly varying frequency. The compensator is obtained as an adaptive feedforward cancellation algorithm using an augmented error. The system is shown to be Lyapunov stable and equivalent to a linear time-varying controller that includes an internal model of the disturbance. The stability and robustness properties of the augmented error algorithm are validated by simulation results
Examining the Response Competition Hypothesis of Age Effects in Implicit Memory

ABSTRACT Age reductions in priming have been explained by differences in processing demands across implicit memory tests. According to one hypothesis, older adults show reduced priming relative to younger adults on implicit tests that require production of a response because these tests typically allow for response competition. In contrast, older adults do not show reductions in priming on identification tests that contain little response competition. The following experiments tested the specific role of response competition in mediating age effects in implicit memory. In Experiment 1, younger and older adults studied a list of words and were then given an implicit test of word stem completion. They studied a second list of words and were given an implicit test of general knowledge. Each implicit test contained items with unique solutions (the low response competition condition) and items with multiple solutions (the high response competition condition). In Experiment 2, younger and older adults were given explicit versions of the word stem completion and the general knowledge tests. Results showed an effect of age on explicit memory (Experiment 2), but no effect of age or response competition on priming (Experiment 1). Results are inconsistent with the theory that response competition leads to age effects on production tests of implicit memory.
Evaluation of Mycobacteria Growth Indicator Tube (MGIT) for drug susceptibility testing of Mycobacterium tuberculosis.

SETTING Mycobacteria Supranational Reference Laboratory. OBJECTIVE To evaluate the Mycobacteria Growth Indicator Tube (MGIT) method for drug susceptibility testing of Mycobacterium tuberculosis. DESIGN One hundred and one clinical strains of M. tuberculosis were evaluated for their susceptibilities to isoniazid (INH), rifampicin (RIF), ethambutol (EMB) and streptomycin (SM) by MGIT and by the proportion method on Löwenstein-Jensen (L-J) medium. The concentrations of drugs in MGIT were: 0.1, 1.0, 3.5 and 0.8 microg/ml for INH, RIF, EMB and SM, respectively. RESULTS The results for individual drugs showed a good correlation: the specificity was 100% for INH, RIF and EMB and 92% for SM; the sensitivity was 100%, 94.6%, 96.1% and 89.7% for INH, RIF, EMB and SM, respectively, and the accuracy values 1.0, 0.98, 0.99 and 0.91. CONCLUSION The MGIT system appears to be a reliable and simple non-radiometric method for the drug susceptibility testing of M. tuberculosis.
Image processing techniques for object tracking in video surveillance- A survey

Many researchers are getting attracted in the field of object tracking in video surveillance, which is an important application and emerging research area in image processing. Video tracking is the process of locating a moving object or multiple objects over a time using camera. Due to key features of video surveillance, it has a variety of uses like human-computer interactions, security and surveillance, video communication, traffic control, public areas such as airports, underground stations, mass events, etc. Tracking a target in a cluttered premise is still one of the challenging problems of video surveillance. A sequential flow of moving object detection, its classification, tracking and identifying the behavior completes the processing framework of video surveillance. This paper takes insight into tracking methods, their categorization into different types, focuses on important and useful tracking methods. In this paper, we provide a brief overview of tracking strategies like region based, active contour based, etc with their positive and negative aspects. Different tracking methods are mentioned with detailed description. We review general strategies under literature survey on different techniques and finally stating the analysis of possible research directions.
P RODUCTION S EQUENCING AS N EGOTIATION

The production sequencing problem involves a factory gener ating a product sequence such that when processed, the sequence will both satisfy current orders, and minimize overall costs. In this paper, we argue that production sequencing ma y fruitfully be considered as a negotiation problem, in which production cells within a fa ctory negotiate over product sequences in order to fairly distribute costs. We begin by de scribing and formally defining the production sequencing problem; we then investigate its com plexity, and present an analysis of it using the tools of game and negotiation theory. We then defi ne a negotiation algorithm for production sequencing, and discuss what assumptions and si mplifications must be made in order to make this algorithm suitable for implementation. W e conclude by discussing issues for future work
ADAPTIVE CONTROL USING A RECURRENT NEURAL NETWORK OBSERVER

A new recurrent neural network approach for on line adaptive control is presented. The resulting control scheme matches both the conventional and neural control methods. Using input-output data, a modified recurrent Elman’s network is trained to model a general non-linear discrete time system. By assuming a linearisation of this neural model a time varying adaptive observer is derived. Therefore conventional control techniques, like pole placement or quadratic optimal control, can be applied. Using simultaneous on line training of the neural network and controller synthesis, the resulting algorithm is adaptive. In order to evaluate its performance, this technique is applied to a laboratory scaled pilot plant, an airstream heating, and compared with the performance of a conventional self-tuning adaptive controller (STAC). For this particular process the experimental results allows to conclude that this control strategy is a promising technique.
Analysis of the COLD Uniform Linear Array

In this paper, we study the Cocentered Orthogonal Loop and Dipole pairs Uniform Linear Array (COLD-ULA) array which is sensitive to the source polarization in the context of the localization of time-varying narrow-band far-field sources. We derive and analyze nonmatrix expressions of the deterministic Cramér-Rao Bound (CRB) for the direction and the polarization parameters under the assumption that the number of sensors is large. We name this bound ACRB(COLD). This assumption seems in a first time to be severe but we show that the ACRB(COLD) is close to the CRB (computed without the large number of sensors assumption) even if the number of sensors is moderate (slightly higher about ten sensors). Our approach has two important advantages: (•) the computational complexity of the proposed closed-form of the bound is very cheap, comparing to the brute force computation of a matrix-based deterministic CRB which needs the inversion of a large Fisher Information Matrix in case of time-varying model parameters and (••) some useful informations can be deduced from the behaviour of the bound in the situation when the sources are not too closely-spaced. In particular, we prove that the ACRB(COLD) for the direction parameter is not affected by the knowledge or not of the polarization parameters. Another conclusion is that with a COLD-ULA, more model parameters can be estimated than the uniformly polarized ULA without degrading the estimation accuracy of localization parameter.
HIV-1 Tat Triggers TGF-β Production and NK Cell Apoptosis that is Prevented by Pertussis Toxin B

Herein, we show that PTX-B and its non-toxic mutant PT9K/129G inhibit transcription and secretion of TGF-β elicited by HIV-1 Tat in NK cells. Moreover, Tat strongly activates the cJun component of the multimolecular complex AP-1, while TGF-β triggers cFos and cJun. Treatment of NK cells In turn,with PTX-B or PT9K/129G inhibits Tat and TGF-β-induced activation of AP-1. TGF-β enhances starvation-induced NK cell apoptosis, reduces the transcription of the antiapoptotic protein Bcl-2 and inhibits Akt phosphorylation induced by oligomerization of the triggering NK cell receptor NKG2D. All these TGF-β-mediated effects are prevented by PTX-B or PT9K/129G, through a PI-3K-dependent mechanism. Finally, PTX-B and PT9K/129G upregulate Bcl-xL, the isoform of Bcl-x that protects cells from starvation-induced apoptosis. Of note, in NK cells from patients with HIV-1 infection, mRNA expression of Bcl-2 and Bcl-xL was consistently lower than that of healthy donors; interestingly, TGF-β and Tat were detected in the sera of these patients. These data suggest that Tat-induced TGF-β production and the consequent NK cell failure, possibly occurring during early HIV-1 infection, may be regulated by PTX-B and PT9K/129G.
A design framework for mediated personal relationship devices

Substantial numbers of people carry out intimate relationships at a distance. These people have to utilise a variety of communication technologies in order to maintain their relationship. Although a number of communication technologies have been developed to help maintain an emotional connection between remote couples, there has been no comprehensive consideration of the design space that these technologies are developed within. We present here a proposed design framework for intimate communication devices. The intention is to highlight the decisions designers have to make when coming up with new communication systems and provide a more formalised system for considering the issues involved.
Transversals in rectangles

Let L(m;n) be the largest integer such that, if each symbol in an m n rectangle occurs at most L(m;n) times, then the array must have a transversal. We improve the lower bound to L(m;n) b m+1) 1 m 1 c, form > 1. Then we show that sporadically L(m;n) < bmn 1 m 1 c in the range m n m 3m + 3. De ne n0(m) to be the smallest integer z such that if n z then L(m;n) = bmn 1 m 1 c. We improve n0(m) from O(m ) to O(m). Finally, we determine L(4; n) for all n.
Sensitivity Analysis of Minimum Variance Portfolios

The purpose of this thesis is to conduct a Best-Grauer style sensitivity analysis of the investment allocation decisions made, not within a modern portfolio theory (MPT), but within a capital asset pricing model (CAPM) framework. For analytic tractability, we made the simplification (of some current practical interest) that investors have the objective of minimizing the variance of their portfolios without reference to the expected returns to be obtained from these portfolios. Our analytic results reveal how the minimum variance portfolio composition, expected return and risk would change with respect to the changes of the underlying asset correlations and volatilities. We give the investors instructions on how to build the minimum variance portfolio and keep the portfolio risk minimized with variable market data. We also specifically discuss the two-asset portfolio, which is analytically tractable and we find many interesting results. Finally, we analyze the risk that is not covered when the investor makes estimation errors about the market data using our model. We show the portfolio minimum variance is stable.
An ID-based Designated-Verifier Proxy Multi-signature Scheme

Designated verifier signature is a new cryptographic primitive, in a designated verifier signature scheme, only the designated verifier specified by the signer can verify the validity of the signature. In this paper, we propose an ID-based designated verifier proxy multi-signature scheme by combining the proxy multi-signature and the designated verifier signature. In our scheme, the designated verifier can verify the proxy-multi signature generated by the proxy signer on behalf of the group of original signers. Analysis shows that our scheme is secure and it is suitable for the practice in electronic world.
Computer Support for Distributed Collaborative Writing: A Coordination Science Perspective

The goal of our research is to provide computer support for distributed collaborative writing. Writers can be said to be distributed when they have distributed knowledge and skill, and they share that knowledge and skill in order to develop a draft; or, even when they have significant overlap in knowledge and skill, they distribute the work of producing the draft itself among them. But in this sense, all collaborative writing is distributed. In the sense we will use the term here, distributed collaborative writing refers to, additionally, situations in which the writers are distributed in time (i.e., they do not work on the artifact at the same time) or place (i.e., they do not meet face-to-face). The central research questions in distributed collaborative writing are "What does the process of producing a written product look like when it is divided among writers who coordinate to produce it over time and space? " and "What is the relationship of these processes to success? " When the process includes "active agents," the scope of the first question shifts slightly to include not only people, but computers as well. This question is, of course, the central question of "distributed cognition" or "coordination science," applied to collaborative writing. In analogy with the way cognitive scientists (psychologists, AI researchers, etc.) are interested in identifying strategies and representations involved in individual cognition, coordination scientists are interested in identifying the strategies and representations that groups of "agents"--people and computers--use to coordinate their activities (Malone, 1988).
An event extraction model based on timeline and user analysis in Latent Dirichlet allocation

Social media such as Twitter has come to reflect the reaction of the general public to major events. Since posts are short and noisy, it is hard to extract reliable events based on word frequency. Even though an event term appears in a particularly low frequency, as long as at least one reliable user mentions the term, it should be extracted. This paper proposes an event extraction method which combines user reliability and timeline analysis. The Latent Dirichlet Allocation (LDA) topic model is adapted with the weights of event terms on timeline and reliable users to extract social events. The reliable users are detected on Twitter according to their tweeting behaviors: socially well-known users and active users. Reliable and low-frequency events can be detected based on reliable users In order to see the effectiveness of the proposed method, experiments are conducted on a Korean tweet collection; the proposed model achieved 72% in precision. This shows that the LDA with timeline and reliable users is effective for extracting events on the Twitter test collection.
Causal and Temporal Text Analysis: The Role of the Domain Model

It is generally recognized that interpreting natural language input may require access to detailed knowledge of the domain involved. This is particularly tree for multi-sentence discourse, where we must not only analyze the individual sentences but also establish the connections between them. Simple semantic constraints an object classification hierarchy, a catalog of meaningful semantic relations are not sufficient. However, the appropriate structure for integrating a language analyzer with a complex dynamic (time-dependent) model --one which can scale up beyond 'toy' domains is not yet well understood.
Exploiting Multiply Annotated Corpora in Biomedical Information Extraction Tasks

This paper discusses the problem of utilising multiply annotated data in training biomedical information extraction systems. Two corpora, annotated with entities and relations, and containing a number of multiply annotated documents, are used to train named entity recognition and relation extraction systems. Several methods of automatically combining the multiple annotations to produce a single annotation are compared, but none produces better results than simply picking one of the annotated versions at random. It is also shown that adding extra singly annotated documents produces faster performance gains than adding extra multiply annotated documents.
A Fair Multiuser Cooperation Protocol for Increasing the Throughput in Energy-Constrained Ad-hoc Networks

In ad-hoc networks, cooperative diversity is especially desired where the use of multiple antennas may be impractical due to the size of nodes. There has been a lot of work on improving the peer-to-peer link quality by using advanced coding or power and rate allocation between a single source node and its relays. However, how to efficiently and fairly allocate resources among multiple users and their relays is still unknown. In this paper, a novel multiuser cooperation protocol is proposed, where multiuser diversity scheme is adopted to schedule different source/destination pairs and each pair computes its required rate based on a power reward. Power reward is adopted by each node to evaluate the power contributed to and by others so as to guarantee fairness. It will be shown that in energy-constrained cooperative ad-hoc networks, fairness can actually bring significant throughput gains. Simulation results will validate our analysis and show that compared to direct transmission and full cooperation protocols, much higher aggregate throughput can be achieved by the proposed Fair Cooperation Protocol thanks to improved fairness.
Analysis of a convenient information bound for general quantum channels

Open questions from Sarovar and Milburn (2006 J. Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for quasi-classical models their bound is achievable and they gave a necessary and sufficient condition for positive operator-valued measures (POVMs) attaining this bound. They asked (i) whether their bound is attainable more generally, (ii) whether explicit expressions for optimal POVMs can be derived from the attainability condition. We show that the symmetric logarithmic derivative (SLD) quantum information is less than or equal to the SM bound, i.e., H(θ) ⩽ Cϒ(θ) and we find conditions for equality. As the Fisher information is less than or equal to the SLD quantum information, i.e., FM(θ) ⩽ H(θ), we can deduce when equality holds in FM(θ) ⩽ Cϒ(θ). Equality does not hold for all channels. As a consequence, the attainability condition cannot be used to test for optimal POVMs for all channels. These results are extended to multi-parameter channels.
Neuropsychological Impairment among Juvenile Delinquents

The aim of the present study was to investigate the role of neuropsychological impairment among delinquents and non- delinquents. The total sample comprised of two hundred participants consisting of one hundred juvenile and non-juvenile with age range of 10-17 years (M=15.76, SD= 1.93). Data was collected from the incarcerated subjects from three main jails of Khyber Pakhtunkhwa they include, Central Prisons of Kohat, Peshawar Swabi and Haripur with the help of Psychologists serving in the prison. It was hypothesized that delinquents will score higher on neuropsychological impairment scale as compared to non-delinquents. Neuropsychological impairment will be significantly correlated with the scores of delinquency. The results revealed significant impairment in the neurological functioning of the delinquents as compared to non-delinquents. In the present study six neuropsychological deficits were measured, they included neuropsychological emotional, learning, sensory motor, concentration, and neuropsychological depression in association with delinquency. Hence the results produced three key findings, first the sub-scales of neuropsychological impairment were significantly positively associated with delinquency. Second, sub-scales of neuropsychological impairment predicted variation in the magnitude of association with delinquency. Third, of all the six sub-scales neuropsychological emotional problems, neuropsychological motor problems and neuropsychological depression were slightly strongly associated with delinquency as compared to learning, sensory motor and concentration problem.