Outputs (127)

Efficiently Handling Skew in Outer Joins on Distributed Systems (2014)
Presentation / Conference Contribution
Cheng, L., Kotoulas, S., Ward, T., & Theodoropoulos, T. (2014, May). Efficiently Handling Skew in Outer Joins on Distributed Systems. Presented at 2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, Chicago, IL, USA

Outer joins are ubiquitous in databases and big data systems. The question of how best to execute outer joins in large parallel systems is particularly challenging as real world datasets are characterized by data skew leading to performance issues. A... Read More about Efficiently Handling Skew in Outer Joins on Distributed Systems.

Automated Dynamic Resource Provisioning and Monitoring in Virtualized Large-Scale Datacenter (2014)
Presentation / Conference Contribution
Abar, S., Lemarinier, P., Theodoropoulos, G., & OHare, G. (2014, May). Automated Dynamic Resource Provisioning and Monitoring in Virtualized Large-Scale Datacenter. Presented at 2014 IEEE 28th International Conference on Advanced Information Networking and Applications, Victoria, Victoria, Canada

Infrastructure as a Service (IaaS) is a pay-as-you go based cloud provision model which on demand outsources the physical servers, guest virtual machine (VM) instances, storage resources, and networking connections. This article reports the design an... Read More about Automated Dynamic Resource Provisioning and Monitoring in Virtualized Large-Scale Datacenter.

Skew Bisubmodularity and Valued CSPs (2014)
Journal Article
Huber, A., Krokhin, A., & Powell, R. (2014). Skew Bisubmodularity and Valued CSPs. SIAM Journal on Computing, 43(3), 1064-1084. https://doi.org/10.1137/120893549

An instance of the (finite-)valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, with each function depending on a subset of the variables. The goal... Read More about Skew Bisubmodularity and Valued CSPs.

The ethical and social implications of personalization technologies for e-learning (2014)
Journal Article
Ashman, H., Brailsford, T., Cristea, A., Sheng, Q. Z., Stewart, C., Toms, E. G., & Wade, V. (2014). The ethical and social implications of personalization technologies for e-learning. Information and Management, 51(6), 819-832. https://doi.org/10.1016/j.im.2014.04.003

Personalization in information systems can be considered beneficial but also ethically and socially harmful. Like many other technologies, the uptake of personalization has been rapid, with inadequate consideration given to its effects. Personalizati... Read More about The ethical and social implications of personalization technologies for e-learning.

Cue-based aggregation with a mobile robot swarm: a novel fuzzy-based method (2014)
Journal Article
Arvin, F., Turgut, A. E., Bazyari, F., Arikan, K. B., Bellotto, N., & Yue, S. (2014). Cue-based aggregation with a mobile robot swarm: a novel fuzzy-based method. Adaptive Behavior, 22(3), 189-206. https://doi.org/10.1177/1059712314528009

Aggregation in swarm robotics is referred to as the gathering of spatially distributed robots into a single aggregate. Aggregation can be classified as cue-based or self-organized. In cue-based aggregation, there is a cue in the environment that poin... Read More about Cue-based aggregation with a mobile robot swarm: a novel fuzzy-based method.

Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments (2014)
Journal Article
Liu, E., & Theodoropoulos, G. (2014). Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments. ACM Transactions on Modeling and Computer Simulation, 24(3), Article 15. https://doi.org/10.1145/2567922

Interest management in Distributed Virtual Environments (DVEs) is a data-filtering technique designed to reduce bandwidth consumption and therefore enhances the scalability of the system. This technique usually involves a process called interest matc... Read More about Space-Time Matching Algorithms for Interest Management in Distributed Virtual Environments.

Approximating Fixation Probabilities in the Generalized Moran Process (2014)
Journal Article
Díaz, J., Goldberg, L., Mertzios, G., Richerby, D., Serna, M., & Spirakis, P. (2014). Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica, 69(1), 78-91. https://doi.org/10.1007/s00453-012-9722-7

We consider the Moran process, as generalized by Lieberman et al. (Nature 433:312–316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, an individual is chosen at random with probability pro... Read More about Approximating Fixation Probabilities in the Generalized Moran Process.

Packing bipartite graphs with covers of complete bipartite graphs (2014)
Journal Article
Chalopin, J., & Paulusma, D. (2014). Packing bipartite graphs with covers of complete bipartite graphs. Discrete Applied Mathematics, 168, 40-50. https://doi.org/10.1016/j.dam.2012.08.026

For a set SS of graphs, a perfect SS-packing (SS-factor) of a graph GG is a set of mutually vertex-disjoint subgraphs of GG that each are isomorphic to a member of SS and that together contain all vertices of GG. If GG allows a covering (locally bije... Read More about Packing bipartite graphs with covers of complete bipartite graphs.

On the energy-delay tradeoff and relay positioning of wireless butterfly networks (2014)
Journal Article
Vien, Q. T., Nguyen, H. X., Stewart, B. G., Choi, J., & Tu, W. (2015). On the energy-delay tradeoff and relay positioning of wireless butterfly networks. IEEE Transactions on Vehicular Technology, 64(1), 159-172. https://doi.org/10.1109/TVT.2014.2321229

This paper considers energy-delay tradeoff (EDT) of data transmission in wireless-network-coded butterfly networks (WNCBNs) where two sources convey their data to two destinations with the assistance of a relay employing either physical-layer network... Read More about On the energy-delay tradeoff and relay positioning of wireless butterfly networks.

Mesh Discriminative Features for 3D Steganalysis (2014)
Journal Article
Yang, Y., & Ivrissimtzis, I. (2014). Mesh Discriminative Features for 3D Steganalysis. ACM Transactions on Multimedia Computing, Communications and Applications, 10(3), Article 27. https://doi.org/10.1145/2535555

We propose a steganalytic algorithm for triangle meshes, based on the supervised training of a classifier by discriminative feature vectors. After a normalization step, the triangle mesh is calibrated by one step of Laplacian smoothing and then a fea... Read More about Mesh Discriminative Features for 3D Steganalysis.