| 1. |
- Anastasiadis, Nikolaos, et al.
(författare)
-
A fast multiplier-less edge detection accelerator for FPGAs
- 2010
-
Ingår i: SAC '10 Proceedings of the 2010 ACM Symposium on Applied Computing. - New York, NY, USA : ACM. - 9781605586380 ; , s. 510-515
-
Konferensbidrag (refereegranskat)abstract
- Real time video is used in a wide variety of applications, ranging from video surveillance to medical imaging. These operations require significant amounts of processing power, especially when high resolution frames are used. A large percentage of processing time is used in edge detection kernels. Thus, accelerating these kernels is of vital importance in achieving satisfactory frame rates for real time performance, even in high resolutions. This paper proposes a hardware coprocessor to the Xilinx Microblaze processor which accelerates edge detection significantly, while keeping the hardware requirements low, by using no multipliers at all. Using a Xilinx Spartan 3E FPGA, we have reported a frame rate of 157 frames per second in 4CIF format, which corresponds to a 4x speedup over the software only solution. The speedup was achieved with only 1131 slices and 5 block RAMs hardware occupation, which makes the solution very attractable.
|
|
| 2. |
- Fu, Zhang, 1982, et al.
(författare)
-
Mitigating Distributed Denial of Capability Attacks Using Sink Tree Based Quota Allocation
- 2010
-
Ingår i: In the Proceedings of 25th ACM Symposium on Applied Computing (SAC 2010). - New York, NY, USA : ACM. - 9781605586380 ; , s. 713-718
-
Konferensbidrag (refereegranskat)abstract
- Network capabilities have been proposed to prevent Distributed Denial of Service (DDoS) attacks proactively. A capability is a ticket-like token, checkable by routers, that a server can issue for legitimate traffic. Still, malicious hosts may swamp a server with requests for capability establishment, essentially causing possible Denial-of-Capability (DoC).In this paper, we propose an algorithm to mitigate DoC attacks. The algorithm divides the server's capacity for handling capability requests into quotas. Quotas are allocated based on a sink tree architecture.Randomization and Bloom filters are used as tools against threats (attacking scenarios). We both analytically and experimentally show that legitimate hosts can get service with guaranteed probability. We also address issues on fault-tolerance and the deployment of the approach proposed.
|
|
| 3. |
- Ilayperuma, Tharaka, et al.
(författare)
-
Exploring business value models from the inter-organizational collaboration perspective
- 2010
-
Ingår i: Proceedings of the 2010 ACM Symposium on Applied Computing. - New York, NY, USA : ACM. - 9781605586380 ; , s. 99-105
-
Konferensbidrag (refereegranskat)abstract
- From a strategic enterprise perspective, the success of e-services depends on their ability to work as a medium for the exchange of business values. Thus, there is a need to be able to describe and analyze business collaborations in a structured way, in order to identify the needs and appropriate offerings of the participating actors. To model business collaborations, business value models are increasingly used. However, a question remains - how to systematically create value models in order to identify the offerings of the involved actors, while spanning the whole life-cycle of a business collaboration? In this study we propose a method for designing more exploratory business models with a focus to how: (a). consumers classify values, and (b). the values are elicited in different phases of business collaboration life-cycle. A case study from the Swedish health care sector is used to ground and apply the presented method.
|
|
| 4. |
- Lu, Yue, et al.
(författare)
-
Timing Analyzing for Systems with Execution Dependencies between Tasks
- 2010
-
Ingår i: Proceedings of the ACM Symposium on Applied Computing 201. - New York, NY, USA : ACM. - 9781605586380 ; , s. 357-358
-
Konferensbidrag (refereegranskat)abstract
- In this paper, a novel approach to timing analysis of complex real-time systems with intricate execution dependencies between tasks, such as asynchronous message-passing and globally shared state variables, is presented. By applying the method to a model taken from a real robotic control system, we show the benefit, in terms of reduced pessimism, when compared to a combination of standard static WCET analysis and Response-Time Analysis.
|
|
