acm-header
Sign In

Communications of the ACM


111 - 120 of 3,299 for bentley


ICEC '14: Proceedings of the Sixteenth International Conference on Electronic Commerce

Welcome to the International Conference on Electronic Commerce 2014 (ICEC 2014). The theme of ICEC 2014 is E-Commerce and Social Data Analytics. The International Conference on Electronic Commerce (ICEC) is a forum for the exchange of new ideas related to emerging technologies and managerial practices in electronic commerce, IT services and mobile business.The International Conference on Electronic Commerce (ICEC) was found in 1999. Since then, ICEC has been held around the world including Korea, Vienna, Hong Kong, Pittsburgh, Netherlands, China, Canada, Minneapolis, Innsbruck, Taipei, Hawaii, UK, Singapore, and Finland.

https://dl.acm.org/ft_gateway.cfm?id=2617848&dwn=1

Practical performance of Bloom filters and parallel free-text searching

Bloom filter technique of hashing finds several applications, such as in efficient maintenance of differential files, space efficient storage of dictionaries, and parallel free-text searching. The performance of hash transformations with reference to the filter error rate is the focus of this article.

https://dl.acm.org/ft_gateway.cfm?id=67941&dwn=1

Optimizing Pairwise Box Intersection Checking on GPUs for Large-Scale Simulations

Box intersection checking is a common task used in many large-scale simulations. Traditional methods cannot provide fast box intersection checking with large-scale datasets. This article presents a parallel algorithm to perform Pairwise Box Intersection checking on Graphics processing units (PBIG). The PBIG algorithm consists of three phases: planning, mapping and checking. The planning phase partitions the space into small cells, the sizes of which are determined to optimize performance. The mapping phase maps the boxes into the cells. The checking phase examines the box intersections in the same cell. Several performance optimizations, including load-balancing, output data compression/encoding, and pipelined execution, are presented for the PBIG algorithm. The experimental results show that the PBIG algorithm can process large-scale datasets and outperforms three well-performing algorithms.

https://dl.acm.org/ft_gateway.cfm?id=2499918&dwn=1

Bridging among people, places & devices by integrated, ambient and playful socialmedia approaches

Within the last few years the research area of SocialTV has been gaining more and more attraction in academia as well as in industry. Related work helps us to understand the important aspects of designing and evaluating new value adding social services related to a TV centered communication. Nevertheless, the technical infrastructure is growing extremely fast, and more and more options to use rich media are being offered to the user. In light of fast growing technological changes, it is important to explore, understand and support social activities in domestic environments related to rich media use. The workshop addresses a broader scope of Beyond TV approaches and methodological challenges by evaluating these concepts in practise. By using the term Beyond TV we refer to concepts that include the usage of video or TV content with additionally options for social use and enrichments in a multiplicity of different contexts (including cross-platform away from home, ambient and playful ones).

https://dl.acm.org/ft_gateway.cfm?id=1809841&dwn=1

Screen-viewing Practices in Social Virtual Reality

This study reports screen-viewing practices in the social virtual reality platform Altspace, based on immersive observations. We identified what type of content is being watched and how the screen content facilitates, complements, or is the focus of social interactions.

https://dl.acm.org/ft_gateway.cfm?id=3274048&dwn=1

Challenges in Supporting Exploratory Search through Voice Assistants

Voice assistants have been successfully adopted for simple, routine tasks, such as asking for the weather or setting an alarm. However, as people get more familiar with voice assistants, they may increase their expectations for more complex tasks, such as exploratory search --- e.g., "What should I do when I visit Paris with kids? Oh, and ideally not too expensive." Compared to simple search tasks such as "How tall is the Eiffel Tower?", which can be answered with a single-shot answer, the response to exploratory search is more nuanced, especially through voice-based assistants. In this paper, we outline four challenges in designing voice assistants that can better support exploratory search: addressing situationally induced impairments; working with mixed-modal interactions; designing for diverse populations; and meeting users' expectations and gaining their trust. Addressing these challenges is important for developing more "intelligent" voice-based personal assistants.

https://dl.acm.org/ft_gateway.cfm?id=3406152&dwn=1

Voice Assistant Strategies and Opportunities for People with Tetraplegia

To help both designers and people with tetraplegia fully realize the benefts of voice assistant technology, we conducted interviews with fve people with tetraplegia in the home to understand how this population currently uses voice-based interfaces as well as other technologies in their everyday tasks. We found that people with tetraplegia use voice assistants in specifc places, such as in their beds, or when traveling in their wheelchair. In addition, we note the inefciencies for people with tetraplegia when using voice assistance.

https://dl.acm.org/ft_gateway.cfm?id=3354605&dwn=1

Computing the exact arrangement of circles on a sphere, with applications in structural biology: video

The Bentley-Ottmann (BO) algorithm, initially designed to report theintersection points of line-segments in the plane, is the prototypicalsweep-line algorithm. This video presents an extension of the BOalgorithm to the spherical setting, so as to compute the exactarrangement of a collection of circles on a sphere.An application in bio-chemistry, geared towards the investigation ofatomic environments and multi-body interactions in macro-molecules, isalso presented.The reader is referred toRef. [1] for the companion paper of this video.

https://dl.acm.org/ft_gateway.cfm?id=1247088&dwn=1

On finding the closest bitwise matches in a fixed set

In a given large fixed table of bit-vectors, we would like to find, as rapidly as possible, those bit-vectors which have the least Hamming distances from a newly-presented arbitrary bit-vector.

https://dl.acm.org/ft_gateway.cfm?id=103157&dwn=1