{"id":186,"date":"2021-03-19T14:02:57","date_gmt":"2021-03-19T05:02:57","guid":{"rendered":"https:\/\/orsj.org\/queue\/?page_id=186"},"modified":"2021-03-19T14:03:51","modified_gmt":"2021-03-19T05:03:51","slug":"quesym2000","status":"publish","type":"page","link":"https:\/\/orsj.org\/queue\/symposium\/quesym_history\/quesym2000\/","title":{"rendered":"2000\u5e74\u5ea6(\u7b2c19\u56de)\u5f85\u3061\u884c\u5217\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0"},"content":{"rendered":"<p>    <center><\/p>\n<h2>2000\u5e74\u5ea6\uff08\u7b2c19\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0<br \/>\n      &#8220;\u60c5\u5831\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u65b0\u3057\u3044\u6027\u80fd\u8a55\u4fa1\u6cd5\u306b\u95a2\u3059\u308b\u7dcf\u5408\u7684\u7814\u7a76&#8221;<\/h2>\n<p>      \u65e5\u6642: 2001\u5e741\u670822-24\u65e5<br \/>\n      \u5834\u6240: \u7cbe\u83ef\u753a\u30fb\u3051\u3044\u306f\u3093\u306a\u30d7\u30e9\u30b6<br \/>\n      \u65e5\u672c\uff2f\uff32\u5b66\u4f1a\u5275\u7acb40\u5468\u5e74\u8a18\u5ff5\u4e8b\u696d\u7279\u5225\u7814\u7a76\u52a9\u6210\u30d7\u30ed\u30b8\u30a7\u30af\u30c8<br \/>\n      \u5b9f\u884c\u59d4\u54e1\u9577: \u9006\u702c\u5ddd \u6d69\u5b5d\uff08\u65e9\u7a32\u7530\u5927\u5b66\uff09<br \/>\n    <\/center><\/p>\n<hr>\n<ul>\n<li>Markov modulated fluid queues with batch fluid arrivals<br \/>\n\t<br \/>\u9ad8\u7530 \u5bdb\u4e4b\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Moment calculating algorithm for busy-period of discrete-time M\/G\/1 type queue and its applications<br \/>\n\t<br \/>\u592a\u7530 \u80fd\uff0c\u68ee\u4e95 \u660c\u514b\uff08\u5fb3\u5cf6\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Asymptotic behavior of the stationary joint queue length distribution in two-node Markovian queueing Systems<br \/>\n\t<br \/>\u52a0\u85e4 \u61b2\u4e00\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Bernoulli \u51e6\u7406\u65b9\u5f0f\u306e\u4e0b\u3067\u4e8c\u3064\u306e\u5f85\u3061\u884c\u5217\u3092\u6301\u3064\u30dc\u30fc\u30ea\u30f3\u30b0\u30b7\u30b9\u30c6\u30e0\u306e\u5927\u504f\u5dee\u89e3\u6790<br \/>\n\t<br \/>\u99ae \u5049\uff0c\u5b89\u9054 \u516c\u4e00\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\uff0c\u5c0f\u548c\u7530 \u6b63\uff08\u6919\u5c71\u5973\u5b66\u5712\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal wavelength converter placement in optical networks by a genetic algorithm<br \/>\n\t<br \/>Johannes Hamonangan Siregar\uff0c\u9ad8\u6728 \u82f1\u660e\uff0c\u5f35 \u52c7\u5175\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Link sizing by observation of carried traffic on the internet<br \/>\n\t<br \/>\u8c4a\u6cc9 \u6d0b\uff08\u4f1a\u6d25\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Pareto optimal for signal control in alternating traffic systems<br \/>\n\t<br \/>\u5c71\u4e0b \u82f1\u660e\uff08\u6771\u5317\u5927\u5b66\uff09\uff0c\u77f3\u585a \u967d\uff08\u4e0a\u667a\u5927\u5b66\uff09\uff0c\u9234\u6728 \u8aa0\u9053\uff08\u5343\u8449\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A unified approach to the proportional relation for discrete-time single-Server queues<br \/>\n\t<br \/>\u4e09\u597d \u76f4\u4eba\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\uff0c\u77f3\u5d0e \u6587\u96c4\uff08\u5357\u5c71\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Dynamic programming type solution for a simple packet flow control model<br \/>\n\t<br \/>\u5c0f\u6ca2 \u5229\u4e45\uff08\u99d2\u6fa4\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u4ed5\u4e8b\u7d42\u4e86\u78ba\u7387\u6700\u5927\u5316\u3092\u76ee\u7684\u3068\u3057\u305f\u5f85\u3061\u884c\u5217\u53c2\u5165\u554f\u984c<br \/>\n\t<br \/>\u5c0f\u67f3 \u6df3\u4e8c\uff0c\u6cb3\u5408 \u4e00\uff08\u9ce5\u53d6\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Parallel fluid queues with constant inflows and simultaneous random reductions<br \/>\n\t<br \/>Offer Kella\uff08Hebrew University of Jerusalem\uff09\uff0c\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On the stability of a batch clearing system with Poisson arrivals and subadditive service times<br \/>\n\t<br \/>David Aldous\uff08University of California\uff0cBerkeley\uff09\uff0c\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\uff0cTomasz Rolski\uff08Wroclaw University\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Conjectures on decay rates of tail probabilities in the generalized Jackson and related networks<br \/>\n\t<br \/>\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u7bb8\u4e26\u3073\u3068 Fork \u4e26\u3073\u3068\u306e\u8a55\u4fa1<br \/>\n\t<br \/>\u77f3\u5ddd \u660e\u5f66\uff08\u5ca9\u624b\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Subexponential asymptotics of the waiting time distribution in a single-server queue with multiple Markovian arrival streams<br \/>\n\t<br \/>\u6edd\u6839 \u54f2\u54c9\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30a4\u30f3\u30bf\u30fc\u30cd\u30c3\u30c8\u96fb\u8a71\u306e\u54c1\u8cea\u8a55\u4fa1\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u9ad8\u91ce \u6b63\u6b21\uff08NTT\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u540c\u671f\u578b\u5165\u529b\u3092\u3082\u3064\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306e\u51fa\u529b\u904e\u7a0b\u306b\u95a2\u3059\u308b Aggregation \u8fd1\u4f3c<br \/>\n\t<br \/>\u9ad8\u6a4b \u7f8e\u4f50\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6b69\u884c\u6319\u52d5\u30e2\u30c7\u30eb\u3068\u30b7\u30df\u30e5\u30ec\u30fc\u30b7\u30e7\u30f3<br \/>\n\t<br \/>\u548c\u7530 \u525b\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30a6\u30a3\u30f3\u30c9\u30a6\u30fb\u30d5\u30ed\u30fc\u578b\u6d41\u4f53\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306e\u30b7\u30df\u30e5\u30ec\u30fc\u30b7\u30e7\u30f3\u3068\u611f\u5ea6\u5206\u6790<br \/>\n\t<br \/>\u5ca9\u5d0e \u5927\u5fd7\uff0c\u4e09\u597d \u76f4\u4eba\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>EM \u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u306b\u3088\u308b MMPP \u30d1\u30e9\u30e1\u30fc\u30bf\u306e\u63a8\u5b9a\u3068\u305d\u306e\u5fdc\u7528<br \/>\n\t<br \/>\u5c0f\u6cc9 \u79c0\u667a\uff0c\u4e2d\u5ddd \u5065\u6cbb\uff08\u9577\u5ca1\u6280\u8853\u79d1\u5b66\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal call admission control for voice and data traffic in mobile communication networks<br \/>\n\t<br \/>\u5927\u898b\u5ddd \u7a14\uff0c\u9ad8\u6728 \u82f1\u660e\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Markov \u9023\u9396\u3092\u7528\u3044\u305f\u30a6\u30a7\u30c3\u30d6\u30ca\u30d3\u30b2\u30fc\u30b7\u30e7\u30f3\u904e\u7a0b\u306e\u8a55\u4fa1<br \/>\n\t<br \/>\u5c71\u672c \u54f2\u751f\uff08\u7b51\u6ce2\u5927\u5b66\uff09\uff0c\u5317\u5cf6 \u5b97\u96c4\uff08\u5de5\u696d\u6280\u8853\u9662\uff09\uff0c\u9ad8\u6728 \u82f1\u660e\uff0c\u5f35 \u52c7\u5175\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u4ed8\u52a0\u7684\u30b5\u30fc\u30d3\u30b9\u3092\u3082\u3064 M\/G\/1 \u5f85\u3061\u884c\u5217\u306e\u6700\u9069\u30b5\u30fc\u30d3\u30b9\u554f\u984c<br \/>\n\t<br \/>\u5c0f\u5bfa \u667a\u4e4b\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6642\u9593\u5236\u9650\u5f0f\u30b5\u30fc\u30d3\u30b9\u306e\u5de1\u56de\u578b\u5f85\u3061\u884c\u5217\u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b\u6700\u9069\u5316\u554f\u984c\u3068\u9045\u5ef6\u63fa\u3089\u304e\u7279\u6027<br \/>\n\t<br \/>\u4e09\u6d66 \u5065\u592a\u90ce\uff0c\u5c0f\u6797 \u9999\uff0c\u7247\u5c71 \u52c1\uff08\u5bcc\u5c71\u770c\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30d0\u30fc\u30b9\u30c8\u30c8\u30e9\u30d2\u30c3\u30af\u5236\u5fa1\u65b9\u5f0f\u306e\u8fd1\u4f3c\u89e3\u6790<br \/>\n\t<br \/>\u6cb3\u897f \u61b2\u4e00\uff08NTT\uff09\uff0c\u9ad8\u6a4b \u656c\u9686\uff08\u65e9\u7a32\u7530\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>VBR \u30b5\u30fc\u30d3\u30b9\u3068 UBR \u30b5\u30fc\u30d3\u30b9\u304c\u5171\u5b58\u3059\u308b\u30cd\u30c3\u30c8\u30ef\u30fc\u30af<br \/>\n\t<br \/>\u753a\u539f \u6587\u660e\uff0c\u9752\u91ce \u88d5\u4e00\uff08\u6771\u4eac\u96fb\u6a5f\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u591a\u91cd\u5316 TCP\/IP \u30c8\u30e9\u30d2\u30c3\u30af\u306e\u30b9\u30b1\u30fc\u30ea\u30f3\u30b0\u7279\u6027\u3092\u8003\u616e\u3057\u305f\u30e2\u30c7\u30eb\u5316\u624b\u6cd5\u306e\u4e00\u8003\u5bdf<br \/>\n\t<br \/>\u53e4\u5c4b \u88d5\u898f\uff08KDD\u7814\u7a76\u6240\uff09\uff0c\u5965\u6751 \u7950\u5247\uff08\u65e9\u7a32\u7530\u5927\u5b66\uff09\uff0c\u798f\u5d8b \u6b63\u6a5f\uff0c\u4e2d\u6751 \u5143\uff08KDD\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A MAP with a tree structure and spectral methods<br \/>\n\t<br \/>\u897f\u6751 \u5f70\u4e00\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u96e2\u6563\u578b\u78ba\u7387\u5206\u5e03\u306e\u88fe\u306e\u6307\u6570\u7684\u6e1b\u5c11\u30ec\u30fc\u30c8\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u4e2d\u5ddd \u5065\u6cbb\uff08\u9577\u5ca1\u6280\u8853\u79d1\u5b66\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u5f85\u3061\u884c\u5217\u306b\u304a\u3051\u308b\u5206\u5e03\u306e\u7dda\u5f62\u8868\u73fe\u3068\u305d\u306e\u5fdc\u7528<br \/>\n\t<br \/>\u4e2d\u585a \u5229\u76f4\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30a4\u30f3\u30bf\u30fc\u30cd\u30c3\u30c8\u306b\u304a\u3051\u308b\u8a08\u6e2c\u3068\u5236\u5fa1<br \/>\n\t<br \/>\u6751\u7530 \u6b63\u5e78\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30bd\u30d5\u30c8\u30a6\u30a7\u30a2\u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b\u6700\u9069\u30ec\u30b8\u30e5\u30d3\u30cd\u30fc\u30b7\u30e7\u30f3\u65b9\u7b56\u306b\u95a2\u3059\u308b\u8003\u5bdf<br \/>\n\t<br \/>\u5ca1\u6751 \u5bdb\u4e4b\uff0c\u571f\u80a5 \u6b63\uff0c\u5c3e\u5d0e \u4fca\u6cbb\uff08\u5e83\u5cf6\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>An analysis of one-dimensional cellular networks with two-way traffic considering user mobility<br \/>\n\t<br \/>\u4e95\u4e0a \u901a\u5b8f\uff0cSakchai Thipchaksurat\uff0c\u5c71\u672c \u6f6e\uff0c\u5c0f\u91ce\u91cc \u597d\u90a6\uff08\u7fa4\u99ac\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30a2\u30c9\u30db\u30c3\u30af\u30fb\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u3068\u78ba\u7387\u30e2\u30c7\u30eb\u306b\u3088\u308b\u89e3\u6790<br \/>\n\t<br \/>\u85e4\u672c \u8861\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6a2a\u65ad\u3059\u308b\u30c7\u30b6\u30a4\u30f3\u2212\u4eba\u3068\u30e2\u30ce\u306e\u95a2\u4fc2\u304b\u3089\u306e\u6226\u7565\u3068\u65b9\u6cd5\u2212<br \/>\n\t<br \/>\u4e0b\u5ddd \u4fe1\u7950\uff0c\u65b0\u4e0a \u548c\u6b63\uff0c\u5927\u7530\u539f \u4e00\u6210\uff0c\u6cb3\u91ce \u82b3\u6c5f\uff08\u30a8\u30a4\u30fb\u30c6\u30a3\u30fc\u30fb\u30a2\u30fc\u30eb\u74b0\u5883\u9069\u5fdc\u901a\u4fe1\u7814\u7a76\u6240\uff09\n\t<\/ul><\/p>\n","protected":false},"excerpt":{"rendered":"<p>2000\u5e74\u5ea6\uff08\u7b2c19\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0 &#8220;\u60c5\u5831\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u65b0\u3057\u3044\u6027\u80fd\u8a55\u4fa1\u6cd5\u306b\u95a2\u3059\u308b\u7dcf\u5408\u7684\u7814\u7a76&#8221; \u65e5\u6642: 2001\u5e741\u670822-24\u65e5 \u5834\u6240: \u7cbe\u83ef\u753a\u30fb\u3051\u3044\u306f\u3093\u306a\u30d7\u30e9\u30b6 \u65e5\u672c\uff2f\uff32\u5b66\u4f1a\u5275\u7acb40\u5468\u5e74\u8a18 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":24,"menu_order":38,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_mc_calendar":[]},"_links":{"self":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/186"}],"collection":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/comments?post=186"}],"version-history":[{"count":2,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/186\/revisions"}],"predecessor-version":[{"id":230,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/186\/revisions\/230"}],"up":[{"embeddable":true,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/24"}],"wp:attachment":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/media?parent=186"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}