Title: Visualizing Uncertainty in Multi-resolution Volumetric Data Using Marching Cubes
Authors: J Ma,D Murphy,M Hayes,G Provan
Abstract: Data sets acquired from complex scientific simulation, high precision engineering experiment and high-speed computer network have been exponentially increased, and visualization and analysis of such large-scale of data sets have been identified as a significant challenge to the visualization com-munity. Over the past years many scientists have made at-tempt to address this problem by proposing various data reduction techniques. Consequently the size of data can be reduced and issues associated to the visualization can be improved (e.g. real-time interaction and visual overload).However, during the process of data reduction, the information of original data sets was approximated and potential errors were introduced. It leads to a new problem with regard to the integrity of the data and might mislead users for incorrect decision making. Therefore in this paper we aim to solve the problem by introducing three novel uncertainty visualization methods, which depict both the multi-resolution(MR) approximations of the original data set and the errors associated with each of its low resolution representations. As a result we faithfully represent the MR data sets and allow users to make suitable decisions from the visual output. We applied our techniques on a data set from medical domain to demonstrate their effectiveness and usability.
Title: Thermal phenomena associated with water transport across a fuel cell membrane: Soret and Dufour effects
Authors: K Glavatskiy a,n , JG Pharoah b , S Kjelstrup
Abstract: We present calculations of the coupling effects that take place when heat and water are transported across a membrane relevant to fuel cells, using the theory of non-equilibrium thermodynamics. Numerical results are given for the Nafeon membrane bounded by surfaces of molecular thickness in contact with water vapor of varying relative humidity. Analytical expressions for thermal effects of water transport are given. We show how reversible heat transport (Dufour effects) can be understood in terms of coupling coefficients (heats of transfers). The sign of the enthalpy of adsorption of water in the membrane determines the sign of the coupling coefficient, the Dufour and Soret effect as well as thermal osmosis effects meaning that the effect can be large at interfaces. Weshow how data presented in the literature can be understood in terms of the presented theory. Using common estimates for transport properties in the membrane and its surface, we ?nd that the more detailed equations predict a 10 30% variation in the heat and mass fluxes as the membrane thickness drops below 1 mm. Analysis of experiments on thermal osmosis suggests that more accurate measurements on the water content as a function of activity are required.
Publish Year: 2013
Published in: Journal of Membrane Science - Science Direct
Title: An artificial bee colony algorithm for the maximally diverse grouping problem
Authors: Francisco J Rodriguez , M Lozano a , C GarcaMartnez b , Jonathan D GonzlezBarrera
Abstract: In this paper, an artificial bee colony algorithm is proposed to solve the maximally diverse grouping problem. This complex optimization problem consists of forming maximally diverse groups with restricted sizes from a given set of elements. The artificial bee colony algorithm is a new swarm intelligence technique based on the intelligent foraging behavior of honeybees. The behavior of this algorithm is determined by two search strategies: an initialization scheme employed to construct initial solutions and a method for generating neighboring solutions. More specifically, the proposed approach employs a greedy constructive method to accomplish the initialization task and also employs different neighborhood operators inspired by the iterated greedy algorithm. In addition, it incorporates an improvement procedure to enhance the intensification capability. Through an analysis of the experimental results, the highly effective performance of the proposed algorithm is shown in comparison to the current state-of-the-art algorithms which address the problem.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Title: A Survey of Ant Colony Optimization-Based Approaches to Routing in Computer Networks
Authors: Peter Janacik Dalimir Orfanus Adrian Wilke
Abstract: Nature has provided an elegant solution for the routing problem millions of years ago, when ant colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has several advantages that are also useful in computer networks: complete distribution, load balancing finding shortest paths with a high probability. Several routing protocols designed for the area of computer networks have made use of this approach, called ant colony optimization. This paper provides first a broad overview of ant colony optimization-based routing protocols, while focusing on four selected approaches in later sections, describing their operation and discussing their properties in detail.
Publish Year: 2013
Published in: ISMS - IEEE
Number of Pages: 6
موضوع: الگوریتم کلونی مورچه‌ها (Ant Colony Algorithm) – مسیریابی هوشمند در شبکه‌های کامپیوتری (Routing in Computer Networks)
Title: Three-stage hybrid-flowshop model for cross-docking
Authors: Adrien Bellanger , Said Hanafl , Christophe Wilbaut
Abstract: This paper deals with the optimization of a cross-docking system. It is modeled as a three-stage hybrid flowshop, in which shipments and orders are represented as batches. The flrst stage corresponds to the receiving docks, the second stage corresponds to the sorting stations, and the third stage corresponds to the shipping docks. The objective of the problem is to flnd a schedule that minimizes the completion time of the latest batch. In order to obtain good quality feasible solutions, we have developed several heuristic schemes depending on the main stage considered, and several rules to order the batches in this stage. Then, we propose a branch-and-bound algorithm that takes into account the decomposition of the problem into three stages. To evaluate the heuristics and to reduce the tree size during the branch-and-bound computation, we also propose lower bounds. Finally, the computational experi- ments are presented to demonstrate the efflciency of our heuristics. The results show that the exact approach can solve instances containing up to 9 10 batches in each stage (i.e., up to 100 jobs). In addition, our heuristics were evaluated over instances with up to 3000 jobs, and they can provide good quality feasible solutions in a few seconds (i.e., less than 2 s per heuristic).
Publish Year: 2013
Published in: Computers & Operations Research - Science Direct
Title: A Secure Authentication Protocol among Mobile Phone and Wireless Sensor Networks
Authors: Ndibanje Bruce, Hoon Jae Lee
Abstract: The interaction between mobile phone and wireless sensor networks has increased these days due to the WSN emergence and its ubiquitous nature. Through cellular network, a user can access gateway of wireless sensor networks and gets the data. This paper proposes a secure authentication protocol where a user is strongly verified before accessing the data. The secure authentication proposed protocol provides many security principles to the users for instance user, mutual authentication, and secure session key establishment. Furthermore, security analysis shows .that the proposed protocol possesses many advantages against popular attacks, and achieves better efficiency at low computation cost.
Publish Year: 2013
Published in: ICACT - IEEE
Number of Pages: 8
موضوع: امنیت شبکه (Network Security) – احراز هویت (Authentication)
Title: Graph Semantic Based Design of XML Data Warehouse: A Conceptual Perspective
Authors: Anirban Sarkar Sankhayan Choudhury Narayan C Debnath
Abstract: This paper has proposed a Graph � semantic based conceptual data model for XML based Data Warehouse (DW) system called GXDW model, to conceptualize the different facets of multidimensional databases which may contain semi- structured data. The model is an extension of object oriented paradigm and defines a set of graph based formal constructs, variety of relationship types with participation constraints. It is accompanied with a rich set of graphical notations those are used to specify the conceptual level design of semi-structured data based DW system. The proposed approach facilitates modeling multidimensional data with the existence of irregular, heterogeneous, partially organized and unordered data set. Moreover, a transformation mechanism also has been proposed for guiding the transformation of GXDW model schema into the related set of XML documents.
Title: Reconstructing a Fragmented Face from a Cryptographic Identification Protocol
Authors: Andy Luong, Michael Gerbush, Brent Waters, Kristen Grauman
Abstract: Secure Computation of Face Identification (SCiFI) [20]is a recently developed secure face recognition system that ensures the list of faces it can identify (e.g., a terrorist watch list) remains private. In this work, we study the consequences of malformed input attacks on the system-from both a security and computer vision standpoint. In particular, we present 1) a cryptographic attack that allows dishonest user to undetectably obtain a coded representation of faces on the list, and 2) a visualization approach that exploits this breach, turning the lossy recovered codes into human-identifiable face sketches. We evaluate our approach on two challenging datasets, with face identification tasks given to a computer and human subjects. Whereas prior work considered security in the setting of honest in-puts and protocol execution, the success of our approach underscores the risk posed by malicious adversaries to to-days automatic face recognition systems.
Title: Online Advertising and its Security and Privacy Concerns
Authors: Angelia, Davar Pishva
Abstract: Commercial advertising has greatly benefitted from Internet services and online advertising can even be considered as the foundation of web economy. However, despite the availability of many books on how to create, use and make profit from online advertisement; there is little in-depth study on its true nature, security and privacy concerns. Through this research, the authors were able to establish an in-depth understanding of online advertising by collecting and analyzing numerous data on online advertising, with the hope that it could serve as a basis for further study on the field. The authors have also examined the security and privacy concerns of online advertising and the various gimmicks used to victimize innocent people. On the positive side, the paper explains the attractiveness of free online advertising services and the mechanism though which website owners profit from hosting online advertisements despite the fact that neither advertisers nor users pay for the services. On the negative side, the paper shows how online advertising hosts could be victimized by some shroud users for their money making purposes by continuous clicking of online advertisements without any intention of purchase. It also cites cases in which some website owners have marketed users_ private information behind the scene. The paper concludes by highlighting pros and cons of online advertising, Le., despite its numerous advantages, such as efficiency and range, it presents many dangers to advertisers, providers, website owners, and users.
Abstract: E-commerce web sites typically have large fluctuations in their IT resource usage, while rapid elasticity is an essential characteristic of cloud computing. These characteristics make the cloud a good fit for hosting e-commerce web sites. Cloud providers deploy their cloud in their data centers. However, cloud providers usually have a limited number of data center locations around the world. Thus, e-commerce web sites in the cloud may be far away from their customers. Long client-perceived response latency may cause e-commerce web sites to lose business. To solve this problem, we propose a virtual proxy solution to reduce the response latency of the e-commerce site in the cloud. In our approach, a virtual proxy platform is designed to cache applications and data of e-commerce sites. A k-means based table partitioning algorithm is designed to select frequently used data from the database in the cloud. We have used an industrial e-commerce benchmark TPC-W to evaluate the performance of our approach. The experimental results show that our approach can significantly reduce the client-perceived response time.
تبادل
لینک هوشمند
برای تبادل
لینک ابتدا ما
را با عنوان
دانلود مقاله ISI
و آدرس
downloadpaperisi.LXB.ir
لینک
نمایید سپس
مشخصات لینک
خود را در زیر
نوشته . در صورت
وجود لینک ما در
سایت شما
لینکتان به طور
خودکار در سایت
ما قرار میگیرد.
خبرنامه وب سایت:
آمار
وب سایت:
بازدید امروز : 1
بازدید دیروز : 0
بازدید هفته : 8
بازدید ماه : 2661
بازدید کل : 304091
تعداد مطالب : 143
تعداد نظرات : 1
تعداد آنلاین : 1
تبادل
لینک هوشمند
خبرنامه وب سایت:
آمار
وب سایت: