Journal articles on the topic 'HLS type system'
To see the other types of publications on this topic, follow the link: HLS type system.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'HLS type system.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Cao, Linfen, and Zhaohui Dai. "Symmetry and Nonexistence of Positive Solutions for Weighted HLS System of Integral Equations on a Half Space." Abstract and Applied Analysis 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/593210.
Full textAbstract:
We consider system of integral equations related to the weighted Hardy-Littlewood-Sobolev (HLS) inequality in a half space. By the Pohozaev type identity in integral form, we present a Liouville type theorem when the system is in both supercritical and subcritical cases under some integrability conditions. Ruling out these nonexistence results, we also discuss the positive solutions of the integral system in critical case. By the method of moving planes, we show that a pair of positive solutions to such system is rotationally symmetric aboutxn-axis, which is much more general than the main result of Zhuo and Li, 2011.
2
Wang, Nan, Qi Zhang, Weihua Han, Chengxin Bai, Boyang Hou, Yue Liu, and Shuai Wang. "Chemical Characteristics of Dark-Brown Humic-Like Substances Formed from the Abiotic Condensation of Maillard Precursors with Different Glycine Concentrations." Agronomy 12, no. 9 (September 15, 2022): 2199. http://dx.doi.org/10.3390/agronomy12092199.
Full textAbstract:
The Maillard reaction is a type of nonenzymic browning process, and it is also an abiotic humification process of sugars, amino acids and phenols catalyzed by δ-MnO2. It is considered to be one of the possible pathways for the formation of humic-like substances (HLS). The change in the ratio of the Maillard precursors inevitably affects the chemical characteristics of HLS, among which the effect of amino acids concentration on the humification pathway and HLS formation has not yet been reported. In view of this, the glucose, glycine and catechol were chosen as tested objects for the present study, and the method of liquid shake-flask culture was adopted. Both catechol and glucose with fixed concentrations were added into a phosphate buffer solution (pH 8.0) containing δ-MnO2, and only the glycine concentration was adjusted in the sterile culture system. The supernatant solution and dark-brown residue were collected dynamically within 360 h through the centrifugation method. The E4/E6 ratio and total organic C (TOC) of the supernatant solution, the C content of the humic-like acid (CHLA), CHLA/CFLA (C content of fulvic-like acid) ratio and FTIR spectra of the dark-brown residue and the E4/E6 ratio and atomic ratio of humic-like acid (HLA) extracted from the dark-brown residue were systematically analyzed to reveal the effect of different glycine concentrations on the abiotic humification pathways and the characteristics of related products from the Maillard reaction under abiotic processes. The results showed that (1) Under the influence of the addition of different glycine concentrations, the structure of organic molecules in the supernatant after culture tended to be simplified, and the addition of three lower concentrations (0, 0.03 and 0.06 mol/L) of glycine made the E4/E6 ratios increase by 100.4%, 57.7% and 33.0%, respectively, and obtained a simpler structure of organic molecules in the supernatant than that of 0.12 and 0.24 mol/L glycine, which made the E4/E6 ratios increase by 5.6% and 18.0%, merely. After culture, the TOC content in the supernatant solution of each treatment decreased to varying degrees, and the addition of Maillard precursors effectively inhibited the loss of TOC in the supernatant solution, especially the addition of glycine at a concentration of 0.06 mol/L, which only reduced the TOC content by 0.1%. (2) The greater the concentration of glycine added, the higher proportion of aromatic C structure existed in the dark-brown residue. O-containing functional groups from the dark-brown residue and δ-MnO2 were bound to each other through hydrogen bonding, and (3) During the culture process, the CHLA treated with the addition of Maillard precursors was significantly higher than that of the CK control. Compared with the result at 0 h, the addition of higher concentrations of glycine (0.12 and 0.24 mol/L) were more conducive to the formation of HLA, making the CHLA increase by 666.2% and 422.7%, which were much more than these results for 256.6%, 282.2% and 360.0% from three concentrations of glycine (0, 0.03 and 0.06 mol/L) at the end of culture. After culture, the structure of HLA molecules treated by the addition of Maillard precursors became more complex, and the overall performance showed that the higher the concentration of added glycine, the more complex the HLA molecules became. Under the coexistence of glucose and catechol, the addition of glycine could promote abiotic condensation and improve the condensation degree of HLA molecules, among which the addition of 0.12 mol/L glycine had the most significant effect. Compared with the CK control, the addition of Maillard precursors could achieve a higher increase in the CHLA/CFLA ratio, which was more beneficial to the improvement of humus quality.
3
Lavrentiev, Mikhail, Konstantin Lysakov, Andrey Marchuk, Konstantin Oblaukhov, and Mikhail Shadrin. "Algorithmic Design of an FPGA-Based Calculator for Fast Evaluation of Tsunami Wave Danger." Algorithms 14, no. 12 (November 26, 2021): 343. http://dx.doi.org/10.3390/a14120343.
Full textAbstract:
Events of a seismic nature followed by catastrophic floods caused by tsunami waves (the incidence of which has increased in recent decades) have an important impact on the populations of littoral regions. On the coast of Japan and Kamchatka, it takes nearly 20 min for tsunami waves to approach the nearest dry land after an offshore seismic event. This paper addresses an important question of fast simulation of tsunami wave propagation by mapping the algorithms in use in field-programmable gate arrays (FPGAs) with the help of high-level synthesis (HLS). Wave propagation is described by the shallow water system, and for numerical treatment the MacCormack scheme is used. The MacCormack algorithm is a direct difference scheme at a three-point stencil of a “cross” type; it happens to be appropriate for FPGA-based parallel implementation. A specialized calculator was designed. The developed software was tested for precision and performance. Numerical tests computing wave fronts show very good agreement with the available exact solutions (for two particular cases of the sea bed topography) and with the reference code. As the result, it takes just 17.06 s to simulate 1600 s (3200 time steps) of the wave propagation using a 3000 × 3200 computation grid with a VC709 board. The step length of the computational grid was chosen to display the simulation results in sufficient detail along the coastline. At the same time, the size of data arrays should provide their free placement in the memory of FPGA chips. The rather high performance achieved shows that tsunami danger could be correctly evaluated in a few minutes after seismic events.
4
Melin, Patricia, and Daniela Sánchez. "Optimal design of type-2 fuzzy systems for diabetes classification based on genetic algorithms." International Journal of Hybrid Intelligent Systems 17, no. 1-2 (July 13, 2021): 15–32. http://dx.doi.org/10.3233/his-210004.
Full textAbstract:
Diabetes has become a global health problem, where a proper diagnosis is vital for the life quality of patients. In this article, a genetic algorithm is put forward for designing type-2 fuzzy inference systems to perform Diabetes Classification. We aim at finding parameter values of Type-2 Trapezoidal membership functions and the type of model (Mamdani or Sugeno) with this optimization. To verify the effectiveness of the proposed approach, the PIMA Indian Diabetes dataset is used, and results are compared with type-1 fuzzy systems. Five attributes are used considered as the inputs of the fuzzy inference systems to obtain a Diabetes diagnosis. The instances are divided into design and testing sets, where the design set allows the genetic algorithm to minimize the error of classification, and finally, the real behavior of the fuzzy inference system is validated with the testing set.
5
WACK, BENJAMIN, and CLÉMENT HOUTMANN. "Strong normalisation in two Pure Pattern Type Systems." Mathematical Structures in Computer Science 18, no. 3 (June 2008): 431–65. http://dx.doi.org/10.1017/s0960129508006749.
Full textAbstract:
Pure Pattern Type Systems (P2TS) combine the frameworks and capabilities of rewriting and λ-calculus within a unified setting. Their type systems, which are adapted from Barendregt's λ-cube, are especially interesting from a logical point of view. Until now, strong normalisation, which is an essential property for logical soundness, has only been conjectured: in this paper, we give a positive answer for the simply-typed system and the dependently-typed system.The proof is based on a translation of terms and types fromP2TSinto the λ-calculus. First, we deal with untyped terms, ensuring that reductions are faithfully mimicked in the λ-calculus. For this, we rely on an original encoding of the pattern matching capability ofP2TSinto the System Fω.Then we show how to translate types: the expressive power of System Fω is needed in order to fully reproduce the original typing judgments ofP2TS. We prove that the encoding is correct with respect to reductions and typing, and we conclude with the strong normalisation of simply-typedP2TSterms. The strong normalisation with dependent types is in turn obtained by an intermediate translation into simply-typed terms.
6
Jones, Mark P. "A system of constructor classes: overloading and implicit higher-order polymorphism." Journal of Functional Programming 5, no. 1 (January 1995): 1–35. http://dx.doi.org/10.1017/s0956796800001210.
Full textAbstract:
AbstractThis paper describes a flexible type system that combines overloading and higher-order polymorphism in an implicitly typed language using a system of constructor classes—a natural generalization of type classes in Haskell. We present a range of examples to demonstrate the usefulness of such a system. In particular, we show how constructor classes can be used to support the use of monads in a functional language. The underlying type system permits higher-order polymorphism but retains many of the attractive features that have made Hindley/Milner type systems so popular. In particular, there is an effective algorithm that can be used to calculate principal types without the need for explicit type or kind annotations. A prototype implementation has been developed providing, amongst other things, the first concrete implementation of monad comprehensions known to us at the time of writing.
7
SILES, VINCENT, and HUGO HERBELIN. "Pure Type System conversion is always typable." Journal of Functional Programming 22, no. 2 (March 2012): 153–80. http://dx.doi.org/10.1017/s0956796812000044.
Full textAbstract:
AbstractPure Type Systems are usually described in two different ways, one that uses an external notion of computation like beta-reduction, and one that relies on a typed judgment of equality, directly in the typing system. For a long time, the question was open to know whether both presentations described the same theory. A first step towards this equivalence has been made by Adams for a particular class ofPure Type Systems(PTS) called functional. Then, his result has been relaxed to all semi-full PTSs in previous work. In this paper, we finally give a positive answer to the general question, and prove that equivalence holds for any Pure Type System.
8
DUNFIELD, JOSHUA. "Elaborating intersection and union types." Journal of Functional Programming 24, no. 2-3 (January 20, 2014): 133–65. http://dx.doi.org/10.1017/s0956796813000270.
Full textAbstract:
AbstractDesigning and implementing typed programming languages is hard. Every new type system feature requires extending the metatheory and implementation, which are often complicated and fragile. To ease this process, we would like to provide general mechanisms that subsume many different features. In modern type systems, parametric polymorphism is fundamental, but intersection polymorphism has gained little traction in programming languages. Most practical intersection type systems have supported onlyrefinement intersections, which increase the expressiveness of types (more precise properties can be checked) without altering the expressiveness of terms; refinement intersections can simply be erased during compilation. In contrast,unrestrictedintersections increase the expressiveness of terms, and can be used to encode diverse language features, promising an economy of both theory and implementation. We describe a foundation for compiling unrestricted intersection and union types: an elaboration type system that generates ordinary λ-calculus terms. The key feature is a Forsythe-like merge construct. With this construct, not all reductions of the source program preserve types; however, we prove that ordinary call-by-value evaluation of the elaborated program corresponds to a type-preserving evaluation of the source program. We also describe a prototype implementation and applications of unrestricted intersections and unions: records, operator overloading, and simulating dynamic typing.
9
Mehar, Pramod Kumar, and Mrs Madhu Upadhyay. "Power System Stability Study on Multi Machine Systems having DFIG Based Wind Generation System." SMART MOVES JOURNAL IJOSCIENCE 6, no. 3 (March 10, 2020): 27–30. http://dx.doi.org/10.24113/ijoscience.v6i3.279.
Full textAbstract:
Power system stability is related to principles of rotational motion and the swing equation governing the electromechanical dynamic behavior. In the special case of two finite machines the equal area criterion of stability can be used to calculate the critical clearing angle on the power system, it is necessary to maintain synchronism, otherwise a standard of service to the consumers will not be achieved. With the increasing penetration of doubly fed induction generators (DFIGs), the impact of the DFIG on transient stability attracts great attention. Transient stability is largely dominated by generator types in the power system, and the dynamic characteristics of DFIG wind turbines are different from that of the synchronous generators in the conventional power plants. The analysis of the transient stability on DFIG integrated power systems has become a very important issue. This paper is a review of three types of stability condition. The first type of stability, steady state stability explains the maximum steady state power and the power angle diagram. There are several methods to improve system stability in which some methods are explained.
10
Giorgi, Roberto, Farnam Khalili, and Marco Procaccini. "Translating Timing into an Architecture: The Synergy of COTSon and HLS (Domain Expertise—Designing a Computer Architecture via HLS)." International Journal of Reconfigurable Computing 2019 (November 3, 2019): 1–18. http://dx.doi.org/10.1155/2019/2624938.
Full textAbstract:
Translating a system requirement into a low-level representation (e.g., register transfer level or RTL) is the typical goal of the design of FPGA-based systems. However, the Design Space Exploration (DSE) needed to identify the final architecture may be time consuming, even when using high-level synthesis (HLS) tools. In this article, we illustrate our hybrid methodology, which uses a frontend for HLS so that the DSE is performed more rapidly by using a higher level abstraction, but without losing accuracy, thanks to the HP-Labs COTSon simulation infrastructure in combination with our DSE tools (MYDSE tools). In particular, this proposed methodology proved useful to achieve an appropriate design of a whole system in a shorter time than trying to design everything directly in HLS. Our motivating problem was to deploy a novel execution model called data-flow threads (DF-Threads) running on yet-to-be-designed hardware. For that goal, directly using the HLS was too premature in the design cycle. Therefore, a key point of our methodology consists in defining the first prototype in our simulation framework and gradually migrating the design into the Xilinx HLS after validating the key performance metrics of our novel system in the simulator. To explain this workflow, we first use a simple driving example consisting in the modelling of a two-way associative cache. Then, we explain how we generalized this methodology and describe the types of results that we were able to analyze in the AXIOM project, which helped us reduce the development time from months/weeks to days/hours.
11
Bohno, Takaaki, Akira Tomioka, Shinichi Nose, Masayuki Konno, Toshio Uede, Tadakazu Imayoshi, Hidemi Hayashi, Katsuya Tsutsumi, and Fujio Irie. "Development of HTS (High-Temperature-Superconductor) Current Leads for 1MW/lkWh Module Type SMES System." IEEJ Transactions on Power and Energy 116, no. 7 (1996): 853–59. http://dx.doi.org/10.1541/ieejpes1990.116.7_853.
Full text
12
Läufer, Konstantin. "Type classes with existential types." Journal of Functional Programming 6, no. 3 (May 1996): 485–518. http://dx.doi.org/10.1017/s0956796800001817.
Full textAbstract:
AbstractWe argue that the novel combination of type classes and existential types in a single language yields significant expressive power. We explore this combination in the context of higher-order functional languages with static typing, parametric polymorphism, algebraic data types and Hindley–Milner type inference. Adding existential types to an existing functional language that already features type classes requires only a minor syntactic extension. We first demonstrate how to provide existential quantification over type classes by extending the syntax of algebraic data type definitions, and give examples of possible uses. We then develop a type system and a type inference algorithm for the resulting language. Finally, we present a formal semantics by translation to an implicitly-typed second-order λ-calculus and show that the type system is semantically sound. Our extension has been implemented in the Chalmers Haskell B. system, and all examples from this paper have been developed using this system.
13
Kazerounian, Milod, Jeffrey S. Foster, and Bonan Min. "SimTyper: sound type inference for Ruby using type equality prediction." Proceedings of the ACM on Programming Languages 5, OOPSLA (October 20, 2021): 1–27. http://dx.doi.org/10.1145/3485483.
Full textAbstract:
Many researchers have explored type inference for dynamic languages. However, traditional type inference computes most general types which, for complex type systems—which are often needed to type dynamic languages—can be verbose, complex, and difficult to understand. In this paper, we introduce SimTyper, a Ruby type inference system that aims to infer usable types—specifically, nominal and generic types—that match the types programmers write. SimTyper builds on InferDL, a recent Ruby type inference system that soundly combines standard type inference with heuristics. The key novelty of SimTyper is type equality prediction , a new, machine learning-based technique that predicts when method arguments or returns are likely to have the same type. SimTyper finds pairs of positions that are predicted to have the same type yet one has a verbose, overly general solution and the other has a usable solution. It then guesses the two types are equal, keeping the guess if it is consistent with the rest of the program, and discarding it if not. In this way, types inferred by SimTyper are guaranteed to be sound. To perform type equality prediction, we introduce the deep similarity (DeepSim) neural network. DeepSim is a novel machine learning classifier that follows the Siamese network architecture and uses CodeBERT, a pre-trained model, to embed source tokens into vectors that capture tokens and their contexts. DeepSim is trained on 100,000 pairs labeled with type similarity information extracted from 371 Ruby programs with manually documented, but not checked, types. We evaluated SimTyper on eight Ruby programs and found that, compared to standard type inference, SimTyper finds 69% more types that match programmer-written type information. Moreover, DeepSim can predict rare types that appear neither in the Ruby standard library nor in the training data. Our results show that type equality prediction can help type inference systems effectively produce more usable types.
14
Tokano, Takashi, Yasuro Nakata, Masayuki Yasuda, Yoshihisa Matsumoto, Yasuhiko Ohno, Teruhiko Hisaoka, Masataka Sumiyoshi, Shunsuke Ogura, Yuji Nakazato, and Hiroshi Yamaguchi. "Wenckebach Type Second Degree Atrioventricular Block in the His-Purkinje System." Japanese Journal of Electrocardiology 16, no. 1 (1996): 1–14. http://dx.doi.org/10.5105/jse.16.1.
Full text
15
Patel, Himanshukumar, and Vipul Shah. "Actuator and system component fault tolerant control using interval type-2 Takagi-Sugeno fuzzy controller for hybrid nonlinear process." International Journal of Hybrid Intelligent Systems 15, no. 3 (August 22, 2019): 143–53. http://dx.doi.org/10.3233/his-190267.
Full text
16
Chuang, Sheuwen, Peter P. Howley, and Shawon S. Gonzales. "An international systems-theoretic comparison of hospital accreditation: developing an implementation typology." International Journal for Quality in Health Care 31, no. 5 (August 25, 2018): 371–77. http://dx.doi.org/10.1093/intqhc/mzy189.
Full textAbstract:
Abstract Objective The integration of quality indicators into the accreditation process has been recognized as a promising strategy worldwide. This study was to explore the implementation patterns of hospital accreditation through the lens of a systems-theory based model, and determine an international accreditation implementation typology. Design A qualitative comparative study of five established international hospital accreditation systems was undertaken based on a systems-theoretic holistic healthcare systems relationship model. A set of key attributes relevant to three systems-theoretic model relationships guided data collection, comparison and synthesis. Setting Hospital accreditation systems in five countries: America, Canada, Australia, Taiwan and France. Results An accreditation implementation typology was developed based on the data synthesis of the similarities and differences among the relationships. A typology including five implementation types of hospital accreditation systems (TYPE I–V) was induced. TYPE I is a basic stand-alone accreditation system. The higher types represent stronger relationships among accreditation system, healthcare organizations and quality measurement systems. The five settings have shifted their accreditation approaches from the basic type (TYPE I). Conclusions The implementation typology of hospital accreditation could serve as a roadmap for refining hospital accreditation systems toward an integrative approach for continuous quality improvement.
17
Guidi, Ferruccio. "A Formal System for the Universal Quantification of Schematic Variables." ACM Transactions on Computational Logic 23, no. 1 (January 31, 2022): 1–37. http://dx.doi.org/10.1145/3470646.
Full textAbstract:
We advocate the use of de Bruijn’s universal abstraction \lambda {\mathord \infty }{}{}{} for the quantification of schematic variables in the predicative setting, and we present a typed \lambda {}{}{}{} -calculus featuring the quantifier \lambda {\mathord \infty }{}{}{} accompanied by other practically useful constructions like explicit substitutions and expected type annotations. Our calculus stands just on two notions, i.e., bound rt-reduction and parametric validity, and has the expressive power of \lambda \mathord \rightarrow . Thus, while not aiming at being a logical framework by itself, it does enjoy many desired invariants of logical frameworks including confluence of reduction, strong normalization, preservation of type by reduction, decidability, correctness of types and uniqueness of types up to conversion. This calculus belongs to the \lambda \delta family of formal systems, which borrow some features from the pure type systems and some from the languages of the Automath tradition, but stand outside both families. In particular, our calculus includes and evolves two earlier systems of this family. Moreover, a machine-checked specification of its theory is available.
18
A., Parkavi, Pushpalatha M.N., Sini Anna Alex, and Premkumar M.K. "Decision Support System Using CNN for Detecting the Type of Disease in Fruits and Vegetables." Webology 19, no. 1 (January 20, 2022): 1315–34. http://dx.doi.org/10.14704/web/v19i1/web19088.
Full textAbstract:
The life of people in modern society is changing rapidly because of the high improvements in technology and tools, in the engineering sector. This evolution is also impacting the way of working of people in society in different domains. Machine Learning, Image Processing and Data Analytics are facilitating this growth but not much. Their rate of explorations and innovations in the field of Agriculture is very less, even though people know the importance of this sector and the rate of contribution to the GDP of the country. There are many reasons for it, such as the new generation has lost interest in agriculture as there is a lot of risk in agriculture due to improper irrigation methods, abnormal weather conditions, pests and diseases and finally lack of knowledge to handle the situations. But a country like India needs to focus more on innovations in the agriculture sector as it is the backbone of the country. In our work, we have made an attempt to analyze and find the different patterns of the disease appearing on the vegetable/fruit and identify the category of the disease. So, the prediction of disease type is done based on the patterns implemented using Convolutional Neural Network, and the accuracy of the models is measured. In this study, we have focused on tomato vegetable which is a major crop worldwide. This work can also make it flexible with other predominant fruits/vegetables to analyze it’s patterns and predict the relevant diseases.
19
Barthe, Gilles, Peter Dybjer, and Peter Thiemann. "Special issue on Dependent Type Theory Meets Programming Practice CALL FOR PAPERS." Journal of Functional Programming 11, no. 4 (July 2001): 437. http://dx.doi.org/10.1017/s0956796801004105.
Full textAbstract:
Modern programming languages rely on advanced type systems that detect errors at compile-time. While the benefits of type systems have long been recognized, there are some areas where the standard systems in programming languages are not expressive enough. Language designers usually trade expressiveness for decidability of the type system. Some interesting programs will always be rejected (despite their semantical soundness) or be assigned uninformative types.There are several remedies to this situation. Dependent type systems, which allow the formation of types that explicitly depend on other types or values, are one of the most promising approaches. These systems are well-investigated from a theoretical point of view by logicians and type theorists. For example, dependent types are used in proof assistants to implement various logics and there are sophisticated proof editors for developing programs in a dependently typed language.To the present day, the impact of these developments on practical programming has been small, partially because of the level of sophistication of these systems and of their type checkers. Only recently, there have been efforts to integrate dependent systems into intermediate languages in compilers and programming languages. Additional uses have been identified in high-profile applications such as mobile code security, where terms of a dependently typed lambda calculus to encode safety proofs.A special issue of the Journal of Functional Programming will be devoted to the interplay between dependent type theory and programming practice. We welcome technical contributions in the field, as well as position papers that:[bull ] make researchers in programming languages aware of new developments and research directions on the theory side;[bull ] point out to theorists practical uses of advanced type systems and urge them to address theoretical problems arising in emerging applications.Authors who are concerned about the appropriateness of a topic are welcome to contact the guest editors. Manuscripts should be unpublished works and not submitted elsewhere. Revised and enhanced versions of papers published in conference proceedings that have not appeared in archival journals are eligible for submission. All submissions will be reviewed according to the usual standards of scholarship and originality.Submissions should be sent to Gilles Barthe (Gilles.Barthe@inria.fr), with a copy to Nasreen Ahmad (nasreen@dcs.gla.ac.uk). Submitted articles should be sent in postscript format, preferably gzipped and uuencoded. In addition, please send, as plain text, title, abstract and contact information.The submission deadline is December 1st, 2001.
20
Giannini, Paola, Furio Honsell, and Simona Ronchi Della Rocca. "Type Inference: Some Results, Some Problems1." Fundamenta Informaticae 19, no. 1-2 (July 1, 1993): 87–125. http://dx.doi.org/10.3233/fi-1993-191-205.
Full textAbstract:
In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.
21
Gajica, Gordana, Aleksandra Sajnovic, Ksenija Stojanovic, Milan Antonijevic, Nikoleta Aleksic, and Branimir Jovancicevic. "The influence of pyrolysis type on shale oil generation and its composition (upper layer of Aleksinac oil shale, Serbia)." Journal of the Serbian Chemical Society 82, no. 12 (2017): 1461–77. http://dx.doi.org/10.2298/jsc170421064g.
Full textAbstract:
The influence of pyrolysis type on the shale oil generation and its composition was studied. Different methods such as Rock-Eval pyrolysis, thermogravimetric analysis (TGA) and pyrolysis in the open and closed systems were applied. Samples from the Upper layer of Aleksinac oil shale (Serbia) were used as a substrate and first time characterized in detail. The impact of kerogen content and type on the shale oil generation in different pyrolysis systems was also estimated. Majority of the analysed samples have total organic carbon content > 5 wt. % and contain oil prone kerogen types I and/or II. Therefore, they can be of particular interest for the pyrolytic processing. The thermal behaviour of analysed samples obtained by TGA is in agreement with Rock-Eval parameters. The pyrolysis of oil shale in the open system gives higher yield of shale oil than the pyrolysis in the closed system. The yield of hydrocarbons (HCs) in shale oil produced by the open pyrolysis system corresponds to an excellent source rock potential, while HCs yield from the closed system indicates a very good source rock potential. The kerogen content has a greater impact on the shale oil generation than kerogen type in the open pyrolysis system, while kerogen type plays a more important role on the generation of shale oil than the kerogen content in the closed system. The composition of the obtained shale oil showed certain undesirable features, due to the relatively high contents of olefinic HCs (open system) and polar compounds (closed system), which may require further treatment to be used.
22
JONES, SIMON PEYTON, DIMITRIOS VYTINIOTIS, STEPHANIE WEIRICH, and MARK SHIELDS. "Practical type inference for arbitrary-rank types." Journal of Functional Programming 17, no. 1 (January 2007): 1–82. http://dx.doi.org/10.1017/s0956796806006034.
Full textAbstract:
AbstractHaskell's popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. One such feature is the ability to write functions with higher-rank types – that is, functions that take polymorphic functions as their arguments. Complete type inference is known to be undecidable for higher-rank (impredicative) type systems, but in practice programmers are more than willing to add type annotations to guide the type inference engine, and to document their code. However, the choice of just what annotations are required, and what changes are required in the type system and its inference algorithm, has been an ongoing topic of research. We take as our starting point a λ-calculus proposed by Odersky and Läufer. Their system supports arbitrary-rank polymorphism through the exploitation of type annotations on λ-bound arguments and arbitrary sub-terms. Though elegant, and more convenient than some other proposals, Odersky and Läufer's system requires many annotations. We show how to use local type inference (invented by Pierce and Turner) to greatly reduce the annotation burden, to the point where higher-rank types become eminently usable. Higher-rank types have a very modest impact on type inference. We substantiate this claim in a very concrete way, by presenting a complete type-inference engine, written in Haskell, for a traditional Damas-Milner type system, and then showing how to extend it for higher-rank types. We write the type-inference engine using a monadic framework: it turns out to be a particularly compelling example of monads in action. The paper is long, but is strongly tutorial in style. Although we use Haskell as our example source language, and our implementation language, much of our work is directly applicable to any ML-like functional language.
23
WASTLING, J. M., S. D. ARMSTRONG, R. KRISHNA, and D. XIA. "Parasites, proteomes and systems: has Descartes’ clock run out of time?" Parasitology 139, no. 9 (July 25, 2012): 1103–18. http://dx.doi.org/10.1017/s0031182012000716.
Full textAbstract:
SUMMARYSystems biology aims to integrate multiple biological data types such as genomics, transcriptomics and proteomics across different levels of structure and scale; it represents an emerging paradigm in the scientific process which challenges the reductionism that has dominated biomedical research for hundreds of years. Systems biology will nevertheless only be successful if the technologies on which it is based are able to deliver the required type and quality of data. In this review we discuss how well positioned is proteomics to deliver the data necessary to support meaningful systems modelling in parasite biology. We summarise the current state of identification proteomics in parasites, but argue that a new generation of quantitative proteomics data is now needed to underpin effective systems modelling. We discuss the challenges faced to acquire more complete knowledge of protein post-translational modifications, protein turnover and protein-protein interactions in parasites. Finally we highlight the central role of proteome-informatics in ensuring that proteomics data is readily accessible to the user-community and can be translated and integrated with other relevant data types.
24
Tsamparli, A., and K. Kounenou. "The Greek family system when a child has diabetes mellitus type 1." Acta Paediatrica 93, no. 12 (January 2, 2007): 1646–53. http://dx.doi.org/10.1111/j.1651-2227.2004.tb00857.x.
Full text
25
Kamareddine, Fairouz, Twan Laan, and Rob Nederpelt. "Types in Logic and Mathematics Before 1940." Bulletin of Symbolic Logic 8, no. 2 (June 2002): 185–245. http://dx.doi.org/10.2178/bsl/1182353871.
Full textAbstract:
AbstractIn this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead's Principia Mathematica ([71], 1910–1912) and Church's simply typed λ-calculus of 1940. We first argue that the concept of types has always been present in mathematics, though nobody was incorporating them explicitly as such, before the end of the 19th century. Then we proceed by describing how the logical paradoxes entered the formal systems of Frege, Cantor and Peano concentrating on Frege's Grundgesetze der Arithmetik for which Russell applied his famous paradox and this led him to introduce the first theory of types, the Ramified Type Theory (RTT). We present RTT formally using the modern notation for type theory and we discuss how Ramsey, Hilbert and Ackermann removed the orders from RTT leading to the simple theory of types STT. We present STT and Church's own simply typed λ-calculus (λ→C) and we finish by comparing RTT, STT and λ→C.
26
Salehi, Leili, and Leila Keikavoosi-Arani. "Using the Backman Model in Determining the Dimensions of Self-Care and Its Factors Affecting the Elderly in Tehran City, Iran." Quarterly of the Horizon of Medical Sciences 26, no. 4 (October 1, 2020): 382–97. http://dx.doi.org/10.32598/hms.26.4.3251.1.
Full textAbstract:
Aims Self-care helps older people manage their own health and stay independent by delaying disability. This study aimed to apply the Backman Model in determining the dimensions of self-care and the factors affecting it in the elderly in Tehran. Methods & Materials: This cross-sectional study was performed on 400 elderly members ofnursing homes by systematic random sampling. Data gathering tool included demographic characteristics and self-care behaviors, self-care orientation, life satisfaction assessment, self-confidence, social support, and functional capability. The Chi-square and Pearson correlationand regression analysis were used with a significance coefficient of 0.05. The data were analyzed in SPSS v. 19. Findings: The total mean ages of elderly were 69.11±7.51, 42.5% male. There was significant difference between the types of self-care and gender only in the dimensions of work habits (P<0.001) and medical treatment (P<0.001). Pearson correlation indicated there was a direct and positive relationship between self-care type and self-care orientation (r=0.662, P=0.01). The relationship between self-care type and social support was negative (r=0.075, P=0.01). Conclusion: Factors such as life satisfaction, functional capacity, social support and self-confidence are associated with self-care in the elderly. It is suggested that health system policymakers formulate support programs for the elderly in various forms, such as the elderly access to transportation program, facilities, tax exemptions, etc.
27
Lebediuk, Witalij. "Плинність партійних систему посткомуністичних країнах (1992−2019)." Rocznik Instytutu Europy Środkowo-Wschodniej 17, no. 1 (December 2019): 79–95. http://dx.doi.org/10.36874/riesw.2019.1.3.
Full textAbstract:
The paper offers a thorough analysis of the main types of party systems and their changes in the post-Soviet countries between 1992 and 2019. The evolution of the main criteria concerning the party systems classification has been analyzed. We use a database of all parliamentary elections which took place in the post-communist countries since 1992. This article concludes that the majority of party systems of the post-Soviet countries are not stable and suffering permanent changes. On this basis, 16 party systems that continue to exist in the post-communist countries from 1992 to 2019 are almost half-assigned to the predominant party types. Our findings indicate that Kyrgyzstan and Moldova have moved from a predominant party type to a multiparty type. Russia, Armenia, and Ukraine have changed their party systems from a multiparty type to a predominant party type. Azerbaijan, Kazakhstan, and Tajikistan remain in the predominant party system since the first elections. Slovakia, the Czech Republic and the Baltic countries have remained in the multiparty types since the first elections.
28
Stolyar, A. L. "Large-scale heterogeneous service systems with general packing constraints." Advances in Applied Probability 49, no. 1 (March 2017): 61–83. http://dx.doi.org/10.1017/apr.2016.79.
Full textAbstract:
Abstract A service system with multiple types of customers, arriving according to Poisson processes, is considered. The system is heterogeneous in that the servers can also be of multiple types. Each customer has an independent, exponentially distributed service time, with the mean determined by its type. Multiple customers (possibly of different types) can be placed for service into one server, subject to `packing' constraints, which depend on the server type. Service times of different customers are independent, even if served simultaneously by the same server. The large-scale asymptotic regime is considered such that the customer arrival rates grow to ∞. We consider two variants of the model. For the infinite-server model, we prove asymptotic optimality of the greedy random (GRAND) algorithm in the sense of minimizing the weighted (by type) number of occupied servers in steady state. (This version of GRAND generalizes that introduced by Stolyar and Zhong (2015) for homogeneous systems, with all servers of the same type.) We then introduce a natural extension of the GRAND algorithm for finite-server systems with blocking. Assuming subcritical system load, we prove existence, uniqueness, and local stability of the large-scale system equilibrium point such that no blocking occurs. This result strongly suggests a conjecture that the steady-state blocking probability under the algorithm vanishes in the large-scale limit.
29
Ding, Yuzhang, Haocheng Ji, Rui Liu, Yuwei Jiang, and Minxiang Wei. "Study of the thermal behavior of a battery pack with a serpentine channel." AIP Advances 12, no. 5 (May 1, 2022): 055028. http://dx.doi.org/10.1063/5.0089378.
Full textAbstract:
To effectively enhance the thermal security of the Li-ion battery packs used in the electric vehicle industry, novel cooling systems equipped with serpentine channels are established. Then, the heat generation model is established and verified experimentally. In this research study, the structure of the cooling channel, the coolant velocity, the coolant temperature, and the coolant flow direction are considered to be the influencing factors. The results demonstrate that, by adopting the serpentine cooling channel, a better thermal conductivity can be obtained, and the type-B cooling system possesses a more reasonable structure. For different types of liquid cooling systems, the coolant temperature has a small influence on the temperature nephogram; however, for the same type of system, the coolant temperature strongly influences the temperature distribution. Similarly, the temperature difference is only related to the type of cooling system, with ∼6.09 and 5.53 K obtained for the type-A and type-B cooling systems, respectively. Furthermore, allowing the coolant in the serpentine cooling channels to flow in opposite directions can lower the value of the maximum temperature and temperature difference.
30
Han, Soyoung, Cermetrius Lynell Bohannon, and Yoonku Kwon. "How Has the COVID-19 Pandemic Affected the Perceptions of Public Space Employees?" Land 10, no. 12 (December 3, 2021): 1332. http://dx.doi.org/10.3390/land10121332.
Full textAbstract:
The purpose of this study is to derive the subjective perception about COVID-19 of public space employees and to identify the characteristics of COVID-19 related issues. By using the Q-method, 24 workers in four public spaces located in Blacksburg, Virginia, USA were selected as P-Sample and Q-Sorting was conducted. Three types of perceptions were identified; Type 1 (Expansion of Non-Face-To-Face Service), Type 2 (Expansion of Professional Labor), and Type 3 (Expansion of Welfare Service Type). All three types recognized that when a confirmed case occurs in a public space, the right and safety of users or communities to know is important, and accurate information must be provided, because it is necessary to prevent the spread of infection. Above all, these results show another side of the COVID-19 situation, as the participants in this study are currently in charge of various tasks such as quarantine and service provision in public spaces. This study can be used as basic data for policy response and system improvement of public spaces in the event of an infectious disease such as COVID-19 in the future.
31
Chabas, Hélène, Viktor Müller, Sebastian Bonhoeffer, and Roland R. Regoes. "Epidemiological and evolutionary consequences of different types of CRISPR-Cas systems." PLOS Computational Biology 18, no. 7 (July 26, 2022): e1010329. http://dx.doi.org/10.1371/journal.pcbi.1010329.
Full textAbstract:
Bacteria have adaptive immunity against viruses (phages) in the form of CRISPR-Cas immune systems. Currently, 6 types of CRISPR-Cas systems are known and the molecular study of three of these has revealed important molecular differences. It is unknown if and how these molecular differences change the outcome of phage infection and the evolutionary pressure the CRISPR-Cas systems faces. To determine the importance of these molecular differences, we model a phage outbreak entering a population defending exclusively with a type I/II or a type III CRISPR-Cas system. We show that for type III CRISPR-Cas systems, rapid phage extinction is driven by the probability to acquire at least one resistance spacer. However, for type I/II CRISPR-Cas systems, rapid phage extinction is characterized by an a threshold-like behaviour: any acquisition probability below this threshold leads to phage survival whereas any acquisition probability above it, results in phage extinction. We also show that in the absence of autoimmunity, high acquisition rates evolve. However, when CRISPR-Cas systems are prone to autoimmunity, intermediate levels of acquisition are optimal during a phage outbreak. As we predict an optimal probability of spacer acquisition 2 factors of magnitude above the one that has been measured, we discuss the origin of such a discrepancy. Finally, we show that in a biologically relevant parameter range, a type III CRISPR-Cas system can outcompete a type I/II CRISPR-Cas system with a slightly higher probability of acquisition.
32
DRAGOVIĆ, VLADIMIR, BORISLAV GAJIĆ, and BOŽIDAR JOVANOVIĆ. "SYSTEMS OF HESS–APPEL'ROT TYPE AND ZHUKOVSKII PROPERTY." International Journal of Geometric Methods in Modern Physics 06, no. 08 (December 2009): 1253–304. http://dx.doi.org/10.1142/s0219887809004211.
Full textAbstract:
We start with a review of a class of systems with invariant relations, so called systems of Hess–Appel'rot type that generalizes the classical Hess–Appel'rot rigid body case. The systems of Hess–Appel'rot type have remarkable property: there exists a pair of compatible Poisson structures, such that a system is certain Hamiltonian perturbation of an integrable bi-Hamiltonian system. The invariant relations are Casimir functions of the second structure. The systems of Hess–Appel'rot type carry an interesting combination of both integrable and non-integrable properties. Further, following integrable line, we study partial reductions and systems having what we call the Zhukovskii property: These are Hamiltonian systems on a symplectic manifold M with actions of two groups G and K; the systems are assumed to be K-invariant and to have invariant relation Φ = 0 given by the momentum mapping of the G-action, admitting two types of reductions, a reduction to the Poisson manifold P = M/K and a partial reduction to the symplectic manifold N0 = Φ-1(0)/G; final and crucial assumption is that the partially reduced system to N0 is completely integrable. We prove that the Zhukovskii property is a quite general characteristic of systems of Hess–Appel'rot type. The partial reduction neglects the most interesting and challenging part of the dynamics of the systems of Hess–Appel'rot type — the non-integrable part, some analysis of which may be seen as a reconstruction problem. We show that an integrable system, the magnetic pendulum on the oriented Grassmannian Gr+(n, 2) has a natural interpretation within Zhukovskii property and that it is equivalent to a partial reduction of certain system of Hess–Appel'rot type. We perform a classical and algebro-geometric integration of the system in dimension four, as an example of a known isoholomorphic system — the Lagrange bitop. The paper presents a lot of examples of systems of Hess–Appel'rot type, giving an additional argument in favor of further study of this class of systems.
33
Merino Flecha, Eva. "Familia y parentesco en el Valle de Naviego." Estudios humanísticos. Geografía, historia y arte, no. 17 (February 5, 2021): 423. http://dx.doi.org/10.18002/ehgha.v0i17.6710.
Full textAbstract:
<p>In this article we have attempted to develop a synthesis of the kinship systems through which this type of society has achieved its adaptation to the environment.</p><p>The study is based on the basic methodologies in the development of anthropological work. The main tool was on-field work including participative observation and opera interviews, which cannot be detailed due to space limitations. A basic bibliography was also used to frame the work in the scope of Social Anthropology and specifically in kinship studies.</p><p>The approach to subject was based on the features of the two basic types of family -trunk and nuclear family- and the inheritance systems based on male primogeniture in the former type.</p><p>We focus on the trunk family due to its clear preeminence in the valley over the nuclear type and to the fact that this type of family is extremely infrequent among kinship systems today. We perform an indepth study of the system of inheritance showing the different types of entailment through history. Lastly we have attempted to state clearly the differences and affinities between these historical types and the current inheritance system.</p>
34
Minner, S., J. Schreiner, and W. Saeger. "Adrenal cancer: relevance of different grading systems and subtypes." Clinical and Translational Oncology 23, no. 7 (April 5, 2021): 1350–57. http://dx.doi.org/10.1007/s12094-020-02524-2.
Full textAbstract:
Abstract Purpose The subclassification of adrenal cancers according to the WHO classification in ordinary, myxoid, oncocytic, and sarcomatoid as well as pediatric types is well established, but the criteria for each subtype are not sufficiently determined and the relative frequency of the different types of adrenal cancers has not been studied in large cohorts. Therefore, our large collection of surgically removed adrenal cancers should be reviewed o establish the criteria for the subtypes and to find out the frequency of the various types. Methods In our series of 521 adrenal cancers the scoring systems of Weiss et al., Hough et al., van Slooten et al. and the new Helsinki score system were used for the ordinary type of cancer (97% of our series) and the myxoid type (0.8%). For oncocytic carcinomas (2%), the scoring system of Bisceglia et al. was applied. Results Discrepancies between benign and malignant diagnoses from the first thee classical scoring systems are not rare (22% in our series) and could be resolved by the Helsinki score especially by Ki-67 index (more than 8% unequivocally malignant). Since all our cancer cases are positive in the Helsinki score, this system can replace the three elder systems. For identification of sarcomatoid cancer as rarest type in our series (0.2%), the scoring systems are not practical but additional immunostainings used for soft tissue tumors and in special cases molecular pathology are necessary to differentiate these cancers from adrenal sarcomas. According to the relative frequencies of the different subtypes of adrenal cancers the main type is the far most frequent (97%) followed by the oncocytic type (2%), the myxoid type (0.8%) and the very rare sarcomatoid type (0.2%). Conclusions The Helsinki score is the best for differentiating adrenal carcinomas of the main, the oncocytic, and the myxoid type in routine work. Additional scoring systems for these carcinomas are generally not any longer necessary. Signs of proliferation (mitoses and Ki-67 index) and necroses are the most important criteria for diagnosis of malignancy.
35
Zheng, Hong Yu, Chang Fu Zong, Wei Qiang Zhao, and Liang Chen. "HILS Test Bench Based on Open and close Loop Test for Air ABS System." Advanced Materials Research 694-697 (May 2013): 1484–87. http://dx.doi.org/10.4028/www.scientific.net/amr.694-697.1484.
Full textAbstract:
Anti-lock braking systems (ABS) is a type of mechanical electrical system in which are used to prevent wheel locking of vehicle as a result of excessive actuation of the service braking system, especially on slippery roads. According to electric control unit (ECU) research requirement of ABS system, this paper introduce a hardware-in-the-loop simulation (HILS) test bench, which can through open and close loop test methods accomplish calibration the parameters of the inside ECU, performance evaluation and fault diagnosis and tolerance test, not only can shorten the development cycle, but also save research and development costs of ECU.
36
BARBANERA, FRANCO. "COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS." International Journal of Foundations of Computer Science 01, no. 03 (September 1990): 165–84. http://dx.doi.org/10.1142/s0129054190000138.
Full textAbstract:
Recently some attention has been paid to the properties enjoyed by combinations of term rewriting and λ-calculus based systems. In this paper strong normalization and confluence are proved for λ-terms obtained by merging pure λ-terms and first order canonical term rewriting systems, in the framework of a system which extends the Coppo-Dezani intersection type assignment system. On terms of the resulting calculus we can perform ordinary β and η reductions, as well as the reductions induced in a natural way by the term rewriting systems. In some parts of our analysis we follow rather closely the development contained in a recent paper by Val Breazu-Tannen and Jean Gallier. There, the same properties of strong normalization and confluence are proved for systems obtained by combining the second order polymorphic λ-calculus with first order canonical term rewriting systems. The strong normalization result of Breazu-Tannen and Gallier is proved to be implied by the corresponding property of our system.
37
Xu, Changgui, Xiaofeng Du, Hongtao Zhu, Donghui Jia, Wei Xu, and Huan Lu. "Source-to-sink system and its sedimentary records in the continental rift basins: An example from the Paleogene in the Bohai Sea Area, China." Interpretation 5, no. 4 (November 30, 2017): ST35—ST51. http://dx.doi.org/10.1190/int-2017-0024.1.
Full textAbstract:
The “source-to-sink” concept originated in the study of global change and atmospheric pollution. In recent years, the concept of a source-to-sink system has been widely applied in continental margin sedimentary analysis. In our research, the idea of source-to-sink is applied to the continental rift basin sedimentary system in the Bohai Sea area. The idea emphasizes that the sedimentation dynamics, including erosion, transportation, and accumulation, are considered as a complete source-to-sink system. The sand-rich region often corresponds to a source-to-sink coupling system in a complex continental rift basin, which includes the effective provenance, high-efficiency routing system, and base-level transition. In addition, (1) the effective provenance can be subdivided into explicit and implicit provenance systems in which the implicit provenance system has been shown to be a significant advancement in reservoir prediction for the Bohai Sea area, (2) the sediment-transport pathways and slope-break zone constitute the routing systems, and (3) the base-level transition is one of the allogenic factors that controls the position of the sandstone distribution in a sequence. Based on a large number of previous studies and different characteristics of sequence-stratigraphic models in the Bohai Sea area, we have evaluated three types of source-to-sink systems, including the fault-steep slope, strike-slip fault slope, and gentle slope pattern. In addition, the fault-steep-slope source-to-sink coupling system can be further subdivided into four types, namely, the corner, relay ramps, fault-throw diminishment-type, and valley-type source-to-sink systems. The source-to-sink system of the gentle slope pattern includes the uplift axis valley-type source-to-sink system and the slope-valley-type source-to-sink system. A small-scale, thick layer of fan delta is formed in the fault-steep-slope zone. A continuous braided river delta is formed in the strike-slip fault slope zone. A large-scale, thin layer of braided river delta is formed in the gentle slope zone. The characteristics of source-to-sink systems in continental rift basins are established for the exploration or prediction of favorable zones in the study area, as well as in similar basins.
38
Takahashi, Masaki, Mahito Fujii, Masahiro Shibata, Nobuyuki Yagi, and Shin’ichi Satoh. "Automatic Pitch Type Recognition System from Single-View Video Sequences of Baseball Broadcast Videos." International Journal of Multimedia Data Engineering and Management 1, no. 1 (January 2010): 12–36. http://dx.doi.org/10.4018/jmdem.2010111202.
Full textAbstract:
This article describes a system that automatically recognizes individual pitch types like screwballs and sliders in baseball broadcast videos. These decisions are currently made by human specialists in baseball, who are watching the broadcast video of the game. No automatic system has yet been developed for identifying individual pitch types from single view camera images. Techniques using multiple fixed cameras promise highly accurate pitch type identification, but the systems tend to be large. Our system is designed to identify the same pitch types using only the same single-view broadcast baseball videos used by the human specialists, and accordingly we used a number of features, such as the ball’s location, ball speed and catcher’s stance based on the advice of those specialists. The system identifies the pitch type using a classifier trained with the Random Forests ensemble learning algorithm and achieved about 90% recognition accuracy in experiments.
39
BOIKO, Juliy, Andriy MOKRYTSKY, and Ilya PYATIN. "RESEARCH OF SYNCHRONIZATION CIRCUITS FOR DIGITAL COMMUNICATION SYSTEMS." Herald of Khmelnytskyi National University. Technical sciences 313, no. 5 (October 27, 2022): 113–21. http://dx.doi.org/10.31891/2307-5732-2022-313-5-113-121.
Full textAbstract:
In a digital communication system, the transmitter and receiver have several generators for modulation and demodulation; increasing and decreasing the sampling frequency; synchronization of symbols and bit streams. The causes of phase and carrier frequency errors are the instability of the frequency of the local generators of the transmitter and receiver; presence of Doppler frequency shift; signal propagation delay from the transmitter to the receiver. Synchronization circuits of modern digital communication systems are built on the basis of phase-locked loop (PLL). The purpose of the work is: research of various characteristics of the digital PLL (locking time; established error; transient behavior) for various types of input action; study of the bit error rate of a coherent digital communication system. The PLL consists of the following components: a phase detector that generates a signal that varies in proportion to the phase difference between the input signal and a locally generated sinusoid; controlled generator that generates an output signal whose phase and frequency depends on the input signal; loop filter, which removes unwanted high-frequency components in the output signal of the phase detector and forms a signal that controls the NCO. During adaptation, the PLL has some transient process that depends, in particular, on three factors: the presence of a zero-phase error is determined by the PLL contour filter; the determined bandwidth of the circuit and the initial deviation between the input and reference frequencies affect the PLL adaptation time; the attenuation coefficient of the PLL affects the adaptation behavior: the speed and magnitude of emissions. The study of the output signal of the linear PLL model for damping factor , and , and we will use an input signal of the step function type, linear voltage changes and hyperbola. type 1, type 2, and type 3 PLLs can adapt to a zero-error step input. If the input signal is a linearly varying voltage, PLL types 2 and 3 can adapt with zero phase error, while type 1 adapts with a residual phase error. For hyperbola input, only type 3 PLL can fully adapt: type 2 adapts with residual error, while type 1 cannot adapt. The damping factor should be in the range of . When changing the input signal frequency from 3.55 MHz to 3.72 MHz, the capture time of the type 2 PLL changes from about 150 μs to about 600 μs, that is, when the frequency increases by 170 kHz, the capture time increases almost four times. The error that has occurred is affected by the choice of the contour filter and the features of the synchronization.
40
Stefanović, Aleksandar, Emina Čolak, Gordana Stanojević, and Ljubinka Nikolić. "Effects of introducing Type&Screen system on rational use of transfusions." Hospital Pharmacology - International Multidisciplinary Journal 8, no. 2 (2021): 1051–57. http://dx.doi.org/10.5937/hpimj2102051s.
Full textAbstract:
Introduction: The number of blood donors at the global level has decreased primarily due to ethical and age-related changes in the structure of the planet's population. In addition, there is over ordering of blood for surgical patients. Accordingly, there is a need for rationalizing the testing i.e. reducing the number of cross-matchings and decrease in the use of blood. A type and screen (T&S) upon admission is sufficient for most patients. Determination of ABO blood group and Rh type, and screens for clinically significant alloantibodies is denoted as type and screen (T&S). Aim: Comparison of pharmaco-economic effect using transfusion indices on the number of performed cross-matches and the amount of packed red blood cells issued. Material and Methods: The authors present the comparison between the year 2010 before the introduction of the Type and Screen (T&S) system and the year 2019 when the T&S system and restrictive policy in transfusion practice, were introduced. Data for 2010 were collected from written transfusion protocols of the clinic, and for 2019 were obtained from the hospital information system (Heliant) and written transfusion protocols. The difference between two groups of data was examine with Chi-square test and Fisher exact test, with the reliability level set at p<0.05. Results: With the introduction of the T&S system, the number of cross-matches was reduced from 0.63 to 0.49 and the number of blood units was reduced from 0.21 to 0.11 per hospitalized patient, which at the level of one clinic represents a significant pharmacoeconomic contribution of approximately 50%. In our study, after processing T&S in ordering of blood, the indices (CTR, %T, TI) failed to improve. Despite of unsatisfactory transfusion indices, the application of restrictive indication policies in accordance with national and international guidelines has led to highly significant reduction in the consumption of total blood from 3243 to 1867 blood units. The BOQ as an overall assessment of the results after the introduction of the T&S procedure indicated improvement. Conclusions: The introduction of validation in blood transfusion indirectly draws the attention of prescribing physicians to take into account the significance of blood therapy. The effects of the introduction of the T&S method and restrictive transfusion policy are savings in blood consumption, decreased number of patients tested, a significant reduction in used blood units, and the number of performed cross-matches, despite the increased number of patients.
41
Lelis, Levi. "Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics." Proceedings of the International Symposium on Combinatorial Search 4, no. 1 (August 20, 2021): 123–32. http://dx.doi.org/10.1609/socs.v4i1.18281.
Full textAbstract:
In this paper we advance the line of research launched by Knuth which was later improved by Chen for predicting the size of the search tree expanded by heuristic search algorithms such as IDA*. Chen's Stratified Sampling (SS) uses a partition of the nodes in the search tree called type system to guide its sampling. Recent work has shown that SS using type systems based on integer-valued heuristic functions can be quite effective. However, type systems based on real-valued heuristic functions are often too large to be practical. We use the k-means clustering algorithm for creating effective type systems for domains with real-valued heuristics. Orthogonal to the type systems, another contribution of this paper is the introduction of an algorithm called Active SS. SS allocates the same number of samples for each type. Active SS is the application of the idea of active sampling to search trees. Active SS allocates more samples to the types with higher uncertainty. Our empirical results show that (i) SS using clustering-based type systems tends to produce better predictions than competing schemes that do not use a type system, and that (ii) Active SS can produce better predictions than the regular version of SS.
42
Das, Ankush, Di Wang, and Jan Hoffmann. "Probabilistic Resource-Aware Session Types." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 1925–56. http://dx.doi.org/10.1145/3571259.
Full textAbstract:
Session types guarantee that message-passing processes adhere to predefined communication protocols. Prior work on session types has focused on deterministic languages but many message-passing systems, such as Markov chains and randomized distributed algorithms, are probabilistic. To implement and analyze such systems, this article develops the meta theory of probabilistic session types with an application focus on automatic expected resource analysis. Probabilistic session types describe probability distributions over messages and are a conservative extension of intuitionistic (binary) session types. To send on a probabilistic channel, processes have to utilize internal randomness from a probabilistic branching or external randomness from receiving on a probabilistic channel. The analysis for expected resource bounds is smoothly integrated with the type system and is a variant of automatic amortized resource analysis. Type inference relies on linear constraint solving to automatically derive symbolic bounds for various cost metrics. The technical contributions include the meta theory that is based on a novel nested multiverse semantics and a type-reconstruction algorithm that allows flexible mixing of different sources of randomness without burdening the programmer with complex type annotations. The type system has been implemented in the language NomosPro with linear-time type checking. Experiments demonstrate that NomosPro is applicable in different domains such as cost analysis of randomized distributed algorithms, analysis of Markov chains, probabilistic analysis of amortized data structures and digital contracts. NomosPro is also shown to be scalable by (i) implementing two broadcast and a bounded retransmission protocol where messages are dropped with a fixed probability, and (ii) verifying the limiting distribution of a Markov chain with 64 states and 420 transitions.
43
Lin, Jinzhong, Anders Fuglsang, Anders Lynge Kjeldsen, Kaiyan Sun, Yuvaraj Bhoobalan-Chitty, and Xu Peng. "DNA targeting by subtype I-D CRISPR–Cas shows type I and type III features." Nucleic Acids Research 48, no. 18 (September 22, 2020): 10470–78. http://dx.doi.org/10.1093/nar/gkaa749.
Full textAbstract:
Abstract Prokaryotic CRISPR–Cas immune systems are classified into six types based on their effector complexes which cleave dsDNA specifically (types I, II and V), ssRNA exclusively (type VI) or both ssRNA via a ruler mechanism and ssDNA unspecifically (type III). To date, no specific cleavage of ssDNA target has been reported for CRISPR–Cas. Here, we demonstrate dual dsDNA and ssDNA cleavage activities of a subtype I-D system which carries a type III Cas10-like large subunit, Cas10d. In addition to a specific dsDNA cleavage activity dependent on the HD domain of Cas10d, the helicase Cas3′ and a compatible protospacer adjacent motif (PAM), the subtype I-D effector complex can cleave ssDNA that is complementary in sequence to the crRNA. Significantly, the ssDNA cleavage sites occur at 6-nt intervals and the cleavage is catalysed by the backbone subunit Csc2 (Cas7), similar to the periodic cleavage of ssRNA by the backbone subunit of type III effectors. The typical type I cleavage of dsDNA combined with the exceptional 6-nt spaced cleavage of ssDNA and the presence of a type III like large subunit provide strong evidence for the subtype I-D system being an evolutionary intermediate between type I and type III CRISPR–Cas systems.
44
Nyrkov, Anatoliy, Sergei Sokolov, Anna Karpina, Alex Chernyakov, and Vagiz Gaskarov. "Cluster-type models in the logistics industry." International Journal of Engineering & Technology 7, no. 1 (January 1, 2018): 39. http://dx.doi.org/10.14419/ijet.v7i1.8788.
Full textAbstract:
The aim of the present article is to detect the basic principles of secure electronic document circulation (EDCS) systems for multi-location structure with multiple non-uniform connections. As far as the object of research is concerned, transport-logistical clusters are used. It is heterogeneous system with implicit classification. In the article were examined the basic stages of designing, methods and models of information security in electronic document circulation systems, operating in distributed network and interacting with other informational systems. The article contains analysis of regulatory and legal base in information security field of Russian Federation. The model of cluster information flows has been created for research purposes, based on hierarchical interaction model of transport-logistical cluster components. We describe transport-logistical cluster subjects, categorized information and supposed information assets. Based on potential threats and system vulnerabilities, mechanisms of EDCS information security have been described. EDCS data exchange process with another system, containing personal data has been described. As a result, a comprehensive set of measures was formed as well as information security tools based on requirements for data protection of personal data, and automated control systemsand transport-logistical cluster information systems at critical objects.
45
SCULTHORPE, NEIL, NICOLAS FRISBY, and ANDY GILL. "The Kansas University rewrite engine." Journal of Functional Programming 24, no. 4 (July 2014): 434–73. http://dx.doi.org/10.1017/s0956796814000185.
Full textAbstract:
AbstractWhen writing transformation systems, a significant amount of engineering effort goes into setting up the infrastructure needed to direct individual transformations to specific targets in the data being transformed. Strategic programming languages provide general-purpose infrastructure for this task, which the author of a transformation system can use for any algebraic data structure. The Kansas University Rewrite Engine (KURE) is a typed strategic programming language, implemented as a Haskell-embedded domain-specific language. KURE is designed to support typed transformations over typed data, and the main challenge is how to make such transformations compatible with generic traversal strategies that should operate over any type. Strategic programming in a typed setting has much in common with datatype-generic programming. Compared to other approaches to datatype-generic programming, the distinguishing feature of KURE's solution is that the user can configure the behaviour of traversals based on the location of each datum in the tree, beyond their behaviour being determined by the type of each datum. This article describes KURE's approach to assigning types to generic traversals, and the implementation of that approach. We also compare KURE, its design choices, and their consequences, with other approaches to strategic and datatype-generic programming.
46
Szewczuk-Krypa, Natalia, Marta Drosińska-Komor, Jerzy Głuch, and Łukasz Breńkacz. "Comparison Analysis of Selected Nuclear Power Plants Supplied With Helium from High-Temperature Gas-Cooled Reactor." Polish Maritime Research 25, s1 (May 1, 2018): 204–10. http://dx.doi.org/10.2478/pomr-2018-0043.
Full textAbstract:
Abstract The article presents results of efficiency calculations for two 560 MW nuclear cycles with high-temperature gas-cooled reactor (HTGR). An assumption was made that systems of this type can be used in so-called marine nuclear power plants. The first analysed system is the nuclear steam power plant. For the steam cycle, the efficiency calculations were performed with the code DIAGAR, which is dedicated for analysing this type of systems. The other system is the power plant with gas turbine, in which the combustion chamber has been replaced with the HTGR. For this system, a number of calculations were also performed to assess its efficiency. Moreover, the article names factors in favour of floating nuclear power plants with HTGRs, which, due to passive safety systems, are exposed to much smaller risk of breakdown than other types of reactors which were in common use in the past. Along with safety aspects, it is also economic and social aspect which make the use of this type of systems advisable.
47
Vankerckhoven, Ann, Thaïs Baert, Matteo Riva, Christine De Bruyn, Gitte Thirion, Katja Vandenbrande, Jolien Ceusters, Ignace Vergote, and An Coosemans. "Type of chemotherapy has substantial effects on the immune system in ovarian cancer." Translational Oncology 14, no. 6 (June 2021): 101076. http://dx.doi.org/10.1016/j.tranon.2021.101076.
Full text
48
Brown, Phillip, Sangmi Lee, Driss Elhanafi, Wilhelm Tham, Marie-Louise Danielsson-Tham, Gloria Lopez-Valladares, Yi Chen, Mirena Ivanova, Pimlapas Leekitcharoenphon, and Sophia Kathariou. "Investigation of a Listeria monocytogenes Chromosomal Immigration Control Region Reveals Diverse Restriction Modification Systems with Complete Sequence Type Conservation." Microorganisms 11, no. 3 (March 8, 2023): 699. http://dx.doi.org/10.3390/microorganisms11030699.
Full textAbstract:
Listeria monocytogenes is a Gram-positive pathogen responsible for the severe foodborne disease listeriosis. A chromosomal hotspot between lmo0301 and lmo0305 has been noted to harbor diverse restriction modification (RM) systems. Here, we analyzed 872 L. monocytogenes genomes to better understand the prevalence and types of RM systems in this region, designated the immigration control region (ICR). Type I, II, III and IV RM systems were found in 86.1% of strains inside the ICR and in 22.5% of strains flanking the ICR. ICR content was completely conserved within the same multilocus sequence typing-based sequence type (ST), but the same RM system could be identified in diverse STs. The intra-ST conservation of ICR content suggests that this region may drive the emergence of new STs and promote clone stability. Sau3AI-like, LmoJ2 and LmoJ3 type II RM systems as well as type I EcoKI-like, and type IV AspBHI-like and mcrB-like systems accounted for all RM systems in the ICR. A Sau3AI-like type II RM system with specificity for GATC was harbored in the ICR of many STs, including all strains of the ancient, ubiquitous ST1. The extreme paucity of GATC recognition sites in lytic phages may reflect ancient adaptation of these phages to preempt resistance associated with the widely distributed Sau3AI-like systems. These findings indicate that the ICR has a high propensity for RM systems, which are intraclonaly conserved and may impact bacteriophage susceptibility as well as ST emergence and stability.
49
Kosaraju, Naren Kumar, and Vineela Kanakamedala. "FRIEND RECOMMENDATION USING GRAPH MINING ON SOCIAL MEDIA." International Journal of Engineering Technology and Management Sciences 4, no. 5 (September 28, 2020): 57–65. http://dx.doi.org/10.46647/ijetms.2020.v04i05.011.
Full textAbstract:
Recommendation system is an important type of machine learning algorithm that provide precise suggestions to the users. Recommendation systems are used in innumerable types of areas such as generation of playlists, music and video services like Jio savaan, wynk, amazon prime music etc., and products recommendation for users in e-commerce applications and commercial applications. The recommendations that are provided by various types of applications increases the speed for identifying and makes easier to access the products that users are interested in. For each user, the recommendation system is capable of envisaging the future predilections on a set of items and recommend the top items. In several industries, recommendation systems are very useful as they generate huge amount of income and this type of industries can stand uniquely from competitors. Due to cumbersome number of items that each user can find in the web, the impact of recommendation system has been increased in the internet. Recommendation systems are used for custom-made navigation by getting huge amount of data particularly in social media domain for recommending friends. A recommendation system act as a subclass for the information filtering system that pursue to predict the rating. The similarity measures that are calculated in this research are Jaccard distance and Otsuka-Ochiai coefficient. The feature extractions that are used in this paper are Adar index, PageRank, Katz centrality, Hits score. Now a days many research people are implementing different types of algorithms in various domains for recommendation systems.
50
Umoh, Uduak, Imo Eyoh, Vadivel S. Murugesan, Abdultaofeek Abayomi, and Samuel Udoh. "Hybrid intelligent telemedical monitoring and predictive systems." International Journal of Hybrid Intelligent Systems 17, no. 1-2 (July 13, 2021): 43–57. http://dx.doi.org/10.3233/his-210005.
Full textAbstract:
Healthcare systems need to overcome the high mortality rate associated with cardiovascular disease and improve patients’ health by using decision support models that are both quantitative and qualitative. However, existing models emphasize mathematical procedures, which are only good for analyzing quantitative decision variables and have failed to consider several relevant qualitative decision variables which cannot be simply quantified. In solving this problem, some models such as interval type-2 fuzzy logic (IT2FL) and flower pollination algorithm (FPA) have been used in isolation. IT2FL is a simplified version of T2FL, with a reduced computation complexity and additional design degrees of freedom, but it cannot naturally achieve the rules it uses in making decisions. FPA is a bio-inspired method based on the process of pollination, executed by the flowering plants, with the ability to learn, generalize and process numerous measurable data, but it is not able to describe how it reaches its decisions. The hybrid intelligent IT2FL-FPA system can conquer the constraints of individual approaches and strengthens their robustness to cope with healthcare data. This work develops a hybrid intelligent telemedical monitoring and predictive system using IT2FL and FPA. The main objective of this paper is to find the best membership functions (MFs) parameters of the IT2FL for an optimal solution. The FPA technique is employed to find the optimal parameters of the MFs used for IT2FLSs. The authors tested two data sets for the monitoring and prediction problems, namely: cardiovascular disease patients’ clinical and real-time datasets for shock-level monitoring and prediction.