Search results for: Encoding
162 Characterization of Crustin from Litopenaeus vannamei
Authors: Suchao Donpudsa, Anchalee Tassanakajon, Vichien Rimphanitchayakit
Abstract:
A crustin gene, LV-SWD1, previously found in the hemocyte cDNA library of Litopenaeus vannamei, contains the open reading frames of 288 bp encoding a putative protein of 96 amino acid residues. The putative signal peptides of the LV-SWD1 were identified using the online SignalP 3.0 with predicted cleavage sites between Ala24-Val25, resulting in 72 residue mature protein with calculated molecular mass of 7.4 kDa and predicted pI of 8.5. This crustin contains a Arg-Pro rich region at the amino-terminus and a single whey acidic protein (WAP) domain at the carboxyl-terminus. In order to characterize their properties and biological activities, the recombinant crustin protein was produced in the Escherichia coli expression system. Antimicrobial assays showed that the growth of Bacillus subtilis was inhibited by this recombinant crustin with MIC of about 25-50 µM.Keywords: crustin, single whey acidic protein, Litopenaeus vannamei, antimicrobial activity
Procedia PDF Downloads 244161 Preschool Story Retelling: Actions and Verb Use
Authors: Eva Nwokah, Casey Taliancich-Klinger, Lauren Luna, Sarah Rodriguez
Abstract:
Story-retelling is a technique frequently used to assess children’s language skills and support their development of narratives. Fourteen preschool children listened to one of two stories from the wordless, illustrated Frog book series and then retold the story using the pictures. A comparison of three verb types (action, mental and other) in the original story model, and children's verb use in their retold stories revealed the salience of action events. The children's stories contained a similar proportion of verb types to the original story. However, the action verbs they used were rarely those they had heard in the original. The implications for the process of lexical encoding and narrative recall are discussed, as well as suggestions for the use of wordless picture books and the language teaching of new verbs.Keywords: story re-telling, verb use, preschool language, wordless picture books
Procedia PDF Downloads 270160 Unsupervised Learning with Self-Organizing Maps for Named Entity Recognition in the CONLL2003 Dataset
Authors: Assel Jaxylykova, Alexnder Pak
Abstract:
This study utilized a Self-Organizing Map (SOM) for unsupervised learning on the CONLL-2003 dataset for Named Entity Recognition (NER). The process involved encoding words into 300-dimensional vectors using FastText. These vectors were input into a SOM grid, where training adjusted node weights to minimize distances. The SOM provided a topological representation for identifying and clustering named entities, demonstrating its efficacy without labeled examples. Results showed an F1-measure of 0.86, highlighting SOM's viability. Although some methods achieve higher F1 measures, SOM eliminates the need for labeled data, offering a scalable and efficient alternative. The SOM's ability to uncover hidden patterns provides insights that could enhance existing supervised methods. Further investigation into potential limitations and optimization strategies is suggested to maximize benefits.Keywords: named entity recognition, natural language processing, self-organizing map, CONLL-2003, semantics
Procedia PDF Downloads 45159 Time Efficient Color Coding for Structured-Light 3D Scanner
Authors: Po-Hao Huang, Pei-Ju Chiang
Abstract:
The structured light 3D scanner is commonly used for measuring the 3D shape of an object. Through projecting designed light patterns on the object, deformed patterns can be obtained and used for the geometric shape reconstruction. At present, Gray code is the most reliable and commonly used light pattern in the structured light 3D scanner. However, the trade-off between scanning efficiency and accuracy is a long-standing and challenging problem. The design of light patterns plays a significant role in the scanning efficiency and accuracy. Thereby, we proposed a novel encoding method integrating color information and Gray-code to improve the scanning efficiency. We will demonstrate that with the proposed method, the scanning time can be reduced to approximate half of the one needed by Gray-code without reduction of precision.Keywords: gray-code, structured light scanner, 3D shape acquisition, 3D reconstruction
Procedia PDF Downloads 457158 Impact of Population Size on Symmetric Travelling Salesman Problem Efficiency
Authors: Wafa' Alsharafat, Suhila Farhan Abu-Owida
Abstract:
Genetic algorithm (GA) is a powerful evolutionary searching technique that is used successfully to solve and optimize problems in different research areas. Genetic Algorithm (GA) considered as one of optimization methods used to solve Travel salesman Problem (TSP). The feasibility of GA in finding a TSP solution is dependent on GA operators; encoding method, population size, termination criteria, in general. In specific, crossover and its probability play a significant role in finding possible solutions for Symmetric TSP (STSP). In addition, the crossover should be determined and enhanced in term reaching optimal or at least near optimal. In this paper, we spot the light on using a modified crossover method called modified sequential constructive crossover and its impact on reaching optimal solution. To justify the relevance of a parameter value in solving the TSP, a set comparative analysis conducted on different crossover methods values.Keywords: genetic algorithm, crossover, mutation, TSP
Procedia PDF Downloads 227157 Closed-Form Sharma-Mittal Entropy Rate for Gaussian Processes
Authors: Septimia Sarbu
Abstract:
The entropy rate of a stochastic process is a fundamental concept in information theory. It provides a limit to the amount of information that can be transmitted reliably over a communication channel, as stated by Shannon's coding theorems. Recently, researchers have focused on developing new measures of information that generalize Shannon's classical theory. The aim is to design more efficient information encoding and transmission schemes. This paper continues the study of generalized entropy rates, by deriving a closed-form solution to the Sharma-Mittal entropy rate for Gaussian processes. Using the squeeze theorem, we solve the limit in the definition of the entropy rate, for different values of alpha and beta, which are the parameters of the Sharma-Mittal entropy. In the end, we compare it with Shannon and Rényi's entropy rates for Gaussian processes.Keywords: generalized entropies, Sharma-Mittal entropy rate, Gaussian processes, eigenvalues of the covariance matrix, squeeze theorem
Procedia PDF Downloads 519156 A New Method to Reduce 5G Application Layer Payload Size
Authors: Gui Yang Wu, Bo Wang, Xin Wang
Abstract:
Nowadays, 5G service-based interface architecture uses text-based payload like JSON to transfer business data between network functions, which has obvious advantages as internet services but causes unnecessarily larger traffic. In this paper, a new 5G application payload size reduction method is presented to provides the mechanism to negotiate about new capability between network functions when network communication starts up and how 5G application data are reduced according to negotiated information with peer network function. Without losing the advantages of 5G text-based payload, this method demonstrates an excellent result on application payload size reduction and does not increase the usage quota of computing resource. Implementation of this method does not impact any standards or specifications and not change any encoding or decoding functionality too. In a real 5G network, this method will contribute to network efficiency and eventually save considerable computing resources.Keywords: 5G, JSON, payload size, service-based interface
Procedia PDF Downloads 180155 Cloning and Expression of the ansZ Gene from Bacillus sp. CH11 Isolated from Chilca salterns in Peru
Authors: Stephy Saavedra, Annsy C. Arredondo, Gisele Monteiro, Adalberto Pessoa Jr, Carol N. Flores-Fernandez, Amparo I. Zavaleta
Abstract:
L-asparaginase from bacterial sources is used in leukemic treatment and food industry. This enzyme is classified based on its affinity towards L-asparagine and L-glutamine. Likewise, ansZ genes express L-asparaginase with higher affinity to L-asparagine. The aim of this work was to clone and express of ansZ gene from Bacillus sp. CH11 isolated from Chilca salterns in Peru. The gene encoding L-asparaginase was cloned into pET15b vector and transformed in Escherichia coli BL21 (DE3) pLysS. The expression was carried out in a batch culture using LB broth and 0.5 mM IPTG. The recombinant L-asparaginase showed a molecular weight of ~ 39 kDa by SDS PAGE and a specific activity of 3.19 IU/mg of protein. The cloning and expression of ansZ gene from this halotolerant Bacillus sp. CH11 allowed having a biological input to improve a future scaling-up.Keywords: ansZ gene, Bacillus sp, Chilca salterns, recombinant L-asparaginase
Procedia PDF Downloads 179154 Fingerprint Image Encryption Using a 2D Chaotic Map and Elliptic Curve Cryptography
Authors: D. M. S. Bandara, Yunqi Lei, Ye Luo
Abstract:
Fingerprints are suitable as long-term markers of human identity since they provide detailed and unique individual features which are difficult to alter and durable over life time. In this paper, we propose an algorithm to encrypt and decrypt fingerprint images by using a specially designed Elliptic Curve Cryptography (ECC) procedure based on block ciphers. In addition, to increase the confusing effect of fingerprint encryption, we also utilize a chaotic-behaved method called Arnold Cat Map (ACM) for a 2D scrambling of pixel locations in our method. Experimental results are carried out with various types of efficiency and security analyses. As a result, we demonstrate that the proposed fingerprint encryption/decryption algorithm is advantageous in several different aspects including efficiency, security and flexibility. In particular, using this algorithm, we achieve a margin of about 0.1% in the test of Number of Pixel Changing Rate (NPCR) values comparing to the-state-of-the-art performances.Keywords: arnold cat map, biometric encryption, block cipher, elliptic curve cryptography, fingerprint encryption, Koblitz’s encoding
Procedia PDF Downloads 204153 A Network-Theorical Perspective on Music Analysis
Authors: Alberto Alcalá-Alvarez, Pablo Padilla-Longoria
Abstract:
The present paper describes a framework for constructing mathematical networks encoding relevant musical information from a music score for structural analysis. These graphs englobe statistical information about music elements such as notes, chords, rhythms, intervals, etc., and the relations among them, and so become helpful in visualizing and understanding important stylistic features of a music fragment. In order to build such networks, musical data is parsed out of a digital symbolic music file. This data undergoes different analytical procedures from Graph Theory, such as measuring the centrality of nodes, community detection, and entropy calculation. The resulting networks reflect important structural characteristics of the fragment in question: predominant elements, connectivity between them, and complexity of the information contained in it. Music pieces in different styles are analyzed, and the results are contrasted with the traditional analysis outcome in order to show the consistency and potential utility of this method for music analysis.Keywords: computational musicology, mathematical music modelling, music analysis, style classification
Procedia PDF Downloads 102152 Reducing Power Consumption in Network on Chip Using Scramble Techniques
Authors: Vinayaga Jagadessh Raja, R. Ganesan, S. Ramesh Kumar
Abstract:
An ever more significant fraction of the overall power dissipation of a network-on-chip (NoC) based system on- chip (SoC) is due to the interconnection scheme. In information, as equipment shrinks, the power contributes of NoC links starts to compete with that of NoC routers. In this paper, we propose the use of clock gating in the data encoding techniques as a viable way to reduce both power dissipation and time consumption of NoC links. The projected scramble scheme exploits the wormhole switching techniques. That is, flits are scramble by the network interface (NI) before they are injected in the network and are decoded by the target NI. This makes the scheme transparent to the underlying network since the encoder and decoder logic is integrated in the NI and no modification of the routers structural design is required. We review the projected scramble scheme on a set of representative data streams (both synthetic and extracted from real applications) showing that it is possible to reduce the power contribution of both the self-switching activity and the coupling switching activity in inter-routers links.Keywords: Xilinx 12.1, power consumption, Encoder, NOC
Procedia PDF Downloads 400151 Performance Analysis of Multichannel OCDMA-FSO Network under Different Pervasive Conditions
Authors: Saru Arora, Anurag Sharma, Harsukhpreet Singh
Abstract:
To meet the growing need of high data rate and bandwidth, various efforts has been made nowadays for the efficient communication systems. Optical Code Division Multiple Access over Free space optics communication system seems an effective role for providing transmission at high data rate with low bit error rate and low amount of multiple access interference. This paper demonstrates the OCDMA over FSO communication system up to the range of 7000 m at a data rate of 5 Gbps. Initially, the 8 user OCDMA-FSO system is simulated and pseudo orthogonal codes are used for encoding. Also, the simulative analysis of various performance parameters like power and core effective area that are having an effect on the Bit error rate (BER) of the system is carried out. The simulative analysis reveals that the length of the transmission is limited by the multi-access interference (MAI) effect which arises when the number of users increases in the system.Keywords: FSO, PSO, bit error rate (BER), opti system simulation, multiple access interference (MAI), q-factor
Procedia PDF Downloads 365150 The Journey of a Malicious HTTP Request
Authors: M. Mansouri, P. Jaklitsch, E. Teiniker
Abstract:
SQL injection on web applications is a very popular kind of attack. There are mechanisms such as intrusion detection systems in order to detect this attack. These strategies often rely on techniques implemented at high layers of the application but do not consider the low level of system calls. The problem of only considering the high level perspective is that an attacker can circumvent the detection tools using certain techniques such as URL encoding. One technique currently used for detecting low-level attacks on privileged processes is the tracing of system calls. System calls act as a single gate to the Operating System (OS) kernel; they allow catching the critical data at an appropriate level of detail. Our basic assumption is that any type of application, be it a system service, utility program or Web application, “speaks” the language of system calls when having a conversation with the OS kernel. At this level we can see the actual attack while it is happening. We conduct an experiment in order to demonstrate the suitability of system call analysis for detecting SQL injection. We are able to detect the attack. Therefore we conclude that system calls are not only powerful in detecting low-level attacks but that they also enable us to detect high-level attacks such as SQL injection.Keywords: Linux system calls, web attack detection, interception, SQL
Procedia PDF Downloads 358149 An Efficient Process Analysis and Control Method for Tire Mixing Operation
Authors: Hwang Ho Kim, Do Gyun Kim, Jin Young Choi, Sang Chul Park
Abstract:
Since tire production process is very complicated, company-wide management of it is very difficult, necessitating considerable amounts of capital and labors. Thus, productivity should be enhanced and maintained competitive by developing and applying effective production plans. Among major processes for tire manufacturing, consisting of mixing component preparation, building and curing, the mixing process is an essential and important step because the main component of tire, called compound, is formed at this step. Compound as a rubber synthesis with various characteristics plays its own role required for a tire as a finished product. Meanwhile, scheduling tire mixing process is similar to flexible job shop scheduling problem (FJSSP) because various kinds of compounds have their unique orders of operations, and a set of alternative machines can be used to process each operation. In addition, setup time required for different operations may differ due to alteration of additives. In other words, each operation of mixing processes requires different setup time depending on the previous one, and this kind of feature, called sequence dependent setup time (SDST), is a very important issue in traditional scheduling problems such as flexible job shop scheduling problems. However, despite of its importance, there exist few research works dealing with the tire mixing process. Thus, in this paper, we consider the scheduling problem for tire mixing process and suggest an efficient particle swarm optimization (PSO) algorithm to minimize the makespan for completing all the required jobs belonging to the process. Specifically, we design a particle encoding scheme for the considered scheduling problem, including a processing sequence for compounds and machine allocation information for each job operation, and a method for generating a tire mixing schedule from a given particle. At each iteration, the coordination and velocity of particles are updated, and the current solution is compared with new solution. This procedure is repeated until a stopping condition is satisfied. The performance of the proposed algorithm is validated through a numerical experiment by using some small-sized problem instances expressing the tire mixing process. Furthermore, we compare the solution of the proposed algorithm with it obtained by solving a mixed integer linear programming (MILP) model developed in previous research work. As for performance measure, we define an error rate which can evaluate the difference between two solutions. As a result, we show that PSO algorithm proposed in this paper outperforms MILP model with respect to the effectiveness and efficiency. As the direction for future work, we plan to consider scheduling problems in other processes such as building, curing. We can also extend our current work by considering other performance measures such as weighted makespan or processing times affected by aging or learning effects.Keywords: compound, error rate, flexible job shop scheduling problem, makespan, particle encoding scheme, particle swarm optimization, sequence dependent setup time, tire mixing process
Procedia PDF Downloads 265148 Identification of Odorant Receptors through the Antennal Transcriptome of the Grapevine Pest, Lobesia botrana (Lepidoptera: Tortricidae)
Authors: Ricardo Godoy, Herbert Venthur, Hector Jimenez, Andres Quiroz, Ana Mutis
Abstract:
In agriculture, grape production has great economic importance at global level, considering that in 2013 it reached 7.4 million hectares (ha) covered by plantations of this fruit worldwide. Chile is the number one exporter in the world with 800,000 tons. However, these values have been threatened by the attack of the grapevine moth, Lobesia botrana (Denis & Schiffermuller) (Lepidoptera: Tortricidae), since its detection in 2008. Nowadays, the use of semiochemicals, in particular the major component of the sex pheromone, (E,Z)-7.9-dodecadienil acetate, are part of mating disruption methods to control L. botrana. How insect pests can recognize these molecules, is being part of huge efforts to deorphanize their olfactory mechanism at molecular level. Thus, an interesting group of proteins has been identified in the antennae of insects, where odorant-binding proteins (OBPs) are known by transporting molecules to odorant receptors (ORs) and a co-receptor (ORCO) causing a behavioral change in the insect. Other proteins such as chemosensory proteins (CSPs), ionotropic receptors (IRs), odorant degrading enzymes (ODEs) and sensory neuron membrane proteins (SNMPs) seem to be involved, but few studies have been performed so far. The above has led to an increasing interest in insect communication at a molecular level, which has contributed to both a better understanding of the olfaction process and the design of new pest management strategies. To date, it has been reported that the ORs can detect one or a small group of odorants in a specific way. Therefore, the objective of this study is the identification of genes that encode these ORs using the antennal transcriptome of L. botrana. Total RNA was extracted for females and males of L. botrana, and the antennal transcriptome sequenced by Next Generation Sequencing service using an Illumina HiSeq2500 platform with 50 million reads per sample. Unigenes were assembled using Trinity v2.4.0 package and transcript abundance was obtained using edgeR. Genes were identified using BLASTN and BLASTX locally installed in a Unix system and based on our own Tortricidae database. Those Unigenes related to ORs were characterized using ORFfinder and protein Blastp server. Finally, a phylogenetic analysis was performed with the candidate amino acid sequences for LbotORs including amino acid sequences of other moths ORs, such as Bombyx mori, Cydia pomonella, among others. Our findings suggest 61 genes encoding ORs and one gene encoding an ORCO in both sexes, where the greatest difference was found in the OR6 because of the transcript abundance according to the value of FPKM in females and males was 1.48 versus 324.00. In addition, according to phylogenetic analysis OR6 is closely related to OR1 in Cydia pomonella and OR6, OR7 in Epiphyas postvittana, which have been described as pheromonal receptors (PRs). These results represent the first evidence of ORs present in the antennae of L. botrana and a suitable starting point for further functional studies with selected ORs, such as OR6, which is potentially related to pheromonal recognition.Keywords: antennal transcriptome, lobesia botrana, odorant receptors (ORs), phylogenetic analysis
Procedia PDF Downloads 200147 The Expression of a Novel Gene Encoding an Ankyrin-Repeat Protein, DRA1, Is Regulated by Drought-Responsive Alternative Splicing
Authors: H. Sakamoto, Y. Nakagawara, S. Oguri
Abstract:
Drought stress is a critical environmental factor that adversely affects crop productivity and quality. Because of their immobile nature, plants have evolved mechanisms to sense and respond to drought stress. We identified a novel locus of Arabidopsis, designated DRA1 (drought responsive ankyrin 1), whose disruption leads to increased drought stress tolerance. DRA1 encodes a transmembrane protein with an ankyrin repeat motif that has been implicated in diverse cellular processes such as signal transduction. RT-PCR analysis revealed that there were at least two splicing variants of DRA1 transcripts in wild type plants. In response to drought stress, the levels of DRA1 transcripts retaining second and third introns were increased, whereas these introns were removed under unstressed conditions. These results suggest that DRA1 protein may negatively regulate plant drought tolerance and that the expression of DRA1 is regulated in response to drought stress by alternative splicing.Keywords: alternative splicing, ankyrin repeat, Arabidopsis, drought tolerance
Procedia PDF Downloads 324146 Hotel Guests’ Service Fulfillment: Bangkok, Thailand
Authors: Numtana Ladplee, Cherif Haberih
Abstract:
The value of service evaluation depends critically on guests’ understanding of the evaluation objectives and their roles. The present research presents a three-phase investigation of the impact of evaluating participants’ theories about their roles: (a) identifying the theories, (b) testing the process consequences of participants’ role theories, and (c) gaining insights into the impact of participants’ role theories by testing key moderator/s. The findings of this study will hopefully indicate that (a) when forewarned of an upcoming evaluation task, consumers tend to believe that the evaluation objective is to identify aspects that need improvement, (b) this expectation produces a conscious attempt to identify negative aspects, although the encoding of attribute information is not affected, and (c) cognitive load during the evaluation experience greatly decreases the negativity of expected evaluations. The present study can be applied to other market research techniques and thereby improve our understanding of consumer inputs derived from market research. Such insights can help diminish biases produced by participants’ correct or incorrect theories regarding their roles.Keywords: fulfillment, hotel guests, service, Thailand
Procedia PDF Downloads 276145 Surface Geodesic Derivative Pattern for Deformable Textured 3D Object Comparison: Application to Expression and Pose Invariant 3D Face Recognition
Authors: Farshid Hajati, Soheila Gheisari, Ali Cheraghian, Yongsheng Gao
Abstract:
This paper presents a new Surface Geodesic Derivative Pattern (SGDP) for matching textured deformable 3D surfaces. SGDP encodes micro-pattern features based on local surface higher-order derivative variation. It extracts local information by encoding various distinctive textural relationships contained in a geodesic neighborhood, hence fusing texture and range information of a surface at the data level. Geodesic texture rings are encoded into local patterns for similarity measurement between non-rigid 3D surfaces. The performance of the proposed method is evaluated extensively on the Bosphorus and FRGC v2 face databases. Compared to existing benchmarks, experimental results show the effectiveness and superiority of combining the texture and 3D shape data at the earliest level in recognizing typical deformable faces under expression, illumination, and pose variations.Keywords: 3D face recognition, pose, expression, surface matching, texture
Procedia PDF Downloads 393144 Use of Zikani’s Ribosome Modulating Agents for Treating Recessive Dystrophic & Junctional Epidermolysis Bullosa with Nonsense Mutations
Authors: Mei Chen, Yingping Hou, Michelle Hao, Soheil Aghamohammadzadeh, Esteban Terzo, Roger Clark, Vijay Modur
Abstract:
Background: Recessive Dystrophic Epidermolysis Bullosa (RDEB) is a genetic skin condition characterized by skin tearing and unremitting blistering upon minimal trauma. Repeated blistering, fibrosis, and scarring lead to aggressive squamous cell carcinoma later in life. RDEB is caused by mutations in the COL7A1 gene encoding collagen type VII (C7), the major component of anchoring fibrils mediating epidermis-dermis adherence. Nonsense mutations in the COL7A1 gene of a subset of RDEB patients leads to premature termination codons (PTC). Similarly, most Junctional Epidermolysis Bullosa (JEB) cases are caused by nonsense mutations in the LAMB3 gene encoding the β3 subunit of laminin 332. Currently, there is an unmet need for the treatment of RDEB and JEB. Zikani Therapeutics has discovered an array of macrocyclic compounds with ring structures similar to macrolide antibiotics that can facilitate readthrough activity of nonsense mutations in the COL7A1 and LAMB3 genes by acting as Ribosome Modulating Agents (RMAs). The medicinal chemistry synthetic advancements of these macrocyclic compounds have allowed targeting the human ribosome while preserving the structural elements responsible for the safety and pharmacokinetic profile of clinically used macrolide antibiotics. Methods: C7 expression was used as a measure of readthrough activity by immunoblot assays in two primary human fibroblasts from RDEB patients (R578X/R578X and R163X/R1683X-COL7A1). Similarly, immunoblot assays in C325X/c.629-12T > A-LAMB3 keratinocytes were used to measure readthrough activity for JEB. The relative readthrough activity of each compound was measured relative to Gentamicin. An imaging-based fibroblast migration assay was used as an assessment of C7 functionality in RDEB-fibroblasts over 16-20 hrs. The incubation period for the above experiments was 48 hrs for RDEB fibroblasts and 72 hours for JEB keratinocytes. Results: 9 RMAs demonstrated increased protein expression in both patient RDEB fibroblasts. The highest readthrough activity at tested concentrations without cytotoxicities increased protein expression up to 179% of Gentamicin (400 µg/ml), with favored readthrough activity in R163X/R1683X-COL7A1 fibroblasts. Concurrent with protein expression, fibroblast hypermotility phenotype observed in RDEB was rescued by reducing motility by ~35% to WT levels (the same level as 690 µM Gentamicin treated cells). Laminin β3 expression was also shown to be increased by 6 RMAs in keratinocytes to 33-83% of (400 µg/ml) Gentamicin. Conclusions: To date, 9 RMAs have been identified that enhance the expression of functional C7 in a mutation-dependent manner in two different RDEB patient fibroblast backgrounds (R578X/R578X and R163X/R1683X-COL7A1). A further 6 RMAs have been identified that enhance the readthrough of C325X-LAMB3 in JEB patient keratinocytes. Based on the clinical trial conducted by us with topical gentamycin in 2017, Zikani’s RMAs achieve clinically significant levels of read-through for the treatment of recessive dystrophic and Junctional Epidermolysis Bullosa.Keywords: epidermolysis bullosa, nonsense mutation, readthrough, ribosome modulation
Procedia PDF Downloads 98143 A High Compression Ratio for a Losseless Image Compression Based on the Arithmetic Coding with the Sorted Run Length Coding: Meteosat Second Generation Image Compression
Authors: Cherifi Mehdi, Lahdir Mourad, Ameur Soltane
Abstract:
Image compression is the heart of several multimedia techniques. It is used to reduce the number of bits required to represent an image. Meteosat Second Generation (MSG) satellite allows the acquisition of 12 image files every 15 minutes and that results in a large databases sizes. In this paper, a novel image compression method based on the arithmetic coding with the sorted Run Length Coding (SRLC) for MSG images is proposed. The SRLC allows us to find the occurrence of the consecutive pixels of the original image to create a sorted run. The arithmetic coding allows the encoding of the sorted data of the previous stage to retrieve a unique code word that represents a binary code stream in the sorted order to boost the compression ratio. Through this article, we show that our method can perform the best results concerning compression ratio and bit rate unlike the method based on the Run Length Coding (RLC) and the arithmetic coding. Evaluation criteria like the compression ratio and the bit rate allow the confirmation of the efficiency of our method of image compression.Keywords: image compression, arithmetic coding, Run Length Coding, RLC, Sorted Run Length Coding, SRLC, Meteosat Second Generation, MSG
Procedia PDF Downloads 354142 Multi-Level Attentional Network for Aspect-Based Sentiment Analysis
Authors: Xinyuan Liu, Xiaojun Jing, Yuan He, Junsheng Mu
Abstract:
Aspect-based Sentiment Analysis (ABSA) has attracted much attention due to its capacity to determine the sentiment polarity of the certain aspect in a sentence. In previous works, great significance of the interaction between aspect and sentence has been exhibited in ABSA. In consequence, a Multi-Level Attentional Networks (MLAN) is proposed. MLAN consists of four parts: Embedding Layer, Encoding Layer, Multi-Level Attentional (MLA) Layers and Final Prediction Layer. Among these parts, MLA Layers including Aspect Level Attentional (ALA) Layer and Interactive Attentional (ILA) Layer is the innovation of MLAN, whose function is to focus on the important information and obtain multiple levels’ attentional weighted representation of aspect and sentence. In the experiments, MLAN is compared with classical TD-LSTM, MemNet, RAM, ATAE-LSTM, IAN, AOA, LCR-Rot and AEN-GloVe on SemEval 2014 Dataset. The experimental results show that MLAN outperforms those state-of-the-art models greatly. And in case study, the works of ALA Layer and ILA Layer have been proven to be effective and interpretable.Keywords: deep learning, aspect-based sentiment analysis, attention, natural language processing
Procedia PDF Downloads 138141 A Method for Compression of Short Unicode Strings
Authors: Masoud Abedi, Abbas Malekpour, Peter Luksch, Mohammad Reza Mojtabaei
Abstract:
The use of short texts in communication has been greatly increasing in recent years. Applying different languages in short texts has led to compulsory use of Unicode strings. These strings need twice the space of common strings, hence, applying algorithms of compression for the purpose of accelerating transmission and reducing cost is worthwhile. Nevertheless, other compression methods like gzip, bzip2 or PAQ due to high overhead data size are not appropriate. The Huffman algorithm is one of the rare algorithms effective in reducing the size of short Unicode strings. In this paper, an algorithm is proposed for compression of very short Unicode strings. At first, every new character to be sent to a destination is inserted in the proposed mapping table. At the beginning, every character is new. In case the character is repeated for the same destination, it is not considered as a new character. Next, the new characters together with the mapping value of repeated characters are arranged through a specific technique and specially formatted to be transmitted. The results obtained from an assessment made on a set of short Persian and Arabic strings indicate that this proposed algorithm outperforms the Huffman algorithm in size reduction.Keywords: Algorithms, Data Compression, Decoding, Encoding, Huffman Codes, Text Communication
Procedia PDF Downloads 348140 Identification and Characterization of Nuclear Envelope Protein Interactions
Authors: Mohammed Hakim Jafferali, Balaje Vijayaraghavan, Ricardo A. Figueroa, Ellinor Crafoord, Veronica J. Larsson, Einar Hallberg, Santhosh Gudise
Abstract:
The nuclear envelope which surrounds the chromatin of eukaryotic cells contains more than a hundred transmembrane proteins. Mutations in some genes encoding nuclear envelope proteins give rise to human diseases including neurological disorders. The function of many nuclear envelope proteins is not well established. This is partly because nuclear envelope proteins and their interactions are difficult to study due to the inherent resistance to extraction of nuclear envelope proteins. We have developed a novel method called MCLIP, to identify interacting partners of nuclear envelope proteins in live cells. Using MCLIP, we found three new binding partners of the inner nuclear membrane protein Samp1: the intermediate filament protein Lamin B1, the LINC complex protein Sun1 and the G-protein Ran. Furthermore, using in vitro studies, we show that Samp1 binds both Emerin and Ran directly. We have also studied the interaction between Samp1 and Ran in detail. The results show that the Samp1 binds stronger to RanGTP than RanGDP. Samp1 is the first transmembrane protein known to bind Ran and it is tempting to speculate that Samp1 may provide local binding sites for RanGTP at membranes.Keywords: MCLIP, nuclear envelope, ran, Samp1
Procedia PDF Downloads 352139 Data Hiding by Vector Quantization in Color Image
Authors: Yung Gi Wu
Abstract:
With the growing of computer and network, digital data can be spread to anywhere in the world quickly. In addition, digital data can also be copied or tampered easily so that the security issue becomes an important topic in the protection of digital data. Digital watermark is a method to protect the ownership of digital data. Embedding the watermark will influence the quality certainly. In this paper, Vector Quantization (VQ) is used to embed the watermark into the image to fulfill the goal of data hiding. This kind of watermarking is invisible which means that the users will not conscious the existing of embedded watermark even though the embedded image has tiny difference compared to the original image. Meanwhile, VQ needs a lot of computation burden so that we adopt a fast VQ encoding scheme by partial distortion searching (PDS) and mean approximation scheme to speed up the data hiding process. The watermarks we hide to the image could be gray, bi-level and color images. Texts are also can be regarded as watermark to embed. In order to test the robustness of the system, we adopt Photoshop to fulfill sharpen, cropping and altering to check if the extracted watermark is still recognizable. Experimental results demonstrate that the proposed system can resist the above three kinds of tampering in general cases.Keywords: data hiding, vector quantization, watermark, color image
Procedia PDF Downloads 364138 Adversarial Disentanglement Using Latent Classifier for Pose-Independent Representation
Authors: Hamed Alqahtani, Manolya Kavakli-Thorne
Abstract:
The large pose discrepancy is one of the critical challenges in face recognition during video surveillance. Due to the entanglement of pose attributes with identity information, the conventional approaches for pose-independent representation lack in providing quality results in recognizing largely posed faces. In this paper, we propose a practical approach to disentangle the pose attribute from the identity information followed by synthesis of a face using a classifier network in latent space. The proposed approach employs a modified generative adversarial network framework consisting of an encoder-decoder structure embedded with a classifier in manifold space for carrying out factorization on the latent encoding. It can be further generalized to other face and non-face attributes for real-life video frames containing faces with significant attribute variations. Experimental results and comparison with state of the art in the field prove that the learned representation of the proposed approach synthesizes more compelling perceptual images through a combination of adversarial and classification losses.Keywords: disentanglement, face detection, generative adversarial networks, video surveillance
Procedia PDF Downloads 129137 Words of Peace in the Speeches of the Egyptian President, Abdulfattah El-Sisi: A Corpus-Based Study
Authors: Mohamed S. Negm, Waleed S. Mandour
Abstract:
The present study aims primarily at investigating words of peace (lexemes of peace) in the formal speeches of the Egyptian president Abdulfattah El-Sisi in a two-year span of time, from 2018 to 2019. This paper attempts to shed light not only on the contextual use of the antonyms, war and peace, but also it underpins quantitative analysis through the current methods of corpus linguistics. As such, the researchers have deployed a corpus-based approach in collecting, encoding, and processing 30 presidential speeches over the stated period (23,411 words and 25,541 tokens in total). Further, semantic fields and collocational networkzs are identified and compared statistically. Results have shown a significant propensity of adopting peace, including its relevant collocation network, textually and therefore, ideationally, at the expense of war concept which in most cases surfaces euphemistically through the noun conflict. The president has not justified the action of war with an honorable cause or a valid reason. Such results, so far, have indicated a positive sociopolitical mindset the Egyptian president possesses and moreover, reveal national and international fair dealing on arising issues.Keywords: CADS, collocation network, corpus linguistics, critical discourse analysis
Procedia PDF Downloads 155136 Latency-Based Motion Detection in Spiking Neural Networks
Authors: Mohammad Saleh Vahdatpour, Yanqing Zhang
Abstract:
Understanding the neural mechanisms underlying motion detection in the human visual system has long been a fascinating challenge in neuroscience and artificial intelligence. This paper presents a spiking neural network model inspired by the processing of motion information in the primate visual system, particularly focusing on the Middle Temporal (MT) area. In our study, we propose a multi-layer spiking neural network model to perform motion detection tasks, leveraging the idea that synaptic delays in neuronal communication are pivotal in motion perception. Synaptic delay, determined by factors like axon length and myelin insulation, affects the temporal order of input spikes, thereby encoding motion direction and speed. Overall, our spiking neural network model demonstrates the feasibility of capturing motion detection principles observed in the primate visual system. The combination of synaptic delays, learning mechanisms, and shared weights and delays in SMD provides a promising framework for motion perception in artificial systems, with potential applications in computer vision and robotics.Keywords: neural network, motion detection, signature detection, convolutional neural network
Procedia PDF Downloads 87135 Probing Syntax Information in Word Representations with Deep Metric Learning
Authors: Bowen Ding, Yihao Kuang
Abstract:
In recent years, with the development of large-scale pre-trained lan-guage models, building vector representations of text through deep neural network models has become a standard practice for natural language processing tasks. From the performance on downstream tasks, we can know that the text representation constructed by these models contains linguistic information, but its encoding mode and extent are unclear. In this work, a structural probe is proposed to detect whether the vector representation produced by a deep neural network is embedded with a syntax tree. The probe is trained with the deep metric learning method, so that the distance between word vectors in the metric space it defines encodes the distance of words on the syntax tree, and the norm of word vectors encodes the depth of words on the syntax tree. The experiment results on ELMo and BERT show that the syntax tree is encoded in their parameters and the word representations they produce.Keywords: deep metric learning, syntax tree probing, natural language processing, word representations
Procedia PDF Downloads 68134 The Co-Simulation Interface SystemC/Matlab Applied in JPEG and SDR Application
Authors: Walid Hassairi, Moncef Bousselmi, Mohamed Abid
Abstract:
Functional verification is a major part of today’s system design task. Several approaches are available for verification on a high abstraction level, where designs are often modeled using MATLAB/Simulink. However, different approaches are a barrier to a unified verification flow. In this paper, we propose a co-simulation interface between SystemC and MATLAB and Simulink to enable functional verification of multi-abstraction levels designs. The resulting verification flow is tested on JPEG compression algorithm. The required synchronization of both simulation environments, as well as data type conversion is solved using the proposed co-simulation flow. We divided into two encoder jpeg parts. First implemented in SystemC which is the DCT is representing the HW part. Second, consisted of quantization and entropy encoding which is implemented in Matlab is the SW part. For communication and synchronization between these two parts we use S-Function and engine in Simulink matlab. With this research premise, this study introduces a new implementation of a Hardware SystemC of DCT. We compare the result of our simulation compared to SW / SW. We observe a reduction in simulation time you have 88.15% in JPEG and the design efficiency of the supply design is 90% in SDR.Keywords: hardware/software, co-design, co-simulation, systemc, matlab, s-function, communication, synchronization
Procedia PDF Downloads 405133 Taguchi Method for Analyzing a Flexible Integrated Logistics Network
Authors: E. Behmanesh, J. Pannek
Abstract:
Logistics network design is known as one of the strategic decision problems. As these kinds of problems belong to the category of NP-hard problems, traditional ways are failed to find an optimal solution in short time. In this study, we attempt to involve reverse flow through an integrated design of forward/reverse supply chain network that formulated into a mixed integer linear programming. This Integrated, multi-stages model is enriched by three different delivery path which makes the problem more complex. To tackle with such an NP-hard problem a revised random path direct encoding method based memetic algorithm is considered as the solution methodology. Each algorithm has some parameters that need to be investigate to reveal the best performance. In this regard, Taguchi method is adapted to identify the optimum operating condition of the proposed memetic algorithm to improve the results. In this study, four factors namely, population size, crossover rate, local search iteration and a number of iteration are considered. Analyzing the parameters and improvement in results are the outlook of this research.Keywords: integrated logistics network, flexible path, memetic algorithm, Taguchi method
Procedia PDF Downloads 187