{"id":"https://openalex.org/W2091549862","doi":"https://doi.org/10.1109/icdcsw.2004.1284075","title":"An efficient scheduling method for query-set-based broadcasting in mobile environments","display_name":"An efficient scheduling method for query-set-based broadcasting in mobile environments","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2091549862","doi":"https://doi.org/10.1109/icdcsw.2004.1284075","mag":"2091549862"},"language":"en","primary_location":{"id":"doi:10.1109/icdcsw.2004.1284075","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdcsw.2004.1284075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.","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/A5100840449","display_name":"Ye\u2010In Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ye-In Chang","raw_affiliation_strings":["Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan","Dept. of Comput. Sci. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]},{"raw_affiliation_string":"Dept. of Comput. Sci. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108495890","display_name":"Wu-Han Hsieh","orcid":null},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wu-Han Hsieh","raw_affiliation_strings":["Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan","Dept. of Comput. Sci. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]},{"raw_affiliation_string":"Dept. of Comput. Sci. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100840449"],"corresponding_institution_ids":["https://openalex.org/I142974352"],"apc_list":null,"apc_paid":null,"fwci":2.3672,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91359053,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"478","last_page":"483"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8577625751495361},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.645237147808075},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.5657277703285217},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49169331789016724},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.320314884185791},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1691311001777649},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14287954568862915},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11799794435501099},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08291521668434143}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8577625751495361},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.645237147808075},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.5657277703285217},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49169331789016724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.320314884185791},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1691311001777649},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14287954568862915},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11799794435501099},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08291521668434143}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdcsw.2004.1284075","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdcsw.2004.1284075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1506285740","https://openalex.org/W1972292974","https://openalex.org/W2069491401","https://openalex.org/W2104669433","https://openalex.org/W2104740463","https://openalex.org/W2104945950","https://openalex.org/W2122296645","https://openalex.org/W2149921886","https://openalex.org/W2169061381","https://openalex.org/W2976445918","https://openalex.org/W3157936914","https://openalex.org/W6675927217"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655","https://openalex.org/W2359140296"],"abstract_inverted_index":{"Most":[0],"of":[1],"the":[2,49,61,83,88,95,98,115],"previous":[3,89],"researches":[4],"assume":[5],"that":[6],"each":[7],"mobile":[8,20],"client":[9,21],"needs":[10],"only":[11],"one":[12,26],"data":[13,27,62],"item.":[14,28],"However,":[15],"in":[16,87],"many":[17],"situations,":[18],"a":[19],"might":[22],"need":[23],"more":[24],"than":[25,101],"In":[29],"this":[30],"paper,":[31],"we":[32,77],"propose":[33],"an":[34],"efficient":[35],"scheduling":[36],"method":[37,46],"for":[38],"query-set-based":[39],"broadcasting,":[40],"which":[41,67],"integrates":[42],"with":[43,97],"query":[44,109],"expansion":[45],"(QEM)":[47],"and":[48,103,111],"mining":[50,55],"association":[51,56],"rules":[52,57],"technique.":[53],"The":[54],"can":[58,93],"globally":[59],"find":[60],"item":[63],"sets":[64],"(large":[65],"itemsets)":[66],"are":[68],"requested":[69],"by":[70],"clients":[71],"frequently.":[72],"From":[73],"our":[74,91],"simulation":[75],"results,":[76],"show":[78],"that,":[79],"as":[80],"compared":[81],"to":[82,114],"local":[84],"optimal":[85],"approach":[86],"methods,":[90],"improved-QEM":[92],"construct":[94],"schedule":[96],"smaller":[99],"TQD":[100,106],"QEM":[102],"modified-QEM,":[104],"where":[105],"denotes":[107],"total":[108],"distance":[110],"is":[112],"proportional":[113],"average":[116],"access":[117],"time.":[118]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}