Search results for: maximal prefix code
1589 Optimization of the Culture Medium, Incubation Period, pH and Temperatures for Maximal Dye Bioremoval Using A. Fumigates
Authors: Wafaa M. Abd El-Rahim, Magda A. El-Meleigy, Eman Refaat
Abstract:
This study dealing with optimization the conditions affecting the formation of extracellular lignin- degrading enzymes to achieve maximal decolorization activity of Direct Violet dye by one fungal strain. In this study Aspergillus fumigates fungal strain used for production extracellular ligninolytic enzymes for removing Direct Violet dye under different conditions: culture medium, incubation period, pH and temperatures. The results indicted that the removal efficiency of A. fumigatus was enhanced by addition glucose and peptone to the culture medium. The addition of peptone and glucose was found to increase the decolorization activity of the fungal isolate from 51.38% to 93.74% after 4 days of incubation. The highest production of extracellular lignin degrading enzymes also recorded in Direct Violet dye medium supplemented with peptone and glucose. It was also found the decolorization activity of A. fumigatus was decreased gradually by increasing the incubation period up to 4 days. Also it was found that the fungal strain can grow and produce extracellular ligninolytic enzymes which accompanied by efficient removal of Direct Violet dye in a wide pH range of 4-8. The results also found that the maximal biosynthesis of ligninolytic enzymes which accompanied with maximal removal of Direct Violet dye was obtained at a temperature of 28C. This indicates that the different conditions of culture medium, incubation period, pH and temperatures are effective on dye decolorization on the fungal biomass and played a role in Direct Violet dye removal along with enzymatic activity of A. fumigatus.Keywords: A. fumigates, extracellular lignin- degrading enzymes, textile dye, dye removing
Procedia PDF Downloads 2731588 Thermodynamic Modeling of Three Pressure Level Reheat HRSG, Parametric Analysis and Optimization Using PSO
Authors: Mahmoud Nadir, Adel Ghenaiet
Abstract:
The main purpose of this study is the thermodynamic modeling, the parametric analysis, and the optimization of three pressure level reheat HRSG (Heat Recovery Steam Generator) using PSO method (Particle Swarm Optimization). In this paper, a parametric analysis followed by a thermodynamic optimization is presented. The chosen objective function is the specific work of the steam cycle that may be, in the case of combined cycle (CC), a good criterion of thermodynamic performance analysis, contrary to the conventional steam turbines in which the thermal efficiency could be also an important criterion. The technologic constraints such as maximal steam cycle temperature, minimal steam fraction at steam turbine outlet, maximal steam pressure, minimal stack temperature, minimal pinch point, and maximal superheater effectiveness are also considered. The parametric analyses permitted to understand the effect of design parameters and the constraints on steam cycle specific work variation. PSO algorithm was used successfully in HRSG optimization, knowing that the achieved results are in accordance with those of the previous studies in which genetic algorithms were used. Moreover, this method is easy to implement comparing with the other methods.Keywords: combined cycle, HRSG thermodynamic modeling, optimization, PSO, steam cycle specific work
Procedia PDF Downloads 3761587 Virtual Reality Based 3D Video Games and Speech-Lip Synchronization Superseding Algebraic Code Excited Linear Prediction
Authors: P. S. Jagadeesh Kumar, S. Meenakshi Sundaram, Wenli Hu, Yang Yung
Abstract:
In 3D video games, the dominance of production is unceasingly growing with a protruding level of affordability in terms of budget. Afterward, the automation of speech-lip synchronization technique is customarily onerous and has advanced a critical research subject in virtual reality based 3D video games. This paper presents one of these automatic tools, precisely riveted on the synchronization of the speech and the lip movement of the game characters. A robust and precise speech recognition segment that systematized with Algebraic Code Excited Linear Prediction method is developed which unconventionally delivers lip sync results. The Algebraic Code Excited Linear Prediction algorithm is constructed on that used in code-excited linear prediction, but Algebraic Code Excited Linear Prediction codebooks have an explicit algebraic structure levied upon them. This affords a quicker substitute to the software enactments of lip sync algorithms and thus advances the superiority of service factors abridged production cost.Keywords: algebraic code excited linear prediction, speech-lip synchronization, video games, virtual reality
Procedia PDF Downloads 4611586 Practical Challenges of Tunable Parameters in Matlab/Simulink Code Generation
Authors: Ebrahim Shayesteh, Nikolaos Styliaras, Alin George Raducu, Ozan Sahin, Daniel Pombo VáZquez, Jonas Funkquist, Sotirios Thanopoulos
Abstract:
One of the important requirements in many code generation projects is defining some of the model parameters tunable. This helps to update the model parameters without performing the code generation again. This paper studies the concept of embedded code generation by MATLAB/Simulink coder targeting the TwinCAT Simulink system. The generated runtime modules are then tested and deployed to the TwinCAT 3 engineering environment. However, defining the parameters tunable in MATLAB/Simulink code generation targeting TwinCAT is not very straightforward. This paper focuses on this subject and reviews some of the techniques tested here to make the parameters tunable in generated runtime modules. Three techniques are proposed for this purpose, including normal tunable parameters, callback functions, and mask subsystems. Moreover, some test Simulink models are developed and used to evaluate the results of proposed approaches. A brief summary of the study results is presented in the following. First of all, the parameters defined tunable and used in defining the values of other Simulink elements (e.g., gain value of a gain block) could be changed after the code generation and this value updating will affect the values of all elements defined based on the values of the tunable parameter. For instance, if parameter K=1 is defined as a tunable parameter in the code generation process and this parameter is used to gain a gain block in Simulink, the gain value for the gain block is equal to 1 in the gain block TwinCAT environment after the code generation. But, the value of K can be changed to a new value (e.g., K=2) in TwinCAT (without doing any new code generation in MATLAB). Then, the gain value of the gain block will change to 2. Secondly, adding a callback function in the form of “pre-load function,” “post-load function,” “start function,” and will not help to make the parameters tunable without performing a new code generation. This means that any MATLAB files should be run before performing the code generation. The parameters defined/calculated in this file will be used as fixed values in the generated code. Thus, adding these files as callback functions to the Simulink model will not make these parameters flexible since the MATLAB files will not be attached to the generated code. Therefore, to change the parameters defined/calculated in these files, the code generation should be done again. However, adding these files as callback functions forces MATLAB to run them before the code generation, and there is no need to define the parameters mentioned in these files separately. Finally, using a tunable parameter in defining/calculating the values of other parameters through the mask is an efficient method to change the value of the latter parameters after the code generation. For instance, if tunable parameter K is used in calculating the value of two other parameters K1 and K2 and, after the code generation, the value of K is updated in TwinCAT environment, the value of parameters K1 and K2 will also be updated (without any new code generation).Keywords: code generation, MATLAB, tunable parameters, TwinCAT
Procedia PDF Downloads 2221585 Design and Performance Improvement of Three-Dimensional Optical Code Division Multiple Access Networks with NAND Detection Technique
Authors: Satyasen Panda, Urmila Bhanja
Abstract:
In this paper, we have presented and analyzed three-dimensional (3-D) matrices of wavelength/time/space code for optical code division multiple access (OCDMA) networks with NAND subtraction detection technique. The 3-D codes are constructed by integrating a two-dimensional modified quadratic congruence (MQC) code with one-dimensional modified prime (MP) code. The respective encoders and decoders were designed using fiber Bragg gratings and optical delay lines to minimize the bit error rate (BER). The performance analysis of the 3D-OCDMA system is based on measurement of signal to noise ratio (SNR), BER and eye diagram for a different number of simultaneous users. Also, in the analysis, various types of noises and multiple access interference (MAI) effects were considered. The results obtained with NAND detection technique were compared with those obtained with OR and AND subtraction techniques. The comparison results proved that the NAND detection technique with 3-D MQC\MP code can accommodate more number of simultaneous users for longer distances of fiber with minimum BER as compared to OR and AND subtraction techniques. The received optical power is also measured at various levels of BER to analyze the effect of attenuation.Keywords: Cross Correlation (CC), Three dimensional Optical Code Division Multiple Access (3-D OCDMA), Spectral Amplitude Coding Optical Code Division Multiple Access (SAC-OCDMA), Multiple Access Interference (MAI), Phase Induced Intensity Noise (PIIN), Three Dimensional Modified Quadratic Congruence/Modified Prime (3-D MQC/MP) code
Procedia PDF Downloads 4081584 Distinguishing Borrowings from Code Mixes: An Analysis of English Lexical Items Used in the Print Media in Sri Lanka
Authors: Chamindi Dilkushi Senaratne
Abstract:
Borrowing is the morphological, syntactic and (usually) phonological integration of lexical items from one language into the structure of another language. Borrowings show complete linguistic integration and due to the frequency of use become fossilized in the recipient language differentiating them from switches and mixes. Code mixes are different to borrowings. Code mixing takes place when speakers use lexical items in casual conversation to serve a variety of functions. This study presents an analysis of lexical items used in English newspapers in Sri Lanka in 2017 which reveal characteristics of borrowing or code mixes. Both phenomena arise due to language contact. The study will also use data from social media websites that comment on newspaper articles available on the web. The study reiterates that borrowings are distinguishable from code mixes and that they are two different phenomena that occur in language contact situations. The study also shows how existing morphological processes are used to create new vocabulary in language use. The study sheds light into how existing morphological processes are used by the bilingual to be creative, innovative and convey a bilingual identity.Keywords: borrowing, code mixing, morphological processes
Procedia PDF Downloads 2141583 Integral Domains and Their Algebras: Topological Aspects
Authors: Shai Sarussi
Abstract:
Let S be an integral domain with field of fractions F and let A be an F-algebra. An S-subalgebra R of A is called S-nice if R∩F = S and the localization of R with respect to S \{0} is A. Denoting by W the set of all S-nice subalgebras of A, and defining a notion of open sets on W, one can view W as a T0-Alexandroff space. Thus, the algebraic structure of W can be viewed from the point of view of topology. It is shown that every nonempty open subset of W has a maximal element in it, which is also a maximal element of W. Moreover, a supremum of an irreducible subset of W always exists. As a notable connection with valuation theory, one considers the case in which S is a valuation domain and A is an algebraic field extension of F; if S is indecomposed in A, then W is an irreducible topological space, and W contains a greatest element.Keywords: integral domains, Alexandroff topology, prime spectrum of a ring, valuation domains
Procedia PDF Downloads 1211582 Error Detection and Correction for Onboard Satellite Computers Using Hamming Code
Authors: Rafsan Al Mamun, Md. Motaharul Islam, Rabana Tajrin, Nabiha Noor, Shafinaz Qader
Abstract:
In an attempt to enrich the lives of billions of people by providing proper information, security and a way of communicating with others, the need for efficient and improved satellites is constantly growing. Thus, there is an increasing demand for better error detection and correction (EDAC) schemes, which are capable of protecting the data onboard the satellites. The paper is aimed towards detecting and correcting such errors using a special algorithm called the Hamming Code, which uses the concept of parity and parity bits to prevent single-bit errors onboard a satellite in Low Earth Orbit. This paper focuses on the study of Low Earth Orbit satellites and the process of generating the Hamming Code matrix to be used for EDAC using computer programs. The most effective version of Hamming Code generated was the Hamming (16, 11, 4) version using MATLAB, and the paper compares this particular scheme with other EDAC mechanisms, including other versions of Hamming Codes and Cyclic Redundancy Check (CRC), and the limitations of this scheme. This particular version of the Hamming Code guarantees single-bit error corrections as well as double-bit error detections. Furthermore, this version of Hamming Code has proved to be fast with a checking time of 5.669 nanoseconds, that has a relatively higher code rate and lower bit overhead compared to the other versions and can detect a greater percentage of errors per length of code than other EDAC schemes with similar capabilities. In conclusion, with the proper implementation of the system, it is quite possible to ensure a relatively uncorrupted satellite storage system.Keywords: bit-flips, Hamming code, low earth orbit, parity bits, satellite, single error upset
Procedia PDF Downloads 1231581 Isolated Contraction of Deep Lumbar Paraspinal Muscle with Magnetic Nerve Root Stimulation: A Pilot Study
Authors: Shi-Uk Lee, Chae Young Lim
Abstract:
Objective: The aim of this study was to evaluate the changes of lumbar deep muscle thickness and cross-sectional area using ultrasonography with magnetic stimulation. Methods: To evaluate the changes of lumbar deep muscle by using magnetic stimulation, 12 healthy volunteers (39.6±10.0 yrs) without low back pain during 3 months participated in this study. All the participants were checked with X-ray and electrophysiologic study to confirm that they had no problems with their back. Magnetic stimulation was done on the L5 and S1 root with figure-eight coil as previous study. To confirm the proper motor root stimulation, the surface electrode was put on the tibialis anterior (L5) and abductor hallucis muscles (S1) and the hot spots of magnetic stimulation were found with 50% of maximal magnetic stimulation and determined the stimulation threshold lowering the magnetic intensity by 5%. Ultrasonography was used to assess the changes of L5 and S1 lumbar multifidus (superficial and deep) cross-sectional area and thickness with maximal magnetic stimulation. Cross-sectional area (CSA) and thickness was evaluated with image acquisition program, ImageJ software (National Institute of Healthy, USA). Wilcoxon signed-rank was used to compare outcomes between before and after stimulations. Results: The mean minimal threshold was 29.6±3.8% of maximal stimulation intensity. With minimal magnetic stimulation, thickness of L5 and S1 deep multifidus (DM) were increased from 1.25±0.20, 1.42±0.23 cm to 1.40±0.27, 1.56±0.34 cm, respectively (P=0.005, P=0.003). CSA of L5 and S1 DM were also increased from 2.26±0.18, 1.40±0.26 cm2 to 2.37±0.18, 1.56±0.34 cm2, respectively (P=0.002, P=0.002). However, thickness of L5 and S1 superficial multifidus (SM) were not changed from 1.92±0.21, 2.04±0.20 cm to 1.91±0.33, 1.96±0.33 cm (P=0.211, P=0.199) and CSA of L5 and S1 were also not changed from 4.29±0.53, 5.48±0.32 cm2 to 4.42±0.42, 5.64±0.38 cm2. With maximal magnetic stimulation, thickness of L5, S1 of DM and SM were increased (L5 DM, 1.29±0.26, 1.46±0.27 cm, P=0.028; L5 SM, 2.01±0.42, 2.24±0.39 cm, P=0.005; S1 DM, 1.29±0.19, 1.67±0.29 P=0.002; S1 SM, 1.90±0.36, 2.30±0.36, P=0.002). CSA of L5, S1 of DM and SM were also increased (all P values were 0.002). Conclusions: Deep lumbar muscles could be stimulated with lumbar motor root magnetic stimulation. With minimal stimulation, thickness and CSA of lumbosacral deep multifidus were increased in this study. Further studies are needed to confirm whether the similar results in chronic low back pain patients are represented. Lumbar magnetic stimulation might have strengthening effect of deep lumbar muscles with no discomfort.Keywords: magnetic stimulation, lumbar multifidus, strengthening, ultrasonography
Procedia PDF Downloads 3631580 Performance Comparison of Space-Time Block and Trellis Codes under Rayleigh Channels
Authors: Jing Qingfeng, Wu Jiajia
Abstract:
Due to the crowded orbits and shortage of frequency resources, utilizing of MIMO technology to improve spectrum efficiency and increase the capacity has become a necessary trend of broadband satellite communication. We analyze the main influenced factors and compare the BER performance of space-time block code (STBC) scheme and space-time trellis code (STTC) scheme. This paper emphatically studies the bit error rate (BER) performance of STTC and STBC under Rayleigh channel. The main emphasis is placed on the effects of the factors, such as terminal environment and elevation angles, on the BER performance of STBC and STTC schemes. Simulation results indicate that performance of STTC under Rayleigh channel is obviously improved with the increasing of transmitting and receiving antennas numbers, but the encoder state has little impact on the performance. Under Rayleigh channel, performance of Alamouti code is better than that of STTC.Keywords: MIMO, space time block code (STBC), space time trellis code (STTC), Rayleigh channel
Procedia PDF Downloads 3421579 The Implementation of Character Education in Code Riverbanks, Special Region of Yogyakarta, Indonesia
Authors: Ulil Afidah, Muhamad Fathan Mubin, Firdha Aulia
Abstract:
Code riverbanks Yogyakarta is a settlement area with middle to lower social classes. Socio-economic situation is affecting the behavior of society. This research aimed to find and explain the implementation and the assessment of character education which were done in elementary schools in Code riverside, Yogyakarta region of Indonesia. This research is a qualitative research which the subjects were the kids of Code riverbanks, Yogyakarta. The data were collected through interviews and document studies and analyzed qualitatively using the technique of interactive analysis model of Miles and Huberman. The results show that: (1) The learning process of character education was done by integrating all aspects such as democratic and interactive learning session also introducing role model to the students. 2) The assessment of character education was done by teacher based on teaching and learning process and an activity in outside the classroom that was the criterion on three aspects: Cognitive, affective and psychomotor.Keywords: character, Code riverbanks, education, Yogyakarta
Procedia PDF Downloads 2421578 JaCoText: A Pretrained Model for Java Code-Text Generation
Authors: Jessica Lopez Espejel, Mahaman Sanoussi Yahaya Alassan, Walid Dahhane, El Hassane Ettifouri
Abstract:
Pretrained transformer-based models have shown high performance in natural language generation tasks. However, a new wave of interest has surged: automatic programming language code generation. This task consists of translating natural language instructions to a source code. Despite the fact that well-known pre-trained models on language generation have achieved good performance in learning programming languages, effort is still needed in automatic code generation. In this paper, we introduce JaCoText, a model based on Transformer neural network. It aims to generate java source code from natural language text. JaCoText leverages the advantages of both natural language and code generation models. More specifically, we study some findings from state of the art and use them to (1) initialize our model from powerful pre-trained models, (2) explore additional pretraining on our java dataset, (3) lead experiments combining the unimodal and bimodal data in training, and (4) scale the input and output length during the fine-tuning of the model. Conducted experiments on CONCODE dataset show that JaCoText achieves new state-of-the-art results.Keywords: java code generation, natural language processing, sequence-to-sequence models, transformer neural networks
Procedia PDF Downloads 2661577 A Guide to User-Friendly Bash Prompt: Adding Natural Language Processing Plus Bash Explanation to the Command Interface
Authors: Teh Kean Kheng, Low Soon Yee, Burra Venkata Durga Kumar
Abstract:
In 2022, as the future world becomes increasingly computer-related, more individuals are attempting to study coding for themselves or in school. This is because they have discovered the value of learning code and the benefits it will provide them. But learning coding is difficult for most people. Even senior programmers that have experience for a decade year still need help from the online source while coding. The reason causing this is that coding is not like talking to other people; it has the specific syntax to make the computer understand what we want it to do, so coding will be hard for normal people if they don’t have contact in this field before. Coding is hard. If a user wants to learn bash code with bash prompt, it will be harder because if we look at the bash prompt, we will find that it is just an empty box and waiting for a user to tell the computer what we want to do, if we don’t refer to the internet, we will not know what we can do with the prompt. From here, we can conclude that the bash prompt is not user-friendly for new users who are learning bash code. Our goal in writing this paper is to give an idea to implement a user-friendly Bash prompt in Ubuntu OS using Artificial Intelligent (AI) to lower the threshold of learning in Bash code, to make the user use their own words and concept to write and learn Bash code.Keywords: user-friendly, bash code, artificial intelligence, threshold, semantic similarity, lexical similarity
Procedia PDF Downloads 1311576 Indian Bankruptcy Code 2016: Impact On Cross-Border Insolvency, an Analysis
Authors: Astha Sinha, Anjali Kanagali
Abstract:
India has been tackling with less than sophisticated legislations when it comes to recovery of debt and bankruptcy situations for a while now. There were multiple overlapping laws and adjudication forums dealing with financial failures and insolvency of companies/individuals in India without really aiding the timely recover of defaulted assets. It remained dicey for businesses to invest in India since there was a lack of legal and institutional machinery for dealing with debt defaults as per the global standards. After much deliberation, the Indian Draft Insolvency code received the presidential assent on May 28, 2016 bringing the Bankruptcy and Insolvency Code, 2016 into existence. The Code is expected to bring about great progress for the country and specifically has the two standout developments. The first is that it calls for resolution of corporate insolvency within a period of 180 days extendable by 90 days hence bringing about security in the minds of investors. Second is that it calls for the creation of a new class of insolvency professionals whose primary function shall be helping sick companies and banks with their takeovers, provides for setting up an Insolvency and Bankruptcy Board to regulate the same and provides for a two stage process of liquidation. The Code is estimated to help India move up its ranking on the World Bank’s ease of doing business index. It is currently ranked at the 130th position lower than some of the sub-saharan African countries. Besides this, however, there are various areas in which the Code falls short such as lack of provisions for aiding the issue of cross-border insolvency, impact on Medium and Small Enterprises in India etc. This paper aims to analyze the provisions of the new Bankruptcy and Insolvency Code, 2016 and its contribution in making India a more desirable location for doing business. It shall also emphasize on the cross-border insolvency issues, practices followed by other countries to resolve the same and the way forward for India to strengthen its Bankruptcy and Insolvency framework.Keywords: bankruptcy and insolvency code 2016, cross-border insolvency provisions in the 2016 code, Ease of doing business and bankruptcy code, highlights of the new Indian bankruptcy code 2016
Procedia PDF Downloads 2601575 Comparison between Separable and Irreducible Goppa Code in McEliece Cryptosystem
Authors: Newroz Nooralddin Abdulrazaq, Thuraya Mahmood Qaradaghi
Abstract:
The McEliece cryptosystem is an asymmetric type of cryptography based on error correction code. The classical McEliece used irreducible binary Goppa code which considered unbreakable until now especially with parameter [1024, 524, and 101], but it is suffering from large public key matrix which leads to be difficult to be used practically. In this work Irreducible and Separable Goppa codes have been introduced. The Irreducible and Separable Goppa codes used are with flexible parameters and dynamic error vectors. A Comparison between Separable and Irreducible Goppa code in McEliece Cryptosystem has been done. For encryption stage, to get better result for comparison, two types of testing have been chosen; in the first one the random message is constant while the parameters of Goppa code have been changed. But for the second test, the parameters of Goppa code are constant (m=8 and t=10) while the random message have been changed. The results show that the time needed to calculate parity check matrix in separable are higher than the one for irreducible McEliece cryptosystem, which is considered expected results due to calculate extra parity check matrix in decryption process for g2(z) in separable type, and the time needed to execute error locator in decryption stage in separable type is better than the time needed to calculate it in irreducible type. The proposed implementation has been done by Visual studio C#.Keywords: McEliece cryptosystem, Goppa code, separable, irreducible
Procedia PDF Downloads 2621574 An Enhanced MEIT Approach for Itemset Mining Using Levelwise Pruning
Authors: Tanvi P. Patel, Warish D. Patel
Abstract:
Association rule mining forms the core of data mining and it is termed as one of the well-known methodologies of data mining. Objectives of mining is to find interesting correlations, frequent patterns, associations or casual structures among sets of items in the transaction databases or other data repositories. Hence, association rule mining is imperative to mine patterns and then generate rules from these obtained patterns. For efficient targeted query processing, finding frequent patterns and itemset mining, there is an efficient way to generate an itemset tree structure named Memory Efficient Itemset Tree. Memory efficient IT is efficient for storing itemsets, but takes more time as compare to traditional IT. The proposed strategy generates maximal frequent itemsets from memory efficient itemset tree by using levelwise pruning. For that firstly pre-pruning of items based on minimum support count is carried out followed by itemset tree reconstruction. By having maximal frequent itemsets, less number of patterns are generated as well as tree size is also reduced as compared to MEIT. Therefore, an enhanced approach of memory efficient IT proposed here, helps to optimize main memory overhead as well as reduce processing time.Keywords: association rule mining, itemset mining, itemset tree, meit, maximal frequent pattern
Procedia PDF Downloads 3651573 Size-Reduction Strategies for Iris Codes
Authors: Jutta Hämmerle-Uhl, Georg Penn, Gerhard Pötzelsberger, Andreas Uhl
Abstract:
Iris codes contain bits with different entropy. This work investigates different strategies to reduce the size of iris code templates with the aim of reducing storage requirements and computational demand in the matching process. Besides simple sub-sampling schemes, also a binary multi-resolution representation as used in the JBIG hierarchical coding mode is assessed. We find that iris code template size can be reduced significantly while maintaining recognition accuracy. Besides, we propose a two stage identification approach, using small-sized iris code templates in a pre-selection satge, and full resolution templates for final identification, which shows promising recognition behaviour.Keywords: iris recognition, compact iris code, fast matching, best bits, pre-selection identification, two-stage identification
Procedia PDF Downloads 4351572 Mobile Agent Security Using Reference Monitor Based Security Framework
Authors: Sandhya Armoogum
Abstract:
In distributed systems and in open systems such as the Internet, often mobile code has to run on unknown and potentially hostile hosts. Mobile code such as a mobile agent is vulnerable when executing on remote hosts. The mobile agent may be subjected to various attacks such as tampering, inspection, and replay attack by a malicious host. Much research has been done to provide solutions for various security problems, such as authentication of mobile agent and hosts, integrity and confidentiality of the data carried by the mobile agent. Many of such proposed solutions in literature are not suitable for open systems whereby the mobile code arrives and executes on a host which is not known and trusted by the mobile agent owner. In this paper, we propose the adoption of the reference monitor by hosts in an open system for providing trust and security for mobile code execution. A secure protocol for the distribution of the reference monitor entity is described. This reference monitor entity on the remote host may also provide several security services such as authentication and integrity to the mobile code.Keywords: security, mobile agents, reference monitor, trust
Procedia PDF Downloads 4321571 Employing QR Code as an Effective Educational Tool for Quick Access to Sources of Kindergarten Concepts
Authors: Ahmed Amin Mousa, M. Abd El-Salam
Abstract:
This study discusses a simple solution for the problem of shortage in learning resources for kindergarten teachers. Occasionally, kindergarten teachers cannot access proper resources by usual search methods as libraries or search engines. Furthermore, these methods require a long time and efforts for preparing. The study is expected to facilitate accessing learning resources. Moreover, it suggests a potential direction for using QR code inside the classroom. The present work proposes that QR code can be used for digitizing kindergarten curriculums and accessing various learning resources. It investigates using QR code for saving information related to the concepts which kindergarten teachers use in the current educational situation. The researchers have established a guide for kindergarten teachers based on the Egyptian official curriculum. The guide provides different learning resources for each scientific and mathematical concept in the curriculum, and each learning resource is represented as a QR code image that contains its URL. Therefore, kindergarten teachers can use smartphone applications for reading QR codes and displaying the related learning resources for students immediately. The guide has been provided to a group of 108 teachers for using inside their classrooms. The results showed that the teachers approved the guide, and gave a good response.Keywords: kindergarten, child, learning resources, QR code, smart phone, mobile
Procedia PDF Downloads 2831570 Effect of Two Bouts of Eccentric Exercise on Knee Flexors Changes in Muscle-Tendon Lengths
Authors: Shang-Hen Wu, Yung-Chen Lin, Wei-Song Chang, Ming-Ju Lin
Abstract:
This study investigated whether the repeated bout effect (RBE) of knee flexors (KF) eccentric exercise would be changed in muscle-tendon lengths. Eight healthy university male students used their KF of non-dominant leg and performed a bout of 60 maximal isokinetic (30°/s) eccentric contractions (MaxECC1). A week after MaxECC1, all subjects used the same KF to perform a subsequent bout of MaxECC2. Changes in maximal isokinetic voluntary contraction torque (MVC-CON), muscle soreness (SOR), relaxed knee joint angle (RANG), leg circumference (CIR), and ultrasound images (UI; muscle-tendon length and muscle angle) were measured before, immediately after, 1-5 days after each bout. Two-way ANOVA was used to analyze all the dependent variables. After MaxECC1, all the dependent variables (e.g. MVC-CON: ↓30%, muscle-tendon length: ↑24%, muscle angle: ↑15%) showed significantly change. Following MaxECC2, all the above dependent variables (e.g. MVC-CON:↓21%, tendon length: ↑16%, muscle angle: ↑6%) were significantly smaller than those of MaxECC1. These results of this study found that protective effect conferred by MaxECC1 against MaxECC2, and changes in muscle damage indicators, muscle-tendon length and muscle angle following MaxECC2 were smaller than MaxECC1. Thus, the amount of shift of muscle-tendon length and muscle angle was related to the RBE.Keywords: eccentric exercise, maximal isokinetic voluntary contraction torque, repeated bout effect, ultrasound
Procedia PDF Downloads 3261569 Interpreting Form Based Code in Historic Residential Corridor
Authors: Diljan C. K.
Abstract:
Every location on the planet has a history and culture that give it its own identity and character, making it distinct from others. urbanised world, it is fashionable to remould its original character and impression in a contemporary style. The new character and impression of places show a complete detachment from their roots. The heritage and cultural values of the place are replaced by new impressions, and as a result, they eventually lose their identity and character and never have sustenance. In this situation, form-based coding acts as a tool in the urban design process, helping to come up with solutions that strongly bind individuals to their neighbourhood and are closely related to culture through the physical spaces they are associated with. Form-based code was made by pioneers of new urbanism in 1987 in the United States of America. Since then, it has been used in various projects inside and outside the USA with varied scales, from the design of a single building to the design of a whole community. This research makes an effort to interpret the form-based code in historic corridors to establish the association of physical form and space with the public realm to uphold the context and culture. Many of the historic corridors are undergoing a tremendous transformation in their physical form, avoiding their culture and context. This will lead to it losing its identity in form and function. If the case of Valiyashala in Trivandrum is taken as the case, which is transforming its form and will lead to the loss of its identity, the form-based code will be a suitable tool to strengthen its historical value. The study concludes by analysing the existing code (KMBR) of Valiyashala and form-based code to find the requirements in form-based code for Valiyashala.Keywords: form based code, urban conservation, heritage, historic corridor
Procedia PDF Downloads 1021568 Discrimination against Women in Workplace: A Case Study on Hotel Dress Code
Authors: A. R. Anwar
Abstract:
The development of discrimination case which is now extended to the issue of female workers dress code in the hotel industry seen as a challenging topic and a solution is needed. Discrimination generally gives a negative impact on the victim and has a direct impact on female workers if it involves the issue of this dress code. Hence it is not appropriate if these genders are subjected to discrimination that prohibits them from wearing a hijab and required to wear a short skirt during working hours. On this basis, this study discusses the major problems pertaining to dress code faced by female workers in the Malaysian hotel industry. An interview with qualified parties from human resource department in each selected hotels has been conducted in which later generated the findings and supported by materials that obtained from libraries, archives and other databases. Through the research findings, several recommendations were introduced to reduce and eliminate the discrimination issue in Malaysian working sector particularly in the hotel industry in order to achieve the equality among men and women in the workplace.Keywords: discrimination, dress code in the hotel, impact on female workers, equality
Procedia PDF Downloads 1911567 Biomechanical Assessment of Esophageal Elongation
Authors: Marta Kozuń, Krystian Toczewski, Sylwester Gerus, Justyna Wolicka, Kamila Boberek, Jarosław Filipiak, Dariusz Patkowski
Abstract:
Long gap esophageal atresia is a congenital defect and is a challenge for pediatric surgeons all over the world. There are different surgical techniques in use to treat atresia. One of them is esophageal elongation but the optimal suture placement technique to achieve maximum elongation with low-risk complications is still unknown. The aim of the study was to characterize the process of esophageal elongation from the biomechanical point of view. Esophagi of white Pekin Duck was used as a model based on the size of this animal which is similar to a newborn (2.5-4kg). The specimens were divided into two groups: the control group (CG) and the group with sutures (SG). The esophagi of the control group were mounted in the grips of the MTS Tytron 250 testing machine and tensile test until rupture was performed. The loading speed during the test was 10mm/min. Then the SG group was tested. Each esophagus was cut into two equal parts and that were fused together using surgical sutures. The distance between both esophagus parts was 20mm. Ten both ends were mounted on the same testing machine and the tensile test with the same parameters was conducted. For all specimens, force and elongation were recorded. The biomechanical properties, i.e., the maximal force and maximal elongation, were determined on the basis of force-elongation curves. The maximal elongation was determined at the point of maximal force. The force achieved with the suture group was 10.1N±1.9N and 50.3N±11.6N for the control group. The highest elongation was also obtained for the control group: 18mm±3mm vs. 13.5mm ±2.4mm for the suture group. The presented study expands the knowledge of elongation of esophagi. It is worth emphasizing that the duck esophagus differs from the esophagus of a newborn, i.e., its wall lacks striated muscle cells. This is why the parts of animal esophagi used in the research are may characterized by different biomechanical properties in comparison with newborn tissue.Keywords: long gap atresia treatment, esophageal elongation, biomechanical properties, soft tissue
Procedia PDF Downloads 931566 Study on the Effect of Coupling Fluid Compressible-Deformable Wall on the Flow of Molten Polymers
Authors: Mohamed Driouich, Kamal Gueraoui, Mohamed Sammouda
Abstract:
The main objective of this work is to establish a numerical code for studying the flow of molten polymers in deformable pipes. Using an iterative numerical method based on finite differences, we determine the profiles of the fluid velocity, the temperature and the apparent viscosity of the fluid. The numerical code presented can also be applied to other industrial applications.Keywords: numerical code, molten polymers, deformable pipes, finite differences
Procedia PDF Downloads 5641565 Some Codes for Variants in Graphs
Authors: Sofia Ait Bouazza
Abstract:
We consider the problem of finding a minimum identifying code in a graph. This problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications (fault diagnosis, location detection …). Suppose we have a building into which we need to place fire alarms. Suppose each alarm is designed so that it can detect any fire that starts either in the room in which it is located or in any room that shares a doorway with the room. We want to detect any fire that may occur or use the alarms which are sounding to not only to not only detect any fire but be able to tell exactly where the fire is located in the building. For reasons of cost, we want to use as few alarms as necessary. The first problem involves finding a minimum domination set of a graph. If the alarms are three state alarms capable of distinguishing between a fire in the same room as the alarm and a fire in an adjacent room, we are trying to find a minimum locating domination set. If the alarms are two state alarms that can only sound if there is a fire somewhere nearby, we are looking for a differentiating domination set of a graph. These three areas are the subject of much active research; we primarily focus on the third problem. An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most r≥1 from x. When only vertices out of the code are asked to be identified, we get the related concept of a locating dominating set. The problem of finding an identifying code (resp a locating dominating code) of minimum size is a NP-hard problem, even when the input graph belongs to a number of specific graph classes. Therefore, we study this problem in some restricted classes of undirected graphs like split graph, line graph and path in a directed graph. Then we present some results on the identifying code by giving an exact value of upper total locating domination and a total 2-identifying code in directed and undirected graph. Moreover we determine exact values of locating dominating code and edge identifying code of thin headless spider and locating dominating code of complete suns.Keywords: identiying codes, locating dominating set, split graphs, thin headless spider
Procedia PDF Downloads 4731564 Enhancing Code Security with AI-Powered Vulnerability Detection
Authors: Zzibu Mark Brian
Abstract:
As software systems become increasingly complex, ensuring code security is a growing concern. Traditional vulnerability detection methods often rely on manual code reviews or static analysis tools, which can be time-consuming and prone to errors. This paper presents a distinct approach to enhancing code security by leveraging artificial intelligence (AI) and machine learning (ML) techniques. Our proposed system utilizes a combination of natural language processing (NLP) and deep learning algorithms to identify and classify vulnerabilities in real-world codebases. By analyzing vast amounts of open-source code data, our AI-powered tool learns to recognize patterns and anomalies indicative of security weaknesses. We evaluated our system on a dataset of over 10,000 open-source projects, achieving an accuracy rate of 92% in detecting known vulnerabilities. Furthermore, our tool identified previously unknown vulnerabilities in popular libraries and frameworks, demonstrating its potential for improving software security.Keywords: AI, machine language, cord security, machine leaning
Procedia PDF Downloads 161563 Tool for Fast Detection of Java Code Snippets
Authors: Tomáš Bublík, Miroslav Virius
Abstract:
This paper presents general results on the Java source code snippet detection problem. We propose the tool which uses graph and sub graph isomorphism detection. A number of solutions for all of these tasks have been proposed in the literature. However, although that all these solutions are really fast, they compare just the constant static trees. Our solution offers to enter an input sample dynamically with the Scripthon language while preserving an acceptable speed. We used several optimizations to achieve very low number of comparisons during the matching algorithm.Keywords: AST, Java, tree matching, scripthon source code recognition
Procedia PDF Downloads 4221562 Zero Cross-Correlation Codes Based on Balanced Incomplete Block Design: Performance Analysis and Applications
Authors: Garadi Ahmed, Boubakar S. Bouazza
Abstract:
The Zero Cross-Correlation (C, w) code is a family of binary sequences of length C and constant Hamming-weight, the cross correlation between any two sequences equal zero. In this paper, we evaluate the performance of ZCC code based on Balanced Incomplete Block Design (BIBD) for Spectral Amplitude Coding Optical Code Division Multiple Access (SAC-OCDMA) system using direct detection. The BER obtained is better than 10-9 for five simultaneous users.Keywords: spectral amplitude coding-optical code-division-multiple-access (SAC-OCDMA), phase induced intensity noise (PIIN), balanced incomplete block design (BIBD), zero cross-correlation (ZCC)
Procedia PDF Downloads 3611561 Statistical Analysis of Extreme Flow (Regions of Chlef)
Authors: Bouthiba Amina
Abstract:
The estimation of the statistics bound to the precipitation represents a vast domain, which puts numerous challenges to meteorologists and hydrologists. Sometimes, it is necessary, to approach in value the extreme events for sites where there is little, or no datum, as well as their periods of return. The search for a model of the frequency of the heights of daily rains dresses a big importance in operational hydrology: It establishes a basis for predicting the frequency and intensity of floods by estimating the amount of precipitation in past years. The most known and the most common approach is the statistical approach, It consists in looking for a law of probability that fits best the values observed by the random variable " daily maximal rain " after a comparison of various laws of probability and methods of estimation by means of tests of adequacy. Therefore, a frequent analysis of the annual series of daily maximal rains was realized on the data of 54 pluviometric stations of the pond of high and average. This choice was concerned with five laws usually applied to the study and the analysis of frequent maximal daily rains. The chosen period is from 1970 to 2013. It was of use to the forecast of quantiles. The used laws are the law generalized by extremes to three components, those of the extreme values to two components (Gumbel and log-normal) in two parameters, the law Pearson typifies III and Log-Pearson III in three parameters. In Algeria, Gumbel's law has been used for a long time to estimate the quantiles of maximum flows. However, and we will check and choose the most reliable law.Keywords: return period, extreme flow, statistics laws, Gumbel, estimation
Procedia PDF Downloads 721560 Evaluation of Model-Based Code Generation for Embedded Systems–Mature Approach for Development in Evolution
Authors: Nikolay P. Brayanov, Anna V. Stoynova
Abstract:
Model-based development approach is gaining more support and acceptance. Its higher abstraction level brings simplification of systems’ description that allows domain experts to do their best without particular knowledge in programming. The different levels of simulation support the rapid prototyping, verifying and validating the product even before it exists physically. Nowadays model-based approach is beneficial for modelling of complex embedded systems as well as a generation of code for many different hardware platforms. Moreover, it is possible to be applied in safety-relevant industries like automotive, which brings extra automation of the expensive device certification process and especially in the software qualification. Using it, some companies report about cost savings and quality improvements, but there are others claiming no major changes or even about cost increases. This publication demonstrates the level of maturity and autonomy of model-based approach for code generation. It is based on a real live automotive seat heater (ASH) module, developed using The Mathworks, Inc. tools. The model, created with Simulink, Stateflow and Matlab is used for automatic generation of C code with Embedded Coder. To prove the maturity of the process, Code generation advisor is used for automatic configuration. All additional configuration parameters are set to auto, when applicable, leaving the generation process to function autonomously. As a result of the investigation, the publication compares the quality of generated embedded code and a manually developed one. The measurements show that generally, the code generated by automatic approach is not worse than the manual one. A deeper analysis of the technical parameters enumerates the disadvantages, part of them identified as topics for our future work.Keywords: embedded code generation, embedded C code quality, embedded systems, model-based development
Procedia PDF Downloads 236