Loading...
Search for: international-conferences
0.009 seconds
Total 179 records

    Workspace analysis of cable-suspended robots with elastic cable

    , Article 2007 IEEE International Conference on Robotics and Biomimetics, ROBIO, Yalong Bay, Sanya, 15 December 2007 through 18 December 2007 ; 2007 , Pages 1942-1947 ; 9781424417582 (ISBN) Korayem, M. H ; Bamdad, M ; Saadat, M ; Sharif University of Technology
    IEEE Computer Society  2007
    Abstract
    This paper presents a kinematics and workspace analysis of cable-suspended manipulators with elastic cable. The mechanics of extensible cable with a deflection to its selfweight are studied. The problem of evaluating the workspace is approached by using a modified formulation for a deformable cable. The proposed algorithm for testing whether a given configuration lies within the reachable workspace is applied. Starting with a general statement of the kinetic equations of the elastic cable and incorporate cable flexibility into workspace generation. This algorithm is verified through simulation results of various cable-suspended robots. © 2008 IEEE  

    Wavelet-based unbalanced un-equivalent multiple description coding for P2P networks

    , Article 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, ICT-MICC 2007, Penang, 14 May 2007 through 17 May 2007 ; February , 2007 , Pages 242-247 ; 1424410940 (ISBN); 9781424410941 (ISBN) Firooz, M. H ; Ronasi, K ; Pakravan, M. R ; Nasiri Avanaki, A ; Sharif University of Technology
    2007
    Abstract
    Almost all existing multi-description coding (MDC) schemes are designed for media streaming over Internet. In this work, a wavelet-based video MDC technique is introduced that fits the criteria of media streaming over peer-to-peer networks. Our proposed method assigns descriptions to the senders due to their characteristic (i.e. bandwidth and availability). In contrast to traditional MDC, different descriptions in the proposed method have different importance in remaking the original media. Our simulation results show considerable improvement of video quality at the receiver (up to 10 dB) as compared to the state-of-the-art. ©2007 IEEE  

    Wavelet-based 2-D ECG data compression method using SPIHT and VQ coding

    , Article EUROCON 2007 - The International Conference on Computer as a Tool, Warsaw, 9 September 2007 through 12 September 2007 ; December , 2007 , Pages 133-137 ; 142440813X (ISBN); 9781424408139 (ISBN) Sahraeian, S. M. E ; Fatemizadeh, E ; Sharif University of Technology
    2007
    Abstract
    An improved wavelet-based 2-D ECG data compression method is presented which employs a double stage compression. In the first stage the set partitioning in hierarchical trees (SPIHT) algorithm is used to compress the 2-D data array formed by cutting and beat-aligning the heartbeat data sequence. In the second stage vector quantization is applied to the residual image obtained from the previous stage. The 2-D approach utilizes both inter-beat and inter-sample redundancies in the ECG signal The proposed algorithm is applied to several records in the MIT-BIH arrhythmia database. Results show lower Percent Root mean square Difference (PRD) than 1-D methods and several 2-D methods for the same... 

    Vibration control of AFM tip for nano-manipulation using combined sliding mode techniques

    , Article 2007 7th IEEE International Conference on Nanotechnology - IEEE-NANO 2007, Hong Kong, 2 August 2007 through 5 August 2007 ; 2007 , Pages 106-111 ; 1424406080 (ISBN); 9781424406081 (ISBN) Delnavaz, A ; Jalili, N ; Zohoor, H ; Sharif University of Technology
    2007
    Abstract
    Atomic force microscope (AFM) can be used as nanorobotics manipulation tool for nano particle positioning, pushing, indenting, cutting and etc. control the vibration behavior of AFM and make the micro-cantilever tip track specified trajectory is very crucial to appropriately manipulate particles in nano-scales. The novel combined sliding mode approach has been investigated in this paper to obtain robust nonlinear control scheme for nanomanipulation. First (classical) and second order (SOSM) sliding mode techniques have been developed and applied to nonlinear dynamical and uncertain model of AFM cantilever beam to track the desired trajectories. The simulation results show chattering in... 

    Trust inference in web-based social networks using resistive networks

    , Article Proceedings- 3rd International Conference on Internet and Web Applications and Services, ICIW 2008, Athens, 8 June 2008 through 13 June 2008 ; 2008 , Pages 233-238 ; 9780769531632 (ISBN) Taherian, M ; Amini, M ; Jalili, R ; Sharif University of Technology
    2008
    Abstract
    By the immense growth of the Web-Based Social Networks (WBSNs), the role of trust in connecting people together through WBSNs is getting more important than ever. In other words, since the probability of malicious behavior in WBSNs is increasing, it is necessary to evaluate the reliability of a person before trying to communicate with. Hence, it is desirable to find out how much a person should trust another one in a network. The approach to answer this question is usually called trust inference. In this paper, we propose a new trust inference algorithm (Called RN-Trust) based on the resistive networks concept. The algorithm, in addition to being simple, resolves some problems of previously... 

    Transmission loss allocation using normalized loss weight factors

    , Article 3rd International Conference on Deregulation and Restructuring and Power Technologies, DRPT 2008, Nanjing, 6 April 2008 through 9 April 2008 ; 2008 , Pages 431-435 ; 9787900714138 (ISBN) Keshmiri, S. N ; Ehsan, M ; Sharif University of Technology
    2008
    Abstract
    One of the major problems in liberalized power markets is loss allocation. In this paper, a new method for allocating transmission losses to pool market participants is proposed. The proposed method is fundamentally based on Bialek's "Tracing the flow of electricity" method. The losses is allocated to market participants using the loss weight factors (LWFs) which are obtained from the square current magnitude and Z-bus matrix. The LWF method is based on a solved load flow and strongly emphasizes on current magnitude while considers network topology. The method has been implemented and tested on several networks and one sample summarized in the paper. The results show that the method has an... 

    Towards a model for inferring trust in heterogeneous social networks

    , Article 2nd Asia International Conference on Modelling and Simulation, AMS 2008, Kuala Lumpur, 13 May 2008 through 15 May 2008 ; 2008 , Pages 52-58 ; 9780769531366 (ISBN) Akhoondi, M ; Habibi, J ; Sayyadi, M ; Sharif University of Technology
    2008
    Abstract
    People usually use trust and reputation to cope with uncertainty which exists in the nature and routines. The existing approaches for inferring trust rely on homogeneous relations. In other words, trust is just inferred by a homogeneous relation. In this paper, we present a new model for inferring trust using heterogeneous social networks; we use relation extraction to make a trust relation from the other relation such as friendship and the college relation and then introduced an algorithm to infer trust using extracted relation. In order to get higher performance, we extend relation extraction problem by proposing a genetic algorithm. This algorithm is more scalable, interpretable and... 

    Text steganography in SMS

    , Article 2nd International Conference on Convergent Information Technology, ICCIT 07, Gyongju, 21 November 2007 through 23 November 2007 ; 2007 , Pages 2260-2265 ; 0769530389 (ISBN); 9780769530383 (ISBN) Shirali Shahreza, M ; Shirali Shahreza, M. H ; Sharif University of Technology
    2007
    Abstract
    One of the services used in mobile phone is the short message service (SMS) which is widely used by the public in all parts of the world especially in Asia and Europe. This service enables people to write and exchange short messages via mobile phone. Due to the limited size of SMS, lack of a proper keyboard on the mobile phone and to improve the speed of typing, new abbreviations have been invented for different words and phrases which has lead to the invention of a new language called SMS-Textlng. One of the main issues in communication is information security and privacy. There are many methods for secret communication and many researchers are working on steganography. In steganography the... 

    Text steganography in chat

    , Article 3rd IEEE/IFIP International Conference in Central Asia on Internet, ICI 2007, Tashkent, 26 September 2007 through 28 September 2007 ; 2007 ; 1424410061 (ISBN); 9781424410064 (ISBN) Shirali Shahreza, M. H ; Shirali Shahreza, M ; Sharif University of Technology
    2007
    Abstract
    Invention of the Internet and its spread in the world changes various aspects of human life. In addition, Internet changed human relations. Chat is one of the new aspects which invented after the Internet and is welcomed by users, especially by young people. In chat rooms, people talk with each other using text messages. Because of the need for quick typing of the word and also because of the high amount of sentences which is exchanged between users, new abbreviations are invented for various words and phrases in chat rooms. This new language is known as SMS-Texting. On the other hand, the issue of safety and security of information and especially secret relationships has led to the... 

    Taxonomy learning using compound similarity measure

    , Article IEEE/WIC/ACM International Conference on Web Intelligence, WI 2007, Silicon Valley, CA, 2 November 2007 through 5 November 2007 ; January , 2007 , Pages 487-490 ; 0769530265 (ISBN); 9780769530260 (ISBN) Neshati, M ; Alijamaat, A ; Abolhassani, H ; Rahimi, A ; Hoseini, M ; Sharif University of Technology
    2007
    Abstract
    Taxonomy learning is one of the major steps in ontology learning process. Manual construction of taxonomies is a time-consuming and cumbersome task. Recently many researchers have focused on automatic taxonomy learning, but still quality of generated taxonomies is not satisfactory. In this paper we have proposed a new compound similarity measure. This measure is based on both knowledge poor and knowledge rich approaches to find word similarity. We also used Machine Learning Technique (Neural Network model) for combination of several similarity methods. We have compared our method with simple syntactic similarity measure. Our measure considerably improves the precision and recall of automatic... 

    Symbiotic tabu search, a general evolutionary optimization approach

    , Article 7th International Conference on Hybrid Intelligent Systems, HIS 2007, Kaiserslautern, 17 September 2007 through 19 September 2007 ; October , 2007 , Pages 138-143 ; 0769529461 (ISBN); 9780769529462 (ISBN) Halavati, R ; Shouraki, S. B ; Jashmi, B. J ; Heravi, M. J ; Sharif University of Technology
    2007
    Abstract
    Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations - hopefully producing an offspring that has the good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative for sexual recombination operator to overcome the need of explicit design of recombination operators in GA. This paper presents an optimization algorithm based on using this operator in Tabu Search. The algorithm is benchmarked on two problem sets and is compared with standard genetic algorithm and symbiotic evolutionary adaptation model, showing success rates higher than both cited... 

    Steganography in SMS by Sudoku puzzle

    , Article 6th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2008, Doha, 31 March 2008 through 4 April 2008 ; 2008 , Pages 844-847 ; 9781424419685 (ISBN) Shirali Shahreza, M. H ; Shirali Shahreza, M ; Sharif University of Technology
    2008
    Abstract
    Sudoku puzzle is a logical game which has recently got very popular. Every day various mass media print these puzzles. As a result these puzzles are a suitable alternative for hidden data transfer. SMS (short message service) is one of the popular mobile-phone services. In this service people can write short messages and send it to each other through mobile phones. In this paper a method has been presented for Steganography (hiding data) in Sudoku puzzles and through SMS. In this method after hiding data in a Sudoku puzzle, the puzzle is sent in a way that it does not attract any attention. Steganography algorithm is based on order of place of numbers 1 through 9 in one of the specified row... 

    Source estimation in noisy sparse component analysis

    , Article 2007 15th International Conference onDigital Signal Processing, DSP 2007, Wales, 1 July 2007 through 4 July 2007 ; July , 2007 , Pages 219-222 ; 1424408822 (ISBN); 9781424408825 (ISBN) Zayyani, H ; Babaiezadeh, M ; Jutten, C ; Sharif University of Technology
    2007
    Abstract
    In this paper, a new algorithm for Sparse Component Analysis (SCA) in the noisy underdetermined case (i.e., with more sources than sensors) is presented. The solution obtained by the proposed algorithm is compared to the minimum l1 -norm solution achieved by Linear Programming (LP). Simulation results show that the proposed algorithm is approximately 10 dB better than the LP method with respect to the quality of the estimated sources. It is due to optimality of our solution (in the MAP sense) for source recovery in noisy underdetermined sparse component analysis in the case of spiky model for sparse sources and Gaussian noise. © 2007 IEEE  

    Solving stochastic path problem: particle swarm optimization approach

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 18 June 2008 through 20 June 2008, Wroclaw ; Volume 5027 LNAI , 2008 , Pages 590-600 ; 03029743 (ISSN); 354069045X (ISBN); 9783540690450 (ISBN) Momtazi, S ; Kafi, S ; Beigy, H ; Sharif University of Technology
    2008
    Abstract
    An stochastic version of the classical shortest path problem whereby for each node of a graph, a probability distribution over the set of successor nodes must be chosen so as to reach a certain destination node with minimum expected cost. In this paper, we propose a new algorithm based on Particle Swarm Optimization (PSO) for solving Stochastic Shortest Path Problem (SSPP). The comparison of our algorithm with other algorithms indicates that its performance is suitable even by the less number of iterations. © 2008 Springer-Verlag Berlin Heidelberg  

    Solving MEC model of haplotype reconstruction using information fusion, single greedy and parallel clustering approaches

    , Article 6th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2008, Doha, 31 March 2008 through 4 April 2008 ; 2008 , Pages 15-19 ; 9781424419685 (ISBN) Asgarian, E ; Moeinzadeh, M. H ; Sharifian-R, S ; Najafi-A, A ; Ramezani, A ; Habibi, J ; Mohammadzadeh, J ; Sharif University of Technology
    2008
    Abstract
    Haplotype information has become increasingly important in analyzing fine-scale molecular genetics data, Due to the mutated form in human genome; SNPs (Single Nucleotide Polymorphism) are responsible for some genetic diseases. As a consequence, obtaining all SNPs from human populations is one of the primary goals of studies in human genomics. In this paper, a data fusion method based on multiple parallel classifiers for reconstruction of haplotypes from a given sample Single Nucleotide Polymorphism (SNP) is proposed. First, we design a single greedy algorithm for solving haplotype reconstructions. [2] is used as an efficient approach to be combined with first classification method. The... 

    Software watermarking by equation reordering

    , Article 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA, Damascus, 7 April 2008 through 11 April 2008 ; 2008 ; 1424417511 (ISBN); 9781424417513 (ISBN) Shirali Shahreza, M ; Shirali Shahreza, S ; Sharif University of Technology
    2008
    Abstract
    Watermarking is the process of hiding information in a media and usually used to for copyright protection. In software watermarking, the information is added to the source code of program and can be extracted from compiled executable code. In this paper, a new software watermarking algorithm is proposed by equation reordering. In this method, the order of operands in an equation is changed according to the information we want to hide in a way that the result of the equation is unchanged. One of the main advantages of this method is that no code added to the program, so the size and speed of the program not changed  

    SME: Learning automata-based algorithm for estimating the mobility model of soccer players

    , Article 6th IEEE International Conference on Cognitive Informatics, ICCI 2007, Lake Tahoe, CA, 6 August 2007 through 8 August 2007 ; October , 2007 , Pages 462-469 ; 1424413273 (ISBN); 9781424413270 (ISBN) Jamalian, A. H ; Sefidpour, A. R ; Manzuri Shalmani, M. T ; Iraji, R ; Sharif University of Technology
    2007
    Abstract
    Soccer model and relation of players and coach has been analyzed by a learning automata-based method, called Soccer Mobility Estimator (SME), who estimates the mobility model of soccer players. During a soccer match, players play according to a certain program designed by coach. The pattern of players' mobility is not stochastic and it can be assumed that they are playing with a certain mobility model. Since knowledge about mobility model of nodes in mobile ad-hoc networks has a substantial effect on its performance evaluation, knowledge about mobility model of soccer players can be useful for coaches and experts for game analysis. In fact the mobility model of players could be an important... 

    Simulation and improvement of two digital adaptive frequency calibration techniques for fast locking wide-band frequency synthesizers

    , Article 2007 International Conference on Design and Technology of Integrated Systems in Nanoscale Era, DTIS 2007, Rabat, 2 September 2007 through 5 September 2007 ; February , 2007 , Pages 136-141 ; 1424412781 (ISBN); 9781424412785 (ISBN) Saadat, M. R ; Momtazpour, M ; Alizadeh, B ; Sharif University of Technology
    2007
    Abstract
    Fast locking PLL-based wide-band frequency synthesizers used in high performance RF transceivers often require multi-band voltage controlled oscillator (VCO). These types of frequency synthesizers employ both discrete and continuous tuning mechanisms to satisfy wide frequency range and low VCO tuning gain simultaneously. To facilitate discrete tuning mechanisms, an auxiliary digital loop is required in order to select proper band of VCO. This digital loop is called adaptive frequency calibration (AFC). In this paper two methods of previous AFC architectures are discussed and improved to gain the minimum possible lock time of PLL. Then, these two methods are simulated and implemented over... 

    Sending mobile software activation code by SMS using steganography

    , Article 3rd International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2007, Kaohsiung, 26 November 2007 through 28 November 2007 ; Volume 1 , February , 2007 , Pages 554-557 ; 0769529941 (ISBN); 9780769529943 (ISBN) Shirali Shahreza, M. H ; Shirali Shahreza, M ; Sharif University of Technology
    2007
    Abstract
    Now we are able to offer numerous softwares for mobile phones after the advances in mobile phone industry. Most of these softwares should be bought in order that we can use them. Some of these softwares are sharewares and after buying them you have to insert an activation code given by the manufacturing company based on your mobile IMEI code in order to activate the software. In this paper a new method is introduced for sending the mobile software activation code by SMS (Short Message Service). In this method the activation code is hidden in an SMS picture message by steganography method and sent to the user. The software extracting the activation code from the picture and compare it with... 

    Self-reconfiguration in highly available pervasive computing systems

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 23 June 2008 through 25 June 2008, Oslo ; Volume 5060 LNCS , 2008 , Pages 289-301 ; 03029743 (ISSN) ; 3540692940 (ISBN); 9783540692942 (ISBN) Hemmati, H ; Jalili, R ; Sharif University of Technology
    2008
    Abstract
    High availability of software systems is an essential requirement for pervasive computing environments. In such systems self-adaptation, using dynamic reconfiguration is also a key feature. However, dynamic reconfiguration potentially decreases the system availability by making parts of the system temporary frozen, especially during incomplete or faulty execution of the reconfiguration process. In this paper, we propose Assured Dynamic Reconfiguration Framework (ADRF), consisting of run-time analysis phases, assuring the desired correctness and completeness of dynamic reconfiguration process. We also specify factors that affect availability of reconfigurable software in pervasive computing...