Miracle-dz/UniFAR-FTUs huggingface dataset:
Wide-angle camera technology for automotive applications: a review

The development of electronic vision systems for the automotive market is a strongly growing field, driven in particular by customer demand to increase the safety of vehicles both for drivers and for other road users, including vulnerable road users (VRUs), such as pedestrians. Customer demand is matched by legislative developments in a number of key automotive markets; for example Europe, Japan and the US are in the process of introducing legislation to aid in the prevention of fatalities to VRUs, with emphasis on the use of vision systems. The authors discuss some of the factors that motivate the use of wide-angle and fish-eye camera technologies in vehicles. The authors describe the benefits of using wide-angle lens camera systems to display areas of a vehicle's surroundings that the driver would, otherwise, be unaware of (i.e. a vehicle's blind-zones). However, although wide- angle optics provide greater fields of view, they also introduce undesirable effects, such as radial distortion, tangential distortion and uneven illumination. These distortions have the potential to make objects difficult for the vehicle driver to recognise and, thus, potentially have a greater risk of accident. The authors describe some of the methods that can be employed to remove these unwanted effects, and digitally convert the distorted image to the ideal and intuitive rectilinear pin-hole model.
Anomalous interaction of spatial solitons in photorefractive media

The nature of the forces between mutually coherent interacting solitons has been discussed in the literature for both temporal as well as spatial solitons [1-2]. It has been established that in the case of homogenous self-focusing media the interaction force depends on the relative phase of the solitons. In particular, two in-phase solitons attract while out-of-phase solitons repel. Phase-sensitive attraction, repulsion, and fusion of spatial solitons have been demonstrated in experiments with various nonlinear media including liquids [3], glass waveguides [4], atomic vapours [5], and photorefractive crystals [6].
Image coding for content-based retrieval

We develop a new coding technique for content-based retrieval of images and text documents which minimizes a weighted sum of the expected compressed file size and query response time. Files are coded into three parts: (1) a header consisting of concatenated query term codewords, (2) locations of the query terms, and (3) the remainder of the file. The coding algorithm specifies the relative position and codeword length of all query terms. Our approach leads to a progressive refinement retrieval by successively reducing the number of searched files as more bits are read. It also supports progressive transmission.
Determinants of Electricity Consumption Intensity in China: Analysis of Cities at Subprovince and Prefecture Levels in 2009

China has experienced great social and economic vicissitudes that caused the vast complexity and uncertainty for electricity consumption. This paper attempts to identify the main determinants of the electricity consumption intensity by using the data from Chinese cities at subprovince and prefecture levels in 2009. The key category factors, including urban morphology, industrial structure, regulation context, urbanization degree, price, natural condition, and resource endowment, are abstracted and the influence of these determinants is evaluated by adopting the finite mixture models. The variation of each determinant across regions, the comparative weights of all the factors, and the detailed classifications of the cities are reported for facilitating the understanding of electricity consumption in China. The corresponding policies for electricity administration are addressed as well.
Optimal combination of sampled network measurements

IP network traffic is commonly measured at multiple points in order that all traffic passes at least one observation point. The resulting measurements are subsequently joined for network analysis. Many network management applications use measured traffic rates (differentiated into classes according to some key) as their input data. But two factors complicate the analysis. Traffic can be represented multiple times in the data, and the increasing use of sampling during measurement means some classes of traffic may be poorly represented. In this paper, we show how to combine sampled traffic measurements in way that addresses both of the above issues. We construct traffic rate estimators that combine data from different measurement datasets with minimal or close to minimal variance. This is achieved by robust adaptation to the estimated variance of each constituent. We motivate the method with two applications: estimating the interface-level traffic matrix in a router, and estimating network-level flow rates from measurements taken at multiple routers.
Ideal Codes Over Separable Ring Extensions

In this paper, an application of the theoretical algebraic notion of a separable ring extension in the realm of cyclic convolutional codes or, more generally, ideal codes, is investigated. It is worked under very mild conditions that cover all previously known as well as new non-trivial examples. It is proved that ideal codes are direct summands, as left ideals, of the underlying non-commutative algebra, in analogy with cyclic block codes. This implies, in particular, that they are generated by a non-commutative idempotent polynomial. Hence, by using a suitable separability element, an efficient algorithm for computing one of such idempotents is designed. We show that such an idempotent generator polynomial can be used to get information on the free distance of the convolutional code.
The research on multipath routing algorithm of wireless mesh network

Aiming at the characteristics of wireless mesh network, this paper presents a dynamic toplogy algorithm based on the multipath adaptive flow distribution. This algorithm dynamically distributes data flow ratio to each path according to the weights of quality path. The simulation results show that this algorithm guarantees the stability of packet transmission and improves the delivery rate.
Dribble Deficit: A novel method to measure dribbling speed independent of sprinting speed in basketball players

ABSTRACT Basketball tests assessing dribbling speed predicated on total performance times are influenced by sprinting speed. This study examines an approach termed Dribble Deficit to counter this limitation by examining the relationships between sprinting and dribbling speed during linear and change-of-direction (COD) tasks measured using total performance time and Dribble Deficit. Ten semi-professional basketball players completed linear sprints and COD sprints with and without dribbling. Dribble Deficit was calculated as the difference between the best time for each dribbling trial and corresponding non-dribbling trial for linear and COD sprints. Large to very large significant relationships (P < 0.05) were evident between linear sprint and dribble times (R = 0.64–0.77, R2 = 0.41–0.59), and between COD sprint and dribble times (R = 0.88, R2 = 0.77). Conversely, trivial-small relationships were evident between linear sprint time and linear Dribble Deficit (R = 0.01–0.15, R2 = 0.00–0.02). A non-significant, moderate, negative relationship was observed between COD sprint time and COD Dribble Deficit (R = −0.45, R2 = 0.20). These findings indicate Dribble Deficit provides a more isolated measure of dribbling speed than tests using total performance times. Basketball practitioners may use Dribble Deficit to measure dribbling speed independent of sprint speed in test batteries.
Design and dimensioning of logical survivable topologies against multiple failures

In IP-over-WDM networks, protection can be offered at the optical layer or at the IP layer. Today, it is well acknowledged that synergies need to be developed between the IP and optical layers in order to optimize the resource utilization and to reduce the costs and the energy consumption of future networks. In this paper, we study the design of logical survivable topologies for service recovery against multiple failures, including SRLG-shared risk link group-failures in IP-over-WDM networks. We propose a new optimization model, called SURLOG_CGILP, based on a column generation path formulation. It is highly scalable and allows the exact solution of several benchmark instances, which have only been solved with the help of heuristics so far. In the numerical experiments, we investigate the dimensioning of the physical links assuming IP restoration against multiple-link failures. We observe that the redundancy ratios (recovery over primary ratios for the bandwidth requirements) that are obtained are similar to the redundancy ratios reported for optical protection.
Dynamic Window-constrained Scheduling of Loss and Delay Constrained Traac Streams

This paper describes an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), designed to meet the service constraints on packets from multiple, network-bound media streams with diierent performance objectives. Using only two attributes, a deadline and a loss-tolerance per packet stream, DWCS: (1) can limit the number of late packets over nite numbers of consecutive packets in loss-tolerant or delay-constrained, heterogeneous traac streams, (2) does not require a-priori knowledge of the worst-case loading from multiple streams to establish the necessary bandwidth allocations to meet per-stream delay and loss-constraints, and (3) can exhibit both fairness and unfairness properties when necessary. In fact, DWCS can perform fair-bandwidth allocation, static priority (SP) and earliest-deadline rst (EDF) scheduling. We show: (1) the eeectiveness of DWCS using a streaming video application, running over ATM, and (2) how DWCS can be eeciently implemented to provide service guarantees to hundreds of streams. We also compare the costs of diierent algorithm implementations, including an approximation algorithm, which trades service quality for speed of execution.
Effects of feedback, mobility and index of difficulty on deictic spatial audio target acquisition in the horizontal plane

We present the results of an empirical study investigating the effect of feedback, mobility and index of difficulty on a deictic spatial audio target acquisition task in the horizontal plane in front of a user. With audio feedback, spatial audio display elements are found to enable usable deictic interac-tion that can be described using Fitts law. Feedback does not affect perceived workload or preferred walking speed compared to interaction without feedback. Mobility is found to degrade interaction speed and accuracy by 20%. Participants were able to perform deictic spatial audio target acquisition when mobile while walking at 73% of their pre-ferred walking speed. The proposed feedback design is ex-amined in detail and the effects of variable target widths are quantified. Deictic interaction with a spatial audio display is found to be a feasible solution for future interface designs.
GODEL ' S INCOMPLETENESS THEOREM : A COMPUTER · BASED COURSE IN ELEMENTARY PROOF THEORY

PHILOSOPHY 167 is a computer-based course in elementary proof theory at Stanford University. The main purpose of the course is to introduce (advanced) undergraduates to Gbdel's incompleteness theorems (Gbdel, 1931). These theorems are still, almost fifty years after their discovery, a.mong the philosophically most striking and mathematically most important results in modern logic. They undermined a widely shared belief concerning the extent of the axiomatic method, and they refuted a particular, clearly formulated program in the foundations of mathematics (Hilbert's program). This background is sketched in section I of our article, where we also discuss the basic strategy of Gbdel's proofs. The special problems inherent in a detailed presentation of Gbdel's proofs are met in two ways:
TempUnit: A bio-inspired neural network model for signal processing

We have developed and tested a novel artificial neural network for the processing of temporal signals. The working of the units (TempUnit) is based on the mechanism of temporal summation as observed in biological neurons. Contrary to traditional neural networks, the TempUnit optimizes its basis function by supervised learning. The model was tested on cortical and associated muscular (EMG) recordings from the behaving primate. The TempUnit showed a 2.3 times better performance in mapping spiking to EMG activity than a time delay multi-layer perceptron. The TempUnit model demonstrated correct capacities for inverse computation. Indeed, we calculated biologically compatible activities for 3 cortical neurons from EMG recordings. Data compression capacity of the TempUnit was tested on audio data and compared to the MP3 compression standard. For a similar reproduction quality, we found a compression rate 5 times higher than in MP3.
Modelling and Solving QoS Composition Problem Using Fuzzy DisCSP

Web service compositions have attracted considerable efforts in the context of supporting enterprise application integrations. For a composite service, in addition to its functional requirements, QoS requirements are important and deserve a special attention. The central question to a QoS composition problem is how to compose a service from different subcomponent services so that its overall QoS can satisfy certain requirements. In this paper, we propose an agent-based method using fuzzy distributed constraint satisfaction problem (fuzzy DisCSP) techniques to solve this problem. We show that by using the composition structures, local constraints can be constructed and used with DisCSP. We also present an a new algorithm called the fuzzy constraint satisfaction algorithm for distributed environment (FADE) to solve the problem and discuss our experiment in building a prototypical system to prove the feasibility of our approach
What Is a Cognitive System

The theme for this year’s symposium, The Airspace as a Cognitive System , stimulates the questions; what is a Cognitive System and in what sense can we characterize the airspace as a cognitive system? I discuss these questions by reviewing ideas promoted in discussions of distributed cognition. I also contrast the concept of distributed with the similar concepts of shared and joint as the are discussed in the literature on cognitive systems, team training and situation awareness. I conclude that the notions of distributed cognition and joint cognitive systems offer considerable leverage for addressing the anticipated design challenges in airspace systems but that we need to avoid the distortions engendered by the pervasive techno-centric emphasis in systems design in favor of a human-centric emphasis that will aid development of robust and effective systems.
Textual Document Mining Using a Graphical Interface

In this paper we present an approach in order to help the user extracting advanced information from a document set. The approach is based on the application of different mining modules that collaborate in order to provide graphical views to the user. These views correspond to a graphical summarization on document dimension correlations. To proceed, the documents are first represented according to different concept hierarchies that correspond to the document dimensions. Then, the resulting representation are mined using different modules depending on the user's goal.
Cancelable Fusion of Face and Ear for Secure Multi-Biometric Template

Biometric fusion to achieve multimodality has emerged as a highly successful new approach to combat problems of unimodal biometric system such as intraclass variability, interclass similarity, data quality, non-universality, and sensitivity to noise. The authors have proposed new type of biometric fusion called cancelable fusion. The idea behind the cancelable biometric or cancelability is to transform a biometric data or feature into a new one so that the stored biometric template can be easily changed in a biometric security system. Cancelable fusion does the fusion of multiple biometric trait in addition it preserve the properties of cancelability. In this paper, the authors present a novel architecture for template generation within the context of the cancelable multibiometric fusion. The authors develop a novel cancelable biometric template generation algorithm using cancelable fusion, random projection and transformation-based feature extraction and selection. The authors further validate the performance of the proposed algorithm on a virtual multimodal face and ear database.
Component Recycling for Agile Methods

Given the increasing size and complexity of today's systems, reusability is an important quality aspect. In this work we consider development and reuse of reusable components in the context of agile methods. To distinguish the proposed approach from the more established systematic reuse approaches we call our proposal component recycling instead of component reuse. For the development of recyclable components we show how inherent characteristics of agile methods, particularly the provision of useful and complete partial components during the lifecycle, can be used constructively for the development of components. These components are placed in a component repository for later recycling. The requirements implemented at each iteration serve as the design rationale for the components and distinguish earlier components from their later versions providing tracing.
Coagulation Factor IX for Hemophilia B Therapy 

Factor IX is a zymogen enzyme of the blood coagulation cascade. Inherited absence or deficit of the IX functional factor causes bleeding disorder hemophilia B, which requires constant protein replacement therapy. Reviewed herein are the current state in the manufacturing of FIX, improved variants of the recombinant protein for therapy, transgenic organisms for obtaining FIX, and the advances in the gene therapy of hemophilia B.
Consensus-based Distributed Particle Filtering With Distributed Proposal Adaptation

We develop a distributed particle filter for sequential estimation of a global state in a decentralized wireless sensor network. A global state estimate that takes into account the measurements of all sensors is computed in a distributed manner, using only local calculations at the individual sensors and local communication between neighboring sensors. The paper presents two main contributions. First, the likelihood consensus scheme for distributed calculation of the joint likelihood function (used by the local particle filters) is generalized to arbitrary local likelihood functions. This generalization overcomes the restriction to exponential-family likelihood functions that limited the applicability of the original likelihood consensus (Hlinka et al., “Likelihood consensus and its application to distributed particle filtering,” IEEE Trans. Signal Process., vol. 60, pp. 4334-4349, Aug. 2012). The second contribution is a consensus-based distributed method for adapting the proposal densities used by the local particle filters. This adaptation takes into account the measurements of all sensors, and it can yield a significant performance improvement or, alternatively, a significant reduction of the number of particles required for a given level of accuracy. The performance of the proposed distributed particle filter is demonstrated for a target tracking problem.
Separation of human adipocytes by size: hypertrophic fat cells display distinct gene expression

Enlarged adipocytes are associated with insulin resistance and are an independent predictor of type 2 diabetes. To understand the molecular link between these diseases and adipocyte hypertrophy, we developed a technique to separate human adipocytes from an adipose tissue sample into populations of small cells (mean 57.6±3.54 pm) and large cells (mean 100.1±3.94 pm). Microarray analysis of the cell populations separated from adipose tissue from three subjects identified 14 genes, of which five immune‐related, with more than fourfold higher expression in large cells than small cells. Two of these genes were serum amyloid A (SAA) and transmembrane 4 L six family member 1 (TM4SF1). Real‐time RT‐PCR analysis of SAA and TM4SF1 expression in adipocytes from seven subjects revealed 19‐fold and 22‐fold higher expression in the large cells, respectively, and a correlation between adipocyte size and both SAA and TM4SF1 expression. The results were verified using immunohistochemistry. In comparison with 17 other human tissues and cell types by microarray, large adipocytes displayed by far the highest SAA and TM4SF1 expression. Thus, we have identified genes with markedly higher expression in large, compared with small, human adipocytes. These genes may link hypertrophic obesity to insulin resistance/type 2 diabetes. —Jernås, M. , Palming, J., Sjöholm, K. , Jennische, E. , Svensson, P.‐A. , Gabrielsson, B. G. , Levin, M. , Sjögren, A. , Rudemo, M. , Lystig, T. C. , Carlsson, B. , Carlsson, L. M. S. , Lönn, M. Separation of human adipocytes by size: hypertrophic fat cells display distinct gene expression. FASEB J. 20, E832–E839 (2006)
On the Computation of the Hansen Coefficients

The Hansen coefficients are one of the most important tools in the analytical or semi-analytical methods of celestial mechanics. The problem of efficient computation was investigated in detail in many papers, but this subject is still open and to date there are not standard algorithms to generate the Hansen coefficients with accuracy and good computation time. Although the analytical expressions are known through their accuracy, the formulation by recurrent relations was preferred due to their stability and applicability in the case when a large number of the Hansen coefficients are needed. In this paper we turn our attention to the polynomial approximations and we present a method to generate the polynomials associated to the Hansen coefficients and their derivatives in the particular case used in expression of disturbing function due to central-body. Using the recurrent formulas corresponding to this particular case, we define difference equations and, by their iteration, we generate the polynomials. By computational tests, we compare our polynomial approximations for the Hansen coefficients and their derivatives with the recurrent solutions in order to prove the non-regression of the accuracy and the gain in computation time.
AN EFFICIENT SIGNALING METHOD OVER MIMO BROADCAST SYSTEMS WITH MULTIPLE RECEIVE ANTENNAS

A simple signaling method for multi-antenna broad- cast channels is proposed. This method converts the interference matrix - but not necessarily the channel matrix - to a lower- triangular form. Dirty paper coding is used to cancel the remaining interference. The proposed scheme offers several desirable features in terms of: (i) accommodating users with different number of receive antennas, (ii) providing fairness and quality-of-service (QoS), (iii) requiring low feedback rate. The simulation results indicate that the achieved sum-rate is close to the sum-capacity of the underlying broadcast channel. An asymptotic analysis shows that the diversity order of the j th data stream, 1 • jM is equal to NK(M i j + 1), where M , N , and K indicate the number of transmit antennas, the number of receive antennas, and the number of users, respectively. Furthermore, it is shown that the throughput of this scheme scales as M log log(K) and asymptotically (K i! 1) tends to the sum-capacity of the MIMO broadcast channel.