Weighted sticker system

A sticker system is a computational model which uses a sticker operation on DNA molecules. A sticker operation works on the complementary relation of double stranded DNA by using ligation and annealing operation to form a complete double stranded DNA sequence. In this paper, a new variant of sticker systems, called weighted sticker systems, is introduced. Some basic properties of language families that are generated by the weighted sticker systems are investigated.This paper also introduces some restricted weighted variants of sticker systems such as weighted one-sided, regular, simple, simple one-sided and simple regular sticker systems. Moreover, the paper shows that the presence of weights increases the generative powers of usual variants of sticker systems

Weighted simple and semi-simple splicing systems

The modelling of splicing system has been introduced theoretically by Head in 1987. As time goes on, various splicing systems have been developed, such as one-sided, simple and semi-simple splicing systems. However, in the investigation on the generative power of splicing system, there are limitations on the generative power of splicing system with finite components. In order to overcome the limitation of the usual splicing system, one variant of splicing system has been introduced recently, called the weighted splicing system. In this paper, we associate weights from selected weighting spaces to the axioms of simple and semi-simple splicing systems, thus introducing weighted simple splicing system and weighted semi-simple splicing system. Some examples are presented for weighted simple and semi-simple splicing systems to illustrate their generative power. Lastly, relation of the languages generated by weighted simple and semi-simple splicing systems in the Chomsky hierarchy are also investigated

Automata diagram for finite groups

Recently, automata have been related to group theory by using some modification devices. These modification devices are namely deterministic finite automata and modified Watson-Crick finite automata. The automata can be linked to group theory when some automaton diagrams are drawn to recognize the data given in the Cayley table for the groups. Thus, the properties of groups can also be analyzed from the automaton diagrams. In this paper, the formal definitions for modified finite automata and modified Watson-Crick finite automata over the general case of finite groups are given. In addition, theorems are presented for the determination of a group by using the automaton diagram, and for the recognition of automata devices for groups. Lastly, the properties of centralizer of a group resulting from the analysis of automaton diagrams are also presented

Velocity analysis on moving objects detection using multi-scale histogram of oriented gradient

An autonomous car is a one-of-a-kind specimen in today's technology. It is an automatic system in which most of the duties that humans undertake in the car can be done automatically with minimum human supervision for road safety features. Moving automobile detections, on the other hand, are prone to more mistakes and can result in undesirable situations such as minor car wrecks. Moving vehicle identification is now done using high-speed cameras or LiDAR, for example, whereas self-driving cars are produced with deep learning, which requires much larger datasets. As a result, there may be greater space for improvement in the moving vehicle detection model. This research intends to create another moving car recognition model that uses multi-scale feature-based detection to improve the model's accuracy while also determining the maximum speed at which the model can detect moving objects. The recommended methodology was to create a lab-scale model that can be used as a guide for video and image capture on the lab-scale model, as well as the speed of the toy vehicles captured from the Arduino Uno machine before testing the car recognition model. According to the data, Multi-Scale Histogram of Oriented Gradient can recognize more objects than Histogram of Oriented Gradient with higher object identification accuracies and precision

Principal component analysis on meteorological data in UTM KL

The high usage of fossil fuel to produce energy for the increasing demand of energy has been the primary culprit behind global warming. Renewable energies such as solar energy can be a solution in preventing the situation from worsening. Solar energy can be harnessed using available system such as solar thermal cogeneration systems. However, for the system to function smoothly and continuously, knowledge on solar radiation’s intensity several minutes in advance are required. Though there exist various solar radiation forecast models, most of the existing models requires high computational time. In this research, principal component analysis were applied on the meteorological data collected in Universiti Teknologi Malaysia Kuala Lumpur to reduce the dimension of the data. Dominant factors obtained from the analysis is expected to be useful for the development of solar radiation forecast model

Impact of opioid-free analgesia on pain severity and patient satisfaction after discharge from surgery: multispecialty, prospective cohort study in 25 countries

Background: Balancing opioid stewardship and the need for adequate analgesia following discharge after surgery is challenging. This study aimed to compare the outcomes for patients discharged with opioid versus opioid-free analgesia after common surgical procedures.Methods: This international, multicentre, prospective cohort study collected data from patients undergoing common acute and elective general surgical, urological, gynaecological, and orthopaedic procedures. The primary outcomes were patient-reported time in severe pain measured on a numerical analogue scale from 0 to 100% and patient-reported satisfaction with pain relief during the first week following discharge. Data were collected by in-hospital chart review and patient telephone interview 1 week after discharge.Results: The study recruited 4273 patients from 144 centres in 25 countries; 1311 patients (30.7%) were prescribed opioid analgesia at discharge. Patients reported being in severe pain for 10 (i.q.r. 1-30)% of the first week after discharge and rated satisfaction with analgesia as 90 (i.q.r. 80-100) of 100. After adjustment for confounders, opioid analgesia on discharge was independently associated with increased pain severity (risk ratio 1.52, 95% c.i. 1.31 to 1.76; P < 0.001) and re-presentation to healthcare providers owing to side-effects of medication (OR 2.38, 95% c.i. 1.36 to 4.17; P = 0.004), but not with satisfaction with analgesia (beta coefficient 0.92, 95% c.i. -1.52 to 3.36; P = 0.468) compared with opioid-free analgesia. Although opioid prescribing varied greatly between high-income and low- and middle-income countries, patient-reported outcomes did not.Conclusion: Opioid analgesia prescription on surgical discharge is associated with a higher risk of re-presentation owing to side-effects of medication and increased patient-reported pain, but not with changes in patient-reported satisfaction. Opioid-free discharge analgesia should be adopted routinely

Permutation groups in automata diagrams

Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types of languages a string belongs to. In the study of automata and group theory, it has been found that the properties of a group can be recognized by the automata using the automata diagrams. There are two types of automata used to study the properties of a group, namely modified finite automata and modified Watson-Crick finite automata. Thus, in this paper, automata diagrams are constructed to recognize permutation groups using the data given by the Cayley table. Thus, the properties of permutation group are analyzed using the automaton diagram that has been constructed. Moreover, some theorems for the properties of permutation group in term of automata are also given in this paper

Magic star puzzle for educational mathematics

One of the interesting fields in recreational mathematics is the magic number arrangement. There are different kinds of arrays in the arrangement for a group of numbers. In particular, one of the arrays in magic number arrangement is called magic star. In fact, magic star involves combinatorics that contributes to geometrical analysis and number theory. Hence, magic star is suitable to be introduced as educational mathematics to cultivate interest in different area of mathematics. To obtain the solutions of normal magic stars of order six, the possible sets of numbers for every line in a magic star have been considered. Previously, the calculation for obtaining the solutions has been done manually which is time-consuming. Therefore, a programming code to generate all the fundamental solutions for normal magic star of order six without including the properties of rotation and reflection has been done. In this puzzle, a magic star puzzle is created by using Matlab software, which enables a user to verify the entries for the cells of magic star of order six. Moreover, it is also user-friendly as it provides interactive commands on the inputs given by the user, which enables the user to detect the incorrect inputs. In addition, user can also choose to view all the fundamental solutions as generated by the programming code

Automata diagram for groups

Automata act as the recognition devices to determine the types of languages a string belongs to, by using the transition graph. In the previous researches, the classical models of automata have been used to recognize the strings in languages. Recently, the relation of automata and Cayley table of the group have been studied to relate automata theory with group. In the study of automata and group theory, it has been found that automata diagram can be used to analyse properties of some groups such as Abelian groups and Permutation groups. Such automata that are used are modified finite automata and Watson-Crick finite automata. Thus in this paper, the definition and some properties of group in terms of automata diagram are given