Hiromoto Susawa, T. Tsuji, K. Hiramatsu, T. Jimbo, T. Soga
{"title":"Simulation of Compositional Variation in Liquid Phase Epitaxy InGaP Using a Two Dimensional Model","authors":"Hiromoto Susawa, T. Tsuji, K. Hiramatsu, T. Jimbo, T. Soga","doi":"10.2197/IPSJDC.3.114","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.114","url":null,"abstract":"Compositional variation in initial growth was observed in Liquid Phase Epitaxy (LPE) experiments. It is thought that the cause is the flow of the melt which is induced by the slide of the entire melt from the place where there isn't substrate to the substrate before growth. The phenomenon was simulated with a one dimensional model in InGaP growth with a convection term added to a diffusion-limited model. The velocity of flow in the melt was approximated to Stokes's first problem. It was shown that composition of In in grown solid with the flow is larger than that without the flow. In this paper, InGaP LPE growth is considered and a two dimensional model of the flow is used. For the solute transport, a two dimensional model is also adopted except at the growth interface. A result similar to the one dimensional model was obtained. In the two dimensional model, In composition is greater than that in the case without flow for the greater part of the growth time, but decreases when the flow transports dilute solution. This decrease doesn't appear in the one dimensional model. This phenomenon can be explained by considering the influence of the flow on the mole fraction near the boundary layer.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124799283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluations of Web Server Performance with Heavy-tailedness","authors":"T. Nakashima","doi":"10.2197/IPSJDC.3.21","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.21","url":null,"abstract":"Providing quality of service (QoS) in a business environment requires accurate estimation of Internet traffic, especially HTTP traffic. HTTP traffic, mainly consisting of file transmission traffic, depends on the sizes of files with a heavy-tailed property. Analyzing the performance of specific Web servers and comparing server performance is important in QoS provisioning for user applications. In this paper, we present the experimental analysis of Web server performance using our active measurement. We capture activity data from 1984 diverse Web servers by sending measurement packets 20 times in order to evaluate the spatial properties, and we select 14 Web servers to send packets 2, 000 times in 5-second intervals to evaluate the temporal properties. The main contribution of our study is to provide methods of evaluating the temporal and spatial properties on any Web server by measuring from a remote observation host, and to illustrate the current activity of temporal and spatial properties in a series of figures. Crovella's well known work merely describes the self-similar properties for the total transmission time generated by a heavy-tailed file size distribution. We divided the total transmission time into network and server system dependable elements, of which the heavy-tailed properties are captured. We found that temporal properties consist of two factors: stability and activity in the Poisson process. Robustness of heavy-tailedness in terms of constructing elements of total transmission time was evident from the analysis of spatial properties. Finally, we observed the upper boundary and classified groups in a mean-variance plot of primitive elements of the Web server.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121355907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Naoki Nakamura, D. Chakraborty, Apichet Chayabejara, G. Kitagata, T. Suganuma, G. Chakraborty, N. Shiratori
{"title":"Efficient Channel Utilization Schemes for IEEE 802.11 DCF over MANET","authors":"Naoki Nakamura, D. Chakraborty, Apichet Chayabejara, G. Kitagata, T. Suganuma, G. Chakraborty, N. Shiratori","doi":"10.2197/IPSJDC.3.75","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.75","url":null,"abstract":"The MAC protocol of IEEE 802.11 reduces hidden terminal problem using the RTS/CTS handshaking mechanism. However, it lacks the ability to release or reallocate a channel that was reserved but not used. For Mobile Ad hoc NETworks (MANET), this often keeps the channel unnecessarily inaccessible, resulting in inefficient channel utilization. In this paper, we propose schemes for releasing and reallocating unused channels in MANET deployed over IEEE 802.11. We introduce a Network Allocation Vector (NAV) updating method that can improve the performance of the existing RTS Validation scheme and our proposed Extra Frame Transmission scheme. We then combine these schemes as a further improvement. Through simulations, done in different scenarios with varying networking load and node density, we were able to show that combining these schemes leads to a throughput improvement of up to 40%. In addition, our proposed mechanisms have no compatibility problems.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125709482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lei Jing, Zixue Cheng, Mizuo Kansen, Tongjun Huang, Shengguo Sun
{"title":"An Educational Schoolbag System for Providing an Object Reminder Service","authors":"Lei Jing, Zixue Cheng, Mizuo Kansen, Tongjun Huang, Shengguo Sun","doi":"10.2197/IPSJDC.3.64","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.64","url":null,"abstract":"Embedding educational functions into devices in the everyday environment is an important task for advocates of ubiquitous learning. In this paper, we discuss how to add a reminder service to a schoolbag. An educational function would be added to the device to help pupils remember belongings. Reminding oneself of things is a difficult task and reminder services have been an important subject of computer applications. However, most reminding tools are used for business, not education. Most such services use PDAs as terminals and require the user to create the reminder list by him or herself, making it too complex for some pupils to use. The systems also seldom pay attention to helping users learn how to avoid forgetting. In this research, a ubiquitous learning support system that makes use of schoolbags is presented to assist pupils in managing their personal items. With RFID and infrared sensors, a microcontroller embedded in a schoolbag can monitor what has been put in or taken out of the schoolbag and automatically maintain a schoolbag's items list. Such a bag also enables teachers to make up a schedule that specifies required items for given days. The microcontroller then compares the schedule with the items list in the schoolbag and provides a reminder service for the pupil. In addition to the reminder service, which is based on principles of behavior modification, the paper also proposes a series of methods to help pupils form good personal management habits and reduce their dependence on outside machines.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114225558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and Implementation of Socket-level Bandwidth Aggregation Mechanism for Mobile Networking Environments","authors":"H. Sakakibara, M. Saito, H. Tokuda","doi":"10.2197/IPSJDC.3.86","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.86","url":null,"abstract":"This paper presents a mechanism that aggregates the bandwidths of multiple network interfaces on computers in mobile environments. Research and development on wireless technologies has recently been extremely active. As a result, various kinds of wireless media have been emerging and these have been installed on computers. However, the demand for broader bandwidths has not yet been met. We designed and developed a socket-level bandwidth aggregation mechanism (SBAM) that offer broader bandwidths using multiple wireless interfaces on computers. The most distinctive feature of SBAM is that the mechanism is implemented as a feature of operating systems. This involves two benefits. First, it is possible to deploy SBAM gradually in computers on the Internet. If the bandwidth aggregation mechanism (BAM) is achieved in a network stack, it must be implemented in all computers on the Internet. However, it is not necessary to implement it in all computers on the Internet, since it can recognize its own existence on peer hosts and determine whether to use BAM or not. Second, it does not require modifications to most existing software. For example, if the mechanism is achieved as a feature of a transport protocol, such as TCP, all applications using TCP must be re-written to adapt to the new transport layer protocol. However, SBAM does not require this, since the socket hides the existence of the mechanism. We evaluated SBAM in an actual wireless network environment. We achieved an increase in throughput by a factor of 1.6. SBAM offers broader bandwidths for applications by utilizing various wireless devices on computers while it avoids modifications to existing environments.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"28 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120887295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperation Strategy for Broadcast Scheduling and Base Station Caching in Hybrid Wireless Broadcast Environment","authors":"Jing Cai, T. Terada, T. Hara, S. Nishio","doi":"10.2197/IPSJDC.3.30","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.30","url":null,"abstract":"Recent advances in computer and wireless communication technologies have increased interest in combinations of various techniques such as pull-based data dissemination, data broadcasting, and data caching, as well as investigations into data management in hybrid data delivery systems. This paper proposes cooperative data management based on the Hybrid Wireless Broadcast (HWB) model to provide more efficient data delivery to mobile clients. Our cooperative strategy integrates broadcast scheduling with cache management of the base station, taking heterogeneous and homogeneous access of clients into consideration, by making effective use of HWB data dissemination, i.e., push-based broadcast, pull-based broadcast, and pull-based point-to-point wireless communication. Our simulation results confirmed that the strategy we propose can improve the performance of the system even further.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125803660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Congestion Control Using Multilevel Explicit Congestion Notification","authors":"A. Durresi, L. Barolli, R. Jain, M. Takizawa","doi":"10.2197/IPSJDC.3.42","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.42","url":null,"abstract":"†4 Congestion remains one of the main obstacles to the Quality of Service (QoS) on the Internet. We think that a good solution to Internet congestion should optimally combine congestion signaling from network and source reaction, with the following as its main goals: minimum losses and delays, maximum network utilization, fairness among flows, and last but not least, scalability of the solution. The solution should not significantly increase the complexity of router operations. In this paper, we present a new traffic management scheme based on an enhanced Explicit Congestion Notification (ECN) mechanism. Our Multilevel ECN (MECN) conveys more accurate feedback information about the network congestion status than the current ECN. We have designed a TCP source reaction that takes advantage of the extra information provided about congestion. Therefore, MECN responds better to congestion by allowing the system to reach the stability point faster, which results in better network performance. We use control theoretical tools verified by ns2 simulations to show that MECN can outperform up to twenty times in term of throughput the de facto standard RED/ECN.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"86 5-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120918523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhancing Multiobjective Evolutionary Algorithms by Local Dominance and Local Recombination: Performance Verification in Multiobjective 0/1 Knapsack Problems","authors":"Hiroyuki Sato, H. Aguirre, Kiyoshi Tanaka","doi":"10.2197/IPSJDC.3.98","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.98","url":null,"abstract":"This paper proposes a method to enhance single population multiobjective evolutionary algorithms (MOEAs) by searching based on local dominance and local recombination. In this method, first, all fitness vectors of individuals are transformed to polar coordinate vectors in objective function space. Then, the population is iteratively divided into several subpopulations by using declination angles. As a result, each sub-population covers a sub-region in the multiobjective space with its individuals located around the same search direction. Next, local dominance is calculated separately for each sub-population after alignment of its principle search direction by rotation. Selection, recombination, and mutation are applied to individuals within each sub-population. The proposed method can improve the performance of MOEAs that use dominance based selection, and can reduce the entire computational cost to calculate dominance among solutions as well. In this paper we verify the effectiveness of the proposed method obtaining Pareto optimal solutions in two representative MOEAs, i.e. NSGA-II and SPEA2, with Multiobjective 0/1 Knapsack Problems.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129660719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"NAL Level Stream Authentication for H.264/AVC","authors":"S. Ueda, H. Shigeno, Ken-ichi Okada","doi":"10.2197/IPSJDC.3.55","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.55","url":null,"abstract":"The new video coding standard H.264/AVC offers major improvements in the coding efficiency and flexible mapping to transport layers. It consists of a video coding layer (VCL) and a network abstraction layer(NAL). The VCL carries out the coding, and the NAL encapsulates data from the VCL in a manner where transmission over a broad variety of transport layers is readily enabled. Since no security features are offered, an authentication scheme to authenticate the sender and data integrity is needed. In this paper we propose SANAL, a stream authentication scheme for H.264/AVC. Unlike existing schemes that carry out authentication procedures at the packet level, authentication procedures in SANAL are carried out at the NAL level. This makes it possible to set priorities to H.264/AVC-specific data without interfering with the H.264/AVC features. We implemented a SANAL prototype and carried out comparative evaluations on playout rate, communication overhead, and process load. The evaluation results show that the playout rate is improved by 40% compared to existing schemes.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133688153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tetsuro Kitahara, Masataka Goto, Kazunori Komatani, T. Ogata, HIroshi G. Okuno
{"title":"Instrogram: Probabilistic Representation of Instrument Existence for Polyphonic Music","authors":"Tetsuro Kitahara, Masataka Goto, Kazunori Komatani, T. Ogata, HIroshi G. Okuno","doi":"10.2197/IPSJDC.3.1","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.1","url":null,"abstract":"This paper presents a new technique for recognizing musical instruments in polyphonic music. Since conventional musical instrument recognition in polyphonic music is performed notewise, i.e., for each note, accurate estimation of the onset time and fundamental frequency (F0) of each note is required. However, these estimations are generally not easy in polyphonic music, and thus estimation errors severely deteriorated the recognition performance. Without these estimations, our technique calculates the temporal trajectory of instrument existence probabilities for every possible F0. The instrument existence probability is defined as the product of a nonspecific instrument existence probability calculated using the PreFEst and a conditional instrument existence probability calculated using hidden Markov models. The instrument existence probability is visualized as a spectrogram-like graphical representation called the instrogram and is applied to MPEG-7 annotation and instrumentation-similaritybased music information retrieval. Experimental results from both synthesized music and real performance recordings have shown that instrograms achieved MPEG-7 annotation (instrument identification) with a precision rate of 87.5% for synthesized music and 69.4% for real performances on average and that the instrumentation similarity measure reflected the actual instrumentation better than an MFCC-based measure.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124032252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}