Miracle-dz/UniFAR-FTUs huggingface dataset:
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning

Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approximate planning in POMDPs is known to be hard, and developing heuristic planners that can deliver reasonable results in practice has proved to be a significant challenge. In this paper, we present a new approach to approximate value-iteration for POMDP planning that is based on quadratic rather than piecewise linear function approximators. Specifically, we approximate the optimal value function by a convex upper bound composed of a fixed number of quadratics, and optimize it at each stage by semidefinite programming. We demonstrate that our approach can achieve competitive approximation quality to current techniques while still maintaining a bounded size representation of the function approximator. Moreover, an upper bound on the optimal value function can be preserved if required. Overall, the technique requires computation time and space that is only linear in the number of iterations (horizon time).
Node Architecture Implications for In-Memory Data Analytics on Scale-in Clusters

While cluster computing frameworks are continuously evolving to provide real-time data analysis capabilities, Apache Spark has managed to be at the forefront of big data analytics. Recent studies propose scale-in clusters with in-storage processing devices to process big data analytics with Spark However the proposal is based solely on the memory bandwidth characterization of in-memory data analytics and also does not shed light on the specification of host CPU and memory. Through empirical evaluation of in-memory data analytics with Apache Spark on an Ivy Bridge dual socket server, we have found that (i) simultaneous multi-threading is effective up to 6 cores (ii) data locality on NUMA nodes can improve the performance by 10% on average, (iii) disabling next-line L1-D prefetchers can reduce the execution time by up to 14%, (iv) DDR3 operating at 1333 MT/s is sufficient and (v) multiple small executors can provide up to 36% speedup over single large executor.
i.MTV: an integrated system for mtv affective analysis

In modern time, MTV has become an important favorite pastime to people because of its conciseness, convenience and the ability to bring both audio and visual experiences to audiences. It has become an significant task to develop new techniques for natural, user-friendly, and effective MTV access. In this demo, an integrated system (i.MTV) is constructed for MTV Affective Analysis, Visualization, Retrieval, and User Profile Analysis. We not only perform the effective MTV affective analysis, but also propose novel Affective Visualization techniques to make the abstract affective states intuitive and friendly to users. Based on the affective analysis and visualization, MTV affective retrieval and management are achieved. Furthermore, novel methods are proposed for user affective preferences analysis and MTV recommendation.
Invisible Digital Watermarking Through Encryption

ABSTRACT Technique for hiding the data of images has been proposed in this paper. At the source, hidden (target image) is encoded within another image (cover image). Firstly, the cover image and the target image can be adjusted by resize function. Secondly, only the final encrypted image i.e. cover image and target image is sent over the network. This image is servefinally decoded at the receiver end. Received results are encouraging from practical point of view. image is distributed to externally, client can access to Keywords Data, image, Hiding, Security, Encryption 1. INTRODUCTION Invisible digital watermarks are a new technology which could solve the “problem” of enforcing the copyright of content transmitted across shared networks. They allow a copyright holder to insert a hidden message (invisible watermark) within images, moving pictures, sound files, and even raw text. Furthermore, the author can monitor traffic on the shared network for the presence of his or her watermark via network system. Because this method conceals both the content of the message (cryptography) and the presence of the message (steganography) an invisible watermark is very difficult to remove. Thereby, this technology could greatly strengthen the enforcement of copyright law on the Internet. Data hiding is defined as the process by which a message or image is imperceptibly embedded into a host or cover to get a composite signal. Generally, in encryption, the actual information is not maintained in its original format and thereby it is converted into an alternative equivalent multimedia file like image, video or audio, which in turn is being hidden within another object. This apparent message is sent through the network to the recipient, where the actual message is separated from it. In this paper, our first consideration is that of embedding information into image, which could survive attacks on the network. Next, digital embedding technique is proposed for hiding an image into another image in such a way that the quality of the recovered image improves significantly. In most of the algorithms designed based on the principle of data hiding, requires the sending original cover image along with the encoded cover image to the receiver. This approach makes the designed algorithm weaker as it conveys some idea of data hiding to the sender. But our method only the encrypted image will be sent to the receiver. The design of this technique is based on extensive analysis of the data-hiding process.
Zhao, Y.x. Et Al. (2015) Double Spin Asymmetries of Inclusive Hadron Electroproduction from a Transversely Polarized 3he Target. Physical Review C, Double Spin Asymmetries of Inclusive Hadron Electroproductions from a Transversely Polarized 3 He Target

There may be differences between this version and the published version. You are advised to consult the publisher's version if you wish to cite from it. 2 We report the measurement of beam-target double-spin asymmetries (ALT) in the inclusive production of identified hadrons, e + 3 He ↑ → h + X, using a longitudinally polarized 5.9 GeV electron beam and a transversely polarized 3 He target. Hadrons (π ± , K ± and proton) were detected at 16 • with an average momentum <P h >=2.35 GeV/c and a transverse momentum (pT) coverage from 0.60 to 0.68 GeV/c. Asymmetries from the 3 He target were observed to be non-zero for π ± production when the target was polarized transversely in the horizontal plane. The π + and π − asymmetries have opposite signs, analogous to the behavior of ALT in semi-inclusive deep-inelastic scattering.
Both Ubiquitin Ligases FBXW8 and PARK2 Are Sequestrated into Insolubility by ATXN2 PolyQ Expansions, but Only FBXW8 Expression Is Dysregulated

The involvement of the ubiquitin-proteasome system (UPS) in the course of various age-associated neurodegenerative diseases is well established. The single RING finger type E3 ubiquitin-protein ligase PARK2 is mutated in a Parkinson’s disease (PD) variant and was found to interact with ATXN2, a protein where polyglutamine expansions cause Spinocerebellar ataxia type 2 (SCA2) or increase the risk for Levodopa-responsive PD and for the motor neuron disease Amyotrophic lateral sclerosis (ALS). We previously reported evidence for a transcriptional induction of the multi-subunit RING finger Skp1/Cul/F-box (SCF) type E3 ubiquitin-protein ligase complex component FBXW8 in global microarray profiling of ATXN2-expansion mouse cerebellum and demonstrated its role for ATXN2 degradation in vitro. Now, we documented co-localization in vitro and co-immunoprecipitations both in vitro and in vivo, which indicate associations of FBXW8 with ATXN2 and PARK2. Both FBXW8 and PARK2 proteins are driven into insolubility by expanded ATXN2. Whereas the FBXW8 transcript upregulation by ATXN2- expansion was confirmed also in qPCR of skin fibroblasts and blood samples of SCA2 patients, a FBXW8 expression dysregulation was not observed in ATXN2-deficient mice, nor was a PARK2 transcript dysregulation observed in any samples. Jointly, all available data suggest that the degradation of wildtype and mutant ATXN2 is dependent on FBXW8, and that ATXN2 accumulation selectively modulates FBXW8 levels, while PARK2 might act indirectly through FBXW8. The effects of ATXN2-expansions on FBXW8 expression in peripheral tissues like blood may become useful for clinical diagnostics.
Analytic Visibility on the GPU

This paper presents a parallel, implementation‐friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti‐aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge‐triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling‐based rendering methods.
Corner detection using support vector machines

A support vector machine based algorithm for corner detection is presented. It is based on computing the direction of maximum gray-level change for each edge pixel in an image, and then representing the edge pixel by a four dimensional feature vector constituted by the count of other edge pixels lying in a window centred about and having each of the possible four directions as their direction of maximum local gray-level change. A support vector machine is designed using this feature vectors and the support vectors, representing critical points in a classification problem, correspond to the corner points. The algorithm is straightforward and does not involve computation of complex differential geometric operators. It has implicit learning capability resulting in good performance for a wide range of images.
Virtual Machine Placement Optimization Supporting Performance SLAs

Cloud computing model separates usage from ownership in terms of control on resource provisioning. Resources in the cloud are projected as a service and are realized using various service models like IaaS, PaaS and SaaS. In IaaS model, end users get to use a VM whose capacity they can specify but not the placement on a specific host or with which other VMs it can be co-hosted. Typically, the placement decisions happen based on the goals like minimizing the number of physical hosts to support a given set of VMs by satisfying each VMs capacity requirement. However, the role of the VMM usage to support I/O specific workloads inside a VM can make this capacity requirement incomplete. I/O workloads inside VMs require substantial VMM CPU cycles to support their performance. As a result, placement algorithms need to include the VMM's usage on a per VM basis. Secondly, cloud centers encounter situations wherein change in existing VM's capacity or launching of new VMs need to be considered during different placement intervals. Usually, this change is handled by migrating existing VMs to meet the goal of optimal placement. We argue that VM migration is not a trivial task and does include loss of performance during migration. We quantify this migration overhead based on the VM's workload type and include the same in placement problem. One of the goals of the placement algorithm is to reduce the VM's migration prospects, thereby reducing chances of performance loss during migration. This paper evaluates the existing ILP and First Fit Decreasing (FFD) algorithms to consider these constraints to arrive at placement decisions. We observe that ILP algorithm yields optimal results but needs long computing time even with parallel version. However, FFD heuristics are much faster and scalable algorithms that generate a sub-optimal solution, as compared to ILP, but in time-scales that are useful in real-time decision making. We also observe that including VM migration overheads in the placement algorithm results in a marginal increase in the number of physical hosts but a significant, of about 84 percent reduction in VM migration.
Pitch Control of an Aircraft with Aggregated Reinforcement Learning Algorithms

Pitch control is a basic function of an Automatic Flight Control System (AFCS). Due to the complexity of problems, stochastic behavior, and the disturbing of the environment, traditional techniques, such as, linear feedback control, quantitative feedback theory, and adaptive control, which are all based on the explicit aerodynamic model of an aircraft, are not efficient in designing pitch controllers. This paper adopts multiple Reinforcement Learning (RL) algorithms and Cerebellar Model Articulation Controller (CMAC) techniques to design a pitch controller. In order to improve learning and control performances, a learn system named "Aggregated Multiple Reinforcement Learning System (AMRLS)" is proposed, which combines the outcomes of individual RL algorithms by using several aggregation methods. The goal of this paper is to demonstrate that the improved RL based control technology can be applied effectively to pitch control problem.
Small versus large: Switch sizing in topology design of energy-efficient data centers

Saving power in datacenter networks has become a pressing issue. While in operation, ElasticTree and CARPO can save power consumed by a fat-tree network by using sleep mode where some components such as ports and switches are turned off when traffic demand in the network is relatively moderate. In this paper, we propose a new approach by exploring the design stage of a datacenter network and focus on how to choose the right switch size that can potentially save the most power during the expected operation of the network. We also consider speed scaling where the power of a switch can be varied by adjusting its processing rate according to its traffic demand. We use analysis and simulation to investigate the power-saving performance of different switch sizes, power-saving modes and traffic demand patterns. Our findings with sleep mode reveal that deploying a large number of small switches is more power-efficient than a small number of large switches when the traffic demand is relatively moderate or when servers exchanging traffic are in close proximity. With speed scaling, the reverse is generally true.
Perna robótica com capacidade de salto vertical em terrenos com desníveis = Robotic leg with vertical jump capability on sloping floors

En esta Tesis se aborda el problema del salto vertical, del tipo semi-agachado sobre superficies inclinadas, de un robot antropomorfo de una sola pierna, considerado los efectos inerciales de la pierna en el movimiento de impulsion. Se propone un metodo para la generacion del movimiento de salto, basado en la curva de aceleracion del Centro de Masas (CoM) de un robot con tres grados de libertad, sin incluir balanceo de brazos; dicha curva de aceleracion se caracteriza mediante un polinomio de tercer grado con formato derivado de datos biomecanicos. La influencia de la inclinacion de la superficie de apoyo en el movimiento de salto se caracteriza a partir de las variables de posicion, velocidad, aceleracion y par aplicados en cada articulacion, y de la descomposicion de las fuerzas aplicadas en el robot sobre una superficie inclinada; ademas tambien se propuso en esta Tesis un metodo de aproximacion del perfil de par para diferentes angulos de inclinacion. A diferencia de la mayoria de las soluciones propuestas para la generacion de los movimientos de las articulaciones, el metodo adoptado no introduce restricciones de Punto de Momento Cero (ZMP) y momento angular en las ecuaciones de movimiento, posibilitando asi un numero mayor de soluciones para la planificacion de las trayectorias de las articulaciones en comparacion con los metodos que aplican dichas restricciones. Sin embargo, tales restricciones se utilizan para verificar la estabilidad en la fase de impulsion y, estimar la posicion y la orientacion del pie en el instante del aterrizaje. En esta Tesis se analizaron diversas simulaciones de salto, asumiendo diferentes distribuciones de masas, posiciones del Centro de Masas y otras condiciones para los movimientos de las articulaciones, con el proposito de establecer tanto el modelo de robot mas apropiado para los experimentos como la estrategia para el movimiento de impulsion que mejor se ajustase a dicho modelo. Para la comprobacion y validacion de las propuestas de esta Tesis, se diseno y construyo un entorno de prueba experimental, compuesto por: un prototipo de robot formado por cuatro secciones (o eslabones) unidos por las juntas rotatorias correspondientes a los tres grados de libertad estudiados; una plataforma para medida de fuerzas verticales con inclinacion ajustable; un sistema empotrado de adquisicion y proceso de datos; y una interfaz grafica desarrollada en LabVIEW. Los resultados experimentales obtenidos permitieron validar la propuesta de esta Tesis para el metodo de generacion de movimiento de salto vertical, el metodo de aproximacion del perfil de par, la estrategia aplicada en el movimiento de las articulaciones durante la fase de impulsion, la estrategia aplicada en la prediccion y la correccion de la orientacion del pie durante la fase aerea para compensar el efecto del momento angular y, por ultimo, comprobar la elevada fuerza de impacto en el instante del aterrizaje.
NEURAL NETWORKS FOR TECHNICAL ANALYSIS: A STUDY ON KLCI

This paper presents a study of artificial neural nets for use in stock index forecasting. The data from a major emerging market, Kuala Lumpur Stock Exchange, are applied as a case study. Based on the rescaled range analysis, a backpropagation neural network is used to capture the relationship between the technical indicators and the levels of the index in the market under study over time. Using different trading strategies, a significant paper profit can be achieved by purchasing the indexed stocks in the respective proportions. The results show that the neural network model can get better returns compared with conventional ARIMA models. The experiment also shows that useful predictions can be made without the use of extensive market data or knowledge. The paper, however, also discusses the problems associated with technical forecasting using neural networks, such as the choice of "time frames" and the "recency" problems.
Effects of continuous positive airway pressure on cardiovascular risk profile in patients with severe obstructive sleep apnea and metabolic syndrome.

BACKGROUND The increased risk of atherosclerotic morbidity and mortality in patients with obstructive sleep apnea (OSA) has been linked to arterial hypertension, insulin resistance, systemic inflammation, and oxidative stress. We aimed to determine the effects of 8 weeks of therapy with continuous positive airway pressure (CPAP) on glucose and lipid profile, systemic inflammation, oxidative stress, and global cardiovascular disease (CVD) risk in patients with severe OSA and metabolic syndrome. METHODS In 32 patients, serum cholesterol, triglycerides, high-density lipoprotein cholesterol, fibrinogen, apolipoprotein A-I, apolipoprotein B (ApoB), high-sensitivity C-reactive protein, interleukin-6, tumor necrosis factor (TNF)-alpha, leptin, malondialdehyde (MDA), and erythrocytic glutathione peroxidase (GPx) activity were measured at baseline and after 8 weeks of CPAP. The insulin resistance index (homeostasis model assessment [HOMA-IR]) was based on the homeostasis model assessment method, the CVD risk was calculated using the multivariable risk factor algorithm. RESULTS In patients who used CPAP for > or = 4 h/night (n = 16), CPAP therapy reduced systolic BP and diastolic BP (p = 0.001 and p = 0.006, respectively), total cholesterol (p = 0.002), ApoB (p = 0.009), HOMA-IR (p = 0.031), MDA (p = 0.004), and TNF-alpha (p = 0.037), and increased erythrocytic GPx activity (p = 0.015), in association with reductions in the global CVD risk (from 18.8 +/- 9.8 to 13.9 +/- 9.7%, p = 0.001). No significant changes were seen in patients who used CPAP for < 4 h/night. Mask leak was the strongest predictor of compliance with CPAP therapy. CONCLUSIONS In patients with severe OSA and metabolic syndrome, good compliance to CPAP may improve insulin sensitivity, reduce systemic inflammation and oxidative stress, and reduce the global CVD risk.
Molecular mechanisms regulating ocular apoptosis in zebrafish gdf6a mutants.

PURPOSE To characterize the molecular mechanisms underlying retinal apoptosis induced by loss of Gdf6, a TGFβ ligand. METHODS The role of Gdf6 in regulating apoptosis was studied using a zebrafish gdf6a(-/-) mutant, which encodes a truncated, nonfunctional protein. To investigate whether intrinsic or extrinsic apoptotic mechanisms were involved, morpholino antisense oligonucleotides targeting baxa, baxb, and p53 were employed. Caspase-3 immunohistochemistry (IHC) was performed to assay apoptosis. Pharmacologic inhibition (using SB203580) and IHC were used to investigate the role of p38 mitogen activated protein (MAP) kinase activation in gdf6a(-/-)-induced apoptosis. To assess the role of Gdf6a in transcriptional regulation of TGFβ signal transducers, in situ hybridization (ISH) was performed using probes to smad1, 5, 7, and 8. RESULTS Results indicate maximal ocular apoptosis occurs 28 hours post fertilization (hpf) in gdf6a(-/-) mutants that is mediated independently of p53 by intrinsic mechanisms involving Bax proteins. Also, gdf6a(-/-) mutants exhibit markedly increased p38 MAP kinase activation that can be inhibited to significantly reduce retinal apoptosis. A reduction in retinal smad1 expression was also noted in gdf6a(-/-) mutants. CONCLUSIONS gdf6a(-/-)-induced apoptosis is characterized by the involvement of intrinsic apoptotic pathways, p38 MAP kinases, and dysregulated smad expression. Modulation of key mediators can inhibit retinal apoptosis offering potential avenues of therapy. However, the efficacy of pharmacomodulation in improvement of visual function needs to be further examined.
Hepatitis A

Hepatitis A virus (HAV) is a single-stranded “nonenveloped” RNA virus in the picornaviridae family. HAV is most often transmitted by the fecal-oral route, but also by contaminated food, water, sexual contact, and intravenous drug use. HAV causes little if any symptoms in the very young. Disease symptoms from liver damage become more frequent in older ages and even fulminant liver failure with death is observed in the elderly. Unlike hepatitis B and C, hepatitis A does not cause chronic liver disease. With lack of sanitation and hygiene, HAV infection occurs early in life inducing life-long protection, whereas in countries with good sanitation and hygiene, infections are seen later in life and are more severe. There is no causal treatment, but available vaccines are well tolerated, have an excellent safety profile and are highly effective with long-lasting protection after 2 doses. Hepatitis A vaccines can be used for pre- as well as for post-exposure prophylaxis and for individual as well as for population protection. Vaccinating a small fraction of the population (3%) – i.e., children aged 1–4 years serving as the reservoir and source of HAV – resulted in herd protection with 96% disease reduction in the whole population of Israel.
q-distributions in complex systems: a brief review

The nonextensive statistical mechanics proposed by Tsallis is today an intense and growing research field. Probability distributions which emerges from the nonextensive formalism(q-distributions) have been applied to an impressive variety of problems. In particular, the role of q-distributions in the interdisciplinary field of complex systems has been expanding. Here, we make a brief review of q-exponential, q-Gaussian and q-Weibull distributions focusing some of their basic properties and recent applications. The richness of systems analyzed may indicate future directions in this field.