Miracle-dz/UniFAR-FTUs huggingface dataset:
Legal Liability When Individuals Have Moral Concerns

We incorporate normative motivations into the economic model of accidents and tort rules. The social norm is that one should avoid harming others and should compensate if nevertheless harm is caused. To some extent, this is internalized through intrinsic moral concerns; moreover, those thought not to adhere to the norm are met with social disapproval. Moral and reputational concerns are not strong enough, however, for injurers to willingly compensate their victims. Absent legal liability, normative concerns induce precautions to prevent harm but precautions are then socially inefficient. By contrast, perfectly enforced legal liability crowds out informal incentives completely (e.g., individuals causing harm suffer no stigma) but precautions are then socially efficient. Under imperfectly enforced legal liability, formal legal sanctions and normative concerns are complements and interact to induce more precautions than under no-liability.
A Database Engine for Flexible Real-Time Available-to-Promise

Recent publications discuss a paradigm shift in RDBMS development: away from a "one size fits all" approach towards application specific database engines. This discussion can also be applied to the field of real-time available- to-promise (ATP) applications. Current state of the art real-time ATP applications at enterprise-scale level offer a real-time checking mechanism, but they are inflexible when it e.g. comes to a rescheduling of already promised goods (backorder processing). This paper outlines the characteristics of real-time ATP and proposes a conceptual draft for a column-oriented main memory real-time ATP database engine. That engine enables real-time order rescheduling through on-the-fly data aggregation for every processed customer request.
Optical conductivity of the Hubbard model at finite temperature.

The optical conductivity, [sigma]([omega]), of the two-dimensional one-band Hubbard model is calculated at finite temperature using exact diagonalization techniques on finite clusters. The in-plane dc resistivity, [rho][sub [ital a][ital b]], is also evalauted. We find that at large [ital U]/[ital t] and temperature [ital T], [rho][sub [ital a][ital b]] is approximately linear with temperature. We also observed that [sigma]([omega]) displays charge excitations, a midinfrared (MIR) band, and a Drude peak. The combination of the Drude peak and the MIR oscillator strengths leads to a conductivity that decays slower than 1/[omega][sup 2] at energies smaller than the insulator gap near half filling.
Paths to terahertz CMOS integrated circuits

A 140-GHz fundamental mode VCO in 90-nm CMOS and a 410-GHz push-push VCO in 45-nm CMOS, and a 125-GHz Schottky diode frequency doubler, a 50-GHz phase locked loop with a frequency doubled output at 100 GHz, a 180-GHz Schottky diode detector and a 700-GHz plasma wave detector in 130-nm CMOS have been demonstrated. Based on these, paths to terahertz CMOS circuits are suggested.
Activation of signalling by the activin receptor complex

Activin exerts its effects by simultaneously binding to two types of p rotein serine/threonine kinase receptors, each type existing in various isoforms. Using the ActR-IB and ActR-IIB receptor isoforms, we have investigated the mechanism of activin receptor activation. ActR-IIB are phosphoproteins with demonstrable affinity for each other. However, activin addition strongly promotes an interaction between these two proteins. Activin binds directly to ActR-IIB, and this complex associates with ActR-IB, which does not bind ligand on its own. In the resulting complex, ActR-IB becomes hyperphosphorylated, and this requires the kinase activity of ActR-IIB. Mutation of conserved serines and threonines in the GS domain, a region just upstream of the kinase domain in ActR-IB, abrogates both phosphorylation and signal propagation, suggesting that this domain contains phosphorylation sites required for signalling. ActR-IB activation can be mimicked by mutation of Thr-206 to aspartic acid, which yields a construct, ActR-IB(T206D), that signals in the absence of ligand. Furthermore, the signalling activity of this mutant construct is undisturbed by overexpression of a dominant negative kinase-defective ActR-IIB construct, indicating that ActR-IB(T206D) can signal independently of ActR-IIB. The evidence suggests that ActR-IIB acts as a primary activin receptor and ActR-IB acts as a downstream transducer of activin signals.
Clinical outcomes of gastric polyps and neoplasms in patients with familial adenomatous polyposis

Abstract Background and study aims Familial adenomatous polyposis (FAP) is an autosomal dominant syndrome caused by a germline mutation in the adenomatous polyposis coli (APC) gene, characterized by the presence of more than 100 adenomatous polyps in the colorectum. The upper gastrointestinal tract is an extracolonic site for malignancy in patients with FAP. The frequency of death in Japanese patients with FAP because of gastric cancer is 2.8 % and that because of colon cancer is 60.6 %. Few studies have reported upper gastrointestinal diseases in patients with FAP. In the present study, we investigated the clinical outcomes of patients with FAP diagnosed with gastric neoplasms. Patients and methods We enrolled 80 patients with FAP who underwent esophagogastroduodenoscopy from October 1997 to December 2011. We investigated patient characteristics, endoscopic findings of gastric lesions, treatment outcomes, and long-term courses. Results Fundic gland polyposis was observed in 51 patients (64 %) and gastric neoplasms in 22 patients (28 %), including 20 with non-invasive and 2 with invasive neoplasm. Of the 26 neoplasms, 11 were treated by endoscopic resection (ER) and 4 by surgical resection. Metachronous gastric neoplasms were observed in 7 patients (15 lesions) and treated by ER, except for in 1 patient. No patients died of gastric lesions during a median follow-up period of 6.5 years (range, 0 – 14). Conclusion Because gastric lesions including gastric cancers in patients with FAP did not cause any deaths, they can be considered to have favorable prognoses. Early detection of gastric neoplasms through an appropriate follow-up interval may have contributed to these good outcomes.
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree

In this paper, we study a survivable network design problem on directed graphs, 2-Connected Directed Steiner Tree (2-DST): given an $n$-vertex weighted directed graph, a root $r$, and a set of $h$ terminals $S$, find a min-cost subgraph $H$ that has two edge/vertex disjoint paths from $r$ to any $t\in S$. 2-DST is a natural generalization of the classical Directed Steiner Tree problem (DST), where we have an additional requirement that the network must tolerate one failure. No non-trivial approximation is known for 2-DST. This was left as an open problem by Feldman et al., [SODA'09; JCSS] and has then been studied by Cheriyan et al. [SODA'12; TALG] and Laekhanukit SODA'14]. However, no positive result was known except for the special case of a $D$-shallow instance [Laekhanukit, ICALP'16]. We present an $O(D^3\log D\cdot h^{2/D}\cdot \log n)$ approximation algorithm for 2-DST that runs in time $O(n^{O(D)})$, for any $D\in[\log_2h]$. This implies a polynomial-time $O(h^\epsilon \log n)$ approximation for any constant $\epsilon>0$, and a poly-logarithmic approximation running in quasi-polynomial time. We remark that this is essentially the best-known even for the classical DST, and the latter problem is $O(\log^{2-\epsilon}n)$-hard to approximate [Halperin and Krauthgamer, STOC'03]. As a by product, we obtain an algorithm with the same approximation guarantee for the $2$-Connected Directed Steiner Subgraph problem, where the goal is to find a min-cost subgraph such that every pair of terminals are $2$-edge/vertex connected.
Title : Framework for computer vision in distributed resource constrained environments

Face detection is one of the most popular areas of computer vision partly due to its many applications such as surveil lance, human-computer interaction and biometrics. Recent developments in distributed wireless systems offer new embedded platforms for vision that are ch aracterized by limitations in processing power, memory, bandwidth and available p ower. Migrating traditional face detection algorithms to this new e nvironment requires taking into consideration these additional constraints. In this chapter, we investigate how image compression, a key processing step in man y resource-constrained environments, affects the classification performanc e of face detection systems. Towards that end, we explore the effects of three w ll known image compression techniques, namely JPEG, JPEG2000 and S PIHT on face detection based on support vector machines and Adaboost casca de cl ssifiers (ViolaJones). We also examine the effects of H.264/MPEG-4 AVC video compression on Viola-Jones face detection.
Ehicle T Racking Using K Alman F Ilter and F Eatures

Vehicle tracking has a wide variety of applications. The image resolution of the video available from most traffic camera system is low. In many cases for tracking multi object, distinguishing them from another isn’t easy because of their similarity. In this paper we describe a method, for tracking multiple objects, where the objects are vehicles. The number of vehicles is unknown and varies. We detect all moving objects, and for tracking of vehicle we use the kalman filter and color feature and distance of it from one frame to the next. So the method can distinguish and tracking all vehicles individually. The proposed algorithm can be applied to multiple moving objects.
Efficient Frequent Pattern Mining in Web Log

Semantic Web Mining aims at combining the two fast- developing research areas Semantic Web and Web Mining. The idea is to improve, on the one hand, the results of Web Mining by exploiting the new semantic structures in the Web; and to make use of Web Mining, on the other hand, for building up the Semantic Web. Frequent pattern mining is an important research area in the field of web data mining with wide range of applications. One of them is to use frequent pattern discovery methods in Web log data. The aim of discovering frequent patterns in Web log data is to obtain information about the navigational behaviour of the users. In this paper we give road map of semantic web and web mining and we present P and T tree based pattern mining approaches for the Web usage mining. Our experiment shows that P and T tree based pattern mining approaches is give better performance than existing one. The massive uses of the Internet have made automatic knowledge extraction from web log files a necessity. Information providers are interested in techniques that could learn web user's information needs and preferences. This can be used to improve the effectiveness of their web sites by adapting the information structure of the sites to the users' behaviour (1). However, it is hard to find appropriate tools for analysing raw web log data to retrieve significant and useful information. Currently, there are several generic web log analysis tools but most of them are disliked by their users and considered too slow, inflexible, expensive, difficult to maintain or very limited in the results they can provide. Recently, the advent of data mining techniques (4) for discovering usage patterns from Web data (a.k.a. web log mining or web usage mining) indicates that these techniques can be a viable alternative to traditional decision-making tools. Web usage mining is the application of data mining techniques to discover usage patterns from Web data, in order to understand and better serve the needs of Web-based applications. Web usage mining consists of three phases, namely pre-processing, pattern discovery, and pattern analysis (5).
National Debt in the History of Macroeconomic Growth Theory

The fact that Japanese government keeps much national debt and issues more and more every year is well-known all over the world nowadays. Even in the country, people are discussing the burden of this national debt loudly. Of course, some follows the wrong belief and the others make their opinion on any economic logic. One purpose of this paper is to make some suggestions to this situation of Japan’s from the viewpoint of macroeconomic growth theory. Though even the economists including classic ones had also discussed the burden of national debt till the 1950s, it was Modigliani who introduced the problem into the field of macroeconomic growth theory for the first time. His model was so simple that it could not derive a full implication from the framework. The model, however, gave the perspective into the following development. Diamond developed the idea of Modigliani and reached the complete model with which an economist treated the questions of national debt. This was overlapping generations framework. National Debt in the History of Macroeconomic Growth Theory
Human Cytomegalovirus Nuclear Egress Proteins Ectopically Expressed in the Heterologous Environment of Plant Cells are Strictly Targeted to the Nuclear Envelope

In all eukaryotic cells, the nucleus forms a prominent cellular compartment containing the cell’s nuclear genome. Although structurally similar, animal and plant nuclei differ substantially in details of their architecture. One example is the nuclear lamina, a layer of tightly interconnected filament proteins (lamins) underlying the nuclear envelope of metazoans. So far no orthologous lamin genes could be detected in plant genomes and putative lamin-like proteins are only poorly described in plants. To probe for potentially conserved features of metazoan and plant nuclear envelopes, we ectopically expressed the core nuclear egress proteins of human cytomegalovirus pUL50 and pUL53 in plant cells. pUL50 localizes to the inner envelope of metazoan nuclei and recruits the nuclear localized pUL53 to it, forming heterodimers. Upon expression in plant cells, a very similar localization pattern of both proteins could be determined. Notably, pUL50 is specifically targeted to the plant nuclear envelope in a rim-like fashion, a location to which coexpressed pUL53 becomes strictly corecruited from its initial nucleoplasmic distribution. Using pUL50 as bait in a yeast two-hybrid screening, the cytoplasmic re-initiation supporting protein RISP could be identified. Interaction of pUL50 and RISP could be confirmed by coexpression and coimmunoprecipitation in mammalian cells and by confocal laser scanning microscopy in plant cells, demonstrating partial pUL50-RISP colocalization in areas of the nuclear rim and other intracellular compartments. Thus, our study provides strong evidence for conserved structural features of plant and metazoan nuclear envelops and identifies RISP as a potential pUL50-interacting plant protein.
Normalized Neural Representations of Complex Odors

The olfactory system removes correlations in natural odors using a network of inhibitory neurons in the olfactory bulb. It has been proposed that this network integrates the response from all olfactory receptors and inhibits them equally. However, how such global inhibition influences the neural representations of odors is unclear. Here, we study a simple statistical model of the processing in the olfactory bulb, which leads to concentration-invariant, sparse representations of the odor composition. We show that the inhibition strength can be tuned to obtain sparse representations that are still useful to discriminate odors that vary in relative concentration, size, and composition. The model reveals two generic consequences of global inhibition: (i) odors with many molecular species are more difficult to discriminate and (ii) receptor arrays with heterogeneous sensitivities perform badly. Comparing these predictions to experiments will help us to understand the role of global inhibition in shaping normalized odor representations in the olfactory bulb.
New Technology, New Information Privacy: Social-Value-Oriented Information Privacy Theory

Today’s innovative technologies offer remarkable advantages in our daily lives, but they also give rise to concerns that these technological advancements will adversely impact individuals’ privacy. The traditional notions of information privacy were based on personal control over data about oneself, an antiqued notion in a time where pervasive surveillance has rendered it nearly impossible for individuals to protect information privacy on their own. Key privacy concerns arise because it is nearly impossible to be left out of the intertwined digital and Internet world. Those who choose not to use the Internet, smartphones, tablet computers, electronic mail and online social network platforms, nevertheless remain trapped in the inescapable digital net, with others able to track their personal data.This essay includes suggestions for reconstructing traditional privacy theories. The traditional notice-and-choice principle has failed to protect the information privacy. Privacy should be determined by both individuals’ subjective feelings and objective social norms. The government has a constitutional obligation to protect the right to privacy by constructing basic information privacy protection principles. Furthermore, this essay proposes an approach to constructing a social-value-oriented information privacy theory. Among others, in determining the context of privacy, if no social precedents are available, the particular social activity’s consequences, purposes, and values may first be identified, and then these results may be used to trace back to the starting point and consider how to regulate social activities.
An Evaluation of Multiple Approaches For Database Federation in Life Science

Between technological breakthrough and new computational approaches, the amount of biological data is increasing explosively. Till to 2007, there are 968 biological databases. To provide biologists central and uniform access to all kinds of data stored in biological databases becomes a critical research To minimize disruption of current operation, maintain local autonomy and handle heterogeneities, federation databases has been proposed as an ideal solution. This paper looks into this situation and reports on our experience with trying multiple approaches for biological database integration. It discusses the trade-offs among performance, support for heterogeneity, robustness and scalability. Of significance, is the discovery that the most flexible approach -Web Services performs very competitively.
PARASITE LOCAL ADAPTATION IN A GEOGRAPHIC MOSAIC

Abstract A central prediction of the geographic mosaic theory of coevolution is that coevolving interspecific interactions will show varying degrees of local maladaptation. According to the theory, much of this local maladaptation is driven by selection mosaics and spatially intermingled coevolutionary hot and cold spots, rather than a simple balance between gene flow and selection. Here I develop a genetic model of host-parasite coevolution that is sufficiently general to incorporate selection mosaics, coevolutionary hot and cold spots, and a diverse array of genetic systems of infection/resistance. Results from this model show that the selection mosaics experienced by the interacting species are an important determinant of the sign and magnitude of local maladaptation. In some cases, this effect may be stronger than a previously described effect of relative rates of parasite and host gene flow. These results provide the first theoretical evidence that selection mosaics and coevolutionary hot and cold spots per se determine the magnitude and sign of local maladaptation. At the same time, however, these results demonstrate that coevolution in a geographic mosaic can lead to virtually any pattern of local adaptation or local maladaptation. Consequently, empirical studies that describe only patterns of local adaptation or maladaptation do not provide evidence either for or against the theory.
Tecnoprinl MICROSENSOR MODELING

Sensors convert physical or chemical mcasurands into electronic signals. Microsensors arc manufactured using microelectronic processing technologies. The goal is to develop batch-fabricated sensors interfaced with microprocessors or application specific integrated circuits. Device modeling is becoming an essential tool for microsensor design and analysis. This new field of microsensor modeling is reviewed in this paper. Model equations and boundary conditions are presented along with numerical procedures and selected results.
A Perturbative reanalysis of N=4 supersymmetric Yang-Mills theory

The finiteness properties of the supersymmetric Yang–Mills theory are reanalyzed both in the component formulation and using superfields, in order to discuss some subtleties that emerge in the computation of gauge dependent quantities. The one-loop corrections to various Green functions of elementary fields are calculated. In the component formulation it is shown that the choice of the Wess–Zumino gauge, that is standard in supersymmetric gauge theories, introduces ultraviolet divergences in the propagators at the one-loop level. Such divergences are exactly canceled when the contributions of the fields that are put to zero in the Wess–Zumino gauge are taken into account. In the description in terms of superfields, infrared divergences are found for every choice of gauge different from the supersymmetric generalization of the Fermi–Feynman gauge. Two-, three- and four-point functions of superfields are computed and some general features of the infrared problem are discussed. We also examine the effect of the introduction of mass terms for the (anti)chiral superfields in the theory, which break supersymmetry from to . It is shown that in the mass deformed model no ultraviolet divergences appear in two-point functions. It is argued that this result can be generalized to n-point functions, supporting the proposal of a possible of use of this modified model as a supersymmetry-preserving regularization scheme for theories.
Burst-Erasure Correcting Codes With Optimal Average Delay

The objective of low-delay codes is to protect communication streams from erasure bursts by minimizing the time between the packet erasure and its reconstruction. Previous work has concentrated on the constant-delay scenario, where all erased packets need to exhibit the same decoding delay. We consider the case of heterogeneous delay, where the objective is to minimize the average delay across the erased packets in a burst. We derive delay lower bounds for the average case, and show that they match the constant-delay bounds only at a single rate point <inline-formula> <tex-math notation="LaTeX">$R=0.5$ </tex-math></inline-formula>. We then construct codes with optimal average delays for the entire range of code rates. The construction for rates <inline-formula> <tex-math notation="LaTeX">$R\leq 0.5$ </tex-math></inline-formula> achieves optimality for every erasure instance, while the construction for rates <inline-formula> <tex-math notation="LaTeX">$R>0.5$ </tex-math></inline-formula> is optimal for a <inline-formula> <tex-math notation="LaTeX">$(1-R)/R$ </tex-math></inline-formula> fraction of all burst instances and close to optimal for the remaining fraction. The paper also studies the benefits of delay heterogeneity within the application of sensor communications. It is shown that a carefully designed code can significantly improve the temporal precision at the receiving node following erasure-burst events.