Test Whats new message.
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Showing 1-16 of 16 results
- Sort
Filter Results
Show
Sort By
Results
We apply federated learning (FL) to a distributed intrusion detection system (IDS), in which we deploy numerous detection servers on the edge of a network. FL can mitigate the impact of decreased training data in each server and exhibit almost the same detection rate as that of the non-distributed IDS for all attack classes. We verify the effect of FL using explainable artificial intelligence (XAI...Show More
Probabilistic Control of Dynamic Crowds Toward Uniform Spatial-Temporal Coverage
Vehicular mobility and connectivity vary significantly over space and time when vehicular crowd sensing covers a city-wide area for a long time period, but it is important to achieve sufficiently uniform data coverage to satisfy the requirements of an environmental monitoring scenario. Our goal is thus to ensure uniform spatial-temporal coverage of sensed data over a city-wide area despite such ve...Show More
Hierarchical and Frequency-Aware Model Predictive Control for Bare-Metal Cloud Applications
2018 IEEE/ACM 11th International Conference on Utility and Cloud Computing (UCC)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
Bare-metal cloud provides a dedicated set of physical machines (PMs) and enables both PMs and virtual machines (VMs) on the PMs to be scaled in/out dynamically. However, to increase efficiency of the resources and reduce violations of service level agreements (SLAs), resources need to be scaled quickly to adapt to workload changes, which results in high reconfiguration overhead, especially for the...Show More
Cloud bursting approach based on predicting requests for business-critical web systems
2017 International Conference on Computing, Networking and Communications (ICNC)
Year: 2017 | Conference Paper |
Cited by: Papers (7)
Cloud bursting temporarily expands the capacity of cloud-based service hosted in a private data center by renting public data center capacity when the demand for capacity spikes. This paper presents a cloud bursting approach based on long- and short-term predictions of requests to a business-critical Web system to determine the optimal resources of the system deployed over private and public data ...Show More
Virtual Network Allocation for Fault Tolerance with Bandwidth Efficiency in a Multi-tenant Data Center
2014 IEEE 6th International Conference on Cloud Computing Technology and Science
Year: 2014 | Conference Paper |
Cited by: Papers (1)
In a multitenant data center, nodes and links of tenants' virtual networks (VNs) share a single component of the physical substrate network (SN). A failure of the single SN component can thereby cause simultaneous failures of multiple nodes and links in a VN, this complex of failures must significantly disrupt the services offered on the VN. In the present paper, we clarify how the fault tolerance...Show More
Effect of traffic locality on power consumption of distributed computing network with a data center
2012 9th International Conference on Communications (COMM)
Year: 2012 | Conference Paper |
A distributed computing network (DCN), such as a content delivery network, not only improves the response time to clients but also reduce the traffic from/to the data center over a wide area network (WAN), thereby decreasing the power consumed in the WAN. In this paper, we focus on the energy-saving aspect of the DCN and evaluate its effectiveness, especially considering traffic locality, i.e., th...Show More
A transport layer approach for improving interactive user experience on thin clients
2009 Australasian Telecommunication Networks and Applications Conference (ATNAC)
Year: 2009 | Conference Paper |
Return network traffic (from servers to clients) in thin-client systems is modeled as a mixture of interactive data flows corresponding to keystrokes and bulk data flows related to screen updates. Users are very sensitive to delay and jitter of the former flows. Thus our goal is to minimize the latency of interactive data transfer without increasing latency of bulk data transfer. Through simulatio...Show More
Agent-based remote monitoring system using the internet
The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.
Year: 2005 | Conference Paper |
Cited by: Papers (1)
To provide efficient management service for computers in a cost-effective and easy-to-introduce way, we have developed an agent-based remote monitoring system that enables interactive two-way communication between the agent in a monitored computer and a monitoring server via the Internet. The agent sends a keep-alive or alert message, receives a command from the monitoring server, and executes the...Show More
Estimating the performance of a large enterprise network for the updating of routing information
Y. Ogawa;A. Nakaya;K. Takamura;K. Yamaha;S. Saitou;K. Iwanaga;T. Koita
We have developed an experimental approach that allows us to estimate the performance of a large-scale enterprise network for the updating of routing information. The estimation was applied in the integration of the UFJ Bank network system on January 15, 2002. The main characteristic of this approach is the application of a formula that represents the delays in the updating of routing information ...Show More
A recognition method for touching Japanese handwritten characters
Proceedings of the Fifth International Conference on Document Analysis and Recognition. ICDAR '99 (Cat. No.PR00318)
Year: 1999 | Conference Paper |
Cited by: Papers (19)
Describes a method for recognizing Japanese handwritten characters, including touching ones. The touching characters are segmented by cutting the connected components in a pre-segmentation process. The proposed segmentation method consists of the following steps: (1) identification of the touching components by checking the size of candidate character patterns; (2) estimation of the breakpoint and...Show More
PCHECK: a delay analysis tool for high performance LSI design
Proceedings of the IEEE 1995 Custom Integrated Circuits Conference
Year: 1995 | Conference Paper |
Cited by: Papers (5)
This paper describes new problems in delay analysis for high-performance LSI design and presents a static delay analysis tool PCHECK. PCHECK is characterized by (1) a new critical path trace algorithm for avoiding the error caused by signal transient time, (2) a precise delay calculation model for resistive shielding and (3) parallel delay calculation on networked workstations. Experimental result...Show More
Timing- and constraint-oriented placement for interconnected LSIs in mainframe design
28th ACM/IEEE Design Automation Conference
Year: 1991 | Conference Paper |
First Page of the Article
Show MoreTiming-driven placement for general cell layout
IEEE International Symposium on Circuits and Systems
Year: 1990 | Conference Paper |
A hierarchical technique is presented for the timing-driven placement of the general cells. It is assumed that maximum interconnection delays for nets are given. These timing constraints are transformed to net length constraints using technology-and process-dependent parameters, circuit-specific data such as input capacitance and output drivability, and the structural description, of the circuit. ...Show More
Automatic layout procedures for serial routing devices
25th ACM/IEEE, Design Automation Conference.Proceedings 1988.
Year: 1988 | Conference Paper |
Cited by: Papers (1)
Conventional automatic layout systems for MOS or bipolar devices systems cannot deal with certain features, e.g. signal serialization, in serial routing devices such as Josephson devices. The authors define layout requirements and present new automatic layout procedures for such devices. These procedures are based on it subnet partitioning. They can be applied to the hierarchical design of both ma...Show More
Efficient Placement Algorithms Optimizing Delay for High-Speed ECL Masterslice LSI's
Y. Ogawa;T. Ishii;Y. Shiraishi;H. Terai;T. Kozawa;K. Yuyama;K. Chiba
23rd ACM/IEEE Design Automation Conference
Year: 1986 | Conference Paper |
Placement algorithms optimizing signal delay as well as wirability for high-speed ECL masterslice LSI's are proposed. Equivalent constraints of wire length for clock skew, data path delay, and wired-OR are classified according to upper and lower limits. To maintain such limits, a top-down method utilizing an augmented two-dimensional clustering placement with "scope" and "zone", which are new conc...Show More
Automatic Placement Algorithms for High Packing density VLSI
T. Kozawa;H. Terai;T. Ishii;M. Hayase;C. Miura;Y. Ogawa;K. Kishida;N. Tamada;Y. Ohno
20th Design Automation Conference Proceedings
Year: 1983 | Conference Paper |
Five placement procedures which combine three basic algorithms are developed and incorporated to our system. Evaluation of results is presented. Compared with manual design the optimum procedure reduces block size by 6.5%. The normalized area for one transistor (NA) is defined as the measure of automatic layout performance. NA is the product of wiring pitch. Optimum NA is confirmed to be 14.9 for ...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.