Search

Paper-based analytical devices (PADs) are simple, convenient, and portable devices that can detect selected substances and quickly display results. PADs are being adopted at increasing rates for use in an expanding array of fields including biochemistry, drug test assaying, and environmental analysis. Compared with traditional analytical methodology, PADs provide several advantages including the following: (1) the capacity for easy mass production; (2) portability; (3) low cost; and (4) small sample volume requirements. These features position PADs as significantly useful tools in rural areas and developing countries, where sophisticated laboratories are limited. In addition to these advantages, PADs offer great potential for integration with the Internet and new artificial intelligence technology. Integrating what may be called “lab-on-a-paper” technology with the Internet of Things offers new opportunities for individuals, in the lab, in the field, and even at home, to carry out advanced examinations and analyses of a variety of things including point-of-care health diagnostics, health status, and environmental quality. In this way, PADs can significantly improve quality of life for a great number of people.

We present a computational framework for stability analysis of systems of coupled linear Partial-Differential Equations (PDEs). The class of PDE systems considered in this paper includes parabolic, elliptic and hyperbolic systems with Dirichlet, Neuman and mixed boundary conditions. The results in this paper apply to systems with a single spatial variable. We exploit a new concept of state for PDE systems which allows us to include the boundary conditions directly in the dynamics of the PDE. The resulting algorithms are implemented in Matlab, tested on several motivating and illustrative examples, and the codes have been posted online. Numerical testing indicates the approach has little or no conservatism for a large class of systems and can analyze systems of up to 20 coupled PDEs.

[EN] In this work, we present a dataset which provides information on the scientific program of a set conferences of Machine Learning. Data were extracted from the IEEE Xplore Digital Library and the official web site of the International Conference on Machine Learning Applications (ICMLA). We include data of four different editions (from 2014 to 2017). Web scrapping techniques were used to mine the data contained in these web sites. The dataset covers 448 papers presented in the conference and every paper contains 6 attributes including information about the thematic session in which they were presented in the conference. The dataset is hosted in the Mendeley Dataset Repository., This work was partially supported by IDEIAGEOCA Research Group of the Universidad Politecnica Salesiana. This work also has been supported by the EU (FEDER) and the Spanish MINECO under grant TIN2015-69175-C4-1-R, and by Generalitat Valenciana PROMETE0112019/018.

The classification of science into disciplines is at the heart of bibliometric analyses. While most classifications systems are implemented at the journal level, their accuracy has been questioned, and paper-level classifications have been considered by many to be more precise. However, few studies investigated the difference between journal and the paper classification systems. This study addresses this gap by comparing the journal- and paper-level classifications for the same set of papers and journals. This isolates the effects of classification precision (i.e., journal- or paper-level) to reveal the extent of paper misclassification. Results show almost half of papers could be misclassified in journal classification systems. Given their importance in the construction and analysis of bibliometric indicators, more attention should be given to the robustness and accuracy of these disciplinary classifications schemes.

In this paper, we introduce a framework for processing genetics and genomics literature, based on ontologies and lexical resources from the biomedical domain. The main objective is to support the diagnosis process that is done by medical geneticists who extract knowledge from published works. We constructed a pipeline that gathers several genetics- and genomics-related resources and applies natural language processing techniques, which include named entity recognition and relation extraction. Working on a corpus created from PubMed abstracts, we built a knowledge database that can be used for processing medical records written in Spanish. Given a medical record from Uruguayan healthcare patients, we show how we can map it to the database and perform graph queries for relevant knowledge paths. The framework is not an end user application, but an extensible processing structure to be leveraged by external applications, enabling software developers to streamline incorporation of the extracted knowledge. Keywords: Controlled vocabulary, Natural language processing, Genomics, Automated pattern recognition, Publications, Medical records

This paper provides tutorial introductions to Field-Programmable Gate Arrays (FPGAs) and the concept of hardware compilation - the translation of a high-level programming language directly into a hardware design. As an illustration, a simple stepper motor control program is presented. The research aims of the sensor validation programme are described, and the benefits of using hardware compilation techniques are presented. This leads on in the conclusion of the paper to a more general discussion of the interaction between research and technology, and in particular the influence of information technology upon control engineering.

This paper describes how SHARE (Sharing Hosted Autonomous Research Environments) satisfies the criteria of the Elsevier 2011 Executable Paper Grand Challenge. This challenge aims at disseminating the use of systems that provide reviewers and fellow scientists a convenient way to reproduce computational results of research papers. This can involve among others the calculation of a number, the plotting of a diagram, the automatic proof of a theorem or the interactive transformation of various inputs into a complex output document. Besides reproducing the literate results, readers of an executable paper should also be able to explore the result space by entering different input parameters than the ones reported in the original text. SHARE is a web portal that enables academics to create, share, and access remote virtual machines that can be cited from research papers. By deploying in SHARE a copy of the required operating system as well as all the relevant software and data, authors can make a conventional paper fully reproducible and interactive. Shared virtual machines can also contain the original paper text— when desirable even with embedded computations. This paper shows the concrete potential of SHARE-based articles by means of an example virtual machine that is based on a conventional research article published by Elsevier recently. More generally, it demonstrates how SHARE has supported the publication workflow of a journal special issue and various workshop proceedings. Finally, it clarifies how the SHARE architecture supports among others the Elsevier challenge's licensing and scalability requirements without domain specific restrictions.

Technology is improving day-by-day and so is the usage of mobile devices. Every activity that would involve manual and paper transactions can now be completed in seconds using your fingertips. On one hand, life has become fairly convenient with the help of mobile devices, whereas on the other hand security of the data and the transactions occurring in the process have been under continuous threat. This paper, re-evaluates the different policies and procedures used for preserving the privacy of sensitive data and device location. Policy languages have been very vital in the mobile environments as they can be extended/used significantly for sending/receiving any data. In the mobile environment users always go to service providers to access various services. Hence, communications between the service providers and mobile handsets needs to be secured. Also, the data access control needs to be in place. A section of this paper will review the communication paths and channels and their related access criteria. This paper is a contribution to the mobile domain, showing the possible attacks related to privacy and the various mechanisms used to preserve the end-user privacy. In addition, it also gives a comparison of the different privacy preserving methods in mobile environments to provide guidance to the readers. Finally, the paper summarizes future research challenges in the area of privacy preservation. This paper examines the 'where' problem and in particular, examines tradeoffs between enforcing location security at a device vs. enforcing location security at an edge location server. This paper also sketches an implementation of location security solution at both the device and the edge location server and presents detailed experiments using real mobility and user profile data sets collected from multiple data sources (taxicabs, Smartphones).

International audience

Scientific literacy is a fundamental attribute that supports researchers in both research and research writing. This chapter describes the rationale and design of a course that uses strategic, critical reading to teach research writing to doctoral candidates. The course, ‘Effective Biomedical Reading and Writing’, was designed by an authors’ editor with scientific qualifications. In the course, students are guided through the independent writing of a research paper using their own data, according to a scheme in which a paper is built up around the results. Through reading and critical discussion of published papers representing a range of qualities and topics, students develop a framework of knowledge that helps them assess the effectiveness of their own writing. They are supported throughout the course, in reading and writing, by the instructor’s knowledge of the research topics and methodologies. Subject specialists who work as language professionals and who acquire language teaching skills are uniquely positioned to develop courses for doctoral students in their own fields.

We propose an intelligent sensor system based on a new sensing methodology, relying also on 3D map reconstruction techniques, for computing with high precision, in real-time and without human intervention the parameters needed for stream-flow computa- tion: water levels, morphology of the streams of all potentially flooded areas by each controlled stream. The collected data will be continuously transmitted, through a communication infrastructure, to software agents designed to compute the stream-flow and to quantify the spatial distribution of flood risk for each controlled watershed. The computed risks, together with other data coming from other sources (barometric sensors, camera operators of public organizations, emergency agencies, private citizens), will be analyzed by a diagnostic decision system implementing a risk-alert scheduling strategy. This system will be able to diagnose the health state of the controlled environment and to define specialized alarm levels for each potentially interested area that will be used to alert all citizens (ubiquity) locally present (alerting locality).

Sheet-break is a long standing problem in pulp and paper industry. If advance warnings can be issued ahead of time, corrective actions may be taken to prevent some of the breaks. In this paper, we describe the development and implementation of an online monitoring scheme. A data based approach was taken in this analysis. PCA was used to model the process, and a combined index based on the Hotelling’s T2 and Q-statistics was developed as a sheet-break predictor. As the process is subject to external disturbances, grade changes, and frequent interruptions, preprocessing of the data played an important role in getting consistent results. We used several novel techniques for data selection, scaling and modelling. The models were validated using a large validation data set with known fault condition.

Never before in history has data been generated at such high volumes as it is today. Exploring and analyzing the vast volumes of data has become increasingly dicult. Information visualization and visual data mining can help to deal with the flood of information. The advan- tage of visual data exploration is that the user is directly involved in the data mining process. There are a large number of information visualiza- tion techniques that have been developed over the last two decades to support the exploration of large data sets. In this paper, we propose a classification of information visualization and visual data mining tech- niques based on the data type to be visualized, the visualization technique, and the interaction technique. We illustrate the classification using a few examples, and indicate some directions for future work.

P3P [23, 24] is a set of standards that allow corporations to declare their privacy policies. Hippocratic Databases [6] have been proposed to implement such policies within a corporation's datastore. From an end-user individual's point of view, both of these rest on an uncomfortable philosophy of trusting corporations to protect his/her privacy. Recent history chronicles several episodes when such trust has been willingly or accidentally violated by corporations facing bankruptcy courts, civil subpoenas or lucrative mergers. We contend that data management solutions for information privacy must restore controls in the individual's hands. We suggest that enabling such control will require a radical re-think on modeling, release, and management of personal data.

The structure of the arithmetical Turing degrees provided a refined context for the path-breaking 1930s results of Godel, Turing, Church, and others—work that startlingly revealed how the non-computable impinges on everyday mathematical practice. Many intrinsically interesting phenomena that give depth and content to the general theory inhabit local degree theory. The local theory initially developed through the effectivisation of recursion theoretic forcing techniques. Local results derived messily from global ones through an analysis of constructive content of proofs for D. The broad technical framework was imported and the local theory encouraged a better understanding of its workings. It was not until later that a specifically local approach, with more in common with the theory of the computably enumerable degrees, made use of full approximation and priority. Recent years have seen a minor renaissance in the global-to-local approach, with improved coding techniques being extensively applied to questions related to local definability and decidability. Essential ingredients of recent definability proofs are results and techniques concerned with local structure, which have taken on a role quite unforeseen by their originators.

This paper presents the most recent results obtained in the frame of the ESA study on “Autonomous and Advanced Navigation Techniques”, part of the Technology and Research Programme of ESA. New guidance, navigation and control (GNC) concepts applicable to the near-comet phases of the ROSETTA mission have been investigated and detailed performance results obtained with a complete simulation software tool are described here. This paper is focused on the evaluation and performance assessment of GNC concepts applicable to the descent and landing phase of the mission, including the following points : - Attitude and Articulation Control System (AACS) concepts for a multibody spacecraft (Section 3); - autonomous spacecraft trajectory Guidance, Navigation and Control concepts for the descent phase, including the open-loop and the guided subphases (Section 4); - touch down control concepts (Section 5) The introduction presents the study assumptions, Section 2 is dedicated to the description of the software tool and the simulated models, and a synthesis with further recommendations are discussed in Section 6.

Today's real-time systems are characterized by managing large volumes of data. Efficient database management algorithms for accessing and manipulating data are required to satisfy timing constraints of supported applications. Real-time database systems involve a new research area investigating possible ways of applying database systems technology to real-time systems. Management of real-time information through a database system requires the integration of concepts from both real-time systems and database systems. Some new criteria need to be developed to involve timing constraints of real-time applications in many database systems design issues, such as transaction/query processing, data buffering, CPU, and IO scheduling. In this paper, a basic understanding of the issues in real-time database systems is provided and the research efforts in this area are introduced. Different approaches to various problems of real-time database systems are briefly described, and possible future research directions are discussed. © 1995.

Exploiting the performance potential of distributed memory machines requires a careful distribution of data across the processors. Vienna FORTRAN is a language extension of FORTRAN which provides the user with a wide range of facilities for such mapping of data structures. However, programs in Vienna FORTRAN are written using global data references. Thus, the user has the advantage of a shared memory programming paradigm while explicitly controlling the placement of data. The basic features of Vienna FORTRAN are presented along with a set of examples illustrating the use of these features.

Flow management is the set of functions related to the control of the traffic flow during information transfer. This paper is proposing a total flow management scheme considering both the applications, the transport system and the ATM system. The basic principle has been to adapt the flow management to the pattern of the applications. This is possible by using transport system flow management mechanisms that reflect the application flow parameters and by making important flow parameters visible for the ATM system. The flow management is related to various time resolution regions. The transport system flow management comprises: rate-control and ack-based flow-control. The ATM system flow management comprises: source spacing, rate-control/policing and ack-based flow-control. Spacing schemes based on stretching are proposed for the various application classes.

In this paper we use a simple neural net to model the development of spelling in children, and we describe the results of an experiment which shows that the error rates shown by children in spelling different types of word closely mirror the error scores of the model after it has learned the same words. We conclude that connectionist modelling can inform research into spelling development by focussing attention on the statistical nature of the input-output mappings that children must learn.

The major difficulty in using HDL's to represent design information is that model preparation is a labor intensive task. Also, with VHDL, the large number of possible modeling approaches can lead to models that are unstructured and difficult to understand. In order for HDL's to be used effectively, systematic techniques for model creation must be developed. Some techniques for decreasing the time required to create a HDL model include: providing a means of partial graphical entry of the model; providing the modeler with a library of common, user-definable primitives; and supporting a well-defined modeling style. A CAD tool called Modeler's Assistant that utilizes these techniques to allow rapid development of VHDL behavioral models will be discussed.

I describe several applications of automata theory to the analysis of Datalog programs, ranging from the easy to the difficult, in the hope of convincing the reader that automata theory provides a powerful set of abstractions and tools to database theoreticians.

Outlined here are two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long as it can be verified that the values assigned to off-processor memory locations remain unmodified, we show that we can effectively reuse stored off-processor data. We present experimental data from a 3-D unstructured Euler solver run on iPSC/860 to demonstrate the usefulness of our methods.

OOLP integrates the superior modeling capabilities of object-oriented paradigm in the declarative framework of logic programming. Method invocation in OOLP is given a precise model theoretic semantics which is consistent with that of logic programming. OOLP is extended to a practical object-oriented database language OOLP+ by adding some extra-logical features. OOLP+ allows object identity, multiple inheritance, method overriding and dynamic updating among other features. OOLP+ is implemented by translating it to Prolog. The translated programs executes without metainterpretation. This allows the use of all Prolog or Datalog optimization techniques. In this respect OOLP+ is unique among alternative proposals presented in the literature.

Background Hereditary hearing loss (HHL) is the most common sensory deficit, which highly afflicts humans. With gene sequencing technology development, more variants will be identified and support genetic diagnoses, which is difficult for human experts to diagnose. This study aims to develop a machine learning-based genetic diagnosis model of HHL-related variants of GJB2, SLC26A4 and MT-RNR1. Methods This case-control study included 1898 subjects, among which 1354 were HHL patients and 544 were carriers. Risk assessment models were established based on variants at 144 sites in three genes related to HHL by building six machine learning (ML) models. We compared the ML models with the genetic risk score (GRS) and expert interpretation (EI) to verify the clinical performance. Findings Among the six ML models, the support vector machine (SVM) showed the best performance. For the prediction of HHL-related gene sites in subjects with variants, the area under the receiver operating characteristic (AUC) of the SVM model was 0.803 (0.680–0.814) in the 10-fold stratified cross-validation and 0.751 (0.635–0.779) in external validation. The predicted results were better than both EI and GRS. Furthermore, 11 sites were identified as the smallest feature set that can be accurately predicted. Interpretation The developed SVM model has great potential to be an efficient and effective tool for HHL prediction when high throughput sequencing data are available. Funding This study was supported by the National Key Research and Development Program (2017YFC1001800).

After the presentation of various identification and parameter estimation methods in the previous papers, some selected practical aspects of process identification are discussed. This includes, for a given identification method, the steps from the design of experiments to the verification of the final model. Therefore a general procedure of process identification, the selection of input signals, the selection of the sampling time, off-line and on-line identification, comparison of parameter estimation methods, model order testing and model verification is presented. A short discussion on program packages for process identification follows.

This paper surveys the evolution of “high-lever” programming languages during the first decade of computer programming activity. We discuss the contributions of Zuse in 1945 (the “Plankalkul”), Goldstine and von Neumann in 1946 (“Flow Diagrams”), Curry in 1948 (“Composition”), Mauchly et al. in 1949 (“Short Code”), Burks in 1950 (“Intermediate PL”), Rutishauser in 1951 (“Klammerausdrucke”), Bohm in 1951 (“Formules”), Glennie in 1952 (“AUTOCODE”), Hopper et al. in 1953 (“A-2”), Laning and Zierler in 1953 (“Algebraic Interpreter”), Backus et al. in 1954–1957 (“FORTRAN”), Brooker in 1954 (“Mark I AUTOCODE”), Kamynin and Liubimskii in 1954 (“ΠΠ-2”), Ershov in 1955 (“ΠΠ”), Grems and Porter in 1955 (“BACAIC”), Elsworth et al. in 1955 (“Kompiler 2”), Blum in 1956 (“ADES”), Perlis et al. in 1956 (“IT”), Katz et al. in 1956–1958 (“MATH-MATIC”), Bauer and Samelson in 1956–1958 (U.S. Patent 3,047,228). The principal features of each contribution are illustrated and discussed. For purposes of comparison, a particular fixed algorithm has been encoded (as far as possible) in each of the languages. This research is based primarily on unpublished source materials, and the authors hope that they have been able to compile a fairly complete picture of the early developments in this area.

Despite appealing characteristics for the clinical trials setting, Bayesian inference methods remain scarcely used, especially in randomized controlled clinical trials (RCT). This is particularly true when dealing with a survival endpoint, likely due to the additional complexities to model specifications. We propose to use Bayesian inference to estimate the treatment effect in this setting, using a proportional hazards (PH) model for right-censored data. Implementation of such an estimation process is illustrated on two working examples from cancer RCTs, the ALLOZITHRO and the CLL7-SA trials, both originally analyzed using a frequentist approach. In these two different settings, we show that Bayesian sequential analyses can provide early insight on treatment effect in RCTs. Relying on posterior distributions and predictive posterior probabilities, we find that Bayesian sequential analyses of the ALLOZITHRO trial, which was terminated early due to an unanticipated deleterious effect of the intervention on survival, allow quantifying early that the treatment effect was opposite to what was expected. Then, incorporating historical data in the sequential analyses of the CLL7-SA trial would have allowed the treatment effect to be closer to the protocol hypothesis. These post-hoc results give grounds to advocate for a wider use of Bayesian approaches in RCTs, including those with right-censored endpoints, as informative decision tools.

Publisher Summary The quantification requires the selection of one of a set of special morphemes that designates certain semantic features of whatever is being enumerated. Changes in classifiers are interesting because they provide an occasion to investigate an idea of traditional concern in linguistics—the relationship between language learning and language change. One can use shape or process classifiers for most of the things that have their own taxonomy specific classifiers. The unmarked classifiers are used in place of the more specific marked forms and also true in situations where there are intergenerational differences in use of forms. Numeral classifiers differ from phonology as they appear infrequently in spontaneous conversation and classifier forms are not among the earliest part of the language mastered because they depend not only on the mastery of number concepts but also on having a set of lexemes representing concepts to which they can be applied.

The full advantages of the incremental properties of production systems have yet to be exploited on a large scale. A promising vehicle for this is the task of instructing a system to solve problems in a complex domain. For this, it is important to express the instruction in a language similar to natural language and without detailed knowledge of the inner structure of the system. Instruction and close interaction with the system as it behaves are preferred over a longer feedback loop with more independent learning by the system. The domain is initially an abstract job shop. The beginning system has capabilities for solving problems, processing language, building productions, and interacting with the task environment. All parts of the system are subject to instruction. The main problem-solving strategy, which permeates all four system components, is based on means-ends analysis and goal-subgoal search. This is coupled with an explicit representation of control knowledge. The system's behavior so far is restricted to simple environmental manipulations, a number of which must be taught before more complex tasks can be done.

Summary: Background: Detailed evaluation of bile duct (BD) is main focus during endoscopic ultrasound (EUS). The aim of this study was to develop a system for EUS BD scanning augmentation. Methods: The scanning was divided into 4 stations. We developed a station classification model and a BD segmentation model with 10681 images and 2529 images, respectively. 1704 images and 667 images were applied to classification and segmentation internal validation. For classification and segmentation video validation, 264 and 517 videos clips were used. For man-machine contest, an independent data set contained 120 images was applied. 799 images from other two hospitals were used for external validation. A crossover study was conducted to evaluate the system effect on reducing difficulty in ultrasound images interpretation. Findings: For classification, the model achieved an accuracy of 93.3% in image set and 90.1% in video set. For segmentation, the model had a dice of 0.77 in image set, sensitivity of 89.48% and specificity of 82.3% in video set. For external validation, the model achieved 82.6% accuracy in classification. In man-machine contest, the models achieved 88.3% accuracy in classification and 0.72 dice in BD segmentation, which is comparable to that of expert. In the crossover study, trainees’ accuracy improved from 60.8% to 76.3% (P

Publisher Summary This chapter presents a comparison of biplot display and pencil-and-paper exploratory data analysis (EDA) methods. The chapter also presents an introduction to the biplot accompanied by an example in which the biplot is used for data summarization and description. On a point of terminology, the prefix “bi–” of biplot indicates that this is a joint display of rows and columns. It does not indicate the two-dimensionality of the biplot. The chapter discusses the uses of the biplot. These are mostly of two kinds: (1) inspection of data and (2) diagnostics. In using the biplot, a few displays suffice to reveal relevant patterns in a pretty striking manner. EDA may show more detail if one inspects fits and residuals carefully at each stage but it requires iterative cycles of modelling, fitting, residuals inspection, re-expression, and decisions. If one fit is inadequate, another is tried until a model is judged adequate. This is a search by trial and error rather than by a systematic method. Irregularities are provided by data, inspection takes time, but inspiration is something that may be difficult to come by. The EDA modeling procedure is in general not systematic. Biplot diagnostics are more systematic and direct. One does not start by guessing a model but rather displays data and inspects it, and the diagnosis is then often immediate.

R 2 D 2 is an object-oriented database system intended for engineering applications that is based on the nested relational data model. R 2 D 2 provides a two layer architecture for engineering application programming: a public database to globally store the engineering objects and a private database consisting of a local database and an object cache that are local to the application program. This paper is concerned with the transaction control mechanisms needed to control concurrent transactions that access the public database system. Objects are requested by a transaction to be transferred from the public database into the transaction's local database connected with an object cache, which together form the private data repository. Upon release of the objects from the cache they are checked back into the public database. The central implementation idea forms a modified intention locking scheme to provide for a high level of concurrency in accessing objects that are represented in nested relational structure, the underlying data model of R 2 D 2 . This scheme facilitates the (exclusive or shared) locking of subobjects within an abstraction hierarchy while the remainder of the hierarchical object is still accessible by other transactions.

In many robotic applications the need to represent and reason about spatial relationships is of great importance. However, our knowledge of particular spatial relationships is inherently uncertain. The most used method for handling the uncertainty is to "pre-engineer" the problem away, by structuring the working environment and using specially-suited high-precision equipment. In some advanced robotic research domains, however, such as automatic task planning, off-line robot programming, and autonomous vehicle operation, prior structuring will not be possible, because of dynamically changing environments, or because of the demand for greater reasoning flexibility. Spatial reasoning is further complicated because relationships are often not described explicitly, but are given by uncertain relative information. This is particularly true when many different frames of reference are used, producing a network of uncertain relationships. Rather than treat spatial uncertainty as a side issue in geometrical reasoning, we believe it must be an intrinsic part of spatial representations. In this paper, we describe a representation for spatial information, called the stochastic map, and associated procedures for building it, reading information from it, and revising it incrementally as new information is obtained. The map always contains the best estimates of relationships among objects in the map, and their uncertainties. The procedures provide a general solution to the problem of estimating uncertain relative spatial relationships. The estimates are probabilistic in nature, an advance over the previous, very conservative, worst-case approaches to the problem. Finally, the procedures are developed in the context of state-estimation and filtering theory, which provides a solid basis for numerous extensions.

Graphical Abstract The prediction model of oral disintegrating tablets formulations with direct compression process by artificial neural network (ANN) and deep neural network (DNN) techniques were established. 145 formulation data were extracted from Web of Science. All datasets were divided into three parts: training set (105 data), validation set (20) and testing set (20) to build prediction model.Image, graphical abstract, Oral disintegrating tablets (ODTs) are a novel dosage form that can be dissolved on the tongue within 3 min or less especially for geriatric and pediatric patients. Current ODT formulation studies usually rely on the personal experience of pharmaceutical experts and trial-and-error in the laboratory, which is inefficient and time-consuming. The aim of current research was to establish the prediction model of ODT formulations with direct compression process by artificial neural network (ANN) and deep neural network (DNN) techniques. 145 formulation data were extracted from Web of Science. All datasets were divided into three parts: training set (105 data), validation set (20) and testing set (20). ANN and DNN were compared for the prediction of the disintegrating time. The accuracy of the ANN model have reached 85.60%, 80.00% and 75.00% on the training set, validation set and testing set respectively, whereas that of the DNN model were 85.60%, 85.00% and 80.00%, respectively. Compared with the ANN, DNN showed the better prediction for ODT formulations. It is the first time that deep neural network with the improved dataset selection algorithm is applied to formulation prediction on small data. The proposed predictive approach could evaluate the critical parameters about quality control of formulation, and guide research and process development. The implementation of this prediction model could effectively reduce drug product development timeline and material usage, and proactively facilitate the development of a robust drug product.

We present a new methodology for the design and development of large-scale simulations. Such simulations have often been criticized for their lack of intelligibility, modifiability, credibility, and performance. They are costly to build, to run, to interpret, and to change. Recent advances in artificial intelligence, most notably in the areas of expert systems and object-oriented languages, suggest new approaches to overcoming these limitations. We have applied this technology to the design and implementation of a new simulation language and environment called ROSS (Rule-Oriented Simulation System). Within our research system, we have implemented two military battle simulations, SWIRL (a strategic simulation) and TWIRL (a tactical simulation), which simulate the interactions and outcomes of combat between two opposing military forces. A graphics facility has been developed to visually display simulation runs dynamically. written in Franzlisp running on a VAX. Our graphics routines are written in C and loaded directly into the Franzlisp environment. Our graphics processor is an AED 512. Also we are experimenting with a network of Xerox 1100s (Lisp Machines) for our work on distributed simulation (discussed elsewhere [4]).

Publisher Summary This chapter describes the applications of multilevel models of educational data. Multilevel models are powerful tools for the applied statistician involved in educational research. Several examples of multilevel analyses of data from Educational Testing Service is presented in the chapter, in which multilevel analysis using a Bayesian approach provides better answers than methods based on sampling theory ideas such as un-biasedness and minimum variance. Multilevel models lie between standard models—between the extremes associated with the significant/not-significant dichotomy arising from the testing of standard models. Multilevel models can be used when data are thin without invoking awkward rules regarding the minimum sample size required for some form of analysis. Multilevel models make the quantities to be estimated random variables. The best confirmation is honest validation: make predictions to new data sets and see how accurate the predictions are. The consideration of conceptual replications can then be useful by eliminating inappropriate models. Diagnostics, such as frequentist-based examination of residuals, or posterior predictive model monitoring are, thus, necessary adjuncts to a successful multilevel analysis.

Publisher Summary A programming paradigm is a supported style of programming with significant advantages for a domain of problems. Many programming paradigms have been added on top of LISP, but few have been tightly integrated. Common LISP Object System (CLOS) is a model of a good integration. CLOS blends the object-oriented programming paradigm smoothly and tightly with the usual procedure-oriented paradigm of LISP. Functions and methods are combined in a more general abstraction. Message passing is invoked via normal LISP function call and methods are viewed as partial descriptions of procedures. LISP data types are integrated with object classes. With these integrations, it is easy to incrementally move a program between the procedure and object-oriented styles. By integrating classes with the LISP type system and using a syntax for method invocation that is identical to the LISP function call, CLOS makes possible a smooth and incremental transition from using only the functional paradigm for user code to using the object paradigm. As a portable system implemented in a widely available base, it allows users the choice of hardware and environments. It allows them a road to the future.

Publisher Summary This chapter focuses on phonological analysis prepared for the third and final volume of the Linguistic Atlas of the Upper Midwest (LAUM), along with the treatment of the lexicon and the grammar in the first two volumes, adds measurably to the sociolinguistic data available not only to dialectologists but also to students and teachers of usage, to textbook writers, and to sociolinguists. Although within the 800-item corpus of the Upper Midwest worksheets more attention is given specifically to the vocabulary, the lexicon is not very significant in exhibiting social contrast. Several of the miscellaneous grammatical items recorded during the interviews provide more positive social markers than do the strong verbs. Greater inconsistency appears in the contrast between two locutions in which a numeral precedes a modified noun. Two syntactic constructions with relative clauses yield variants providing rather sharp social contrast.

The basic ideas for the design and the implementation of a direct (graphical) manipulation interface system are described. Architecture and structure are based on layered models. The system allows the inclusion of deictic / natural language references to objects represented on the screen. The system was developed and implemented on Sun workstations in ‘C’ and ‘Prolog’ under the operating system Unix, providing a set of modules and a communication layer for combined interfaces. Two applications, a direct manipulative interface to an expert system and a form query system allowing natural language/direct manipulation interaction, are described.

This chapter focuses on a new translator, FAST, requiring no previous computer experience by the user. FAST has been developed for IMP, an implicit integration package shown to be absolutely stable on stiff equations. IMP utilizes a novel integration algorithm with control options that provide problem specificity, thereby reducing computer time. A vector elimination approach reduces core requirements on real systems of equations with sparse coefficient matrices. FAST has been developed to eliminate the programming effort required by IMP. Models or systems of differential and algebraic equations are read in with minimal instruction coding. Standard forcing functions and an interpolation routine for experimental data are provided, and any FORTRAN programmable function can be used. The FAST translator used with IMP has been shown to be very competitive with existing integration, problem solving, and modeling packages. The chapter presents a description of the translator's operation. The FAST translator was designed to allow a user to obtain a solution to a problem directly from the modeling equations, thus, freeing him from tasks such as dimensioning arrays, setting up loops, and checking convergence or errors, as would be required in FORTRAN.

Digital image processing of NTSC Color TV images by C-Matrix transform (CMT) for bandwidth compression is investigated. The effectiveness of the CMT compared to the discrete cosine transform (DCT) for image coding is evaluated. This comparison is based on various quantitative criteria and implementation aspects. Transform coding is applied. Simulation involves quantizer-coder design and bit rate reduction.