To see the other types of publications on this topic, follow the link: Reduce (Computer program language).
Journal articles on the topic 'Reduce (Computer program language)'
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 'Reduce (Computer program language).'
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
Anderson, Ellen M. "Turbidimetric Microbiological Assay Results Calculated by a BASIC Computer Program." Journal of AOAC INTERNATIONAL 72, no. 6 (November 1, 1989): 950–52. http://dx.doi.org/10.1093/jaoac/72.6.950.
Full textAbstract:
Abstract A BASIC computer program was used to calculate the results of microbiological vitamin assays. The program, which incorporates the official AOAC guidelines for microbiological methods, reduces the uncertainty inherent in manual curve plotting and interpolation and minimizes the human error of repetitive calculations. Because the BASIC programming language is well suited for use on self-contained personal computers, it can be easily adapted by small laboratories
2
Liu, Yu, Bo Kong, and Mei Yang. "Using GPTS to Relize Communication by Serial 422." Applied Mechanics and Materials 380-384 (August 2013): 3799–802. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.3799.
Full textAbstract:
ATLAS (Abbreviated Test Language for All Systems) is an abbreviated test language .GPTS is a development platform to develop ATLAS programs. RS 422 is widely adopted standard between the radio control box and the host computer .The process to develop test program in ATLAS by GPTS is described in this paper to realize the communication by serial 422.The application shows that it can improve the test speed and reduce the loss of resources by full duplex without handshaking line.
3
Barendregt, Henk. "Theoretical Pearls: Self-interpretation in lambda calculus." Journal of Functional Programming 1, no. 2 (April 1991): 229–33. http://dx.doi.org/10.1017/s0956796800020062.
Full textAbstract:
Programming languages which are capable of interpreting themselves have been fascinating computer scientists. Indeed, if this is possible then a ‘strange loop’ (in the sense of Hofstadter, 1979) is involved. Nevertheless, the phenomenon is a direct consequence of the existence of universal languages. Indeed, if all computable functions can be captured by a language, then so can the particular job of interpreting the code of a program of that language. Self-interpretation will be shown here to be possible in lambda calculus.The set of λ-terms, notation Λ, is defined by the following abstract syntaxwhereis the set {v, v′, v″, v′″,…} of variables. Arbitrary variables are usually denoted by x, y,z,… and λ-terms by M,N,L,…. A redex is a λ-term of the formthat is, the result of substituting N for (the free occurrences of) x in M. Stylistically, it can be said that λ-terms represent functional programs including their input. A reduction machine executes such terms by trying to reduce them to normal form; that is, redexes are continuously replaced by their contracta until hopefully no more redexes are present. If such a normal form can be reached, then this is the output of the functional program; otherwise, the program diverges.
4
Raman, K. V. "Some Features of Java Language Illustrated through Examples from Chemistry." Mapana - Journal of Sciences 1, no. 2 (July 3, 2003): 22–56. http://dx.doi.org/10.12723/mjs.2.5.
Full textAbstract:
Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Some examples presented in this these languages are Program to calculate reduced mass of homo diatomic or hetero diatomic Program to calculate the molecular weight of a tetra atomic system ABCD Program to calculate NMR frequencies of spin 1/2 nuclei only Program to calculate NMR and ESR frequencies The examples presented in Java 2 are Program to calculate unit cell dimension of a crystal Program to generate the chair form and boat form of cyclohexane. The examples presented in this monograph will help researchers in theoretical chemistry and organic chemistry to develop their own software.
5
Poe, Stephen E. "SELF-LEARNING: CD-ROM INSTRUCTION AND AUTHORING." HortScience 31, no. 3 (June 1996): 325e—325. http://dx.doi.org/10.21273/hortsci.31.3.325e.
Full textAbstract:
A fundamental concern of agricultural education is innovation within the teaching process. In dealing with high technology, increasing subject complexity, and rising costs, educators (including plant managers and training personnel) must look to alternative methods of training and teaching. Educational multimedia software can effectively present a new dimension to traditional computer-assisted instruction (CAI) by adding sound, animation, high-resolution graphics, and live-action video. Multimedia software is not difficult to program; however, the ease of programming depends on the authoring language or languages that are used. A traditional language such as C++ can take extended periods of time to program, possibly hours per minute of program. A program developed specifically for multimedia development can facilitate the interactions between sound, videos, and animation more readily, and reduce the programming time required significantly. The use and development of multimedia software using Toolbook (Asymetrix Corp.) will be presented with copies of the developed software available.
6
Paun, Gheorghe, Miklos Szijarto, and Sorina Vicolov. "Further Remarks on Reduced Languages." Fundamenta Informaticae 16, no. 3-4 (May 1, 1992): 337–47. http://dx.doi.org/10.3233/fi-1992-163-407.
Full textAbstract:
Union, homomorphic and inverse homomorphic representations of languages are obtained, starting from reduced languages introduced in earlier formal language approaches to parallel program schemes. The reduced-ness decidability is also investigated (it is decidable for regular and undecidable for linear languages).
7
Tang, Hong Jun. "Program Slicing Technique in Programming Assessment." Applied Mechanics and Materials 263-266 (December 2012): 1884–87. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.1884.
Full textAbstract:
For the teachers of teaching basic computer programming language, a very large number of student programs should be graded and human graders have great difficulty in judging the correctness and efficiency of programs. A programming assessment method is proposed based on program slicing technique and the method has reduced the complexity in the assessment of large-scale program by decomposing program. The method divides the program into several slices by generating program dependence graph and on those slices we can get the score of the student program by comparing the student program with the template program. The method has successfully improved the grading process and it is also employed for the undergraduate courses.
8
Naveed, Muhammad Shumail, Muhammad Sarim, and Kamran Ahsan. "Learners Programming Language a Helping System for Introductory Programming Courses." July 2016 35, no. 3 (July 1, 2016): 347–58. http://dx.doi.org/10.22581/muet1982.1603.05.
Full textAbstract:
Programming is the core of computer science and due to this momentousness a special care is taken in designing the curriculum of programming courses. A substantial work has been conducted on the definition of programming courses, yet the introductory programming courses are still facing high attrition, low retention and lack of motivation. This paper introduced a tiny pre-programming language called LPL (Learners Programming Language) as a ZPL (Zeroth Programming Language) to illuminate novice students about elementary concepts of introductory programming before introducing the first imperative programming course. The overall objective and design philosophy of LPL is based on a hypothesis that the soft introduction of a simple and paradigm specific textual programming can increase the motivation level of novice students and reduce the congenital complexities and hardness of the first programming course and eventually improve the retention rate and may be fruitful in reducing the dropout/failure level. LPL also generates the equivalent high level programs from user source program and eventually very fruitful in understanding the syntax of introductory programming languages. To overcome the inherent complexities of unusual and rigid syntax of introductory programming languages, the LPL provide elementary programming concepts in the form of algorithmic and plain natural language based computational statements. The initial results obtained after the introduction of LPL are very encouraging in motivating novice students and improving the retention rate.
9
Coelho, Alan A. "TOPASandTOPAS-Academic: an optimization program integrating computer algebra and crystallographic objects written in C++." Journal of Applied Crystallography 51, no. 1 (February 1, 2018): 210–18. http://dx.doi.org/10.1107/s1600576718000183.
Full textAbstract:
TOPASand its academic variantTOPAS-Academicare nonlinear least-squares optimization programs written in the C++ programming language. This paper describes their functionality and architecture. The latter is of benefit to developers seeking to reduce development time.TOPASallows linear and nonlinear constraints through the use of computer algebra, with parameter dependencies, required for parameter derivatives, automatically determined. In addition, the objective function can include restraints and penalties, which again are defined using computer algebra. Of importance is a conjugate gradient solution routine with bounding constraints which guide refinements to convergence. Much of the functionality ofTOPASis achieved through the use of generic functionality; for example, flexible peak-shape generation allows neutron time-of-flight (TOF) peak shapes to be described using generic functions. The kernel ofTOPAScan be run from the command line for batch mode operation or from a closely integrated graphical user interface. The functionality ofTOPASincludes peak fitting, Pawley and Le Bail refinement, Rietveld refinement, single-crystal refinement, pair distribution function refinement, magnetic structures, constant wavelength neutron refinement, TOF refinement, stacking-fault analysis, Laue refinement, indexing, charge flipping, and structure solution through simulated annealing.
10
Pan, D., and R. S. Sharp. "Automatic Formulation of Dynamic Equations of Motion of Robot Manipulators." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 202, no. 6 (November 1988): 397–404. http://dx.doi.org/10.1243/pime_proc_1988_202_141_02.
Full textAbstract:
Based on the use of homogeneous transformation matrices with Denavit-Hartenberg notation and the Lagrangian formulation method, a general computer program ROBDYN.RED for the symbolic derivation of dynamic equations of motion for robot manipulators has been developed and is discussed in this paper. The program is developed by using REDUCE, an algebraic manipulation language, and is versatile for open-chain structure robot manipulators with any number of degrees of freedom and with any combination of types of joint. Considerations are also given to saving computer memory space required for execution and to minimizing the runtime. Several examples are included to demonstrate the use of the program. Equations of motion in scalar form can be automatically transferred to FORTRAN format for later numerical simulations. The efficiency of the resulting equations in terms of numerical integration is also discussed and some further developments to improve the efficiency are suggested.
11
Laursen, Johan Sund, Lars-Peter Ellekilde, and Ulrik Pagh Schultz. "Modelling reversible execution of robotic assembly." Robotica 36, no. 5 (January 11, 2018): 625–54. http://dx.doi.org/10.1017/s0263574717000613.
Full textAbstract:
SUMMARYProgramming robotic assembly for industrial small-batch production is challenging; hence, it is vital to increase robustness and reduce development effort in order to achieve flexible robotic automation. A human who has made an assembly error will often simply undo the process until the error is undone and then restart the assembly. Conceptually, robots could do the same. This paper introduces a programming model that enables robot assembly programs to be executed in reverse. We investigate the challenges in running robot programs backwards and present a classification of reversibility characteristics. We demonstrate how temporarily switching the direction of program execution can be an efficient error recovery mechanism. Moreover, we demonstrate additional benefits arising from supporting reversibility in an assembly language, such as increased code reuse and automatically derived disassembly sequences. As a default approach to reversibility, we use program inversion and statement-level inversion of commands, but with a novel override option providing alternative sequences for asymmetric reverse actions. To efficiently program for this model, this paper introduces a new domain-specific language, SCP-RASQ (Simple C++ Reversible Assembly SeQuences). In initial experiments, where 200 consecutive assemblies of two industrial cases were performed, 18 of 22 errors were corrected automatically using only the trial-and-error capabilities that come from reverse execution.
12
Ding, Dan, Michael Phillips, Eduardo Iturrate, Sarah Hochman, and Anna Stachel. "Implementing an Automated Pneumonia Surveillance System." Infection Control & Hospital Epidemiology 41, S1 (October 2020): s281—s283. http://dx.doi.org/10.1017/ice.2020.853.
Full textAbstract:
Background: Although definitions from the CDC were developed to increase the reliability of surveillance data, reduce the burden of surveillance in healthcare facilities, and enhance the utility of surveillance data for improving patient safety, the algorithm is still laborious for manual use. We implemented an automated surveillance system that combines 2 CDC pneumonia surveillance definitions to identify pneumonia infection in inpatients. Methods: The program was implemented at an academic health center with >40,000 inpatient admission per year. We used Window Task Scheduler with a batch file daily to run a validated pneumonia surveillance algorithm program written with SAS version 9.4 software (SAS Institute, Cary, NC) and a natural language processing tool that queries variables (Table 1) and text found in the electronic medical records (EMR) to identify pneumonia cases (Fig. 1). We uploaded all computer-identified positive cases into a Microsoft Access database daily to be reviewed by a hospital epidemiologist. Every week, we also validated 5 computer-identified negative cases from the prior 2 weeks to ensure accuracy of the computer algorithm. We defined negative cases as pneumonia present on admission or chest x-ray indicative of pneumonia but without CDC-defined surveillance symptoms. We also wrote a program to automatically send e-mails to key stakeholders and to prepare summary reports. Results: Since November 2019, we have successfully implemented the automated computer algorithm or program to notify, via e-mail, infection prevention staff and respiratory therapy providers of CDC-defined pneumonia cases on a daily basis. This automated program has reduced the number of manual hours spent reviewing each admission case for pneumonia. A summary report is created each week and month for distribution to hospital staff and the Department of Health, respectively. Conclusions: The implementation of an automated pneumonia surveillance system proves to be a timelier, more cost-effective approach compared to manual pneumonia surveillance. By allowing an automated algorithm to review pneumonia, timely reports can be sent to infection prevention control staff, respiratory therapy providers, and unit staff about individual cases. Hospitals should leverage current technology to automate surveillance definitions because automated programs allow near real-time identification and critical review for infection and prevention activities.Funding: NoneDisclosures: None
13
Li, Hong Xiang. "The Development and Study of Calculating Compass Error Software." Advanced Materials Research 230-232 (May 2011): 1072–78. http://dx.doi.org/10.4028/www.scientific.net/amr.230-232.1072.
Full textAbstract:
With the principle, methods and steps of calculating compass error from observing the low height sun azimuth, the software program about calculating compass error based on VB (Visual Basic) environment has been given out. By analyzing the data regularity of Nautical Almanac, get the result that the data of Nautical Almanac shows the pattern of an arithmetic series, then with the data regularity and Compass Error’s calculating formula, a perfect software of calculating Compass Error is designed with Computer language Visual Basic. The data from observation and given can be put into the software program directly, avoid the complex of table lookup and data calculation, the software program has great effect to reduce the amount of calculation and raise the speed, precision and accuracy of calculating compass error.
14
Coelho, A. A., J. Evans, I. Evans, A. Kern, and S. Parsons. "The TOPAS symbolic computation system." Powder Diffraction 26, S1 (December 2011): S22—S25. http://dx.doi.org/10.1154/1.3661087.
Full textAbstract:
Computer algebra removes much of the drudgery from mathematics; it allows users to formulate models by using the language of mathematics and to have those models evaluated with little effort. This symbolic form of representation is often thought of as being separate to dedicated computational programs such as Rietveld refinement. These dedicated programs are often written in low level languages; they are relatively inflexible in what they do and modifying them to change functionality in a small manner is often a major programming task. This paper describes a symbolic system that is integrated into the dedicated Rietveld refinement program called TOPAS. The symbolic component allows large functional changes to be made at run time and with a relatively small amount of effort. In addition, the system as a whole reduces the programming complexity at the developmental stage.
15
Harmaja, Okta Jaya, and Maria Septina Hutauruk. "SISTEM PENUNJANG KEPUTUSAN PENERIMA PROGRAM KELUARGA HARAPAN DENGAN MENGGUNAKAN METODE TOPSIS." Jurnal Teknik Informasi dan Komputer (Tekinkom) 3, no. 2 (January 4, 2021): 37. http://dx.doi.org/10.37600/tekinkom.v3i2.134.
Full textAbstract:
Currently poverty is still one of the problems faced by the people of Indonesia, based on data from the Central Statistics Agency (BPS), it is stated that the percentage of poor people in September 2019 was 9.22% or equivalent to 24.79 million people. One of the efforts that have been made by the Government to overcome the problem of poverty is the Family Hope Program (PKH). The program aims to break the chain or reduce the poverty index, increase human resources, and change behavior that is less supportive of improving the welfare of poor families. However, in its implementation there are still some problems that occur in the field, including the lack of a companion role, and some PKH recipients who are not on target, causing social suspicion. These problems can be overcome by using computer technology-based programs and still implementing transparent and accountable selection stages. In this study, the method used in the Decision Support System is the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method and the system is designed using the PHP programming language and MySQL database. With this program, it is hoped that the user as the PKH implementation committee can make data easier, determine quickly and efficiently and on target for determining recipients of PKH assistance.
16
Kolybanov, K. Yu, R. E. Kuzin, S. S. Pisanenko, and T. N. Tairov. "INFORMATION SYSTEM OF TESTING LABORATORY FOR RADIATION CONTROL." Fine Chemical Technologies 13, no. 4 (August 28, 2018): 74–80. http://dx.doi.org/10.32362/2410-6593-2018-13-4-74-80.
Full textAbstract:
Development of information-analytical system of radiation control is based on existing methods and hardware-software measuring instruments for the purpose of systematizing, storing and processing the results of analysis of samples of various composition and origin. Studying a large flow of environmental and technological samples includes the most difficult task to ensure the required accuracy of calculation of activities and errors, especially at low activities levels at the threshold of detectable area. The information system hardware includes a set of devices designed to measure the activity of the samples, and a local computer network. The server part of the software package includes a client-server database management system and a web application for database administration. In addition to the standard programs included in the delivery of radiometric equipment the client part of the software package includes the program "ODRA", developed using object-oriented language C# in Microsoft Visual Studio. The program "ODRA" includes modules for calculating the specific (volumetric) activity of radionuclides in low-active samples of materials and environmental objects, as well as for calculating the relative and absolute error of activity determination. The program has a convenient graphical user interface for database communication. The information system of the radiation testing laboratory of the enterprise that conducts work with radioactive materials has undergone a four-year approbation in the experimental production mode at VNIIHT in 2014-2017 and can significantly reduce the processing time of the results of determining the radioactivity of technological and environmental samples and reduce the operator error factor.
17
Rains, Stephen A., Corey A. Pavlich, Eric Tsetsi, and Chelsie Akers. "Evaluating the Scope and Theoretical Mechanisms of Person-Centered Social Support: The Case of the Comforting Computer Program." Communication Research 47, no. 4 (June 10, 2019): 512–40. http://dx.doi.org/10.1177/0093650219852554.
Full textAbstract:
Although the utility of verbal person-centeredness (VPC) as a feature of social support messages has been demonstrated in numerous studies, questions remain about the scope and theoretical mechanisms that explain VPC effects. Two experiments were conducted to evaluate whether the salutary effects of VPC extend to generic VPC messages and to explore the role of validation as a theoretical mechanism. Participants discussed a personal problem with a fictional computer program named “ListenerBot” that provided standardized responses containing high or low levels of VPC. Participants who received high VPC feedback from ListenerBot experienced a greater reduction in emotional distress than participants who received low VPC feedback. Path models consistently showed that high VPC feedback validated participants’ feelings, which led them to reappraise their situation and ultimately reduced their emotional distress. VPC, however, did not impact participants’ discussion of their thoughts and emotions.
18
BURNEL, A., H. CAPRASSE, and A. DRESSE. "COMPUTING THE BRST OPERATOR USED IN QUANTIZATION OF GAUGE THEORIES." International Journal of Modern Physics C 05, no. 06 (December 1994): 1035–47. http://dx.doi.org/10.1142/s0129183194001136.
Full textAbstract:
It is shown that for a large class of non-holonomic quantum mechanical systems one can make the computation of BRST charge fully algorithmic. Two computer algebra programs written in the language of REDUCE are described. They are able to realize the complex calculations needed to determine the charge for general nonlinear algebras. Some interesting specific solutions are discussed.
19
Cotăescu, Ion I., and Dumitru N. Vulcanov. "New Routines for Algebraic Programming of the Dirac Equation." International Journal of Modern Physics C 08, no. 02 (April 1997): 273–86. http://dx.doi.org/10.1142/s0129183197000254.
Full textAbstract:
We present new procedures in the REDUCE language for algebraic programming of the Dirac equation on curved space-time. The main part of the program is a package of routines defining the Pauli and Dirac matrix algebras. Then the Dirac equation is obtained using the facilities of the EXCALC package. Finally we present some results obtained after running our procedures for the Dirac equation on several curved space-times.
20
Li, Xian Zhi, Xin Zhou, Li Juan Wang, and Chun Shan Liu. "Study on Parametric Drawing of Planetary Gear Transmission." Advanced Materials Research 308-310 (August 2011): 2215–19. http://dx.doi.org/10.4028/www.scientific.net/amr.308-310.2215.
Full textAbstract:
In the planetary gear transmission design, the structure and shape of some major parts are often the same or similar, tedious and duplicate drawing may reduce the drawing efficiency. This paper studies redevelopment technology by using Visual Lisp language in AutoCAD platform, and compiles drawing programs to realize parametric drawing. The new graph can be generated automatically by a computer by modifying simply a few parameters in the drawing process.
21
Damasevicius, Robertas. "On the quantitative estimation of abstraction level increase in metaprograms." Computer Science and Information Systems 3, no. 1 (2006): 53–64. http://dx.doi.org/10.2298/csis0601053d.
Full textAbstract:
Higher-level programming such as metaprogramming introduces a layer of abstraction above the domain language programs. Metaprogramming allows describing generic components and managing variability in a domain. It is especially useful for developing program generators for domains, where a great deal of commonalties exists. It allows increasing the level of abstraction and hiding details that are unnecessary to the designer. Information abstraction and hiding reduces the amount of 'user-visible' information. In this paper, we estimate the increase of abstraction by evaluating the information content at the lower (domain) and higher (meta) layers of abstraction. The estimation method is based on the Kolmogorov complexity and uses a common compression algorithm. The method is evaluated experimentally on families of DSP components.
22
Leo Princely, F., and T. Selvaraj. "Teach Less Robotic System for Deburring Workpieces of Various Shapes." Journal of Advanced Manufacturing Systems 14, no. 04 (September 29, 2015): 247–57. http://dx.doi.org/10.1142/s021968671550016x.
Full textAbstract:
In the case of conventional industrial robot systems, operators have to write robot-language programs for each type of workpiece. This is an onerous task, especially when each workpiece has a different shape. In this paper, a teaching-less robot system for the finishing of two-dimensional workpieces of various shapes and thicknesses using computer vision is proposed. The robot system does not require shape information for the workpiece to be included in the CAD data or to be input by the operator. Each workpiece shape is acquired by segmenting edges into straight lines and circular arcs from the image data of the workpiece. The robot-language program for each workpiece is generated automatically from the workpiece shape data and finishing condition data. The effectiveness of the proposed method is verified by experiments using a newly developed robot system. This method provides a compact and inexpensive finishing robot system which reduces the programming timing.
23
Bayu Yuliawan, Audi, Nur Hayatin, and Yufis Azhar. "Contraception Recommendations With Analytical Hierarchy Process (AHP) and Weighted Product Methods (WP)." Jurnal Perempuan dan Anak 1, no. 1 (February 3, 2021): 1–14. http://dx.doi.org/10.22219/jpa.v1i1.16337.
Full textAbstract:
Planning Program (KB) as one way to reduce the high rate of pregnancy. Contraceptives used in family planning programs have various types. In addition to the presence of contraception for women, contraception is also available for men. It's just that the problem at this time, lack of knowledge will choose contraception in accordance with health conditions. The limited time, place and expertise of experts to always provide information is one of the obstacles to getting complete information. Decision Support System is a knowledge-based computer information system that is used to support decision making in a problem. This system will later use the Analytical Hierarchy Process method, this method is a method that makes decision makers to get priority scale or consideration of experience, views, intuition and original data. Not only that this system will also use the Weighted Product (WP) method to maximize the performance of AHP in ranking the final results. This application is made using the Android programming language with Android Studio as the platform. In this application will later display recommendations for selecting contraceptives that are suitable for a patient.
24
Al Dujaili, Mohammed Jawad, Abbas Ebrahimi-Moghadam, and Ahmed Fatlawi. "Speech emotion recognition based on SVM and KNN classifications fusion." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 2 (April 1, 2021): 1259. http://dx.doi.org/10.11591/ijece.v11i2.pp1259-1264.
Full textAbstract:
Recognizing the sense of speech is one of the most active research topics in speech processing and in human-computer interaction programs. Despite a wide range of studies in this scope, there is still a long gap among the natural feelings of humans and the perception of the computer. In general, a sensory recognition system from speech can be divided into three main sections: attribute extraction, feature selection, and classification. In this paper, features of fundamental frequency (FEZ) (F0), energy (E), zero-crossing rate (ZCR), fourier parameter (FP), and various combinations of them are extracted from the data vector, Then, the principal component analysis (PCA) algorithm is used to reduce the number of features. To evaluate the system performance. The fusion of each emotional state will be performed later using support vector machine (SVM), K-nearest neighbor (KNN), In terms of comparison, similar experiments have been performed on the emotional speech of the German language, English language, and significant results were obtained by these comparisons.
25
Jain, Shubham, and A. Pandian. "Asurvey on automatic music generation." International Journal of Engineering & Technology 7, no. 2.8 (March 19, 2018): 677. http://dx.doi.org/10.14419/ijet.v7i2.8.10555.
Full textAbstract:
Just like you should not watch a foreign language movie without its subtitles, identically you should not listen to music without its lyrics Music lyrics are words that combine to produce a song in harmony. Usually the music lyrics that we normally listen to are human written and no machine involvement is present. Writing music has never been a easy task, lot of challenges are involved in this because the music lyrics need to be meaningful and at the same time it needs to be in harmony and sync with the music being played over it . They are written by great artist who have been writing music lyrics for years. This project tries to automate the process of music lyrics generation using computer program which we produce lyrics and reduce the burden on human skills and can generate new music lyrics and a very faster rate than humans ever can. This project also aims toward the merge of human and artificial intelligence.
26
Zhang, Zhi Ping, Han Wu Liu, and Xiao Xia Li. "Study on the Intelligent Design System of Square Tube Aluminum Profile Extrusion Processes Based on VB." Advanced Materials Research 549 (July 2012): 884–88. http://dx.doi.org/10.4028/www.scientific.net/amr.549.884.
Full textAbstract:
According to the similar characteristics of structure, geometry and constraints conditions in the same type of extrusion process, the intelligent design system of a square tube aluminum profile extrusion forming process was established in this paper based on the VB programming language, with using parametric programming language APDL provides by ANSYS software. The parameterized optimization design plan of pre-treatment and post-processing of ANSYS analysis during a square tube aluminum extrusion forming process was achieved, and the program of a three-dimensional model of the extrusion die under Visual Lisp environment was also programmed. The human-computer interaction intelligent design system which combined with pre-processing of semi-finished product, finite element analysis of extrusion die strength, extrusion die temperature field analysis, structural optimization of the die was realized. The research results show that the system can provide program decision-making, structural design, performance analysis and graphics treatment for the actual extrusion productions of square tube aluminum extrusion process, which reduced the design time of the technical staff, and saved design cost.
27
RIGUZZI, FABRIZIO, and TERRANCE SWIFT. "The PITA system: Tabling and answer subsumption for reasoning under uncertainty." Theory and Practice of Logic Programming 11, no. 4-5 (July 2011): 433–49. http://dx.doi.org/10.1017/s147106841100010x.
Full textAbstract:
AbstractMany real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the Independent Choice Logic, Logic Programs with Annotated Disjunctions (LPADs), Problog, PRISM, and others. These languages share a similar distribution semantics, and methods have been devised to translate programs between these languages. The complexity of computing the probability of queries to these general PLP programs is very high due to the need to combine the probabilities of explanations that may not be exclusive. As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate. As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability.Each of these approaches—general PLP, restricted PLP, and Possibilistic Logic Programming—can be useful in different domains depending on the form of uncertainty to be represented, on the form of programs needed to model problems, and on the scale of the problems to be solved. In this paper, we show how the PITA system, which originally supported the general PLP language of LPADs, can also efficiently support restricted PLP and Possibilistic Logic Programs. PITA relies on tabling with answer subsumption and consists of a transformation along with an API for library functions that interface with answer subsumption. We show that, by adapting its transformation and library functions, PITA can be parameterized to PITA(IND, EXC) which supports the restricted PLP of PRISM, including optimizations that reduce non-discriminating arguments and the computation of Viterbi paths. Furthermore, we show PITA to be competitive with PRISM for complex queries to Hidden Markov Model examples, and sometimes much faster. We further show how PITA can be parameterized to PITA(COUNT) which computes the number of different explanations for a subgoal, and to PITA(POSS) which scalably implements Possibilistic Logic Programming. PITA is a supported package in version 3.3 of XSB.
28
Bilbokaitė, Renata. "COMPUTER BASED VISUALIZATION TEACHING CHEMISTRY: ANALYTICAL REVIEW OF VISUALIZATION TOOLS AND OBJECTS." GAMTAMOKSLINIS UGDYMAS / NATURAL SCIENCE EDUCATION 5, no. 2 (August 20, 2008): 7–14. http://dx.doi.org/10.48127/gu-nse/08.5.07a.
Full textAbstract:
Background There are lot of books that teachers use in teaching process, but books are still unable to represent difficult view and to enclose 3D features of object. To reduce this lack of information proceeding there can be used computer visualisation in the classrooms. Computer technologies can be essential tools for scientific teachers because of the extensive possibilities to show 3D representations. The teachers do not feel competent in knowledge of modern technology that is why they rarely use them in teaching process-es. Clear computer based visualization helps students to understand difficult concepts and this leads to comprehension in science education. The more concepts and laws of nature they will now the more quali-tative scientific education will be. The article is grounded on visual thinking and genetic structural model of intellect theories. According to these theories all things, if it is possible, should be visualised, because later it helps to create right mental models and perfect comprehension of objects. This research pretends to enclose computer based visualization tools and the mostly visualised objects in chemistry for the reason teachers could use them in chemistry lessons. The subject of research – the practice of possibilities of computer based visualization tools and objects in chemistry Aim – to enclose practice of possibilities of computer based visualization tools and objects in chemistry The research tasks: • To categorize tools of computer based visualization; • To analyze the practice of possibilities of categorized computer based visualization tools teach-ing chemistry; • To analyze - which objects are the mostly visualized teaching chemistry Methods. Scientific literature analysis, systemic structural analysis, reflection Results and conclusion: • All computer based visualization tools are important because of clear visualization and possibil-ity to see very small objects. • Computer programs are designed for concrete theme; it may be proportion to plans of chem-istry education. They are interactive; there are possibilities to subscribe them by internet. It must be installed to the personal computer. Internet programs are significant because of possibility to use them free having internet and installing needful software. Mostly all programs are verbal-ized in English language; this circumstances the good chemistry teachers’ knowledge of Eng-lish language. Pupils can use them independently for self – education, to deepen general knowledge of chemistry. • Molecules and their structures are the most visualized objects in chemistry education; it means that molecules are one of the most difficultly perceivable concepts. It is recommended to use visualization tools teaching about molecules. Key words: computer based visualization, visualization tools, visualization objects, teaching chemistry
29
COSTANTINI, STEFANIA. "On the existence of stable models of non-stratified logic programs." Theory and Practice of Logic Programming 6, no. 1-2 (January 2006): 169–212. http://dx.doi.org/10.1017/s1471068405002589.
Full textAbstract:
In this paper we analyze the relationship between cyclic definitions and consistency in Gelfond-Lifschitz's answer sets semantics (originally defined as ‘stable model semantics’). This paper introduces a fundamental result, which is relevant for Answer Set programming, and planning. For the first time since the definition of the stable model semantics, the class of logic programs for which a stable model exists is given a syntactic characterization. This condition may have a practical importance both for defining new algorithms for checking consistency and computing answer sets, and for improving the existing systems. The approach of this paper is to introduce a new canonical form (to which any logic program can be reduced to), to focus the attention on cyclic dependencies. The technical result is then given in terms of programs in canonical form (canonical programs), without loss of generality: the stable models of any general logic program coincide (up to the language) to those of the corresponding canonical program. The result is based on identifying the cycles contained in the program, showing that stable models of the overall program are composed of stable models of suitable sub-programs, corresponding to the cycles, and on defining the Cycle Graph. Each vertex of this graph corresponds to one cycle, and each edge corresponds to one handle, which is a literal containing an atom that, occurring in both cycles, actually determines a connection between them. In fact, the truth value of the handle in the cycle where it appears as the head of a rule, influences the truth value of the atoms of the cycle(s) where it occurs in the body. We can therefore introduce the concept of a handle path, connecting different cycles. Cycles can be even, if they consist of an even number of rules, or vice versa they can be odd. Problems for consistency, as it is well-known, originate in the odd cycles. If for every odd cycle we can find a handle path with certain properties, then the existence of stable model is guaranteed. We will show that based on this results new classes of consistent programs can be defined, and that cycles and cycle graphs can be generalized to components and component graphs.
30
Попиков, Петр, P. Popikov, П. Гончаров, P. Goncharov, Андрей Шаров, and Andrey Sharov. "Modelling workflow forest fire soil - thrower with energy-saving hydraulic drive." Forestry Engineering Journal 7, no. 4 (January 30, 2018): 182–89. http://dx.doi.org/10.12737/article_5a3d097ac621c3.55675220.
Full textAbstract:
The article is a schematic diagram of the hydraulic soil-thrower with connection air-charged accumulator which stores energy during overload when working bodies meeting with obstacles, while avoiding the operation of safety valves and conversion hydraulic energy into heat. Mathematical model that comprehensively describes the events taking place: the rotation and movement of the rotor soil-thrower rotor interaction with the ground and obstacles, the drive ground in space. In the method of the soil and the obstacles presented a collection of a large number (about 2000 ... 10000) spherical elements of small size, enabled communicate both among themselves and with the blades soil-thrower. The simulation is performed in three-dimensional space XYZ, where in the same elements have a spherical shape with the same diameter. With in the framework of the model developed by the working surfaces are represented as a set of elementary triangles. Rotor soil-thrower model with some degree of desensitization is represented by four rectangular blades, each of which consists of two triangles. In the process of simulation reproduced rotation of the rotor and the calculation of the interaction with the elements of triangular surfaces ground and obstacles. To solve the system of differential-social and algebraic equations, which laid the basis for the model, time-operated computer program "Program for modeling the work of forest fire soil-thrower with energy saving action hydraulic drive" program time to work in Borland Delphi environment 7.0 language Object Programming PascalIzucheny soil-thrower stage of interaction with the irresistible preption. Using the powering hydraulic system improves the uniformity of rotation of the rotor, to reduce energy costs for rotorus rotation by 12%.
31
Zhang, Guang Yun, Peng Lan, and Nian Li Lu. "Development of Parameterized Modeling for Tower Crane." Advanced Materials Research 505 (April 2012): 293–98. http://dx.doi.org/10.4028/www.scientific.net/amr.505.293.
Full textAbstract:
The development of parameterized modeling for ST8075 tower crane is based on finite element analysis software SAP84 and high-level programming language Fortran. According to the Saint-Venant principle, the special beam elements such as rotation joint and connection knots are specially reinforced if they don’t affect force analysis and deformation analysis of the whole structure. The tower crane is built into many small modules, which include balance arms, booms, tower body and so on. The developed program for the tower crane can realize the following functions: inputting the following parameters such as the tower body standard joint number, the boom combination type, working amplitude and hoisting weight, the computer can automatically generate hoisting points and get required crane with any tower body standard joints and booms’ combination type. According to inputted boom combination type and amplitude, the program will automatically judge the balance weight value applied to the balance arm, apply the balance weight, assure the variable-amplitude vehicle’s position, apply the hoisting load, apply the hanger weight and generate data files. It can calculate tower crane’s force state when the crane is working at various working case such as working state and storm case. After calculating the crane, inner forces can be checked and judged whether the beams meet the requirements of strength, stiffness and stability. It is easy to optimize the product design, reduce the crane’s potential risks and raise its safety assurance. It has important significance for research and development of new products.
32
Blum, M., P. Metcalf, S. C. Harrison, and D. C. Wiley. "A system for collection and on-line integration of X-ray diffraction data from a multiwire area detector." Journal of Applied Crystallography 20, no. 3 (June 1, 1987): 235–42. http://dx.doi.org/10.1107/s0021889887086783.
Full textAbstract:
A system for collecting and measuring X-ray diffraction data from protein crystals has been developed for a multiwire area detector. Computer programs run concurrently on two microcomputers, which collect and reduce detector data to integrated intensities. The self-contained system consists of an X-ray area detector, a rotation/oscillation camera, and two microcomputers connected by a high-speed Ethernet network. One microcomputer is dedicated to operation of the detector, control of the camera, and storage of the raw data. The second microcomputer automatically integrates the data as they are collected and allows the user to monitor the quality of data as they are processed. The integration programs are written in Fortran 77 and have been designed to be portable. Additional programs for crystal alignment, detector and camera control, and graphics are written in the C programming language. A description of the system, some characteristics of the detector, and the results of data collection are presented.
33
Овчаренко and O. Ovcharenko. "Mutual Support and Usage of CAD Systems." Geometry & Graphics 4, no. 2 (June 18, 2016): 64–69. http://dx.doi.org/10.12737/19834.
Full textAbstract:
In speaking of modern higher education, we mean an
educational system that allows young specialists to fit into the labour
market. Such specialists need to be equipped with the necessary
knowledge and skills not only to perform work on the project, but
also to attack the problem creatively. The task of higher school is
to provide the necessary set of knowledge and skills that will allow
young specialists to work successfully and to be on the march. The
language of communication of engineers is drawings. Computer
drawings allow reducing the working time considerably in the development,
production, remediation, transfer, and retention. Therefore, the ability to use drawing program for working with images is
necessary. Despite all the powerful design tools and visualization,
a key moment in computer design is the documentation of the
product and its design in accordance with accepted standards that
is considered to be an integral part of the design process. After the
successful development of a 2D environment, the expert can confidently
move on to 3D modeling that facilitates the receipt of
drawings and models at times and gives you the opportunity to
inspect the settings of the virtual model and, if necessary, to improve
them significantly. Usage of different CAD-systems for communication
engineers- partners is a reality. Therefore it is very useful for
a specialist to be able to use different programs. Modern graphic
programs (AutoCAD, SolidEdge) have many similar opportunities,
but they also have some differences. Knowledge of several drawing
programs is necessary and reduces the amount of time for the skills
development for usage of each CAD-system is the problem of the
future engineer.
The article compares two different programs and the possibility
of using the both CAD-systems for working with drawings.
34
Fernández, Ángel Nepomuceno. "Sistemas de cálculo como formas de Logicismo." Crítica (México D. F. En línea) 25, no. 73 (January 7, 1993): 15–35. http://dx.doi.org/10.22201/iifs.18704905e.1993.876.
Full textAbstract:
The logicism may be regarded like a fossil stone that has not utility nowadays. In this sense, logicism took care of the research about the foundations of mathematics but apparently its task arrived at its end many years ago because of sorne results that were eetablished during the century. However it is not wholly right. Understanding logicism as an attempt to reduce classical mathematics to logic means we can distinguish: 1) the idea according to which mathematic is logic in sorne way, and 2) a metaphysical program of research to: a) define mathematical notions as logical notions, and b) show that the mathematical theorems are logical theorems. The failure (if so) concerned to 2), since 1) was assumed by many logicians. Recovering logicism is not easy and there may be several ways. One of them is the one followed by N.B. Cocchiarella whose systems (there are more than one) represent a form of logicism (Frege's or Russell's form). From those systems -though a bit changed from my own point of view- we can define a modal calcule that may have application in computer science, what would not be a stale work. From a common language we take in account two systems in order to show that Cocchiarella's modified system is as powerful deductively as that of Church modified functional second order calcule. We can obtain new systems that represent form of logicism and are more powerful than that of Church enlarging Cochiarella's modified system. These new systems, that becomes modal systems provided that one adds appropiate modal tools (then they may be used in computer science), may be useful to study logicism itself (as historical philosophy of logic and mathematics).
35
Zainullina, R. "Automatic Graph Generation for E-learning Systems." Bulletin of Science and Practice 7, no. 6 (June 15, 2021): 12–16. http://dx.doi.org/10.33619/2414-2948/67/01.
Full textAbstract:
The subject of the research is one of the ways of updating modern training systems for solving problems of graph theory, namely, automatic generation of graphs. This approach will reduce the load on the training system database and generate tasks for the user in real-time without updating the bank of tasks. In the course of the work, the advantages and disadvantages of this approach were identified. The most suitable method for the implementation of the research was chosen to represent graphs in electronic computers. The requirements for generated graphs and possible ways of implementing these requirements are identified and substantiated. Namely: in the implemented program, simple connected undirected graphs will be generated. We considered an important detail in working with graphs — graph traversal using the “Depth (width) search” algorithm, which in this task is used to check the graph for connectivity. The result of the work is presented — a software implementation of the graph generation algorithm in the C# programming language. In it, graphs are represented by an adjacency list, generated randomly, and checked for connectivity using the DFS (Depth First Search) function. DFS is a software implementation of the Depth First Search algorithm.
36
Guzmán, Eduardo, Mario Vázquez, David Del Valle, and Paulino Pérez-Rodríguez. "Artificial Neuronal Networks: A Bayesian Approach Using Parallel Computing." Revista Colombiana de Estadística 41, no. 2 (July 1, 2018): 173–89. http://dx.doi.org/10.15446/rce.v41n2.55250.
Full textAbstract:
An Artificial Neural Network (ANN) is a learning paradigm and automatic processing inspired in the biological behavior of neurons and the brain structure. The brain is a complex system; its basic processing unit are the neurons, which are distributed massively in the brain sharing multiple connections between them. The ANNs try to emulate some characteristics of humans, and can be thought as intelligent systems that perform some tasks in a different way that actual computer does. The ANNs can be used to perform complex activities, for example: pattern recognition and classification, weather prediction, genetic values prediction, etc. The algorithms used to train the ANN, are in general complex, so therefore there is a need to have alternatives which lead to a significant reduction of times employed to train an ANN. In this work, we present an algorithm based in the strategy ``divide and conquer'' which allows to train an ANN with a single hidden layer. Part of the sub problems of the general algorithm used for training are solved by using parallel computing techniques, which allows to improve the performance of the resulting application. The proposed algorithm was implemented using the C++ programming language, and the libraries Open MPI and ScaLAPACK. We present some application examples and we asses the application performance. The results shown that it is possible to reduce significantly the time necessary to execute the program that implements the algorithm to train the ANN.
37
Gupta, P. K. "K-Step Crossover Method based on Genetic Algorithm for Test Suite Prioritization in Regression Testing." JUCS - Journal of Universal Computer Science 27, no. 2 (February 28, 2021): 170–89. http://dx.doi.org/10.3897/jucs.65241.
Full textAbstract:
Software is an integration of numerous programming modules (e.g., functions, procedures, legacy system, reusable components, etc.) tested and combined to build the entire module. However, some undesired faults may occur due to a change in modules while performing validation and verification. Retesting of entire software is a costly affair in terms of money and time. Therefore, to avoid retesting of entire software, regression testing is performed. In regression testing, an earlier created test suite is used to retest the software system's modified module. Regression Testing works in three manners; minimizing test cases, selecting test cases, and prioritizing test cases. In this paper, a two-phase algorithm has been proposed that considers test case selection and test case prioritization technique for performing regression testing on several modules ranging from a smaller line of codes to huge line codes of procedural language. A textual based differencing algorithm has been implemented for test case selection. Program statements modified between two modules are used for textual differencing and utilized to identify test cases that affect modified program statements. In the next step, test case prioritization is implemented by applying the Genetic Algorithm for code/condition coverage. Genetic operators: Crossover and Mutation have been applied over the initial population (i.e. test cases), taking code/condition coverage as fitness criterion to provide a prioritized test suite. Prioritization algorithm can be applied over both original and reduced test suite depending upon the test suite's size or the need for accuracy. In the obtained results, the efficiency of the prioritization algorithms has been analyzed by the Average Percentage of Code Coverage (APCC) and Average Percentage of Code Coverage with cost (APCCc). A comparison of the proposed approach is also done with the previously proposed methods and it is observed that APCC & APCCc values achieve higher percentage values faster in the case of the prioritized test suite in contrast to the non-prioritized test suite.
38
BERTHOLD, JOST, and RITA LOOGEN. "THE IMPACT OF DYNAMIC CHANNELS ON FUNCTIONAL TOPOLOGY SKELETONS." Parallel Processing Letters 18, no. 01 (March 2008): 101–15. http://dx.doi.org/10.1142/s0129626408003259.
Full textAbstract:
Parallel functional programs with implicit communication often generate purely hierarchical communication topologies during execution: communication only happens between parent and child processes. Hence, messages between siblings must be passed via the parent causing inefficiencies that can be avoided by direct communication between arbitrary processes. The Eden parallel functional language provides dynamic channels to implement arbitrary communication topologies. This paper analyses the impact of dynamic channels on Eden's topology skeletons, i.e. skeletons which define process topologies such as rings, toroids, or hypercubes. We compare topology skeletons with and without dynamic channels with respect to runtime and communication. Our case studies confirm that dynamic channels decrease the number of messages by up to 50% and substantially reduce runtime. Detailed analyses of EdenTV (Eden trace viewer) execution profiles reveal a bottleneck in the root process when only hierarchical channel connections are used and a better distribution of communications with dynamic channels.
39
LaFlair, Geoffrey T., Daniel Isbell, L. D. Nicolas May, Maria Nelly Gutierrez Arvizu, and Joan Jamieson. "Equating in small-scale language testing programs." Language Testing 34, no. 1 (August 3, 2016): 127–44. http://dx.doi.org/10.1177/0265532215620825.
Full textAbstract:
Language programs need multiple test forms for secure administrations and effective placement decisions, but can they have confidence that scores on alternate test forms have the same meaning? In large-scale testing programs, various equating methods are available to ensure the comparability of forms. The choice of equating method is informed by estimates of quality, namely the method with the least error as defined by random error, systematic error, and total error. This study compared seven different equating methods to no equating – mean, linear Levine, linear Tucker, chained equipercentile, circle-arc, nominal weights mean, and synthetic. A non-equivalent groups anchor test (NEAT) design was used to compare two listening and reading test forms based on small samples (one with 173 test takers the other, 88) at a university’s English for Academic Purposes (EAP) program. The equating methods were evaluated based on the amount of error they introduced and their practical effects on placement decisions. It was found that two types of error (systematic and total) could not be reliably computed owing to the lack of an adequate criterion; consequently, only random error was compared. Among the seven methods, the circle-arc method introduced the least random error as estimated by the standard error of equating (SEE). Classification decisions made using the seven methods differed from no equating; all methods indicated that fewer students were ready for university placement. Although interpretations regarding the best equating method could not be made, circle-arc equating reduced the amount of random error in scores, had reportedly low bias in other studies, accounted for form and person differences, and was relatively easy to compute. It was chosen as the method to pilot in an operational setting.
40
Langer, Lissy. "An Optimal Peer-to-Peer Market Considering Modulating Heat Pumps and Photovoltaic Systems under the German Levy Regime." Energies 13, no. 20 (October 14, 2020): 5348. http://dx.doi.org/10.3390/en13205348.
Full textAbstract:
The European Commission calls for more small-scale renewable energy producers to actively participate in the energy value chain. In this study, we model an illustrative peer-to-peer (P2P) market with tariffs based on the reservation prices of market participants under the German levy regime. The study is conducted by modeling representative residential buildings with home energy management systems, modulating heat pumps, and photovoltaics, in combination with electrical and thermal storage systems. The resulting mixed-integer linear program is solved over the course of a year, using a rolling horizon approach with a time resolution of one hour. By analyzing the cost- and discomfort-minimizing behavior of the market participants, we evaluate the current levy regime and propose two additional designs. We find that in the current case, a P2P market is not economically viable. Based on feed-in tariffs (FiT) and levies no agreeable market price can be found. With no FiT or reduced levies, all participants benefit from the P2P market. The market split—where each household sources their energy from—is altered only little by the specific details of the market design when staying in the agreeable price range. As prosumagers do not consume on the P2P market, they benefit only marginally from the reduced levies—consumers are most affected. Adjusting the regime could be a measure to rebalance the distribution of renewable energy benefits towards consumers in order to foster social cohesion. Our input data and the model written in the Julia JuMP programming language are available in an open-source format.
41
Bahtiar, Novi Dwesti, and Agus Sifaunajah. "PERANCANGAN SISTEM INFORMASI GEOGRAFIS PENYEBARAN PENYAKIT DEMAM BERDARAH DENGUE DI WILAYAH JOMBANG." SAINTEKBU 10, no. 1 (January 30, 2018): 83–91. http://dx.doi.org/10.32764/saintekbu.v10i1.165.
Full textAbstract:
One of the most common cases of disease in Indonesia is dengue hemorrhagic fever. Jombang region is one of the areas whose people are infected with dengue fever because every year there must be cases and cases that occur is also high. Various efforts have been made to prevent the spread of the disease. Among the 3M program (Drain, Closing, and Bury), fumigation (fogging) in each area that is endemic DHF. But still there are victims, even increasing from the years. From these problems is also required system capable of providing relief. With this problem then built a Web-Based Geographic Information System that can help people to know the actual spread of dengue fever. Geographic Information System is a collection of computer systems that store, process, manipulate, analyze geography data into quality information related to geographic objects. Within the Geographic Information System itself there are two important elements of Geographic Data used as a reference for attribute data, and the attribute data itself used to support spatial or geographical information. The design of the map to be displayed in this application using Google Maps API, while the methodology in the development of this system using waterfall method that includes system analysis, system design, system implementation and testing. In making this Web-based Geographic Information System uses MySQL as database to store the required data and use PHP as the programming language. The purpose of making Geographic Information System is to help Jombang District Health Office in providing information to the community about the spread of dengue fever so that it can reduce the number of patients each year.
Keywords: Google Maps, GIS, Healthy, Dengue Fever.
42
Ilyenko, Anna, Sergii Ilyenko, and Danylo Stashevskyi. "SOFTWARE ERROR TRACKING MODULE IN WEB APPLICATIONS BASED ON THE USE OF LOGGER ALGORITHM." Cybersecurity: Education, Science, Technique 3, no. 11 (2021): 61–72. http://dx.doi.org/10.28925/2663-4023.2021.11.6172.
Full textAbstract:
This article is devoted to the consideration of further relevant ways to ensure the procedure of error tracking in high-load web applications implemented in the Javascript programming language. The article investigates and identifies that errors that occur when developing and using modern high-load web applications are very dangerous because they affect the full functioning of the information system as a whole and can lead to breaches of confidentiality and integrity of personal information. In the article the authors consider the issues of error handling in Javascript programming language, the problem and need to track errors in high-load web applications, the concept of high-load web applications, existing methods and approaches to error tracking, principles of modern high-load web applications and comparison of existing error tracking solutions. in high-load web applications implemented in the Javascript programming language. The result of this research was the creation of an author's software module for error tracking in advanced web applications to solve the problem of logging errors, analysis of logs for completeness, error handling and solving them in the future. Also, the implementation of such a solution allows you to reduce the size of the software application to download up to 5 kilobytes and save the error history. The developed software module for error tracking in highly loaded web applications consists of two parts: client and server. Each part is an independent software module and can be reconfigured with minimal configuration changes on any other resource. This implementation allows you to fully collect metrics for each XMLHTTP request, collect information about the user environment in which the error occurred, collect information about what exactly caused the error, determine the specific location where the error occurred while executing program code, using a custom algorithm , save error stories in Kibana log. Possible areas of development of this work are related to the expansion of the error tracking algorithm, to collect more data and improve their aggregation, based on the expansion of metrics. The authors plan a number of scientific and technical solutions to develop and implement effective methods, tools, requirements, principles and approaches to cyber security and protection based on the use of author's approaches to error tracking in high-load web applications in experimental computer systems and networks.
43
Alturki, Sarah, Nazik Alturki, and Heiner Stuckenschmidt. "Using Educational Data Mining to Predict Students’ Academic Performance for Applying Early Interventions." Journal of Information Technology Education: Innovations in Practice 20 (2021): 121–37. http://dx.doi.org/10.28945/4835.
Full textAbstract:
Aim/Purpose: One of the main objectives of higher education institutions is to provide a high-quality education to their students and reduce dropout rates. This can be achieved by predicting students’ academic achievement early using Educational Data Mining (EDM). This study aims to predict students’ final grades and identify honorary students at an early stage. Background: EDM research has emerged as an exciting research area, which can unfold valuable knowledge from educational databases for many purposes, such as identifying the dropouts and students who need special attention and discovering honorary students for allocating scholarships. Methodology: In this work, we have collected 300 undergraduate students’ records from three departments of a Computer and Information Science College at a university located in Saudi Arabia. We compared the performance of six data mining methods in predicting academic achievement. Those methods are C4.5, Simple CART, LADTree, Naïve Bayes, Bayes Net with ADTree, and Random Forest. Contribution: We tested the significance of correlation attribute predictors using four different methods. We found 9 out of 18 proposed features with a significant correlation for predicting students’ academic achievement after their 4th semester. Those features are student GPA during the first four semesters, the number of failed courses during the first four semesters, and the grades of three core courses, i.e., database fundamentals, programming language (1), and computer network fundamentals. Findings: The empirical results show the following: (i) the main features that can predict students’ academic achievement are the student GPA during the first four semesters, the number of failed courses during the first four semesters, and the grades of three core courses; (ii) Naïve Bayes classifier performed better than Tree-based Models in predicting students’ academic achievement in general, however, Random Forest outperformed Naïve Bayes in predicting honorary students; (iii) English language skills do not play an essential role in students’ success at the college of Computer and Information Sciences; and (iv) studying an orientation year does not contribute to students’ success. Recommendations for Practitioners: We would recommend instructors to consider using EDM in predicting students’ academic achievement and benefit from that in customizing students’ learning experience based on their different needs. Recommendation for Researchers: We would highly endorse that researchers apply more EDM studies across various universities and compare between them. For example, future research could investigate the effects of offering tutoring sessions for students who fail core courses in their first semesters, examine the role of language skills in social science programs, and examine the role of the orientation year in other programs. Impact on Society: The prediction of academic performance can help both teachers and students in many ways. It also enables the early discovery of honorary students. Thus, well-deserved opportunities can be offered; for example, scholarships, internships, and workshops. It can also help identify students who require special attention to take an appropriate intervention at the earliest stage possible. Moreover, instructors can be aware of each student’s capability and customize the teaching tasks based on students’ needs. Future Research: For future work, the experiment can be repeated with a larger dataset. It could also be extended with more distinctive attributes to reach more accurate results that are useful for improving the students’ learning outcomes. Moreover, experiments could be done using other data mining algorithms to get a broader approach and more valuable and accurate outputs.
44
Widiastuti, Sri Handani. "Implementasi Forward Chaining Dan Breadth First Pada Sistem Pakar Diagnosa Gangguan Kehamilan." JSAI (Journal Scientific and Applied Informatics) 2, no. 2 (June 28, 2019): 154–58. http://dx.doi.org/10.36085/jsai.v2i2.351.
Full textAbstract:
Expert system is a computer-based system that uses knowledge, facts and reasoning techniques in solving problems that can usually only be solved by an expert. Inference method is a thinking mechanism and reasoning patterns used by the system to reach conclusions, while forward chaining is an inference method that traces starting from a set of facts by looking for rules that match the guesswork / hypothesis that leads to conclusions. Expert systems can be applied in various fields, including in medicine, for example how to diagnose a disease. Pregnancy is a happy moment for a mother, but there are still many problems with pregnancy problems in pregnant women because many do not know about pregnancy disorders that usually occur. Puskesmas Bontang Utara I has a program to reduce mortality in pregnant women and infants, by providing guidance and socialization on how to maintain a correct pregnancy. To facilitate public understanding and provide information related to pregnancy disorders, the researchers made the application system expert pregnancy disorders built using the PHP programming language, Dreamweaver 8 as an editor and MySql as the database. Software development methods use the waterfall model and system testing using blackbox. The expert system application in this study provides information on diagnosing pregnancy disorders in pregnant women such as consulting with experts. The diagnostic process starts with the way the user selects or inputs the type of complaint that is felt in accordance with the symptoms provided by the system. By using the forward chaining method and breadth first search search technique, the complaints that have been entered will be matched with the symptoms and types of disturbances stored in the database. So that the results of the diagnosis will be produced as the results of the diagnosis of experts. With this information helps pregnant women recognize pregnancy disorders during pregnancy.
45
Frick, Theodore W. "Bayesian Adaptation during Computer-Based Tests and Computer-Guided Practice Exercises." Journal of Educational Computing Research 5, no. 1 (February 1989): 89–114. http://dx.doi.org/10.2190/60hh-77dg-wk36-pg43.
Full textAbstract:
One of the potential advantages of computer-based instruction (CBI) is individualization of instruction. However, this goal has not been fully realized in practice, due largely to limitations of natural language understanding and to combinatorial explosion. It is nonetheless possible to develop CBI programs which can adapt to students, depending on their performance, by adjusting the length of computer-guided practice exercises and computer-based tests. The validity of this approach is supported empirically. The number of questions can be significantly reduced for many individuals, while mastery and nonmastery decisions remain highly accurate.
46
Kulneva, N. G., and M. V. Zhuravlev. "Modeling the design of the scaler for thermochemical treatment of beet ships before extracting sucharose." Proceedings of the Voronezh State University of Engineering Technologies 82, no. 3 (October 19, 2020): 39–44. http://dx.doi.org/10.20914/2310-1202-2020-3-39-44.
Full textAbstract:
The extraction of sucrose is a key process in sugar beet production that determines its efficiency. This process is significantly accelerated by a complex thermal, electrical and chemical effect on beet tissue in the process of its preparation and is carried out in scalders of various designs. The design parameters of the scalder can be estimated using mathematical modeling methods. When developing the model, a finite element approach was used by representing complex bodies in the form of a large number of separate elements of the same type and the method of particle dynamics. In the simulation, a number of coefficients were introduced related to splitting the chips into separate spherical elements: mЭ, cС, dЭС, cИС. Reference and experimental data were used to calculate them. The mathematical model is implemented in the form of a system of differential and algebraic equations, for the processing of which a computer program in the Object Pascal language has been developed. The developed model makes it possible to vary a large number of design and technological parameters of the scalder and mechanical and geometric parameters of beet chips, and to determine indicators characterizing the efficiency of thermochemical processing of chips. The angle of inclination of the nozzle in the vertical plane, length and diameter of the nozzle were chosen as design parameters. The efficiency of the scalder design was evaluated by the mass of beet chips accumulated on the nozzle and the contact time of the beet chips with the inner surfaces of the scalder. In the course of a computer experiment, it was found that an increase in the angle of inclination of the nozzles at different lengths and diameters significantly reduces the mass of accumulated chips and the time of contact of the chips with the surface of the scalder. The resulting model is intended for the design of prototypes of the scalder.
47
Moschovakis, Yiannis N. "The formal language of recursion." Journal of Symbolic Logic 54, no. 4 (December 1989): 1216–52. http://dx.doi.org/10.1017/s0022481200041086.
Full textAbstract:
This is the first of a sequence of papers in which we will develop a foundation for the theory of computation based on a precise, mathematical notion of abstract algorithm. To understand the aim of this program, one should keep in mind clearly the distinction between an algorithm and the object (typically a function) computed by that algorithm. The theory of computable functions (on the integers and on abstract structures) is obviously relevant to this work, but we will focus on making rigorous and identifying the mathematical properties of the finer (intensional) notion of algorithm.It is characteristic of this approach that we take recursion to be a fundamental (primitive) process for constructing algorithms, not a derived notion which must be reduced to others—e.g. iteration or application and abstraction, as in the classical λ-calculus. We will model algorithms by recursors, the set-theoretic objects one would naturally choose to represent (syntactically described) recursive definitions. Explicit and iterative algorithms are modelled by (appropriately degenerate) recursors.The main technical tool we will use is the formal language of recursion, FLR, a language of terms with two kinds of semantics: on each suitable structure, the denotation of a term t of FLR is a function, while the intension of t is a recursor (i.e. an algorithm) which computes the denotation of t. FLR is meant to be intensionally complete, in the sense that every (intuitively understood) “algorithm” should “be” (faithfully modelled, in all its essential properties by) the intension of some term of FLR on a suitably chosen structure.
48
Khusna, Arfiani Nur. "PENERAPAN CUSTOMER RELATIONSHIP MANAGEMENT (CRM) BERBASIS SMS GATEWAY PADA ONLINE SHOP TOKOFARAH." Telematika 13, no. 1 (January 3, 2016): 40. http://dx.doi.org/10.31315/telematika.v13i1.1719.
Full textAbstract:
SMS applications has become a promising business opportunities in the consumer and industrial markets in the world. One part that can not be separated from the SMS business is the role of an SMS Gateway, a system used by service providers to send and receive SMS automatically. Online shop tokofarah an online web business venture engaged in the production and sales of baby clothes and children. The problems that exist in the online shop tokofarah is the absence of communication between the customer and tokofarah thus reduced customer loyalty, customers are unaware of the latest promos and discounts, so the application of CRM (Customer Relationship Management) is very necessary to help communication. Alternative solutions in addition to implementing CRM also develop and implement SMS technology as a service via SMS Gateway online. Where customers can easily find information on the latest promos and discounts, customers can simply type a certain key word and send it to a specific number that has been provided, the store can also inform customers about the latest promos and products through SMS brodcast. In this study, using Gammu as tools liaison between the device with a computer modem. Making the program using the programming language PHP as an interface, a database maker MySQL tools. The results of the implementation of the concept of SMS Gateway technology is that it can provide convenience for online customers shop tokofarah in knowing the promo and the latest product information and can order via SMS.
49
Gordillo, Germán Campos, Germán Ramos Ruiz, Yves Stauffer, Stephan Dasen, and Carlos Fernández Bandera. "EplusLauncher: An API to Perform Complex EnergyPlus Simulations in MATLAB® and C#." Sustainability 12, no. 2 (January 16, 2020): 672. http://dx.doi.org/10.3390/su12020672.
Full textAbstract:
There is a growing concern about how to mitigate climate change, in which the production and use of energy has a great impact as one of the largest sources of global greenhouse gases (GHG). Buildings are responsible for a large percentage of these emissions. Therefore, there has been an increase in research in this area, in order to reduce their consumption and increase their efficiency. One of the major simulation programs used in optimization research is EnergyPlus. The purpose of this software is the complete energy simulation of a building, although it lacks tools to analyze its results and, above all, to manage and edit its simulations. For this reason, we developed an application programming interface (API) that serves to merge two areas which are highly demanded by researchers: energy building simulation (using EnergyPlus) and tools for the management and design of research experiments (in this case, MATLAB®). The developed API allows the user to perform complex simulations using EnergyPlus in a simple way, as it allows the editing of each simulation and the analysis of the simulation results through MATLAB®. In addition, it enables the user to simultaneously run multiple simulations, using either all computer core processors or a selection of them (i.e., allowing parallel computing), reducing the simulation time. The API was developed in the C# language, such that it can be used with any software that can import . N E T libraries.
50
Yi, Nengjun, and Shizhong Xu. "Bayesian Mapping of Quantitative Trait Loci for Complex Binary Traits." Genetics 155, no. 3 (July 1, 2000): 1391–403. http://dx.doi.org/10.1093/genetics/155.3.1391.
Full textAbstract:
AbstractA complex binary trait is a character that has a dichotomous expression but with a polygenic genetic background. Mapping quantitative trait loci (QTL) for such traits is difficult because of the discrete nature and the reduced variation in the phenotypic distribution. Bayesian statistics are proved to be a powerful tool for solving complicated genetic problems, such as multiple QTL with nonadditive effects, and have been successfully applied to QTL mapping for continuous traits. In this study, we show that Bayesian statistics are particularly useful for mapping QTL for complex binary traits. We model the binary trait under the classical threshold model of quantitative genetics. The Bayesian mapping statistics are developed on the basis of the idea of data augmentation. This treatment allows an easy way to generate the value of a hypothetical underlying variable (called the liability) and a threshold, which in turn allow the use of existing Bayesian statistics. The reversible jump Markov chain Monte Carlo algorithm is used to simulate the posterior samples of all unknowns, including the number of QTL, the locations and effects of identified QTL, genotypes of each individual at both the QTL and markers, and eventually the liability of each individual. The Bayesian mapping ends with an estimation of the joint posterior distribution of the number of QTL and the locations and effects of the identified QTL. Utilities of the method are demonstrated using a simulated outbred full-sib family. A computer program written in FORTRAN language is freely available on request.