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

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

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

دانلود مقاله

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

 

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

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

 

Accelerating Pollard’s Rho Algorithm on Finite Fields

به نام خدا

Title: Accelerating Pollard’s Rho Algorithm on Finite Fields

Authors: Jung Hee Cheon, Jin Hong , and Minkyu Kim

Abstract: Most generic and memory efficient algorithms for solving the discrete logarithm problem construct a certain random graph consisting of group element nodes and return the solution when a collision is found among the graph nodes. In this work, we develop a technique for traveling through the random graph with- out fully computing each node and also provide an extension to the distinguished point collision detection method that is suitable for this new situation. Concrete constructions of this technique for multiplicative subgroups of the finite fields are given. Our implementations confirm that the proposed technique provides practical speedup over existing algorithms.   

Publish Year: 2012

Publisher: Journal of Cryptography - Journal of Springer

Number of Pages: 48

موضوع: میدانهای متناهی، جبر مجرد، رمزنگاری

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

دانلود مقاله

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

 

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

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

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

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

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

دانلود مقاله

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

 

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

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

Mission Assurance Increased with Regression Testing

به نام خدا

Title: Mission Assurance Increased with Regression Testing

Authors: Roland Lang

Abstract: Knowing what to test is an important attribute in any testing campaign, especially when it has to be right or the mission could be in jeopardy. The New Horizons mission, developed and operated by the John Hopkins University Applied Physics Laboratory, received a planned major upgrade to their Mission Operations and Control (MOC) ground system architecture. Early in the mission planning it was recognized that the ground system platform would require an upgrade to assure continued support of technology used for spacecraft operations. With the planned update to the six year operational ground architecture from Solaris 8 to Solaris 10, it was critical that the new architecture maintain critical operations and control functions. The New Horizons spacecraft is heading to its historic rendezvous with Pluto in July 2015 and then proceeding into the Kuiper Belt. This paper discusses the Independent Software Acceptance Testing (ISAT) Regression test campaign that played a critical role to assure the continued success of the New Horizons mission. The New Horizons ISAT process was designed to assure all the requirements were being met for the ground software functions developed to support the mission objectives. The ISAT team developed a test plan with a series of test case designs. The test objectives were to verify that the software developed from the requirements functioned as expected in the operational environment. As the test cases were developed and executed, a regression test suite was identified at the functional level. This regression test suite would serve as a crucial resource in assuring the operational system continued to function as required with such a large scale change being introduced. Some of the New Horizons ground software changes required modifications to the most critical functions of the operational software. Of particular concern was the new MOC architecture (Solaris 10) is Intel based and little end ian, and the legacy architecture (Solaris 8) was SPARC based and big end ian. The presence of byte swap issues that might not have been identified in the required software changes was very real and can be difficult to find. The ability to have test designs that would exercise all major functions and operations was invaluable to assure that critical operations and tools would operate as they had since first operational use. With the longevity of the mission also came the realization that the original ISAT team would not be the people working on the ISAT regression testing. The ability to have access to all original test designs and test results identified in the regression test suite greatly improved the ability to identify not only the expected system behavior, but also the actual behavior with the old architecture.   

Publish Year: 2013

Published in: Aerospace - IEEE

Number of Pages: 8

موضوع: مهندسی نرم افزار، تست نرم افزار، تست مجتمع سازی

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

دانلود مقاله

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

 

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

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