On the Ablaut of Onomatopoeia in the Altaic Languages and Japanese

正誤表あ

Real-Time IP Flow Measurement Tool with Scalable Architecture

There is an emerging requirement for real-time flow-based traffic monitoring, which is vital to detecting and/or tracing DoS attacks as well as troubleshooting and traffic engineering in the ISP networks. We propose the architecture for a scalable real-time flow measurement tool in order to allow operators to flexibly define "the targeted flows" on-demand, to obtain various statistics on those flows, and to visualize them in a real-time manner. A traffic distribution device and multiple traffic capture devices processing packets in parallel are included in the architecture, in which the former device copies traffic and distributes it to the latter devices. We evaluate the performance of a proto-type implementation on PC-UNIX in testbed experiments to demonstrate the scalability of our architecture. The evaluation shows that the performance increases in proportion to the number of the capture devices and the maximum performance reaches 80 K pps with six capture devices. Finally we also show applications of our tool, which indicate the advantage of flexible fine-grained flow measurements

Parallel Transferable Uniform Multi-Round Algorithm for Minimizing Makespan

In parallel computing systems using the master/worker model for distributed grid computing, as the size of handling data grows, the increase in the data transmission time degrades the performance. For divisible workload applications, therefore, multiple-round scheduling algorithms have been being developed to mitigate the adverse effect of longer data transmission time by dividing the data into chunks to be sent out in multiple rounds, thus overlapping the times required for computation and transmission. However, a standard multiple-round scheduling algorithm, Uniform Multi-Round (UMR), adopts a sequential transmission model where the master communicates with one worker at a time, thus the transmission capacity of the link attached to the master cannot be fully utilized due to the limits of worker-side capacity. In the present study, a Parallel Transferable Uniform Multi-Round algorithm (PTUMR) is proposed. It efficiently utilizes the data transmission capacity of network links by allowing chunks to be transmitted in parallel to workers. This algorithm divides workers into groups in a way that fully uses the link bandwidth of the master under some constraints and considers each group of workers as one virtual worker. In particular, introducing a Grouping Threshold effectively deals with very heterogeneous workers in both data transmission and computation capacities. Then, the master schedules sequential data transmissions to the virtual workers in an optimal way like in UMR. The performance evaluations show that the proposed algorithm achieves significantly shorter turnaround times (i.e., makespan) compared with UMR regardless of heterogeneity of workers, which are close to the theoretical lower limits

Optimum design of aluminum beverage can ends using structural optimization techniques

金沢大学大学院自然科学研究科知的システム創成金沢大学工学部This paper has tried to apply the response surface approximate method in the structural optimization techniques to develop aluminum beverage can ends. Geometrical parameters of the end shell are selected as design variables. The analysis points in the design space are assigned using an orthogonal array in the design-of-experiment technique. Finite element analysis code is used to simulate the deforming behavior and to calculate buckling strength and central panel displacement of the end shell under internal pressure. On the basis of the numerical analysis results, the response surface of the buckling strength and panel growth are approximated in terms of the design variables. By using a numerical optimization program, the weight of the end shell is minimized subject to constraints of the buckling strength, panel growth suppression and other design requirements. A numerical example on 202 end shell optimization problem has been shown in this paper. © 2005 American Institute of Physics

Par6 regulates skeletogenesis and gut differentiation in sea urchin larvae

Partitioning-defective (par) genes were originally identified as genes that are essential for the asymmetric division of the Caenorhabditis elegans zygote. Studies have since revealed that the gene products are part of an evolutionarily conserved PAR-atypical protein kinase C system involved in cell polarity in various biological contexts. In this study, we analyzed the function of par6 during sea urchin morphogenesis by morpholino-mediated knockdown and by manipulation swapping of the primary mesenchyme cells (PMCs). Loss of Par6 resulted in defects in skeletogenesis and gut differentiation in larvae. Phenotypic analyses of chimeras constructed by PMC swapping showed that Par6 in non-PMCs is required for differentiation of archenteron into functional gut. In contrast, Par6 in both PMCs and ectodermal cells cooperatively regulates skeletogenesis. We suggest that Par6 in PMCs plays an immediate role in the deposition of biomineral in the syncytial cable, whereas Par6 in ectoderm may stabilize skeletal rods via an unknown signal(s). © 2012 Springer-Verlag

Stream Mining for Network Management

Network management is an important issue in maintaining the Internet as an important social infrastructure. Finding excessive consumption of network bandwidth caused by P2P mass flows is especially important. Finding Internet viruses is also an important security issue. Although stream mining techniques seem to be promising techniques to find P2P and Internet viruses, vast network flows prevent the simple application of such techniques. A mining technique which works well with extremely limited memory is required. Also it should have a real-time analysis capability. In this paper, we propose a cache based mining method to realize such a technique. By analyzing the characteristics of the proposed method with real Internet backbone flow data, we show the advantages of the proposed method, i.e. less memory consumption while realizing realtime analysis capability. We also show the fact that we can use the proposed method to find mass flow information from Internet backbone flow data

Performance Monitoring of VoIP Flows for Large Network Operations

The monitoring of performance in VoIP traffic has become vital because users generally expect VoIP service quality that is as high as that of PSTN services. A lightweight method of processing by extracting VoIP flows from Internet traffics is proposed in this paper. Estimating delay variations and the packet loss ratio using knowledge about specific features and the characteristics of VoIP flows, i.e., the inter-packet gap (IPG) which is constant in VoIP flows, is also proposed. Simulation with actual traffic trace is used to evaluate the method, and this revealed that delay variations (IPG variance) can be accurately estimated by monitoring only a few percentage of all flows. The proposed method can be used as a first-alert tool to monitor large amounts of flows to detect signs of degradation in VoIP flows. The method can be used by ISPs to estimate whether VoIP flow performance is adequate within their networks and at ingress from other ISPs

Offshore-origin warm water inflows toward Totten Ice Shelf, East Antarctica

The Tenth Symposium on Polar Science/Ordinary sessions: [OM] Polar Meteorology and Glaciology, Thu. 5 Dec. / 2F Auditorium , National Institute of Polar Researc