Open Access. Powered by Scholars. Published by Universities.®

Data Storage Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 301 - 330 of 400

Full-Text Articles in Data Storage Systems

S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang Jul 2014

S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang

School of Computing: Technical Reports

RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) array codes are the most popular erasure codes that can be used for implementing RAID-6, since they enable optimal storage efficiency and efficient encoding and decoding algorithms. In this paper, we propose a new class of MDS array codes called …


Click-Through-Based Cross-View Learning For Image Search, Yingwei Pan, Ting Yao, Tao Mei, Houqiang Li, Chong-Wah Ngo, Yong Rui Jul 2014

Click-Through-Based Cross-View Learning For Image Search, Yingwei Pan, Ting Yao, Tao Mei, Houqiang Li, Chong-Wah Ngo, Yong Rui

Research Collection School Of Computing and Information Systems

One of the fundamental problems in image search is to rank image documents according to a given textual query. Existing search engines highly depend on surrounding texts for ranking images, or leverage the query-image pairs annotated by human labelers to train a series of ranking functions. However, there are two major limitations: 1) the surrounding texts are often noisy or too few to accurately describe the image content, and 2) the human annotations are resourcefully expensive and thus cannot be scaled up. We demonstrate in this paper that the above two fundamental challenges can be mitigated by jointly exploring the …


The Use Of Object-Oriented Programming Concepts For Documenting A Model Ensemble, Georgii A. Alexandrov Jun 2014

The Use Of Object-Oriented Programming Concepts For Documenting A Model Ensemble, Georgii A. Alexandrov

International Congress on Environmental Modelling and Software

The spread of cloud computing services gives community modelling a reasonable opportunity to become a reality in scientific research. However, even if models will be deployed in clouds, and model codes will be open for re-use, there will be little progress in community modelling in the lack of consensus standards for model documentation. This paper is to discuss a conceptual framework for developing such standards. The proposed conceptual framework is based on the idea that a new model is often a modification of an old one, and hence, the similarities between the models of the same environmental process could be …


Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo Jun 2014

Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Organizing video search results in a list view is widely adopted by current commercial search engines, which cannot support efficient browsing for complex search topics that have multiple semantic facets. In this article, we propose to organize video search results in a highly structured way. Specifically, videos are placed on a semantic hierarchy that accurately organizes various facets of a given search topic. To pick the most suitable videos for each node of the hierarchy, we define and utilize three important criteria: relevance, uniqueness, and diversity. Extensive evaluations on a large YouTube video dataset demonstrate the effectiveness of our approach.


A Novel, Tag-Based File-System, Aaron Laursen May 2014

A Novel, Tag-Based File-System, Aaron Laursen

Mathematics, Statistics, and Computer Science Honors Projects

For decades, computer use has largely focused on managing and manipulating files-- creating and consuming media, browsing the web, software development, and even, with such systems as UNIX and Plan$9$, direct device access can largely be reduced to locating, creating, reading, and writing files. To facilitate these operations, developers have created a vast assortment of file-systems, each presenting a unique framework underlying nearly everything people do with a computer.

For various reasons, these file-systems have historically represented only incremental improvements and alterations from their predecessors, leaving the basic design and interaction models relatively unchanged. Because of this, most common file-systems …


Computational-Communicative Actions Of Informational Processing, Florentin Smarandache, Stefan Vladutescu Apr 2014

Computational-Communicative Actions Of Informational Processing, Florentin Smarandache, Stefan Vladutescu

Branch Mathematics and Statistics Faculty and Staff Publications

This study is circumscribed to the Information Science. The zetetic aim of research is double: a) to define the concept of action of informational processing and b) to design a taxonomy of actions of informational processing. First, the investigation trays to demonstrate that the computational actions of informational processing or the informational actions are computational-investigative configurations for structuring information: clusters of highly-aggregated operations which are carried out in a unitary manner operate convergently and behave like a unique computational device. From a methodological point of view, they are comprised within the category of analytical instruments for the informational processing of …


Providing Flexible File-Level Data Filtering For Big Data Analytics, Lei Xu, Ziling Huang, Hong Jiang, Lei Tian, David Swanson Jan 2014

Providing Flexible File-Level Data Filtering For Big Data Analytics, Lei Xu, Ziling Huang, Hong Jiang, Lei Tian, David Swanson

School of Computing: Technical Reports

The enormous amount of big data datasets impose the needs for effective data filtering technique to accelerate the analytics process. We propose a Versatile Searchable File System, VSFS, which provides a transparent, flexible and near real-time file-level data filtering service by searching files directly through the file system. Therefore, big data analytics applications can transparently utilize this filtering service without application modifications. A versatile index scheme is designed to adapt to the exploratory and ad-hoc nature of the big data analytics activities. Moreover, VSFS uses a RAM-based distributed architecture to perform file indexing. The evaluations driven by three real-world analytics …


On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo Jan 2014

On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo

Research Collection School Of Computing and Information Systems

Cloud computing is a novel computing model that enables convenient and on-demand access to a shared pool of configurable computing resources. Auditing services are highly essential to make sure that the data is correctly hosted in the cloud. In this paper, we investigate the active adversary attacks in three auditing mechanisms for shared data in the cloud, including two identity privacy-preserving auditing mechanisms called Oruta and Knox, and a distributed storage integrity auditing mechanism.We show that these schemes become insecure when active adversaries are involved in the cloud storage. Specifically, an active adversary can arbitrarily alter the cloud data without …


Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral Jan 2014

Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of distance between any two m  n matrices. If the distance is 0 or m  n there is nothing interesting. When the distance happens to be a value t; 0 < t < m  n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.


Data Management In Cloud Environments: Nosql And Newsql Data Stores, Katarina Grolinger, Wilson A. Higashino, Abhinav Tiwari, Miriam Am Capretz Dec 2013

Data Management In Cloud Environments: Nosql And Newsql Data Stores, Katarina Grolinger, Wilson A. Higashino, Abhinav Tiwari, Miriam Am Capretz

Electrical and Computer Engineering Publications

: Advances in Web technology and the proliferation of mobile devices and sensors connected to the Internet have resulted in immense processing and storage requirements. Cloud computing has emerged as a paradigm that promises to meet these requirements. This work focuses on the storage aspect of cloud computing, specifically on data management in cloud environments. Traditional relational databases were designed in a different hardware and software era and are facing challenges in meeting the performance and scale requirements of Big Data. NoSQL and NewSQL data stores present themselves as alternatives that can handle huge volume of data. Because of the …


A Simple Integration Of Social Relationship And Text Data For Identifying Potential Customers In Microblogging, Guansong Pang, Shengyi Jiang, Dongyi Chen Dec 2013

A Simple Integration Of Social Relationship And Text Data For Identifying Potential Customers In Microblogging, Guansong Pang, Shengyi Jiang, Dongyi Chen

Research Collection School Of Computing and Information Systems

Identifying potential customers among a huge number of users in microblogging is a fundamental problem for microblog marketing. One challenge in potential customer detection in microblogging is how to generate an accurate characteristic description for users, i.e., user profile generation. Intuitively, the preference of a user’s friends (i.e., the person followed by the user in microblogging) is of great importance to capture the characteristic of the user. Also, a user’s self-defined tags are often concise and accurate carriers for the user’s interests. In this paper, for identifying potential customers in microblogging, we propose a method to generate user profiles via …


Adaptive Computer‐Generated Forces For Simulator‐Based Training, Expert Systems With Applications, Teck-Hou Teng, Ah-Hwee Tan, Loo-Nin Teow Dec 2013

Adaptive Computer‐Generated Forces For Simulator‐Based Training, Expert Systems With Applications, Teck-Hou Teng, Ah-Hwee Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Simulator-based training is in constant pursuit of increasing level of realism. The transition from doctrine-driven computer-generated forces (CGF) to adaptive CGF represents one such effort. The use of doctrine-driven CGF is fraught with challenges such as modeling of complex expert knowledge and adapting to the trainees’ progress in real time. Therefore, this paper reports on how the use of adaptive CGF can overcome these challenges. Using a self-organizing neural network to implement the adaptive CGF, air combat maneuvering strategies are learned incrementally and generalized in real time. The state space and action space are extracted from the same hierarchical doctrine …


Is Real-Time Mobile Content-Based Image Retrieval Feasible?, Colin G. Graber, Anup Mohan, Yung-Hsiang Lu Oct 2013

Is Real-Time Mobile Content-Based Image Retrieval Feasible?, Colin G. Graber, Anup Mohan, Yung-Hsiang Lu

The Summer Undergraduate Research Fellowship (SURF) Symposium

Content-based image retrieval (CBIR) is a method of searching through a database of images by using another image as a query instead of text. Recent advances in the processing power of smart phones and tablets, collectively known as mobile devices, have prompted researchers to attempt to construct mobile CBIR systems. Most of the research that has been conducted on mobile CBIR has focused on improving either its accuracy or its run-time, but not both simultaneously. We set out to answer the question: is real-time CBIR with manageable accuracy possible on current mobile devices? To find the answer to this question, …


Image Search By Graph-Based Label Propagation With Image Representation From Dnn, Yingwei Pan, Yao Ting, Kuiyuan Yang, Houqiang Li, Chong-Wah Ngo, Jingdong Wang, Tao Mei Oct 2013

Image Search By Graph-Based Label Propagation With Image Representation From Dnn, Yingwei Pan, Yao Ting, Kuiyuan Yang, Houqiang Li, Chong-Wah Ngo, Jingdong Wang, Tao Mei

Research Collection School Of Computing and Information Systems

Our objective is to estimate the relevance of an image to a query for image search purposes. We address two limitations of the existing image search engines in this paper. First, there is no straightforward way of bridging the gap between semantic textual queries as well as users’ search intents and image visual content. Image search engines therefore primarily rely on static and textual features. Visual features are mainly used to identify potentially useful recurrent patterns or relevant training examples for complementing search by image reranking. Second, image rankers are trained on query-image pairs labeled by human experts, making the …


Annotation For Free: Video Tagging By Mining User Search Behavior, Yao Ting, Tao Mei, Chong-Wah Ngo, Shipeng Li Oct 2013

Annotation For Free: Video Tagging By Mining User Search Behavior, Yao Ting, Tao Mei, Chong-Wah Ngo, Shipeng Li

Research Collection School Of Computing and Information Systems

The problem of tagging is mostly considered from the perspectives of machine learning and data-driven philosophy. A fundamental issue that underlies the success of these approaches is the visual similarity, ranging from the nearest neighbor search to manifold learning, to identify similar instances of an example for tag completion. The need to searching for millions of visual examples in high-dimensional feature space, however, makes the task computationally expensive. Moreover, the results can suffer from robustness problem, when the underlying data, such as online videos, are rich of semantics and the similarity is difficult to be learnt from low-level features. This …


Error Recovered Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo Oct 2013

Error Recovered Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Hierarchical classification (HC) is a popular and efficient way for detecting the semantic concepts from the images. However, the conventional HC, which always selects the branch with the highest classification response to go on, has the risk of propagating serious errors from higher levels of the hierarchy to the lower levels. We argue that the highestresponse-first strategy is too arbitrary, because the candidate nodes are considered individually which ignores the semantic relationship among them. In this paper, we propose a novel method for HC, which is able to utilize the semantic relationship among candidate nodes and their children to recover …


Web-Scale Near-Duplicate Search: Techniques And Applications, Chong-Wah Ngo, Changsheng Xu, Wessel Kraaij, Abdulmotaleb El Saddik Sep 2013

Web-Scale Near-Duplicate Search: Techniques And Applications, Chong-Wah Ngo, Changsheng Xu, Wessel Kraaij, Abdulmotaleb El Saddik

Research Collection School Of Computing and Information Systems

This paper presents some of the most recent advances in the research on Web-scale near-duplicate search and explores the potential for bringing this research a substantial step further. It contains high-quality contributions addressing various aspects of the Web-scale near-duplicate search problem in a number of relevant domains. The topics range from feature representation, matching, and indexing from different novel aspects to the adaptation of current technologies for mobile media search and photo archaeology mining.


Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang Aug 2013

Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang

Research Collection School Of Computing and Information Systems

The exponential growth of online videos, along with increasing user involvement in video-related activities, has been observed as a constant phenomenon during the last decade. User's time spent on video capturing, editing, uploading, searching, and viewing has boosted to an unprecedented level. The massive publishing and sharing of videos has given rise to the existence of an already large amount of near-duplicate content. This imposes urgent demands on near-duplicate video retrieval as a key role in novel tasks such as video search, video copyright protection, video recommendation, and many more. Driven by its significance, near-duplicate video retrieval has recently attracted …


Click-Boosting Random Walk For Image Search Reranking, Xiaopeng Yang, Yongdong Zhang, Ting Yao, Zheng-Jun Zha, Chong-Wah Ngo Aug 2013

Click-Boosting Random Walk For Image Search Reranking, Xiaopeng Yang, Yongdong Zhang, Ting Yao, Zheng-Jun Zha, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Image reranking is an effective way for improving the retrieval performance of keyword-based image search engines. A fundamental issue underlying the success of existing image reranking approaches is the ability in identifying potentially useful recurrent patterns or relevant training examples from the initial search results. Ideally, these patterns and examples can be leveraged to upgrade the ranks of visually similar images, which are also likely to be relevant. The challenge, nevertheless, originates from the fact that keyword-based queries are used to be ambiguous, resulting in difficulty in predicting the search intention. Mining useful patterns and examples without understanding query is …


Tower Of Babel: A Crowdsourcing Game Building Sentiment Lexicons For Resource-Scarce Languages, Yoonsung Hong, Haewoon Kwak, Youngmin Baek, Sue. Moon May 2013

Tower Of Babel: A Crowdsourcing Game Building Sentiment Lexicons For Resource-Scarce Languages, Yoonsung Hong, Haewoon Kwak, Youngmin Baek, Sue. Moon

Research Collection School Of Computing and Information Systems

With the growing amount of textual data produced by online social media today, the demands for sentiment analysis are also rapidly increasing; and, this is true for worldwide. However, non-English languages often lack sentiment lexicons, a core resource in performing sentiment analysis. Our solution, Tower of Babel (ToB), is a language-independent sentiment-lexicon-generating crowdsourcing game. We conducted an experiment with 135 participants to explore the difference between our solution and a conventional manual annotation method. We evaluated ToB in terms of effectiveness, efficiency, and satisfactions. Based on the result of the evaluation, we conclude that sentiment classification via ToB is accurate, …


Vsfs: A Versatile Searchable File System For Hpc Analytics, Lei Xu, Ziling Huang, Hong Jiang, Lei Tian, David Swanson Apr 2013

Vsfs: A Versatile Searchable File System For Hpc Analytics, Lei Xu, Ziling Huang, Hong Jiang, Lei Tian, David Swanson

School of Computing: Technical Reports

Big-data/HPC analytics applications have urgent needs for file-search services to drastically reduce the scale of the input data to accelerate analytics. Unfortunately, the existing solutions either are poorly scalable for large-scale systems, or lack well-integrated interface to allow applications to easily use them. We propose a distributed searchable file system, VSFS, which provide a novel and flexible POSIX-compatible searchable file system namespace that can be seamlessly integrate with any legacy code without modification. Additionally, to provide real-time indexing and searching performance, VSFS uses DRAM-based distributed consistent hashing ring to manages all file-index. The results of our evaluation show that VSFS …


Predicting Sql Injection And Cross Site Scripting Vulnerabilities Through Mining Input Sanitization Patterns, Lwin Khin Shar, Hee Beng Kuan Tan Apr 2013

Predicting Sql Injection And Cross Site Scripting Vulnerabilities Through Mining Input Sanitization Patterns, Lwin Khin Shar, Hee Beng Kuan Tan

Research Collection School Of Computing and Information Systems

ContextSQL injection (SQLI) and cross site scripting (XSS) are the two most common and serious web application vulnerabilities for the past decade. To mitigate these two security threats, many vulnerability detection approaches based on static and dynamic taint analysis techniques have been proposed. Alternatively, there are also vulnerability prediction approaches based on machine learning techniques, which showed that static code attributes such as code complexity measures are cheap and useful predictors. However, current prediction approaches target general vulnerabilities. And most of these approaches locate vulnerable code only at software component or file levels. Some approaches also involve process attributes that …


Circular Reranking For Visual Search, Ting Yao, Chong-Wah Ngo Apr 2013

Circular Reranking For Visual Search, Ting Yao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Search reranking is regarded as a common way to boost retrieval precision. The problem nevertheless is not trivial especially when there are multiple features or modalities to be considered for search, which often happens in image and video retrieval. This paper proposes a new reranking algorithm, named circular reranking, that reinforces the mutual exchange of information across multiple modalities for improving search performance, following the philosophy that strong performing modality could learn from weaker ones, while weak modality does benefit from interacting with stronger ones. Technically, circular reranking conducts multiple runs of random walks through exchanging the ranking scores among …


Searching Visual Instances With Topology Checking And Context Modeling, Wei Zhang, Chong-Wah Ngo Apr 2013

Searching Visual Instances With Topology Checking And Context Modeling, Wei Zhang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Instance Search (INS) is a realistic problem initiated by TRECVID, which is to retrieve all occurrences of the querying object, location, or person from a large video collection. It is a fundamental problem with many applications, and also a challenging problem different from the traditional concept or near-duplicate (ND) search, since the relevancy is defined at instance level. True responses could exhibit various visual variations, such as being small on the image with different background, or showing a non-homography spatial configuration. Based on the Bag-of-Words model, we propose two techniques tailored for Instance Search. Specifically, we explore the use of …


Semi-Supervised Heterogeneous Fusion For Multimedia Data Co-Clustering, Lei Meng, Ah-Hwee Tan, Dong Xu Mar 2013

Semi-Supervised Heterogeneous Fusion For Multimedia Data Co-Clustering, Lei Meng, Ah-Hwee Tan, Dong Xu

Research Collection School Of Computing and Information Systems

Co-clustering is a commonly used technique for tapping the rich meta-information of multimedia web documents, including category, annotation, and description, for associative discovery. However, most co-clustering methods proposed for heterogeneous data do not consider the representation problem of short and noisy text and their performance is limited by the empirical weighting of the multi-modal features. In this paper, we propose a generalized form of Heterogeneous Fusion Adaptive Resonance Theory, called GHF-ART, for co-clustering of large-scale web multimedia documents. By extending the two-channel Heterogeneous Fusion ART (HF-ART) to multiple channels, GHF-ART is designed to handle multimedia data with an arbitrarily rich …


Dependence On Cyberscribes - Issues In E-Security, Thomas R. Mclean, Alexander B. Mclean Jan 2013

Dependence On Cyberscribes - Issues In E-Security, Thomas R. Mclean, Alexander B. Mclean

Journal of Business & Technology Law

No abstract provided.


Accelerated Data Delivery Architecture, Michael L. Grecol Jan 2013

Accelerated Data Delivery Architecture, Michael L. Grecol

College of Graduate Studies: Theses & Dissertations

This paper introduces the Accelerated Data Delivery Architecture (ADDA). ADDA establishes a framework to distribute transactional data and control consistency to achieve fast access to data, distributed scalability and non-blocking concurrency control by using a clean declarative interface. It is designed to be used with web-based business applications. This framework uses a combination of traditional Relational Database Management System (RDBMS) combined with a distributed Not Only SQL (NoSQL) database and a browser-based database. It uses a single physical and conceptual database schema designed for a standard RDBMS driven application. The design allows the architect to assign consistency levels to entities …


Community As A Connector: Associating Faces With Celebrity Names In Web Videos, Zhineng Chen, Chong-Wah Ngo, Juan Cao, Wei Zhang Nov 2012

Community As A Connector: Associating Faces With Celebrity Names In Web Videos, Zhineng Chen, Chong-Wah Ngo, Juan Cao, Wei Zhang

Research Collection School Of Computing and Information Systems

Associating celebrity faces appearing in videos with their names is of increasingly importance with the popularity of both celebrity videos and related queries. However, the problem is not yet seriously studied in Web video domain. This paper proposes a Community connected Celebrity Name-Face Association approach (CCNFA), where the community is regarded as an intermediate connector to facilitate the association. Specifically, with the names and faces extracted from Web videos, C-CNFA decomposes the association task into a three-step framework: community discovering, community matching and celebrity face tagging. To achieve the goal of efficient name-face association under this umbrella, algorithms such as …


Predicting Domain Adaptivity: Redo Or Recycle?, Ting Yao, Chong-Wah Ngo, Shiai Zhu Nov 2012

Predicting Domain Adaptivity: Redo Or Recycle?, Ting Yao, Chong-Wah Ngo, Shiai Zhu

Research Collection School Of Computing and Information Systems

Over the years, the academic researchers have contributed various visual concept classifiers. Nevertheless, given a new dataset, most researchers still prefer to develop large number of classifiers from scratch despite expensive labeling efforts and limited computing resources. A valid question is why not multimedia community “embrace the green” and recycle off-the-shelf classifiers for new dataset. The difficulty originates from the domain gap that there are many different factors that govern the development of a classifier and eventually drive its performance to emphasize certain aspects of dataset. Reapplying a classifier to an unseen dataset may end up GIGO (garbage in, garbage …


Fashionask: Pushing Community Answers To Your Fingertips, Wei Zhang, Lei Pang, Chong-Wah Ngo Nov 2012

Fashionask: Pushing Community Answers To Your Fingertips, Wei Zhang, Lei Pang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

We demonstrate a multimedia-based question-answering system, named FashionAsk, by allowing users to ask questions referring to pictures snapped by mobile devices. Specifically, instead of asking verbose questions to depict visual instances, direct pictures are provided as part of questions. To answer these multi-modal questions, FashionAsk performs a large-scale instance search to infer the names of instances, and then matches with similar questions from communitycontributed QA websites as answers. The demonstration is conducted on a million-scale dataset of Web images and QA pairs in the domain of fashion products. Asking a multimedia question through FashionAsk can take as short as five …