Wikipedia acewiki https://ace.wikipedia.org/wiki/%C3%94n_Keue MediaWiki 1.47.0-wmf.18 first-letter Alat Kusuih Marit Ureuëng Ngui Marit Ureuëng Ngui Wikipedia Marit Wikipedia Beureukaih Marit Beureukaih MediaWiki Marit MediaWiki Seunaleuëk Marit Seunaleuëk Beunantu Marit Beunantu Kawan Marit Kawan TimedText TimedText talk Modul Pembicaraan Modul Acara Pembicaraan Acara 0 1956 158615 109905 2026-09-03T20:05:31Z Summershell67 34148 /* */ 158615 wikitext text/x-wiki [[Beureukaih:North Korea (orthographic projection).svg|jmpl|Peuta Korèa Utara]] [[Beureukaih:Flag of North Korea (March 2026–present).svg|jmpl|Alam Korèa Utara]] [[Beureukaih:Coat of Arms of North Korea.svg|jmpl|Lambang Korèa Utara]] '''Korèa Utara''' nakeuh saboh nanggroe nyang na di utara semenanjung Korea. Nanggroe nyoe meuceue ngön [[Korèa Seulatan]] di seulatan. Dilèe yôh goh Prang Korèa, nanggroe Korèa Utara ngön Korèa Seulatan nakeuh saboh nanggroe. Pham nyang jiamai lé Korèa Utara nakeuh pham [[komunis]]. == Neuweuek wilayah == Korèa Utara geuweuek lam 13 boh wilayah, nyakni 2 banda kusuih ngon 11 boh propinsi. <div class="left"> {| class="wikitable" |- !Peuta !! !! Wilayah^a !! Chosŏn'gŭl !! Nang nanggroe |- |rowspan="15"|{{North Korea Provincial level Labelled Map}} !colspan="5"| Nang nanggroe (''chikhalsi'')^a |- | 1 || [[Pyongyang]] ||평양직할시|| ([[Chung-guyok]]) |- !colspan="5"| Banda kusuih (''teukbyeolsi'')^a |- | 2 || [[Rason]] <cite id = "Ad_1></cite>[[#Ad 2|*]] ||라선특별시|| ([[Rajin-guyok]]) <cite id = "Ad_1></cite>[[#Ad 2|*]] |- !colspan="5"| Propinsi (''do'')^a |- | 3 || [[Pyongan Seulatan]] ||평안남도|| [[Pyongsong]] |- | 4 || [[Pyongan Utara]] ||평안북도|| [[Sinuiju]] |- | 5 || [[Chagang]] ||자강도|| [[Kanggye]] |- | 6 || [[Hwanghae Seulatan]] ||황해남도|| [[Haeju]] |- | 7 || [[Hwanghae Utara]] ||황해북도|| [[Sariwon]] |- | 8 || [[Kangwon]] ||강원도|| [[Wonsan]] |- | 9 || [[Hamgyong Seulatan]] ||함경남도|| [[Hamhung]] |- | 10 || [[Hamgyong Utara]] ||함경북도|| [[Chongjin]] |- | 11 || [[Ryanggang]] <cite id = "Ad_1></cite>[[#Ad 2|*]] ||량강도|| [[Hyesan]] |- | colspan="5"|<cite id="Ad_2></cite>[[#Ad 1|*]]&nbsp;– Lam lugat Seulatan geukheun "Yanggang" (양강), "Nason" (나선), or "Najin" (나진). |} </div> == Banda Rayek == * [[Pyeongyang]] * [[Hamheung]] * [[Cheongjin]] * [[Nampo]] * [[Sinuiju]] * [[Wonsan]] * [[Pyeongseong]] * [[Sariwon]] * [[Anju (banda)|Anju]] * [[Haeju]] * [[Ganggye]] * [[Gimchaek]] * [[Hyesan]] * [[Gaeseong]] * [[Songrim]] * [[Hoeryeong]] {{Commons|North Korea}} [[Kawan:Asia Timu]] lns3xf0qujvby1h81y135y646wrbmgc 828 9482 158614 114488 2026-09-03T12:42:10Z Hamish 19625 Update from [[d:Special:GoToLinkedPage/enwiki/Q15408619|master]] using [[mw:Synchronizer| #Synchronizer]] 158614 Scribunto text/plain ------------------------------------------------------------------------------------ -- TableTools -- -- -- -- This module includes a number of functions for dealing with Lua tables. -- -- It is a meta-module, meant to be called from other Lua modules, and should not -- -- be called directly from #invoke. -- ------------------------------------------------------------------------------------ local libraryUtil = require('libraryUtil') local p = {} -- Define often-used variables and functions. local floor = math.floor local infinity = math.huge local checkType = libraryUtil.checkType local checkTypeMulti = libraryUtil.checkTypeMulti ------------------------------------------------------------------------------------ -- isPositiveInteger -- -- This function returns true if the given value is a positive integer, and false -- if not. Although it doesn't operate on tables, it is included here as it is -- useful for determining whether a given table key is in the array part or the -- hash part of a table. ------------------------------------------------------------------------------------ function p.isPositiveInteger(v) return type(v) == 'number' and v >= 1 and floor(v) == v and v < infinity end ------------------------------------------------------------------------------------ -- isNan -- -- This function returns true if the given number is a NaN value, and false if -- not. Although it doesn't operate on tables, it is included here as it is useful -- for determining whether a value can be a valid table key. Lua will generate an -- error if a NaN is used as a table key. ------------------------------------------------------------------------------------ function p.isNan(v) return type(v) == 'number' and v ~= v end ------------------------------------------------------------------------------------ -- shallowClone -- -- This returns a clone of a table. The value returned is a new table, but all -- subtables and functions are shared. Metamethods are respected, but the returned -- table will have no metatable of its own. ------------------------------------------------------------------------------------ function p.shallowClone(t) checkType('shallowClone', 1, t, 'table') local ret = {} for k, v in pairs(t) do ret[k] = v end return ret end ------------------------------------------------------------------------------------ -- removeDuplicates -- -- This removes duplicate values from an array. Non-positive-integer keys are -- ignored. The earliest value is kept, and all subsequent duplicate values are -- removed, but otherwise the array order is unchanged. ------------------------------------------------------------------------------------ function p.removeDuplicates(arr) checkType('removeDuplicates', 1, arr, 'table') local isNan = p.isNan local ret, exists = {}, {} for _, v in ipairs(arr) do if isNan(v) then -- NaNs can't be table keys, and they are also unique, so we don't need to check existence. ret[#ret + 1] = v elseif not exists[v] then ret[#ret + 1] = v exists[v] = true end end return ret end ------------------------------------------------------------------------------------ -- numKeys -- -- This takes a table and returns an array containing the numbers of any numerical -- keys that have non-nil values, sorted in numerical order. ------------------------------------------------------------------------------------ function p.numKeys(t) checkType('numKeys', 1, t, 'table') local isPositiveInteger = p.isPositiveInteger local nums = {} for k in pairs(t) do if isPositiveInteger(k) then nums[#nums + 1] = k end end table.sort(nums) return nums end ------------------------------------------------------------------------------------ -- affixNums -- -- This takes a table and returns an array containing the numbers of keys with the -- specified prefix and suffix. For example, for the table -- {a1 = 'foo', a3 = 'bar', a6 = 'baz'} and the prefix "a", affixNums will return -- {1, 3, 6}. ------------------------------------------------------------------------------------ function p.affixNums(t, prefix, suffix) checkType('affixNums', 1, t, 'table') checkType('affixNums', 2, prefix, 'string', true) checkType('affixNums', 3, suffix, 'string', true) local function cleanPattern(s) -- Cleans a pattern so that the magic characters ()%.[]*+-?^$ are interpreted literally. return s:gsub('([%(%)%%%.%[%]%*%+%-%?%^%$])', '%%%1') end prefix = prefix or '' suffix = suffix or '' prefix = cleanPattern(prefix) suffix = cleanPattern(suffix) local pattern = '^' .. prefix .. '([1-9]%d*)' .. suffix .. '$' local nums = {} for k in pairs(t) do if type(k) == 'string' then local num = mw.ustring.match(k, pattern) if num then nums[#nums + 1] = tonumber(num) end end end table.sort(nums) return nums end ------------------------------------------------------------------------------------ -- numData -- -- Given a table with keys like {"foo1", "bar1", "foo2", "baz2"}, returns a table -- of subtables in the format -- {[1] = {foo = 'text', bar = 'text'}, [2] = {foo = 'text', baz = 'text'}}. -- Keys that don't end with an integer are stored in a subtable named "other". The -- compress option compresses the table so that it can be iterated over with -- ipairs. ------------------------------------------------------------------------------------ function p.numData(t, compress) checkType('numData', 1, t, 'table') checkType('numData', 2, compress, 'boolean', true) local ret = {} for k, v in pairs(t) do local prefix, num = mw.ustring.match(tostring(k), '^([^0-9]*)([1-9][0-9]*)$') if num then num = tonumber(num) local subtable = ret[num] or {} if prefix == '' then -- Positional parameters match the blank string; put them at the start of the subtable instead. prefix = 1 end subtable[prefix] = v ret[num] = subtable else local subtable = ret.other or {} subtable[k] = v ret.other = subtable end end if compress then local other = ret.other ret = p.compressSparseArray(ret) ret.other = other end return ret end ------------------------------------------------------------------------------------ -- compressSparseArray -- -- This takes an array with one or more nil values, and removes the nil values -- while preserving the order, so that the array can be safely traversed with -- ipairs. ------------------------------------------------------------------------------------ function p.compressSparseArray(t) checkType('compressSparseArray', 1, t, 'table') local ret = {} local nums = p.numKeys(t) for _, num in ipairs(nums) do ret[#ret + 1] = t[num] end return ret end ------------------------------------------------------------------------------------ -- sparseIpairs -- -- This is an iterator for sparse arrays. It can be used like ipairs, but can -- handle nil values. ------------------------------------------------------------------------------------ function p.sparseIpairs(t) checkType('sparseIpairs', 1, t, 'table') local nums = p.numKeys(t) local i = 0 local lim = #nums return function () i = i + 1 if i <= lim then local key = nums[i] return key, t[key] else return nil, nil end end end ------------------------------------------------------------------------------------ -- size -- -- This returns the size of a key/value pair table. It will also work on arrays, -- but for arrays it is more efficient to use the # operator. ------------------------------------------------------------------------------------ function p.size(t) checkType('size', 1, t, 'table') local i = 0 for _ in pairs(t) do i = i + 1 end return i end local function defaultKeySort(item1, item2) -- "number" < "string", so numbers will be sorted before strings. local type1, type2 = type(item1), type(item2) if type1 ~= type2 then return type1 < type2 elseif type1 == 'table' or type1 == 'boolean' or type1 == 'function' then return tostring(item1) < tostring(item2) else return item1 < item2 end end ------------------------------------------------------------------------------------ -- keysToList -- -- Returns an array of the keys in a table, sorted using either a default -- comparison function or a custom keySort function. ------------------------------------------------------------------------------------ function p.keysToList(t, keySort, checked) if not checked then checkType('keysToList', 1, t, 'table') checkTypeMulti('keysToList', 2, keySort, {'function', 'boolean', 'nil'}) end local arr = {} local index = 1 for k in pairs(t) do arr[index] = k index = index + 1 end if keySort ~= false then keySort = type(keySort) == 'function' and keySort or defaultKeySort table.sort(arr, keySort) end return arr end ------------------------------------------------------------------------------------ -- sortedPairs -- -- Iterates through a table, with the keys sorted using the keysToList function. -- If there are only numerical keys, sparseIpairs is probably more efficient. ------------------------------------------------------------------------------------ function p.sortedPairs(t, keySort) checkType('sortedPairs', 1, t, 'table') checkType('sortedPairs', 2, keySort, 'function', true) local arr = p.keysToList(t, keySort, true) local i = 0 return function () i = i + 1 local key = arr[i] if key ~= nil then return key, t[key] else return nil, nil end end end ------------------------------------------------------------------------------------ -- isArray -- -- Returns true if the given value is a table and all keys are consecutive -- integers starting at 1. ------------------------------------------------------------------------------------ function p.isArray(v) if type(v) ~= 'table' then return false end local i = 0 for _ in pairs(v) do i = i + 1 if v[i] == nil then return false end end return true end ------------------------------------------------------------------------------------ -- isArrayLike -- -- Returns true if the given value is iterable and all keys are consecutive -- integers starting at 1. ------------------------------------------------------------------------------------ function p.isArrayLike(v) if not pcall(pairs, v) then return false end local i = 0 for _ in pairs(v) do i = i + 1 if v[i] == nil then return false end end return true end ------------------------------------------------------------------------------------ -- invert -- -- Transposes the keys and values in an array. For example, {"a", "b", "c"} -> -- {a = 1, b = 2, c = 3}. Duplicates are not supported (result values refer to -- the index of the last duplicate) and NaN values are ignored. ------------------------------------------------------------------------------------ function p.invert(arr) checkType("invert", 1, arr, "table") local isNan = p.isNan local map = {} for i, v in ipairs(arr) do if not isNan(v) then map[v] = i end end return map end ------------------------------------------------------------------------------------ -- listToSet -- -- Creates a set from the array part of the table. Indexing the set by any of the -- values of the array returns true. For example, {"a", "b", "c"} -> -- {a = true, b = true, c = true}. NaN values are ignored as Lua considers them -- never equal to any value (including other NaNs or even themselves). ------------------------------------------------------------------------------------ function p.listToSet(arr) checkType("listToSet", 1, arr, "table") local isNan = p.isNan local set = {} for _, v in ipairs(arr) do if not isNan(v) then set[v] = true end end return set end ------------------------------------------------------------------------------------ -- deepCopy -- -- Recursive deep copy function. Preserves identities of subtables. ------------------------------------------------------------------------------------ local function _deepCopy(orig, includeMetatable, already_seen) if type(orig) ~= "table" then return orig end -- already_seen stores copies of tables indexed by the original table. local copy = already_seen[orig] if copy ~= nil then return copy end copy = {} already_seen[orig] = copy -- memoize before any recursion, to avoid infinite loops for orig_key, orig_value in pairs(orig) do copy[_deepCopy(orig_key, includeMetatable, already_seen)] = _deepCopy(orig_value, includeMetatable, already_seen) end if includeMetatable then local mt = getmetatable(orig) if mt ~= nil then setmetatable(copy, _deepCopy(mt, true, already_seen)) end end return copy end function p.deepCopy(orig, noMetatable, already_seen) checkType("deepCopy", 3, already_seen, "table", true) return _deepCopy(orig, not noMetatable, already_seen or {}) end ------------------------------------------------------------------------------------ -- sparseConcat -- -- Concatenates all values in the table that are indexed by a number, in order. -- sparseConcat{a, nil, c, d} => "acd" -- sparseConcat{nil, b, c, d} => "bcd" ------------------------------------------------------------------------------------ function p.sparseConcat(t, sep, i, j) local arr = {} local arr_i = 0 for _, v in p.sparseIpairs(t) do arr_i = arr_i + 1 arr[arr_i] = v end return table.concat(arr, sep, i, j) end ------------------------------------------------------------------------------------ -- length -- -- Finds the length of an array, or of a quasi-array with keys such as "data1", -- "data2", etc., using an exponential search algorithm. It is similar to the -- operator #, but may return a different value when there are gaps in the array -- portion of the table. Intended to be used on data loaded with mw.loadData. For -- other tables, use #. -- Note: #frame.args in frame object always be set to 0, regardless of the number -- of unnamed template parameters, so use this function for frame.args. ------------------------------------------------------------------------------------ function p.length(t, prefix) -- requiring module inline so that [[Module:Exponential search]] which is -- only needed by this one function doesn't get millions of transclusions local expSearch = require("Module:Exponential search") checkType('length', 1, t, 'table') checkType('length', 2, prefix, 'string', true) return expSearch(function (i) local key if prefix then key = prefix .. tostring(i) else key = i end return t[key] ~= nil end) or 0 end ------------------------------------------------------------------------------------ -- inArray -- -- Returns true if searchElement is a member of the array, and false otherwise. -- Equivalent to JavaScript array.includes(searchElement) or -- array.includes(searchElement, fromIndex), except fromIndex is 1 indexed ------------------------------------------------------------------------------------ function p.inArray(array, searchElement, fromIndex) checkType("inArray", 1, array, "table") -- if searchElement is nil, error? fromIndex = tonumber(fromIndex) if fromIndex then if (fromIndex < 0) then fromIndex = #array + fromIndex + 1 end if fromIndex < 1 then fromIndex = 1 end for _, v in ipairs({unpack(array, fromIndex)}) do if v == searchElement then return true end end else for _, v in pairs(array) do if v == searchElement then return true end end end return false end ------------------------------------------------------------------------------------ -- merge -- -- Given the arrays, returns an array containing the elements of each input array -- in sequence. ------------------------------------------------------------------------------------ function p.merge(...) local arrays = {...} local ret = {} for i, arr in ipairs(arrays) do checkType('merge', i, arr, 'table') for _, v in ipairs(arr) do ret[#ret + 1] = v end end return ret end ------------------------------------------------------------------------------------ -- extend -- -- Extends the first array in place by appending all elements from the second -- array. ------------------------------------------------------------------------------------ function p.extend(arr1, arr2) checkType('extend', 1, arr1, 'table') checkType('extend', 2, arr2, 'table') for _, v in ipairs(arr2) do arr1[#arr1 + 1] = v end end return p 4n03zk6kcoeg4gz82mieeh94c1szcjy 828 33738 158616 2026-09-03T22:28:21Z Hamish 19625 [IPE-NEXT] Quick edit imported from [[:w:en:Module:Exponential search]] 158616 Scribunto text/plain -- This module provides a generic exponential search algorithm. require[[strict]] local checkType = require('libraryUtil').checkType local floor = math.floor local function midPoint(lower, upper) return floor(lower + (upper - lower) / 2) end local function search(testFunc, i, lower, upper) if testFunc(i) then if i + 1 == upper then return i end lower = i if upper then i = midPoint(lower, upper) else i = i * 2 end return search(testFunc, i, lower, upper) else upper = i i = midPoint(lower, upper) return search(testFunc, i, lower, upper) end end return function (testFunc, init) checkType('Exponential search', 1, testFunc, 'function') checkType('Exponential search', 2, init, 'number', true) if init and (init < 1 or init ~= floor(init) or init == math.huge) then error(string.format( "invalid init value '%s' detected in argument #2 to " .. "'Exponential search' (init value must be a positive integer)", tostring(init) ), 2) end init = init or 2 if not testFunc(1) then return nil end return search(testFunc, init, 1, nil) end jqqi8l27tb73lglksbukg2g3bzt3fmv 0 33739 158617 2026-09-04T03:36:15Z ~2026-46890-37 34154 Geupeugöt laman ngön asoë ''''Oviul Maruf''' (lahé 3 Disèmber 2007) nakeuh seorang fotografer asal Bangladèsh. Jih geuthee liwat karya seri poto alam geuboh nan ''Botanical Silence''. Hasil karya jih ka geutampilkan bak meubagoe platform seni ngon majalah antarabangsa lagèe ''L'Œil de la Photographie'', ''Collater.al'', ''Byron Magazine'', ngon ''Lenscratch''<ref name="loeil"/><ref name="collateral"/><ref name="byron"/><ref name="lenscratch"/>. == Udeup awai ngon peundidikan == Ov...' 158617 wikitext text/x-wiki '''Oviul Maruf''' (lahé 3 Disèmber 2007) nakeuh seorang fotografer asal Bangladèsh. Jih geuthee liwat karya seri poto alam geuboh nan ''Botanical Silence''. Hasil karya jih ka geutampilkan bak meubagoe platform seni ngon majalah antarabangsa lagèe ''L'Œil de la Photographie'', ''Collater.al'', ''Byron Magazine'', ngon ''Lenscratch''<ref name="loeil"/><ref name="collateral"/><ref name="byron"/><ref name="lenscratch"/>. == Udeup awai ngon peundidikan == Oviul Maruf lahé bak 3 Disèmber 2007 di Distrik Habiganj, Bangladèsh<ref name="worthwhile"/>. Jih ka lheueh peuseuleusai Secondary School Certificate (SSC) bak thōn 2024 ngon Higher Secondary Certificate (HSC) bak thōn 2026 di Jalalabad Cantonment Public School and College, Sylhet<ref name="earth"/><ref name="projonmo"/>. == Karir fotografi == Maruf geupagut buet fotografi yōh thōn 2022. Tema utama bak karya-karya jih nakeuh peunom alam ngon cahya, nyang geugambak lē majalah ''Collater.al'' lagèe "struktur visual abstrak"<ref name="collateral"/><ref name="wallmag"/>. Seri poto jih antara la'ēn: * '''''Botanical Silence''''': saboh seri poto minimalist nyang peufokus bak bentuk struktur bak-bak kayu ngon ōn-ōn<ref name="collateral"/>. == Peunghargaan == * Juara (Champion) – ''Sylhet Environment Summit Photography Competition''<ref name="earth"/><ref name="projonmo"/>. == Referensi == <references> <ref name="projonmo">[https://www.projonmokotha.com/youth/13391/ "তরুণ আলোকচিত্রী মারুফের 'বোটানিক্যাল সাইলেন্স', প্রকৃতির সৌন্দর্যে আন্তর্জাতিক স্বীকৃতি"]. ''Projonmo Kotha'', 28 Agustus 2026.</ref> <ref name="loeil">[https://loeildelaphotographie.com/en/oviul-maruf/ "Oviul Maruf"]. ''The Eye of Photography Magazine'', 30 Mei 2026.</ref> <ref name="earth">[https://earth.org/eo-photographers/oviul-maruf/ "Oviul Maruf"]. ''Earth.Org'', 16 Agustus 2026.</ref> <ref name="collateral">[https://www.collater.al/en/botanical-silence-oviul-maruf-photography/ "The Magic of Botany Through Oviul Maruf's Lens"]. ''Collater.al'', 19 Maret 2026.</ref> <ref name="wallmag">[https://magazine.wallmag.io/long-exposure-through-my-lens-an-interview-with-photographer-oviul-maruf/ "Long Exposure Through My Lens: An Interview with Photographer Oviul Maruf"]. ''Wallmag'', 15 Mei 2026.</ref> <ref name="byron">[https://www.byronmagazine.com/news/botanical-silence "The Quiet Poetry of Flowers"]. ''Byron Magazine'', 16 Agustus 2026.</ref> <ref name="artbeatbuzz">[https://www.artbeatbuzz.com/post/pictures-of-the-week-check-out-the-long-exposure-photos-from-one-of-our-talented-international-read "Pictures of the week: Check out the long exposure photos"]. ''Art Beat Buzz''.</ref> <ref name="worthwhile">[https://www.worthwhile-magazine.com/articles/a-conversation-with-photographer-oviul-maruf "A Conversation with Photographer Oviul Maruf"]. ''Worthwhile Magazine'', 17 Juli 2026.</ref> <ref name="bicoastal">[https://www.bicoastalreview.com/oviulmaruf "Oviul Maruf"]. ''Bicoastal Review'', 16 Agustus 2026.</ref> <ref name="fotografiska">[https://emerging.fotografiska.com/oviulmaruf "Oviul Maruf"]. ''Fotografiska Emerging''.</ref> </references> ljw6fho4vsl4dhw2i5fap7nbttbsgg2 158618 158617 2026-09-04T03:37:24Z ~2026-46890-37 34154 158618 wikitext text/x-wiki '''Oviul Maruf''' (lahé 3 Disèmber 2007) nakeuh seorang fotografer asal Bangladèsh. Jih geuthee liwat karya seri poto alam geuboh nan ''Botanical Silence''. Hasil karya jih ka geutampilkan bak meubagoe platform seni ngon majalah antarabangsa lagèe ''L'Œil de la Photographie'', ''Collater.al'', ''Byron Magazine'', ngon ''Lenscratch''<ref name="loeil"/><ref name="collateral"/><ref name="byron"/><ref name="lenscratch"/>. == Udeup awai ngon peundidikan == Oviul Maruf lahé bak 3 Disèmber 2007 di Distrik Habiganj, Bangladèsh<ref name="worthwhile"/>. Jih ka lheueh peuseuleusai Secondary School Certificate (SSC) bak thōn 2024 ngon Higher Secondary Certificate (HSC) bak thōn 2026 di Jalalabad Cantonment Public School and College, Sylhet<ref name="earth"/><ref name="projonmo"/>. == Karir fotografi == Maruf geupagut buet fotografi yōh thōn 2022. Tema utama bak karya-karya jih nakeuh peunom alam ngon cahya, nyang geugambak lē majalah ''Collater.al'' lagèe "struktur visual abstrak"<ref name="collateral"/><ref name="wallmag"/>. Seri poto jih antara la'ēn: * '''''Botanical Silence''''': saboh seri poto minimalist nyang peufokus bak bentuk struktur bak-bak kayu ngon ōn-ōn<ref name="collateral"/>. == Peunghargaan == * Juara (Champion) – ''Sylhet Environment Summit Photography Competition''<ref name="earth"/><ref name="projonmo"/>. == Referensi == <references> <ref name="projonmo">[https://www.projonmokotha.com/youth/13391/ "তরুণ আলোকচিত্রী মারুফের 'বোটানিক্যাল সাইলেন্স', প্রকৃতির সৌন্দর্যে আন্তর্জাতিক স্বীকৃতি"]. ''Projonmo Kotha'', 28 Agustus 2026.</ref> <ref name="loeil">[https://loeildelaphotographie.com/en/oviul-maruf/ "Oviul Maruf"]. ''The Eye of Photography Magazine'', 30 Mei 2026.</ref> <ref name="earth">[https://earth.org/eo-photographers/oviul-maruf/ "Oviul Maruf"]. ''Earth.Org'', 16 Agustus 2026.</ref> <ref name="collateral">[https://www.collater.al/en/botanical-silence-oviul-maruf-photography/ "The Magic of Botany Through Oviul Maruf's Lens"]. ''Collater.al'', 19 Maret 2026.</ref> <ref name="wallmag">[https://magazine.wallmag.io/long-exposure-through-my-lens-an-interview-with-photographer-oviul-maruf/ "Long Exposure Through My Lens: An Interview with Photographer Oviul Maruf"]. ''Wallmag'', 15 Mei 2026.</ref> <ref name="byron">[https://www.byronmagazine.com/news/botanical-silence "The Quiet Poetry of Flowers"]. ''Byron Magazine'', 16 Agustus 2026.</ref> <ref name="artbeatbuzz">[https://www.artbeatbuzz.com/post/pictures-of-the-week-check-out-the-long-exposure-photos-from-one-of-our-talented-international-read "Pictures of the week: Check out the long exposure photos"]. ''Art Beat Buzz''.</ref> <ref name="worthwhile">[https://www.worthwhile-magazine.com/articles/a-conversation-with-photographer-oviul-maruf "A Conversation with Photographer Oviul Maruf"]. ''Worthwhile Magazine'', 17 Juli 2026.</ref> <ref name="bicoastal">[https://www.bicoastalreview.com/oviulmaruf "Oviul Maruf"]. ''Bicoastal Review'', 16 Agustus 2026.</ref> </references> t9hqgz1zo4d1ienpl3pqplnlfsqv4kx 158619 158618 2026-09-04T03:39:02Z ~2026-46890-37 34154 158619 wikitext text/x-wiki '''Oviul Maruf''' (lahé 3 Disèmber 2007) nakeuh seorang fotografer asal Bangladèsh. Jih geuthee liwat karya seri poto alam geuboh nan ''Botanical Silence''. Hasil karya jih ka geutampilkan bak meubagoe platform seni ngon majalah antarabangsa lagèe ''L'Œil de la Photographie'', ''Collater.al'', ''Byron Magazine'', ngon ''Lenscratch''<ref name="loeil"/><ref name="collateral"/><ref name="byron"/><ref name="lenscratch"/>. == Udeup awai ngon peundidikan == Oviul Maruf lahé bak 3 Disèmber 2007 di Distrik Habiganj, Bangladèsh<ref name="worthwhile"/>. Jih ka lheueh peuseuleusai Secondary School Certificate (SSC) bak thōn 2024 ngon Higher Secondary Certificate (HSC) bak thōn 2026 di Jalalabad Cantonment Public School and College, Sylhet<ref name="earth"/><ref name="projonmo"/>. == Karir fotografi == Maruf geupagut buet fotografi yōh thōn 2022. Tema utama bak karya-karya jih nakeuh peunom alam ngon cahya, nyang geugambak lē majalah ''Collater.al'' lagèe "struktur visual abstrak"<ref name="collateral"/><ref name="wallmag"/>. Seri poto jih antara la'ēn: * '''''Botanical Silence''''': saboh seri poto minimalist nyang peufokus bak bentuk struktur bak-bak kayu ngon ōn-ōn<ref name="collateral"/>. == Peunghargaan == * Juara (Champion) – ''Sylhet Environment Summit Photography Competition''<ref name="earth"/><ref name="projonmo"/><ref>https://emerging.fotografiska.com/oviulmaruf emerging fotografiska approved profile oviul maruf</ref>. == Referensi == <references> <ref name="projonmo">[https://www.projonmokotha.com/youth/13391/ "তরুণ আলোকচিত্রী মারুফের 'বোটানিক্যাল সাইলেন্স', প্রকৃতির সৌন্দর্যে আন্তর্জাতিক স্বীকৃতি"]. ''Projonmo Kotha'', 28 Agustus 2026.</ref> <ref name="loeil">[https://loeildelaphotographie.com/en/oviul-maruf/ "Oviul Maruf"]. ''The Eye of Photography Magazine'', 30 Mei 2026.</ref> <ref name="earth">[https://earth.org/eo-photographers/oviul-maruf/ "Oviul Maruf"]. ''Earth.Org'', 16 Agustus 2026.</ref> <ref name="collateral">[https://www.collater.al/en/botanical-silence-oviul-maruf-photography/ "The Magic of Botany Through Oviul Maruf's Lens"]. ''Collater.al'', 19 Maret 2026.</ref> <ref name="wallmag">[https://magazine.wallmag.io/long-exposure-through-my-lens-an-interview-with-photographer-oviul-maruf/ "Long Exposure Through My Lens: An Interview with Photographer Oviul Maruf"]. ''Wallmag'', 15 Mei 2026.</ref> <ref name="byron">[https://www.byronmagazine.com/news/botanical-silence "The Quiet Poetry of Flowers"]. ''Byron Magazine'', 16 Agustus 2026.</ref> <ref name="artbeatbuzz">[https://www.artbeatbuzz.com/post/pictures-of-the-week-check-out-the-long-exposure-photos-from-one-of-our-talented-international-read "Pictures of the week: Check out the long exposure photos"]. ''Art Beat Buzz''.</ref> <ref name="worthwhile">[https://www.worthwhile-magazine.com/articles/a-conversation-with-photographer-oviul-maruf "A Conversation with Photographer Oviul Maruf"]. ''Worthwhile Magazine'', 17 Juli 2026.</ref> <ref name="bicoastal">[https://www.bicoastalreview.com/oviulmaruf "Oviul Maruf"]. ''Bicoastal Review'', 16 Agustus 2026.</ref> </references> pbluxrwu9j74f6ask8pug19vc0z8y1b 0 33740 158620 2026-09-04T08:27:24Z Si Gam 4266 peugöt barô 158620 wikitext text/x-wiki {{Infobox spesies}} '''Beuradén''' (Latèn: ''Caryota mitis'') saboh jeunèh [[bak kayèe]] nyang rôh lam ai [[Arecaceae]]. Bak kayèe nyoe udép di [[Asia Tunong]] ngon [[Asia Teunggara]]. == Udép == Bak kayèe nyoe udép bak uteuen ujeuen data meuyub hingga manyang 1.500 ateueh muka laôt. Timoh bak dairah nyang teutôp bacut, umumjih na di yup cheue bak kayèe. Udép cit bak tanoh kliet, anoe, leumpung ngon drainase nyang göt. [[Kawan:Arecaceae]] sqje7mrgbx8w8i89l3u52xtvmun2wia 158621 158620 2026-09-04T09:26:35Z Si Gam 4266 /* Udép */ 158621 wikitext text/x-wiki {{Infobox spesies}} '''Beuradén''' (Latèn: ''Caryota mitis'') saboh jeunèh [[bak kayèe]] nyang rôh lam ai [[Arecaceae]]. Bak kayèe nyoe udép di [[Asia Tunong]] ngon [[Asia Teunggara]]. == Udép == Bak kayèe nyoe udép bak uteuen ujeuen data meuyub hingga manyang 1.500 ateueh muka laôt. Timoh bak dairah nyang teutôp bacut, umumjih na di yup cheue bak kayèe. Udép cit bak tanoh kliet, anoe, leumpung ngon drainase nyang göt. == Bangon == Ukheue bak beuradén meuseurabôt, bakjih meupeureudèe, cöt, utomjih na stolon meuôn. Ôn meusirép ganda, beuntukjih lagèe iku eungkôt, tangké wareuna ijô ngön panyang 50-100 cm. Aneuk ônjih bangon lagèe keutupat, kayém asimetris ngön seunipat 7-25 cm x 2,5-15 cm, ngön ujông ôn tincu. [[Kawan:Arecaceae]] bcnbycazsjee417iob2ac98iwvf3z2o 158622 158621 2026-09-04T09:28:11Z Si Gam 4266 158622 wikitext text/x-wiki {{Infobox spesies}} '''Beuradén''' (Latèn: ''Caryota mitis'') saboh jeunèh [[bak kayèe]] nyang rôh lam ai [[Arecaceae]]. Bak kayèe nyoe udép di [[Asia Tunong]] ngon [[Asia Teunggara]]. == Udép == Bak kayèe nyoe udép bak uteuen ujeuen data meuyub hingga manyang 1.500 ateueh muka laôt. Timoh bak dairah nyang teutôp bacut, umumjih na di yup cheue bak kayèe. Udép cit bak tanoh kliet, anoe, leumpung ngon drainase nyang göt. == Bangon == Ukheue bak beuradén meuseurabôt, bakjih meupeureudèe, cöt, utomjih na stolon meuôn. Ôn meusirép ganda, beuntukjih lagèe iku eungkôt, tangké wareuna ijô ngön panyang 50-100 cm. Aneuk ônjih bangon lagèe keutupat, kayém asimetris ngön seunipat 7-25 cm x 2,5-15 cm, ngön ujông ôn tincu. == Asai == * [https://www.socfindoconservation.co.id/plant/470 Palem Saray] [[Kawan:Arecaceae]] auw8xqgpdcxzax9ozpmoqhserl10uhs 158623 158622 2026-09-04T10:13:03Z Si Gam 4266 /* Bangon */ 158623 wikitext text/x-wiki {{Infobox spesies}} '''Beuradén''' (Latèn: ''Caryota mitis'') saboh jeunèh [[bak kayèe]] nyang rôh lam ai [[Arecaceae]]. Bak kayèe nyoe udép di [[Asia Tunong]] ngon [[Asia Teunggara]]. == Udép == Bak kayèe nyoe udép bak uteuen ujeuen data meuyub hingga manyang 1.500 ateueh muka laôt. Timoh bak dairah nyang teutôp bacut, umumjih na di yup cheue bak kayèe. Udép cit bak tanoh kliet, anoe, leumpung ngon drainase nyang göt. == Bangon == Ukheue bak beuradén meuseurabôt, bakjih meupeureudèe, cöt, utomjih na stolon meuôn. Ôn meusirép ganda, beuntukjih lagèe iku eungkôt, tangké wareuna ijô ngön panyang 50-100 cm. Aneuk ônjih bangon lagèe keutupat, kayém asimetris ngön seunipat 7-25 cm x 2,5-15 cm, ngön ujông ôn tincu. Bungong teususôn meuputa, meutumpôk, wareuna meuneung mirah, jumeulah bagian bungong meutingkat lapan. Bungong meungklèh antara bungong agam ngön inong. Tangké bungong meuleungkông, bungong meucabeueng, panyang cabeueng 25-45 cm. == Asai == * [https://www.socfindoconservation.co.id/plant/470 Palem Saray] [[Kawan:Arecaceae]] kx2fjjl2zd82mnyls9jzd7ees0nxpy7 158624 158623 2026-09-04T10:29:21Z Si Gam 4266 /* Bangon */ 158624 wikitext text/x-wiki {{Infobox spesies}} '''Beuradén''' (Latèn: ''Caryota mitis'') saboh jeunèh [[bak kayèe]] nyang rôh lam ai [[Arecaceae]]. Bak kayèe nyoe udép di [[Asia Tunong]] ngon [[Asia Teunggara]]. == Udép == Bak kayèe nyoe udép bak uteuen ujeuen data meuyub hingga manyang 1.500 ateueh muka laôt. Timoh bak dairah nyang teutôp bacut, umumjih na di yup cheue bak kayèe. Udép cit bak tanoh kliet, anoe, leumpung ngon drainase nyang göt. == Bangon == Ukheue bak beuradén meuseurabôt, bakjih meupeureudèe, cöt, utomjih na stolon meuôn. Ôn meusirép ganda, beuntukjih lagèe iku eungkôt, tangké wareuna ijô ngön panyang 50-100 cm. Aneuk ônjih bangon lagèe keutupat, kayém asimetris ngön seunipat 7-25 cm x 2,5-15 cm, ngön ujông ôn tincu. Bungong teususôn meuputa, meutumpôk, wareuna meuneung mirah, jumeulah bagian bungong meutingkat lapan. Bungong meungklèh antara bungong agam ngön inong. Tangké bungong meuleungkông, bungong meucabeueng, panyang cabeueng 25-45 cm. Boh beuradén bangonjih bunta, ijô yôh mantöng muda, lheueh nyan meuubah jeuet keu mirah seupôt atawa kunèng 'oh ka masak, diameter 7-15 cm. == Asai == * [https://www.socfindoconservation.co.id/plant/470 Palem Saray] [[Kawan:Arecaceae]] n67rprmcq7zw7o9bopk0jo7sx1n9f5u