سفارش تبلیغ
صبا ویژن
هرکس که در آسمان و زمین است ـ حتی ماهیان دریا ـ برای جویای دانش آمرزش می طلبند . [پیامبر خدا صلی الله علیه و آله]
لوگوی وبلاگ
 

دسته بندی موضوعی یادداشتها
 
دانلود رایگان مقاله ISI ، دانلود مقالات IEEE ، دانلود رایگان مقاله IEEE ، دانلود مقاله ، دانلود مقالات ISI ، دانلود رایگان مقاله ACM ، دنلود مقالات ISI ، دانلود رایگان مقاله Science Direct ، دانلود رایگان مقاله از ACM ، دانلود رایگان مقالات مهندسی ، دانلود رایگان مقالات ACM ، دانلود رایگان مقاله مهندسی ، دانلود رایگان مقالات IEEE ، دانلود رایگان مقاله Springer ، دانلود رایگان مقاله آی اس آی ، دانلود مقالات آی اس آی ، دانلود مقاله آی اس آی ، یوزرنیم و پسورد دانشگاه های معتبر ، دانلود مقاله از IEEE ، دانلود رایگان مقالات آی اس آی ، دانلود رایگان مقاله ، دانلود ، یوزرنیم و پسورد سایتهای علمی ، دانلود رایگان مقالات ISI ، دانلود رایگان مقاله Science Direc ، دانلود رایگان ، دانلود رایگان مقالا ، دانلود رایگان مقالات IEEE، دانلود رایگان مقالات ISI، دانلود مقال ، Free ISI Paper Download ، ISI Paper Download ، Paper Download ، انلود رایگان مقالات IEEE ، دانلود رایگان مقالات مهندسی. دانلود رایگان مقاله Springer. دانلو ، دانلود مقاله ISI ، رایگان مقالات ACM ، و پسورد سایتهای علمی ، یوزرنیم ، دانلود مقالات آی ، دانلود مقالات IEEE, دنلود مقالات ISI, دانلود رایگان مقاله IEEE, ، دانلود، مقاله، ISI، 2013، رایانش فراگیر ،

آمار و اطلاعات

بازدید امروز :26
بازدید دیروز :30
کل بازدید :255783
تعداد کل یاداشته ها : 160
103/2/10
5:30 ع

به نام خدا

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 asmodiï¬?cation 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

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

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

دانلود مقاله

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

 

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

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

 

 

 


92/4/27::: 10:1 ص
نظر()
  

به نام خدا

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

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

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

دانلود مقاله

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

 

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

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

 

 


  

به نام  خدا

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

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

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

دانلود مقاله

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

 

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

 

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


  

به نام خدا

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

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

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

دانلود مقاله

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

 

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

 

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


92/4/20::: 8:46 ص
نظر()
  

به نام خدا

Title: Path Planning and Ground Control Station Simulator for UAV

Authors: Alain AJAMI, JeanFrancois BALMAT, JeanPaul GAUTHIER, Thibault MAILLOT

Abstract: In this paper we present a Universal and Interoper-able Ground Control Station (UIGCS) simulator for fixed androtary wing Unmanned Aerial Vehicles (UAVs), and all types ofpayloads. One of the major constraints is to operate and man-age multiple legacy and future UAVs, taking into account thecompliance with NATO Combined/Joint Services OperationalEnvironment (STANAG 4586). Another purpose of the station isto assign the UAV a certain degree of autonomy, via autonomousplanification/replanification strategies. The paper is organizedas follows.In Section 2, we describe the non-linear models of the fixed androtary wing UAVs that we use in the simulator.In Section 3, we describe the simulator architecture, which isbased upon interacting modules programmed independently.This simulator is linked with an open source flight simulator, tosimulate the video flow and the moving target in 3D. To concludethis part, we tackle briefly the problem of the Matlab/Simulinksoftware connection (used to model the UAV_s dynamic) with thesimulation of the virtual environment.Section 5 deals with the control module of a flight path of theUAV. The control system is divided into four distinct hierarchicallayers: flight path, navigation controller, autopilot and flightcontrol surfaces controller.In the Section 6, we focus on the trajectory planifica-tion/replanification question for fixed wing UAV. Indeed, one ofthe goals of this work is to increase the autonomy of the UAV. Wepropose two types of algorithms, based upon 1) the methods ofthe tangent and 2) an original Lyapunov-type method. Thesealgorithms allow either to join a fixed pattern or to track amoving target.Finally, Section 7 presents simulation results obtained on oursimulator, concerning a rather complicated scenario of mission.   

Publish Year: 2013

Published in: Aerospace - IEEE

Number of Pages: 13

موضوع: مهندسی هوافضا

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

دانلود مقاله

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

 

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

 

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


  
<      1   2   3   4   5   >>   >