Miracle-dz/UniFAR-FTUs huggingface dataset:
Travel demand forecasting with stated choice data. : Swedish domestic long-distance trips.

The travel demand forecasting capability is affected by the model performance and is restricted by the available modes. The Sampers models being used in long distance travel demand forecasting doesn’t deal with nonlinearity and contains no travel service qualitative variables. The RP models can’t forecast the travel demand of the hypothetical mode of the high speed rail. Meanwhile, the value of time which is an important indicator in cost-benefits evaluation needs to be estimated in more specific way. Functional form improving method of Box-Cox transformation is proved to be efficient in dealing with nonlinearity and so does the piecewise function is effective in using discrete variables. Variable related travel service quality is proved to be a significant estimate in enriching model specification. The value of time is re-evaluated by taking into account its distribution. The mean values are sensitive to the model specified and the extent of self-selection has been analyzed by comparing the value of different current mode users with different alternatives Based on the stated choice survey about the high speed rail, the preference and sensitivity is revealed by binary Logit model estimation. The minor difference between X2000 and high speed rail and self-selection effect imply the little attractiveness of high speed rail for both train users and air users.
Automated Nonlinear System Modeling with Multiple Fuzzy Neural Networks and Kernel Smoothing

This paper, presents a novel identification approach using fuzzy neural networks. It focuses on structure and parameters uncertainties which have been widely explored in the literatures. The main contribution of this paper is that an integrated analytic framework is proposed for automated structure selection and parameter identification. A kernel smoothing technique is used to generate a model structure automatically in a fixed time interval. To cope with structural change, a hysteresis strategy is proposed to guarantee finite times switching and desired performance.
Flexible Radio Interface for NoC RF-Interconnect

This paper introduces flexible radio techniques inside integrated circuits in order to tackle the interconnect issue for many-core chips. We propose to take benefits from OFDMA for a RF-interconnect associated to a carrier allocation policy and adaptive modulation. A 20 GHz bandwidth is shared between 32 tile sets made of 32 tiles of 4 cores each, for a 4096 cores chip. We adopt a cognitive radio approach in order to dynamically share 1024 carriers, which avoids inter-cluster communication contention and decreases latency compared to conventional static approaches.
Outage performance analysis of two-way relay system with multi-antenna relay node

This paper presents an analytical study on the outage performance of amplify-and-forward (AF) two-way relay system with multi-antenna relay node (RN). Two major bidirectional protocols, i.e., two time slots multiple access broadcast (MABC) protocol and three time slots time division broadcast (TDBC) protocol, are considered. For both considerations, we first assume that instantaneous channel-state-information (CSI) is unavailable at RN, thus RN just simply uses the fixed relay gain derived from statistical CSI to scale the received signals before forwarding. We then consider the scenario where RN can obtain the instantaneous CSI to perform the zero-forcing (ZF) relay precoding. The closed-form expressions of outage probability are derived for all cases. Based on these expressions, the diversity-multiplexing tradeoff (DMT) is further obtained for the MABC protocol. The analytical results show that, for non-precoding MABC scheme, the diversity order is only 1, which is independent to the relay antenna number M. While for the ZF-precoding case, the diversity order of M - 1 can be obtained.
Network rigidity and metabolic engineering in metabolite overproduction

In order to enhance the yield and productivity of metabolite production, researchers have focused almost exclusively on enzyme amplification or other modifications of the product pathway. However, overproduction of many metabolites requires significant redirection of flux distributions in the primary metabolism, which may not readily occur following product deregulation because metabolic pathways have evolved to exhibit control architectures that resist flux alterations at branch points. This problem can be addressed through the use of some general concepts of metabolic rigidity, which include a means for identifying and removing rigid branch points within an experimental framework.
Continuous Task-speciic Categories for Disambiguation: Putting Lexical Constraints (back) in the Lexicon

Syntactic ambiguity resolution often appears to be guided by the use of lexical constraint information (e. A traditional linguistic framework of discrete syntactic categories can complicate the modeling of such lexical constraints. There is evidence that syntactic ambiguity resolution is exposure-based, i.e. present analyses are innuenced by past experiences (e.g. Mitchell and Cuetos (1991)). An important feature of such exposure-based models is that similar instances are recognized in order to be able to make the appropriate generalizations. We have developed a method to construct a continuous representation of lexical similarities { the Lexical Space { based on local (within several words to the right and left) distributional properties of words in a corpus. The distributional organization of LexSpace can be exploited for a task-speciic syntactic categorization or clustering of words with an arbitrary degree of granularity according to the demands of a speciic language processing task. In this paper we describe several models which perform a disambiguation task on the basis of learning from examples. We compare the use of syntactic representations of words from LexSpace with task-speciic generalizations inherent to the Example-based models. We consider two tasks, prepositional phrase attachment and direct object/sentence complement ambiguity resolution, and compare the generalization performance of the methods on unseen test material. The results suggest that Lexical Space provides us with rich lexical representations that can also be used for similarity-based analysis as required in exposure based strategies. Moreover, the LexSpace representation can be used as input to connectionist models. The Lexical Space representations were found to work successfully, and it was shown that the Example-based method generalizes to new test material with an accuracy (84.1%) that is equal to the best method known for this task in the literature (Collins and Brooks, 1995). However, these optimal results were not obtained with the Lexical Space method but with the Overlap IG metric.
REMO: A new protocol to refine full atomic protein models from C‐alpha traces by optimizing hydrogen‐bonding networks

Protein structure prediction approaches usually perform modeling simulations based on reduced representation of protein structures. For biological utilizations, it is an important step to construct full atomic models from the reduced structure decoys. Most of the current full atomic model reconstruction procedures have defects which either could not completely remove the steric clashes among backbone atoms or generate final atomic models with worse topology similarity relative to the native structures than the reduced models. In this work, we develop a new protocol, called REMO, to generate full atomic protein models by optimizing the hydrogen‐bonding network with basic fragments matched from a newly constructed backbone isomer library of solved protein structures. The algorithm is benchmarked on 230 nonhomologous proteins with reduced structure decoys generated by I‐TASSER simulations. The results show that REMO has a significant ability to remove steric clashes, and meanwhile retains good topology of the reduced model. The hydrogen‐bonding network of the final models is dramatically improved during the procedure. The REMO algorithm has been exploited in the recent CASP8 experiment which demonstrated significant improvements of the I‐TASSER models in both atomic‐level structural refinement and hydrogen‐bonding network construction. Proteins 2009. © 2009 Wiley‐Liss, Inc.
Sentiment Polarity Tagging Based on Nearby Words

In this paper, we will describe a way of detecting the polarity of adjectives in a certain text and after that, trying to detect how the polarity of the text as whole can be identified. Therefore, we will first check the hypothesis that adjectives which are used nearby other positive or negative adjectives also are (mostly) positive/negative. After that, we will try to define the polarity of the text as whole, based on the numbers of words with a positive/negative polarity. Here fore, we will first try to define some words from which people think the polarity is clear and after that, we will use the search engine AltaVista, to find out how often each of the adjectives in the texts are used nearby our defined positive and negative words. Based on these numbers we will first conclude which adjectives are positive or negative and then we try to define the polarity of the text as whole, based on the number of positive/negative adjectives.
The Supportable QOS Region of a Multiuser System with Log-Convex Interference Functions

We address the problem of interference coupling and achievability of SIR targets in a multiuser system. Interference is modeled by an axiomatic framework, with log-convex interference functions. There are efficient algorithms which perform optimization over the boundary of the SIR region, but they typically require that the boundary is achievable. We show that achievability is closely linked to the interference coupling in the system. This effect is already known from power control theory, where achievability is commonly ensured by assuming an irreducible coupling matrix. In this paper, we consider a more general interference model which is based on an axiomatic framework. In order to describe the interference coupling in the system, the concept of a dependency matrix is introduced. It is shown that the achievability of the boundary only depends on the combinatorial structure of this matrix. Necessary and sufficient conditions are derived.
A Comment on a Model of Financial Intermediation: Market Signalling in the Long Run

In the short run, efficient financial intermediaries with small initial wealth endowments may not have a sufficient stake in the market to persuade the market of their reliability. This paper demonstrates that the most efficient information producer may emerge as a credible intermediary in the long run. The presence of an informational technology obtainable for a publicly known entry cost is sufficient for the existence of the necessary enforcement mechanism. This allows for an efficient outcome even when investors can neither observe actual costs incurred by the intermediary nor its initial wealth.
Distance-based detection and prediction of outliers

A distance-based outlier detection method that finds the top outliers in an unlabeled data set and provides a subset of it, called outlier detection solving set, that can be used to predict the outlierness of new unseen objects, is proposed. The solving set includes a sufficient number of points that permits the detection of the top outliers by considering only a subset of all the pairwise distances from the data set. The properties of the solving set are investigated, and algorithms for computing it, with subquadratic time requirements, are proposed. Experiments on synthetic and real data sets to evaluate the effectiveness of the approach are presented. A scaling analysis of the solving set size is performed, and the false positive rate, that is, the fraction of new objects misclassified as outliers using the solving set instead of the overall data set, is shown to be negligible. Finally, to investigate the accuracy in separating outliers from inliers, ROC analysis of the method is accomplished. Results obtained show that using the solving set instead of the data set guarantees a comparable quality of the prediction, but at a lower computational cost.
Unbounded entanglement in nonlocal games

Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a simple two-party nonlocal game H, inspired by Lucien Hardy's paradox. In our game each player has only two possible questions and can provide bit strings of any finite length as answer. We exhibit a sequence of strategies which use entangled states in increasing dimension d and succeed with probability 1 - O(d-c) for some c ≥ 0:13. On the other hand, we show that any strategy using an entangled state of local dimension d has success probability at most 1 - Ω (d-2). In addition, we show that any strategy restricted to producing answers in a set of cardinality at most d has success probability at most 1 - Ω (d-2). Finally, we generalize our construction to derive similar results starting from any game G with two questions per player and finite answers sets in which quantum strategies have an advantage.
On the Design of High Speed Parallel CRC Circuits using DSP Algorithams

Error correction codes provide a mean to detect and correct errors introduced by the transmission channel. Basically there are two categories of codes a). Block codes and b). convolution codes. Both the codes introduce redundancy by adding parity symbols to the message data. Cyclic redundancy check (CRC) codes are the subset of the cyclic codes. The hardware implementation of a CRC is a simple linear feedback shift register. LFSR circuit is simple and can runs at very high clock speeds, but it suffers from the limitation that the stream must be of bit-serial. CRC architectures for the generator polynomial are developed using DSP algorithms such as pipelining, unfolding and retiming. CRC architectures are first pipelined to reduce the iteration bound by using novel look-ahead pipelining methods and then unfolded and retimed to design high-speed parallel circuits. High-Speed parallel CRC increases the speed or throughput rate up to 25% when compared to the other techniques and reduce the hardware cost. Keywords— Cyclic redundancy check (CRC), linear feedback shift register (LFSR), pipelining, retiming, unfolding.
A PROBABILISTIC MODEL FOR THE SURVIVABILITY OF CELLS

Consider n cells, of which some are target cells, and suppose that each cell has a weight. The cells are killed in a sequential manner, with each currently live cell being the next one killed with a probability proportional to its weight. We study the distribution of the number of cells that are alive at the moment when all the target cells have been killed.
Parties and leaders in the postreform house

Since the Second World War, congressional parties have been characterized as declining in strength and influence. Research has generally attributed this decline to policy conflicts within parties, to growing electoral independence of members, and to the impact of the congressional reforms of the 1970s. Yet the 1980s witnessed a strong resurgence of parties and party leadership-especially in the House of Representatives. Offering a concise and compelling explanation of the causes of this resurgence, David W. Rohde argues that a realignment of electoral forces led to a reduction of sectional divisions within the parties-particularly between the northern and southern Democrats-and to increased divergence between the parties on many important issues. He challenges previous findings by asserting that congressional reform "contributed" to, rather than restrained, the increase of partisanship. Among the Democrats, reforms siphoned power away from conservative and autocratic committee chairs and put control of those committees in the hands of Democratic committee caucuses, strengthening party leaders and making both party and committee leaders responsible to rank-and-file Democrats. Electoral changes increased the homogeneity of House Democrats while institutional reforms reduced the influence of dissident members on a consensus in the majority party. Rohde's accessible analysis provides a detailed discussion of the goals of the congressional reformers, the increased consensus among Democrats and its reinforcement by their caucus, the Democratic leadership's use of expanded powers to shape the legislative agenda, and the responses of House Republicans. He also addresses the changes in the relationship between the House majority and the president during the Carter and Reagan administrations and analyzes the legislative consequences of the partisan resurgence. A readable, systematic synthesis of the many complex factors that fueled the recent resurgence of partisanship, "Parties and Leaders" in the Postreform House is ideal for course use.
Congestion-Aware Adaptive Routing in 2D-Mesh Multicores

New CMOS processes offer cheaper but less reliable transistors. This trend foreshadows the apparition of processors consisting of hundreds and thousands of cores prone to defects. In this context, the performance of the core interconnect under faults will be critical. In this work, we propose the combination of a novel adaptive routing algorithm and several related router mechanisms, which firstly ensure message transfers under transient and permanent faults and second adapt to congestion in order to improve the interconnect performances. In effect, the widespread 2D mesh topology offers a high redundancy of routes. Hence, a fault-tolerant congestion-aware routing algorithm is able to improve substantially the interconnect efficiency under degraded conditions. Besides, the Virtual Channel allocation is optimized for performance, and a message truncation mechanism is added to cope with dynamic permanent and transient faults.
TCAD Based Analysis of Gate Leakage Current for High-k Gate Stack MOSFET

Scaling of metal-oxide-semiconductor transistors to smaller dimensions has been a key driving force in the IC industry. This work analysis the gate leakage current behavior of nano scale MOSFET based on TCAD simulation. The Sentaurus Simulator simulates the high-k gate stack structure of N-MOSFET for analysis purpose. The impact of interfacial oxide thickness on the gate tunneling current has been investigated as a function of gate voltages for a given equivalent oxide thickness (EOT) of 1.0 nm. It was reported in the results that interfacial oxide thickness plays an important role in reducing the gate leakage current. It is also observed that highk stack gated MOSFET exhibits improved performance in term of Off current and DIBL
Die neuen Liquiditätsvorschriften und die Durchführung der Geldpolitik in der Schweiz

The new liquidity requirements replaced a system characterized by several disadvantages. In public discussions of the new system, the introduction of a lagged reserve accounting regime did not attract much attention. Under certain conditions, a system with lagged reserve requirements may be expected to improve money control efficiency. However, there remain some doubts about the suitability of this approach in the Swiss case.
Fast and accurate plane segmentation in depth maps for indoor scenes

This paper deals with a scene pre-processing task - depth image segmentation. Efficiency and accuracy of several methods for depth map segmentation are explored. To meet real-time capable constraints, state-of-the-art techniques needed to be modified. Along with these modifications, new segmentation approaches are presented which aim at optimizing performance characteristics. They benefit from an assumption of human-made indoor environments by focusing on detection of planar regions. All methods were evaluated on datasets with manually annotated real environments. A comparison with alternative solutions is also presented.
Entropic and Displacement Interpolation: A Computational Approach Using the Hilbert Metric

Monge-Kantorovich optimal mass transport (OMT) provides a blueprint for geometries in the space of positive densities -- it quantifies the cost of transporting a mass distribution into another. In particular, it provides natural options for interpolation of distributions (displacement interpolation) and for modeling flows. As such it has been the cornerstone of recent developments in physics, probability theory, image processing, time-series analysis, and several other fields. In spite of extensive work and theoretical developments, the computation of OMT for large scale problems has remained a challenging task. An alternative framework for interpolating distributions, rooted in statistical mechanics and large deviations, is that of Schroedinger bridges (entropic interpolation). This may be seen as a stochastic regularization of OMT and can be cast as the stochastic control problem of steering the probability density of the state-vector of a dynamical system between two marginals. In this approach, however, the actual computation of flows had hardly received any attention. In recent work on Schroedinger bridges for Markov chains and quantum evolutions, we noted that the solution can be efficiently obtained from the fixed-point of a map which is contractive in the Hilbert metric. Thus, the purpose of this paper is to show that a similar approach can be taken in the context of diffusion processes which i) leads to a new proof of a classical result on Schroedinger bridges and ii) provides an efficient computational scheme for both, Schroedinger bridges and OMT. We illustrate this new computational approach by obtaining interpolation of densities in representative examples such as interpolation of images.
Optimal gains tuning of PI-fuzzy controllers

This paper presents a new methodology for tuning the gains of fuzzy proportional-integral controllers where the closed loop system performance is explicitly taken into account. The gains are found by solving a nonlinear constrained optimization problem considering the system's dynamics described by a nonlinear model, and including a set of constraints on gains, control actions and on the system outputs. Experimental results ilustrate the relevance of using the proposed tuning technique.
BIT at SemEval-2016 Task 1: Sentence Similarity Based on Alignments and Vector with the Weight of Information Content

This paper describes three unsupervised systems for determining the semantic similarity between two short texts or sentences submitted to the SemEval 2016 Task 1, all of which make use of only off-the-shelf software and data making them easy to replicate. Two systems achieved a similar Pearson correlation coefficient (0.64661 by simple vector, 0.65319 by word alignments). We include experiments on using our alignment based system on evaluation data from the 2014 and 2015 STS shared task. The results suggest that beyond the core similarity algorithm, other factors such as data preprocessing and use of domain-specific knowledge are also important to similarity prediction performance.