Miracle-dz/UniFAR-FTUs huggingface dataset:
Forage fish of the Pacific Rim as revealed by diet of a piscivorous seabird: synchrony and relationships with sea surface temperature

We tested the hypothesis of synchronous interannual changes in forage fish dynamics around the North Pacific Rim. To do this, we sampled forage fish communities using a seabird predator, the rhinoceros auklet (Cerorhinca mono- cerata), at six coastal study sites from Japan to California. We investigated whether take of forage fishes was related to local marine conditions as indexed by sea surface temperature (SST). SST was concordant across sites in the eastern Pacific, but inversely correlated between east and west. Forage fish communities consisted of anchovy (Engraulis spp.), sandlance (Ammodytes spp.), capelin (Mallotus spp.), and juvenile rockfish (Sebastes spp.), among others, and take of forage fish varied in response to interannual and possibly lower-frequency oceanographic variability. Take of primary forage species were significantly related to changes in SST only at the eastern sites. We found synchrony in interannual variation of primary forage fishes across several regions in the eastern Pacific, but no significant east-west correlations. Specifically in the Japan Sea, factors other than local SST or interannual variability may more strongly influence forage fishes. Predator diet sampling offers a fishery-independent, large-scale perspective on forage fish dynamics that may be difficult to obtain using conventional means of study. Resume´ : Nous testons l'hypothese qui veut qu'il y ait des changements interannuels synchrones dans les dynamiques des poissons fourrage autour de la bordure du Pacifique Nord. C'est pourquoi nous avons echantillonneles peuplements de poissons fourrage al'aide d'un oiseau marin predateur, le macareux rhinoceros (Cerorhinca monocerata), asix sites d'etude cotiers du Japon ala Californie. Nous avons verifiesi les captures de poissons fourrage sont reliees aux conditions
Accurate Nanoliter Liquid Characterization Up to 40 GHz for Biomedical Applications: Toward Noninvasive Living Cells Monitoring

This paper demonstrates an accurate liquid sensing technique, from 40 MHz to 40 GHz, which is suitable for the detection and quantification of very small contents of molecules, proteins, and for the noninvasive and contactless microwave investigation of living cells in their culture medium. The sensor is based on an interdigitated capacitor (IDC) with a microfluidic channel to confine the nanoliter-range liquid and is integrated with microtechnologies to be fully compatible with a massive parallelization at low cost. Both alcohol and biological aqueous solutions are precisely characterized, identified, and quantified in terms of capacitance and conductance's contrasts with respect to pure de-ionized water. Mixtures from 20% down to 1% of ethanol in water exhibit large capacitance's values of 110 and 7 fF at 11 GHz, respectively. Based on the high accuracy of such characterizations, the detection of very small traces of ethanol (down to 100 ppm) can be envisioned. As far as biomedical applications are targeted, we also demonstrate the potential of fetal bovine serum detection in aqueous solution down to 5% v/v. Finally, the sensor is evaluated with living B lymphoma cells suspension in their traditional biological medium. The in-liquid microwave measurement of less than 20 living cells is successfully performed and corresponds to a capacitance contrast of 5 fF at 3 GHz relative to the reference bio-medium. For low cells concentration, the sensor response is proportional to the number of cells on the IDC, which permits to envision cells quantification and proliferation monitoring with this microwave sensing technique.
Class, Exploitation, and Economic Rents: Reflections on Sørensen's “Sounder Basis”1

L'A. souscrit a l'analyse developpee par A. Sorensen en matiere de classe sociale, mais, dans la definition de l'exploitation, il propose d'ajouter, a la simple possession d'actifs generant des loyers, les avantages qui impliquent l'appropriation de la force de travail de l'exploite par l'exploiteur
The density of small tight junction pores varies among cell types and is increased by expression of claudin-2

Epithelial tight junctions contain size- and charge-selective pores that control the paracellular movement of charged and noncharged solutes. Claudins influence the charge selectivity and electrical resistance of junctions, but there is no direct evidence describing pore composition or whether pore size or density differs among cell types. To characterize paracellular pores independent of influences from charge selectivity, we profiled the `apparent permeabilities' (Papp) of a continuous series of noncharged polyethylene glycols (PEGs) across monolayers of five different epithelial cell lines and porcine ileum. We also characterized Papp of high and low electrical resistance MDCK cell monolayers expressing heterologous claudins. Papp profiling confirms that the paracellular barrier to noncharged solutes can be modeled as two distinct pathways: high-capacity small pores and a size-independent pathway allowing flux of larger solutes. All cell lines and ileum share a pore aperture of radius 4 Å. Using Papp of a PEG of radius 3.5 Å to report the relative pore number provides the novel insight that pore density along the junction varies among cell types and is not necessarily related to electrical resistance. Expression of claudin-2 results in a selective increase in pore number but not size and has no effect on the permeability of PEGs that are larger than the pores; however, neither knockdown of claudin-2 nor overexpression of several other claudins altered either the number of small pores or their size. We speculate that permeability of all small solutes is proportional to pore number but that small electrolytes are subject to further selectivity by the profile of claudins expressed, explaining the dissociation between the Papp for noncharged solutes and electrical resistance. Although claudins are likely to be components of the small pores, other factors might regulate pore number.
Stable Pose Estimation Using Ransac with Triple Point Feature Hash Maps and Symmetry Exploration

In this paper, a scene analyser is introduced which is based on Ransac (Random Sampling Consensus). This scene analysis approach is developed for robotic applications in particular, where poses of objects need to be estimated accurately that robots can grasp objects reliably. For assembly or manipulation purposes even an approximate pose estimation is not sufficient. For many objects appearance based similar poses exist, which influence the assembly strategy strongly when objects are gripped. Thus, robust pose estimation is required which is achieved by using triple point feature hash maps. This new feature vector is compared to two other feature vectors obtained from point pairs. It is shown that object poses can be estimated more precisely with roughly equal computation times with the new feature vector. Furthermore, in order to increase stability, symmetries are exploited and included into the entire scene analysis pipeline. The pipeline of the introduced scene analysis approach is illustrated and evaluated with various scenarios. The method presented here is successfully used for assembly applications.
Using SQL to Build New Aggregates and Extenders for Object- Relational Systems

User-defined Aggregates (UDAs) provide a versatile mechanism for extending the power and applicability of Object-Relational Databases (O-R DBs). In this paper, we describe the AXL system that supports an SQLbased language for introducing new UDAs. AXL is easy to learn and use for database programmers because it preserves the constructs, programming paradigm and data types of SQL (whereas there is an ‘impedance mismatch’ between SQL and the procedural languages of user-defined functions currently used in O-R DBs). AXL will also inherit the benefits of database query languages, such as scalability, data independence and parallelizability. In this paper, we show that, while adding only minimal extensions to SQL, AXL is very powerful and capable of expressing complex algorithms efficiently. We demonstrate this by coding data mining functions and other advanced applications that, previously, had been a major problem for SQL databases. Due to its flexibility, SQL-compatibility and ease of use, the AXL approach offers a better extensibility mechanism, in several application domains, than the function libraries now offered by commercial O-R DBs under names such as Datablades or DB-Extenders. † Los Angeles CA 90095, USA, hxwang|zaniolo@cs.ucla. edu Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment. Proceedings of the 26th VLDB Conference, Cairo, Egypt, 2000.
An efficient group‐oriented (t,n) threshold signature scheme with message linkage

Abstract In 1999, Chen (1999) proposed several signature schemes in his graduate thesis. One is a group‐oriented (t,n) threshold signature scheme in which the (t,n) threshold signature is based on an RSA scheme. Although it has advantages, including message recovery, lower cost for transmission, and message linkage, it requires a great amount of time for the modulo exponentiation computation. In this article, we propose an improved scheme, which is more efficient than the one proposed by Chen both in the signature generation and the verification.
Simultaneous Localisation and Mapping ( SLAM ) : Part II State of the Art

This tutorial provides an introduction to the Simultaneous Localisation and Mapping (SLAM) method and the extensive research on SLAM that has been undertaken. Part I of this tutorial described the essential SLAM problem. Part II of this tutorial (this paper) is concerned with recent advances in computational methods and in new formulations of the SLAM problem for large scale and complex
Test bench for software development of object-oriented processor

HISC (High-level Instruction Set Computer) is proposed to provide hardware support for OOP. It applies the concept of object-orientation in the architecture and provides special instructions for object manipulation. An operating system is under developing for HISC. It divided into several modules by using the object-oriented paradigm. It includes some special modules for object-manipulation such as object management and garbage collection which traditional operating system do not support.In order to do the functional verification of each module, a test bench is needed. Its aims are to ease the effort to written the testing program and to simulate the working environment. It can make it easier to evaluate if an algorithm is suitable for HISC or not. In this paper, we discuss the design of the test bench. The architecture of the system will be described, together with the implementation of the modules and the pluggable modules architecture.
Multi-Pair Cognitive Two-Way Relaying and Power Allocation under Imperfect CSI

In this paper, we present a robust joint relay precoder design and transceiver power allocation for a cognitive radio network under imperfect channel state information. The secondary (or cognitive) network consists of multiple pairs of single-antenna transceiver nodes and a non-regenerative two-way relay with multiple antennas which aids the intra-pair communication process of the transceiver nodes. The secondary nodes share the spectrum with a licensed primary user (PU) while guaranteeing that the interference to the PU receiver is maintained below a specified threshold. The proposed robust design is based on the minimization of the sum mean-square error (MSE) of the transceiver nodes under constraints on the secondary users' transmit powers and interference to PU the receiver. Though the original problem is non-convex, we show that the proposed design can be solved using alternating optimization of convex subproblems which have analytic or efficient numerical solutions. We illustrate the performance of the proposed designs through some selected numerical simulations.
The Real Time Correction of Stereoscopic Images: From the Serial to a Parallel Treatment

The correction of the stereoscopic images is a task which consists in replacing acquired images by other images having the same properties but which are simpler to use in the other stages of stereovision. The use of the pre-calculated tables, built during an off line calibration step, made it possible to carry out the off line stereoscopic images rectification. An improvement of the built tables made it possible to carry out the real time rectification. In this paper, we describe an improvement of the real time correction approach so it can be exploited for a possible implementation on an FPGA component. This improvement holds in account the real time aspect of the correction and the available resources that can offer the FPGA Type Stratix 1S40F780C5.
Interpolation in Lie Groups and Homogeneous Spaces

We consider interpolation in Lie groups and homogeneous spaces. Based on points on the manifold together with tangent vectors at (some of) these points, we construct Hermite interpolation polynomials. If the points and tangent vectors are produced in the process of integrating an ordinary diierential equation on a Lie group or a homogeneous space, we use the truncated inverse of the diierential of the exponential mapping and the truncated Baker-Campbell-Hausdorr formula to relatively cheaply construct an interpolation polynomial. Much eeort has lately been put into research on geometric integration, i.e. the process of integrating a diierential equation in such a way that the connguration space is respected by the numerical solution. Some of these methods may be viewed as generalizations of classical methods, and we investigate the construction of intrinsic dense output devices as generalizations of the continuous Runge-Kutta methods.
The membrane: transertion as an organizing principle in membrane heterogeneity

The bacterial membrane exhibits a significantly heterogeneous distribution of lipids and proteins. This heterogeneity results mainly from lipid–lipid, protein–protein, and lipid–protein associations which are orchestrated by the coupled transcription, translation and insertion of nascent proteins into and through membrane (transertion). Transertion is central not only to the individual assembly and disassembly of large physically linked groups of macromolecules (alias hyperstructures) but also to the interactions between these hyperstructures. We review here these interactions in the context of the processes in Bacillus subtilis and Escherichia coli of nutrient sensing, membrane synthesis, cytoskeletal dynamics, DNA replication, chromosome segregation, and cell division.
Harvesting discourse strategies for rapid prototyping of tailored information delivery systems

In the process of designing tailored information delivery systems based on natural language generation technology, linguistic resources need to be developed. One of such resources is a set of discourse strategies, the abstract structures that specify how to construct a coherent text to achieve a specific communicative goal. Discourse strategies, however, prove to be difficult to develop, in part due to their abstractness. In this paper, we describe a graphical tool which allows users to annotate documents to indicate its various elements and how they relate to each other. The annotations can then be used to generate a first draft of the discourse strategies automatically. The tool is presented in the context of the Myriad delivery platform which aims at facilitating the rapid development of tailored information delivery systems.
Clustering XML Documents Based on the Weight of Frequent Structures

The previous clustering methods of XML document group XML documents with similar structures, measuring structural similarity and distance between XML documents. In this paper, however, we propose a novel clustering method for XML documents using the weight of frequent structures in XML documents, considering that an XML document as a transaction and the extracted structures from XML documents as items of a transaction. Our experiment results show the high speed and cluster cohesion of our clustering method.
Brief and high-interest video summary generation: evaluating the AT&T labs rushes summarizations

Video summarization is essential for the user to understand the main theme of video sequences in a short period, especially when the volume of the video is huge and the content is highly redundant. In this paper, we present a video summarization system, built for the rushes summarization task in TRECVID 2008. The goal is to create a video excerpt including objects and events in the video with minimum redundancy and duration (up to 2% of the original video). We first segment a video into shots and then apply a multi-stage clustering algorithm to eliminate similar shots. Frame importance values that depend on both the temporal content variation and the spatial image salience are used to select the most interesting video clips as part of the summarization. We test our system with two output configurations - a dynamic playback rate and at the native playback rate - as a tradeoff between ground truth inclusion rate and ease of browsing. TRECVID evaluation results show that our system achieves a good inclusion rate and verify that the created video summarization is easy to understand.
Learning supervised embeddings for large scale sequence comparisons

Similarity-based search of sequence collections is a core task in bioinformatics, one dominated for most of the genomic era by exact and heuristic alignment-based algorithms. However, even efficient heuristics such as BLAST may not scale to the data sets now emerging, motivating a range of alignment-free alternatives exploiting the underlying lexical structure of each sequence. In this paper, we introduce SuperVec, a novel supervised approach to learning sequence embeddings. Our method extends earlier Representation Learning (RL) based methods to include jointly contextual and class-related information for each sequence during training. This ensures that related sequence fragments have proximal representations in the target space, better reflecting the structure of the domain. Such representations may be used for downstream machine learning tasks or employed directly. Here, we apply SuperVec embeddings to a sequence retrieval task, where the goal is to retrieve sequences with the same family label as a given query. The SuperVec approach is extended further through H-SuperVec, a tree-based hierarchical method which learns embeddings across a range of feature spaces based on the class labels and their exclusive and exhaustive subsets. Experiments show that supervised learning of embeddings based on sequence labels using SuperVec and H-SuperVec provides a substantial improvement in retrieval performance over existing (unsupervised) RL-based approaches. Further, the new methods are an order of magnitude faster than BLAST for the database retrieval task, supporting hybrid approaches in which SuperVec rapidly filters the collection so that only potentially relevant records remain, allowing slower, more accurate methods to be executed quickly over a far smaller dataset. Thus, we may achieve faster query processing and higher precision than before. Finally, for some problems, direct use of embeddings is already sufficient to yield high levels of precision and recall. Extending this work to encompass weaker homology is the subject of ongoing research.
Cooperative Spectrum Sensing Using DF Cooperative Diversity Protocol in Cognitive Radio

In cognitive radio networks, secondary users are allowed to access the under-utilized spectrum and opportunistically transmit whenever no primary signals are detected. So these unlicensed users need to monitor spectrum accurately to detect the presence of the licensed users. In this paper, we exploit a cooperative spectrum sensing between two secondary users to improve the detection performance when one of the users is standing on the decodability boundary of the primary user, which is difficult to detect the presence of this licensed user. We develop this cooperative spectrum sensing with decode-and-forward (DF) diversity protocol, and make a comparison with amplify-and-forward (AF) protocol in terms of detection probability. We illustrate that DF protocol has better performance than AF. Then, under DF diversity protocol, we extend to the cooperative spectrum sensing among a group of secondary users, which is illustrated to have a better detection performance.
Network-based Summarization of Citation Summaries

Applying graph-based methods in text analysis has become popular in the past decade. In this paper, we introduce the concept of latent networks, give evidence for the existence of an underlying densification model, and find the graph that best represents a lexical corpus for the task of summarization. We use these ideas to summarize single scientific articles using a mathematically sound clustering cutoff.
Political Environment in The Equality of Journalism Culture

Political dynamics may influence the perspective and behaviour of journalists. Therefore research on relationship between politics and journalism is very important, especially due to press as a democratic institution. The research scrutinizes politics in relation to journalism culture. Political factors are observed from three dimensions: the role of state, political consensus, and individual political preference of the journalists. Dealing with journalism culture, the study focuses on the notion of equality as one of public communication values.
Multi-keyword based sorted querying over encrypted cloud data

Cloud computing creates a versatile workspace in which anything can be stored and referenced at any time. Adopting this technology means all the sensitive information must be encrypted prior to storage to overcome the security issues. The problem lies in querying the encrypted data. The existing system supports only exact keyword search which makes effective searching a very challenging task. Multi-keyword based Sorted Querying provide an effective mechanism for searching over encrypted cloud data by maintaining the keyword privacy and by tolerating the spelling mistakes and keyboarding error in the user input. This solution supports multi-keyword querying where the searching result is sorted according to the relevance criteria of occurrence of keywords in input sequence.
Envy-ratio and average-nash social welfare optimization in multiagent resource allocation

The resource allocation problem deals with distributing a number of indivisible, nonshareable resources among a set of agents so as to optimizing social welfare. Assuming all agents to have additive utility functions and focusing on two particular measures of social welfare, envy-ratio and average-Nash product, we investigate the two resulting optimization problems. We give the first hardness of approximation result for a factor better than 3/2 for the problem of minimum envy-ratio, and we design an FPTAS for the case when the number of agents is fixed. For the special case when the number of agents and the number of resources are equal, we show that the problem is even solvable in polynomial time. Next, we propose the first approximation algorithm for maximizing the average-Nash product in the general case, and we prove that this problem admits a PTAS if all agents' utility functions are the same. Finally, we study the problem of how hard it is to design a truthful mechanism for these two optimization problems.