Miracle-dz/UniFAR-FTUs huggingface dataset:
Partial view geometric reconstruction of objects with rotational and planar symmetries for grasping tasks

In this paper we present a method based on two steps for reconstruction rotational and planar symmetric objects from a single partial view for grasping tasks. In the first step the orientation of the object is determined and in the second step the symmetry axis position is found. Then shape parameters are recovered and the completed geometry is used to plan and execute grasps. We leverage the symmetry information from the reconstruction to plan grasps effectively, resulting in high ratio of good grasps vs. tested grasps. We evaluate our methods on a robot platform that can reliably perform the grasps. Also, a shape characterization is provided for which the first step of the method (finding an object's orientation) will work, giving a starting point for more general shape reconstruction methods.
Suppression of Adult Neurogenesis Impairs Olfactory Learning and Memory in an Adult Insect

Although adult neurogenesis has now been demonstrated in many different species, the functional role of newborn neurons still remains unclear. In the house cricket, a cluster of neuroblasts, located in the main associative center of the insect brain, keeps producing new interneurons throughout the animal's life. Here we address the functional significance of adult neurogenesis by specific suppression of neuroblast proliferation using γ irradiation of the insect's head and by examining the impact on the insect's learning ability. Forty gray irradiation performed on the first day of adult life massively suppressed neuroblasts and their progeny without inducing any noticeable side effect. We developed a new operant conditioning paradigm especially designed for crickets: the “escape paradigm. ” Using olfactory cues, visual cues, or both, crickets had to choose between two holes, one allowing them to escape and the other leading to a trap. Crickets lacking adult neurogenesis exhibited delayed learning when olfactory cues alone were used. Furthermore, retention 24 hr after conditioning was strongly impaired in irradiated crickets. By contrast, when visual cues instead of olfactory ones were provided, performance of irradiated insects was only slightly affected; when both olfactory and visual cues were present, their performance was not different from that of controls. From these results, it can be postulated that newborn neurons participate in the processing of olfactory information required for complex operant conditioning.
Liver X receptors interfere with cytokine‐induced proliferation and cell survival in normal and leukemic lymphocytes

Liver X receptors (LXRs) are nuclear receptors regulating lipid and cholesterol metabolism. Recent data indicate an additional role of LXR in immunity by controlling dendritic cell and T‐cell function and in breast and prostate cancer cells. Here, we show that LXR activation interferes with IL‐2 and IL‐7‐induced proliferation and cell cycle progression of human T‐cell blasts mainly through inhibited phosphorylation of the retinoblastoma protein and decreased expression of the cell cycle protein cyclin B. Comparable results were obtained with IL‐2‐dependent chronic lymphoblastic leukemia (CLL) T cells. Furthermore, we show for B‐CLL cells that LXR are functionally active and inhibit expression of survival genes bcl‐2 and MMP‐9, and significantly reduce cell viability, suggesting an interference of LXR with cytokine‐dependent CLL cell survival. In conclusion, our data reveal LXR as a potent modulator of cytokine‐dependent proliferation and survival of normal and malignant T and B lymphocytes. This novel LXR action could find clinical application in immunosuppressive and antileukemic therapies.
Ultra broadband indoor channel measurements and calibrated ray tracing propagation modeling at THz frequencies

Ultra broadband communication systems operated at THz frequencies will require the thorough knowledge of the propagation channel. Therefore, an extensive measurement campaign of 50 GHz wide indoor radio channels is presented for the frequencies between 275 and 325 GHz. Individual ray paths are resolved spatially according to angle of arrival and departure. A MIMO channel is recorded in a 2×2 configuration. An advanced frequency domain ray tracing approach is used to deterministically simulate the THz indoor propagation channel. The ray tracing results are validated with the measurement data. Moreover, the measurements are utilized for the calibration of the ray tracing algorithm. Resulting ray tracing accuracies are discussed.
Isolation of Kyasanur Forest Disease Virus from Febrile Patient, Yunnan, China

We recently determined that Nanjianyin virus, isolated from serum of a patient in Yunnan Province, China, in 1989, is a type of Kyasanur Forest disease virus. Results of a 1987–1990 seroepidemiologic investigation in Yunnan Province had shown that residents of the Hengduan Mountain region had been infected with Nanjianyin virus.
Stereo based visual odometry in difficult traffic scenes

Reliable vehicle ego motion estimation based on visual information is an important research goal because it has applications like accurate long term localization by fusion with other sensors, temporal fusion between frames, moving obstacles detection and tracking, path planning etc. This paper evaluates and significantly improves some steps of existing visual odometry methods. The main contribution is related to accuracy improvements in case of illumination changes by using the rank transform. Additionally we propose a new consistency check, based on image deformations, for subsets of features considered during the RANSAC iterations of the algorithm. Performance of GPU execution and results in various traffic scenarios are presented in order to show the advantages and the robustness of the method.
A moving switching plane for the sliding mode control of the third order system

Abstract In this paper a new sliding mode control algorithm for the third order uncertain, nonlinear and time-varying dynamic system subject to unknown disturbance and input constraint is proposed. The algorithm employs a time-varying switching plane. At the initial time t = t 0 , the plane passes through the point determined by the system initial conditions in the error state space. Afterwards, the plane moves with a constant velocity to the origin of the space. The plane is selected in such a way that the integral of the absolute value of the system error over the whole period of the control action is minimised and the input constraint is satisfied. By this means, the reaching phase is eliminated, insensitivity of the system to the external disturbance is guaranteed from the very beginning of the proposed control action and fast, monotonic error convergence to zero is achieved.
Collaborative Replica Selection and Substitution Algorithm for the Video Grid

The service quality of Video on Demand (VOD) systems will degrade sharply when exceeding the number of user access. Former replica optimization algorithms restricted to a single server can not solve the problem. This paper proposes a framework of video grid and develops a collaborative algorithm of selection and substitution for replicas, in which both the user access behavior and the distribution condition of replicas are well balanced when considering whether a movie should be cached or removed. The simulation results demonstrate that the collaborative algorithm is better than the non-collaborative LFU algorithm obviously in terms of service capability, nevertheless, at the cost of more network occupation. *
Euclidean Distance-Based QoS Metric for Dynamic MAP Selection in HMIPv6 Network

This paper proposes metrics based on QoS preferences of MNs, and QoS abilities of MAPs, in order to perform a simulative evaluation of the Hierarchical Mobile IPv6 (HMIPv6) network implementation with QoS-aware dynamic MAP selection. The chosen metric meets the desired level of QoS, while retaining MAP load balance, while the DiffServ mechanism ensured the required QoS for HMIPv6 network implementation with QoS-aware dynamic MAP selection.
Revisiting the Greedy Approach to Submodular Set Function Maximization

We consider the problem of maximizing a nondecreasing submodular set function over various constraint structures. Specifically, we explore the performance of the greedy algorithm, and a related variant, the locally greedy algorithm in solving submodular function maximization problems. Most classic results on the greedy algorithm and its variant assume the existence of an optimal polynomial-time incremental oracle that identifies, in each iteration, an element of maximum incremental value to the solution at hand. In the presence of only an approximate incremental oracle, we generalize the performance bounds of the greedy algorithm and its variant in maximizing submodular functions over (i) uniform matroids, (ii) partition matroids, and (iii) general independence systems. Subsequently, we reinterpret and, thereby, unify and improve various algorithmic results in the recent literature for problems that are specific instances of maximizing monotone submodular functions in the presence of an approximate incremental oracle. This includes results for the Separable Assignment problem, the AdWords Assignment problem, the Set k-Cover problem, basic utility games, winner determination in combinatorial auctions, and related problem variants.
Land-atmosphere interactions in an high resolution atmospheric simulation coupled with a surface data assimilation scheme

A valid tool for the retrieving of the turbulent fluxes that characterize the surface energy budget is consti- tuted by the remote sensing of land surface states. In this study sequences of satellite-derived observations (from SE- VIRI sensors aboard the Meteosat Second Generation) of Land Surface Temperature have been used as input in a data assimilation scheme in order to retrieve parameters that de- scribe energy balance at the ground surface in the Tuscany region, in central Italy, during summer 2005. A parsimo- nious 1-D multiscale variational assimilation procedure has been followed, that requires also near surface meteorolog- ical observations. A simplified model of the surface energy balance that includes such assimilation scheme has been cou- pled with the limited area atmospheric model RAMS, in or- der to improve in the latter the accuracy of the energy budget at the surface. The coupling has been realized replacing the assimilation scheme products, in terms of surface turbulent fluxes and temperature and humidity states during the mete- orological simulation. Comparisons between meteorological model results with and without coupling with the assimila- tion scheme are discussed, both in terms of reconstruction of surface variables and of vertical characterization of the lower atmosphere. In particular, the effects of the coupling on the moisture feedback between surface and atmosphere are con- sidered and estimates of the precipitation recycling ratio are provided. The results of the coupling experiment showed im- provements in the reconstruction of the surface states by the atmospheric model and considerable influence on the atmo- spheric dynamics.
Empirical formulation for estimation of optimum number of randomly deployed nodes in WSN

The most fundamental issue in any wireless sensor network (WSN) design and/or analysis is the node deployment strategy and the number of nodes to be deployed. In this regard, a critical quality of service (QoS) parameter is network coverage which defines how well an area of interest is being monitored by a deployed network. The percentage coverage achieved for a given number of nodes in a predetermined network area can be computed using various sensing models. However, a more practical computation must determine the optimum density of nodes to be deployed such that it satisfies the specific spatial and temporal sampling of the network area within a given economical budget. In this paper, investigation is carried out to estimate the optimum density of nodes to be randomly deployed in a given network area of any size in order to attain the desired network coverage using deterministic and probabilistic sensing models. Parametric analysis is carried out to study the effects of sensing device characteristics and environmental parameters on the optimum density of nodes. The results obtained are used to empirically derive a formula based on regression analysis using least square polynomial curve fitting technique. The formula includes the parameters that affect the optimum number of nodes and thus can be used to estimate the number of nodes to be randomly deployed in order to attain desired percentage coverage in a WSN system. To the best of our knowledge, ours is the first work that revisits the theoretical foundation of network coverage to result into a mathematical formulation that can be readily and accurately used to design any practical WSN system.
Inducing Clause-Combining Rules: A Case Study with the SPaRKy Restaurant Corpus

We describe an algorithm for inducing clause-combining rules for use in a traditional natural language generation architecture. An experiment pairing lexicalized text plans from the SPaRKy Restaurant Corpus with logical forms obtained by parsing the corresponding sentences demonstrates that the approach is able to learn clause-combining operations which have essentially the same coverage as those used in the SPaRKy Restaurant Corpus. This paper fills a gap in the literature, showing that it is possible to learn microplanning rules for both aggregation and discourse connective insertion, an important step towards ameliorating the knowledge acquisition bottleneck for NLG systems that produce texts with rich discourse structures using traditional architectures.
Sarcomere length fluctuations and flow in capillary endothelial cells

Tensile force within non‐muscle tissue cells is generated in actomyosin stress fibers, which are composed of contractile units called sarcomeres. The number of sarcomeres and sarcomere lengths dynamically change in the cell but the mechanisms by which these processes occur are not understood. Using live cell imaging of labeled sarcomeres, we show that sarcomere lengths continually fluctuate, with a fluctuation relaxation time of about 20 min. New sarcomeres are formed at focal adhesions and are convected into the fiber at a speed that is independent of focal adhesion size, suggesting that the speed is independent of tension. Furthermore sarcomeres were observed to disappear at specific points or “sinks” along the stress fibers. These results show that stress fibers are highly dynamic structures despite their relatively static morphology, with nascent sarcomeres forming and being incorporated into the fiber at a nearly uniform, tension‐independent velocity throughout the cell. The fluctuating length of individual sarcomeres under constant tension is consistent with a model whereby sarcomere contraction/expansion speed, rather than sarcomere length, is modulated by tension. © 2011 Wiley‐Liss, Inc.
Annotating Multiple Types of Biomedical Entities: A Single Word Classification Approach

Named entity recognition is a fundamental task in biomedical data mining. Multiple - class annotation is more challenging than single - class annotation. In this paper, we took a single word classification approach to dealing with the multiple - class annotation problem using Support Vector Machines (SVMs). Word attributes, results of existing gene/protein name taggers, context, and other information are important features for classification. During training, the size of training data and the distribution of named entities are considered. The preliminary results showed that the approach might be feasible when more training data is used to alleviate the data imbalance problem.
Score and rank convergence of HITS

How many iterations does the (ever more) popular HITS algorithm require to converge in score and, perhaps more importantly, in rank (i.e. to get the nodes of a graph "in the right order")? After pinning down the elusive notion of convergence in rank we provide the first non-trivial bounds on the convergence of HITS. A "worst case" example, requiring a number of iterations superexponential in the size of the target graph to achieve even "mild" convergence, suggests the need for greater caution in the experimental evaluation of the algorithm - as recent results of poor performance (e.g. vs. SALSA) might be due to insufficient iterations, rather than to an intrinsic deficiency of HITS. An almost matching upper bound shows that, as long as one employs exponential acceleration e.g. through a "squaring trick", a polynomial running time (practical in many application domains) always provides strong convergence guarantees.
An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks

-In this paper, an algorithm for efficient network-wide broadcast (NWB) in mobile ad hoc networkds (MANETs) is proposed. The algorithm is performed in an asynchronous and distributed manner by each network node. The algorithm requires only limited topology knowledge, and therefore, is suitable for reactive MANET routing protocols. Simulations show that the proposed algorithm is on average 3-4 times as efficient as brute force flooding. Further, simulations show that the proposed algorithm compares favorably over a wide range of network sizes, with a greedy algorithm using global topology knowledge, in terms of minimizing packet transmissions. The application of the algorithm to route discovery in on-demand routing protocols is discussed in detail. Proofs of the algorithm's reliability and of the intracatability of solving for a minimum sized transmitter set to perform NWB are also given.
Network-Security-Policy Analysis

Computer network security is the first line of defence to accomplish information assurance. The computer network is at risk without a well-designed and flawless implemented network security policy. The main problem is that network administrators are not able to verify the network security policy. Although further research has been carried out, it mainly concerns small specific parts of the overall problem. This paper presents different approaches from literature and highlights how they are correlated and can operate together. This work summarizes the solutions proposed in literature, points out their advantages, disadvantages and limitations. To conclude, it proposes solutions for future research in this area
Executing Irregular Scientific Applications on Stream Architectures

The recent emergence of compute-intensive stream processors su ch as the Cell Broadband Engine, Stanford’s Merrimac, and ClearSpeed’s CSX600 has made them attractive platforms for scientific high-performance computing. Unstructured mesh and graph applications are an important class of numerical algorithms used in the scientific computing domain, which are particularly challenging for stream architectures. These codes have irregular structures where nodes have a variable number of neighbors, resulting in irregular memory access patterns and irregular control. We study four representative sub-classes of irregular algorithms, including finiteelement and finite-volume methods for modeling physical systems, direct methods for n-body problems, and computations involving sparse algebra. We propose a framework for representing the diverse characteristics of these algorithms in the context of the unique properties of stream architectures, and demonstrate it using one representative application from each sub-class. We then develop techniques for mapping the applications onto a stream processor, placing emphasis on data-localization and parallelizations. Our simulations show that efficient stream hardware with restricted control abilities can effectively run challenging irregular applications with, for example, a finite element method and a molecular dynamic code sustaining69GFLOP/s and46GFLOP/s (64-bit) respectively using a single chip that measures 12mm on a side and consumes less than 70W in 90nm technology.
A decompositional analysis of discourse relations

Current approaches to discourse coherence hypothesize a number of discourse relations which are used to link sentential units to one another. These relations, also called “coherence” or “rhetorical” relations, are defined either semantically in terms of their truth-conditional content or pragmatically in terms of speaker intention. Our enterprise consists in analyzing the constituting features of discourse relations and, more specifically, in investigating the inferences involved when a speaker or a hearer links two parts of a text. The framework we use to carry out our analysis is based on two main assumptions: agents reason in a Bayesian fashion and discourse is characterized by some sense of topicality. For that reason, we use a version of Update Semantics and combine it with Causal Probabilities along with Argumentation and Questions Under Discussion. Causal Probabilities allow us to model causal and identity inferences the interlocutors make as well as probabilistic inferences having to do with modalities, whereas Questions Under Discussion provide an elegant way to model topicality. We analyze the 32 discourse relations of Rhetorical Structure Theory due to the latter’s longevity as a discourse structure theory and its application in a variety of linguistic fields. The main result of our analysis is that discourse relations can be reduced to specific inferences and there is no need to hypothesize any primitive relations constituting these relations. Given the nature of the inferences, it is also possible that a Bayesian interpreter be able to automatically assign a discourse relation just by answering certain questions pertinent to discourse structure.
Language Development of Early Childhood Through The Implementation of 3Ps-Based Educative Game Tool

This study investigates the language development of early child through the implementation of 3Ps (Provision, Protection, and Participation)-Based Educative Game Tool. The study was conducted in early childhood education in Semarang, Indonesia. The data were collected through the observation. The data then were analyzed by reducing the data, displaying the data, and drawing conclusion. The result of the study shows that through the implementation of 3Ps (Provision, Protection, and Participation)-Based Educative Game Tool), early childhood’s language competence was developed through the questions and instructions including the theme of animal, fruit, vegetable, numbers, and shapes. Keywords— Language development; early childhood; childfriendly learning; Provision. Protection, and Participation (3Ps)
Dynamical decompactification from brane gases in eleven-dimensional supergravity

Brane gas cosmology provides a dynamical decompactification mechanism that could account for the number of spacetime dimensions we observe today. In this work we discuss this scenario taking into account the full bosonic sector of eleven-dimensional supergravity. We find new cosmological solutions that can dynamically explain the existence of three large spatial dimensions characterized by a universal asymptotic scaling behaviour and a large number of initially unwrapped dimensions. This type of solutions enlarges the possible initial conditions of the Universe in the Hagedorn phase and consequently can potentially increase the probability of dynamical decompactification from anisotropically wrapped backgrounds.
Hedge-Based Filtering Method for Semi-structure Documents

As a novel semi-structured language, XML has become the de facto standard of data exchange over the Internet, due to that XML is characterized by self- described, scalable and convenient for exchange. In order to filter the XML publishing events, a novel filtering method is presented with the optimized rewriting method and then, the proposed algorithm is proved by the algorithm analysis.