Miracle-dz/UniFAR-FTUs huggingface dataset:
An Algorithm for Computing the Radix-2 n Fast Fourier Transform

In digital signal processing, the Fast Fourier Transform (FFT) is a kind of high efficient method to calculate the discrete Fourier transform (DFT). It cuts the discrete signal sequence which the length is N for different radix sequences to operate using the way of handing back and partition. Currently, the radix-2 FFT algorithm is a popular approach to do the transform work. However, its computation is still big. This paper seeks for a more efficient algorithm to better reduce computational complexity and it starts the study from the radix-2 and the radix-4 fast Fourier transform, then explores more efficient and faster radix-8 FFT algorithm and finally extends to radix any power of 2. Experiments evidence that the radix-8 FFT algorithm outperform the radix-2 in all in circumstances, therefore prove the feasibility and efficiency of the radix-2 n .
Reconfigurable cyclical patch antenna

The design of a reconfigurable cyclical printed antenna is discussed in this paper. The antenna's topology allows a wide bandwidth of operation and an ability for radiation pattern reconfiguration. The antenna is designed at Ka-band, with different modes of radiation pattern characteristics. The different operational states reshape the radiation beam and redirect major radiation pattern lobes towards desired directions. The antenna is proposed for radar applications where such reconfigurable characteristic is desired.
Recent Advances in Fluorescence Lifetime Analytical Microsystems: Contact Optics and CMOS Time-Resolved Electronics

Fluorescence spectroscopy has become a prominent research tool with wide applications in medical diagnostics and bio-imaging. However, the realization of combined high-performance, portable, and low-cost spectroscopic sensors still remains a challenge, which has limited the technique to the laboratories. A fluorescence lifetime measurement seeks to obtain the characteristic lifetime from the fluorescence decay profile. Time-correlated single photon counting (TCSPC) and time-gated techniques are two key variations of time-resolved measurements. However, commercial time-resolved analysis systems typically contain complex optics and discrete electronic components, which lead to bulkiness and a high cost. These two limitations can be significantly mitigated using contact sensing and complementary metal-oxide-semiconductor (CMOS) implementation. Contact sensing simplifies the optics, whereas CMOS technology enables on-chip, arrayed detection and signal processing, significantly reducing size and power consumption. This paper examines recent advances in contact sensing and CMOS time-resolved circuits for the realization of fully integrated fluorescence lifetime measurement microsystems. The high level of performance from recently reported prototypes suggests that the CMOS-based contact sensing microsystems are emerging as sound technologies for application-specific, low-cost, and portable time-resolved diagnostic devices.
Stable Plastid Transformation for High-Level Recombinant Protein Expression: Promises and Challenges

Plants are a promising expression system for the production of recombinant proteins. However, low protein productivity remains a major obstacle that limits extensive commercialization of whole plant and plant cell bioproduction platform. Plastid genetic engineering offers several advantages, including high levels of transgenic expression, transgenic containment via maternal inheritance, and multigene expression in a single transformation event. In recent years, the development of optimized expression strategies has given a huge boost to the exploitation of plastids in molecular farming. The driving forces behind the high expression level of plastid bioreactors include codon optimization, promoters and UTRs, genotypic modifications, endogenous enhancer and regulatory elements, posttranslational modification, and proteolysis. Exciting progress of the high expression level has been made with the plastid-based production of two particularly important classes of pharmaceuticals: vaccine antigens, therapeutic proteins, and antibiotics and enzymes. Approaches to overcome and solve the associated challenges of this culture system that include low transformation frequencies, the formation of inclusion bodies, and purification of recombinant proteins will also be discussed.
Verification of a Method for Measuring Parkinson’s Disease Related Temporal Irregularity in Spiral Drawings

The objective of this paper was to develop and evaluate clinimetric properties of a method for measuring Parkinson's disease (PD)-related temporal irregularities using digital spiral analysis. In total, 108 (98 patients in different stages of PD and 10 healthy elderly subjects) performed repeated spiral drawing tasks in their home environments using a touch screen device. A score was developed for representing the amount of temporal irregularity during spiral drawing tasks, using Approximate Entropy (ApEn) technique. In addition, two previously published spiral scoring methods were adapted and their scores were analyzed. The mean temporal irregularity score differed significantly between healthy elderly subjects and advanced PD patients (P<;0.005). The ApEn-based method had a better responsiveness and test-retest reliability when compared to the other two methods. In contrast to the other methods, the mean scores of the ApEn-based method improved significantly during a 3 year clinical study, indicating a possible impact of pathological basal ganglia oscillations in temporal control during spiral drawing tasks. In conclusion, the ApEn-based method could be used for differentiating between patients in different stages of PD and healthy subjects. The responsiveness and test-retest reliability were good for the ApEn-based method indicating that this method is useful for measuring upper limb temporal irregularity at a micro-level.
Effect of Spirulina Food Supplement on Blood Morphological and Biochemical Composition in Sportsmen

Vilnius Pedagogical University, Vilnius, Lithuania Objective: Highly active food supplements find an ever-growing application in sportsmen’s nutrition. Of highest biological value are natural concentrates of optimally combined substances produced by nature. One of the food supplements of this kind is dietary Spirulina produced by the Tianshi firm (China). It is a most rationally balanced food supplement of a high biological value; it satisfies the needs of the whole body and improves its immune system. The aim of the current work was to assess the effect of the multicomponent natural food supplement Spirulina on the physical development, blood morphological and biochemical picture of sportsmen. Materials and methods: Investigations carried out on endurance-training sportsmen showed that a 14-d administration of Spirulina exerted a positive effect on blood morphological composition indices and biochemical changes. Erythrocyte increment was more significant for the sportsmen whose initial indices were low. Throughout the experiment, blood haemoglobin level increased on average by 1.42 g/l, white blood hematocrit showed a decreasing tendency. Spirulina administration was accompanied by a leucocyte count upregulation tendency and positive changes in leukocyte formula. Leucograms showed a marked leveling of the agranulocytes–granulocytes ratio. Results and discussion: Analysis of the biochemical indices showed that during the whole experimental period the mean values of the indices were within the recommended limits. Under the effect of Spirulina intake, blood creatinine-kinase levels tended to increase and creatinine levels showed a decreasing tendency (on average from 93.99 to 90.45 mmol/l); also, triglyceride and bilirubin levels tended to decrease, while those of urea and uric acid increased. Most of the positive changes in blood morphological and biochemical indices were still present two weeks after the Spirulina intake was interrupted.
Mixed-integer programming for control

The article describes how mixed-integer programming (MIP) can be employed for feedback control. MIP can be used to find optimal trajectories subject to integer constraints, which can encode discrete decisions or nonconvexity, for example. This optimization can be performed online within model predictive control (MPC) to implement a feedback control law. The article discusses how to model systems using MIP, the implementation as a MPC, and techniques for fast solutions of the optimizations to make them suitable for real-time use.
Interactive System For Image Based 3D Modeling And Rendering From Single View Perspective Images

Most of the Image based Modeling and Rendering works found in the literature rely on the input supplied by the user and hence it becomes necessary to optimize the user interaction while building the 3D model We present an interactive system for Image based 3D model building from single view uncalibrated images based on Depth-Cueing [8] which constructs approximate wireframe from the user specified depth information. The depth information is interpreted by drawing a gray shaded line whose intensity is highest at the vertices closer to viewing point and decreases towards the vertices farther. On the rendering part, the perspective distortion is rectified on each surface based on projective transformation by exploiting the presence of symmetric objects (like circle, square, etc) in the images to get the fronto-parallel view. Our study shows that the symmetric . objects like circle get deformed to an ellipse due to perspective distortion and projective transformation. We demonstrated the significance of symmetric objects in a scene/image to rectify the perspective distortion. The rectified surfaces are used to retrieve the actual 3D coordinates of the wireframe and also used as texture maps during rendering to get the photo realistic results. We have used images containing planar surfaces. The user interaction during wireframe building needs no idea about the scene and camera parameters. The results are significant and convincing.
Towards a Formal Distributional Semantics: Simulating Logical Calculi with Tensors

The development of compositional distributional models of semantics reconciling the empirical aspects of distributional semantics with the compositional aspects of formal semantics is a popular topic in the contemporary literature. This paper seeks to bring this reconciliation one step further by showing how the mathematical constructs commonly used in compositional distributional models, such as tensors and matrices, can be used to simulate di erent aspects of predicate logic. This paper discusses how the canonical isomorphism between tensors and multilinear maps can be exploited to simulate a full-blown quantifier-free predicate calculus using tensors. It provides tensor interpretations of the set of logical connectives required to model propositional calculi. It suggests a variant of these tensor calculi capable of modelling quantifiers, using few non-linear operations. It finally discusses the relation between these variants, and how this relation should constitute the subject of future work.
A Semi-Supervised Bayesian Network Model for Microblog Topic Classification

Microblogging services have brought users to a new era of knowledge dissemination and information seeking. However, the large volume and multi-aspect of messages hinder the ability of users to conveniently locate the specific messages that they are in terested in. While many researchers wish to employ traditional text classification approaches t o effectively understand messages on microblogging services, the limited length of the messages prevents these approaches from being employed to their full potential. To tackle this problem, we pr opose a novel semi-supervised learning scheme to seamlessly integrate the external web resources to compensate for the limited message length. Our approach first trains a classifier based on the ava ilable labeled data as well as some auxiliary cues mined from the web, and probabilistically predicts the categories for all unlabeled data. It then trains a new classifier using the labels for all m essages and the auxiliary cues, and iterates the process to convergence. Our approach not only greatly reduces the time-consuming and labor-intensive labeling process, but also deeply exploit s the hidden information from unlabeled data and related text resources. We conducted extensive experiments on two real-world microblogging datasets. The results demonstrate the effectiveness o f the proposed approaches which produce promising performance as compared to state-of-the-art methods. Title and abstract in Chinese
Semantics of types for mutable state

Proof-carrying code (PCC) is a framework for mechanically verifying the safety of machine language programs. A program that is successfully verified by a PCC system is guaranteed to be safe to execute, but this safety guarantee is contingent upon the correctness of various trusted components. For instance, in traditional PCC systems the trusted computing base includes a large set of low-level typing rules. Foundational PCC systems seek to minimize the size of the trusted computing base. In particular, they eliminate the need to trust complex, low-level type systems by providing machine-checkable proofs of type soundness for real machine languages. In this thesis, I demonstrate the use of logical relations for proving the soundness of type systems for mutable state. Specifically, I focus on type systems that ensure the safe allocation, update, and reuse of memory. For each type in the language, I define logical relations that explain the meaning of the type in terms of the operational semantics of the language. Using this model of types, I prove each typing rule as a lemma. The major contribution is a model of System F with general references—that is, mutable cells that can hold values of any closed type including other references, functions, recursive types, and impredicative quantified types. The model is based on ideas from both possible worlds and the indexed model of Appel and McAllester. I show how the model of mutable references is encoded in higher-order logic. I also show how to construct an indexed possible-worlds model for a von Neumann machine. The latter is used in the Princeton Foundational PCC system to prove type safety for a full-fledged low-level typed assembly language. Finally, I present a semantic model for a region calculus that supports type-invariant references as well as memory reuse.
Multivariate fronthaul quantization for C-RAN downlink: Channel-adaptive joint quantization in the cloud

In the downlink of the Cloud-Radio Access Network (C-RAN) cellular architecture, complex baseband signals are transmitted from a central unit (CU) in the “cloud” over digital fronthaul links to distributed radio units (RUs). The standard design of digital fronthauling is based on quantization that operates separately over each fronthaul link. In this paper, a fronthaul quantization scheme is proposed that, unlike conventional schemes, implements a joint quantization mapping across all fronthaul links that is adapted to the current channel conditions. As compared to the current standard approach, the proposed multivariate quantization (MQ) scheme only requires additional processing at the CU, while no modification is needed at the RUs. The algorithm is extended to enable variable-length compression, and is compared via numerical results to a related approach based on the information-theoretic technique of multivariate compression.
Scalable Asynchronous Hardware Protocol Verification for Compositions with Relative Timing

Correct interaction of asynchronous hardware protocols requires verification. Performance and power of asynchronous hardware circuits and protocols can be vastly improved by modifying them with judicious application of timing constraints. A methodology is presented for verifying larger asynchronous protocols through compositional model checking with symbolic methods. This approach uses Relative timing constraints for modeling timed asynchronous hardware protocols and hence is generic for timed and untimed protocols. This paper illustrates the modeling technique for interleaving and simultaneous models with relative timing, which helps in pruning state space. Properties which are verified for ensuring correctness of composed models are explained. Case studies of a linear pipeline controller and CElement are discussed by applying BDD and SAT methods. The simultaneous model yields better execution times when compared to interleaving for large number of compositions. In the simultaneous model, SAT methods tend to find a counter example in lesser time than BDD methods. Automatic model and property generation, leading to push button solution will enable verification of larger control planes.
Face recognition using eigenface with naive Bayes

One of the lack of eigenface for prediction the face recogniton is not good accuracy. This paper uses naive Bayes for classifying the result of eigenface feature extraction to predict the face. The normalization z-score is added for sharping the accuracy. To see the performance of proposed method, the 200 datasets are divided into data training and testing by using cross validation (k=10). The results show that the proposed method can predict the face image up to 70%. Moreover by adding normalization Z-Score, the accuration of prediction raise up to 89.5% (in average).
Are wound-rotor synchronous motors suitable for use in high efficiency torque-dense automotive drives?

This paper discusses the possibility of using wound-rotor synchronous motors in automotive drive applications. Currently the brushless rare-earth magnet machine is the main choice of drive motor because it has high efficiency and it is very torque-dense, although some vehicles using induction motors. Issues with rare-earth material supply means manufacturers are looking at alternatives. This paper reviews the requirements for a wound-rotor synchronous machine using a current automotive drive application and carries out some load simulations using 2D finite element analysis. Direct comparison is made to a brushless permanent-magnet machine and first-pass designs are presented. It is found that there are possibilities for this machine in this application; possibilities that current practice largely ignores.
Consistency of Spectral Clustering

Consistency is a key property of all statistical procedures analyzing randomly sampled data. Surprisingly, despite decades of work, little is known about consistency of most clustering algorithms. In this paper we investigate consistency of the popular family of spectral clustering algorithms, which clusters the data with the help of eigenvectors of graph Laplacian matrices. We develop new methods to establish that, for increasing sample size, those eigenvectors converge to the eigenvectors of certain limit operators. As a result, we can prove that one of the two major classes of spectral clustering (normalized clustering) converges under very general conditions, while the other (unnormalized clustering) is only consistent under strong additional assumptions, which are not always satisfied in real data. We conclude that our analysis provides strong evidence for the superiority of normalized spectral clustering. 1. Introduction. Clustering is a popular technique which is widely used in statistics, computer science and various data analysis applications. Given a set of data points, the goal is to separate the points in several groups based on some notion of similarity. Very often it is a natural mathematical model to assume that the data points have been drawn from an underlying probability distribution. In this setting it is desirable that clustering algorithms should satisfy certain basic consistency requirements:
Depositional history and provenance of cratonic “Purana” basins in southern India: A multipronged geochronology approach to the Proterozoic Kaladgi and Bhima basins

Peninsular India is a collage of Archaean cratonic domains separated by Proterozoic mobile belts. A number of cratonic basins, known as “Purana basins” in the Indian literature, formed in different parts of the Indian Peninsula during extensional tectonic events, from Paleoproterozoic through Neoproterozoic times. In this contribution, we present a diversity of new geochronological data for different units within the Kaladgi and the Bhima basins, which overlie the western and eastern Dharwar cratons, respectively. The new geochronology data are discussed in terms of depositional history and provenance of these poorly understood Proterozoic intracratonic basins. For the Kaladgi Group, a U–Pb baddeleyite age of 1,861 ± 4 Ma obtained for a dolerite dyke intruding the Yendigere Formation is used to constrain the minimum age of deposition of the lower Kaladgi Group. This result demonstrates that this part of the succession is comparable in age to the Papaghni Group of the Cuddapah Basin, heralding onset of Purana sedimentation at ~1,900 Ma. The detrital zircon populations from the clastic rocks of the Kaladgi and Bhima basins show unique and distinct age patterns indicating different source of sediments for these two basins. Palaeocurrent analysis indicates a change in provenance from south or southeast to west or northwest between the Kaladgi and Bhima clastic sedimentation. New U–Th–Pb and Rb–Sr radiometric dates of limestones and glauconite‐bearing sandstones of the Bhima Group (Bhima Basin) and the Badami Group (Kaladgi Basin) indicate deposition at around 800–900 Ma, suggesting contemporaneity for the two successions. Thus, the unconformity between the Kaladgi Group and the overlying Badami Group represents a time gap of up to 1,000 Myr. These new results demonstrate the complex multistage burial and unroofing history of the Archaean Dharwar Craton throughout the Proterozoic, with important implications for exploration of metal deposits and diamonds in Peninsular India.
Clinical engineers: stewards of healthcare technologies

The majority of clinical engineers serve as part of the healthcare team along with physicians, nurses, technologists, and other hospital staff. The clinical engineer's role is to insure that other team members have adequate and effective technology for the time delivery of quality healthcare. In essence, clinical engineers must act as the "stewards" of healthcare technology. As effective stewards, clinical engineers need to understand the practitioners' intent, they need to possess knowledge with respect to both existing and developing healthcare technology, and they must also understand the various implications of applying the technology. Only when forearmed in this manner can clinical engineers hope to serve as successful stewards and help insure healthcare technology is applied for the greatest benefit. The implications of technology adoption and integration between diagnostic, information processing, and therapeutic systems are discussed.