Results showed that the optimum conditions for production of inulunase from isolate Kluyveromyces marxianus AY2 by submerged culture could be achieved by using inulin as carbon source at a concentration of 2% with mixture of yeast extract and ammonium sulphate in a ratio of 1:1 in a concentration of 1% at initial pH 5.5 after incubation for 42 hours at 30ºC.

The seasonal behavior of the light curve for selected star SS UMI and EXDRA during outburst cycle is studied. This behavior describes maximum temperature of outburst in dwarf nova. The raw data has been mathematically modeled by fitting Gaussian function based on the full width of the half maximum and the maximum value of the Gaussian. The results of this modeling describe the value of temperature of the dwarf novae star system leading to identify the type of elements that each dwarf nova consisted of.

Traffic classification is referred to as the task of categorizing traffic flows into application-aware classes such as chats, streaming, VoIP, etc. Most systems of network traffic identification are based on features. These features may be static signatures, port numbers, statistical characteristics, and so on. Current methods of data flow classification are effective, they still lack new inventive approaches to meet the needs of vital points such as real-time traffic classification, low power consumption, ), Central Processing Unit (CPU) utilization, etc. Our novel Fast Deep Packet Header Inspection (FDPHI) traffic classification proposal employs 1 Dimension Convolution Neural Network (1D-CNN) to automatically learn more representational c

The 1500m race event is part of the athletics system, and the continuous competition to break records and achieve the highest levels of achievement in athletics events, especially the 1500m race event, is one of the topics that occupies the minds of many people interested in achieving digital development for this event, given the distance of the race and the time it takes to complete it. Because it is unique from other events, it has characteristics that distinguish it from other events, despite it being a middle-distance event, which shares with them that its speed is measured by the step, which consists of the length of the step and its frequency. Increasing any of these two factors while keeping one of them constant or increasing

A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.