Miracle-dz/UniFAR-FTUs huggingface dataset:
Treatment of recurrent epileptic seizures in patients with neurological disorders

This study aimed to investigate the clinical characteristics and the treatment principles and methods of recurrent epileptic seizures in patients with neurological disorders. A retrospective analysis was performed of the clinical data, treatment methods and results in 13 patients with recurrent epileptic seizures attending the neurosurgery department. Of the 13 patients, 10 had a history of epilepsy, 9 had organic frontal lobe brain lesions and 11 exhibited frontal lobe epilepsy. The causes of the epileptic seizure aggravation included drug withdrawal, dose reduction and dressing change (5 cases). The epileptic seizure types included partial and secondary full seizures and the seizure frequency ranged from 1 seizure/3 min to 1 seizure/several h. Following combined therapy with multiple anti-epileptic drugs (AEDs), including oral administration and injection, the epilepsy was controlled. The addition of orally administered levetiracetam improved the treatment efficiency. In cases of recurrent epileptic seizures in patients with neurological disorders, the combined administration of AEDs should be conducted with doses higher than the conventional initial dose to control the epileptic seizures as rapidly as possible.
Sufficient Conditions for Graphicality of Bidegree Sequences

There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality criteria that depend on the number of elements in the sequence, corresponding to the number of nodes in an associated graph, and the mean degree of the sequence. These conditions, which are stated in terms of bidegree sequences for directed graphs, are easier to apply than classic necessary and sufficient graphicality conditions involving multiple inequalities. They are also more flexible than more recent graphicality conditions, in that they imply graphicality of some degree sequences not covered by those conditions. The form of our results will allow them to be easily used for the generation of graphs with particular degree sequences for applications.
Use of a lipid emulsion as a novel carrier for corticosteroids

EXD. Biol. 39: 855 I Birmingham, A. T. , Wilson, A. B. (1963) Br. J . Pharrnacol. 21: 569-580 . -DeGuzman, N . T. , Munoz, O. , Palmer. R. F. , Davolos, D. , Alousi, A. (1978) Circulation 58 (Suppl. 11): 11-183 Farah, A. E. , Alousi, A. A. (1978) Life Sci. 22: 1139-1148 Gaide. M. S. , Erzin, A. M. , Baker, S. P., Myerburg, R. J. , Gelband, H:, Basset, A. L. (1980) Fed. Proc. Fed. Am. sot. Exp. BIoI. 39: 854 HukoviC, S. (1961) Br. J . Pharmacol. 16: 188-194 LeJemtel, T. H. , Keung, E. , Sonnenblick, E. H. , Ribner, H. S . , Matsumoto, M. , Davis, R. , Schwartz, W. , Alousi, A . A. , Davolos, D. (1979) Circulation 59: 1098-1104 Meisheri. K. D. , Palmer, R. P., Van Breemen, C. (1980) Eur. J. Pharmacol. 61: 159-165 Morgan, J . P. , Lee, N . K. M. , Blinks, J . R. (1980) Fed. Proc. Fed. Am. SOC. Exp. Biol. 39: 854 Ohizumi, Y . , Shibata, S. (1980) J. Pharmacol. Exp. Ther. 214: 209-212 Ohizumi, Y . , Shibata, S . (1981) Br. J. Pharmacol. 72: 239-244 van Rossum, J . M. (1963) Arch. Int. Pharmacodyn. 143: 299-330
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed <italic>c</italic> > 1 and given any <italic>n</italic> nodes in <inline-equation><f><sc>R</sc></f> </inline-equation><supscrpt>2</supscrpt>, a randomized version of the scheme finds a (1 + 1/<italic>c</italic>)-approximation to the optimum traveling salesman tour in <italic>O(n</italic>(log <italic>n</italic>)<supscrpt><italic>O(c)</italic>)</supscrpt> time. When the nodes are in <inline-equation><f><sc>R</sc></f> </inline-equation><italic>d</italic>, the running time increases to <italic>O(n</italic>(log <italic>n</italic>)<supscrpt>(O(<inline-equation><f><rad><rcd>d</rcd></rad></f> </inline-equation></supscrpt>c))<supscrpt>d-1</supscrpt>). For every fixed <italic>c, d</italic> the running time is <italic>n</italic> • poly(log<italic>n</italic>), that is <italic>nearly linear</italic> in <italic>n</italic>. The algorithmm can be derandomized, but this increases the running time by a factor <italic>O(n<supscrpt>d</supscrpt></italic>). The previous best approximation algorithm for the problem (due to Christofides) achieves a 3/2-aproximation in polynomial time. We also give similar approximation schemes for some other NP-hard Euclidean problems: Minimum Steiner Tree, <italic>k</italic>-TSP, and <italic>k</italic>-MST. (The running times of the algorithm for <italic>k</italic>-TSP and <italic>k</italic>-MST involve an additional multiplicative factor <italic>k</italic>.) The previous best approximation algorithms for all these problems achieved a constant-factor approximation. We also give efficient approximation schemes for Euclidean Min-Cost Matching, a problem that can be solved exactly in polynomial time. All our algorithms also work, with almost no modification, when distance is measured using any geometric norm (such as <inline-equation><f>ℓ</f> </inline-equation><subscrpt><italic>p</italic></subscrpt> for <italic>p</italic> ≥ 1 or other Minkowski norms). They also have simple parallel (i.e., NC) implementations.
Generic global placement and floorplanning

We present a new force directed method for global placement. Besides the well-known wire length dependent forces we use additional forces to reduce cell overlaps and to consider the placement area. Compared to existing approaches, the main advantage is that the algorithm provides increased flexibility and enables a variety of demanding applications. Our algorithm is capable of addressing the problems of global placement, floorplanning, timing minimization and interaction to logic synthesis. Among the considered objective functions are area, timing, congestion and heat distribution. The iterative nature of the algorithm assures that timing requirements are precisely met. While showing similar CPU time requirements it outperforms Gordian by an average of 6 percent and TimberWolf by an average of 8 percent in wire length and yields significantly better timing results.
Detecting Lactococcus lactis Prophages by Mitomycin C-Mediated Induction Coupled to Flow Cytometry Analysis

Most analyzed Lactococcus lactis strains are predicted to harbor one or more prophage genomes within their chromosome; however, the true extent of the inducibility and functionality of such prophages cannot easily be deduced from sequence analysis alone. Chemical treatment of lysogenic strains with Mitomycin C is known to cause induction of temperate phages, though it is not always easy to clearly identify a lysogenic strain or to measure the number of released phage particles. Here, we report the application of flow cytometry as a reliable tool for the detection and enumeration of released lactococcal prophages using the green dye SYTO-9.
Stereotaxic amygdalotomy and basofrontal tractotomy in psychotics with aggressive behaviour

Twelve patients with personality disorders or chronic schizophrenia in whom aggressive-destructive behaviour was a prominent feature were treated by bilateral stereotaxic electrocoagulation of the amygdala. In two of the patients a cingulectomy and in five of the patients a frontal lobotomy had been performed several years previously without effect. In 11 of the patients the amygdalotomy resulted in disappearance of, or marked reduction in, their aggressive episodes. In two patients with frequent self-mutilations and reactive psychotic episodes these symptoms disappeared after an additional basofrontal tractotomy by Knight's method.
AN INNOVATIVE TECHNIQUE FOR THIN FILM INTERFACE TOUGHNESS RESEARCH

A material configuration of central importance in microelectronics, optoelectronics, and thermal barrier coating technology is a thin or thick film of one material deposited onto a substrate of a different material. Fabrication of such a structure inevitably gives rise to stress in the film due to lattice mismatch, differing coefficients of thermal expansion, chemical reactions, or other physical effects. Therefore, in general, the weakest link in this composite system often resides at the interface between the film and substrate. In order to make multi-layered electronic devices and structural composites with long-term reliability, the fracture behavior of the material interfaces must be known. Unfortunately, none of the state-of-the-art testing methods for evaluating interface fracture toughness is fully conformed to fracture mechanics theory, as is evident from the severe scatter in the existing data and the procedure dependence in film/coating evaluation methods. This project is intended to address the problems associated with this deficiency and offers an innovative testing procedure for the determination of interface fracture toughness applicable to coating materials in general. This new approach and the associated bi-material fracture mechanics development proposed for evaluating interface fracture toughness are described herein. The effort includes development of specimen configuration and related instrumentationmore » set-up, testing procedures, postmortem examination, and analytical evaluation. A spiral notch torsion fracture toughness test system was utilized. The objective of the testing procedure described is to enable the development of new coating materials by providing a reliable method for use in assessing their performance. This innovative technology for measuring interface toughness was demonstrated for oxide scales formed on high-temperature alloys of MA956. The estimated energy release rate (in terms of J-integral) at the interface of the alumina scale and MA956 substrate is 3.7 N-m/m{sup 2}, and the estimated equivalent Mode I fracture toughness is 1.1 MPa {radical}m. This innovative technique is expected to greatly assist the development of coating materials with improved protective capabilities and provide a reliable method for use in assessing material performance. « less
Effect of Combining Multiple CNV Defining Algorithms on the Reliability of CNV Calls from SNP Genotyping Data

In addition to single-nucleotide polymorphisms (SNP), copy number variation (CNV) is a major component of human genetic diversity. Among many whole-genome analysis platforms, SNP arrays have been commonly used for genomewide CNV discovery. Recently, a number of CNV defining algorithms from SNP genotyping data have been developed; however, due to the fundamental limitation of SNP genotyping data for the measurement of signal intensity, there are still concerns regarding the possibility of false discovery or low sensitivity for detecting CNVs. In this study, we aimed to verify the effect of combining multiple CNV calling algorithms and set up the most reliable pipeline for CNV calling with Affymetrix Genomewide SNP 5.0 data. For this purpose, we selected the 3 most commonly used algorithms for CNV segmentation from SNP genotyping data, PennCNV, QuantiSNP; and BirdSuite. After defining the CNV loci using the 3 different algorithms, we assessed how many of them overlapped with each other, and we also validated the CNVs by genomic quantitative PCR. Through this analysis, we proposed that for reliable CNV-based genomewide association study using SNP array data, CNV calls must be performed with at least 3 different algorithms and that the CNVs consistently called from more than 2 algorithms must be used for association analysis, because they are more reliable than the CNVs called from a single algorithm. Our result will be helpful to set up the CNV analysis protocols for Affymetrix Genomewide SNP 5.0 genotyping data.
Seamless network-wide IGP migrations

Network-wide migrations of a running network, such as the replacement of a routing protocol or the modification of its configuration, can improve the performance, scalability, manageability, and security of the entire network. However, such migrations are an important source of concerns for network operators as the reconfiguration campaign can lead to long and service-affecting outages. In this paper, we propose a methodology which addresses the problem of seamlessly modifying the configuration of commonly used link-state Interior Gateway Protocols (IGP). We illustrate the benefits of our methodology by considering several migration scenarios, including the addition or the removal of routing hierarchy in an existing IGP and the replacement of one IGP with another. We prove that a strict operational ordering can guarantee that the migration will not create IP transit service outages. Although finding a safe ordering is NP complete, we describe techniques which efficiently find such an ordering and evaluate them using both real-world and inferred ISP topologies. Finally, we describe the implementation of a provisioning system which automatically performs the migration by pushing the configurations on the routers in the appropriate order, while monitoring the entire migration process.
Teaching parallel programming to undergrads with hands-on experience

This paper describes the didactic concept, the content and the lessons learned of a lecture on parallel programming for undergraduate students held during summer term 2013. The course’s focus was on providing hands-on experience, hence students were programming on real life codes using an actual HPC cluster. The lecture’s aim was to provide an in-depth understanding of each parallel programming paradigm used in industry, starting with OpenMP, MPI and OpenCL as an example of a general approach for accelerators. Additionally, MapReduce based on Apache’s Hadoop was introduced as a new and different way of parallelization. The course’s strong points are highlighted, such as useful practicals on real life codes. Keywords-OpenMP, MPI, OpenCL, MapReduce
Responses to mild water deficit and rewatering differ among secondary metabolites but are similar among provenances within Eucalyptus species.

Water deficit associated with drought can severely affect plants and influence ecological interactions involving plant secondary metabolites. We tested the effect of mild water deficit and rewatering on physiological, morphological and chemical traits of juvenile Eucalyptus globulus Labill. and Eucalyptus viminalis Labill. We also tested if responses of juvenile eucalypts to water deficit and rewatering varied within species using provenances across a rainfall gradient. Both species and all provenances were similarly affected by mild water deficit and rewatering, as only foliar abscisic acid levels differed among provenances during water deficit. Across species and provenances, water deficit decreased leaf water potential, above-ground biomass and formylated phloroglucinol compound concentrations, and increased condensed tannin concentrations. Rewatering reduced leaf carbon : nitrogen, and total phenolic and chlorogenic acid concentrations. Water deficit and rewatering had no effect on total oil or individual terpene concentrations. Levels of trait plasticity due to water deficit and rewatering were less than levels of constitutive trait variation among provenances. The overall uniformity of responses to the treatments regardless of native provenance indicates limited diversification of plastic responses when compared with the larger quantitative variation of constitutive traits within these species. These responses to mild water deficit may differ from responses to more extreme water deficit or to responses of juvenile/mature eucalypts growing at each locality.
Convex Optimization‐Based Rotation Parameter Estimation Using Micro‐Doppler

This paper analyze the relation between rotation of wing or rotor and micro Doppler frequency obtained from Doppler spectrogram and propose the rotation parameter estimation algorithm. At least three or more monostatic radars are used and maximum Doppler frequency and angular velocity are extracted from Doppler spectrogram for each radar. Additionally, to estimate angular velocity vector, convex optimization algorithm is applied. The performance of the proposed algorithm is demonstrated through the simulations.
The fabrication of a single glass microchannel to study the hydrophobicity effect on two-phase flow boiling of water

Hydrophobicity is an important parameter in a microscale two-phase thermal hydraulic system because the interfacial force has an influential role in this system. Previous research has been limited to the two-phase flow regime, with most results indicating that the surface hydrophobicity is an influential parameter. However, the hydrophobicity effect on flow boiling has not been studied, especially at the microscale. This is due to the coupled difficulties of the fabrication of the microchannel and the modification of its surface. This study develops the methods for the fabrication of a single glass microchannel and the formation of a hydrophobic surface. The flow boiling experiment in the microchannel is conducted using deionized water. The visualization of two-phase flow patterns was carried out using a high-speed camera and a long-distance microscope. Very clear images were obtained due to the high transparency of the microchannel material. Local dry patches were observed in the liquid film of elongated bubbles and a new flow pattern was found with the hydrophobic surface.
Generic Object Recognition Using Graph Embedding into A Vector Space

This paper describes a method for generic object recognition using graph structural expression. In recent years, generic object recognition by computer is finding extensive use in a variety of fields, including robotic vision and image retrieval. Conventional methods use a bag-of-features (BoF) approach, which expresses the image as an appearance fre-quency histogram of visual words by quantizing SIFT (Scale-Invariant Feature Transform) features. However, there is a problem associated with this approach, namely that the location information and the relationship between keypoints (both of which are important as structural information) are lost. To deal with this problem, in the proposed method, the graph is constructed by connecting SIFT keypoints with lines. As a result, the keypoints maintain their relationship, and then structural representation with location information is achieved. Since graph representation is not suitable for statistical work, the graph is embedded into a vector space according to the graph edit distance. The experiment results on two image datasets of multi-class showed that the proposed method improved the recognition rate.
EFFECT OF VARIOUS PRETREATMENTS OF OIL PALM EMPTY FRUIT BUNCH FIBRES FOR SUBSEQUENT USE AS SUBSTRATE ON THE PERFORMANCE OF CELLULASE PRODUCTION BY ASPERGILLUS TERREUS

The possibility of using treated oil palm empty fruit bunch (OPEFB) fibres as substrate for cellulase production by Aspergillus terreus was studied using shaking flask fermentation. The effect of different chemical pretreatments, i.e. formic acid, acetic acid, propylamine, phosphoric acid, and n-butylamine, on the suitability of OPEFB fibres as fermentation substrate was investigated. The findings revealed that pretreatment with these chemicals significantly (P<0.05) increased the cellulose and reduced the lignin contents prior to enzymatic hydrolysis. However, fermentation using OPEFB fibres pretreated with phosphoric acid gave the highest cellulase production, which was related to high cellulose content. Further improvement in cellulase production was obtained when the chemically pretreated OPEFB fibres were subsequently treated hydrothermally (autoclaved at 160oC for 10 min) and then biologically (using effective microorganisms). The final activity of the three main components of cellulase (FPase, CMCase, and β-glucosidase) obtained in fermentation by A. terreus using optimally treated OPEFB fibres was (0.77 U mL−1, 8.5 U mL-1, and 6.1 U mL-1), respectively. The production of all these three major components of cellulase using pretreated OPEFB fibres (i.e. chemical, hydrothermal, and biological) were about three times higher than those obtained from fermentation using untreated OPEFB fibres.
Spectral Features for Synthetic Speech Detection

Recent advancements in voice conversion (VC) and speech synthesis research make speech-based biometric systems highly prone to spoofing attacks. This can provoke an increase in false acceptance rate in such systems and requires countermeasure to mitigate such spoofing attacks. In this paper, we first study the characteristics of synthetic speech vis-à-vis natural speech and then propose a set of novel short-term spectral features that can efficiently capture the discriminative information between them. The proposed features are computed using inverted frequency warping scale and overlapped block transformation of filter bank log energies. Our study presents a detailed analysis of antispoofing performance with respect to the variations in the warping scale for inverted frequency and block size for the block transform. For performance analysis, Gaussian mixture model (GMM) based synthetic speech detector is used as a classifier on a stand-alone basis and also, integrated with automatic speaker verification (ASV) systems. For ASV systems, standard mel-frequency cepstral coefficients are used as feature while GMM with universal background model and i-vector are used as classifiers. The experiments are conducted on ten different kinds of synthetic data from ASVspoof 2015 corpus. The results show that the countermeasures based on the proposed features outperform other spectral features for both known and unknown attacks. An average equal error rate (EER) of 0.00% has been achieved for nine attacks that use VC or SS speech and the best performance of 7.12% EER is arrived at the remaining natural speech concatenation-based spoofing attack.
On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs

Branching problems are considered as a nonuniform model of computation in complexity theory as well as a data structure for boolean functions in several applications. In many applications (e.g., verification), exact representations are required. For learning boolean functions f on the basis of classified examples, it is sufficient to produce the representation of a function g approximating f. This motivates the investigation of the size of the smallest branching program approximating f. Although several non-approximability results are contained in the papers on randomized branching programs, these results often do not work for the uniform distribution (which is the most important one in applications). Here, the following non-approximability results are presented. (1) It is proven that a simple function from the branching program literature requires exponential size to be approximated with respect to the uniform distribution by OBDDs, which are the most important type of branching programs in applications. (2) The first truly exponential lower bound on the size of approximating syntactic read-k-times branching programs with respect to the uniform distribution and error probability 1/2-2/sup -/spl Omega/(n)/, n the input size, is shown. In order to improve upon the so far best results for error probabilities smaller than 1/3, a strong combinatorial lemma from a recent paper of Ajtai on linear-length branching programs is exploited.