{"id":180,"date":"2021-03-19T13:52:27","date_gmt":"2021-03-19T04:52:27","guid":{"rendered":"https:\/\/orsj.org\/queue\/?page_id=180"},"modified":"2021-03-19T13:52:27","modified_gmt":"2021-03-19T04:52:27","slug":"quesym2003","status":"publish","type":"page","link":"https:\/\/orsj.org\/queue\/symposium\/quesym_history\/quesym2003\/","title":{"rendered":"2003\u5e74\u5ea6(\u7b2c22\u56de)\u5f85\u3061\u884c\u5217\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0"},"content":{"rendered":"<p>    <center><\/p>\n<h2>2003\u5e74\u5ea6\uff08\u7b2c22\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0<br \/>\n      &#8220;\u78ba\u7387\u30e2\u30c7\u30eb\u3068\u305d\u306e\u5fdc\u7528&#8221;<\/h2>\n<p>      \u65e5\u6642: 2004\u5e741\u670819\u65e5-21\u65e5<br \/>\n      \u5834\u6240: \u5f66\u6839\u30fb\u3072\u3053\u306d\u30b9\u30c6\u30fc\u30b7\u30e7\u30f3\u30db\u30c6\u30eb<br \/>\n      \u5b9f\u884c\u59d4\u54e1\u9577: \u6edd\u6839 \u54f2\u54c9\uff08\u4eac\u90fd\u5927\u5b66\uff09<br \/>\n    <\/center><\/p>\n<hr>\n<ul>\n<li>2\u6bb5\u76f4\u5217\u578b\u5f85\u3061\u884c\u5217\u306b\u304a\u3051\u308b\u6709\u9650\u6253\u3061\u5207\u308a\u8fd1\u4f3c\u306e\u5371\u967a\u6027<br \/>\n\t<br \/>\u4f50\u4e45\u9593 \u5927\u3001\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Algorithmic procedure to compute the transient solution of a<br \/>\nlevel-dependent bivariate Markov chain and its applications to queues<br \/>\n\t<br \/>\u5897\u5c71 \u535a\u4e4b\uff0c\u6edd\u6839 \u54f2\u54c9\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30b7\u30a7\u30a2\u30ea\u30f3\u30b0\u30b5\u30fc\u30d3\u30b9\u3092\u4f34\u3046\u30de\u30eb\u30b3\u30d5\u5909\u8abf\u4e26\u5217\u6d41\u4f53\u30cd\u30c3\u30c8\u30ef\u30fc\u30af<br \/>\n\t<br \/>\u9ad8\u7530 \u5bdb\u4e4b\uff08\u5c71\u53e3\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On the exponential decay of the tail probability of a<br \/>\n\tcontinuous type random variable<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>Optical multicast routing using genetic algorithm for<br \/>\n\twavelength-routed networks<br \/>\n\t<br \/>Johannes Hamonangan Siregar, \u5f35 \u52c7\u5175\uff0c\u9ad8\u6728 \u82f1\u660e\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Note on Mecke&#8217;s formula and its applications to CDMA wireless<br \/>\n\tcommunications<br \/>\n\t<br \/>\u7530\u4e2d \u88d5\u9855 \uff08\u5927\u962a\u5927\u5b66\uff09, \u7c73\u5c71 \u5bdb\u4e8c\uff08\u59eb\u8def\u5de5\u696d\u5927\u5b66\uff09, \u77f3\u4e95 \u535a\u662d\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30de\u30eb\u30b3\u30d5\u6c7a\u5b9a\u904e\u7a0b\u306b\u3088\u308b Web \u30da\u30fc\u30b8\u30e9\u30f3\u30ad\u30f3\u30b0\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u306e\u63d0\u6848<br \/>\n\t<br \/>\u5ca1\u6751 \u5bdb\u4e4b\uff0c\u5bae\u5185 \u8061\uff0c\u571f\u80a5 \u6b63\uff08\u5e83\u5cf6\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Modeling of mobile environments with heterogeneous<br \/>\n\tsystem-interworking<br \/>\n\t<br \/>\u798f\u5d8b \u6b63\u6a5f, \u4e2d\u6751 \u5143\u3001\u91ce\u672c \u771f\u4e00\uff08KDDI\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u7570\u7a2e\u591a\u5143\u79fb\u52d5\u30ab\u30b9\u30bf\u30de\u30fc\u30c8\u30e9\u30d2\u30c3\u30af\u30e2\u30c7\u30eb<br \/>\n\t<br \/>\u753a\u539f \u6587\u660e\uff08\u6771\u4eac\u96fb\u6a5f\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Single-server queues with Markov-modulated arrivals and<br \/>\n\tservice speed<br \/>\n\t<br \/>\u6edd\u6839 \u54f2\u54c9\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30de\u30eb\u30c1\u30b9\u30ec\u30c3\u30c9\u578b\u975e\u540c\u671f\u51e6\u7406\u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b\u30b5\u30fc\u30d3\u30b9\u6b8b\u4f59\u6642\u9593\u306e\u898b\u7a4d\u3082\u308a\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u5742\u7530 \u6d0b\u5e78\uff08NTT\u30c7\u30fc\u30bf\uff09, \u7267\u672c \u76f4\u6a39\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>The stationary tail asymptotics in the GI\/G\/1 type queue<br \/>\n\twith countably many background state<br \/>\n\t<br \/>\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09and Yiqiang Zhao (Carleton University)\n\t<\/ul>\n<\/p>\n<ul>\n<li>Decomposition property in a discrete-time queue with<br \/>\n\tmultiple input streams and service interruptions<br \/>\n\t<br \/>\u77f3\u5d0e \u6587\u96c4\uff08\u5357\u5c71\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Perfect simulation for a closed Jackson network<br \/>\n\t<br \/>\u5c0f\u6ca2 \u5229\u4e45\uff08\u99d2\u6fa4\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u4e0d\u6b63\u30a2\u30af\u30bb\u30b9\u30d1\u30b1\u30c3\u30c8\u306e\u62bd\u51fa\u3068\u305d\u306e\u78ba\u7387\u7684\u6027\u8cea<br \/>\n\t<br \/>\u85e4\u672c \u8861, \u5927\u5cfd \u5b66, \u795e\u7530 \u667a\u9686, \u5c0f\u6797 \u967d\u4e00\uff08\u6771\u4eac\u96fb\u6a5f\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A comparative study of a Markovian queueing model with impatient<br \/>\n\tcustomers<br \/>\n\t<br \/>\u6cb3\u897f \u61b2\u4e00\uff08\u7fa4\u99ac\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Analysis of GI\/M\/1 queue with multiple working vacations<br \/>\n\t<br \/>\u99ac\u5834 \u88d5\uff08\u6a2a\u6d5c\u56fd\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A note on bounds and monotonicity of spatial stationary Cox shot<br \/>\n\tnoises<br \/>\n\t<br \/>\u4e09\u597d \u76f4\u4eba\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30ea\u30a2\u30eb\u30bf\u30a4\u30e0ARQ \u306e\u30e2\u30c7\u30eb\u5316\u3068\u6027\u80fd\u89e3\u6790<br \/>\n\t<br \/>\u7802\u539f \u661f\uff08\u4eac\u90fd\u5927\u5b66\uff09, \u6cb3\u91ce \u9053\u6210, \u677f\u5009 \u82f1\u4e09\u90ce\uff08SONY\uff09, \u9ad8\u6a4b \u8c4a\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>P2P \u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b\u691c\u7d22\u65b9\u5f0f\u53ca\u3073\u30e6\u30fc\u30b6\u884c\u52d5\u304c\u6027\u80fd\u306b\u4e0e\u3048\u308b\u5f71\u97ff\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u91cd\u9ed2\u6728\u592a\u4e00, \u5c71\u7530\u5b5d\u5b50, \u52a0\u85e4\u61b2\u4e00\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6f5c\u5728\u610f\u5473\u89e3\u6790\u3092\u7528\u3044\u305f\u60c5\u5831\u30a6\u30a7\u30d6\u30b5\u30a4\u30c8\u306eMarkov \u9023\u9396\u306b\u3088\u308b\u30e2\u30c7\u30eb\u5316\u3068\u8a55\u4fa1<br \/>\n\t<br \/>\u72e9\u8c37 \u5178\u4e4b, \u5317\u5cf6 \u5b97\u96c4, \u9ad8\u6728 \u82f1\u660e, \u5f35 \u52c7\u5175\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u65b0\u805e\u7cfb\u30b5\u30a4\u30c8\u306b\u304a\u3051\u308b\u30e6\u30fc\u30b6\u306e\u898b\u51fa\u3057\u9078\u629e\u884c\u52d5\u306b\u57fa\u3065\u304f\u30d6\u30e9\u30a6\u30b8\u30f3\u30b0\u30e2\u30c7\u30eb<br \/>\n\t<br \/>\u677e\u7530 \u660e\u91ce\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09, \u9ad8\u91ce \u6b63\u6b21\uff08NTT\uff09, \u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>LRU \u30ad\u30e3\u30c3\u30b7\u30e5\u306e\u30da\u30fc\u30b8\u30fb\u30d5\u30a9\u30fc\u30eb\u30c8\u7387\u306b\u5bfe\u3059\u308b\u6f38\u8fd1\u89e3\u6790<br \/>\n\t<br \/>\u6749\u672c \u8c4a\u662d, \u4e09\u597d \u76f4\u4eba\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>CDMA \u53ef\u5909\u30ec\u30fc\u30c8\u4f1d\u9001\u3092\u5229\u7528\u3057\u305f\u8907\u6570\u30af\u30e9\u30b9\u3078\u306e\u30c1\u30e3\u30cd\u30eb\u5272\u308a\u5f53\u3066\u306e\u6027\u80fd\u8a55\u4fa1<br \/>\n\t<br \/>\u795e\u8c37 \u5c1a\u4e00, \u9006\u702c\u5ddd \u6d69\u5b5d\uff08\u65e9\u7a32\u7530\u5927\u5b66\uff09, \u798f\u5d8b \u6b63\u6a5f, \u53e4\u5c4b \u88d5\u898f, \u91ce\u672c \u771f\u4e00<br \/>\n\uff08KDDI\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Accuracies of decomposition-type approximate models for<br \/>\n\tlarge-scale mobile communication networks<br \/>\n\t<br \/>\u9ad8\u6a4b \u6210\u6643\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09, \u5c0f\u6ca2 \u5229\u4e45\uff08\u99d2\u6fa4\u5927\u5b66\uff09, \u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u79fb\u52d5\u4f53\u901a\u4fe1\u306b\u304a\u3051\u308b\u6027\u80fd\u8a55\u4fa1\u306e\u305f\u3081\u306e\u90fd\u5e02\u7a7a\u9593\u3092\u8003\u616e\u3057\u305f\u6b69\u884c\u30e2\u30c7\u30eb\u306e\u69cb\u7bc9<br \/>\n\t<br \/>\u91d1\u5b50 \u96c5\u5fd7, \u5c71\u7530 \u5b5d\u5b50, \u52a0\u85e4 \u61b2\u4e00\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Traffic based reconfiguration for logical topologies in<br \/>\n\twide-area WDM optical networks<br \/>\n\t<br \/>\u6751\u7530 \u5c06\u898f, \u5f35 \u52c7\u5175\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30ea\u30f3\u30af\u30ec\u30d9\u30eb\u306b\u304a\u3051\u308bTCP \u30b7\u30b9\u30c6\u30e0\u30b9\u30eb\u30fc\u30d7\u30c3\u30c8\u306e\u5b89\u5b9a\u6027\u306e\u8003\u5bdf<br \/>\n\t<br \/>\u9032\u5730 \u5d07\u88d5\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09, \u6f58 \u7165\u65ed\uff08NEC\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30d1\u30b1\u30c3\u30c8\u512a\u5148\u51e6\u7406\u65b9\u5f0f\u306e\u30d1\u30c3\u30b1\u30fc\u30b8\u5316\u3068\u51e6\u7406\u7279\u6027<br \/>\n\t<br \/>\u8fbb\u5802 \u9686\u5fd7, \u5c0f\u6797 \u9999, \u7247\u5c71 \u52c1\uff08\u5bcc\u5c71\u770c\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A numerical solution of a nonlinear equation for a MAP\/G\/1<br \/>\n\tqueue by using the modified Durand-Kerner method<br \/>\n\t<br \/>\u897f\u6751 \u5f70\u4e00, *\u51a8\u6c38 \u5bdb\u5e78\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09, \u7e41\u7530 \u5cb3\u7f8e\uff08\u65e5\u672c\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Performance evaluation of defense strategies against computer virus<br \/>\n\t<br \/>\u8c4a\u6cc9 \u6d0b\uff08\u4f1a\u6d25\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u72ec\u7acb\u5206\u6563\u6700\u9069\u5316\u306b\u3088\u308b\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u9006\u8aac\u7684\u6027\u80fd\u52a3\u5316\u3068\u305d\u306e\u88ab\u5bb3\u306e\u7a0b\u5ea6<br \/>\n\t\u2212 \u30b9\u30c6\u30fc\u30bf\u30b9\u30ec\u30dd\u30fc\u30c8 \u2212<br \/>\n\t<br \/>\u4e80\u7530 \u58fd\u592b\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30bb\u30eb\u30fb\u30aa\u30fc\u30c8\u30de\u30c8\u30f3\u3068\u305d\u306e\u5fdc\u7528<br \/>\n\t<br \/>\u5927\u9444 \u53f2\u7537\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\uff12\u3064\u306e\u30e2\u30fc\u30c9\u3092\u3082\u3064\u884c\u52d5\u30e2\u30c7\u30eb -\u60c5\u5831\u901a\u4fe1\u30b7\u30b9\u30c6\u30e0\u306e\u30c7\u30b6\u30a4\u30f3\u306e\u305f\u3081\u306b-<br \/>\n\t<br \/>\u4e0b\u5ddd \u4fe1\u7950, \u65b0\u4e0a \u548c\u6b63, \u5927\u7530\u539f \u4e00\u6210\uff08ATR\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30de\u30eb\u30c1\u30a8\u30fc\u30b8\u30a7\u30f3\u30c8\u30fb\u30b7\u30b9\u30c6\u30e0\u306b\u3088\u308b\u30d7\u30e9\u30a4\u30b7\u30f3\u30b0\u6642\u7cfb\u5217\u306e\u8fd1\u4f3c\u3068\u30b5\u30fc\u30d3\u30b9\u65bd\u8a2d\u3067\u306e\u5236\u5fa1\u3078\u306e\u5fdc\u7528<br \/>\n\t<br \/>\u6642\u6c38 \u7965\u4e09, \u6c60\u7530 \u6b3d\u4e00 \uff08\u4e5d\u5dde\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u62e1\u5f35\u578b\u304b\u3093\u3070\u3093\u30b3\u30f3\u30c8\u30ed\u30fc\u30eb\u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b\u6700\u9069\u304b\u3093\u3070\u3093\u304a\u3088\u3073\u521d\u671f\u5728\u5eab\u914d\u5206<br \/>\n\t<br \/>Heng Zahng, \u77f3\u585a \u967d\uff08\u4e0a\u667a\u5927\u5b66\uff09, \u5c71\u4e0b \u82f1\u660e\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A fluid model for queues in traffics to join a main line<br \/>\n\t<br \/>\u6c34\u91ce \u4fe1\u4e5f\uff0c\u5bae\u6ca2 \u653f\u6e05\uff08\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>PH-distributions with non-distinct eigenvalues<br \/>\n\t<br \/>\u5cb8 \u5eb7\u4eba, \u7d00 \u4e00\u8aa0\uff08\u795e\u5948\u5ddd\u5927\u5b66\uff09\n\t<\/ul><\/p>\n","protected":false},"excerpt":{"rendered":"<p>2003\u5e74\u5ea6\uff08\u7b2c22\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0 &#8220;\u78ba\u7387\u30e2\u30c7\u30eb\u3068\u305d\u306e\u5fdc\u7528&#8221; \u65e5\u6642: 2004\u5e741\u670819\u65e5-21\u65e5 \u5834\u6240: \u5f66\u6839\u30fb\u3072\u3053\u306d\u30b9\u30c6\u30fc\u30b7\u30e7\u30f3\u30db\u30c6\u30eb \u5b9f\u884c\u59d4\u54e1\u9577: \u6edd\u6839 \u54f2\u54c9\uff08\u4eac\u90fd\u5927\u5b66\uff09 2\u6bb5\u76f4\u5217\u578b\u5f85\u3061\u884c [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":24,"menu_order":35,"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\/180"}],"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=180"}],"version-history":[{"count":5,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/180\/revisions"}],"predecessor-version":[{"id":227,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/180\/revisions\/227"}],"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=180"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}