Miracle-dz/UniFAR-FTUs huggingface dataset:
Gait phase prediction for lower limb exoskeleton robots

Robust gait phase prediction is crucial to exoskeleton robots, as it detects the intention of users and improves the lag of motion signals. Therefore, this paper predicts gait phases from two perspectives, including one perspective of spatial features and the other of spatio-temporal features. We employ two machine learning models from the two perspectives to predict. One is support vector machine (SVM) optimized by particle swarm optimization (PSO) algorithm, and it only focuses on joint information. Another is nonlinear autoregressive models with external inputs (NARX), and it utilizes previous data to predict present status. As for input, four goniometers built into the exoskeleton robot are used to collect hip and knee joint angles during the walking process. To obtain gait phases, a multi-pressure sensor network composed of three force sensitive resistors (FSRs) is set up and four gait phases, including heel-contact, foot-flat, heel-off and toe-high, are determined according to plantar pressure distribution. Experimental results show that both SVM and NARX are capable of predicting gait phases. Specifically, NARX outperforms SVM in terms of accuracy, since it uses FSRs data to correct the wrong predictions. Consequently, it is better to predict gait phases based on space and time dimensions simultaneously.
Termination and Confluence of Rule Execution Termination and Connuence of Rule Execution

Rules provide the functionality for constraint enforcement and view maintenance. A provably correct implementation of both issues based on rules, requires connuent and terminating behaviour of the rule set. However, little work has been done so far on the static detection of these properties. In this paper, a design theory for rule sets in an OODBMS is developed. This paper introduces two predicates, viz., Terminate(n) and Independent, which imply respectively termination and connuency. Both predicates are characterised under two kinds of rule execution semantics: set and instance based. The decidability of the predicates is proven and it is shown that set and instance based semantics coincide whenever the rule set is independent and terminates. Moreover, suucient conditions of low algorithmic complexity for both Terminate(n) and Independent under both kinds of semantics are given.
highlighted topics Signal Transduction in Smooth Muscle Invited Review: Regulation of myosin phosphorylation in smooth muscle

2001. — Phosphorylation of the regulatory light chains of myosin II (rMLC) by the Ca 2 1 /calmodulin-dependent myosin light-chain kinase (MLCK) and dephosphorylation by a type 1 phosphatase (MLCP), which is targeted to myosin by a regulatory subunit (MYPT1), are the predominant mechanisms of regulation of smooth muscle tone. The activities of both enzymes are modulated by several protein kinases. MLCK is inhibited by the Ca 2 1 /calmodulin-dependent protein kinase II, whereas the activity of MLCP is increased by cGMP and perhaps also cAMP-dependent protein kinases. In either case, this results in a decrease in the Ca 2 1 sensitivity of rMLC phosphorylation and force production. The activity of MLCP is inhibited by Rho-associated kinase, one of the effectors of the monomeric GTPase Rho, and protein kinase C, leading to an increase in Ca 2 1 sensitivity. Hence, smooth muscle tone appears to be regulated by a network of activating and inactivating intracellular signaling cascades.
Critical issues in polarization encoded quantum key distribution systems

An analysis of the most critical issues in quantum key distribution systems with polarization encoded photons is presented. Effects like the fiber birefringence, fiber losses and some technical aspects can difficult the state of polarization control in such kind of systems, leading to an undesired quantum bit-error-rate increment. It is shown that a system with a long fiber, presenting a typical PMD value, only assures a strong correlation between two Stokes vectors for narrow wavelength separations. In terms of time correlation, it is shown that the typical drift times are much longer than delays between reference and data signals. The problematic of the reference pulse leakage to the data detector is also analyzed; a good agreement between experimental and theoretical data is observed.
A Propose Model for Prevention of Attack SQL Injection

SQL attacks are growing concerns for the security threats to Web applications. The attackers use the SQL to manipulate the applications and manage to penetrate into the databases underlying the applications. This leads to unauthorized access to the potentially sensitive information. In this paper, we intend to discuss various methods through which SQL injection can be done. Also, we purport the methods to prevent the attack of SQL injection.
Power Spectrum Optimization of Multi-Carrier MIMO Ad Hoc Networks : A Dual Stochastic Approximation Approach

Multi-carrier MIMO (MC-MIMO) has emerged as a promising technology to provide significant capacity gain for broadband wireless ad hoc networks. However, due to the non-convex and large-scale problem structure, little work has been done on power spectrum optimization to harvest MC-MIMO’s capacity gain for broadband ad hoc networks. Our principal goal in this work is to fill this challenging gap. First, we make advance in general non-convex optimization theory by showing a surprising result that the duality gap of a certain class of non-convex optimization problems is zero if they satisfy the “concave perturbation” condition. Further, we show that the power spectrum optimization problem of MC-MIMO ad hoc networks satisfies the concave perturbation condition. This important result allows us to tackle the problem with a much lower complexity in the dual domain, where we design efficient centralized and distributed algorithms based on complete knowledge of channel distribution information (CDI). To further eliminate the requirement of complete CDI knowledge, we devise an online adaptive algorithm by stochastic approximation. We show that, when the feedback of channel state information (CSI) is error free, our proposed subgradient stochastic approximation (SSA) algorithm converges with probability one to the same optimal solution obtained by the off-line algorithm. In the case where there is error in CSI, we show that SSA can still converge with probability one to the same optimal solution if the resultant subgradients are asymptotically unbiased, or is recurrent to some neighborhood of the optimal solution when the resultant subgradients are biased.
Program Analysis and Testing of Database Applications

During the last decades database applications are undoubtedly among the most widely used types of software applications. The presence of database statements in their source code is one of their typical characteristics that however introduces many difficulties in their code-level analysis and testing. This paper describes an approach that resolves such issues and facilitates the employment of traditional software testing techniques. The approach involves two alternative methods and is founded on the execution plan that the underlying database management system derives for each SQL statement. To support this approach a prototype tool called DATeM has been developed and the experimental results from its usage are reported and analyzed
Language Identification , Transliteration and Resolving Common Words Ambiguity in a Pair of Languages : Shared Task on Transliterated Search

This paper describes the work that we have done for FIRE 2014 shared task on transliterated search. We targeted the problem of word level language identification for Indian languages mixed with English language. Further, we have also done transliteration of Indian language words in Roman script into their corresponding native scripts of Indian languages. In addition to this, our technique resolves the problem of ambiguity with common words present in a pair of languages.
Signal detection mechanism and precision analysis of mine dual-frequency induced polarization instrument receiver

The dual-frequency Induced Polarization method (IP method for short) has been widely used for the detection of ground and tunnel. Affected by strong noise environment in coal roadway, it is very difficult to accurately detect underground weak IP signals. For the promotion in the field of advanced detection in underground coal mine, it is of great significance to research weak excitation signals detection mechanism of the receiver used in the coal mine. On the basis of principle prototype developed, the paper derived theoretically the data processing method of weak IP signals and the detection mechanism of IP parameters and designed a RC (Resistance-Capacitance) network test platform and mathematical calculation model. Through comparing the fitting curve between experiment and theoretical calculation of apparent frequency and apparent relative phase difference about the model, the results show that the measuring precision of phase is higher than that of amplitude about the receiver of principle prototype. The principle prototype of mine dual-frequency IP instrument receiver needs to be further improved and perfected in the aspect of amplitude measurement.
Dynamics and distribution of natural and human-caused coastal hypoxia

Dynamics and distribution of natural and human-caused coastal hypoxia N. N. Rabalais, R. J. Dı́az, L. A. Levin, R. E. Turner, D. Gilbert, and J. Zhang Louisiana Universities Marine Consortium, Chauvin, LA 70344, USA Virginia Institute of Marine Science, College of William and Mary, Gloucester Point, VA 23062, USA Integrative Oceanography Division, Scripps Institution of Oceanography, 9500 Gilman Drive, La Jolla, CA 92093-0218, USA Department of Oceanography and Coastal Sciences, Louisiana State University, Baton Rouge, LA 70803, USA Institut Maurice-Lamontagne, Pêches et Océans Canada, 850 route de la mer, Mont-Joli, Québec, G5H 3Z4, Canada State Key Laboratory of Estuarine and Coastal Research, East China Normal University, 3663 Zhongshan Road North, Shanghai 200062, China
The evaluative nature of the folk concepts of weakness and strength of will

This article examines the evaluative nature of the folk concepts of weakness and strength of will and hypothesizes that their evaluative nature is strongly connected to the folk concepts of blame and credit. We probed how people apply the concepts of weakness and strength of will to prototypical and non-prototypical scenarios. While regarding prototypical scenarios the great majority applied these concepts according to the predictions following from traditional philosophical analyses. When presented with non-prototypical scenarios, people were divided. Some, against traditional analyses, did not apply these concepts, which we explain in terms of a clash of evaluations involving different sorts of blame and credit. Others applied them according to traditional analyses, which we explain in terms of a disposition to be reflective and clearly set apart the different sorts of blame and credit involved. Still others applied them in an inverse way, seemingly bypassing the traditional components resolution and best judgment, which we explain in terms of a reinterpretation of the scenarios driven by an assumption that everyone knows deep inside that the best thing to do is to act morally. This division notwithstanding, we claim that our results are largely supportive of traditional analyses (qua analyses of folk concepts).
Performance Improvement in Large Graph Algorithms on GPU using CUDA: an Overview

The basic operations on the graphs with millions of vertices are common in various applications. To have faster execution of such operations is very essential to reduce overall computation time. Today’s Graphics processing units (GPUs) have high computation power and low price. This device can be treated as an array of Single Instruction Multiple Data (SIMD) processors using CUDA software interface by Nvidia. Massively Multithreaded architecture of a CUDA device makes various threads to run in parallel and hence making optimum use of available computation power of GPU. In case of graph algorithms, vertices of the graphs are processed in parallel by mapping them to various threads on device. By making thousands of threads to run in parallel, computation time required for these algorithms is drastically decreased as compared to their CPU implementation. We studied different parallel algorithms for Breadth first search, all pairs shortest path that are carried out on GPU using CUDA and make their comparative study with respect to execution time, data structure used, input data etc. In the paper, we presented overview of various parallel methods carried out on GPU using its multithreaded architecture for BFS, APSP by various authors.
Comparison of adefovir dipivoxil and pegylated interferon alpha-2a treatment in chronic hepatitis B patients

OBJECTIVE: In this study, we aimed to evaluate the efficacy of pegylated interferon alpha 2a and adefovir dipivoxil treatment in chronic hepatitis B patients. METHODS: This study was performed on patients treated for chronic hepatitis B in the Infectious Disease Clinic of Eskişehir Osmangazi University between 01.09. 2005 and 31.03. 2008. A total of 30 patients aged between 18 and 65 years constituted the study group. One of patient groups received (10 HBeAg negative, 4 HBeAg positive) PEG-IFN alpha 2a at a dose of 180 μg/once a week, whereas the other group (11 HBeAg negative, 5 HBeAg positive) received daily oral doses of 10 mg ADV. Treatment responses were evaluated at week 48. RESULTS: Reductions in serum HBV DNA levels at the end of 48 weeks were 4.8 log10 copy/ml and 4.2 log10 copy/ml in HBeAg negative patients who received ADV or PEG-IFN alpha 2a, respectively. Biochemical response rates were 60% and 91% in PEG-IFN alpha 2a and ADV groups, respectively. Among HBeAg positive patients, reductions in serum HBV DNA levels were 3. 2 log10 copy/ml and 4 log10 copy/ml in ADV and PEG-IFN alpha 2a groups, at week 48, respectively. Biochemical response rates were 50% and 40% in PEG-IFN alpha 2a and ADV groups, respectively. No significant difference was determined in biochemical and virological responses in HBeAg positive and negative patients between PEG-IFN alpha 2a and ADV groups, at week 48. When both treatment groups were evaluated for side effects, it was observed that side effects were significantly common in PEG-IFN alpha 2a group. CONCLUSION: When we compared PEG-IFN alpha 2a and ADV treatment in both HBeAg positive and negative patients, biochemical and virological response rates at 48 weeks were similar.
On degrees in random triangulations of point sets

We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive various bounds and inequalities for these expected values. One of our main results is: For any set S of N points in general position, and for any fixed i, the expected number of vertices of degree i in a random triangulation is at least γiN, for some fixed positive constant γi (assuming that N > i and that at least some fixed fraction of the points are interior). We also present a new application for these expected values, using upper bounds on the expected number of interior vertices of degree 3 to get a new lower bound, Ω(2.4317N), for the minimal number of triangulations any N-element planar point set in general position must have. This improves the previously best known lower bound of Ω(2.33N).
Graphene : Synthesis and Applications

Tailoring the Physical Properties of Graphene C. G. Rocha, M. H. Rummeli, I. Ibrahim, H. Sevincli, F. Boerrnert, J. Kunstmann, A. Bachmatiuk, M. Poetschke, W. Li, S. A. M. Makharza, S. Roche, B. Buchner, and G. Cuniberti Graphene Synthesis Santanu Das and Wonbong Choi Quantum Transport in Graphene-Based Materials and Devices: From Pseudospin Effects to a New Switching Principle Stephan Roche, Frank Ortmann, Alessandro Cresti, Blanca Biel, and David Jimenez Electronic and Photonic Applications for Ultrahigh-Frequency Graphene-Based Devices Taiichi Otsuji, Tetsuya Suemitsu, Akira Satou, Maki Suemitsu, Eiichi Sano, Maxim Ryzhii, and Victor Ryzhii Graphene Thin Films for Unusual Format Electronics Chao Yan, Houk Jang, Youngbin Lee, and Jong-Hyun Ahn Nanosized Graphene: Chemical Synthesis and Applications in Materials Science Chongjun Jiao and Jishan Wu Graphene-Reinforced Ceramic and Metal Matrix Composites Debrupa Lahiri and Arvind Agarwal Graphene-Based Biosensors and Gas Sensors Subbiah Alwarappan, Shreekumar Pillai, Shree R, Singh, and Ashok Kumar Field Emission and Graphene: An Overview of Current Status Indranil Lahiri and Wonbong Choi Graphene and Graphene-Based Materials in Solar Cell Applications Indranil Lahiri and Wonbong Choi Graphene: Thermal and Thermoelectric Properties Suchismita Ghosh and Alexander A. Balandin Index
An efficient algorithm for mining time interval-based patterns in large database

Most studies on sequential pattern mining are mainly focused on time point-based event data. Few research efforts have elaborated on mining patterns from time interval-based event data. However, in many real applications, event usually persists for an interval of time. Since the relationships among event time intervals are intrinsically complex, mining time interval-based patterns in large database is really a challenging problem. In this paper, a novel approach, named as incision strategy and a new representation, called coincidence representation are proposed to simplify the processing of complex relations among event intervals. Then, an efficient algorithm, CTMiner (Coincidence Temporal Miner) is developed to discover frequent time-interval based patterns. The algorithm also employs two pruning techniques to reduce the search space effectively. Furthermore, experimental results show that CTMiner is not only efficient and scalable but also outperforms state-of-the-art algorithms.
Contributions to structural modeling and estimation

The first chapter of my thesis develops and estimates a dynamic structural partial equilibrium model of schooling and work decisions. The estimated model explicitly accounts for the simultaneous choice of enrolling in school and working. It also allows for endogenous leisure choices, intertemporal nonseparabilities in preferences, aggregate skill specific productivity shocks, aggregate consumption price effects, and individual heterogeneity. Times spent on schooling, working, and leisure are treated as continuous choice variables. The estimated model is solved and two counterfactual simulation exercises are performed. The first is the case where a subsidy is given to individuals who enroll in school and do not participate in the labor market. The second is the case where the demands of the school curriculum are increased so that a young man enrolled in school necessarily spends more time studying. The conclusion is that the latter policy is more effective in enhancing educational achievements and future wages. The second chapter of my thesis develops a semiparametric estimator for a dynamic nonlinear single index panel data model. Flexibility of the model is achieved by assuming that the index function is unknown. Flexibility in individual heterogeneity is achieved by assuming that the individual effect is an unknown function of some observable random variable. The paper proposes an algorithm that estimates each of the finite and infinite dimensional parameters. In particular, the full data generating process is estimated. This is important if the predicted outcomes are used as plug-in estimators, as in the multistage estimation of dynamic structural models. The final chapter of my thesis develops a powerful new algorithm to solve single object first price auctions where bidders draw independent private values from heterogeneous distributions. The algorithm allows for the scenario in which groups of symmetric and asymmetric bidders may collude, and for the auctioneer to set a reserve price. The paper also provides operational univariate quadratures to evaluate the probabilities of winning as well as the expected revenues for the bidders and the auctioneer. The expected revenue function is used to the compute optimal reserve under asymmetric environments.
Analyzing the results of a usability study on CrosScan within the framework of the Android Design Principles and Material Design

CrosScan: The Crossword Scanning App is a new Android application that allows users to scan crossword puzzles with the camera and complete scanned puzzles digitally. There are two aspects of the app: (1) scanning puzzles from newspapers, magazines, and other physical media, and (2) solving the scanned puzzles interactively in the application. In this paper, we discuss the current CrosScan prototype and the corresponding usability study. Findings of this usability study reveal that users are happy with the design and would use the final application, but they also believe there is room for improvement in app navigation and aesthetics. We then analyze these results within the framework of Android Design Principles and Material Design, using our findings to propose an iterative redesign of the application. ACM Classification
Forearc-basin sedimentary response to rapid Late Cretaceous batholith emplacement in the Peninsular Ranges of southern and Baja California

The eastern Peninsular Ranges batholith is dominated by voluminous La Posta–type tonalite-granodiorite intrusions that compose half of the magmatic arc at present erosion level. Zircon U-Pb and hornblende 40 Ar/ 39 Ar results from these intrusions indicate that they were emplaced in a remarkably narrow interval (99–92 Ma) that closely followed cessation of west-directed compression of the arc system. Emplacement of the La Posta suite coincided with a major pulse of coarse-grained sediment into the adjacent forearc basin in early Cenomanian to middle Turonian time. Paleontologic control, and plutonic age and detrital zircon U-Pb data demonstrate the virtual absence of a time lag between magma emplacement and sedimentary response. The tight linkage between magmatism, arc exhumation, and sediment delivery to the forearc indicates that development of major erosional topography in the arc was driven by thermal and mechanical effects associated with large-volume batholith emplacement.
Mixed projections and syntactic categories

I explore the bases of a ‘distributionalist’ approach to syntactic categories, that is, an approach that makes distinctions on the basis of purely syntactic (as opposed to, say, semantic) criteria. I focus on the phenomenon of ‘mixed projections’, where a syntactic phrase appears to display properties of more than one syntactic category, as analysed within the framework of Lexical-Functional Grammar. I argue that of the three syntactic criteria called upon in the definition of syntactic categories within this approach, only one, the internal syntactic structure of a phrase, is a sufficient criterion for syntactic categorization. This leads to a more restricted definition of category mixing and implies a more restricted approach to categorization in general.
Influence of Discrete Granularity on Using Association Rules to Complete Missing Values

this paper investigates the impacts of different discrete granularities of continuous attribute on the algorithms which employ association rules to complete missing value. The Chi2 algorithm is used to discrete the continuous attributes. By using three different discrete granularities, the impacts of the algorithm on completing missing value are explored. Experimental results show that different discrete granularity has negligible impacts on using association rules to complete missing value. However,the completing accuracy has an inclination to decrease with the decrease of the discrete granularity.