Miracle-dz/UniFAR-FTUs huggingface dataset:
Color Builder: A Direct Manipulation Interface for Versatile Color Theme Authoring

Color themes or palettes are popular for sharing color combinations across many visual domains. We present a novel interface for creating color themes through direct manipulation of color swatches. Users can create and rearrange swatches, and combine them into smooth and step-based gradients and three-color blends -- all using a seamless touch or mouse input. Analysis of existing solutions reveals a fragmented color design workflow, where separate software is used for swatches, smooth and discrete gradients and for in-context color visualization. Our design unifies these tasks, while encouraging playful creative exploration. Adjusting a color using standard color pickers can break this interaction flow with mechanical slider manipulation. To keep interaction seamless, we additionally design an in situ color tweaking interface for freeform exploration of an entire color neighborhood. We evaluate our interface with a group of professional designers and students majoring in this field.
Cross Sections for Electron Collisions with Water Molecules

Cross section data have been compiled from the literature (to the end of 2003) for electron collisions with water (H2O) molecules. All major collision processes are reviewed including: total scattering, elastic scattering, momentum transfer, excitation of rotational, vibrational, and electronic states, ionization, electron attachment, dissociation, and emission of radiation. In each case we assess the collected data and provide a recommendation of the values of the cross section to be used. They are presented in a tabular form. Isotope effects (H2O versus D2O) are discussed as far as information is available.
IoT in Healthcare: Achieving Interoperability of High-Quality Data Acquired by IoT Medical Devices

It is an undeniable fact that Internet of Things (IoT) technologies have become a milestone advancement in the digital healthcare domain, since the number of IoT medical devices is grown exponentially, and it is now anticipated that by 2020 there will be over 161 million of them connected worldwide. Therefore, in an era of continuous growth, IoT healthcare faces various challenges, such as the collection, the quality estimation, as well as the interpretation and the harmonization of the data that derive from the existing huge amounts of heterogeneous IoT medical devices. Even though various approaches have been developed so far for solving each one of these challenges, none of these proposes a holistic approach for successfully achieving data interoperability between high-quality data that derive from heterogeneous devices. For that reason, in this manuscript a mechanism is produced for effectively addressing the intersection of these challenges. Through this mechanism, initially, the collection of the different devices’ datasets occurs, followed by the cleaning of them. In sequel, the produced cleaning results are used in order to capture the levels of the overall data quality of each dataset, in combination with the measurements of the availability of each device that produced each dataset, and the reliability of it. Consequently, only the high-quality data is kept and translated into a common format, being able to be used for further utilization. The proposed mechanism is evaluated through a specific scenario, producing reliable results, achieving data interoperability of 100% accuracy, and data quality of more than 90% accuracy.
Loss analysis of the IPMSM for HEV

IPMSM has been often developed for HEV because it has a high power density and a wide range of operations. However, an armature reaction occurs from the high current and also the hysteresis loss from electrical steel of rotor and stator and the magnet is pretty high due to the high speed driving. Moreover, for IPMSM, there are hardly any accurate specifications or studies to verify the loss through simulative experiment. In this study, the hysteresis loss and eddy current loss are calculated as well as their correlations along with the changes of the current magnitude, current phase angle, and driving speed. In addition, an experiment on loss separation is suggested and its validity is verified through a comparison with the simulation.
Phase I and clinical pharmacological study of 4-demethoxydaunorubicin (idarubicin) in children with advanced cancer.

We conducted a phase I and pharmacokinetic study of i.v. idarubicin, a new anthracycline analogue, in 42 evaluable children 1-19 years old. Twenty-seven had leukemia and 15 had various solid tumors. The drug was administered in escalating doses of 10 to 40 mg/m2/course in 3 equal fractions over 3 consecutive days at 14- to 21-day intervals. Myelosuppression and mucositis were the limiting toxicities for short-term administration. Nausea, vomiting, and elevation of liver enzymes and bilirubin were the other toxicities encountered. Peak toxicity occurred 2 weeks after drug administration with median recovery by day 24. All but 4 patients with solid tumors had prior anthracyclines. Mild cardiac function changes without clinical symptoms were observed in 17 of 35 patients measured by serial cardiac evaluations. In addition, there were 4 patients with congestive heart failure. On postmortem examination, 4 patients had changes consistent with anthracycline cardiomyopathy at a prior median total anthracycline dose of 175 mg/m2. The maximum tolerated dose for patients with solid tumors was 15 mg/m2 course in 3 divided doses. Patients with leukemia tolerated 30 mg/m2/course. Six of 15 evaluable patients with acute lymphoblastic leukemia who received greater than or equal to 30 mg/m2 idarubicin achieved a remission (M1 marrow status). The plasma clearance of idarubicin fits a 3-compartment model with a harmonic mean half-life of 2.4 min, 0.6 h, and 11.3 h for alpha, beta, and gamma phases, respectively. Idarubicinol was the only metabolite detected in the plasma and it accumulated during the 3 days of therapy. Idarubicin is similar to daunorubicin in pharmacology and toxicity. While the cardiotoxic dose still must be delineated, the complete remission achieved in multiple relapsed patients with acute lymphoblastic leukemia indicate promising activity in at least that disease.
Rapid Induction of Extrapyramidal Side Effects with Combined Use of Lithium and Neuroleptics

Various forms of toxicity have been described when lithium and neuroleptics are used in combination. Two cases are presented in which extrapyramidal symptoms appeared soon after lithium was added to a regimen of neuroleptics. Clinical variables and pathophysiologic mechanisms are discussed. This reaction warrants further investigation. (J Clin Psychopharmacol 1985;5:296–298)
A Taylor Expansion Diagram Approach for Nano-CMOS RTL Leakage Optimization

Due to exponential behavior of gate-oxide leakage current with temperature and technology scaling, leakage power plays important role in nano − CMOS circuit. In this paper, we present simultaneous scheduling and binding algorithm for optimizing leakage current during behavioral synthesis. It uses TED (Taylor Expansion Diagram) for generating optimized DFG (Data Flow Graph). Once DFG is obtained, it selectively binds non-critical components to corresponding functional unit consisting of transistors of high oxide thickness and critical components with low oxide thickness. As the algorithm considers time-constraint explicitly, it reduces leakage current without degrading the performance of the design. Experimental results on a set of behavioral synthesis benchmarks for 45nm process show 30% to 70% reduction in leakage current compared to the results obtained by a conventional optimization ¿ow.
Cell type-specific transcriptome analysis in the early Arabidopsis thaliana embryo

In multicellular organisms, cellular differences in gene activity are a prerequisite for differentiation and establishment of cell types. In order to study transcriptome profiles, specific cell types have to be isolated from a given tissue or even the whole organism. However, whole-transcriptome analysis of early embryos in flowering plants has been hampered by their size and inaccessibility. Here, we describe the purification of nuclear RNA from early stage Arabidopsis thaliana embryos using fluorescence-activated nuclear sorting (FANS) to generate expression profiles of early stages of the whole embryo, the proembryo and the suspensor. We validated our datasets of differentially expressed candidate genes by promoter-reporter gene fusions and in situ hybridization. Our study revealed that different classes of genes with respect to biological processes and molecular functions are preferentially expressed either in the proembryo or in the suspensor. This method can be used especially for tissues with a limited cell population and inaccessible tissue types. Furthermore, we provide a valuable resource for research on Arabidopsis early embryogenesis.
Preparing a Negotiated R&D Portfolio with a Prediction Market

The main objective of this research is to use prediction markets as negotiation agents, for supporting R&D portfolio management. To support this research, we iteratively designed, developed, operated and evaluated several prototypes. We start by presenting the weaknesses of the current techniques for managing R&D portfolio. Then, we intend to demonstrate that prediction markets correct these weaknesses in R&D portfolio management. Furthermore, following a design science paradigm, we illustrate the design of our artifacts using build-and-evaluate loops supported with a field study, which consisted in operating the prediction markets in different settings.
Incremental computation of dominator trees

Data flow analysis based on an incremental approach may require that the dominator tree be correctly maintained at all times. Previous solutions to the problem of incrementally maintaining dominator trees were restricted to reducible flowgraphs. In this paper we present a new algorithm for incrementally maintaining the dominator tree of an arbitrary flowgraph, either reducible or irreducible, based on a program representation called the DJ-graph. For the case where an edge is inserted, our algorithm is also faster than previous approaches (in the worst case). For the deletion case, our algorithm is likely to run fast on the average cases.
Deducing a Believable Model for Affective Behavior from Perceived Emotional Data

Bar code symbol reading system with automatic modes of hand-held (i.e., hands-on) and stand-supported (i.e., hands-free) operation. In the hand-held mode of automatic operation, the user initiates laser scanning by simply bringing the object within at least a portion of the scan field of the automatic bar code symbol reading device. In the stand-supported mode of automatic operation, a scanner support stand is used to support the automatic bar code symbol reading device relative to a countertop surface so that the scan field is projected away from the scanner support stand and the hand-supportable housing, and extends above the countertop surface permitting the automatic reading bar code symbols on goods passed thereby. This way, during the scanner-supported mode of automatic operation, a bar code symbol on an object of virtually any size can be automatically read when the object is automatically detected in the outwardly projected scan field while the hand-supportable bar code symbol reading device is supported within the scanner support stand.
Infrastructure-less collaborative indoor positioning for time critical operations

Localisation defines the process of determining the topographical location of sensor nodes in wireless sensor network. Current localisation method is space oriented which adopts GPS (Global Positioning System) signal to yield the location information of the nodes. The GPS signals are suited for outdoor environments, however they fail to work indoors, which makes the need to opt for terrestrial localisation of utmost importance. The localisation architecture deals in designing localisation service through WSN where sensor nodes are mobile in a cluster environment. The wireless sensor applications, significantly need reliable and robust information of the physical location of the nodes in the network. The paper shows localisation using the Time Difference of Arrival (TDOA) for distance estimation and trilateration technique for the position calculation. The Mean Square Error analysis (MSE) of the actual position in contrast to the calculated position further assists the sensor nodes to achieve reliable location information.
Chapter 4 FACE RECOGNITION AND ITS APPLICATIONS

Face recognition has long been a goal of computer vision, but only in recent years reliable automated face recognition has become a realistic target of biometrics research. New algorithms, and developments spurred by fall ing costs of cameras and by the increasing availability processing power have le d to practical face recognition systems. These systems are increasingly being d ployed in a wide range of practical applications, and future improvements p romise to spread the use of face recognition further still. In this chapter, we re view the field of face recognition, analysing its strengths and weaknesses and de scrib the applications where the technology is currently being deployed and where i t shows future potential. We describe the IBM face recognition system and som e f its application domains.
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs

We consider a transportation problem where the cost matrix satisfies the Monge property. The problem has supply nodes N1(|N1| = n1), demand nodes N2(|N2| = n2), supply si ≥ 0 for i∈N1, and demand dj ≥ 0 for j∈N2(n = n1 + n2,m = n1n2). When the total supply is equal to the total demand, the problem can be solved in O(n) time using the northwest corner rule (Hoffman [ 10 ]). This algorithm and run‐time, however, do not extend to the unbalanced case, where the total supply is not equal to the total demand. The fastest strongly polynomial run‐time for the unbalanced transportation problem with Monge costs is O(nlog n(m + nlog n)), and for the unbalanced assignment problem (unit supplies and demands) with Monge costs is O(n(m + nlog n)). In this article, we describe a simple algorithm that solves the unbalanced transportation problem with Monge costs in O(mn1) time and the unbalanced assignment problem with Monge costs in O(m) time using elementary data structures. We also develop a faster implementation of the algorithm that utilizes a heap, a self‐balancing binary search tree, and dynamic trees, and solves the transportation problem with Monge costs in O(mlog n1) time. Our algorithms improve the run‐times for: (i) the unbalanced transportation problem with Monge costs by a factor of nlog n/log n1 or better and (ii) the unbalanced assignment problem with Monge costs by a factor of n or better. © 2013 Wiley Periodicals, Inc. NETWORKS, 2013
Survey of macrolide-resistant Mycoplasma pneumoniae in children with community-acquired pneumonia in Switzerland.

Mycoplasma pneumoniae is a leading cause of communityacquired pneumonia (CAP) in children and macrolides are recommended for this entity [1]. Extensive macrolide use led to the rapid, worldwide emergence of macrolide-resistant M. pneumoniae (MRMP) [2] with rates of over 90% in Asia (China, 2012 [3]) and up to 26% in Europe (Italy, 2010 [4]). The first two cases of MRMP in Switzerland were reported in adults in 2012 [5]. We aimed to assess the presence of MRMP in children with CAP.
Multiresolution Rendering of Complex Botanical Scenes

This paper presents a system for rendering very large collections of randomly parameterized plants while generating manageable scene geometries for rendering A given botanical description of a plant is compiled into a hierarchical volume approxima tion This is then integrated into a multiresolution rendering system that uses adaptive volume re ne ment For objects that are close to the viewer ex plicit polygons are generated while objects hidden or further away are rendered as groups of microsur faces This system can be extended to any polygon intensive rendering
Tumor Suppressor Ras-Association Domain Family 1 Isoform A Is a Novel Regulator of Cardiac Hypertrophy

Background— Ras signaling regulates a number of important processes in the heart, including cell growth and hypertrophy. Although it is known that defective Ras signaling is associated with Noonan, Costello, and other syndromes that are characterized by tumor formation and cardiac hypertrophy, little is known about factors that may control it. Here we investigate the role of Ras effector Ras-association domain family 1 isoform A (RASSF1A) in regulating myocardial hypertrophy. Methods and Results— A significant downregulation of RASSF1A expression was observed in hypertrophic mouse hearts, as well as in failing human hearts. To further investigate the role of RASSF1A in cardiac (patho)physiology, we used RASSF1A knock-out (RASSF1A−/−) mice and neonatal rat cardiomyocytes with adenoviral overexpression of RASSF1A. Ablation of RASSF1A in mice significantly enhanced the hypertrophic response to transverse aortic constriction (64.2% increase in heart weight/body weight ratio in RASSF1A−/− mice compared with 32.4% in wild type). Consistent with the in vivo data, overexpression of RASSF1A in cardiomyocytes markedly reduced the cellular hypertrophic response to phenylephrine stimulation. Analysis of molecular signaling events in isolated cardiomyocytes indicated that RASSF1A inhibited extracellular regulated kinase 1/2 activation, likely by blocking the binding of Raf1 to active Ras. Conclusions— Our data establish RASSF1A as a novel inhibitor of cardiac hypertrophy by modulating the extracellular regulated kinase 1/2 pathway.
Accelerating Robot Development Through Integral Analysis of Human–Robot Interaction

The development of interactive robots is a complicated process, involving a plethora of psychological, technical, and contextual influences. To design a robot capable of operating ldquointelligentlyrdquo in everyday situations, one needs a profound understanding of human-robot interaction (HRI). We propose an approach based on integral analysis of multimodal data to pursue this understanding and support interdisciplinary research and development in the field of robotics. To adopt this approach, a software tool named interaction debugger was developed that features user-friendly navigation, browsing, searching, viewing, and annotation of data; it enables fine-grained inspection of the HRI. In four case studies, we demonstrated how our analysis approach aids the development process of interactive robots.
Enhanced potency of a fucose-free monoclonal antibody being developed as an Ebola virus immunoprotectant

No countermeasures currently exist for the prevention or treatment of the severe sequelae of Filovirus (such as Ebola virus; EBOV) infection. To overcome this limitation in our biodefense preparedness, we have designed monoclonal antibodies (mAbs) which could be used in humans as immunoprotectants for EBOV, starting with a murine mAb (13F6) that recognizes the heavily glycosylated mucin-like domain of the virion-attached glycoprotein (GP). Point mutations were introduced into the variable region of the murine mAb to remove predicted human T-cell epitopes, and the variable regions joined to human constant regions to generate a mAb (h-13F6) appropriate for development for human use. We have evaluated the efficacy of three variants of h-13F6 carrying different glycosylation patterns in a lethal mouse EBOV challenge model. The pattern of glycosylation of the various mAbs was found to correlate to level of protection, with aglycosylated h-13F6 providing the least potent efficacy (ED50 = 33 μg). A version with typical heterogenous mammalian glycoforms (ED50 = 11 μg) had similar potency to the original murine mAb. However, h-13F6 carrying complex N-glycosylation lacking core fucose exhibited superior potency (ED50 = 3 μg). Binding studies using Fcγ receptors revealed enhanced binding of nonfucosylated h-13F6 to mouse and human FcγRIII. Together the results indicate the presence of Fc N-glycans enhances the protective efficacy of h-13F6, and that mAbs manufactured with uniform glycosylation and a higher potency glycoform offer promise as biodefense therapeutics.
Composable Resource Sharing Based on Latency-Rate Servers

Verification of application requirements is becom- ing a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification complexity increases exponentially with the number of applications and must be repeated if an application is added, removed, or modified. Predictable systems offering lower bounds on performance have been proposed to manage the increasing verification complexity, although this approach is only applicable to a restricted set of applications and systems. Composable systems, on the other hand, completely isolate applications in both the value and time domains, allowing them to be independently verified. However, existing approaches to composable system design are either restricted to applications that can be statically scheduled, or share resources using time-division multiplexing, which cannot efficiently satisfy tight latency requirements. In this paper, we present an approach to composable resource sharing based on latency-rate servers that supports any arbiter belonging to the class, providing a larger solution space for a given set of requirements. The approach can be combined with formal performance analysis using a variety of well-known modeling frame works. We furthermore propose an architecture for a resource front end that implements our concepts and provides composable service for any resource with bounded service time. The architecture supports both systems with buffers dimensioned to prevent overflow and systems with smaller buffers, where overflow is prevented with flow control. Finally, we experimentally demonstrate the usefulness of our approach with a simple use case sharing an SRAM memory.
Kinetic Studies and Biochemical Pathway Analysis of Anaerobic Poly-(R)-3-Hydroxybutyric Acid Synthesis in Escherichia coli

ABSTRACT Poly-(R)-3-hydroxybutyric acid (PHB) was synthesized anaerobically in recombinant Escherichia coli. The host anaerobically accumulated PHB to more than 50% of its cell dry weight during cultivation in either growth or nongrowth medium. The maximum specific PHB production rate during growth-associated synthesis was approximately 2.3 ± 0.2 mmol of PHB/g of residual cell dry weight/h. The by-product secretion profiles differed significantly between the PHB-synthesizing strain and the control strain. PHB production decreased acetate accumulation for both growth and nongrowth-associated PHB synthesis. For instance under nongrowth cultivation, the PHB-synthesizing culture produced approximately 66% less acetate on a glucose yield basis as compared to a control culture. A theoretical biochemical network model was used to provide a rational basis to interpret the experimental results like the fermentation product secretion profiles and to study E. coli network capabilities under anaerobic conditions. For example, the maximum theoretical carbon yield for anaerobic PHB synthesis in E. coli is 0.8. The presented study is expected to be generally useful for analyzing, interpreting, and engineering cellular metabolisms.