Low Complexity Routing Algorithm for Rearrangeable Switching Networks

به نام خدا

Title: Low Complexity Routing Algorithm for Rearrangeable Switching Networks

Authors: Amitabha Chakrabarty Martin Collier

Abstract: Rearrangeable switching networks have been a topicof interest for a long time among the research community.Routing algorithms for this class of networks have attractedlots of researchers along with other related areas, such asmodification of the networks structure, crosspoints reduction etc.In this paper a new routing algorithm is presented for symmetricrearrangeable networks built with 2 × 2 switching element. Anew matrix based abstraction model is derived to determineconflict free routing paths for each input-output request. Eachstage of a network is mapped into a set of sub-matrices andnumber of matrices in each stage correspond to number ofsubnetworks in that stage. Once the input permutation is given,matrix cells are populated with binary values depending onthe position of the switching elements in the actual hardwareand their mapped matrix cells. These binary values control therouting decision in the underlying hardware. This new routingalgorithm is capable of connection setup for partial permutation,m = ρN , where N is the total input numbers and m is thenumber of active inputs. Overall the serial time complexity ofthis method is O(N logN)1 and O(mlogN) where all N inputsare active and with m < N active inputs respectively. Thetime complexity of this routing algorithm in a parallel machinewith N completely connected processors is O(log2N). With mactive requests the time complexity goes down to O(logmlogN),which is better than the O(log2m + logN), reported in theliterature for 212[(log2Nâˆ_4logN)12âˆ_logN ] ≤ ρ ≤ 1. Later half ofthis paper demonstrates how this routing algorithm is applicablefor crosstalk free routing in optical domain.   

Publish Year: 2013

Publisher: AINA - IEEE

Number of Pages: 8

موضوع: الگوریتم مسیر یابی، شبکه های کامپیوتری

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

 

 

Noise Robust Voice Detector for Speaker Recognition

به نام خدا

Title: Noise Robust Voice Detector for Speaker Recognition

Authors: Gabriel Hernandez, Jose R Calvo, Rafael Fernandez, Ivis Rodes and Rafael Martnez

Abstract: The effect of additive noise in a speaker recognition system is well known to be a crucial problem in real life applications. In a speaker recognition system, if the test utterance is corrupted by any type of noise, the performance of the system notoriously degrades. The use of a noise robust voice detector to determine which audio frame is a voice frame is proposed in this work. The new detector is implemented using an Ada-Boosting algorithm in a voiced-unvoiced sound classifier based on speech waveform only. Results reflect better performance of robust speaker recognition based on selected voice segments, respects to unselected segments, in front to additive white noise.   

Publish Year: 2008

Publisher: ICPR - IEEE

Number of Pages: 4

موضوع: تشخیص صدا

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

 

Bricolage: Example-Based Retargeting for Web Design

به نام خدا

Title: Bricolage: Example-Based Retargeting for Web Design

Authors: Ranjitha Kumar Jerry O Talton Salman Ahmad Scott R Klemmer

Abstract: The Web provides a corpus of design examples unparalleled in human history. However, leveraging existing designs to produce new pages is often difficult. This paper introduces the Bricolage algorithm for transferring design and content between Web pages. Bricolage employs a novel, structured-prediction technique that learns to create coherent mappings between pages by training on human-generated exemplars. The produced mappings are then used to automatically transfer the content from one page into the style and layout of an-other. We show that Bricolage can learn to accurately repro-duce human page mappings, and that it provides a general, efficient, and automatic technique for retargeting content between a variety of real Web pages.   

Publish Year: 2011

Publisher: CHI - ACM

Number of Pages: 20

موضوع: طراحی صفحات وب

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

Secret Sharing Scheme Suitable for Cloud Computing

به نام  خدا

Title: Secret Sharing Scheme Suitable for Cloud Computing

Authors: Satoshi Takahashi Keiichi Iwamura

Abstract: Secret sharing schemes have recently been considered to apply for cloud computing in which many users distribute multiple data to servers. However, when Shamir s(k,n) secret sharing is applied to cloud systems, the amount of share increases more than n times the amount of the secret. Therefore, in this paper we propose a new secret sharing scheme that can reduce the amount of share different from Ramp type secret sharing, suitable for cloud systems, and we prove that it is computationally secure.   

Publish Year: 2013

Published in: AINA - IEEE

Number of Pages: 8

موضوع: رایانش ابری، امنیت

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان

Decision making with a fuzzy ontology

به نام خدا

Title: Decision making with a fuzzy ontology

Authors: Christer Carlsson Matteo Brunelli Jozsef Mezei

Abstract: Knowledge mobilisation is a transition from theprevailing knowledge management technology that has beenwidely used in industry for the last 20 years to a new meth-odology and some innovative methods for knowledge rep-resentation, formation and development and for knowledgeretrieval and distribution. Knowledge mobilisation aims atcoming to terms with some of the problems of knowledgemanagement and at the same time to introduce new theory,new methods and new technology. More precisely, this paperpresents an outline of a fuzzy ontology as an enhanced ver-sion of classical ontology and demonstrates some advantagesfor practical decision making. We show that a number of softcomputing techniques, e.g. aggregation functions and inter-val valued fuzzy numbers, will support effective and practicaldecision making on the basis of the fuzzy ontology. Wedemonstrate the knowledge mobilisation methods with theconstruction of a support system for finding the best availablewine for a number of wine drinking occasions using a fuzzywine ontology and fuzzy reasoning methods; the supportsystem has been implemented for a Nokia N900 smart phone.   

Publish Year: 2012

Published in: Soft Computing - Springer

Number of Pages: 10

موضوع: منطق فازی، تصمیم گیری

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

 

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان