Search results for: Space Time Codes.
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 7762

Search results for: Space Time Codes.

6202 Experimental Investigation of the Transient Cooling Characteristics of an Industrial Glass Tempering Unit

Authors: Hilmi Yazici, Mehmet Akcay, Mustafa Golcu, Mehmet F. Koseoglu, Yakup Sekmen

Abstract:

Energy consumption rate during the cooling process of industrial glass tempering process is considerably high. In this experimental study the effect of dimensionless jet to jet distance (S/D) and jet to plate distance (H/D) on the cooling time have been investigated. In the experiments 4 mm thick glass samples have been used. Cooling unit consists of 16 mutually placed seamless aluminum nozzles of 8 mm in diameter and 80 mm in length. Nozzles were in staggered arrangement. Experiments were conducted with circular jets for H/D values between 1 and 10, and for S/D values between 2 and 10. During the experiments Reynolds number has been kept constant at 30000. Experimental results showed that the longest cooling time with 87 seconds has been observed in the experiments for S/D=10 and H/D=10 values, while the shortest cooling time with 42.5 seconds has been measured in the experiments for S/D=2 and H/D=4 values.

Keywords: Glass tempering, cooling, Reynolds number, nozzle

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1815
6201 Structure of Covering-based Rough Sets

Authors: Shiping Wang, Peiyong Zhu, William Zhu

Abstract:

Rough set theory is a very effective tool to deal with granularity and vagueness in information systems. Covering-based rough set theory is an extension of classical rough set theory. In this paper, firstly we present the characteristics of the reducible element and the minimal description covering-based rough sets through downsets. Then we establish lattices and topological spaces in coveringbased rough sets through down-sets and up-sets. In this way, one can investigate covering-based rough sets from algebraic and topological points of view.

Keywords: Covering, poset, down-set, lattice, topological space, topological base.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1850
6200 Best Proximity Point Theorems for MT-K and MT-C Rational Cyclic Contractions in Metric Spaces

Authors: M. R. Yadav, A. K. Sharma, B. S. Thakur

Abstract:

The purpose of this paper is to present a best proximity point theorems through rational expression for a combination of contraction condition, Kannan and Chatterjea nonlinear cyclic contraction in what we call MT-K and MT-C rational cyclic contraction. Some best proximity point theorems for a mapping satisfy these conditions have been established in metric spaces. We also give some examples to support our work.

Keywords: Cyclic contraction, rational cyclic contraction, best proximity point and complete metric space.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1672
6199 Nonoscillation Criteria for Nonlinear Delay Dynamic Systems on Time Scales

Authors: Xinli Zhang

Abstract:

In this paper, we consider the nonlinear delay dynamic system xΔ(t) = p(t)f1(y(t)), yΔ(t) = −q(t)f2(x(t − τ )). We obtain some necessary and sufficient conditions for the existence of nonoscillatory solutions with special asymptotic properties of the system. We generalize the known results in the literature. One example is given to illustrate the results.

Keywords: Dynamic system, oscillation, time scales, two-dimensional.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1293
6198 An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem

Authors: Y. Wang

Abstract:

The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.

Keywords: Frequency quadrilateral, iterative algorithm, sparse graph, traveling salesman problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1010
6197 Simulation and Design of an Aerospace Mission Powered by “Candy” Type Fuel Engines

Authors: N. Hernández Huertas, F. Rojas Mora

Abstract:

Sounding rockets are aerospace vehicles that were developed in the mid-20th century, and since then numerous investigations have been executed with the aim of innovate in this type of technology. However, the costs associated to the production of this type of technology are usually quite high, and therefore the challenge that exists today is to be able to reduce them. In this way, the main objective of this document is to present the design process of a Colombian aerospace mission capable to reach the thermosphere using low-cost “Candy” type solid fuel engines. This mission is the latest development of the Uniandes Aerospace Project (PUA for its Spanish acronym), which is an undergraduate and postgraduate research group at Universidad de los Andes (Bogotá, Colombia), dedicated to incurring in this type of technology. In this way, the investigations that have been carried out on Candy-type solid fuel, which is a compound of potassium nitrate and sorbitol, have allowed the production of engines powerful enough to reach space, and which represents a unique technological advance in Latin America and an important development in experimental rocketry. In this way, following the engineering iterative design methodology was possible to design a 2-stage sounding rocket with 1 solid fuel engine in each one, which was then simulated in RockSim V9.0 software and reached an apogee of approximately 150 km above sea level. Similarly, a speed equal to 5 Mach was obtained, which after performing a finite element analysis, it was shown that the rocket is strong enough to be able to withstand such speeds. Under these premises, it was demonstrated that it is possible to build a high-power aerospace mission at low cost, using Candy-type solid fuel engines. For this reason, the feasibility of carrying out similar missions clearly depends on the ability to replicate the engines in the best way, since as mentioned above, the design of the rocket is adequate to reach supersonic speeds and reach space. Consequently, with a team of at least 3 members, the mission can be obtained in less than 3 months. Therefore, when publishing this project, it is intended to be a reference for future research in this field and benefit the industry.

Keywords: Aerospace missions, candy type solid propellant engines, design of solid rockets, experimental rocketry, low costs missions.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 800
6196 The Mutated Distance between Two Mixture Trees

Authors: Wan Chian Li, Justie Su-Tzu Juan, Yi-Chun Wang, Shu-Chuan Chen

Abstract:

The evolutionary tree is an important topic in bioinformation. In 2006, Chen and Lindsay proposed a new method to build the mixture tree from DNA sequences. Mixture tree is a new type evolutionary tree, and it has two additional information besides the information of ordinary evolutionary tree. One of the information is time parameter, and the other is the set of mutated sites. In 2008, Lin and Juan proposed an algorithm to compute the distance between two mixture trees. Their algorithm computes the distance with only considering the time parameter between two mixture trees. In this paper, we proposes a method to measure the similarity of two mixture trees with considering the set of mutated sites and develops two algorithm to compute the distance between two mixture trees. The time complexity of these two proposed algorithms are O(n2 × max{h(T1), h(T2)}) and O(n2), respectively

Keywords: evolutionary tree, mixture tree, mutated site, distance.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1417
6195 Instrumentation for Studying Real-time Popcorn Effect in Surface Mount Packages during Solder Reflow

Authors: Arijit Roy

Abstract:

Occurrence of popcorn in IC packages while assembling them onto the PCB is a well known moisture sensitive reliability issues, especially for surface mount packages. Commonly reflow soldering simulation process is conducted to assess the impact of assembling IC package onto PCB. A strain gauge-based instrumentation is developed to investigate the popcorn effect in surface mount packages during reflow soldering process. The instrument is capable of providing real-time quantitative information of the occurrence popcorn phenomenon in IC packages. It is found that the popcorn occur temperatures between 218 to 241°C depending on moisture soak condition, but not at the peak temperature of the reflow process. The presence of popcorn and delamination are further confirmed by scanning acoustic tomography as a failure analysis.

Keywords: Instrumentation, Popcorn, Real-time, Solder Reflow, Strain Gauge.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2682
6194 A Genetic Algorithm for Clustering on Image Data

Authors: Qin Ding, Jim Gasvoda

Abstract:

Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups have diverse properties. Many heuristic algorithms have been applied to the clustering problem, which is known to be NP Hard. Genetic algorithms have been used in a wide variety of fields to perform clustering, however, the technique normally has a long running time in terms of input set size. This paper proposes an efficient genetic algorithm for clustering on very large data sets, especially on image data sets. The genetic algorithm uses the most time efficient techniques along with preprocessing of the input data set. We test our algorithm on both artificial and real image data sets, both of which are of large size. The experimental results show that our algorithm outperforms the k-means algorithm in terms of running time as well as the quality of the clustering.

Keywords: Clustering, data mining, genetic algorithm, image data.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2053
6193 Selective Encryption using ISMA Cryp in Real Time Video Streaming of H.264/AVC for DVB-H Application

Authors: Jay M. Joshi, Upena D. Dalal

Abstract:

Multimedia information availability has increased dramatically with the advent of video broadcasting on handheld devices. But with this availability comes problems of maintaining the security of information that is displayed in public. ISMA Encryption and Authentication (ISMACryp) is one of the chosen technologies for service protection in DVB-H (Digital Video Broadcasting- Handheld), the TV system for portable handheld devices. The ISMACryp is encoded with H.264/AVC (advanced video coding), while leaving all structural data as it is. Two modes of ISMACryp are available; the CTR mode (Counter type) and CBC mode (Cipher Block Chaining) mode. Both modes of ISMACryp are based on 128- bit AES algorithm. AES algorithms are more complex and require larger time for execution which is not suitable for real time application like live TV. The proposed system aims to gain a deep understanding of video data security on multimedia technologies and to provide security for real time video applications using selective encryption for H.264/AVC. Five level of security proposed in this paper based on the content of NAL unit in Baseline Constrain profile of H.264/AVC. The selective encryption in different levels provides encryption of intra-prediction mode, residue data, inter-prediction mode or motion vectors only. Experimental results shown in this paper described that fifth level which is ISMACryp provide higher level of security with more encryption time and the one level provide lower level of security by encrypting only motion vectors with lower execution time without compromise on compression and quality of visual content. This encryption scheme with compression process with low cost, and keeps the file format unchanged with some direct operations supported. Simulation was being carried out in Matlab.

Keywords: AES-128, CAVLC, H.264, ISMACryp

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2049
6192 Evaluation of Features Extraction Algorithms for a Real-Time Isolated Word Recognition System

Authors: Tomyslav Sledevič, Artūras Serackis, Gintautas Tamulevičius, Dalius Navakauskas

Abstract:

Paper presents an comparative evaluation of features extraction algorithm for a real-time isolated word recognition system based on FPGA. The Mel-frequency cepstral, linear frequency cepstral, linear predictive and their cepstral coefficients were implemented in hardware/software design. The proposed system was investigated in speaker dependent mode for 100 different Lithuanian words. The robustness of features extraction algorithms was tested recognizing the speech records at different signal to noise rates. The experiments on clean records show highest accuracy for Mel-frequency cepstral and linear frequency cepstral coefficients. For records with 15 dB signal to noise rate the linear predictive cepstral coefficients gives best result. The hard and soft part of the system is clocked on 50 MHz and 100 MHz accordingly. For the classification purpose the pipelined dynamic time warping core was implemented. The proposed word recognition system satisfy the real-time requirements and is suitable for applications in embedded systems.

Keywords: Isolated word recognition, features extraction, MFCC, LFCC, LPCC, LPC, FPGA, DTW.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3540
6191 Analytical Crack Propagation Scenario for Gear Teeth and Time-Varying Gear Mesh Stiffness

Authors: Omar D. Mohammed, Matti Rantatalo, Uday Kumar

Abstract:

In this paper an analytical crack propagation scenario is proposed which assumes that a crack propagates in the tooth root in both the crack depth direction and the tooth width direction, and which is more reasonable and realistic for non-uniform load distribution cases than the other presented scenarios. An analytical approach is used for quantifying the loss of time-varying gear mesh stiffness with the presence of crack propagation in the gear tooth root. The proposed crack propagation scenario can be applied for crack propagation modelling and monitoring simulation, but further research is required for comparison and evaluation of all the presented crack propagation scenarios from the condition monitoring point of view.

Keywords: Crack propagation, Gear tooth crack, Time varying gear mesh stiffness.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2814
6190 Evaluation of Protocol Applied to Network Routing WCETT Cognitive Radio

Authors: Nancy Yaneth Gelvez García, Danilo Alfonso López Sarmiento

Abstract:

This article presents the results of researchrelated to the assessment protocol weightedcumulative expected transmission time (WCETT)applied to cognitive radio networks.The development work was based on researchdone by different authors, we simulated a network,which communicates wirelessly, using a licensedchannel, through which other nodes are notlicensed, try to transmit during a given time nodeuntil the station's owner begins its transmission.

Keywords: Cognitive radio, ETT, WCETT

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2379
6189 Seismic Behavior of a Jumbo Container Crane in the Low Seismicity Zone Using Time-History Analyses

Authors: Huy Q. Tran, Bac V. Nguyen, Choonghyun Kang, Jungwon Huh

Abstract:

Jumbo container crane is an important part of port structures that needs to be designed properly, even when the port locates in low seismicity zone such as in Korea. In this paper, 30 artificial ground motions derived from the elastic response spectra of Korean Building Code (2005) are used for time history analysis. It is found that the uplift might not occur in this analysis when the crane locates in the low seismic zone. Therefore, a selection of a pinned or a gap element for base supporting has not much effect on the determination of the total base shear. The relationships between the total base shear and peak ground acceleration (PGA) and the relationships between the portal drift and the PGA are proposed in this study.

Keywords: Jumbo container crane, portal drift, time history analysis, total base shear.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 911
6188 Robust Stability Criteria for Uncertain Genetic Regulatory Networks with Time-Varying Delays

Authors: Wenqin Wang, Shouming Zhong

Abstract:

This paper presents the robust stability criteria for uncertain genetic regulatory networks with time-varying delays. One key point of the criterion is that the decomposition of the matrix ˜D into ˜D = ˜D1 + ˜D2. This decomposition corresponds to a decomposition of the delayed terms into two groups: the stabilizing ones and the destabilizing ones. This technique enables one to take the stabilizing effect of part of the delayed terms into account. Meanwhile, by choosing an appropriate new Lyapunov functional, a new delay-dependent stability criteria is obtained and formulated in terms of linear matrix inequalities (LMIs). Finally, numerical examples are presented to illustrate the effectiveness of the theoretical results.

Keywords: Genetic regulatory network, Time-varying delay, Uncertain system, Lyapunov-Krasovskii functional

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1523
6187 Model of Controled Six Phase Induction Motor

Authors: R. Rinkeviciene, B. Kundrotas, S. Lisauskas

Abstract:

In this paper, the authors take a look at advantages of multiphase induction motors comparing them with three phase ones and present the applications where six-phase induction motors are used. They elaborate the mathematical model of six-phase induction motor with two similar stator three phase winding, shifted by 30 degrees in space and three phase winding in rotor, in synchronous reference frame for soft starting and scalar control. The authors simulate and discuss results of speed and torque starting transients.

Keywords: Model, scalar control, six-phase induction motor.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3117
6186 On the Construction of Lightweight Circulant Maximum Distance Separable Matrices

Authors: Qinyi Mei, Li-Ping Wang

Abstract:

MDS matrices are of great significance in the design of block ciphers and hash functions. In the present paper, we investigate the problem of constructing MDS matrices which are both lightweight and low-latency. We propose a new method of constructing lightweight MDS matrices using circulant matrices which can be implemented efficiently in hardware. Furthermore, we provide circulant MDS matrices with as few bit XOR operations as possible for the classical dimensions 4 × 4, 8 × 8 over the space of linear transformations over finite field F42 . In contrast to previous constructions of MDS matrices, our constructions have achieved fewer XORs.

Keywords: Linear diffusion layer, circulant matrix, lightweight, MDS matrix.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 853
6185 Wireless Backhauling for 5G Small Cell Networks

Authors: Abdullah A. Al Orainy

Abstract:

Small cell backhaul solutions need to be cost-effective, scalable, and easy to install. This paper presents an overview of small cell backhaul technologies. Wireless solutions including TV white space, satellite, sub-6 GHz radio wave, microwave and mmWave with their backhaul characteristics are discussed. Recent research on issues like beamforming, backhaul architecture, precoding and large antenna arrays, and energy efficiency for dense small cell backhaul with mmWave communications is reviewed. Recent trials of 5G technologies are summarized.

Keywords: Backhaul, Small Cells, Wireless, 5G.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2507
6184 Study of Effective Moisture Diffusivity of Oak Acorn

Authors: Habibeh Nalbandi, Sadegh Seiiedlou, Hamid R. Ghasemzadeh, Naser Hamdami

Abstract:

The purpose of present work was to study the drying kinetics of whole acorn and its kernel at different drying air temperatures and their effective moisture diffusivity. The results indicated that the drying time of whole acorn was 442, 206 and 188 min at the air temperature of 65, 75 and 85ºC, respectively. At the same temperatures, the drying time of kernel was 131, 56 and 76min. The results showed that the effect of drying air temperature increasing on the drying time reduction could not be significant on acorn drying at all conditions. The effective moisture diffusivity of whole acorn and kernel increased with increasing air temperature from 65 to 75ºC. However more air temperature increasing, led to decreasing this property of acorn kernel. The critical temperature of acorn drying was about 75°C in which acorn kernel had the highest effective moisture diffusivity.

Keywords: Critical temperature, Drying kinetics, Moisture diffusivity, Oak acorn.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1907
6183 Forecasting US Dollar/Euro Exchange Rate with Genetic Fuzzy Predictor

Authors: R. Mechgoug, A. Titaouine

Abstract:

Fuzzy systems have been successfully used for exchange rate forecasting. However, fuzzy system is very confusing and complex to be designed by an expert, as there is a large set of parameters (fuzzy knowledge base) that must be selected, it is not a simple task to select the appropriate fuzzy knowledge base for an exchange rate forecasting. The researchers often look the effect of fuzzy knowledge base on the performances of fuzzy system forecasting. This paper proposes a genetic fuzzy predictor to forecast the future value of daily US Dollar/Euro exchange rate time’s series. A range of methodologies based on a set of fuzzy predictor’s which allow the forecasting of the same time series, but with a different fuzzy partition. Each fuzzy predictor is built from two stages, where each stage is performed by a real genetic algorithm.

Keywords: Foreign exchange rate, time series forecasting, Fuzzy System, and Genetic Algorithm.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1998
6182 An Implementation of a Dual-Spin Spacecraft Attitude Reorientation Using Properties of Its Chaotic Motion

Authors: Anton V. Doroshin

Abstract:

This article contains a description of main ideas for the attitude reorientation of spacecraft (small dual-spin spacecraft, nanosatellites) using properties of its chaotic attitude motion under the action of internal perturbations. The considering method based on intentional initiations of chaotic modes of the attitude motion with big amplitudes of the nutation oscillations, and also on the redistributions of the angular momentum between coaxial bodies of the dual-spin spacecraft (DSSC), which perform in the purpose of system’s phase space changing.

Keywords: Spacecraft, Attitude Dynamics and Control, Chaos.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1943
6181 A Distributed Group Mutual Exclusion Algorithm for Soft Real Time Systems

Authors: Abhishek Swaroop, Awadhesh Kumar Singh

Abstract:

The group mutual exclusion (GME) problem is an interesting generalization of the mutual exclusion problem. Several solutions of the GME problem have been proposed for message passing distributed systems. However, none of these solutions is suitable for real time distributed systems. In this paper, we propose a token-based distributed algorithms for the GME problem in soft real time distributed systems. The algorithm uses the concepts of priority queue, dynamic request set and the process state. The algorithm uses first come first serve approach in selecting the next session type between the same priority levels and satisfies the concurrent occupancy property. The algorithm allows all n processors to be inside their CS provided they request for the same session. The performance analysis and correctness proof of the algorithm has also been included in the paper.

Keywords: Concurrency, Group mutual exclusion, Priority, Request set, Token.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1713
6180 Time Delay Estimation Using Signal Envelopes for Synchronisation of Recordings

Authors: Sergei Aleinik, Mikhail Stolbov

Abstract:

In this work, a method of time delay estimation for  dual-channel acoustic signals (speech, music, etc.) recorded under  reverberant conditions is investigated. Standard methods based on  cross-correlation of the signals show poor results in cases involving  strong reverberation, large distances between microphones and  asynchronous recordings. Under similar conditions, a method based  on cross-correlation of temporal envelopes of the signals delivers a  delay estimation of acceptable quality. This method and its properties  are described and investigated in detail, including its limits of  applicability. The method’s optimal parameter estimation and a  comparison with other known methods of time delay estimation are  also provided.

 

Keywords: Cross-correlation, delay estimation, signal envelope, signal processing.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3064
6179 Development and Evaluation of Gastro Retentive Floating Tablets of Ayurvedic Vati Formulation

Authors: Imran Khan Pathan, Anil Bhandari, Peeyush K. Sharma, Rakesh K. Patel, Suresh Purohit

Abstract:

Floating tablets of Marichyadi Vati were developed with an aim to prolong its gastric residence time and increase the bioavailability of drug. Rapid gastrointestinal transit could result in incomplete drug release from the drug delivery system above the absorption zone leading to diminished efficacy of the administered dose. The tablets were prepared by wet granulation technique, using HPMC E50 LV act as Matrixing agent, Carbopol as floating enhancer, microcrystalline cellulose as binder, Sodium bi carbonate as effervescent agent with other excipients. The simplex lattice design was used for selection of variables for tablets formulation. Formulation was optimized on the basis of floating time and in vitro drug release. The results showed that the floating lag time for optimized formulation was found to be 61 second with about 97.32 % of total drug release within 3 hours. The vitro release profiles of drug from the formulation could be best expressed zero order with highest linearity r2 = 0.9943. It was concluded that the gastroretentive drug delivery system can be developed for Marichyadi Vati containing Piperine to increase the residence time of the drug in the stomach and thereby increasing bioavailability.

Keywords: Piperine, Marichyadi Vati, Gastroretentive drug delivery, Floating tablet.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2678
6178 Approximate Range-Sum Queries over Data Cubes Using Cosine Transform

Authors: Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan

Abstract:

In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells- values. The cosine transform is known to have a good energy compaction property and thus can approximate data distribution functions easily with small number of coefficients. The derived estimator is accurate and easy to update. We perform experiments to compare its performance with a well-known technique - the (Haar) wavelet. The experimental results show that the cosine transform performs much better than the wavelet in estimation accuracy, speed, space efficiency, and update easiness.

Keywords: DCT, Data Cube

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1962
6177 Exploratory Data Analysis of Passenger Movement on Delhi Urban Bus Route

Authors: Sourabh Jain, Sukhvir Singh Jain, Gaurav V. Jain

Abstract:

Intelligent Transportation System is an integrated application of communication, control and monitoring and display process technologies for developing a user–friendly transportation system for urban areas in developing countries. In fact, the development of a country and the progress of its transportation system are complementary to each other. Urban traffic has been growing vigorously due to population growth as well as escalation of vehicle ownership causing congestion, delays, pollution, accidents, high-energy consumption and low productivity of resources. The development and management of urban transport in developing countries like India however, is at tryout stage with very few accumulations. Under the umbrella of ITS, urban corridor management strategy have proven to be one of the most successful system in accomplishing these objectives. The present study interprets and figures out the performance of the 27.4 km long Urban Bus route having six intersections, five flyovers and 29 bus stops that covers significant area of the city by causality analysis. Performance interpretations incorporate Passenger Boarding and Alighting, Dwell time, Distance between Bus Stops and Total trip time taken by bus on selected urban route.

Keywords: Congestion, Dwell time, delay, passengers boarding alighting, travel time.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1080
6176 The Effects of Plant Density and Row Spacing on the Height of Maize Hybrids of Different Vegetation Time and Genotype

Authors: E. Murányi, P. Pepó

Abstract:

The small plot experiment was set in 2013 at the RISFLátókép Experimental Farm of the Centre for Agricultural and Applied Economic Sciences of the University of Debrecen, on lime-coated chernozem soil in four replications. The final heights of the maize hybrids were studied at three plant densities (50, 70, and 90 thousand ha-1) and two row spacing (45 and 76cm). During the experiment, we have investigated the development of the final plant heights of five maize hybrids of different vegetation time and genotype: Sarolta, DKC 4025, P 9175, Reseda/P 37M81, and SY Affinity. In the development of the plant heights, the tiller number and the hybrid were the decisive factors. The increasing stock density resulted in significant difference in the plant height values, while the row spacing did not. With the increase of plant density and the length of vegetation time, the heights of the individual plants increased.

Keywords: Maize, plant density, row spacing, plant height, genotype.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3687
6175 Removal of Arsenic (III) from Contaminated Waterby Synthetic Nano Size Zerovalent Iron

Authors: A. R. Rahmani, H. R. Ghaffari, M. T. Samadi

Abstract:

The present work was conducted for Arsenic (III) removal, which one of the most poisonous groundwater pollutants, by synthetic nano size zerovalent iron (nZVI). Batch experiments were performed to investigate the influence of As (III), nZVI concentration, pH of solution and contact time on the efficiency of As (III) removal. nZVI was synthesized by reduction of ferric chloride by sodium borohydrid. SEM and XRD were used to determine particle size and characterization of produced nanoparticles. Up to 99.9% removal efficiency for arsenic (III) was obtained by nZVI dosage of 1 g/L at time equal to 10 min. and pH=7. It could be concluded that the removal efficiency were enhanced with increasing of ZVI dosage and reaction time, but decreased with increasing of arsenic concentration and pH for nano sized ZVI. nZVI presented an outstanding ability to remove As (III) due to not only a high surface area and low particle size but also to high inherent activity.

Keywords: Arsenic removal, aqueous solution, zero valent iron.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2616
6174 A Novel Model for Simultaneously Minimising Costs and Risks in Just-in-Time Systems Using Multi-Backup Suppliers: Part 2- Results

Authors: Faraj El Dabee, Romeo Marian, Yousef Amer

Abstract:

This paper implements the inventory model developed in the first part of this paper in a simplified problem to simultaneously reduce costs and risks in JIT systems. This model is developed to ascertain an optimal ordering strategy for procuring raw materials by using regular multi-external and local backup suppliers to reduce the total cost of the products, and at the same time to reduce the risks arising from this cost reduction within production systems. A comparison between the cost of using the JIT system and using the proposed inventory model shows the superiority of the use of the inventory model.

Keywords: Lean manufacturing, Just-in-Time (JIT), production system, cost-risk reduction, inventory model, eternal supplier, local backup supplier.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1547
6173 Simulation of Water Droplet on Horizontally Smooth and Rough Surfaces Using Quasi-Molecular Modelling

Authors: S. Kulsri, M. Jaroensutasinee, K. Jaroensutasinee

Abstract:

We developed a method based on quasi-molecular modelling to simulate the fall of water drops on horizontally smooth and rough surfaces. Each quasi-molecule was a group of particles that interacted in a fashion entirely analogous to classical Newtonian molecular interactions. When a falling water droplet was simulated at low impact velocity on both smooth and rough surfaces, the droplets moved periodically (i.e. the droplets moved up and down for a certain period, finally they stopped moving and reached a steady state), spreading and recoiling without splash or break-up. Spreading rates of falling water droplets increased rapidly as time increased until the spreading rate reached its steady state at time t ~ 0.25 s for rough surface and t ~ 0.40 s for smooth surface. The droplet height above both surfaces decreased as time increased, remained constant after the droplet diameter attained a maximum value and reached its steady state at time t ~ 0.4 s. However, rough surface had higher spreading rates of falling water droplets and lower height on the surface than smooth one.

Keywords: Quasi-molecular modelling, particle modelling, molecular aggregate approach.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1830