{"id":"https://openalex.org/W2554282539","doi":"https://doi.org/10.1109/iccsce.2011.6190507","title":"Dynamic programming approach on pipelined optical bus systems for finding the longest upsequence","display_name":"Dynamic programming approach on pipelined optical bus systems for finding the longest upsequence","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2554282539","doi":"https://doi.org/10.1109/iccsce.2011.6190507","mag":"2554282539"},"language":"en","primary_location":{"id":"doi:10.1109/iccsce.2011.6190507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccsce.2011.6190507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Control System, Computing and Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032394614","display_name":"Haklin Kimm","orcid":"https://orcid.org/0009-0008-3764-9256"},"institutions":[{"id":"https://openalex.org/I79060951","display_name":"East Stroudsburg University","ror":"https://ror.org/05atz9219","country_code":"US","type":"education","lineage":["https://openalex.org/I79060951"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haklin Kimm","raw_affiliation_strings":["Computer Science Department, East Stroudsburg University of Pennsylvania, East Stroudsburg, PA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, East Stroudsburg University of Pennsylvania, East Stroudsburg, PA, USA","institution_ids":["https://openalex.org/I79060951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023408593","display_name":"Fenglien Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I80276326","display_name":"University of Guam","ror":"https://ror.org/00376bg92","country_code":"GU","type":"education","lineage":["https://openalex.org/I80276326"]}],"countries":["GU"],"is_corresponding":false,"raw_author_name":"Fenglien Lee","raw_affiliation_strings":["Department of Math and Computer Science, University of Guam, Mangilao, USA"],"affiliations":[{"raw_affiliation_string":"Department of Math and Computer Science, University of Guam, Mangilao, USA","institution_ids":["https://openalex.org/I80276326"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032394614"],"corresponding_institution_ids":["https://openalex.org/I79060951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.34264516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":null,"first_page":"119","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6543004512786865},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5989031791687012},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5364580154418945},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3683466911315918},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33827584981918335},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1363925337791443}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6543004512786865},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5989031791687012},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5364580154418945},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3683466911315918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33827584981918335},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1363925337791443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccsce.2011.6190507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccsce.2011.6190507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Control System, Computing and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W52936072","https://openalex.org/W57241559","https://openalex.org/W1493361730","https://openalex.org/W1641117443","https://openalex.org/W1985108724","https://openalex.org/W2022106822","https://openalex.org/W2056944493","https://openalex.org/W2094100203","https://openalex.org/W2106884141","https://openalex.org/W2108573494","https://openalex.org/W2147543351","https://openalex.org/W2149293575","https://openalex.org/W2166859133","https://openalex.org/W2168874115","https://openalex.org/W2171900452","https://openalex.org/W2993773372","https://openalex.org/W3141922428","https://openalex.org/W6602336045","https://openalex.org/W6764759890"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"dynamic":[3,82],"programming":[4,83],"approach":[5],"is":[6,55,68,104],"applied":[7],"to":[8],"a":[9,23],"pipelined":[10,48,58,86],"optical":[11,49,59,87],"bus":[12,50,60,88],"system":[13,51,89],"for":[14],"finding":[15],"the":[16,74,85,96,105,108],"longest":[17,75,109],"upsequence,":[18],"maximum":[19],"increasing":[20],"sequence":[21],"in":[22],"given":[24],"set":[25],"of":[26,66,90,99,107],"values":[27],"V":[28],"=":[29],"(v":[30],"<sub":[31,36,43],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[32,37,44],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[33],",":[34,39,41],"v":[35,42],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[38],"...":[40],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[45],").":[46],"The":[47],"that":[52,73,93],"we":[53],"apply":[54],"based":[56],"upon":[57],"systems":[61],"on":[62,84],"which":[63],"an":[64],"array":[65],"processors":[67,92],"connected":[69],"linearly.":[70],"We":[71],"show":[72],"upsequence":[76],"can":[77],"be":[78],"found":[79],"by":[80],"applying":[81],"n":[91],"runs":[94],"with":[95],"time":[97],"complexity":[98],"O":[100],"(m),":[101],"where":[102],"m":[103],"length":[106],"upsequence.":[110]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}