Miracle-dz/UniFAR-FTUs huggingface dataset:
Confiabilidade da escala de faces da percepção subjetiva da dor muscular do esforço físico do voleibol: um estudo no voleibol master

O objetivo da pesquisa foi de verificar a confiabilidade da escala de dor muscular do voleibol em uma equipe masculina do voleibol master. A pesquisa foi composta por uma equipe masculina do voleibol master (n = 10) que competiu o Campeonato Carioca Master de 2016. A escala de dor muscular do voleibol foi elaborada por Marques Junior, Arruda e Nievola Neto (2016). A confiabilidade da escala de dor muscular do voleibol pelo r intraclasse nao teve nenhum resultado com diferenca significativa (p>0,05). O teste Kappa identificou somente uma concordância moderada ( k = 0,45, p = 0,002) e o metodo Bland e Altman a concordância foi baixa. Em conclusao, a escala de dor muscular do voleibol merece novos estudos para verificar a confiabilidade desse instrumento para o voleibol master. ABSTRACT Reliability of the face scale of the subjective perception of the muscle soreness of the physical effort of the volleyball: a study in the master volleyball The objective of the research was to check the reliability of the muscle soreness scale of the volleyball in a men`s team master volleyball. The research was composed by a men`s team master volleyball that competed the Carioca Master Championship of 2016. The muscle soreness scale was elaborated by Marques Junior, Arruda e Nievola Neto (2016). The reliability of the muscle soreness scale of the volleyball by intraclass r had no result with significant difference (p>0,05). The Kappa test identified only a moderate agreement ( k = 0,42 and 0,002) and the Bland and Altman method the agreement was lower. In conclusion, the muscle soreness scale of the volleyball deserves others studies to check the reliability of this instrument for the master volleyball.
Clutchable series-elastic actuator: Implications for prosthetic knee design

Currently, the mobility of above-knee amputees is limited by the lack of available prostheses that can efficiently replicate biologically accurate movements. In this study, a powered knee prosthesis was designed utilizing a novel mechanism, known as a clutchable series-elastic actuator (CSEA). The CSEA includes a low-power clutch in parallel with an electric motor within a traditional series-elastic actuator. The stiffness of the series elasticity was tuned to match the elastically conservative region of the knee’s torque-angle relationship during the stance phase of locomotion. During this region, the clutch was used to efficiently store energy in the series elasticity. The fully autonomous knee prosthesis design utilized a brushless electric motor, ballscrew transmission and cable drive, as well as commercial electrical components. The knee was lighter than the eighth percentile and shorter than the first percentile male shank segment. The CSEA Knee was tested in a unilateral above-knee amputee walking at 1.3 m/s. During walking, the CSEA Knee provided biomechanically accurate torque-angle behavior, agreeing within 17% of the net work and 27% of the stance flexion angle produced by the biological knee. In addition, the process of locomotion reduced the net electrical energy consumption of the CSEA Knee. The knee’s motor generated 1.8 J/stride, and the net energy consumption was 3.6 J/stride, an order of magnitude less energy than previously published powered knee prostheses.
Differentiating the Lévy walk from a composite correlated random walk

Understanding how to find targets with very limited information is a topic of interest in many disciplines. In ecology, such research has often focused on the development of two movement models: (i) the Lévy walk and (ii) the composite correlated random walk and its associated area‐restricted search behaviour. Although the processes underlying these models differ, they can produce similar movement patterns. Due to this similarity and because of their disparate formulation, current methods cannot reliably differentiate between these two models. Here, we present a method that differentiates between the two models. It consists of likelihood functions, including one for a hidden Markov model, and associated statistical measures that assess the relative support for and absolute fit of each model. Using a simulation study, we show that our method can differentiate between the two search models over a range of parameter values. Using the movement data of two polar bears (Ursus maritimus), we show that the method can be applied to complex, real‐world movement paths. By providing the means to differentiate between the two most prominent search models in the literature, and a framework that could be extended to include other models, we facilitate further research into the strategies animals use to find resources.
Leakage current reduction in CMOS VLSI circuits by input vector control

The first part of this paper describes two runtime mechanisms for reducing the leakage current of a CMOS circuit. In both cases, it is assumed that the system or environment produces a "sleep" signal that can be used to indicate that the circuit is in a standby mode. In the first method, the "sleep" signal is used to shift in a new set of external inputs and pre-selected internal signals into the circuit with the goal of setting the logic values of all of the internal signals so as to minimize the total leakage current in the circuit. This minimization is possible because the leakage current of a CMOS gate is strongly dependent on the input combination applied to its inputs. In the second method, nMOS and pMOS transistors are added to some of the gates in the circuit to increase the controllability of the internal signals of the circuit and decrease the leakage current of the gates using the "stack effect". This is, however, done carefully so that the minimum leakage is achieved subject to a delay constraint for all input-output paths in the circuit. In both cases, Boolean satisfiability is used to formulate the problems, which are subsequently solved by employing a highly efficient SAT solver. Experimental results on the combinational circuits in the MCNC91 benchmark suite demonstrate that it is possible to reduce the leakage current in combinational circuits by an average of 25% with only a 5% delay penalty. The second part of this paper presents a design technique for applying the minimum leakage input to a sequential circuit. The proposed method uses the built-in scan-chains in a VLSI circuit to drive it with the minimum leakage vector when it enters the sleep mode. The use of these scan registers eliminates the area and delay overhead of the additional circuitry that would otherwise be needed to apply the minimum leakage vector to the circuit. Experimental results on the sequential circuits in the MCNC91 benchmark suit show that, by using the proposed method, it is possible to reduce the leakage by an average of 25% with practically no delay penalty.
Combinatorial Optimization in Forest Ecosystem Management Modeling

Modeling forest management activities has been tackled by scientists over the last two decades. Both simulation and optimization techniques have been used in solving forest management planning problems. With the introduction of ecosystems management that focuses on the sustainable production and maintenance of ecological, social and economical values, neither approach provided a credible solution technique to help design the complex structure of forest management activities. Alternative to these, is a group of meta-heuristic or combinatorial optimization techniques which have just gained the attention of forest modelers. In this paper, an attempt is made to introduce the concept of combinatorial optimization, to compare it to the traditional modeling approaches, to explain some of the meta-heuristic solution techniques such as simulated annealing, taboo search and genetic algorithms, and to discuss their implications in forest ecosystem management. It was suggested that these techniques have great potential in modeling ecosystem management in a near optimal fashion.
Systematic sequencing of the 180 kilobase region of the Bacillus subtilis chromosome containing the replication origin.

We have determined a 180 kb contiguous sequence in the replication origin region of the Bacillus subtilis chromosome. Open reading frames (ORF) in this region were unambiguously identified from the determined sequence, using criteria characteristic for the B. subtilis gene structure, i.e., starting with an ATG, GTG or TTG codon preceded by sequences complementary to the 3' end of the 16S rRNA. Four rRNA gene sets, 7 individual tRNA genes and 1 scRNA gene were identified, occupying 20 kb in total. In the remaining 160 kb region, 158 ORFs were identified, suggesting that 1 ORF is coded on average by 1 kb of DNA of the B. subtilis genome. Among the 158 ORFs, the functions of 48 ORFs were assigned and those of 11 ORFs are suggested through significant similarities to known proteins present in data banks. However, the functions of more than half of the ORFs (63%) remain to be determined.
FUZZY SLIDING MODE CONTROL WITH PIECEWISE LINEAR SWITCHING MANIFOLD

Variable Structure Control (VSC) has been successfully established in control systems engineering in the past two decades. Recently, Fuzzy Sliding Mode Control (FSMC) techniques have drawn the attention of the scientific community, due to their effectiveness in reducing the typical chattering phenomenon arising in VSC. In this paper we present a novel FSMC technique for a class of second order dynamical systems based on a piecewise linear sliding manifold. The proposed approach enhances the effectiveness of VSC in the presence of a saturated control input. In addition, employing the proposed VSC with fuzzy rule based algorithms results in smooth dynamics when the trajectory is in the vicinity of the switching manifold, as opposed to the typical chattering arising under classical VSC. After illustrating the proposed strategy on a simple design example, the approach is applied to an inverted pendulum, a well‐known benchmark for automatic control techniques. The effectiveness of the technique is shown both by means of simulation tests and experiments on a lab equipment. Future research directions include the extension of the technique in the presence of uncertainties in the plant model.
A Detective Method for Multi-class EEG-based Motor Imagery Classification Based on OCSVM

The aim of BCI is to translate the activity of brain into command to control external device completing the task of communication. To achieve this goal, we need to recognize the various patterns of the brain. So improving classification accuracy is essential in BCI. In this paper, a detective method: one class support vector machine (OCSVM) is applied to three (EEG) motor imagery (MI) tasks classification the first time. The EEG signals is recorded from 9 subjects performing left, right hand and feet MI. In addition, we also use other classification methods: LDA, PNN, multi-class SVM, as a comparison. The results of the 3-class classification problem show that when using OCSVM, classification accuracy is significantly improved.
How much did shutting down McColo help ?

On 11 November 2008 McColo, a Californian server hosting company was disconnected from the Internet. This took the controllers for several major botnets offline. It has been widely reported that email spam volumes were markedly reduced for some time thereafter. This brief study examines the email arriving at a medium-sized United Kingdom ISP in October and November 2008. It confirms the drop in spam volumes, whilst noting a disproportionate impact on some of the ad hoc measures used to detect email spam.
Group nearest neighbor queries in the presence of obstacles

In this paper, we introduce obstructed group nearest neighbor (OGNN) queries, that enable a group to meet at a point of interest (e.g., a restaurant) with the minimum aggregate travel distance in an obstructed space. In recent years, researchers have focused on developing algorithms for processing GNN queries in the Euclidean space and road networks, which ignore the impact of obstacles such as buildings and lakes in computing distances. We propose the first comprehensive approach to process an OGNN query. We present an efficient algorithm to compute aggregate obstructed distances, which is an essential component for processing OGNN queries. We exploit geometric properties to develop pruning techniques that reduce the search space and incur less processing overhead. We validate the efficacy and efficiency of our solution through extensive experiments using both real and synthetic datasets.
Testing in child custody evaluations: An overview of issues and uses

ABSTRACT The use of tests in child custody evaluations is controversial. Few tests were designed specifically for use in the custody context or include norm samples of parents involved in custody disputes. Use of data derived from tests administered in the custody context can create both scientific and ethical concerns in some cases. However, surveys of child custody evaluators indicate that test usage is common and has in fact increased substantially over the past several decades. The current article reviews the literature regarding the use of tests with adults and children involved in custody disputes and cases with alleged intimate partner violence. Psychometric properties of commonly used tests are discussed, as well as the risks and limitations of test usage in custody evaluations.
Investigating the "Wisdom of Crowds" at Scale

In a variety of problem domains, it has been observed that the aggregate opinions of groups are often more accurate than those of the constituent individuals, a phenomenon that has been termed the "wisdom of the crowd. " Yet, perhaps surprisingly, there is still little consensus on how generally the phenomenon holds, how best to aggregate crowd judgements, and how social influence affects estimates. We investigate these questions by taking a meta wisdom of crowds approach. With a distributed team of over 100 student researchers across 17 institutions in the United States and India, we develop a large-scale online experiment to systematically study the wisdom of crowds effect for 1,000 different tasks in 50 subject domains. These tasks involve various types of knowledge (e.g., explicit knowledge, tacit knowledge, and prediction), question formats (e.g., multiple choice and point estimation), and inputs (e.g., text, audio, and video). To examine the effect of social influence, participants are randomly assigned to one of three different experiment conditions in which they see varying degrees of information on the responses of others. In this ongoing project, we are now preparing to recruit participants via Amazon? s Mechanical Turk.
SN 2003bg: A BROAD-LINED TYPE IIb SUPERNOVA WITH HYDROGEN

Models for the spectra and the light curve (LC), in the photospheric as well as in the late nebular phase, are used to infer the properties of the very radio-bright, broad-lined type IIb supernova (SN) 2003bg. Consistent fits to the LC and the spectral evolution are obtained with an explosion that ejected ≈4 M☉ of material with a kinetic energy of ≈5 × 1051 erg. A thin layer of hydrogen, comprising ∼0.05 M☉, is inferred to be present in the ejecta at the highest velocities (v ≳ 9000 km s−1), while a thicker helium layer, comprising ≈1.25 M☉, was ejected at velocities between 6500 and 9000 km s−1. At lower velocities, heavier elements are present, including ∼0.2 M☉ of 56Ni that shape the LC and the late-time nebular spectra. These values suggest that the progenitor star had a mass of ≈20–25 M☉, (comparable to, but maybe somewhat smaller than that of the progenitor of the X-ray flashes/SN 2008D). The rather broad-lined early spectra are the result of the presence of a small amount of material (≈0.03 M☉) at velocities >0.1c, which carries ≈10% of the explosion kinetic energy. No clear signatures of a highly aspherical explosion are detected.
A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking

We propose a simple yet efficient steganalytic algorithm for watermarks embedded by two state-of-the-art 3D watermarking algorithms by Cho et al. The main observation is that while in a clean model the means/variances of Cho et al.’s normalized histogram bins are expected to follow a Gaussian distribution, in a marked model their distribution will be bimodal. The proposed algorithm estimates the number of bins through an exhaustive search and then the presence of a watermark is decided by a tailor made normality test or a <inline-formula> <tex-math notation="LaTeX">$t$</tex-math><alternatives><inline-graphic xlink:href="yang-ieq1-2525771.gif"/> </alternatives></inline-formula>-test. We also propose a modification of Cho et al.’s watermarking algorithms with the watermark embedded by changing the histogram of the radial coordinates of the vertices. Rather than targeting a continuous statistics such as the mean or variance of the values in a bin, the proposed watermarking modifies a discrete statistic, which here is the height of the histogram bin, to achieve watermark embedding. Experimental results demonstrate that the modified algorithm offers not only better resistance against the steganalytic attack we developed, but also an improved robustness/capacity trade-off.
Purification and characterization of a 190-kD microtubule-associated protein from bovine adrenal cortex

A heat-stable microtubule-associated protein (MAP) with molecular weight of 190,000, termed 190-kD MAP, was purified from bovine adrenal cortex. This MAP showed the same level of ability to promote tubulin polymerization as did MAP2 and tau from mammalian brains. Relatively high amounts of 190-kD MAP could bind to microtubules reconstituted in the presence of taxol. At maximum 1 mol of 190-kD MAP could bind to 2.3 mol of tubulin. 190-kD MAP was phosphorylated by a cAMP-dependent protein kinase prepared from sea urchin spermatozoa and by protein kinase(s) present in the microtubule protein fraction prepared from mammalian brains. The maximal numbers of incorporated phosphate were approximately 0.2 and approximately 0.4 mol per mole of 190-kD MAP, respectively. These values were lower than that of MAP2, which could be heavily phosphorylated by the endogenous protein kinase(s) up to 5 mol per mole of MAP2 under the same assay condition. 190-kD MAP had no effects on the low-shear viscosity of actin and did not induce an increase in turbidity of the actin solution. It was also revealed that 190-kD MAP does not cosediment with actin filaments. These data clearly show that, distinct from MAP2 and tau, this MAP does not interact with actin. Electron microscopic observation of the rotary-shadowed images of 190-kD MAP showed the molecular shape to be a long, thin, flexible rod with a contour length of approximately 100 nm. Quick-freeze, deep- etch replicas of the microtubules reconstituted from 190-kD MAP and brain tubulin revealed many cross-bridges connecting microtubules with each other.
Required behavior of sequence diagrams

Many reusable software artifacts such as design patterns and design aspects make use of UML sequence diagrams to describe interaction behaviors. When a pattern or an aspect is reused in an application, it is important to ensure that the sequence diagrams for the application conform to the corresponding sequence diagrams for the pattern or aspect. Reasoning about conformance relationship between sequence diagrams has not been addressed adequately in literature. In this article, we focus on required behaviors specified by a UML sequence diagram and provide a semantic-based formalization of conformance relationships between sequence diagrams. A novel trace semantics is first given that captures precisely required behaviors. A refinement relation between sequence diagrams is then defined based on the semantics. The refinement relation allows a sequence diagram to be refined by changing its structure so long as its required behaviors are preserved. A conformance relation between sequence diagrams is finally given that includes the refinement relation as a special case. It allows one to introduce and rename lifelines, messages, and system variables when reusing sequence diagrams. Properties of the semantics, refinement, and conformance relations are studied. Two case studies are provided to illustrate the efficacy of semantic-based conformance reasoning.
Making Distributed Computation Trustworthy by Construction Lantian

Trustworthy computing systems must provide data confidentiality and data integrity, and must be available. This paper shows that these security properties can be provided by construction, by compiling high-level, security-typed source code into explicitly distributed, security-typed target code. This code transformation provably preserves the confidentiality, integrity, and availability properties of the source. A key technical contribution is the new target language, which describes distributed computation. In this language, any well-typed program satisfies noninterference properties that ensure confidentiality and integrity. Further, the language supports the distribution and replication of code and data using quorum replication, which enables simultaneous enforcement of integrity and availability. A novel timestamp scheme handles out-of-order accesses by concurrent distributed threads without creating covert channels.
3D spatial reconstruction and communication from vision field

Vision field describes the real world visual information by summarizing the seven-dimensional plenoptic function into three domains: view, light, time, from which a better understanding of previous 3D capture and reconstruction systems can be provided. In this paper, we first show how to reconstruct 3D spatial information from all the three attributes of the vision field, namely full-space vision field reconstruction. Then, based on Laplacian iterative geometry prediction, a 3D mesh coding algorithm with cascaded quantization is presented to facilitate the communication of the reconstructed 3D models from vision field. At last, experimental results of both the 3D spatial reconstruction and the 3D mesh coding are demonstrated.
Cloning and characterization of the gsk gene encoding guanosine kinase of Escherichia coli

The Escherichia coli gsk gene encoding guanosine kinase was cloned from the Kohara gene library by complementation of the E. coli gsk-1 mutant allele. The cloned DNA fragment was sequenced and shown to encode a putative polypeptide of 433 amino acids with a molecular mass of 48,113 Da. Minicell analysis established the subunit M(r) as 43,500. Primer extension analysis indicated the presence of an adequate Pribnow box and suggested that the transcript contained a 110-base leader sequence. Strains harboring the gsk gene on multicopy plasmids overexpressed both guanosine and inosine kinase activities. N-terminal sequence and amino acid composition analyses of the 43,500-M(r) polypeptide band confirmed the correct reading frame assignment and the identity of this band as the gsk gene product. Comparison of the amino acid sequence with the protein database revealed similarity to regions of other mononucleotide-utilizing enzymes.