Miracle-dz/UniFAR-FTUs huggingface dataset:
DIRECT - a multiprocessor organization for supporting relational data base management systems

The design of DIRECT, a multiprocessor organization for supporting relational data base management systems is presented. DIRECT has a MIMD (multiple instruction stream, multiple data stream) architecture. It can simultaneously support both intra-query and inter-query concurrency. The number of processors assigned to a query is dynamically determined by the priority of the query and the size of the relations it references. The size of a relation is not limited to that of the associative memory as in some previous data base machines. Concurrent updates are controlled through address translation tables which are maintained by a controlling processor. DIRECT is being implemented using LSI-11/03 microprocessors and CCD memories which are searched in an associative manner. A novel cross-point switch is used to connect the LSI-11 processors to the CCD memories. While cross-point switches have proven too expensive for use in general purpose parallel processors, their application in DIRECT demonstrates that these switches can be successfully used in specialized applications.
Instruction Based Learning: how to instruct a personal robot to find HAL.

Future domestic robots will need to adapt to the special needs of their users and to their environment. Programming by natural language will be a key method enabling computer languagenaive users to instruct their robots. Its main advantages over other learning methods are speed of acquisition and ability to build high level symbolic rules into the robot. This paper describes the design of a practical system that uses unconstrained speech to teach a vision-based robot how to navigate in a miniature town. The robot knows a set of primitive navigation procedures that the user can refer to when giving route instructions. Since the user is likely to refer to a procedure that is not pre-programmed in the robot, the system must be able to learn it. This paper investigates how to make the learning process possible. In particular, a method is proposed to fasten the choice of an initial set of primitives to the natural human speech chunking. Moreover, the use of Instruction-Based Learning (IBL) imposes a number of constraints on the design of robotics systems and knowledge representation. These issues are developed in the paper and proposed solutions described.
Similarity Group-by Operators for Multi-Dimensional Relational Data

The SQL group-by operator plays an important role in summarizing and aggregating large datasets in a data analytics stack. While the standard group-by operator, which is based on equality, is useful in several applications, allowing similarity aware grouping provides a more realistic view on real-world data that could lead to better insights. The Similarity SQL-based Group-By operator (SGB, for short) extends the semantics of the standard SQL Group-by by grouping data with similar but not necessarily equal values. While existing similarity-based grouping operators efficiently realize these approximate semantics, they primarily focus on one-dimensional attributes and treat multi-dimensional attributes independently. However, correlated attributes, such as in spatial data, are processed independently, and hence, groups in the multi-dimensional space are not detected properly. To address this problem, we introduce two new SGB operators for multi-dimensional data. The first operator is the clique (or distance-to-all) SGB, where all the tuples in a group are within some distance from each other. The second operator is the distance-to-any SGB, where a tuple belongs to a group if the tuple is within some distance from any other tuple in the group. Since a tuple may satisfy the membership criterion of multiple groups, we introduce three different semantics to deal with such a case: (i) eliminate the tuple, (ii) put the tuple in any one group, and (iii) create a new group for this tuple. We implement and test the new SGB operators and their algorithms inside PostgreSQL. The overhead introduced by these operators proves to be minimal and the execution times are comparable to those of the standard Group-by. The experimental study, based on TPC-H and a social check-in data, demonstrates that the proposed algorithms can achieve up to three orders of magnitude enhancement in performance over baseline methods developed to solve the same problem.
Collaborative Low-Rank Subspace Clustering

In this paper we present Collaborative Low-Rank Subspace Clustering. Given multiple observations of a phenomenon we learn a unified representation matrix. This unified matrix incorporates the features from all the observations, thus increasing the discriminative power compared with learning the representation matrix on each observation separately. Experimental evaluation shows that our method outperforms subspace clustering on separate observations and the state of the art collaborative learning algorithm.
A Fine-grained Task Based Parallel Programming Paradigm of Gauss-Jordan Algorithm

Large scale matrix inversion has been widely used in many scientific research domains. As a classical method of large matrix inversion, block-based Gauss-Jordan (BbGJ) algorithm has aroused great concern among many researchers. Many people have developed parallel versions of BbGJ. But large granularity based task parallelism (intra-iterative data dependence based tasks parallelism) disables mapping more tasks on computing resources simultaneously. As a result, the performance of those parallel versions degrades when running on the Grid platform consisting of a lot of heterogeneous PCs and workstations. So this paper presents a fine-grained tasks based parallel BbGJ algorithm (Max-par BbGJ) in which both intra-iterative and inter-iterative based data dependences are considered. According to the analysis of data dependence in BbGJ, a global flag is adopted to control all the data dependence during the process of algorithm execution. The flag can be presented as a three-tuple. At the beginning, all the logical values of those three-tuples are set as false. When the logical value of the three-tuple becomes true, the tasks decided by the three-tuple can be executed immediately and simultaneously. Max-par BbGJ aims at achieving maximum parallelism of different parts of tasks. To evaluate its performance, YML a new high-level parallel programming tool, is introduced for its series of good features, such as components reuse, extreme ease-of-use and platform-independence. Grid environments are based on Grid'5000 platform in France. Experiments illustrate that the better performance can be achieved through making more tasks executed simultaneously in the Max-par BbGJ. The time needed using Max-par BbGJ can save about 30% than that using conventional one. At the same time, experiments also validate that though a little overhead existing, YML is still an acceptable and easy-to-use tool for scientific researchers especially for those non-professionals to make large scale computing.
Special Issue on Self-organisation in Mobile Networking AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks

SUMMARY In this paper, we describe AntHocNet, an algorithm for routing in mobile ad hoc networks. It is a hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. The algorithm is based on the nature-inspired ant colony optimisation framework. Paths are learned by guided Monte Carlo sampling using ant-like agents communicating in a stigmergic way. In an extensive set of simulation experiments, we compare AntHocNet with AODV, a reference algorithm in the field. We show that our algorithm can outperform AODV on different evaluation criteria. AntHocNet’s performance advantage is visible over a broad range of possible network scenarios, and increases for larger, sparser and more mobile networks. Copyright # 2005 AEIT.
Optimal beam arrangement for stereotactic body radiation therapy delivery in lung tumors

Abstract Purpose. To compare the different beam arrangement and delivery techniques for stereotactic body radiation therapy (SBRT) of lung lesions using the criteria of Radiation Therapy Oncology Group (RTOG) 0236 protocol. Material and methods. Thirty-seven medically inoperable lung cancers were evaluated with various planning techniques including multiple coplanar multiple static beams, multiple non-coplanar static beams and arc delivery. Twelve plans were evaluated for each case, including five plans using coplanar fixed beams, six plans using non-coplanar fixed beams and one plan using arc therapy. These plans were compared using the target prescription isodose coverage, high and low dose volumes, and critical organ dose-volume limits. Results. The prescription isodose coverage, high dose evaluation criteria and dose to critical organs were similar among treatment delivery techniques. However, there were differences in low dose criteria, especially in the ratio of the volume of 50% isodose of the prescription dose to the volume of planning treatment volume (R50%). The R50% in plans using non-coplanar static beams was lower than other plans in 30 of 37 cases (81%). Conclusion. Based on the dosimetric criteria outlined in RTOG 0236, the treatment technique using non-coplanar static beams showed the most preferable results for SBRT of lung lesions.
Renewable energy prosumers clustering towards target aggregated prosumption profiles based on recursive predictions

This paper introduces a decision making framework for aggregating Microgrids and/or other small energy producers and consumers (i.e. prosumers) into groups, whose purpose is to participate in liberalized electricity markets as single entities. The aggregator is able to offer aggregated Renewable Energy Source (RES) units to the wholesale market, in ways that are more efficient than individual prosumers acting alone. We first present the proposed framework and information flow among the involved market entities. We then focus on the problem of finding the set of prosumers whose aggregate prosumption profile can best fit a given target pattern requested by a market actor. We propose a linear autoregressive forecasting algorithm and a genetic clustering algorithm, which can easily adapt to the requirements set by the various use cases. Numerical results show that the aggregator can produce clusters in real time improving the average deviation from the target pattern by up to 50%.
Homology of generalized Steinberg varieties and Weyl group invariants

Let G be a complex, connected, reductive algebraic group. In this paper we show analogues of the computations by Borho and MacPherson of the invariants and anti-invariants of the cohomology of the Springer fibres of the cone of nilpotent elements, N, of Lie(G) for the Steinberg variety Z of triples. Using a general specialization argument we show that for a parabolic subgroup Wp x W Q of W x W the space of Wp x W Q -invariants and the space of Wp x W Q -anti-invariants of H 4n (Z) are isomorphic to the top Borel-Moore homology groups of certain generalized Steinberg varieties introduced by Douglass and Rohrle (2004). The rational group algebra of the Weyl group W of G is isomorphic to the opposite of the top Borel-Moore homology H 4n (Z) of Z, where 2n = dim N. Suppose Wp x W Q is a parabolic subgroup of W x W. We show that the space of Wp x W Q -invariants of H 4n (Z) is e Q QWe p , where ep is the idempotent in the group algebra of Wp affording the trivial representation of Wp and e Q is defined similarly. We also show that the space of Wp x W Q -anti-invariants of H 4n (Z) is ∈ Q QW∈ p , where ep is the idempotent in the group algebra of Wp affording the sign representation of Wp and ∈ Q is defined similarly.
Conditional Entropies as Over-Segmentation and Under-Segmentation Metrics for Multi-Part Image Segmentation

Conditional entropies as over-segmentation and under-segmentation metrics for multi-part image segmentation" (2011). Abstract In this paper, we define two conditional entropy measures for performance evaluation of general image segmentation. Given a segmentation label map and a ground truth label map, our measures describe their compatibility in two ways. The first one is the conditional entropy of the segmentation given the ground truth, which indicates the oversegmentation rate. The second one is that of the ground truth given the segmentation, which indicates the under-segmentation rate. The two conditional entropies indicate the trade-off between smaller and larger granularities like false positive rate and false negative rate in ROC, and precision and recall in PR curve. Our measures are easy to implement, and involve no threshold or other parameter, have very intuitive explanation and many good theoretical properties, e.g., good bounds, monotonicity, continuity. Experiments show that our measures work well on Berkeley Image Segmentation Benchmark using three segmentation algorithms, Efficient Graph-Based segmentation, Mean Shift and Normalized Cut. We also give an asymmetric similarity measure based on the two entropies and compared it with Variation of Information. The comparison revealled that our method has advantages in many situations.We also checked the coarse-to-fine compatibility of segmentation results with changing parameters and ground truths from different annotators. Abstract In this paper, we define two conditional entropy measures for performance evaluation of general image seg-mentation. Given a segmentation label map and a ground truth label map, our measures describe their compatibility in two ways. The first one is the conditional entropy of the seg-mentation given the ground truth, which indicates the over-segmentation rate. The second one is that of the ground truth given the segmentation, which indicates the under-segmentation rate. The two conditional entropies indicate the trade-off between smaller and larger granularities like false positive rate and false negative rate in ROC, and precision and recall in PR curve. Our measures are easy to implement, and involve no threshold or other parameter, have very intuitive explanation and many good theoretical properties, e.g., good bounds, monotonicity, continuity. Experiments show that our measures work well on Berkeley Image Segmentation Benchmark using three segmentation algorithms, Efficient Graph-Based segmentation, Mean Shift and Normalized Cut. We also give an asymmetric similarity measure based on the two entropies and compared it with Variation of Information. The comparison revealled that our method has advantages in many situations. We also checked the coarse-to-fine compatibility of …
Polyethylenimine–DNA solid particles for gene delivery

Polyethylenimine (PEI), a cationic polymer, was used to develop a non-viral vector for gene delivery. A simple, reproducible process is described with which to condense plasmid DNA with PEI. When prepared at the optimum charge ratio of 6.3 ( ± ; PEI:DNA, 5:1 w/w), PEI–DNA complexes were 30–60 nm in diameter and excluded intercalating dyes from the plasmid DNA. The particles were stable for more than one month at 4°C with respect to size and transfection activity. PEI–condensed DNA transfected a broad range of murine and human tumor cell lines (B16, Lewis Lung, SK-OV-3 and LS180) in vitro in the presence of fetal calf serum. Intraperitoneal administration of PEI–condensed DNA resulted in significant gene expression in a human ovarian cancer peritoneal xenograft model.
Auditory space representation: from perception to action

We investigated the representation of azimuthal directions of sound sources under two different conditions. In the first experiment, we examined the participants’ mental representation of sound source directions via similarity judgments. Auditory stimuli originating from sixteen loudspeakers positioned equidistantly around the participant were presented in pairs, with the first stimulus serving as the anchor, and thereby providing the context for the second stimulus. For each pair of stimuli, participants had to rate the sound source directions as either similar or dissimilar. In the second experiment, the same participants categorized single sound source directions using verbal direction labels (front, back, left, right, and combinations of any two of these). In both experiments, the directions within the front and back regions were more distinctively categorized than those on the sides, and the sides’ categories included more directions than those of the front or back. Furthermore, we found evidence that the left-right decision comprises the basic differentiation of the surrounding regions. These findings illustrate what seem to be central features of the representation of directions in auditory space. This chapter is a revised version of Campos, M.C. , Hermann, T. , Schack, T. , and Blasing, B. (2013). Representing the egocentric auditory space: Relationships of surrounding region concepts. Acta Psychologica, 142(3), 410-418.
The architectural costs of streaming I/O: A comparison of workstations, clusters, and SMPs

We investigate resource usage while performing streaming I/O by contrasting three architectures, a single workstation, a cluster, and an SMP, under various I/O benchmarks. We derive analytical and empirically-based models of resource usage during data transfer, examining the I/O bus, memory bus, network, and processor of each system. By investigating each resource in detail, we assess what comprises a well-balanced system for these workloads. We find that the architectures we study are not well balanced for streaming I/O applications. Across the platforms, the main limitation to attaining peak performance is the CPU, due to lack of data locality. Increasing processor performance (especially with improved block operation performance) will be of great aid for these workloads in the future. For a cluster workstation, the I/O bus is a major system bottleneck, because of the increased load placed on it from network communication. A well-balanced cluster workstation should have copious I/O bus bandwidth, perhaps via multiple I/O busses. The SMP suffers from poor memory-system performance; even when there is true parallelism in the benchmark, contention in the shared-memory system leads to reduced performance. As a result, the clustered workstations provide higher absolute performance for streaming I/O workloads.
Influence of dexamethasone on efficacy of ceftriaxone and vancomycin therapy in experimental pneumococcal meningitis

Using a rabbit model of meningitis, we sought to determine whether concomitant use of dexamethasone affects the penetration and efficacy of ceftriaxone or vancomycin in cerebrospinal fluid. Rabbits were inoculated with a penicillin-sensitive strain of Streptococcus pneumoniae and treated with ceftriaxone or vancomycin with or without dexamethasone. In the ceftriaxone-treated groups, no statistically significant differences were seen between the group treated with dexamethasone and that without dexamethasone; however, in the vancomycin-treated groups we found statistically significant lower cerebrospinal fluid vancomycin levels at 2 h in the dexamethasone-treated rabbits and differences in bacterial killing.
Early Exposure to Volatile Anesthetics Impairs Long-Term Associative Learning and Recognition Memory

Background Anesthetic exposure early in life affects neural development and long-term cognitive function, but our understanding of the types of memory that are altered is incomplete. Specific cognitive tests in rodents that isolate different memory processes provide a useful approach for gaining insight into this issue. Methods Postnatal day 7 (P7) rats were exposed to either desflurane or isoflurane at 1 Minimum Alveolar Concentration for 4 h. Acute neuronal death was assessed 12 h later in the thalamus, CA1-3 regions of hippocampus, and dentate gyrus. In separate behavioral experiments, beginning at P48, subjects were evaluated in a series of object recognition tests relying on associative learning, as well as social recognition. Results Exposure to either anesthetic led to a significant increase in neuroapoptosis in each brain region. The extent of neuronal death did not differ between groups. Subjects were unaffected in simple tasks of novel object and object-location recognition. However, anesthetized animals from both groups were impaired in allocentric object-location memory and a more complex task requiring subjects to associate an object with its location and contextual setting. Isoflurane exposure led to additional impairment in object-context association and social memory. Conclusion Isoflurane and desflurane exposure during development result in deficits in tasks relying on associative learning and recognition memory. Isoflurane may potentially cause worse impairment than desflurane.
Determination of Parameters Considering Magnetic Nonlinearity in Solid Core Transverse Flux Linear Motor for Dynamic Simulation

This paper presents methods to calculate motor parameters considering magnetic nonlinearity in solid core transverse flux linear motors (TFLM) for dynamic simulation. The magnetic field characteristics of the machine are analyzed by using 3-D equivalent magnetic circuit network (3-D EMCN) method, and parameters for dynamic simulation such as linkage flux, thrust, attraction force, and core loss are calculated by using the magnetic field analysis results. The calculated parameters are used as a form of lookup table in the dynamic simulation model. The accuracy of the method is examined by the comparison of input currents which are calculated by using the dynamic simulation model and measured for an example TFLM.
Rapid Tyrosine Phosphorylation of Neuronal Proteins Including Tau and Focal Adhesion Kinase in Response to Amyloid-β Peptide Exposure: Involvement of Src Family Protein Kinases

The increased production of amyloid β-peptide (Aβ) in Alzheimer's disease is acknowledged to be a key pathogenic event. In this study, we examined the response of primary human and rat brain cortical cultures to Aβ administration and found a marked increase in the tyrosine phosphorylation content of numerous neuronal proteins, including tau and putative microtubule-associated protein 2c (MAP2c). We also found that paired helical filaments of aggregated and hyperphosphorylated tau are tyrosine phosphorylated, indicating that changes in the phosphotyrosine content of cytoplasmic proteins in response to Aβ are potentially an important process. Increased tyrosine phosphorylation of cytoskeletal and other neuronal proteins was specific to fibrillar Aβ25–35 and Aβ1–42. The tyrosine phosphorylation was blocked by addition of the Src family tyrosine kinase inhibitor 4-amino-5-(4-chlorophenyl)-7(t-butyl)pyrazol(3,4-d)pyramide (PP2) and the phosphatidylinositol 3-kinase inhibitor LY 294002. Tyrosine phosphorylation of tau and MAP2c was concomitant with an increase in the tyrosine phosphorylation and subsequent putative activation of the non-receptor kinase, focal adhesion kinase (FAK). Immunoprecipitation of Fyn, a member of the Src family, from Aβ25–35-treated neurons showed an increased association of Fyn with FAK. Aβ treatment of cells also stimulated the sustained activation of extracellular regulated kinase-2, which was blocked by addition of PP2 and LY 294002, suggesting that FAK/Fyn/PI3-kinase association is upstream of mitogen-activated protein (MAP) kinase signaling in Aβ-treated neurons. This cascade of signaling events contains the earliest biochemical changes in neurons to be described in response to Aβ exposure and may be critical for subsequent neurodegenerative changes.