Detaylı Arama

İptal
Bulunan: 27 Adet 0.001 sn
- Eklemek veya çıkarmak istediğiniz kriterleriniz için 'Dahil' / 'Hariç' seçeneğini kullanabilirsiniz. Sorgu satırları birbirine 'VE' bağlacı ile bağlıdır.
- İptal tuşuna basarak normal aramaya dönebilirsiniz.

Filtreler
Araştırmacılar
A genetic algorithm for generating improvised music

Özcan, E. | Erçal, T.

Conference Object | 2008 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4926 LNCS , pp.266 - 277

Genetic art is a recent art form generated by computers based on the genetic algorithms (GAs). In this paper, the components of a GA embedded into a genetic art tool named AMUSE are introduced. AMUSE is used to generate improvised melodies over a musical piece given a harmonic context. Population of melodies is evolved towards a better musical form based on a fitness function that evaluates ten different melodic and rhythmic features. Performance analysis of the GA based on a public evaluation shows that the objectives used by the fitness function are assembled properly and it is a successful artificial intelligence application. © 2 . . .008 Springer-Verlag Berlin Heidelberg Daha fazlası Daha az

Power-aware processors for wireless sensor networks

Küçük, G. | Başaran, C.

Conference Object | 2006 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4263 LNCS , pp.655 - 664

Today, wireless sensor networks (WSNs) enable us to run a new range of applications from habitat monitoring, to military and medical applications. A typical WSN node is composed of several sensors, a radio communication interface, a microprocessor, and a limited power supply. In many WSN applications, such as forest fire monitoring or intruder detection, user intervention and battery replenishment is not possible. Since the battery lifetime is directly related to the amount of processing and communication involved in these nodes, optimal resource usage becomes a major issue. A typical WSN application may sense and process very close . . . or constant data values for long durations, when the environmental conditions are stable. This is a common behavior that can be exploited to reduce the power consumption of WSN nodes. This study combines two orthogonal techniques to reduce the energy dissipation of the processor component of the sensor nodes. First, we briefly discuss silent-store filtering MoteCache. Second, we utilize Content-Aware Data MAnagement (CADMA) on top of MoteCache architecture to achieve further energy savings and performance improvements. The complexity increase introduced by CADMA is also compensated by further complexity reduction in MoteCache. Our optimal configuration reduces the total node energy, and hence increases the node lifetime, by 19.4% on the average across a wide variety of simulated sensor benchmarks. Our complexity-aware configuration with a minimum MoteCache size achieves not only energy savings up to 16.2% but also performance improvements up to 4.3%, on the average. © Springer-Verlag Berlin Heidelberg 2006 Daha fazlası Daha az

Development of a mobile news reader application compatible with in-vehicle infotainment

Kurt, B. | Gören, S.

Conference Object | 2018 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)10995 LNCS , pp.18 - 29

People spend a lot of time behind the wheel every day. Reading newspapers while driving a car is almost impossible. In this work, a mobile news reader application is developed to deliver the latest news from various sources to the drivers. The major difference from other news reader applications is that it is developed in accordance with the Ford SYNC technology. The user will be able to view the latest news on the SYNC screen while driving and listening to the selected news. In addition, drivers can select the desired news source and the desired news with the voice commands. Therefore, our proposed news reader application is an ena . . .bler for the drivers to follow the news in a safe way without distraction while keeping their hands on the wheel and their eyes on the road. © Springer International Publishing AG, part of Springer Nature 2018 Daha fazlası Daha az

Memetic algorithms for nurse rostering

Özean, E.

Conference Object | 2005 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)3733 LNCS , pp.482 - 492

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic operators and a self adaptive violation directed hierarchical hill climbing method are presented based on a previously proposed framework. © Springer-Verlag Berlin Heidelberg 2005.

Duco - Hybrid indoor navigation

Surmeli, C. | Serif, T.

Conference Object | 2016 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)9847 LNCS , pp.256 - 267

This paper proposes an application especially designed for indoor navigation, Duco. A hybrid approach at trying to find a solution to the problem of indoor navigation by mainly utilising pedestrian deadreckoning (PDR) along with the aid of iOS wireless location determination systems to aid the process. Using merely the digital accelerometer and compass sensors of modern smartphones, PDR can reflect location changes in real-time with high-precision while retaining battery life at maximum. An algorithm is utilised to analyse the data from these noisy sensors to enable high success rate of detecting step count. Duco also makes use of w . . .ireless location determination systems to retrieve the initial location where PDR falls short or iBeacons to get around problematic places inside an indoor venue like stairs, elevators or signal dead-zones. © Springer International Publishing Switzerland 2016 Daha fazlası Daha az

Linear linkage encoding in grouping problems: applications on graph coloring and timetabling

Ülker, Ö. | Özcan, E. | Korkmaz, E.E.

Conference Object | 2006 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)3867 LNCS , pp.347 - 363

Linear Linkage Encoding (LLE) is a recently proposed representation scheme for evolutionary algorithms. This representation has been used only in data clustering. However, it is also suitable for grouping problems. In this paper, we investigate LLE on two grouping problems; graph coloring and exam timetabling. Two crossover operators suitable for LLE are proposed and compared to the existing ones. Initial results show that LLE is a viable candidate for grouping problems whenever appropriate genetic operators are used. © Springer-Verlag Berlin Heidelberg 2007.

Detecting Defected Crops: Precision Agriculture Using Haar Classifiers and UAV

Altınbaş, M.D. | Serif, T.

Conference Object | 2019 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)11673 LNCS , pp.27 - 40

According to recent studies, the world’s population has doubled since 1960. Furthermore, some projections indicate that the world’s population could reach more than ten billion in the next half of this century. As the world is getting increasingly crowded, the ever-growing need for resources is rising. It appears that depletion of natural resources will be three times more than current rates by the mid-century. People would not only consume more resources but also will need more agricultural produce for their everyday life. Hence, in order to meet the ever-increasing demand for farming products, yield should be maximized using top-e . . .nd technologies. Precision agriculture is the application of technologies and methods to obtain data driven crop management of the farmland. In the middle of the 1980s, precision farming techniques initially were used for soil analysis using sensors and evolved to advanced applications that makes use of satellites, handheld devices and aerial vehicles. Drones commonly referred as unmanned aerial vehicles (UAVs) and have been extensively adopted in precision farming. Consequently, in the last two decades, 80 to 90% of the precision farming operations employed UAVs. Accordingly, this paper proposes a prototype UAV based solution, which can be used to hover over tomato fields, collect visual data and process them to establish meaningful information that can used by the farmers to maximize their crop. Furthermore, the findings of the proposed system showed that this was viable solution and identified the defected tomatoes with the success rate of 90%. © 2019, Springer Nature Switzerland AG Daha fazlası Daha az

Voice quality improvement with error concealment in audio sensor networks

Turkes, O. | Baydere, S.

Conference Object | 2012 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)7277 LNCS , pp.307 - 314

Multi-dimensional properties of audio data and resource-poor nodes make voice processing and transmission a challenging task for Wireless Sensor Networks (WSN). This study analyzes voice quality distortions caused by packet losses occurring over a multi-hop WSN testbed: A comprehensive analysis of transmitted voice quality is given in a real setup. In the experiments, recorded signals are partitioned into data segments and delivered efficiently at the source. Throughout the network, two reconstruction scenarios are considered for the lost segments: In the first one, a raw projection is applied on voice with no error concealment (V-N . . .C) whereas the latter encodes a simple error concealment (V-EC). It is shown that with an affordable reconstruction, a comprehensible voice can be gathered even when packet error rate is as high as 30%. © 2012 Springer-Verlag Daha fazlası Daha az

Reducing energy dissipation of wireless sensor processors using silent-store-filtering MoteCache

Kucuk, G. | Basaran, C.

Conference Object | 2006 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4148 LNCS , pp.256 - 266

Wireless sensor networks (WSNs) gained increasing interests in recent years; since, they allow wide range of applications from environmental monitoring, to military and medical applications. As most of the sensor nodes (a.k.a. motes) are battery operated, they have limited lifetime, and user intervention is not feasible for most of the WSN applications. This study proposes a technique to reduce the energy dissipation of the processor component of the sensor nodes. We utilize a tiny cache-like structure called MoteCache between the CPU and the SRAM to cache the most recently used data values as well as to filter silent-store instruct . . .ions which write values that exactly match the values that are already stored at the memory address that is being written. A typical WSN application may sense and work on constant data values for long durations, when the environmental conditions are not changing rapidly. This common behavior of WSN applications considerably improves our energy savings. The optimal configuration of MoteCache reduces the total node energy by 24.7% on the average across a variety of simulated sensor benchmarks. The average lifetime of the nodes is also improved by 46% on the average for processor-intensive applications. Using the proposed technique, the lifetime of the nodes that run communication-intensive applications, such as TinyDB and Surge, is also improved as much as 14%. © Springer-Verlag Berlin Heidelberg 2006 Daha fazlası Daha az

Parallel implicit solution of full Navier-Stokes equations

Ünal, V.Ü. | Gülçat, Ü.

Article | 2003 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)2659 , pp.622 - 631

Parallel implicit solution of the incompressible Navier-Stokes equations based on two fractional steps in time and Finite Element discretization in space is presented. The accuracy of the scheme is second order in both time and space domains. Large time step sizes, with CFL numbers much larger than unity, are taken. The Domain Decomposition Technique is implemented for parallel solution of the problem with matching and non-overlapping sub domains. The segregate solution to tempereature field is obtained for the flow case where the forced convection is one order of magnitude higher than the free convection. © Springer-Verlag Berlin H . . .eidelberg 2003 Daha fazlası Daha az

A grouping genetic algorithm using linear linkage encoding for bin packing

Ülker, Ö. | Korkmaz, E.E. | Özcan, E.

Conference Object | 2008 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)5199 LNCS , pp.1140 - 1149

Linear Linkage Encoding (LLE) is a representation method proposed for grouping problems. It has already been used in solving data clustering, graph coloring and timetabling problems based on multi-objective genetic algorithms. In this study, this novel encoding scheme is investigated on bin packing again using a genetic algorithm. Bin packing benchmark problem instances are used to compare the performance of traditional recombination operators and custom made LLE crossover operators which are hybridized with parametrized placement heuristics. The results denote that LLE is a viable candidate for bin packing problem whenever appropri . . .ate genetic operators are chosen. © 2008 Springer-Verlag Berlin Heidelberg Daha fazlası Daha az

Hill climbers and mutational heuristics in hyperheuristics

Özean, E. | Bilgin, B. | Korkmaz, E.E.

Conference Object | 2006 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4193 LNCS , pp.202 - 211

Hyperheuristics are single candidate solution based and simple to maintain mechanisms used in optimization. At each iteration, as a higher level of abstraction, a hyperheuristic chooses and applies one of the heuristics to a candidate solution. In this study, the performance contribution of hill climbing operators along with the mutational heuristics are analyzed in depth in four different hyperheuristic frameworks. Four different hill climbing operators and three mutational operators are used during the experiments. Various subsets of the heuristics are evaluated on fourteen well-known benchmark functions. © Springer-Verlag Berlin . . .Heidelberg 2006 Daha fazlası Daha az

AXSIS - Akademik ve Açık Erişim Bilgi Sistemi'nde arama yaparken:

- Arama alanına arayacağınız kelime veya kelimeleri girin.
- Arama sonucunda gelen listeyi daraltmak için kelime sayısını artırınız. Arama motoru birden fazla kelime varsa ikisininde geçtiği kayıtları getirir.
- Aramalarda büyük-küçük harf ayrımı yoktur. (Dizinler Türkçedir. Türkçe dışındaki kelime aramalarında I karakterinin küçüğünün i olmayacağını aklınızda bulundurunuz.)
- Kelime içinde geçen bazı harflerden emin değilseniz, o karakterin esnek olduğunu belitmek için ?(tek harf), *(çok harf) kullanınız.
- Aramalarda kelime kökü esas alınır. Örnek; kitap kelimesi arandığında kitap, kitaplar, kitaplık, kitabın, kitapçı vb sonuçlar da listelenir.
- Eğer aramanın bire bir eşlenmesi isteniyorsa çift tırnak içide arayınız.
- Aralık aramaları harf ve sayı karışık ise { } karakterleri içinde, Örnek;{başlangıç ... bitiş} eğer aradığınız aralık sayılardan ibaret ise köşeli parantez kullanınız, Örnek;[1926 ... 2015]
- Arama sonuçlarından bazı kelimeleri içeren kayıtları elemek istiyorsanız o kelimenin başına - karakterini yazınız, o kelime geçen kayıtlar listeden elenir.


6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.


Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.