Miracle-dz/UniFAR-FTUs huggingface dataset:
Improvement of Methanol Synthesis Process by using a Novel Sorption-Enhanced Fluidized-bed Reactor, Part II: Multiobjective Optimization and Decision-making Method

In the first part (Part I) of this study, a novel fluidized bed reactor was modeled mathematically for methanol synthesis in the presence of in-situ water adsorbent named Sorption Enhanced Fluidized-bed Reactor (SE-FMR) is modeled, mathematically. Here, the non-dominated sorting genetic algorithm-II (NSGA-II) is applied for multi-objective optimization of this configuration. Inlet temperature of gas phase (Tg), temperature of saturated water (Tshell), total molar flow rate (Ft), diameter of solid adsorbent (ds), mass adsorbent solid to mass catalyst ratio (Mratio) and inlet pressure are selected as the decision variables. The production rate of methanol and selectivity is maximized as two objective functions. The Shannon’s Entropy, LINMAP and TOPSIS methods as the three decision making approaches are applied to select the final solution of Pareto front. The optimization results approved by about 203.63 and 276.65 ton/day methanol production rate and CO2 consumption, respectively, based on LINMAP methods compared with the conventional methanol configuration. The results recommend that consuming optimized-SE-FMR for improvement of methanol production could be feasible and beneficial.
Novel Approach to the Improvement of Biphenyl and Polychlorinated Biphenyl Degradation Activity: Promoter Implantation by Homologous Recombination

ABSTRACT To improve the capabilities of microorganisms relevant for biodegradation, we developed a new genetic approach and applied it to the bph operon (bphEGF[orf4]A1A2A3CD[orf1]A4R) of Pseudomonas sp. strain KKS102 to enhance its biphenyl- and polychlorinated biphenyl (PCB)-degrading activity. A native promoter of the bph operon, which was under control, was replaced through homologous recombination by a series of promoters that had constitutive activity. By testing a series of promoters with various strengths, we were able to obtain strains that have enhanced degradation activity for biphenyl and PCBs. This strategy removes the rate-limiting factor associated with transcription and has the potential to improve the degradation activity of a wide variety of microorganisms involved in biodegradation.
Hypothalamic Obesity following Craniopharyngioma Surgery: Results of a Pilot Trial of Combined Diazoxide and Metformin Therapy

Objective. To assess the effect of combined diazoxide-metformin therapy in obese adolescents treated for craniopharyngioma. Design. A prospective open-label 6-month pilot treatment trial in 9 obese subjects with craniopharyngioma. Diazoxide (2 mg/kg divided b.i.d., maximum 200 mg/day) and metformin (1000 mg b.i.d.). Whole body insulin sensitivity index (WBISI) and area-under-the-curve insulin (AUCins) were calculated. Results. Seven subjects completed: 4M/3F, mean ± SD age years, weight kg, BMI kg/m2, and BMI SDS . Two were withdrawn due to vomiting and peripheral edema. Of participants completing the study, the mean ± SD weight gain, BMI, and BMI SDS during the 6 months were reduced compared to the 6 months prestudy ( versus kg, ; versus kg/m2, ; versus , , resp.). AUCins correlated with weight loss (, ) and BMI decrease (, ). Conclusion. Combined diazoxide-metformin therapy was associated with reduced weight gain in patients with hypothalamic obesity. AUCins at study commencement predicted effectiveness of the treatment.
The Optimal Diversity Management Problem

In some industries, a certain part can be needed in a very large number of different configurations. This is the case, e.g., for the electrical wirings in European car factories. A given configuration can be replaced by a more complete, therefore more expensive, one. The diversity management problem consists of choosing an optimal set of some given number k of configurations that will be produced, any nonproduced configuration being replaced by the cheapest produced one that is compatible with it. We model the problem as an integer linear program. Our aim is to solve those problems to optimality. The large-scale instances we are interested in lead to difficult LP relaxations, which seem to be intractable by the best direct methods currently available. Most of this paper deals with the use of Lagrangean relaxation to reduce the size of the problem in order to be able, subsequently, to solve it to optimality via classical integer optimization.
The Most Popular Smartphone Apps for Weight Loss: A Quality Assessment

Background Advancements in mobile phone technology have led to the development of smartphones with the capability to run apps. The availability of a plethora of health- and fitness-related smartphone apps has the potential, both on a clinical and public health level, to facilitate healthy behavior change and weight management. However, current top-rated apps in this area have not been extensively evaluated in terms of scientific quality and behavioral theory evidence base. Objective The purpose of this study was to evaluate the quality of the most popular dietary weight-loss smartphone apps on the commercial market using comprehensive quality assessment criteria, and to quantify the behavior change techniques (BCTs) incorporated. Methods The top 200-rated Health & Fitness category apps from the free and paid sections of Google Play and iTunes App Store in Australia (n=800) were screened in August 2014. To be included in further analysis, an app had to focus on weight management, include a facility to record diet intake (self-monitoring), and be in English. One researcher downloaded and used the eligible apps thoroughly for 5 days and assessed the apps against quality assessment criteria which included the following domains: accountability, scientific coverage and content accuracy of information relevant to weight management, technology-enhanced features, usability, and incorporation of BCTs. For inter-rater reliability purposes, a second assessor provided ratings on 30% of the apps. The accuracy of app energy intake calculations was further investigated by comparison with results from a 3-day weighed food record (WFR). Results Across the eligible apps reviewed (n=28), only 1 app (4%) received full marks for accountability. Overall, apps included an average of 5.1 (SD 2.3) out of 14 technology-enhanced features, and received a mean score of 13.5 (SD 3.7) out of 20 for usability. The majority of apps provided estimated energy requirements (24/28, 86%) and used a food database to calculate energy intake (21/28, 75%). When compared against the WFR, the mean absolute energy difference of apps which featured energy intake calculations (23/28, 82%) was 127 kJ (95% CI -45 to 299). An average of 6.3 (SD 3.7) of 26 BCTs were included. Conclusions Overall, the most popular commercial apps for weight management are suboptimal in quality, given the inadequate scientific coverage and accuracy of weight-related information, and the relative absence of BCTs across the apps reviewed. With the limited regulatory oversight around the quality of these types of apps, this evaluation provides clinicians and consumers an informed view of the highest-quality apps in the current popular app pool appropriate for recommendation and uptake. Further research is necessary to assess the effectiveness of apps for weight management.
ICASE MASSIVELY PARALLEL ALGORITHMS FOR TRACE-DRIVEN CACHE SIMULATIONS

Trace-driven cache simulation is central to computer design. A trace is a very long sequence, zl, . , iN, of references to lines (contiguous locations) from main memory. At the t th instant, reference z, is hashed into a set of cache locations, the contents of which are then compared with _t. If at the t th instant zt is not present in the cache, then it is said to be a miss, and is loaded into the cache set, possibly forcing the replacement of some other memory line, and making z, present for the (t + 1) st instant. The problem of parallel simulation of a subtrace of N references directed to a C line cache set is considered, with the aim of determining which references are misses and related statistics. A simulation method is presented for the Lea-st-Recently-Used (LRU) policy, which regardless of the set size C runs in time O(log N) using N processors on the exclusive read, exclusive write (EREW) parallel model. A simpler LRU simulation algorithm is given that runs in O(Clog N) time using N/log N processors. We present timings of the second algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference-basedline replacement policies are considered, which includes LRU as well as the Least-Frequently-Used and Random replacement pohcies. A simulation method is presented for any such policy that on any trace of length N directed to a C line set runs in time O(Clog N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well-suited for SIMD implementation. *This research was supported in part by NASA grants NAG-l-l132 and NAS-1-18605, in part by NSF Grant ASC 8819373, and was initiated during a visit to AT&T Bell Laboratories.
Functional Specification of Probabilistic Process Models

Agents that handle complex processes evolving over a period of time need to be able to monitor the state of the process. Since the evolution of a process is often stochastic, this requires probabilistic monitoring of processes. A probabilistic process modeling language is needed that can adequately capture our uncertainty about the process execution. We present a language for describing probabilistic process models. This language is functional in nature, and the paper argues that a functional language provides a natural way to specify process models. In our framework, processes have both states and values. Processes may execute sequentially or in parallel, and we describe two alternative forms of parallelism. An inference algorithm is presented that constructs a dynamic Bayesian network, containing a variable for every subprocess that is executed during the course of executing a process. We present a detailed example demonstrating the naturalness of the language.
Survey on EMI: Privacy-Preserving Public Auditing for Regenerating-Code-Based Cloud Storage

To protect outsourced knowledge in cloud storage against corruptions, adding fault tolerance to cloud storage along with knowledge integrity checking and failure reparation becomes critical. Recently, create codes have gained quality due to their lower repair information measure whereas providing fault tolerance. Existing remote checking strategies for regenerating-coded knowledge o nly give non-public auditing, requiring knowledge house owners to continuously stay on-line and handle auditing, similarly as repairing, which is sometimes impractical. During this paper, we have a tendency to propose a public auditing theme for the regenerating-code-based cloud storage. To solve the regeneration drawback of unsuccessful authenticators in the absence of knowledge house owners, we have a tendency to introduce a proxy, which is privileged to regenerate the authenticators, into the normal public auditing system model. Moreover, we have a tendency to style a unique public verifiable appraiser that is generated by a few of keys and can be regenerated exploitation partial keys. Thus, our theme will completely unleash knowledge house owners from on-line burden. Additionally, we randomise the code coefficients with a pseudorandom operateto preserve knowledge privacy. Intensive security analysis shows that our theme is demonstrable secure beneath random oracle modeland experimental analysis indicates that our theme is very efficient and might be feasibly integrated into the regenerating code-based cloud storage.
A single domestication for maize shown by multilocus microsatellite genotyping

There exists extraordinary morphological and genetic diversity among the maize landraces that have been developed by pre-Columbian cultivators. To explain this high level of diversity in maize, several authors have proposed that maize landraces were the products of multiple independent domestications from their wild relative (teosinte). We present phylogenetic analyses based on 264 individual plants, each genotyped at 99 microsatellites, that challenge the multiple-origins hypothesis. Instead, our results indicate that all maize arose from a single domestication in southern Mexico about 9,000 years ago. Our analyses also indicate that the oldest surviving maize types are those of the Mexican highlands with maize spreading from this region over the Americas along two major paths. Our phylogenetic work is consistent with a model based on the archaeological record suggesting that maize diversified in the highlands of Mexico before spreading to the lowlands. We also found only modest evidence for postdomestication gene flow from teosinte into maize.
Dataflow machine architecture

Dataflow machines are programmable computers of which the hardware is optimized for fine-grain data-driven parallel computation. The principles and complications of data-driven execution are explained, as well as the advantages and costs of fine-grain parallelism. A general model for a dataflow machine is presented and the major design options are discussed. Most dataflow machines described in the literature are surveyed on the basis of this model and its associated technology. For general-purpose computing the most promising dataflow machines are those that employ packet-switching communication and support general recursion. Such a recursion mechanism requires an extremely fast mechanism to map a sparsely occupied virtual space to a physical space of realistic size. No solution has yet proved fully satisfactory. A working prototype of one processing element is described in detail. On the basis of experience with this prototype, some of the objections raised against the dataflow approach are discussed. It appears that the overhead due to fine-grain parallelism can be made acceptable by sophisticated compiling and employing special hardware for the storage of data structures. Many computing-intensive programs show sufficient parallelism. In fact, a major problem is to restrain parallelism when machine resources tend to get overloaded. Another issue that requires further investigation is the distribution of computation and data structures over the processing elements.
On the hardness of graph isomorphism

We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class Mod/sub k/L and for the class DET of problems NC/sup 1/ reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism.
ScienceDirect Information Technology and Quantitative Management ( ITQM 2015 ) Forecasting long-term electricity demand in the residential sector

This work describes a methodology for long-term electricity demand forecast in the residential sector. The methodology has been used in the power market studies of some Brazilian distribution utilities. The methodology is based on decomposition of the total electricity residential consumption in three components: average consumption per consumer unit, electrification rate and number of households. Then, the forecast for the total electricity consumption in residential sector is the product of forecasts for these three components. The prediction for the number of households is based on demographic models while the future trajectory of the electrification rate is defined by the targets for achieving the universal access to electricity. The product of these two components provides a forecast to the number of residential customers. The average consumption per unit consumer depends on the macroeconomic scenarios for GDP, average household income and income distribution. The proposed methodology provides a framework to integrate macroeconomic scenario, demographic projection and assumptions for ownership and efficiency of electric appliances in a long-term demand forecast. In order to illustrate the application of the proposed methodology, this paper presents a ten-year demand forecasts for the residential sector in Brazil. © 2015 The Authors. Published by Elsevier B.V. Selection and/or peer-review under responsibility of the organizers of ITQM 2015
High-throughput transformation of Saccharomyces cerevisiae using liquid handling robots

Saccharomyces cerevisiae (budding yeast) is a powerful eukaryotic model organism ideally suited to high-throughput genetic analyses, which time and again has yielded insights that further our understanding of cell biology processes conserved in humans. Lithium Acetate (LiAc) transformation of yeast with DNA for the purposes of exogenous protein expression (e.g., plasmids) or genome mutation (e.g., gene mutation, deletion, epitope tagging) is a useful and long established method. However, a reliable and optimized high throughput transformation protocol that runs almost no risk of human error has not been described in the literature. Here, we describe such a method that is broadly transferable to most liquid handling high-throughput robotic platforms, which are now commonplace in academic and industry settings. Using our optimized method, we are able to comfortably transform approximately 1200 individual strains per day, allowing complete transformation of typical genomic yeast libraries within 6 days. In addition, use of our protocol for gene knockout purposes also provides a potentially quicker, easier and more cost-effective approach to generating collections of double mutants than the popular and elegant synthetic genetic array methodology. In summary, our methodology will be of significant use to anyone interested in high throughput molecular and/or genetic analysis of yeast.
Escaping the Brownian stalkers

We propose a simple model for the behaviour of longterm investors on a stock market. It consists of three particles that represent the stock's current price and the buyers', respectively sellers', opinion about the right trading price. As time evolves, both groups of traders update their opinions with respect to the current price. The speed of updating is controled by a parameter; the price process is described by a geometric Brownian motion. We consider the market's stability in terms of the distance between the buyers' and sellers' opinion, and prove that the distance process is recurrent/transient in dependence on the parameter.
The Distribution Reliability Assessment Based on the Arithmetic of Simulating Reasoning

It mentions a new method of distribution reliability assessment based on Bayesian Network timing simulation. It uses node model “causal” to change the gotten or lost duration of load points combined with the characteristics of bayesian diagnostic reasoning and causal reasoning. it can simply effectively obtaine the index of distribution system reliability and find out the weakest link of the power net; The value of the elements reliability are converged faster and enhance the index convergence rate by the method Flag Constringency mentioned as followed. The result of operation calculated realistically proves the method here mentioned is effectively. Kwywords—power system, reliability assessment, bayesian network, timing Simulation, flag constringency
Multifunctional magnetic-hollow gold nanospheres for bimodal cancer cell imaging and photothermal therapy

Multifunctional nanocomposites combining imaging and therapeutic functions have great potential for cancer diagnosis and therapy. In this work, we developed a novel theranostic agent based on hollow gold nanospheres (HGNs) and superparamagnetic iron oxide nanoparticles (SPIO). Taking advantage of the excellent magnetic properties of SPIO and strong near-infrared (NIR) absorption property of HGNs, such nanocomposites were applied to targeted magnetic resonance imaging (MRI) and photoacoustic imaging (PAI) of cancer cells. In vitro results demonstrated they displayed significant contrast enhancement for T2-weighted MRI and strong PAI signal enhancement. Simultaneously, the nanocomposites exhibited a high photothermal effect under the irradiation of the near-infrared laser and can be used as efficient photothermal therapy (PTT) agents for selective killing of cancer cells. All these results indicated that such nanocomposites combined with MRI-PAI and PTT functionality can have great potential for effective cancer diagnosis and therapy.
Development of Broadband LHCP Pyramidal Horn Antenna with Septum Gaussian Profile Polarizer for CP-SAR Sensor Onboard Microsatellite

Horn Antenna has many applications such as communication, radar, and standard reference antenna for measurement. In this research, we designed a pyramidal horn for a Circularly Polarized Synthetic Aperture Radar (CP-SAR) sensor onboard a microsatellite. We utilized a 3D printer with Fused Deposition Modelling (FDM) technology for fast, low-cost, and low-weight production. Polylactide (PLA) material was used to construct 3D structures, and a copper conductive coating was painted on its surface. Gaussian distribution function was employed to create a septum polarizer profile. NPC-220 A with 1.6 thickness and 2.17 dielectric constant was used to make a microstrip monopole antenna and stripline feeding to feed the pyramidal horn to generate TE01 mode at one side of the waveguide. The design, parametric studies, and measurements are discussed in this paper. The designed antenna can achieve wide bandwidth 28% of 3 dB axial ratio, and more than 22% of s11 ≤ −10 dB in working frequency that is acceptable for CP-SAR requirement on the microsatellite.
How Complex Do Movie Channel Contracts Need to Be?

The motion picture industry is characterized by a dynamic market environment, limited shelf space and product category management, and consequently, complex channel contracts specifying the split of box office revenue between distributors and exhibitors. Although such a contracting practice creates a considerable administrative effort and channel conflict, it is not clear whether such complexity is necessary for superior channel performance. This study investigates this question by analyzing the impact of movie contract structure on movie scheduling and channel member profitability. We develop and analyze a game-theoretic model using the genetic algorithm approach and a decision support system, SilverScreener, to capture strategic behaviors of channel members in a complex market environment. We find that simpler two-part tariff or 50/50 split contracts perform as well as the current contracts. Thus, the complexity of the market environment need not be reflected in the complexity of the channel contracts. Channel contract structure has significant impact on channel member profitability and the exhibitor's movie-scheduling behavior. In particular, our results indicate that the flat rate contract structure represents an attractive alternative to the current practice for distributors.