Miracle-dz/UniFAR-FTUs huggingface dataset:
Estudio traslacional de la vía Notch en nefropatía hipertensiva

La ruta de senalizacion de Notch esta activada en una gran variedad de patologias renales humanas. Recientemente hemos demostrado que la activacion de esta ruta no estaria implicada en la fibrosis renal experimental inducida por angiotensina II o hipertension. Objetivos: Evaluar si la via Notch esta activada en la fibrosis renal asociada a nefroesclerosis hipertensiva. Para validar la hipotesis se estudiaron varias patologias glomerulares caracterizadas por fibrosis tubulo- intersticial. Metodos: Se utilizaron biopsias renales de pacientes con nefroesclerosis hipertensiva, en comparacion con nefropatia diabetica y nefropatia membranosa en diferentes etapas de progresion. La expresion genica y proteica se evaluo por hibridacion in situ e inmunohistoquimica, respectivamente. Resultados: En nefroesclerosis hipertensiva se observo baja expresion renal de proteinas de la via Notch, no existiendo asociacion entre la fibrosis tubulo-intersticial y los niveles de estas proteinas. Por el contrario, en las patologias glomerulares estudiadas se observo una elevada expresion de los transcritos Jagged-1, HES-1 y TGF- ? , y de las proteinas Jagged-1 y Notch-1, localizados principalmente en celulas tubulo-epiteliales. Los niveles de expresion de los componentes de la via Notch se relacionaron con el grado de fibrosis tubulo-intersticial, lo que confirma la activacion de esta via en nefropatias progresivas. Conclusiones: Nuestros datos muestran que la via Notch no esta activada en el rinon de pacientes con nefropatia hipertensiva, ampliando los resultados de los modelos experimentales de dano renal asociado a hipertension a la patologia humana. Nuestros estudios aportan nueva informacion sobre la compleja regulacion del sistema Notch en el rinon
Enhancing Taiwanese University Students' English Communication Ability Utilizing Instant Messaging

The worldwide popularity of Instant Messaging (IM) has grown significantly in recent years, owing to its easy access and user-friendly interfaces. This study proposed to apply IM as a modern learning tool for enhancing English communication in the global information society. The study also discussed the usability and efficiency of the proposed application. A survey instrument was developed to achieve the described objective. One hundred and eighty-two Taiwanese university students completed the survey. Four statistical analysis methods including analysis of variance (ANOVA) and path analysis were performed to test the hypotheses of the study. This study concluded that the implementation of IM on English learning is feasible due to students’ interest in English learning and their familiarity with IM. The implementation of IM on English learning may be valuable to non-English speaking countries. Future studies should employ an experimental design to investigate whether implementing IM would enhance students’ English ability.
Algoritmos de particionamento para MPSoCs heterogêneos baseados em NoC

Several new applications are composed by heterogeneity of tasks implying high complexity degree, and requiring high processing and communicating rate. Multiprocessor System-on-Chip (MPSoC) based on Network-on-Chip (NoC) is a promising targeting architecture to fulfill these requirements, due to its high computation and communication parallelism that enables several tasks executed at the same time. Furthermore, these applications requirements are better fulfilled by MPSoC composed by different types of processors – heterogeneous MPSoC. One challenge in current heterogeneous MPSoC design is partitioning of application tasks, aiming energy consumption minimization and fair load balance. This work contribution is twofold: (i) analysis and comparison of partitioning algorithms; and (ii) the evaluation of partitioning as a pre-mapping task. This work analyzes and compares stochastic and new heuristic partitioning algorithms for obtaining low energy consumption and efficient load balance when applied to tasks partitioning onto heterogeneous MPSoC. In addition, performance results obtained from simulations indicate that the static partitioning technique can be used on application tasks before mapping activities to improve the quality on the static or dynamic mapping and also for minimizing processing time.
“Through the looking glass: envisioning new library technologies” social media trends that inform emerging technologies

Purpose The purpose of this paper is to explore recent developments in a number of relatively well-established social media platforms – Google+, Facebook, Twitter and Yik Yak –to highlight the trends that are emerging within social media. Design/methodology/approach These trends have implications beyond just the social media space as a host of technologies take on social attributes. Findings Technologies such as video games, which previously functioned more or less as stand-alone pieces of software, are increasingly embracing many of the tools of social media platforms. Practicalimplications As a result, it is increasingly difficult to distinguish social technology from other communication technologies (Papacharissi, 2015). Socialimplications By examining trends in social media, we are able to not only better understand these important platforms but also acquire insight into developments that can affect a wide range of related technologies, all of which are of interest to information professionals. Originality/value Many of the examples the paper gave were drawn from the various social media platforms that mediate the personal and professional lives of their users.
Latent Variable Models for Link Analysis of Similarity Data

There is a need for statistical models which can organize large collections of pair-wise similarity relationships between objects into meaningful clusters. Similarity data consists of non-negative quantitative measurements of similarity between object pairs. Examples include internet connectivity data and document word count data. We present various latent variable models for finding reduced rank structure in similarity data. Applications are presented in unsupervised clustering, targeted clustering based on pre-defined cluster relationships, and graph layout using reduced rank graph approximations.
Recognition of Movements Through Dynamic Electromyographic Signals

The recognition of movements through electromyographic (EMG) signals is critical for myoelectric control systems. Performance of these systems depend on processing methods and protocols used to extract the EMG signals. The aim of this study is to evaluate the performance of classification of a kinematic recognition system based on dynamic EMG signals. For this, a correlation analysis between dynamic EMG signals and kinematic features of movements is realized, and then, a kinematic recognition system based on dynamic EMG signals is implemented. Dynamic EMG signals from forearm muscles during finger flexion movements were recorded and analyzed by using an amplitude estimator. Linear and no-linear correlations between EMG amplitudes and kinematic features were found. Then, a step of classification based on discriminant analysis was implemented to categorize the finger movements in multiple kinematic states. The accuracy of classifications were 95%, 88%, 81% and 76% for two, three, four and five states respectively, and by using a simple-channel recording and an EMG amplitude estimator. The results of this study demonstrate that it is possible to improve aspects of “intuitiveness” through dynamic EMG evoked by natural and more intuitive movements. Keywords—EMG; root mean square; kinematic features; discriminant analysis.
Robot-Assisted Laparoscopic Surgery

• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication
Efficient optimization of all-terminal reliable networks, using an evolutionary approach

The use of computer communication networks has been rapidly increasing in order to: (1) share expensive hardware and software resources, and (2) provide access to main system from distant locations. The reliability and cost of these systems are important and are largely determined by network topology. Network topology consists of nodes and the links between nodes. The selection of optimal network topology is an NP-hard combinatorial problem so that the classical enumeration-based methods grow exponentially with network size. In this study, a heuristic search algorithm inspired by evolutionary methods is presented to solve the all-terminal network design problem when considering cost and reliability. The genetic algorithm heuristic is considerably enhanced over conventional implementations to improve effectiveness and efficiency. This general optimization approach is computationally efficient and highly effective on a large suite of test problems with search spaces up to 2/spl middot/10/sup 90/.
Meta-routing: Synergistic merging of message routing and link maintenance

The maintenance of network connectivity is essential for effective and efficient mobile team operations. Achieving robust mobile ad hoc networks (MANETs) connectivity requires a capable link maintenance mechanism especially if the network experiences expected intermittent connectivity due to a hostile environment. One applicable example of such network scenarios is multi-robot exploration for urban search and rescue (USAR). With the proliferation of these robotic networks, communication problems such as the link maintenance problem are subject to be raised quickly. Although various routing protocols for wireless ad hoc networks have been proposed, they solve the problems of message routing and link maintenance separately, resulting in additional overhead costs and long latency in network communication. Traditional routing protocols discover existing links, connect these links, find the best path and minimize the path cost. The limitation of previous routing protocols motivates us to develop a new concept of routing mechanism for a robotic network. This routing mechanism is named Meta-Routing. Meta-Routing expands current routing protocols to include not only the normal routing of packets, but also the maintenance of links in mobile agent scenarios. Thus, Meta-Routing minimizes the communication path cost and the overhead cost, the latter of which results from discovering a route, repairing a link or establishing a new communication path between nodes. This dissertation presents a method to achieve Meta-Routing by controlling robot motion based on the radio frequency (RF) environment recognition method and gradiii ent descent method. Mobile robot controlled motion can effectively improve network performance by driving robots to favorable locations with strong links. Moreover, the gradient descent method is used in driving the robots into the direction of favorable positions for maximizing broken or failing links and maintaining network connectivity. The main accomplished goals of this thesis are summarized as follows: firstly, the Meta-Routing protocol, which integrates link maintenance into the normal message routing protocol cost function; secondly, the dissertation examines the unification of the syntax of message routing protocol and the link maintenance process through physical configuration of mobile network nodes by controlling their movement in the field; finally, the dissertation demonstrates that the utilization of the RF environment recognition and classification method improves route repair estimation for achieving link maintenance in the presented Meta-Routing protocol. The numerical experimental results demonstrate promising RF environment recognition and node controlled motion results, as well as confirm their abilities in robot movement control for link maintenance and reduction of the total path cost.
Expressive Modular Linking for Object-Oriented Languages

In this paper we show how modular linking of program fragments can be added to statically typed, object-oriented (OO) languages. Programs are being assembled out of separately developed software components deployed in binary form. Unfortunately, mainstream OO languages (such as Java) still do not provide support for true modular linking. Modular linking means that program fragments can be separately compiled and type checked, and that linking can ensure global program type correctness without analyzing program fragment implementations. Supporting modular linking in OO languages is complicated by two expressive features that current OO languages do not support together: mixin-style inheritance across program fragment boundaries, and cyclic dependencies between program fragments. In a previous paper at OOPSLA 2001, we have demonstrated the practical uses for such expressiveness. When such expressiveness is permitted, link-time type checking rules must ensure that method collisions and inheritance cycles do not occur after program fragments are linked into a program. In this paper, we show how modular linking with both cyclic linking and mixin-style inheritance can be supported using a type-checking architecture that can be added on top of existing OO languages, such as Java.
Moratorium Effect on Estimation Values in Simple Reinforcement Learning

In this paper, we introduce low-priority cut-in (moratorium) to chain form reinforcement learning, which we proposed as Simple Reinforcement Learning for a reinforcement learning agent that has small memory. In the real world, learning is difficult because there are an infinite number of states and actions that need a large number of stored memory and learning time. To solve the problem, better estimated values are categorized as "GOOD" in the reinforcement learning process. Additionally, the alignment sequence of estimated values is changed because they are regarded as an important sequence themselves. However, the method is heavily affected by the action policy. If an agent tends to search many states, its memory overflows with low-value data. Thus, low-priority cut-in (moratorium) enhances the method in order to solve this problem. We conducted some simulations and observed the influence of our methods. Several simulation results show good influence on learning.
Essence and Emergence of Routing (As a Best Service)

This Research Paper emphasize on customize route computation should be offered as a ervice by Third Party Providers.In Internet routing, there is a fundamental tussle between the end users who want control over the end-to-end paths and the Autonomous Systems (ASes) who want control over the flow of traffic through their infrastructure. To resolve this tussle and offer flexible routing control across multiple routing domains, we argue that customized route computation should be offered as a service by third-party providers. Outsourcing specialized route computation allows different path-selection mechanisms to coexist, and evolve over time.
DroidSecure : A Technique to Mitigate Privilege Escalation in Android Application

안드로이드 플랫폼은 사용자 친화적으로 설계되어 있다. 하지만 이러한 친화적 설계는 취약점이 쉽게 발생할 수 있고, 일반적인 사용자는 쉽게 탐지가 어렵다는 단점을 가지고 있다. 따라서, 본 논문에서는 안드로이드 어플리케이션 분석을 위한 유명한 오픈 소스 분석 도구를 설명하고, 현재 구글의 권한 그룹에 대한 정책의 위험성을 설명한 후 공격자의 권한 상승에 대한 위험을 완화하기 위한 기법을 제안한다. 또한, 21,064의 악성코드 샘플을 조사하여 제안한 기술이 안전하지 않은 응용 프로그램 업데이트 탐지에 대한 증명을 하였을 뿐 아니라 보안 위협에 대한 인식을 고취시키고자 하였다.
The Technology Of Computer Music

The invention relates to a magnetic valve assembly of the type in which an energized armature moves a valve closure member to an open position and a load spring in compression maintains the valve closure member closed when the armature is nonenergized. Relative movement between the armature member and the closure member is provided and an energy storing spring between these members resists the relative movement. In two embodiments the energy storing spring is stressed in compression in one and in tension in the other. The valve closure member does not begin to move until the armature causes the energy storing spring to be stressed to an extent equal to a predetermined stressing of the load spring. With this mode of operation the armature stroke is longer than the stroke of the closure member and this results in a smaller magnetic system being sufficient for a given valve system.
High performance RF-filters suitable for above IC integration: film bulk-acoustic- resonators (FBAR) on silicon

The fundamentals of bulk-acoustic-wave (BAW) devices and the performance of state-of-the-art film bulk-acoustic-resonator (FBAR) filters is reviewed. The key role that high performance RF-filters play in handset applications is discussed and the benefit of silicon technologies outlined. Key processes in manufacturing of FBARs are briefly reviewed. The appealing simplicity of filter modeling and design is presented. Monolithic integration of "system-on-chip" together with RF-ICs is technically feasible and has been demonstrated. Conditions under which this will commercially make sense as compared to hybrid integration "system-in-package" is discussed. Examples of state-of-the-art in BAW filters in production and ramp-up status are presented.
Review: Optimized Webpage Classification

Now, with the explosive growth of the data stored in various forms, the need for innovative and effective technologies to help find and use the useful information and knowledge from a large variety of data sources is continually increasing. Somehow we could put these all into this way as well like, Web information has become increasingly diverse. In order to utilize the Web information better, people pursue the latest technology, which can effectively organize and use online information. However, semi-structured document differ from tradition text which is neat and clean; Web information contains a lot of noise. Web Mining is the application of data mining techniques to discover classification of web data. It focuses on techniques that could predict the data’s class while the user interacts with the web. The information providers on the web will be interested in techniques that could improve the effectiveness of the web search engine.
A new transformation method to generate optimized DO loop from FORALL construct

Data parallel language was suggested to solve programming problems of distributed memory machines in terms of programming language. Among data parallel languages, HPF is a standard data parallel language across a variety of high-performance architectures. Most HPF compilers are source-to-source translators because they can be easily implemented. However, these source-to-source compilers produce significant amount of ineffective codes. In particular, the FORALL construct is converted into several DO loops, so its loop overhead is increased. Therefore, we propose some techniques for converting FORALL construct to optimized DO loop. For this, we define and use relation distance vector which can represent both data dependence information and flow information. Then we evaluate and analyze execution time for the codes converted by our method and by PARADIGM method.
The induction of solution rules in Raven's Progressive Matrices Test

In this paper, we study the rule induction process in a popular intelligence test, Raven's Advanced Progressive Matrices test (RPM; Raven, 1962). Carpenter, Just, and Shell (1990) have shown that only a few rule types are necessary to describe all items of the test. An independent question that has not been investigated is whether participants profit from this, that is, do they learn to apply these rules more fluently throughout the test? We show that this is the case and look in detail at different aspects of this learning process. The relevance of our findings is discussed for a process theory on solving RPM items.
Cost-effectiveness analysis of highly concentrated n-3 polyunsaturated fatty acids in secondary prevention after myocardial infarction

Abstract Background Acute myocardial infarction (MI) is a leading cause of cardiovascular (CV) mortality and hospitalization. Survivors of acute MI have higher risk of subsequent CV events and death, compared to individuals without MI. Evidences have demonstrated the CV benefits of n-3 polyunsaturated fatty acids (PUFAs) in patients who experienced MI. Objectives We assessed the cost-effectiveness of highly concentrated n-3 polyunsaturated fatty acids (PUFAs) in addition to standard therapy compared with standard therapy alone in post-MI patients in Thailand. Methods A Markov model was constructed to assess costs, life years, and quality-adjusted life years (QALYs) with lifetime horizon in post-MI patients, on the basis of provider perspective. Input data were based on information from the Thai Acute Coronary Syndrome (ACS) Registry, a meta-analysis of mortality data and published articles. Outcomes have been presented as incremental cost-effectiveness ratios of life expectancy and quality-adjusted life expectancy. Deterministic and probabilistic sensitivity analyses were performed for key variables in the model. Results n-3 PUFAs increased life expectancy by 2.34 life-years at an incremental cost-effectiveness ratio (ICER) of 256,199 Thai baht (THB) per life-year gained (LYG), compared to the standard therapy alone in the base case analysis. The quality-adjusted life years (QALY) increased by 2.01 with ICER of 297,193 THB per QALY from n-3 PUFAs supplementation. Both ICER/QALY and ICER/LYG decreased as the age of patients increased. The incremental cost per QALY gained in post-MI patients aged 45 to 85 years old ranged from 216,200 THB to 414,049 THB. Conclusion Considering the current willingness-to-pay threshold of 160,000 THB/QALY, highly concentrated n-3 PUFAs as secondary prevention of MI appears not to be cost-effective compared to standard treatment alone in Thailand.
Satellite Data Utilization in Hydrological Research

Copyright: © 2013 Day CA. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Research in hydrology will often involve an analysis of complex natural and human systems. Such research includes both water resources (catchment-scale water budgets, snowmelt, supply and demand issues) and hazards analysis (flooding, channel erosion, impacts of urbanization). In recent years the wider access of geospatial satellite data to represent these systems, and development of tools and technologies to process this data has increased tremendously. As a result, hydrological research has become a frontrunner in the evolution of the geosciences into its current guise. This editorial summarizes some of the key geospatial satellite data sources and technologies being applied to hydrological research.
Triple-correlation direct sequence receiver

A self-referencing direct sequence spread spectrum receiver is presented which is based on an appropriate single lag of the auto-triple-correlation. The receiver is self-acquiring, in the sense that no local reference code is necessary. The received signal is auto-triple-correlated at a particular lag such that the transmitted code acts as its own reference. The proposed receiver is characterized by a bound on its probability of bit error in additive white Gaussian noise, and compared with a conventional coherent BPSK receiver. <<ETX>>