Loading...
Search for: algorithms
0.013 seconds
Total 4579 records

    Learning overcomplete dictionaries from markovian data

    , Article 10th IEEE Sensor Array and Multichannel Signal Processing Workshop, SAM 2018, 8 July 2018 through 11 July 2018 ; Volume 2018-July , 2018 , Pages 218-222 ; 2151870X (ISSN); 9781538647523 (ISBN) Akhavan, S ; Esmaeili, S ; Babaie Zadeh, M ; Soltanian Zadeh, H ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    We explore the dictionary learning problem for sparse representation when the signals are dependent. In this paper, a first-order Markovian model is considered for dependency of the signals, that has many applications especially in medical signals. It is shown that the considered dependency among the signals can degrade the performance of the existing dictionary learning algorithms. Hence, we propose a method using the Maximum Log-likelihood Estimator (MLE) and the Expectation Minimization (EM) algorithm to learn the dictionary from the signals generated under the first-order Markovian model. Simulation results show the efficiency of the proposed method in comparison with the... 

    A hybrid method of neural networks and genetic algorithm in econometric modeling and analysis

    , Article Journal of Applied Sciences ; Volume 8, Issue 16 , 2008 , Pages 2825-2833 ; 18125654 (ISSN) Hasheminia, H ; Akhavan Niaki,S. T ; Sharif University of Technology
    2008
    Abstract
    In this study a hybrid method of neural networks-genetic algorithms is proposed and applied in an economical case study. The results of this study show that the proposed hybrid algorithm is a more efficient modeling approach compared to either a single neural network method or a single genetic algorithm approach. Since modeling based on the observed data is also employed in other fields of science, the application of the proposed method is not restricted only to economics. © 2008 Asian Network for Scientific Information  

    Broadcast algorithms on OTIS-Cubes

    , Article 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008, Sydney, NSW, 10 December 2008 through 12 December 2008 ; December , 2008 , Pages 637-642 ; 9780769534718 (ISBN) Ebrahimi Kahaki, H ; Sarbazi Azad, H ; Sharif University of Technology
    2008
    Abstract
    OTIS-based architectures appear to have the potential to be an interesting option for future generations of multiprocessing systems. In this paper, we propose a new adaptive unicast routing algorithm and four software-based (unicast-based) broadcast algorithms for the wormhole switched OTI S-hypercube. We then present an empirical performance evaluation of these algorithms in OTIS-hypercube for different topologies, message length and traffic loads. © 2008 IEEE  

    Intrusion detection via fuzzy-genetic algorithm combination with evolutionary algorithms

    , Article 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007, Melbourne, VIC, 11 July 2007 through 13 July 2007 ; July , 2007 , Pages 587-591 ; 0769528414 (ISBN); 9780769528410 (ISBN) Toroghi Haghighat, T ; Esmaeili, M ; Saremi, A ; Mousavi, V. R ; Sharif University of Technology
    2007
    Abstract
    In this paper with the use of fuzzy genetic algorithm combination with evolutionary algorithms, as a method for local searching, it has been tried to exploit high capabilities of genetic algorithm, as a search algorithm, beside to other evolutionary algorithms, as local search algorithms, in order to increase efficiency of a rule learning system. For this purpose three hybrid algorithms have been used for solving the intrusion detection problem. These three algorithms are combination of genetic algorithm and SFL and PSO as three evolutionary algorithms which try to introduce efficient solutions for complex optimization problems by patterning from natural treatments. © 2007 IEEE  

    Forecasting smoothed non-stationary time series using genetic algorithms

    , Article International Journal of Modern Physics C ; Volume 18, Issue 6 , 2007 , Pages 1071-1086 ; 01291831 (ISSN) Norouzzadeh, P ; Rahmani, B ; Norouzzadeh, M. S ; Sharif University of Technology
    2007
    Abstract
    We introduce kernel smoothing method to extract the global trend of a time series and remove short time scales variations and fluctuations from it. A multifractal detrended fluctuation analysis (MF-DFA) shows that the multifractality nature of TEPIX returns time series is due to both fatness of the probability density function of returns and long range correlations between them. MF-DFA results help us to understand how genetic algorithm and kernel smoothing methods act. Then we utilize a recently developed genetic algorithm for carrying out successful forecasts of the trend in financial time series and deriving a functional form of Tehran price index (TEPIX) that best approximates the time... 

    Kinetic investigation of small systems using different algorithms

    , Article Journal of the Iranian Chemical Society ; Volume 3, Issue 4 , 2006 , Pages 327-333 ; 1735207X (ISSN) Taherkhani, F ; Parsafar, G. A ; Rahimitabar, M. R ; Sharif University of Technology
    Iranian Chemical Society  2006
    Abstract
    We have investigated different algorithms for the simulation of kinetics of small systems. We have simulated the first order reversible reaction with the Gillespie, Gibson and Brack time simulation as a function of Poisson distribution and compared the results of three algorithms. We have also simulated intracellular viral kinetics for a genome with Gillespie and Poisson distribution algorithms  

    Analysis of design goals of cryptography algorithms based on different components

    , Article Indonesian Journal of Electrical Engineering and Computer Science ; Volume 23, Issue 1 , 2021 , Pages 540-548 ; 25024752 (ISSN) Molk, A.M.N.G ; Aref, M. R ; Khorshiddoust, R. R ; Sharif University of Technology
    Institute of Advanced Engineering and Science  2021
    Abstract
    Cryptography algorithms are a fundamental part of a cryptographic system that is designed and implemented to increase information security. They are the center of attention of experts in the information technology domains. Although the cryptography algorithms are implemented to attain the goals such as confidentially, integrity, and authenticity of designing, but other matters that must be noticed by designers include speed, resource consumption, reliability, flexibility, usage type, and so on. For the useful allocation of hardware, software, and human resources, it is important to identify the role of each of the factors influencing the design of cryptographic algorithms to invest in the... 

    A heuristic and GRASP algorithm for three-dimensional multiple bin-size bin packing problem based on the needs of a spare-part company

    , Article International Journal of Services and Operations Management ; Volume 38, Issue 1 , 2021 , Pages 73-91 ; 17442370 (ISSN) Sangchooli, A. S ; Sajadifar, S. M ; Sharif University of Technology
    Inderscience Publishers  2021
    Abstract
    The three-dimensional multiple bin-size bin packing problem (3D-MBSBPP) has many practical applications in the logistic problems such as warehouse management, transportation planning and container loading. An efficient solution to the problem can have significant effects on reducing the transportation costs, improving the status and increasing the productivity and profitability of the companies. The mathematical models proposed for this problem are few in number and can, therefore, be expanded and improved much further. In this paper, based on the needs of a spare-part company in Iran, we developed a mathematical model for 3D-MBSBPP. This model takes into account the rotation of the boxes... 

    Evolution of pleasure system in zamin artificial world

    , Article Proceedings of the Fifteenth IASTED Internatinal Conference on Modeling and Simulation, Marina Del Rey, CA, 1 March 2004 through 3 March 2004 ; 2004 , Pages 272-277 ; 10218181 (ISSN) Halavati, R ; Haratizadeh, S ; Bagheri Shouraki, S ; Sharif University of Technology
    2004
    Abstract
    Zamin, which is a high level artificial life environment have been successfully used as a test bed for a number of cognitive and AI studies. Here we have tried to test the evolution of a pleasure computing mechanism in Zamin's artificial creatures and have extended their mental capabilities to cover uncertainty in action selection mechanism. The results show some improvements in both genetic evolution process and learning capabilities. More specifically, we have evolved an internal pleasure system in Zamin creatures for the first time, quite unsupervised. In addition creatures could learn much more efficient behavioral patterns than what they could before  

    Dynamic economic dispatch in restructured power systems considering transmission costs using genetic algorithm

    , Article Canadian Conference on Electrical and Computer Engineering; Technology Driving Innovation, 2004, Niagara Falls, 2 May 2004 through 5 May 2004 ; Volume 3 , 2004 , Pages 1625-1628 ; 08407789 (ISSN) Hosseini, S. H ; Kheradmandi, M ; Sharif University of Technology
    2004
    Abstract
    Over the past decade, the power industry in many countries around the world has been undergoing massive changes to introduce competition. In power systems under transmission open access, an optimal schedule of generation of units to satisfy the demand at the minimum production and transmission costs with consideration of system operation constraints is an important issue. In this paper, a method for centralized economic dispatch in deregulated power systems is presented. The considered constraints are minimum and maximum power generation of units, capacity of transmission lines and ramp rate limits. Genetic algorithm is used to solve a nonlinear objective function. Simulations are performed... 

    Evolution of communication

    , Article Proceedings of the Seventh IASTED International Conference on Artificial Intelligence and Soft Computing, Banff, 14 July 2003 through 16 July 2003 ; Volume 7 , 2003 , Pages 274-277 ; 0889863679 (ISBN) Halavati, R ; Bagheri Shouraki, S ; Sharif University of Technology
    2003
    Abstract
    The evolution of communication and its consequences on living objects is a challenging subject for many researches. Due to lack of our knowledge about the real trend of this evolution, artificial life simulations can shed light on many dark points of this process. In this paper, we have used Zamin artificial life environment to test the emergence of a very simple form of communication. The usability of this new capability is tested by a simple test of coping with new environment  

    A memory efficient algorithm for multi-dimensional wavelet transform based on lifting

    , Article 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing, Hong Kong, 6 April 2003 through 10 April 2003 ; Volume 6 , 2003 , Pages 401-404 ; 15206149 (ISSN) Taghavi, Z ; Kasaei, S ; Sharif University of Technology
    2003
    Abstract
    Conventional implementation of multi-dimensional wavelet transform (e.g. 3-D wavelet) requires whether a high amount of "in access" memory or a continual access to slow memory of a processor which makes it infeasible for most applications. In this paper, we proposed a novel algorithm for computation of an n-D discrete wavelet transform (DWT) based on lifting scheme. In addition to benefits of lifting scheme (which causes a major reduction in computational complexity and performs the total computations in time domain), our real-time approach computes the coefficients for all kinds of 1st and 2 nd generation wavelets with short delay and optimized utilization of the slow and fast memories of a... 

    A fully modular online controller for robot navigation in static and dynamic environments

    , Article 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2003, 16 July 2003 through 20 July 2003 ; Volume 1 , 2003 , Pages 163-168 ; 0780378660 (ISBN) Taheri, J ; Sadati, N ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2003
    Abstract
    In this paper, a new approach for behavior based architecture in mobile robot navigation in unknown environments is presented. In this approach, the general actions of a mobile robot are classified into three thoroughly separated tasks. Then, an individual fuzzy controller is designed and implemented for each task (behavior). Finally, a behavior selector is designed to switch between the robot tasks (behavior patterns) and manage all separated fuzzy controllers to navigate a mobile robot in a fully unknown environment. Another case considered in this paper is to test and examine the proposed algorithm in an environment including the static and dynamic (moving) obstacles. The most difficult... 

    Reliability consideration in optimization of cascaded hydrothermal power systems

    , Article International Journal of Power and Energy Systems ; Volume 23, Issue 1 , 2003 , Pages 6-14 ; 10783466 (ISSN) Modarres, M ; Farrokhzad, D ; Sharif University of Technology
    2003
    Abstract
    This article investigates optimization of long-term operation of hydrothermal power systems consisting of cascaded reservoirs. Due to stochasticity of reservoir inflows, demand for energy, and unit forced outages, the uncertainty of this system is so significant that reliability of demand satisfaction becomes an indispensable component of the modelling process. On the other hand, existence of stochastic parameters, especially in the case of cascaded reservoirs, makes the problem very difficult to solve by applying existing optimization techniques. A hybrid genetic algorithm with dynamic tuning of its control parameters is developed that incorporates real number encoding and an analytical... 

    ABS solution of a class of linear integer inequalities and integer LP problems

    , Article Optimization Methods and Software ; Volume 16, Issue 1-4 , 2001 , Pages 179-192 ; 10556788 (ISSN) Esmaeili, H ; Mahdavi Amiri, N ; Spedicato, E ; Sharif University of Technology
    2001
    Abstract
    Using the recently developed ABS algorithm for solving linear Diophantine equations we give a representation of the solutions of a system of m linear integer inequalities in n variables, m ≤ n, with full rank coefficient matrix. We apply this result to solve linear integer programming problems with m ≤ n inequalities. © 2001 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint, a member of the Taylor & Francis Group  

    Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem

    , Article Operations Research Forum ; Volume 3, Issue 1 , 2022 ; 26622556 (ISSN) Barghi, B ; Sikari, S. S ; Sharif University of Technology
    Springer International Publishing  2022
    Abstract
    The authors consider the Multi-Skilled Project Scheduling Problem (MSPSP) as a version of the Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP), which extends the well-known NP-hard Resource-Constrained Project Scheduling Problem (RCPSP). In the MSPSP, it is made up of activities, which require specific skills to be done. Moreover, resources are staff members who master fixed skill(s). Thus, each resource requirement of an activity corresponds to the number of persons doing the corresponding skill that must be assigned to the activity during its whole processing time. The authors focus on taking into account the setup times when performing work, depending on the appointment... 

    Inventory-Routing Problem with Deliveries and Pickups

    , M.Sc. Thesis Sharif University of Technology Mortazavian Farsani, Mahta (Author) ; Shavandi, Hassan (Supervisor)
    Abstract
    In today’s industrial world, firms’ focus on production only, embedded in forward supply chains is not acceptable. Environmental crises have drawn public attention to the concept of Sustainability, and government regulations are pushing firms to taking the responsibility of their wastes. These have led to manufacturers’ tendency towards collecting returns from their customers in order to use them in remanufacturing processes embedded in Reverse Supply Chains. Besides, inventory policies compatible with appropriate flows of information is widely being used, out of which is the Vendor-Managed Inventory policy. These reasons clarify the importance of research and academic work into the field of... 

    Futuristic Greedy Algorithm on some NP-complete Problems

    , Ph.D. Dissertation Sharif University of Technology Bakht Hemmat, Ali (Author) ; Izadi, Mohammad (Supervisor)
    Abstract
    Many problems in the field of 0-1 integer programming are NP-Complete. Execution time for exact solving these problems is very high due to many constraints and decision variables. Hence, scientists use Fast algorithms, for example, the Greedy algorithms, in the approximated solution of these problems.A classic greedy approach may not search the whole solution space for better choices. However, other methods with a greedy approach, such as meta heuristic and hyper heuristic, in addition to local search, consider the more search space. These methods search randomly, so it does not provide a good guarantee for finding the proper solutions. Finding suitable solutions in this category of... 

    Ant colony algorithm for the shortest loop design problem [electronic resource]

    , Article Computers and Industrial Engineering, Elsevier ; Volume 50, Issue 4, August 2006, Pages 358–366 Eshghi, K. (Kourosh) ; Kazemi, Morteza ; Sharif University of Technology
    Abstract
    In this paper, a new algorithm for solving the shortest loop design problem is presented. The shortest loop design problem is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. In this paper, first it is shown that this problem can be represented as a graph model. The properties of the presented model enable us to design a meta-heuristic based on ant colony system algorithm for solving the shortest loop design problem. Computational results show the efficiency of our algorithm in compare to the other techniques  

    Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem

    , Article Annals of Operations Research ; Volume 226, Issue 1 , March , 2014 , pp. 351-377 ; ISSN: 02545330 Keshavarz, T ; Salmasi, N ; Varmazyar, M ; Sharif University of Technology
    Abstract
    This research considers a flexible flowshop sequence-dependent group scheduling problem with minimization of total completion time. A mixed integer linear mathematical model for the research problem is developed. Since the research problem is shown to be strongly NP-hard, a metaheuristic algorithm based on memetic algorithm (MA) is proposed. A lower bounding method based on the Branch and Price algorithm is also proposed to evaluate the quality of the MA. In order to evaluate the performance of the proposed algorithms, random test problems, ranging in size from small, medium, to large are generated and solved by the MA and the lower bounding method. The results show that the average...